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

template<typename Key, typename Value>

sead::TreeMap class

Sorted associative container. This is essentially std::map<Key, Value>

Derived classes

template<typename Key, typename Value, int N>

class FixedTreeMap

Public types

class Node

using MapImpl = TreeMapImpl<TreeMapKeyImpl<Key>>

Public functions

void allocBuffer(s32 node_max, Heap* heap, s32 alignment = sizeof(void*))

void setBuffer(s32 node_max, void* buffer)

void freeBuffer()

auto insert(const Key& key, const Value& value) -> Value*

void clear()

auto find(const Key& key) const -> Node*

template<typename Callable>

void forEach(const Callable& delegate) const

auto startIterating() const -> Node*

auto nextNode(Node* node) const -> Node*