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