Table of Contents

AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy > Class Template Reference

Inheritance diagram for AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy >:
AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > U_POOL

List of all members.

Public Member Functions

AkForceInline bool  Lesser (T_KEY &a, T_KEY &b) const
AkForceInline bool  Equal (T_KEY &a, T_KEY &b) const
T_ITEM *  Exists (T_KEY in_key) const
T_ITEM *  Add (T_KEY in_key)
T_ITEM *  AddNoSetKey (T_KEY in_key)
T_ITEM *  Set (T_KEY in_key)
T_ITEM *  Set (T_KEY in_key, bool &out_bExists)
bool  Unset (T_KEY in_key)
void  Reorder (T_KEY in_OldKey, T_KEY in_NewKey, const T_ITEM &in_item)
void  ReSortArray ()
T_ITEM *  BinarySearch (T_KEY in_key, bool &out_bFound) const
AkForceInline void  Swap (T_ITEM *in_ItemA, T_ITEM *in_ItemB)

Detailed Description

template<class T_KEY, class T_ITEM, class U_POOL, class U_KEY = AkGetArrayKey< T_KEY, T_ITEM >, unsigned long TGrowBy = 1, class TMovePolicy = AkAssignmentMovePolicy<T_ITEM>, class TComparePolicy = AkDefaultSortedKeyCompare<T_KEY>>
class AkSortedKeyArray< T_KEY, T_ITEM, U_POOL, U_KEY, TGrowBy, TMovePolicy, TComparePolicy >

Array of items, sorted by key. Uses binary search for lookups. BEWARE WHEN MODIFYING THE ARRAY USING BASE CLASS METHODS.

Definition at line 184 of file AkKeyArray.h.

The documentation for this class was generated from the following file: