Expand description

A “max heap store” is a storage wrapper that implements a binary tree maxheap data structure. https://en.wikipedia.org/wiki/Min-max_heap Implementation based on https://algorithmtutor.com/Data-Structures/Tree/Binary-Heaps/

Insertion O(log n) Remove max O(log n)

Structs

A type allowing only reads from an max heap store. useful in the context of queries.

A type allowing both reads from and writes to the maxheap store at a given storage location.