| Clear() | xiiDequeBase< T, Construct > | |
| Compact() | xiiDequeBase< T, Construct > | |
| const_iterator typedef (defined in xiiDequeBase< T, Construct >) | xiiDequeBase< T, Construct > | |
| const_reverse_iterator typedef (defined in xiiDequeBase< T, Construct >) | xiiDequeBase< T, Construct > | |
| Contains(const T &value) const | xiiDequeBase< T, Construct > | |
| EnsureCount(xiiUInt32 uiCount) | xiiDequeBase< T, Construct > | |
| ExpandAndGetRef() | xiiDequeBase< T, Construct > | inline |
| GetAllocator() const | xiiDequeBase< T, Construct > | inline |
| GetContiguousRange(xiiUInt32 uiStartIndex) const | xiiDequeBase< T, Construct > | inline |
| GetCount() const | xiiDequeBase< T, Construct > | |
| GetHeapMemoryUsage() const | xiiDequeBase< T, Construct > | |
| IndexOf(const T &value, xiiUInt32 uiStartIndex=0) const | xiiDequeBase< T, Construct > | |
| InsertAt(xiiUInt32 uiIndex, const T &value) | xiiDequeBase< T, Construct > | |
| IsEmpty() const | xiiDequeBase< T, Construct > | |
| iterator typedef (defined in xiiDequeBase< T, Construct >) | xiiDequeBase< T, Construct > | |
| LastIndexOf(const T &value, xiiUInt32 uiStartIndex=xiiInvalidIndex) const | xiiDequeBase< T, Construct > | |
| operator=(const xiiDequeBase< T, Construct > &rhs) | xiiDequeBase< T, Construct > | protected |
| operator=(xiiDequeBase< T, Construct > &&rhs) | xiiDequeBase< T, Construct > | protected |
| operator==(const xiiDequeBase< T, Construct > &rhs) const | xiiDequeBase< T, Construct > | |
| operator[](xiiUInt32 uiIndex) | xiiDequeBase< T, Construct > | inline |
| operator[](xiiUInt32 uiIndex) const | xiiDequeBase< T, Construct > | inline |
| PeekBack() const | xiiDequeBase< T, Construct > | |
| PeekBack() | xiiDequeBase< T, Construct > | |
| PeekFront() const | xiiDequeBase< T, Construct > | |
| PeekFront() | xiiDequeBase< T, Construct > | |
| PopBack(xiiUInt32 uiElements=1) | xiiDequeBase< T, Construct > | inline |
| PopFront(xiiUInt32 uiElements=1) | xiiDequeBase< T, Construct > | inline |
| PushBack() | xiiDequeBase< T, Construct > | inline |
| PushBack(const T &element) | xiiDequeBase< T, Construct > | inline |
| PushBack(T &&value) | xiiDequeBase< T, Construct > | |
| PushFront(const T &element) | xiiDequeBase< T, Construct > | inline |
| PushFront(T &&element) | xiiDequeBase< T, Construct > | |
| PushFront() | xiiDequeBase< T, Construct > | inline |
| RemoveAndCopy(const T &value) | xiiDequeBase< T, Construct > | |
| RemoveAndSwap(const T &value) | xiiDequeBase< T, Construct > | |
| RemoveAtAndCopy(xiiUInt32 uiIndex) | xiiDequeBase< T, Construct > | |
| RemoveAtAndSwap(xiiUInt32 uiIndex) | xiiDequeBase< T, Construct > | |
| Reserve(xiiUInt32 uiCount) | xiiDequeBase< T, Construct > | |
| reverse_iterator typedef (defined in xiiDequeBase< T, Construct >) | xiiDequeBase< T, Construct > | |
| SetCount(xiiUInt32 uiCount) | xiiDequeBase< T, Construct > | |
| SetCountUninitialized(xiiUInt32 uiCount) | xiiDequeBase< T, Construct > | |
| Sort(const Comparer &comparer) | xiiDequeBase< T, Construct > | |
| Sort() | xiiDequeBase< T, Construct > | |
| Swap(xiiDequeBase< T, Construct > &other) | xiiDequeBase< T, Construct > | |
| xiiDequeBase(xiiAllocatorBase *pAllocator) | xiiDequeBase< T, Construct > | explicitprotected |
| xiiDequeBase(const xiiDequeBase< T, Construct > &rhs, xiiAllocatorBase *pAllocator) | xiiDequeBase< T, Construct > | protected |
| xiiDequeBase(xiiDequeBase< T, Construct > &&rhs, xiiAllocatorBase *pAllocator) | xiiDequeBase< T, Construct > | protected |
| ~xiiDequeBase() | xiiDequeBase< T, Construct > | protected |
1.13.2