namespace events class List List of events
| | state State of the event list
|
| | eventlist Event list basic type |
| | value_type Value type |
| | size_type Size type |
| | difference_type Difference type |
| | reference Reference type |
| | const_reference Const reference type |
| | pointer Pointer type |
| | const_pointer Const pointer type |
| | iterator Iterator |
| | const_iterator Const iterator |
| | reverse_iterator Iterator |
| | const_reverse_iterator Const iterator |
| | List () Default constructor |
| | List (const char* filename, bool keepforever = true) Constructor |
| | Copy () const Copy the event |
| | Size () const Size |
| | Empty () const Empty |
| | MaxSize () const Maximum Size |
| | Capacity () const Capacity |
| | Reserve (size_type num) Capacity |
| | operator== (const List& l) const Equality |
| | operator!= (const List& l) const Equality |
| | CheckOrder () const Check order |
| | Swap (List& l) Swap |
| | LowerBound (const Time& t) Lower bound |
| | LowerBound (const Time& t) const Lower bound |
| | UpperBound (const Time& t) Upper bound |
| | UpperBound (const Time& t) const Upper bound |
| | LowerBound (const Event& t) Lower bound |
| | LowerBound (const Event& t) const Lower bound |
| | UpperBound (const Event& t) Upper bound |
| | UpperBound (const Event& t) const Upper bound |
| | Sort () Sort |
| | Sort (const Function& func, bool ascending = true) Sort |
| | At (size_type idx) At |
| | At (size_type idx) const At |
| | operator[] (size_type idx) Operator[] |
| | operator[] (size_type idx) const Operator[] |
| | Front () Front |
| | Front () const Front |
| | Back () Back |
| | Back () const Back |
| | Begin () Begin |
| | Begin () const Begin |
| | End () End |
| | End () const End |
| | RBegin () RBegin |
| | RBegin () const RBegin |
| | REnd () REnd |
| | REnd () const REnd |
| | Insert (const Event& event) Add |
| | Insert (const iterator& pos, const Event& event) Add |
| | Insert (const iterator& beg, const iterator& end) Add |
| | PushBack (const Event& event) PushBack |
| | Erase (const iterator& pos) Erase |
| | Erase (const iterator& beg, const iterator& end) Erase |
| | PopBack () PopBack |
| | Clear () Clear |
| | GetState () const Get the state |
| | Load (bool keepforever = true) Load |
| | Load (const char* filename, bool keepforever = true) Load |
| | Unload () Unload |
| | Save (const char* filename) const Save |
| | SetFilename (const char* filename) Set the filename |
| | 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.
typedef eventlist::value_type value_type
typedef eventlist::size_type size_type
typedef eventlist::difference_type difference_type
typedef eventlist::reference reference
typedef eventlist::const_reference const_reference
typedef eventlist::pointer pointer
typedef eventlist::const_pointer const_pointer
typedef Iterator iterator
typedef ConstIterator const_iterator
typedef ReverseIterator reverse_iterator
typedef ConstReverseIterator const_reverse_iterator
List()
explicit List(const char* filename, bool keepforever = true)
keepforever - Load and lock in memory if true
List* Copy() const
int Size() const
bool Empty() const
int MaxSize() const
int Capacity() const
void Reserve(size_type num)
bool operator== (const List& l) const
bool operator!= (const List& l) const
bool CheckOrder() const
void Swap(List& l)
iterator LowerBound(const Time& t)
const_iterator LowerBound(const Time& t) const
iterator UpperBound(const Time& t)
const_iterator UpperBound(const Time& t) const
iterator LowerBound(const Event& t)
const_iterator LowerBound(const Event& t) const
iterator UpperBound(const Event& t)
const_iterator UpperBound(const Event& t) const
void Sort()
void Sort(const Function& func, bool ascending = true)
reference At(size_type idx)
const_reference At(size_type idx) const
reference operator[] (size_type idx)
const_reference operator[] (size_type idx) const
reference Front()
const_reference Front() const
reference Back()
const_reference Back() const
iterator Begin()
const_iterator Begin() const
iterator End()
const_iterator End() const
reverse_iterator RBegin()
const_reverse_iterator RBegin() const
reverse_iterator REnd()
const_reverse_iterator REnd() const
iterator Insert(const Event& event)
iterator Insert(const iterator& pos, const Event& event)
void Insert(const iterator& beg, const iterator& end)
void PushBack(const Event& event)
iterator Erase(const iterator& pos)
iterator Erase(const iterator& beg, const iterator& end)
void PopBack()
void Clear()
state GetState() const
bool Load(bool keepforever = true)
bool Load(const char* filename, bool keepforever = true)
keepforever - Load and lock in memory if true
bool Unload()
bool Save(const char* filename) const
alphabetic index hierarchy of classes
Please send questions and comments to sigg_d@ligo-wa.caltech.edu
generated by doc++