List of events
enum | state State of the event list
|
typedef std::vector <Event> | eventlist Event list basic type |
typedef eventlist::value_type | value_type Value type |
typedef eventlist::size_type | size_type Size type |
typedef eventlist::difference_type | difference_type Difference type |
typedef eventlist::reference | reference Reference type |
typedef eventlist::const_reference | const_reference Const reference type |
typedef eventlist::pointer | pointer Pointer type |
typedef eventlist::const_pointer | const_pointer Const pointer type |
typedef Iterator | iterator Iterator |
typedef ConstIterator | const_iterator Const iterator |
typedef ReverseIterator | reverse_iterator Iterator |
typedef ConstReverseIterator | const_reverse_iterator Const iterator |
List () Default constructor | |
explicit | List (const char* filename, bool keepforever = true) Constructor |
List* | Copy () const Copy the event |
int | Size () const Size |
bool | Empty () const Empty |
int | MaxSize () const Maximum Size |
int | Capacity () const Capacity |
void | Reserve (size_type num) Capacity |
bool | operator== (const List& l) const Equality |
bool | operator!= (const List& l) const Equality |
bool | CheckOrder () const Check order |
void | Swap (List& l) Swap |
iterator | LowerBound (const Time& t) Lower bound |
const_iterator | LowerBound (const Time& t) const Lower bound |
iterator | UpperBound (const Time& t) Upper bound |
const_iterator | UpperBound (const Time& t) const Upper bound |
iterator | LowerBound (const Event& t) Lower bound |
const_iterator | LowerBound (const Event& t) const Lower bound |
iterator | UpperBound (const Event& t) Upper bound |
const_iterator | UpperBound (const Event& t) const Upper bound |
void | Sort () Sort |
void | Sort (const Function& func, bool ascending = true) Sort |
reference | At (size_type idx) At |
const_reference | At (size_type idx) const At |
reference | operator[] (size_type idx) Operator[] |
const_reference | operator[] (size_type idx) const Operator[] |
reference | Front () Front |
const_reference | Front () const Front |
reference | Back () Back |
const_reference | Back () const Back |
iterator | Begin () Begin |
const_iterator | Begin () const Begin |
iterator | End () End |
const_iterator | End () const End |
reverse_iterator | RBegin () RBegin |
const_reverse_iterator | RBegin () const RBegin |
reverse_iterator | REnd () REnd |
const_reverse_iterator | REnd () const REnd |
iterator | Insert (const Event& event) Add |
iterator | Insert (const iterator& pos, const Event& event) Add |
void | Insert (const iterator& beg, const iterator& end) Add |
void | PushBack (const Event& event) PushBack |
iterator | Erase (const iterator& pos) Erase |
iterator | Erase (const iterator& beg, const iterator& end) Erase |
void | PopBack () PopBack |
void | Clear () Clear |
state | GetState () const Get the state |
bool | Load (bool keepforever = true) Load |
bool | Load (const char* filename, bool keepforever = true) Load |
bool | Unload () Unload |
bool | Save (const char* filename) const Save |
void | SetFilename (const char* filename) Set the filename |
const char* | GetFilename () const Get the filename |
An event list contains a series of events. An event list is sorted in time. An event list has the following four states: (1) Empty: An empty list contains nothing and has not been loaded from file; (2) Loaded: A loaded event list has been read from file and is still in its original state (meaning it can be unloaded again); (3) Locked: A locked event list is loaded but can not be discared; and (4) Modified: The event list was modified by the user (meaning it can not be unloaded).An event list contains events ordered by time with the oldest event being stored first. For efficiency reasons List provides algorithms which let you add events without checking that they are in correct orderer. In this case the user has to guarantee that the sort order is maintained, or call the Sort method afterwards.
keepforever - Load and lock in memory if true
keepforever - Load and lock in memory if true
alphabetic index hierarchy of classes
Please send questions and comments to sigg_d@ligo-wa.caltech.edu
generated by doc++