menu
버전
2018.1.11.6987
2024.1.4.8780
2023.1.12.8706
2022.1.18.8567
2021.1.14.8108
2019.2.15.7667
2019.1.11.7296
2018.1.11.6987
2017.2.10.6745
2017.1.9.6501
2016.2.6.6153
2015.1.9.5624
menu_open
|
Wwise SDK 2018.1.11
|
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 >:
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) |
| 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) |
 Public Member Functions inherited from AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy >
| |
| AkArray () | |
| Constructor. More... |
|
| ~AkArray () | |
| Destructor. More... |
|
| Iterator | Begin () const |
| Returns the iterator to the first item of the array, will be End() if the array is empty. More... |
|
| Iterator | End () const |
| Returns the iterator to the end of the array. More... |
|
| Iterator | FindEx (const T_ITEM & in_Item) const |
| Returns the iterator th the specified item, will be End() if the item is not found. More... |
|
| Iterator | BinarySearch (const T_ITEM & in_Item) const |
| Iterator | Erase (Iterator &in_rIter) |
| Erase the specified iterator from the array. More... |
|
| void | Erase (unsigned int in_uIndex) |
| Erase the item at the specified index. More... |
|
| Iterator | EraseSwap (Iterator &in_rIter) |
| AKRESULT | Reserve (AkUInt32 in_ulReserve) |
| Pre-Allocate a number of spaces in the array. More... |
|
| AkUInt32 | Reserved () const |
| void | Term () |
| Term the array. Must be called before destroying the object. More... |
|
| AkForceInline AkUInt32 | Length () const |
| Returns the numbers of items in the array. More... |
|
| AkForceInline T_ITEM * | Data () const |
| Returns a pointer to the first item in the array. More... |
|
| AkForceInline bool | IsEmpty () const |
| Returns true if the number items in the array is 0, false otherwise. More... |
|
| T_ITEM * | Exists (const T_ITEM & in_Item) const |
| Returns a pointer to the specified item in the list if it exists, 0 if not found. More... |
|
| T_ITEM * | AddLast () |
| T_ITEM * | AddLast (const T_ITEM & in_rItem) |
| Add an item in the array, and fills it with the provided item. More... |
|
| T_ITEM & | Last () |
| Returns a reference to the last item in the array. More... |
|
| void | RemoveLast () |
| Removes the last item from the array. More... |
|
| AKRESULT | Remove (const T_ITEM & in_rItem) |
| Removes the specified item if found in the array. More... |
|
| AKRESULT | RemoveSwap (const T_ITEM & in_rItem) |
| void | RemoveAll () |
| Removes all items in the array. More... |
|
| AkForceInline T_ITEM & | operator[] (unsigned int uiIndex) const |
| Operator [], return a reference to the specified index. More... |
|
| T_ITEM * | Insert (unsigned int in_uIndex) |
| bool | GrowArray (AkUInt32 in_uGrowBy=TGrowBy) |
| Resize the array. More... |
|
| bool | Resize (AkUInt32 in_uiSize) |
| Resize the array to the specified size. More... |
|
| void | Transfer (AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > &in_rSource) |
| AKRESULT | Copy (const AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy > &in_rSource) |
Additional Inherited Members | |
|
Protected Attributes inherited from AkArray< T_ITEM, const T_ITEM &, U_POOL, TGrowBy, TMovePolicy >
| |
| T_ITEM * | m_pItems |
| pointer to the beginning of the array. More... |
|
| AkUInt32 | m_uLength |
| number of items in the array. More... |
|
| AkUInt32 | m_ulReserved |
| how many we can have at most (currently allocated). More... |
|
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:
- include/AK/Tools/Common/AkKeyArray.h
이 페이지가 도움이 되었나요?
작업하는 프로젝트에 대해 알려주세요. 언제든지 도와드릴 준비가 되어 있습니다.
프로젝트를 등록하세요. 아무런 조건이나 의무 사항 없이 빠른 시작을 도와드리겠습니다.
Wwise를 시작해 보세요