이 파일의 문서화 페이지로 가기
35 #include AK/Tools/Common/AkKeyArray.h>
56 templatetypename T,
class U_POOL = ArrayPoolDefault,
class uGrowBy = AkGrowByPolicy_DEFAULT,
class TMovePolicy = AkAssignmentMovePolicy
, class TComparePolicy = AkDefaultSortedKeyCompare >
74 templatetypename T,
class TMovePolicy = AkAssignmentMovePolicy
, class TComparePolicy = AkDefaultSortedKeyCompare >
96 templatetypename T,
class U_POOL = ArrayPoolDefault,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
101 while (itA != in_A.
End() && itB != in_B.
End())
105 else if (*itA
116 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
125 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
130 while (itA != in_A.
End() && itB != in_B.
End())
132 if (TComparePolicy::Equal(&in_A, *itA, *itB))
136 else if (TComparePolicy::Lesser(&in_A, *itA, *itB))
143 return (itA == in_A.
End());
149 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
155 while (itA != in_A.
End() && itB != in_B.
End())
157 if (TComparePolicy::Equal(&in_A, *itA, *itB))
159 ++uSize; ++itA; ++itB;
161 else if (TComparePolicy::Lesser(&in_A, *itA, *itB))
176 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy>
180 itAr = itAw = in_A.
Begin();
182 while (itAr != in_A.
End())
184 if (itB == in_B.
End() || TComparePolicy::Lesser(&in_A, *itAr, *itB))
192 else if (TComparePolicy::Equal(&in_A, *itAr, *itB))
209 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
213 itAr = itAw = in_A.
Begin();
215 while (itAr != in_A.
End() && itB != in_B.
End())
217 if (TComparePolicy::Equal(&in_A, *itAr, *itB))
226 else if (TComparePolicy::Lesser(&in_A, *itAr,*itB))
242 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
249 while (itA != in_A.
End() && itB != in_B.
End())
251 if (TComparePolicy::Equal(&in_A, *itA, *itB))
258 else if (TComparePolicy::Lesser(&in_A, *itA,*itB))
274 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
280 if (result.
Resize(uSizeNeeded))
286 while (itB != in_B.
End() || itA != io_A.
End())
288 if ( itB != in_B.
End() && (itA == io_A.
End() || TComparePolicy::Lesser(&io_A, *itB, *itA)))
293 else if (itB == in_B.
End() || TComparePolicy::Lesser(&io_A, *itA,*itB) )
320 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
342 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
353 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
376 templatetypename T,
class U_POOL,
class uGrowBy,
class TMovePolicy,
class TComparePolicy >
static bool AkContains(const AkSet &in_Set, AkSetType in_type, T in_item)
AKRESULT Copy(const AkArray > &in_rSource)
static bool AkIntersection(AkSet &in_A, const AkSet &in_B)
void RemoveAll()
Removes all items in the array
static AkUInt32 AkCountIntersection(const AkSet &in_A, const AkSet &in_B)
T * Exists(T in_key) const
static bool AkUnion(AkSet &io_A, const AkSet &in_B)
@ AK_Success
The operation was successful.
int32_t AkInt32
Signed 32-bit integer
AkForceInline void Init(AK::IAkPluginMemAlloc *in_pAllocator)
AkUInt32 m_uLength
number of items in the array.
bool Resize(AkUInt32 in_uiSize)
Resize the array to the specified size.
AkBookmarkSet(AK::IAkPluginMemAlloc *in_pAllocator)
Iterator End() const
Returns the iterator to the end of the array
void Transfer(AkArray > &in_rSource)
static bool AkSubtraction(AkSet &in_A, const AkSet &in_B)
AkUInt32 m_ulReserved
how many we can have at most (currently allocated).
Iterator Begin() const
Returns the iterator to the first item of the array, will be End() if the array is empty.
AkForceInline AkUInt32 Length() const
Returns the numbers of items in the array.
static bool AkIsSubset(const AkSet &in_A, const AkSet &in_B)
static bool AkDisjoint(const AkSet &in_A, const AkSet &in_B)
AkForceInline T * AddLast()
uint32_t AkUInt32
Unsigned 32-bit integer
void Term()
Term the array. Must be called before destroying the object.
typename base::Iterator Iterator
bool Contains(T in_item) const
static AkForceInline T & Get(T &in_item)
static bool AkIntersect(const AkSet &in_A, const AkSet &in_B)
T * m_pItems
pointer to the beginning of the array.