| allocBuffer(s32 node_max, s32 alignment=cDefaultAlignment)=delete | sead::FixedTreeMap< Key, Value, N > | |
| allocBuffer(s32 node_max, Heap *heap, s32 alignment=cDefaultAlignment)=delete | sead::FixedTreeMap< Key, Value, N > | |
| clear() | sead::TreeMap< Key, Value > | inline |
| contains(const Key &key) const | sead::TreeMap< Key, Value > | inline |
| erase(const Key &key) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inline |
| eraseMin(Node *h) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inlinestatic |
| eraseNode_(Node *node) | sead::TreeMap< Key, Value > | inlineprotected |
| eraseNodeForClear_(TreeMapNode< TreeMapKeyImpl< Key > > *n) | sead::TreeMap< Key, Value > | inlineprotected |
| find(const Key &key) const | sead::TreeMap< Key, Value > | inline |
| FixedTreeMap() | sead::FixedTreeMap< Key, Value, N > | inline |
| fixUp(Node *h) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inlinestatic |
| flipColors(Node *h) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inlinestatic |
| forEach(const T &fun) const | sead::TreeMap< Key, Value > | inline |
| freeBuffer()=delete | sead::FixedTreeMap< Key, Value, N > | |
| getSize() const | sead::TreeMap< Key, Value > | inline |
| insert(const Key &key) | sead::TreeMap< Key, Value > | inline |
| insert(const Key &key, const Value &value) | sead::TreeMap< Key, Value > | inline |
| sead::TreeMapImpl< TreeMapKeyImpl< Key > >::insert(Node *node) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inline |
| isBufferReady() const | sead::TreeMap< Key, Value > | inline |
| isEmpty() const | sead::TreeMap< Key, Value > | inline |
| isFull() const | sead::TreeMap< Key, Value > | inline |
| isRed(Node *h) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inlinestatic |
| maxSize() const | sead::TreeMap< Key, Value > | inline |
| mFreeList | sead::TreeMap< Key, Value > | protected |
| min(Node *h) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inlinestatic |
| mNodeMax | sead::TreeMap< Key, Value > | protected |
| moveRedLeft(Node *h) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inlinestatic |
| moveRedRight(Node *h) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inlinestatic |
| mRoot | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | protected |
| mSize | sead::TreeMap< Key, Value > | protected |
| mWork | sead::FixedTreeMap< Key, Value, N > | protected |
| Node typedef | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | |
| rotateLeft(Node *h) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inlinestatic |
| rotateRight(Node *h) | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inlinestatic |
| setBuffer(s32 node_max, void *buf)=delete | sead::FixedTreeMap< Key, Value, N > | |
| size() const | sead::TreeMap< Key, Value > | inline |
| TreeMap() | sead::TreeMap< Key, Value > | inline |
| TreeMapImpl() | sead::TreeMapImpl< TreeMapKeyImpl< Key > > | inline |
| tryAllocBuffer(s32 node_max, s32 alignment=cDefaultAlignment)=delete | sead::FixedTreeMap< Key, Value, N > | |
| tryAllocBuffer(s32 node_max, Heap *heap, s32 alignment=cDefaultAlignment)=delete | sead::FixedTreeMap< Key, Value, N > | |
1.14.0