Table of Contents

AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > Member List

This is the complete list of members for AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy >, including all inherited members.
Add(T_KEY in_key) AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
AddLast() AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
AddLast(const T_ITEM &in_rItem) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
AddNoSetKey(T_KEY in_key) AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
AkArray() AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Begin() const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
BinarySearch(T_KEY in_key, bool &out_bFound) const AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy >::BinarySearch(const T_ITEM &in_Item) const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Copy(const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > &in_rSource) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Data() const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
End() const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Erase(Iterator &in_rIter) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Erase(unsigned int in_uIndex) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
EraseSwap(Iterator &in_rIter) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Exists(T_KEY in_key) const AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy >::Exists(const T_ITEM &in_Item) const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
FindEx(const T_ITEM &in_Item) const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Greater(T_KEY &a, T_KEY &b) const AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
GrowArray(AkUInt32 in_uGrowBy=TGrowBy) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Insert(unsigned int in_uIndex) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
IsEmpty() const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Last() AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Length() const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Lesser(T_KEY &a, T_KEY &b) const AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
m_pItems AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [protected]
m_uLength AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [protected]
m_ulReserved AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [protected]
operator[](unsigned int uiIndex) const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Remove(const T_ITEM &in_rItem) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
RemoveAll() AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
RemoveLast() AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
RemoveSwap(const T_ITEM &in_rItem) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Reorder(T_KEY in_OldKey, T_KEY in_NewKey, const T_ITEM &in_item) AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
Reserve(AkUInt32 in_ulReserve) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Reserved() const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Resize(AkUInt32 in_uiSize) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
ReSortArray() AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
Set(T_KEY in_key) AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
Set(T_KEY in_key, bool &out_bExists) AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
Swap(T_ITEM *in_ItemA, T_ITEM *in_ItemB) AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
Term() AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Transfer(AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > &in_rSource) AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]
Unset(T_KEY in_key) AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > [inline]
~AkArray() AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > [inline]