A priority queue for Rust with efficient change function.
-
Updated
Mar 24, 2025 - Rust
8000
A priority queue for Rust with efficient change function.
Convert jemalloc heap profiles to pprof to understand memory usage, fix memory leaks, and fix OOM Kills.
A memory efficient container for rust nested collections
Blazing fast Priority Queue that allows sorting for elements with partial ordering
Priority queue traits and efficient d-ary heap implementations.
Common data structure and algorithms for rust-lang
a Rust implementation of a hollow heap
A compiler supporting heap allocated structures and functions defined by lambdas
A wrapper around Rc<RefCell<T>> allowing immediate access to inner methods, without the need for .borrow() or .borrow_mut(), allowing for a more seamless pointer experience.
A Fibonacci Heap implementation in Rust
Add a description, image, and links to the heap topic page so that developers can more easily learn about it.
To associate your repository with the heap topic, visit your repo's landing page and select "manage topics."