Practical extension methods for standard Rust collections
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps.
A static dispatch, faster alternative to rust-key-paths - Type-safe, composable keypaths for Rust with superior performance
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps.
A Min Priority Queue implemented as a Thin Wrapper around BinaryHeap from the Standard Library
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps. Makes some previously internal function public
A Bucket Queue data structure that can be used as a Priority Queue.
Direct ports of the standard library's BTreeMap, BTreeSet and BinaryHeap collections, but that sort according to a specified total order rather than the `Ord` trait
A d-ary heap
Flexible binary heaps
Enhanced version of std::collections::BinaryHeap that supports increase and decrease key, max, min, and custom-order heaps.
Priority queue traits and high performance d-ary heap implementations.