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).
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. |