class `MinHeap`

template<class K, class V>

Binary tree where each nodes is less than or equal to the data in its node's children.

Public

MinHeap<K, V>() = default

MinHeap<K, V>(const MinHeap<K, V> &other)

MinHeap<K, V>(u32 elements)

bool Empty() const

u32 Size() const

void Minimum(K &key, V &value)

HeapNode<K, V> *Insert(const K &key, const V &value)

void Erase(K &key, V &value)

void Update(HeapNode<K, V> *node, const V &value)

void Resize(u32 elements)

bool Valid() const

MinHeap<K, V> &operator=(const MinHeap<K, V> &other)

HeapNode<K, V> operator[](u32 index)

const HeapNode<K, V> operator[](u32 index) const

u32 mSize

TArray<HeapNode<K, V> *> mPtr