| allocBuffer(s32 limitNum, s32 alignment=cDefaultAlignment)=delete | sead::FixedObjList< T, N > | |
| allocBuffer(s32 limitNum, Heap *heap, s32 alignment=cDefaultAlignment)=delete | sead::FixedObjList< T, N > | |
| back() const | sead::ObjList< T > | inline |
| begin() | sead::ObjList< T > | inline |
| begin() const | sead::ObjList< T > | inline |
| birthAfter(const T *basis) | sead::ObjList< T > | inline |
| birthBack() | sead::ObjList< T > | inline |
| birthBefore(const T *basis) | sead::ObjList< T > | inline |
| birthFront() | sead::ObjList< T > | inline |
| checkLinks() const | sead::ListImpl | |
| clear() | sead::ObjList< T > | inline |
| CompareCallback typedef | sead::ObjList< T > | protected |
| CompareCallbackImpl typedef | sead::ListImpl | protected |
| compareT(const T *a, const T *b) | sead::ObjList< T > | inlineprotectedstatic |
| constBegin() const | sead::ObjList< T > | inline |
| constEnd() const | sead::ObjList< T > | inline |
| end() | sead::ObjList< T > | inline |
| end() const | sead::ObjList< T > | inline |
| erase(T *obj) | sead::ObjList< T > | inline |
| sead::ListImpl::erase(ListNode *n) | sead::ListImpl | inlineprotected |
| find(const T *obj) const | sead::ObjList< T > | inline |
| find(const T *obj, CompareCallback cmp) const | sead::ObjList< T > | inline |
| sead::ListImpl::find(const void *ptr, s32 offset, CompareCallbackImpl cmp) const | sead::ListImpl | protected |
| FixedObjList() | sead::FixedObjList< T, N > | inline |
| freeBuffer()=delete | sead::FixedObjList< T, N > | |
| front() const | sead::ObjList< T > | inline |
| indexOf(const T *obj) const | sead::ObjList< T > | inline |
| sead::ListImpl::indexOf(const ListNode *n) const | sead::ListImpl | protected |
| insertAfter(ListNode *basis, ListNode *n) | sead::ListImpl | inlineprotected |
| insertBefore(ListNode *basis, ListNode *n) | sead::ListImpl | inlineprotected |
| isBufferReady() const | sead::ObjList< T > | inline |
| isEmpty() const | sead::ListImpl | inline |
| isFull() const | sead::ObjList< T > | inline |
| isNodeLinked(const T *obj) const | sead::ObjList< T > | inline |
| ListImpl() | sead::ListImpl | inline |
| ListImpl(const ListImpl &) | sead::ListImpl | protected |
| listNodeToObj(const ListNode *node) const | sead::ObjList< T > | inlineprotected |
| listNodeToObjWithNullCheck(const ListNode *node) const | sead::ObjList< T > | inlineprotected |
| maxSize() const | sead::ObjList< T > | inline |
| mCount | sead::ListImpl | protected |
| mergeSort() | sead::ObjList< T > | inline |
| mergeSort(CompareCallback cmp) | sead::ObjList< T > | inline |
| sead::ListImpl::mergeSort(s32 offset, CompareCallbackImpl cmp) | sead::ListImpl | protected |
| mergeSortImpl(ListNode *front, ListNode *back, s32 num, s32 offset, CompareCallbackImpl cmp) | sead::ListImpl | protectedstatic |
| mFreeList | sead::ObjList< T > | protected |
| mInternalWork | sead::FixedObjList< T, N > | protected |
| mLimitNum | sead::ObjList< T > | protected |
| moveAfter(T *basis, T *obj) | sead::ObjList< T > | inline |
| sead::ListImpl::moveAfter(ListNode *basis, ListNode *n) | sead::ListImpl | protected |
| moveBefore(T *basis, T *obj) | sead::ObjList< T > | inline |
| sead::ListImpl::moveBefore(ListNode *basis, ListNode *n) | sead::ListImpl | protected |
| mStartEnd | sead::ListImpl | protected |
| next(const T *obj) const | sead::ObjList< T > | inline |
| nth(s32 index) const | sead::ObjList< T > | inline |
| ObjList() | sead::ObjList< T > | inline |
| ObjList(s32 limitNum, void *buf) | sead::ObjList< T > | inline |
| objToListNode(const T *obj) const | sead::ObjList< T > | inlineprotected |
| operator=(const ListImpl &) | sead::ListImpl | protected |
| popBack() | sead::ListImpl | protected |
| popFront() | sead::ListImpl | protected |
| prev(const T *obj) const | sead::ObjList< T > | inline |
| pushBack(ListNode *n) | sead::ListImpl | inlineprotected |
| pushFront(ListNode *n) | sead::ListImpl | inlineprotected |
| reverse() | sead::ListImpl | |
| reverseBegin() | sead::ObjList< T > | inline |
| reverseBegin() const | sead::ObjList< T > | inline |
| reverseConstBegin() const | sead::ObjList< T > | inline |
| reverseConstEnd() const | sead::ObjList< T > | inline |
| reverseEnd() | sead::ObjList< T > | inline |
| reverseEnd() const | sead::ObjList< T > | inline |
| reverseRobustBegin() | sead::ObjList< T > | inline |
| reverseRobustEnd() | sead::ObjList< T > | inline |
| robustBegin() | sead::ObjList< T > | inline |
| robustEnd() | sead::ObjList< T > | inline |
| setBuffer(s32 limitNum, void *buf)=delete | sead::FixedObjList< T, N > | |
| shuffle() | sead::ListImpl | inline |
| shuffle(Random *random) | sead::ListImpl | |
| size() const | sead::ListImpl | inline |
| sort() | sead::ObjList< T > | inline |
| sort(CompareCallback cmp) | sead::ObjList< T > | inline |
| sead::ListImpl::sort(s32 offset, CompareCallbackImpl cmp) | sead::ListImpl | protected |
| swap(T *obj1, T *obj2) | sead::ObjList< T > | inline |
| sead::ListImpl::swap(ListNode *n1, ListNode *n2) | sead::ListImpl | protected |
| tryAllocBuffer(s32 limitNum, s32 alignment=cDefaultAlignment)=delete | sead::FixedObjList< T, N > | |
| tryAllocBuffer(s32 limitNum, Heap *heap, s32 alignment=cDefaultAlignment)=delete | sead::FixedObjList< T, N > | |
| tryBirthAfter(const T *basis) | sead::ObjList< T > | inline |
| tryBirthBack() | sead::ObjList< T > | inline |
| tryBirthBefore(const T *basis) | sead::ObjList< T > | inline |
| tryBirthFront() | sead::ObjList< T > | inline |
| uniq() | sead::ObjList< T > | inline |
| uniq(CompareCallback cmp) | sead::ObjList< T > | inline |
| sead::ListImpl::uniq(s32 offset, CompareCallbackImpl cmp) | sead::ListImpl | protected |
| unsafeClear() | sead::ListImpl | inlineprotected |
1.14.0