#include <seadObjList.h>
Inherits sead::ListImpl.
Inherited by sead::FixedObjList< T, N >.
|
| | ObjList () |
| | ObjList (s32 limitNum, void *buf) |
| void | allocBuffer (s32 limitNum, s32 alignment=cDefaultAlignment) |
| void | allocBuffer (s32 limitNum, Heap *heap, s32 alignment=cDefaultAlignment) |
| bool | tryAllocBuffer (s32 limitNum, s32 alignment=cDefaultAlignment) |
| bool | tryAllocBuffer (s32 limitNum, Heap *heap, s32 alignment=cDefaultAlignment) |
| void | freeBuffer () |
| void | setBuffer (s32 limitNum, void *buf) |
| bool | isBufferReady () const |
| bool | isFull () const |
| s32 | maxSize () const |
| void | clear () |
| T * | birthBack () |
| T * | tryBirthBack () |
| T * | birthFront () |
| T * | tryBirthFront () |
| T * | birthBefore (const T *basis) |
| T * | tryBirthBefore (const T *basis) |
| T * | birthAfter (const T *basis) |
| T * | tryBirthAfter (const T *basis) |
| void | erase (T *obj) |
| T * | front () const |
| T * | back () const |
| T * | prev (const T *obj) const |
| T * | next (const T *obj) const |
| T * | nth (s32 index) const |
| s32 | indexOf (const T *obj) const |
| bool | isNodeLinked (const T *obj) const |
| void | swap (T *obj1, T *obj2) |
| void | moveAfter (T *basis, T *obj) |
| void | moveBefore (T *basis, T *obj) |
| void | sort () |
| void | sort (CompareCallback cmp) |
| void | mergeSort () |
| void | mergeSort (CompareCallback cmp) |
| T * | find (const T *obj) const |
| T * | find (const T *obj, CompareCallback cmp) const |
| void | uniq () |
| void | uniq (CompareCallback cmp) |
| iterator | begin () |
| constIterator | begin () const |
| iterator | end () |
| constIterator | end () const |
| constIterator | constBegin () const |
| constIterator | constEnd () const |
| robustIterator | robustBegin () |
| robustIterator | robustEnd () |
| reverseIterator | reverseBegin () |
| reverseConstIterator | reverseBegin () const |
| reverseIterator | reverseEnd () |
| reverseConstIterator | reverseEnd () const |
| reverseConstIterator | reverseConstBegin () const |
| reverseConstIterator | reverseConstEnd () const |
| reverseRobustIterator | reverseRobustBegin () |
| reverseRobustIterator | reverseRobustEnd () |
| | ListImpl () |
| bool | isEmpty () const |
| s32 | size () const |
| void | reverse () |
| void | shuffle () |
| void | shuffle (Random *random) |
| bool | checkLinks () const |
|
| ListNode * | objToListNode (const T *obj) const |
| T * | listNodeToObj (const ListNode *node) const |
| T * | listNodeToObjWithNullCheck (const ListNode *node) const |
| | ListImpl (const ListImpl &) |
| void | sort (s32 offset, CompareCallbackImpl cmp) |
| void | mergeSort (s32 offset, CompareCallbackImpl cmp) |
| void | pushBack (ListNode *n) |
| void | pushFront (ListNode *n) |
| ListNode * | popBack () |
| ListNode * | popFront () |
| void | insertBefore (ListNode *basis, ListNode *n) |
| void | insertAfter (ListNode *basis, ListNode *n) |
| void | erase (ListNode *n) |
| ListNode * | front () const |
| ListNode * | back () const |
| ListNode * | nth (s32 index) const |
| s32 | indexOf (const ListNode *n) const |
| void | swap (ListNode *n1, ListNode *n2) |
| void | moveAfter (ListNode *basis, ListNode *n) |
| void | moveBefore (ListNode *basis, ListNode *n) |
| ListNode * | find (const void *ptr, s32 offset, CompareCallbackImpl cmp) const |
| void | uniq (s32 offset, CompareCallbackImpl cmp) |
| void | clear () |
| void | unsafeClear () |
| ListImpl & | operator= (const ListImpl &) |
◆ CompareCallback
template<typename T>
| using sead::ObjList< T >::CompareCallback = s32 (*)(const T* a, const T* b) |
|
protected |
◆ ObjList() [1/2]
◆ ObjList() [2/2]
◆ allocBuffer() [1/2]
◆ allocBuffer() [2/2]
◆ tryAllocBuffer() [1/2]
◆ tryAllocBuffer() [2/2]
◆ freeBuffer()
◆ setBuffer()
◆ isBufferReady()
◆ isFull()
◆ maxSize()
◆ clear()
◆ birthBack()
◆ tryBirthBack()
◆ birthFront()
◆ tryBirthFront()
◆ birthBefore()
◆ tryBirthBefore()
◆ birthAfter()
◆ tryBirthAfter()
◆ erase()
◆ front()
◆ back()
◆ prev()
◆ next()
◆ nth()
◆ indexOf()
◆ isNodeLinked()
◆ swap()
◆ moveAfter()
◆ moveBefore()
◆ sort() [1/2]
◆ sort() [2/2]
◆ mergeSort() [1/2]
◆ mergeSort() [2/2]
◆ find() [1/2]
◆ find() [2/2]
◆ uniq() [1/2]
◆ uniq() [2/2]
◆ begin() [1/2]
◆ begin() [2/2]
◆ end() [1/2]
◆ end() [2/2]
◆ constBegin()
◆ constEnd()
◆ robustBegin()
◆ robustEnd()
◆ reverseBegin() [1/2]
◆ reverseBegin() [2/2]
◆ reverseEnd() [1/2]
◆ reverseEnd() [2/2]
◆ reverseConstBegin()
◆ reverseConstEnd()
◆ reverseRobustBegin()
◆ reverseRobustEnd()
◆ compareT()
◆ objToListNode()
◆ listNodeToObj()
◆ listNodeToObjWithNullCheck()
◆ mFreeList
◆ mLimitNum