Alternatives and similar repositories for concurrent-hamt

Users that are interested in concurrent-hamt are comparing it to the libraries listed below

• fitzgen / intrusive_splay_tree
  An intrusive splay tree implementation that is no-std compatible and free from allocation and moves
  ☆67Updated 9 months ago
• sujayakar / rsdict
  ☆49Updated 7 months ago
• frankmcsherry / columnation
  An experimental columnar arena
  ☆43Updated last year
• adevore / rudy
  Judy array implementation in pure Rust
  ☆87Updated 8 years ago
• sdleffler / qp-trie-rs
  An idiomatic and fast QP-trie implementation in pure Rust.
  ☆102Updated last year
• fitzgen / bacon-rajan-cc
  ☆94Updated 2 years ago
• graydon / concorde
  ☆28Updated 5 years ago
• Kerollmops / sdset
  Set theory applied on sorted and deduplicated slices.
  ☆47Updated 3 years ago
• ratel-rust / toolshed
  Arena allocator and a handful of useful data structures
  ☆41Updated 5 years ago
• Diggsey / lockless
  Composable, lock-free, allocation-light data structures
  ☆61Updated 7 years ago
• nikomatsakis / dogged
  Experimental persistent collections in Rust
  ☆46Updated 8 years ago
• huonw / llvmint
  ☆27Updated 10 years ago
• rust-bakery / nom-peg
  PEG parser generator built on top of nom
  ☆70Updated 6 years ago
• wagnerf42 / rayon-adaptive
  adaptive algorithms for rayon
  ☆39Updated 5 years ago
• seanmonstar / vecio
  ☆30Updated 4 years ago
• gnzlbg / bitintr
  Portable Bitwise Manipulation Intrinsics
  ☆47Updated last year
• ErichDonGubler / adhesion-rs
  D-inspired contract programming in Rust using macros
  ☆54Updated 4 years ago
• AltSysrq / lmdb-zero
  Near-zero-cost, unabstracted Rust wrapper for LMDB.
  ☆91Updated 4 years ago
• polyfractal / bounded-spsc-queue
  A Bounded SPSC queue for Rust
  ☆162Updated 3 years ago
• salmans / codd
  A minimal in-memory database with relational algebraic expressions as queries
  ☆62Updated 4 years ago
• bluss / indexing
  Sound unchecked indexing using “generativity”; a type system approach to indices, pointers and ranges that are trusted to be in bounds.
  ☆104Updated 6 years ago
• Amanieu / seqlock
  A reader-writer lock that provides extremely fast read access without starving writers
  ☆86Updated 2 years ago
• llogiq / compact_arena
  A crate with indexed arenas with small memory footprint
  ☆79Updated last year
• bytecodealliance / regalloc.rs
  Modular register allocator algorithms
  ☆105Updated 3 years ago
• ibmandura / ArtTree
  Implementation of Adaptive Radix Tree in Rust
  ☆44Updated 5 years ago
• nikomatsakis / perf-focus
  A perf script for helping to answer queries about how much time a given function occupies, where it is called from, and so forth.
  ☆39Updated 7 years ago
• jorendorff / cell-gc
  A very small GC in Rust, with a safe API
  ☆67Updated last year
• gnzlbg / bitwise
  Portable high-level bitwise manipulation algorithms
  ☆53Updated 4 years ago
• quininer / ritsu
  An experimental asynchronous runtime based on `io-uring`.
  ☆77Updated 4 years ago
• crossbeam-rs / crossbeam-epoch
  Epoch-based garbage collection
  ☆81Updated 7 years ago