Public Member Functions | |
AkForceInline bool | Greater (T_KEY &a, T_KEY &b) const |
AkForceInline bool | Lesser (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) |
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) |
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.
Questions? Problems? Need more info? Contact us, and we can help!
Visit our Support pageRegister your project and we'll help you get started with no strings attached!
Get started with Wwise