#include <seadPtrArray.h>
Inherits sead::PtrArrayImpl.
Inherited by sead::FixedPtrArray< Heap, NUM_ROOT_HEAPS_MAX >, sead::FixedPtrArray< Heap, NUM_INDEPENDENT_HEAPS_MAX >, and sead::FixedPtrArray< T, N >.
|
| | PtrArray () |
| T * | at (s32 n) const |
| T * | unsafeAt (s32 n) const |
| T * | operator[] (s32 n) const |
| T * | front () const |
| T * | back () const |
| void | pushBack (T *ptr) |
| void | pushFront (T *ptr) |
| T * | popBack () |
| T * | popFront () |
| void | insert (s32 pos, T *ptr) |
| void | insert (s32 pos, T *array, s32 array_length) |
| void | replace (s32 pos, T *ptr) |
| s32 | indexOf (const T *ptr) const |
| void * | getWork () const |
| void | sort () |
| void | sort (CompareCallback cmp) |
| void | heapSort () |
| void | heapSort (CompareCallback cmp) |
| bool | equal (const PtrArray< T > *o, CompareCallback cmp) const |
| s32 | compare (const PtrArray< T > *o, CompareCallback cmp) const |
| T * | find (const T *ptr) const |
| T * | find (const T *ptr, CompareCallback cmp) const |
| s32 | search (const T *ptr) const |
| s32 | search (const T *ptr, CompareCallback cmp) const |
| s32 | binarySearch (const T *ptr) const |
| s32 | binarySearch (const T *ptr, CompareCallback cmp) const |
| bool | operator== (const PtrArray< T > &) const |
| bool | operator!= (const PtrArray< T > &) const |
| bool | operator< (const PtrArray< T > &) const |
| bool | operator<= (const PtrArray< T > &) const |
| bool | operator> (const PtrArray< T > &) const |
| bool | operator>= (const PtrArray< T > &) const |
| void | uniq () |
| void | uniq (CompareCallback cmp) |
| iterator | begin () const |
| iterator | end () const |
| iterator | toIterator (s32) const |
| constIterator | constBegin () const |
| constIterator | constEnd () const |
| constIterator | toConstIterator (s32) const |
| reverseIterator | reverseBegin () const |
| reverseIterator | reverseEnd () const |
| reverseIterator | toReverseIterator (s32) const |
| reverseConstIterator | reverseConstBegin () const |
| reverseConstIterator | reverseConstEnd () const |
| reverseConstIterator | toReverseConstIterator (s32) const |
| | PtrArrayImpl () |
| void | setBuffer (s32 ptrNumMax, void *buf) |
| void | allocBuffer (s32 ptrNumMax, Heap *heap, s32 alignment=4) |
| bool | tryAllocBuffer (s32 ptrNumMax, Heap *heap, s32 alignment=4) |
| void | freeBuffer () |
| bool | isBufferReady () const |
| bool | isEmpty () const |
| bool | isFull () const |
| s32 | size () const |
| s32 | maxSize () const |
| void | erase (s32 pos) |
| void | erase (s32 pos, s32 num) |
| void | clear () |
| void | resize (s32) |
| void | unsafeResize (s32) |
| void | swap (s32 pos1, s32 pos2) |
| void | reverse () |
| PtrArrayImpl & | operator= (const PtrArrayImpl &) |
| void | shuffle () |
| void | shuffle (Random *random) |
|
| static s32 | compareT (const T *, const T *) |
|
| typedef s32(* | CompareCallbackImpl) (const void *, const void *) |
| void * | at (s32 n) const |
| void * | unsafeAt (s32 n) const |
| void * | front () const |
| void * | back () const |
| void | pushBack (void *ptr) |
| void | pushFront (void *ptr) |
| void * | popBack () |
| void * | popFront () |
| void | replace (s32 pos, void *ptr) |
| void * | find (const void *ptr, CompareCallbackImpl cmp) const |
| s32 | search (const void *ptr, CompareCallbackImpl cmp) const |
| bool | equal (const PtrArrayImpl &o, CompareCallbackImpl cmp) const |
| s32 | indexOf (const void *ptr) const |
| void | createVacancy (s32 pos, s32 num) |
| void | insert (s32 pos, void *ptr) |
| void | insertArray (s32 pos, void *array, s32 array_length, s32 elem_size) |
| bool | checkInsert (s32 pos, s32 num) |
| void | sort (CompareCallbackImpl cmp) |
| void | heapSort (CompareCallbackImpl cmp) |
| s32 | compare (const PtrArrayImpl &o, CompareCallbackImpl cmp) const |
| void | uniq (CompareCallbackImpl cmp) |
| s32 | binarySearch (const void *ptr, CompareCallbackImpl cmp) const |
| s32 | mPtrNum |
| s32 | mPtrNumMax |
| void ** | mPtrs |
◆ CompareCallback
template<typename T>
| typedef s32(* sead::PtrArray< T >::CompareCallback) (const T *, const T *) |
|
private |
◆ PtrArray()
◆ at()
◆ unsafeAt()
◆ operator[]()
◆ front()
◆ back()
◆ pushBack()
◆ pushFront()
◆ popBack()
◆ popFront()
◆ insert() [1/2]
◆ insert() [2/2]
template<typename T>
| void sead::PtrArray< T >::insert |
( |
s32 | pos, |
|
|
T * | array, |
|
|
s32 | array_length ) |
|
inline |
◆ replace()
◆ indexOf()
◆ getWork()
◆ sort() [1/2]
◆ sort() [2/2]
◆ heapSort() [1/2]
◆ heapSort() [2/2]
◆ equal()
◆ compare()
◆ find() [1/2]
◆ find() [2/2]
◆ search() [1/2]
◆ search() [2/2]
◆ binarySearch() [1/2]
◆ binarySearch() [2/2]
◆ operator==()
◆ operator!=()
◆ operator<()
◆ operator<=()
◆ operator>()
◆ operator>=()
◆ uniq() [1/2]
◆ uniq() [2/2]
◆ begin()
◆ end()
◆ toIterator()
◆ constBegin()
◆ constEnd()
◆ toConstIterator()
◆ reverseBegin()
◆ reverseEnd()
◆ toReverseIterator()
◆ reverseConstBegin()
◆ reverseConstEnd()
◆ toReverseConstIterator()
◆ compareT()