ballard26 / concurrent-hamt
☆82Updated 8 years ago
Alternatives and similar repositories for concurrent-hamt
Users that are interested in concurrent-hamt are comparing it to the libraries listed below
Sorting:
- (More or less) accurate floating point algorithms☆57Updated 9 months ago
- ☆93Updated last year
- Dynamically query a type-erased object for any trait implementation☆65Updated 2 years ago
- ☆48Updated last year
- Experimental persistent collections in Rust☆45Updated 7 years ago
- Judy array implementation in pure Rust☆87Updated 7 years ago
- An intrusive splay tree implementation that is no-std compatible and free from allocation and moves☆67Updated 3 weeks ago
- Rust library providing a counter-based thread barrier☆56Updated 6 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- A crate with indexed arenas with small memory footprint☆77Updated 8 months ago
- ☆30Updated 3 years ago
- Tutorial and demo of rust compiler replacement tooling☆56Updated 4 years ago
- rwlock with writer priority and optimistic reads☆31Updated 10 years ago
- A very small GC in Rust, with a safe API☆62Updated 10 months ago
- A fast map for when one doesn't care about choosing the keys.☆26Updated 6 months ago
- A Bounded SPSC queue for Rust☆160Updated 2 years ago
- An idiomatic and fast QP-trie implementation in pure Rust.☆101Updated last year
- rust verification condition generator☆96Updated 8 years ago
- Composable, lock-free, allocation-light data structures☆60Updated 7 years ago
- An owned, grow-able UTF-8 string that stores small strings inline and avoids heap-allocation.☆68Updated 3 years ago
- Sound unchecked indexing using “generativity”; a type system approach to indices, pointers and ranges that are trusted to be in bounds.☆102Updated 5 years ago
- ☆52Updated 5 years ago
- A qp-trie implementation in Rust☆44Updated 4 months ago
- An experimental columnar arena☆43Updated 6 months ago
- Implements a Rust ordered map as a BurstTrie.☆30Updated 7 years ago
- Arena allocator and a handful of useful data structures☆41Updated 5 years ago
- A perf script for helping to answer queries about how much time a given function occupies, where it is called from, and so forth.☆38Updated 6 years ago
- A contiguous region of bytes, useful for I/O operations.☆33Updated 4 years ago
- Set theory applied on sorted and deduplicated slices.☆45Updated 2 years ago
- A linear solver designed to be easy to use with Rust enums.☆32Updated 4 years ago