Crate min_max_heap

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 = "1.2.2"

And add this to your crate root:

extern crate min_max_heap;

This crate supports Rust version 1.24.0 and later.

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.

DrainAsc

A draining iterator over the elements of the min-max-heap in ascending (min-first) order.

DrainDesc

A draining iterator over the elements of the min-max-heap in descending (max-first) 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.