Add(T in_key) |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
AddLast() |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
AddLast(const T & in_rItem) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
AddNoSetKey(T in_key) |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
AkArray() |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Begin() const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
BinarySearch(T in_key, bool &out_bFound) const |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > >::BinarySearch(const T & in_Item) const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Contains(T in_item) const |
AkSet< T, U_POOL, uGrowBy > |
inline |
Copy(const AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > &in_rSource) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Data() const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
End() const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Equal(T &a, T &b) const |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
Erase(Iterator &in_rIter) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Erase(unsigned int in_uIndex) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
EraseSwap(Iterator &in_rIter) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Exists(T in_key) const |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > >::Exists(const T & in_Item) const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
FindEx(const T & in_Item) const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
GrowArray(AkUInt32 in_uGrowBy=TGrowBy) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Insert(unsigned int in_uIndex) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
IsEmpty() const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Last() |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Length() const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Lesser(T &a, T &b) const |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
m_pItems |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
protected |
m_uLength |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
protected |
m_ulReserved |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
protected |
operator[](unsigned int uiIndex) const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Remove(const T & in_rItem) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
RemoveAll() |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
RemoveLast() |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
RemoveSwap(const T & in_rItem) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Reorder(T in_OldKey, T in_NewKey, const T &in_item) |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
Reserve(AkUInt32 in_ulReserve) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Reserved() const |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Resize(AkUInt32 in_uiSize) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
ReSortArray() |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
Set(T in_key) |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
Set(T in_key, bool &out_bExists) |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
Swap(T *in_ItemA, T *in_ItemB) |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
Term() |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Transfer(AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > &in_rSource) |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |
Unset(T in_key) |
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, 1 > |
inline |
~AkArray() |
AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > |
inline |