Generic d-ary heap priority queue supporting min/max via comparator, with O(1) item lookup for updates. Features configurable arity, efficient priority updates, and cross-language API compatibility.
Priority queue traits and high performance d-ary heap implementations.
A d-ary heap
A library containing an implementation of a minimum, maximum, d-way heap.
A SIMD-accelerated priority queue
A crate for calculating the heap usage of a data structure.
Production-grade data structures and algorithms — zero external dependencies
High-performance, schema-agnostic, backend-agnostic event bus
High-performance, schema-agnostic, backend-agnostic event bus
A highly parallel Perl 5 interpreter written in Rust
A tiny macro library for creating std::collections
libc heap array allocator
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.