provides a templatized double-linked list
More...
#include <value_sem_list.h>
|
class | VDKValueListIterator< T > |
|
provides a templatized double-linked list
- Overview
- VDKValueList has a value semantic, so all managed object are copied from original ones values. VDKValueList can manage all T type object provided that:
- T t has a default constructor: T::T()
- T t has a copy initializer: T::T(T& t)
- T t has an assignement operator: T& T::operator=(T& t)
- T t has an equality operator: int T::operator==(T& t)
- T t has a less-than operator: int T::operator<(T& t)
- Implementation notes
- I suggest to use typedef's like:
◆ VDKValueList() [1/2]
VDKValueList::VDKValueList |
( |
| ) |
|
|
inline |
Constructor makes an empty list
◆ VDKValueList() [2/2]
◆ ~VDKValueList()
VDKValueList::~VDKValueList |
( |
| ) |
|
|
virtual |
◆ add()
void VDKValueList::add |
( |
const T & |
t | ) |
|
◆ at()
int VDKValueList::at |
( |
T & |
t | ) |
|
Returns ordinal position of an element
◆ find()
T * VDKValueList::find |
( |
T & |
t | ) |
|
membership operator Returns T* NULL if not found
◆ flush()
void VDKValueList::flush |
( |
| ) |
|
◆ insert()
int VDKValueList::insert |
( |
const T & |
t, |
|
|
bool |
unique = false |
|
) |
| |
Insert in order
- Parameters
-
unique | if true denies duplicate key |
◆ operator=()
◆ operator[]()
T & VDKValueList::operator[] |
( |
int |
n | ) |
|
◆ push()
void VDKValueList::push |
( |
const T & |
t | ) |
|
◆ size()
int VDKValueList::size |
( |
| ) |
|
|
inline |
◆ unlink()
bool VDKValueList::unlink |
( |
int |
ndx | ) |
|
Unlink an element form list
- Parameters
-
ndx | ordinal position of the element to be removed |
The documentation for this class was generated from the following file: