Wwise SDK 2021.1.14
_ak_set_8h_source
Version
menu_open
link
AkSet.h
Go to the documentation of this file.
39 // - An optional set type specifier which is passed into some set operations. If it is not included, SetType_Inclusion is assumed.
43 SetType_Inclusion, // <- An AkSet object with type SetType_Inclusion is a set where each element in the array
45 SetType_Exclusion // <- An AkSet object with type SetType_Exclusion is an 'inverted' set, where each element in the array
47 };
60 bool Contains(T in_item) const { return AkSortedKeyArray < T, T, U_POOL, AkSetGetKey<T>, uGrowBy >::Exists(in_item) != NULL; }
67 static bool AkDisjoint(const AkSet<T, U_POOL, uGrowBy>& in_A, const AkSet<T, U_POOL, uGrowBy>& in_B)
87 static bool AkIntersect(const AkSet<T, U_POOL, uGrowBy>& in_A, const AkSet<T, U_POOL, uGrowBy>& in_B)
96 static bool AkIsSubset(const AkSet<T, U_POOL, uGrowBy>& in_A, const AkSet<T, U_POOL, uGrowBy>& in_B)
120 static AkUInt32 AkCountIntersection(const AkSet<T, U_POOL, uGrowBy>& in_A, const AkSet<T, U_POOL, uGrowBy>& in_B)
147 static bool AkSubtraction(AkSet<T, U_POOL, uGrowBy>& in_A, const AkSet<T, U_POOL, uGrowBy>& in_B)
180 static bool AkIntersection(AkSet<T, U_POOL, uGrowBy>& in_A, const AkSet<T, U_POOL, uGrowBy>& in_B)
213 static bool AkIntersection(AkSet<T, U_POOL, uGrowBy>& out_res, const AkSet<T, U_POOL, uGrowBy>& in_A, const AkSet<T, U_POOL, uGrowBy>& in_B)
288 // - Return true if the intersection of in_A (a set of type in_typeA), and in_B (a set of type in_typeB) is not the empty set.
291 static inline bool AkIntersect(const AkSet<T, U_POOL, uGrowBy>& in_A, AkSetType in_typeA, const AkSet<T, U_POOL, uGrowBy>& in_B, AkSetType in_typeB)
313 static inline bool AkContains(const AkSet<T, U_POOL, uGrowBy>& in_Set, AkSetType in_type, T in_item)
324 static inline bool AkSubtraction(AkSet<T, U_POOL, uGrowBy>& in_A, AkSetType in_typeA, const AkSet<T, U_POOL, uGrowBy>& in_B, AkSetType in_typeB)
347 static inline bool AkUnion(AkSet<T, U_POOL, uGrowBy>& io_A, AkSetType& io_typeA, const AkSet<T, U_POOL, uGrowBy>& in_B, AkSetType in_typeB)
static bool AkUnion(AkSet< T, U_POOL, uGrowBy > &io_A, const AkSet< T, U_POOL, uGrowBy > &in_B)
Definition: AkSet.h:245
Definition: AkSet.h:58
AKRESULT Copy(const AkArray< T, const T &, U_POOL, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > &in_rSource)
Definition: AkArray.h:708
Definition: AkSet.h:50
static bool AkContains(const AkSet< T, U_POOL, uGrowBy > &in_Set, AkSetType in_type, T in_item)
Definition: AkSet.h:313
T * Exists(T in_key) const
Definition: AkKeyArray.h:197
static bool AkIntersect(const AkSet< T, U_POOL, uGrowBy > &in_A, const AkSet< T, U_POOL, uGrowBy > &in_B)
Definition: AkSet.h:87
static bool AkIntersection(AkSet< T, U_POOL, uGrowBy > &in_A, const AkSet< T, U_POOL, uGrowBy > &in_B)
Definition: AkSet.h:180
static AkUInt32 AkCountIntersection(const AkSet< T, U_POOL, uGrowBy > &in_A, const AkSet< T, U_POOL, uGrowBy > &in_B)
Definition: AkSet.h:120
Definition: AkKeyArray.h:185
void Transfer(AkArray< T, const T &, U_POOL, AkGrowByPolicy_DEFAULT, AkAssignmentMovePolicy< T > > &in_rSource)
Definition: AkArray.h:695
Iterator Begin() const
Returns the iterator to the first item of the array, will be End() if the array is empty.
Definition: AkArray.h:286
AkForceInline AkUInt32 Length() const
Returns the numbers of items in the array.
Definition: AkArray.h:452
AkForceInline T * AddLast()
Definition: AkArray.h:478
static bool AkDisjoint(const AkSet< T, U_POOL, uGrowBy > &in_A, const AkSet< T, U_POOL, uGrowBy > &in_B)
Definition: AkSet.h:67
static bool AkSubtraction(AkSet< T, U_POOL, uGrowBy > &in_A, const AkSet< T, U_POOL, uGrowBy > &in_B)
Definition: AkSet.h:147
static bool AkIsSubset(const AkSet< T, U_POOL, uGrowBy > &in_A, const AkSet< T, U_POOL, uGrowBy > &in_B)
Definition: AkSet.h:96
Was this page helpful?
Need Support?
Questions? Problems? Need more info? Contact us, and we can help!
Visit our Support pageTell us about your project. We're here to help.
Register your project and we'll help you get started with no strings attached!
Get started with Wwise