Crate min_max_heap [−] [src]
A double-ended priority queue.
A min-max-heap is like a binary heap, but it allows extracting both
the minimum and maximum value efficiently. In particular, finding
either the minimum or maximum element is O(1)
. A removal of either
extremum, or an insertion, is O(log n)
.
Usage
It’s on crates.io, so add
this to your Cargo.toml
:
[dependencies]
min-max-heap = "*"
And add this to your crate root:
rust extern crate min_max_heap;
References
My reference for a min-max heap is
here. Much
of this code is also based on BinaryHeap
from the standard
library.
Structs
Drain |
A draining iterator over the elements of the min-max-heap in arbitrary order. |
IntoIter |
An owning iterator over the elements of the min-max-heap in arbitrary order. |
Iter |
A borrowed iterator over the elements of the min-max-heap in arbitrary order. |
MinMaxHeap |
A double-ended priority queue. |