| allocBuffer(s32 ptrNumMax, Heap *heap, s32 alignment=4) | sead::PtrArrayImpl | |
| at(s32 n) const | sead::PtrArray< T > | inline |
| back() const | sead::PtrArray< T > | inline |
| begin() const | sead::PtrArray< T > | inline |
| binarySearch(const T *ptr) const | sead::PtrArray< T > | |
| binarySearch(const T *ptr, CompareCallback cmp) const | sead::PtrArray< T > | |
| sead::PtrArrayImpl::binarySearch(const void *ptr, CompareCallbackImpl cmp) const | sead::PtrArrayImpl | protected |
| checkInsert(s32 pos, s32 num) | sead::PtrArrayImpl | protected |
| clear() | sead::PtrArrayImpl | inline |
| compare(const PtrArray< T > *o, CompareCallback cmp) const | sead::PtrArray< T > | inline |
| sead::PtrArrayImpl::compare(const PtrArrayImpl &o, CompareCallbackImpl cmp) const | sead::PtrArrayImpl | protected |
| CompareCallback typedef | sead::PtrArray< T > | private |
| CompareCallbackImpl typedef | sead::PtrArrayImpl | protected |
| compareT(const T *, const T *) | sead::PtrArray< T > | protectedstatic |
| constBegin() const | sead::PtrArray< T > | inline |
| constEnd() const | sead::PtrArray< T > | inline |
| createVacancy(s32 pos, s32 num) | sead::PtrArrayImpl | protected |
| end() const | sead::PtrArray< T > | inline |
| equal(const PtrArray< T > *o, CompareCallback cmp) const | sead::PtrArray< T > | inline |
| sead::PtrArrayImpl::equal(const PtrArrayImpl &o, CompareCallbackImpl cmp) const | sead::PtrArrayImpl | protected |
| erase(s32 pos) | sead::PtrArrayImpl | inline |
| erase(s32 pos, s32 num) | sead::PtrArrayImpl | |
| find(const T *ptr) const | sead::PtrArray< T > | |
| find(const T *ptr, CompareCallback cmp) const | sead::PtrArray< T > | |
| sead::PtrArrayImpl::find(const void *ptr, CompareCallbackImpl cmp) const | sead::PtrArrayImpl | protected |
| freeBuffer() | sead::PtrArrayImpl | |
| front() const | sead::PtrArray< T > | inline |
| getWork() const | sead::PtrArray< T > | inline |
| heapSort() | sead::PtrArray< T > | inline |
| heapSort(CompareCallback cmp) | sead::PtrArray< T > | inline |
| sead::PtrArrayImpl::heapSort(CompareCallbackImpl cmp) | sead::PtrArrayImpl | protected |
| indexOf(const T *ptr) const | sead::PtrArray< T > | inline |
| sead::PtrArrayImpl::indexOf(const void *ptr) const | sead::PtrArrayImpl | inlineprotected |
| insert(s32 pos, T *ptr) | sead::PtrArray< T > | inline |
| insert(s32 pos, T *array, s32 array_length) | sead::PtrArray< T > | inline |
| sead::PtrArrayImpl::insert(s32 pos, void *ptr) | sead::PtrArrayImpl | protected |
| insertArray(s32 pos, void *array, s32 array_length, s32 elem_size) | sead::PtrArrayImpl | protected |
| isBufferReady() const | sead::PtrArrayImpl | inline |
| isEmpty() const | sead::PtrArrayImpl | inline |
| isFull() const | sead::PtrArrayImpl | inline |
| maxSize() const | sead::PtrArrayImpl | inline |
| mPtrNum | sead::PtrArrayImpl | protected |
| mPtrNumMax | sead::PtrArrayImpl | protected |
| mPtrs | sead::PtrArrayImpl | protected |
| operator!=(const PtrArray< T > &) const | sead::PtrArray< T > | |
| operator<(const PtrArray< T > &) const | sead::PtrArray< T > | |
| operator<=(const PtrArray< T > &) const | sead::PtrArray< T > | |
| operator=(const PtrArrayImpl &) | sead::PtrArrayImpl | |
| operator==(const PtrArray< T > &) const | sead::PtrArray< T > | |
| operator>(const PtrArray< T > &) const | sead::PtrArray< T > | |
| operator>=(const PtrArray< T > &) const | sead::PtrArray< T > | |
| operator[](s32 n) const | sead::PtrArray< T > | inline |
| popBack() | sead::PtrArray< T > | inline |
| popFront() | sead::PtrArray< T > | inline |
| PtrArray() | sead::PtrArray< T > | inline |
| PtrArrayImpl() | sead::PtrArrayImpl | inline |
| pushBack(T *ptr) | sead::PtrArray< T > | inline |
| sead::PtrArrayImpl::pushBack(void *ptr) | sead::PtrArrayImpl | inlineprotected |
| pushFront(T *ptr) | sead::PtrArray< T > | inline |
| sead::PtrArrayImpl::pushFront(void *ptr) | sead::PtrArrayImpl | inlineprotected |
| replace(s32 pos, T *ptr) | sead::PtrArray< T > | inline |
| sead::PtrArrayImpl::replace(s32 pos, void *ptr) | sead::PtrArrayImpl | protected |
| resize(s32) | sead::PtrArrayImpl | |
| reverse() | sead::PtrArrayImpl | |
| reverseBegin() const | sead::PtrArray< T > | |
| reverseConstBegin() const | sead::PtrArray< T > | |
| reverseConstEnd() const | sead::PtrArray< T > | |
| reverseEnd() const | sead::PtrArray< T > | |
| search(const T *ptr) const | sead::PtrArray< T > | |
| search(const T *ptr, CompareCallback cmp) const | sead::PtrArray< T > | |
| sead::PtrArrayImpl::search(const void *ptr, CompareCallbackImpl cmp) const | sead::PtrArrayImpl | protected |
| setBuffer(s32 ptrNumMax, void *buf) | sead::PtrArrayImpl | |
| shuffle() | sead::PtrArrayImpl | |
| shuffle(Random *random) | sead::PtrArrayImpl | |
| size() const | sead::PtrArrayImpl | inline |
| sort() | sead::PtrArray< T > | inline |
| sort(CompareCallback cmp) | sead::PtrArray< T > | inline |
| sead::PtrArrayImpl::sort(CompareCallbackImpl cmp) | sead::PtrArrayImpl | protected |
| swap(s32 pos1, s32 pos2) | sead::PtrArrayImpl | |
| toConstIterator(s32) const | sead::PtrArray< T > | |
| toIterator(s32) const | sead::PtrArray< T > | |
| toReverseConstIterator(s32) const | sead::PtrArray< T > | |
| toReverseIterator(s32) const | sead::PtrArray< T > | |
| tryAllocBuffer(s32 ptrNumMax, Heap *heap, s32 alignment=4) | sead::PtrArrayImpl | |
| uniq() | sead::PtrArray< T > | |
| uniq(CompareCallback cmp) | sead::PtrArray< T > | |
| sead::PtrArrayImpl::uniq(CompareCallbackImpl cmp) | sead::PtrArrayImpl | protected |
| unsafeAt(s32 n) const | sead::PtrArray< T > | inline |
| unsafeResize(s32) | sead::PtrArrayImpl | |
1.14.0