Module heap 

A custom binary heap implementation for performant top K aggregation

Macros

compare_float 🔒

compare_integer 🔒

Structs

HeapItem 🔒

An entry in our heap, which contains both the value and a index into an external HashTable

PrimitiveHeap

An implementation of ArrowHeap that deals with primitive values

TopKHeap 🔒

A custom heap implementation that allows several things that couldn’t be achieved with collections::BinaryHeap:

Traits

ArrowHeap

An interface to hide the generic type signature of TopKHeap behind arrow arrays

Comparable

A custom version of Ord that only exists to we can implement it for the Values in our heap

ValueType

A “type alias” for Values which are stored in our heap

Functions

new_heap