Add(T in_key) | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
AddLast() | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
AddLast(const T & in_rItem) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
AddNoSetKey(T in_key) | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
AddNoSetKey(T in_key, bool &out_bFound) | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
AkArray() | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Alloc(size_t in_uSize) | AkArrayAllocatorNoAlign< T_MEMID > | inlinestatic |
base typedef | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | |
Begin() const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
BinarySearch(T in_key, bool &out_bFound) const | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > >::BinarySearch(const T & in_Item) const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Contains(T in_item) const | AkSet< T, U_POOL, uGrowBy, TMovePolicy, TComparePolicy > | inline |
Copy(const AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > &in_rSource) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Data() const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
End() const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Equal(const T &a, const T &b) const | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
Erase(Iterator &in_rIter) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Erase(unsigned int in_uIndex) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
EraseSwap(Iterator &in_rIter) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
EraseSwap(unsigned int in_uIndex) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Exists(T in_key) const | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > >::Exists(const T & in_Item) const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
FindEx(const T & in_Item) const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Free(void *in_pAddress) | AkArrayAllocatorNoAlign< T_MEMID > | inlinestatic |
GetIndex(T *in_pItem) const | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
GrowArray() | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
GrowArray(AkUInt32 in_uGrowBy) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Insert(Iterator &in_rIter) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Insert(unsigned int in_uIndex) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
IsEmpty() const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
IsGrowingAllowed() const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Iterator typedef | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | |
Last() | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Length() const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Lesser(const T &a, const T &b) const | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
LowerBounds(T in_key) const | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
LowerBounds(T in_key, Iterator in_from, Iterator in_to) const | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
m_pItems | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | protected |
m_uLength | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | protected |
m_ulReserved | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | protected |
operator[](unsigned int uiIndex) const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
ReAlloc(void *in_pCurrent, size_t in_uOldSize, size_t in_uNewSize) | AkArrayAllocatorNoAlign< T_MEMID > | inlinestatic |
Remove(const T & in_rItem) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
RemoveAll() | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
RemoveLast() | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
RemoveSwap(const T & in_rItem) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Reorder(T in_OldKey, T in_NewKey, const T &in_item) | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
Reserve(AkUInt32 in_ulReserve) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Reserved() const | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
ReserveExtra(AkUInt32 in_ulReserve) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Resize(AkUInt32 in_uiSize) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
ReSortArray() | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
Set(T in_key) | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
Set(T in_key, bool &out_bExists) | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
SortedUpdate(AkUInt32 in_numUpdates, const T_UPDATE *in_pUpdates, FN_EXISTS in_fnExists, FN_NEW in_fnNew, FN_OLD in_fnOld) | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
Swap(T *in_ItemA, T *in_ItemB) | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
Term() | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
Transfer(AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > &in_rSource) | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |
TransferMem(void *&io_pDest, AkArrayAllocatorNoAlign< T_MEMID > in_srcAlloc, void *in_pSrc) | AkArrayAllocatorNoAlign< T_MEMID > | inlinestatic |
Unset(T in_key) | AkSortedKeyArray< T, T, ArrayPoolDefault, AkSetGetKey< T >, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T >, AkDefaultSortedKeyCompare< T > > | inline |
~AkArray() | AkArray< T, const T &, ArrayPoolDefault, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > | inline |