Expand description
An addressable pairing heap implementation for Rust.
Addressable heaps return handles to stored elements that make it possible
to query and edit them. For example this allows for the decrease_key(h: Handle) method
that decreases the key (priority) of the element that is associated with the
given handle.
This implementation stores elements within a Stash that allocates elements
densely within an array.
It is possible to use custom types as the underlying Key type by implementing
the Key trait.
Structs§
- Drain
Min - Iterator over values stored within a
PairingHeapin a sorted-by-min order. Drains the heap. - Handle
- A handle to access stored elements within an addressable pairing heap.
- Pairing
Heap - An addressable pairing heap implementation.
- Values
- Iterator over references to values stored within a
PairingHeap. - Values
Mut - Iterator over mutable references to values stored within a
PairingHeap.
Enums§
- Error
- Errors that can be caused while using
PairingHeap.
Traits§
- Key
- Represents a trait for keys within an addressable pairing heap.
Type Aliases§
- Default
Pairing Heap - Type alias for
PairingHeapthat hasi64as defaultKeytype. - Result
- Generic
Resulttype forPairingHeapmethods.