#include <XnQueueT.h>
◆ Base
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
◆ XnQueueT() [1/2]
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
◆ XnQueueT() [2/2]
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
◆ ~XnQueueT()
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
◆ Begin() [1/2]
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
An iterator to the first entry of the list (non-const version)
◆ Begin() [2/2]
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
An iterator to the first entry of the list (const version)
◆ End() [1/2]
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
An iterator 1to the end of the list (non-const version). This position is invalid.
◆ End() [2/2]
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
An iterator to the end of the list (const version). This position is invalid.
◆ IsEmpty()
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
XnBool XnListT< T, TAlloc >::IsEmpty |
( |
| ) |
const |
|
inline |
◆ operator=()
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
◆ Pop()
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
◆ Push()
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
◆ Size()
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
XnUInt32 XnListT< T, TAlloc >::Size |
( |
| ) |
const |
|
inline |
Gets the current size of the list
◆ Top() [1/2]
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
◆ Top() [2/2]
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T>>
T const & XnQueueT< T, TAlloc >::Top |
( |
| ) |
const |
|
inline |
The documentation for this class was generated from the following file: