sead::ListImpl class

#include </OdysseyDecomp/lib/sead/include/container/seadListImpl.h>

Derived classes

template<typename T>

class OffsetList

template<typename T>

class OffsetList

template<typename T>

class OffsetList

template<typename T>

class OffsetList

template<typename T>

class OffsetList

template<typename T>

class OffsetList

template<typename T>

class ObjList

template<typename T>

class OffsetList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

template<typename T>

class TList

Constructors, destructors, conversion operators

__attribute__((always_inline))

Public functions

auto isEmpty() const -> bool

auto size() const -> s32

void reverse()

void shuffle()

void shuffle(Random* random)

auto checkLinks() const -> bool

Protected types

using CompareCallbackImpl = int(*)(const void*, const void*)

Protected static functions

template<class T, class ComparePredicate>

static void mergeSortImpl_(ListNode* front, ListNode* back, s32 num, s32 offset, const ComparePredicate& predicate)

Protected functions

template<class T, class ComparePredicate>

void sort(s32 offset, const ComparePredicate& cmp)

template<class T, class ComparePredicate>

void mergeSort(s32 offset, const ComparePredicate& cmp)

void pushBack(ListNode* item)

void pushFront(ListNode* item)

auto popBack() -> ListNode*

auto popFront() -> ListNode*

void insertBefore(ListNode* node, ListNode* node_to_insert)

void insertAfter(ListNode* node, ListNode* node_to_insert)

void erase(ListNode* item)

auto front() const -> ListNode*

auto back() const -> ListNode*

auto nth(int n) const -> ListNode*

auto indexOf(const ListNode*) const -> s32

void swap(ListNode* n1, ListNode* n2)

void moveAfter(ListNode* basis, ListNode* n)

void moveBefore(ListNode* basis, ListNode* n)

auto find(const void* ptr, s32 offset, CompareCallbackImpl cmp) const -> ListNode*

void uniq(s32 offset, CompareCallbackImpl cmp)

void clear()

Protected variables

ListNode mStartEnd

s32 mCount