T_ITEM * Exists(T_KEY in_Key) const
T_ITEM * Set(T_KEY in_Key, const T_ITEM &in_Item)
AkArray< MapStruct< T_KEY, T_ITEM >, const MapStruct< T_KEY, T_ITEM > &, U_POOL, TGrowBy, TMovePolicy >::Iterator FindEx(T_KEY in_Item) const
T_ITEM * Set(T_KEY in_key, bool &out_bExists)
T_ITEM * Set(T_KEY in_Key)
Key policy for AkSortedKeyArray.
T_ITEM * LowerBounds(T_KEY in_key, Iterator in_from, Iterator in_to) const
T_ITEM * Exists(T_KEY in_key) const
T_ITEM * LowerBounds(T_KEY in_key) const
Specific implementation of array
int32_t AkInt32
Signed 32-bit integer
T_ITEM * BinarySearch(T_KEY in_key, bool &out_bFound) const
AkUInt32 m_uLength
number of items in the array.
T_ITEM * AddNoSetKey(T_KEY in_key, bool &out_bFound)
AkForceInline void Swap(T_ITEM *in_ItemA, T_ITEM *in_ItemB)
#define AKASSERT(Condition)
T_ITEM * SetFirst(T_KEY in_Key, const T_ITEM &in_Item)
Iterator End() const
Returns the iterator to the end of the array
Iterator Insert(Iterator &in_rIter)
Trivial key policy for AkSortedKeyArray, when T_KEY is T_ITEM.
AkForceInline bool Equal(T_KEY &a, T_KEY &b) const
T_ITEM * Add(T_KEY in_key)
static AkForceInline bool Lesser(THIS_CLASS *, T_KEY &a, T_KEY &b)
Iterator Erase(Iterator &in_rIter)
Erase the specified iterator from the array
Iterator Begin() const
Returns the iterator to the first item of the array, will be End() if the array is empty.
int64_t AkInt64
Signed 64-bit integer
AkForceInline AkUInt32 Length() const
Returns the numbers of items in the array.
static AkForceInline T_KEY & Get(T_ITEM &in_item)
Default policy.
AkForceInline MapStruct< T_KEY, T_ITEM > * AddLast()
static AkForceInline bool Equal(THIS_CLASS *, T_KEY &a, T_KEY &b)
static AkForceInline T_KEY & Get(T_ITEM &in_item)
Default policy.
uint32_t AkUInt32
Unsigned 32-bit integer
T_ITEM * AddNoSetKey(T_KEY in_key)
void UnsetSwap(T_KEY in_Key)
AkForceInline bool Lesser(T_KEY &a, T_KEY &b) const
typename base::Iterator Iterator
static AkForceInline T_KEY & Get(T_KEY &in_item)
Default policy.
void Reorder(T_KEY in_OldKey, T_KEY in_NewKey, const T_ITEM &in_item)
Iterator EraseSwap(Iterator &in_rIter)
T_ITEM * Set(T_KEY in_key)
T_ITEM * m_pItems
pointer to the beginning of the array.
지원이 필요하신가요?
질문이 있으신가요? 문제를 겪고 계신가요? 더 많은 정보가 필요하신가요? 저희에게 문의해주시면 도와드리겠습니다!
지원 페이지를 방문해 주세요
작업하는 프로젝트에 대해 알려주세요. 언제든지 도와드릴 준비가 되어 있습니다.
프로젝트를 등록하세요. 아무런 조건이나 의무 사항 없이 빠른 시작을 도와드리겠습니다.
Wwise를 시작해 보세요