This is the generic list class that everything else is built on top of
![]() | const_iterator |
![]() | const_pointer |
![]() | const_reference |
![]() | const_reverse_iterator |
![]() | difference_type |
![]() | iterator |
![]() | pointer |
![]() | reference |
![]() | reverse_iterator |
![]() | size_type |
![]() | value_type |
![]() | AddToEnd (T k) |
![]() | AddToEnd (List |
![]() | AlterCurrent (T k) |
![]() | AtEnd () const |
![]() | AtStart () const |
![]() | Current () |
![]() | FreeList () |
![]() | Insert (List |
![]() | Insert (T k) |
![]() | InsertAfter (List |
![]() | InsertAfter (T k) |
![]() | Last () const |
![]() | Length () const |
![]() | List () |
![]() | List (const vector |
![]() | List (const List |
![]() | Lookup (T k) |
![]() | MemorizeCurrent () |
![]() | Next () |
![]() | operator = (const List |
![]() | Prev () |
![]() | RemoveCurrent () |
![]() | Reset () |
![]() | RestoreCurrent () |
![]() | SeekTo ( T obj ) |
![]() |
| ||||||||||||||||||||||||||||||
![]() |
|
This is the generic list class that everything else is built on top of. Originally this was a linked list implementation, but that became cumbersome, so now it is a STL vector with some interface functions to envelope this fact. These interface functions are mostly there to just support backward compatability with older code that uses this class like it was a linked list.Any of the methods listed here should be considered DEPRECIATED and therefore not to be used by any new programs writted from scratch.
For any new software written for this class, please restrict yourself to using this List class as if it were a STL vector class, and manipulate it that way.
List(const List
List(const vector
void AddToEnd(T k)
void Insert(T k)
void InsertAfter(T k)
void AddToEnd(List
void Insert(List
void InsertAfter(List
void FreeList()
void RemoveCurrent()
void AlterCurrent(T k)
void MemorizeCurrent()
void RestoreCurrent()
int Length() const
bool Lookup(T k)
bool SeekTo( T obj )
void Reset()
void Next()
void Prev()
bool AtEnd() const
bool AtStart() const
T Current()
T Last() const
List& operator = (const List
typedef T value_type
typedef value_type* pointer
typedef const value_type* const_pointer
typedef value_type& reference
typedef const value_type& const_reference
typedef size_t size_type
typedef size_t difference_type
typedef vector
typedef vector
typedef vector
typedef vector
iterator begin()
iterator end()
reverse_iterator rbegin()
reverse_iterator rend()
const_iterator begin() const
const_iterator end() const
size_t size() const
bool empty() const
T& operator[]( size_type n )
iterator insert( iterator pos, const T& x )
void insert( iterator pos, value_type *first, value_type *last )
void insert( iterator pos, size_type n, const T& x)
alphabetic index hierarchy of classes
generated by doc++