Table of Contents

Wwise SDK 2019.1.6
AkSet< T, U_POOL, uGrowBy > Class Template Reference
Inheritance diagram for AkSet< T, U_POOL, uGrowBy >:
AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, uGrowBy > AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > >

Public Member Functions

bool  Contains (T in_item) const
 
- Public Member Functions inherited from AkSortedKeyArray< T, T, U_POOL, AkSetGetKey< T >, uGrowBy >
AkForceInline bool  Lesser (T &a, T &b) const
 
AkForceInline bool  Equal (T &a, T &b) const
 
T *  Exists (T in_key) const
 
T *  Add (T in_key)
 
T *  AddNoSetKey (T in_key)
 
T *  Set (T in_key)
 
T *  Set (T in_key, bool &out_bExists)
 
bool  Unset (T in_key)
 
void  Reorder (T in_OldKey, T in_NewKey, const T &in_item)
 
void  ReSortArray ()
 
T *  BinarySearch (T in_key, bool &out_bFound) const
 
AkForceInline void  Swap (T *in_ItemA, T *in_ItemB)
 
- Public Member Functions inherited from AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > >
  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 & in_Item) const
  Returns the iterator th the specified item, will be End() if the item is not found. More...
 
Iterator  BinarySearch (const T & 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 *  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...
 
AkForceInline T *  Exists (const T & in_Item) const
  Returns a pointer to the specified item in the list if it exists, 0 if not found. More...
 
AkForceInline T *  AddLast ()
 
AkForceInline T *  AddLast (const T & in_rItem)
  Add an item in the array, and fills it with the provided item. More...
 
T &  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 & in_rItem)
  Removes the specified item if found in the array. More...
 
AKRESULT  RemoveSwap (const T & in_rItem)
 
void  RemoveAll ()
  Removes all items in the array. More...
 
AkForceInline T &  operator[] (unsigned int uiIndex) const
  Operator [], return a reference to the specified index. More...
 
T *  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, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > &in_rSource)
 
AKRESULT  Copy (const AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > > &in_rSource)
 

Additional Inherited Members

- Protected Attributes inherited from AkArray< T, const T &, U_POOL, TGrowBy, AkAssignmentMovePolicy< T > >
T *  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<typename T, class U_POOL, AkUInt32 uGrowBy = 1>
class AkSet< T, U_POOL, uGrowBy >

Definition at line 57 of file AkSet.h.


The documentation for this class was generated from the following file: