[−][src]Module heapless::binary_heap
A priority queue implemented with a binary heap.
Insertion and popping the largest element have O(log n) time complexity. Checking the largest
/ smallest element is O(1).
Structs
| BinaryHeap | A priority queue implemented with a binary heap. |
| PeekMut | Structure wrapping a mutable reference to the greatest item on a
|
Enums
| Max | Max-heap |
| Min | Min-heap |