Hazard pointers in Rust.
☆217Dec 6, 2025Updated 2 months ago
Alternatives and similar repositories for haphazard
Users that are interested in haphazard are comparing it to the libraries listed below
Sorting:
- ☆30Jun 13, 2021Updated 4 years ago
- A lock-free, append-only atomic pool.☆68May 29, 2022Updated 3 years ago
- A port of Java's ConcurrentHashMap to Rust☆575Nov 30, 2025Updated 3 months ago
- A lock-free, read-optimized, concurrency primitive.☆2,085Feb 1, 2026Updated last month
- Compile-time reference counting☆456May 18, 2025Updated 9 months ago
- ☆94Sep 18, 2023Updated 2 years ago
- An unordered multiset/bag implementation backed by HashMap☆76Feb 1, 2026Updated last month
- A benchmarking harness for concurrent key-value collections☆119Feb 5, 2023Updated 3 years ago
- A fast bump allocation arena for Rust☆2,117Updated this week
- Wordle Solver inspired by 3blue1brown☆235Oct 15, 2022Updated 3 years ago
- ☆179Dec 7, 2023Updated 2 years ago
- Concurrency permutation testing tool for Rust.☆2,616Feb 20, 2026Updated last week
- Gather author, contributor and publisher data on crates in your dependency graph.☆347Feb 5, 2026Updated 3 weeks ago
- ☆64Feb 16, 2026Updated 2 weeks ago
- Automatic performance regression tests for Rust code☆16Jan 27, 2020Updated 6 years ago
- Fast, efficient, and robust memory reclamation for Rust.☆467Sep 13, 2025Updated 5 months ago
- A `VecDeque` (and `Vec`) variant that spreads resize load across pushes.☆116Feb 1, 2026Updated last month
- Timer facilities for Tokio based on OS-level primitives.☆14May 7, 2020Updated 5 years ago
- Byte-wise atomic memcpy.☆43Feb 25, 2026Updated last week
- in-place allocation-reusing queues for Rust☆394Jun 6, 2024Updated last year
- A crate for managing memory bit by bit☆1,375Aug 9, 2024Updated last year
- Z is a Java library providing accessible, consistent function combinators.☆28Nov 9, 2023Updated 2 years ago
- bluss/IndexMap with amortized resizes☆14Dec 21, 2020Updated 5 years ago
- ☆36Aug 8, 2024Updated last year
- Find the load at which a benchmark falls over.☆36Jul 31, 2020Updated 5 years ago
- ☆247Jan 25, 2026Updated last month
- An implementation of a LRU cache☆787Jan 7, 2026Updated last month
- Heap profiling and ad hoc profiling for Rust programs.☆938Feb 20, 2025Updated last year
- a debugger for async rust!☆4,422Feb 3, 2026Updated last month
- Rust port of Google's SwissTable hash map☆2,866Feb 22, 2026Updated last week
- A crate for safe and ergonomic pin-projection.☆704Updated this week
- Portable interface to epoll, kqueue, event ports, and wepoll☆713Feb 7, 2026Updated 3 weeks ago
- Async I/O and timers☆587Feb 15, 2026Updated 2 weeks ago
- Copy-on-write string utilities for Rust☆163Apr 11, 2024Updated last year
- Non-owning unsafe I/O☆23Aug 6, 2025Updated 6 months ago
- Efficient, lock-free, bounded Rust broadcast channel☆837Sep 9, 2023Updated 2 years ago
- Type erasure for async trait methods☆2,120Feb 16, 2026Updated 2 weeks ago
- Concurrently Readable Data Structures for Rust☆363Feb 10, 2026Updated 3 weeks ago
- Async executor☆439Feb 18, 2026Updated 2 weeks ago