16 releases (stable)

1.3.0 Dec 30, 2019
1.2.2 Dec 17, 2018
1.2.0 Jun 2, 2018
1.1.1 May 30, 2018
0.1.2 Jun 13, 2016

#365 in Data structures

Download history 18307/week @ 2024-10-16 20179/week @ 2024-10-23 19647/week @ 2024-10-30 18027/week @ 2024-11-06 20272/week @ 2024-11-13 17918/week @ 2024-11-20 16641/week @ 2024-11-27 25806/week @ 2024-12-04 19342/week @ 2024-12-11 11523/week @ 2024-12-18 6436/week @ 2024-12-25 16440/week @ 2025-01-01 22341/week @ 2025-01-08 19391/week @ 2025-01-15 19980/week @ 2025-01-22 16028/week @ 2025-01-29

82,846 downloads per month
Used in 58 crates (11 directly)

MIT/Apache

38KB
902 lines

min-max-heap: a double-ended priority queue

Build Status Crates.io License: MIT License: Apache 2.0

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.3.0"

This crate supports Rust version 1.32.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.

Dependencies

~160KB