![]() |
OpenNI 1.5.4
|
#include <XnListT.h>
Classes | |
class | ConstIterator |
class | Iterator |
Public Types | |
typedef XnLinkedNodeT< T > | LinkedNode |
typedef T | TValue |
typedef TAlloc | TAllocator |
Public Member Functions | |
XnListT () | |
XnListT (const XnListT &other) | |
XnListT & | operator= (const XnListT &other) |
~XnListT () | |
Iterator | Begin () |
ConstIterator | Begin () const |
Iterator | End () |
ConstIterator | End () const |
Iterator | ReverseBegin () |
ConstIterator | ReverseBegin () const |
Iterator | ReverseEnd () |
ConstIterator | ReverseEnd () const |
XnStatus | AddAfter (ConstIterator where, T const &value) |
XnStatus | AddBefore (ConstIterator where, T const &value) |
XnStatus | AddFirst (T const &value) |
XnStatus | AddLast (T const &value) |
ConstIterator | Find (T const &value) const |
Iterator | Find (T const &value) |
XnStatus | Remove (ConstIterator where) |
XnStatus | Remove (T const &value) |
XnStatus | Clear () |
XnBool | IsEmpty () const |
XnUInt32 | Size () const |
void | CopyTo (T *pArray) const |
Protected Member Functions | |
XnStatus | InsertAfter (LinkedNode *pAfter, T const &val) |
Protected Attributes | |
LinkedNode | m_anchor |
XnUInt32 | m_nSize |
A linked list.
T | The type of value in the list |
TAlloc | [Optional] A class for allocating and deallocating nodes in the list. The allocator must have two static methods: Allocate() and Deallocate(). |
typedef XnLinkedNodeT<T> XnListT< T, TAlloc >::LinkedNode |
typedef TAlloc XnListT< T, TAlloc >::TAllocator |
typedef T XnListT< T, TAlloc >::TValue |
|
inline |
|
inline |
|
inline |
|
inline |
Add a new value after the object pointed to by the iterator
where | [in] iterator to the position after which to add the new value |
value | [in] The value to add to the list |
|
inline |
Add a new value before the object pointed to by the iterator
where | [in] iterator to the position before which to add the new value |
value | [in] The value to add to the list |
|
inline |
Add a new value at the beginning of list
value | [in] The value to add to the head of the list |
|
inline |
Add a new value at the end of the list
value | [in] The value to add to the tail of the list |
|
inline |
An iterator to the first entry of the list (non-const version)
|
inline |
An iterator to the first entry of the list (const version)
|
inline |
Remove all entries from the list
|
inline |
Copies all values in the list to an array.
pArray | A pre-allocated array that values should be copied to. The allocation size can be determined using Size(). |
|
inline |
An iterator 1to the end of the list (non-const version). This position is invalid.
|
inline |
An iterator to the end of the list (const version). This position is invalid.
|
inline |
Get an iterator pointing to a value in the list.
value | [in] The searched value |
|
inline |
Get an iterator pointing to a value in the list.
value | [in] The searched value |
|
inlineprotected |
Add a new value to the list
pAfter | [in] The node after which to add the new value |
val | [in] The value to add to the list |
|
inline |
Check if list is empty
|
inline |
|
inline |
Remove a value from the list
where | [in] Iterator pointing to an entry in the list |
|
inline |
Removes the first occurrence of a value from the list
value | [in] The value to be removed |
|
inline |
An iterator to the last entry of the list (non-const version)
|
inline |
An iterator to the last entry of the list (const version)
|
inline |
An iterator to the beginning of the list (non-const version). This position is invalid.
|
inline |
An iterator to the beginning of the list (const version). This position is invalid.
|
inline |
Gets the current size of the list
|
protected |
|
protected |