Alternatives and similar repositories for bsuccinct-rs

Users that are interested in bsuccinct-rs are comparing it to the libraries listed below

• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆127Updated last week
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆102Updated 2 months ago
• ibraheemdev / boxcar
  A concurrent, append-only vector.
  ☆207Updated 4 months ago
• hoxxep / rapidhash
  An extremely fast, high-quality, non-cryptographic hash function. Platform independent compile-time and run-time hashing in rust.
  ☆185Updated this week
• sarah-quinones / pulp
  ☆311Updated last month
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆101Updated 4 months ago
• vigna / epserde-rs
  An ε-copy serialization/deserialization framework for Rust
  ☆167Updated last week
• facebookexperimental / allocative
  Library and proc macro to analyze memory usage of data structures in rust.
  ☆192Updated 3 weeks ago
• brurucy / indexset
  A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…
  ☆104Updated last week
• gungraun / gungraun
  High-precision, one-shot and consistent benchmarking framework/harness for Rust. All Valgrind tools at your fingertips.
  ☆184Updated last week
• declanvk / blart
  ☆59Updated 2 months ago
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆150Updated last week
• isaacholt100 / bnum
  Arbitrary, fixed size numeric types that extend the functionality of primitive numeric types in Rust.
  ☆116Updated 3 weeks ago
• zommiommy / mem_dbg-rs
  A trait + derive to recursively compute / print the memory usage of a data structure.
  ☆38Updated last week
• tomtomwombat / fastbloom
  The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.
  ☆310Updated 3 months ago
• Shnatsel / bounds-check-cookbook
  Recipes for avoiding bounds checks in Rust, without unsafe!
  ☆131Updated 2 years ago
• asynchronics / tachyonix
  An asynchronous, multi-producer, single-consumer (MPSC) bounded channel that operates at tachyonic speeds
  ☆152Updated last year
• koute / schnellru
  A fast and flexible LRU map.
  ☆198Updated 11 months ago
• valebes / ppl
  Parallelo Parallel Library (PPL) is a small parallel framework that brings Structured Parallel Programming in Rust.
  ☆78Updated 3 months ago
• sarah-quinones / fastdiv
  ☆38Updated 3 years ago
• LaihoE / SIMD-itertools
  Faster implementations of standard library operations like find, filter, position etc.
  ☆178Updated 10 months ago
• lakwet / voracious_sort
  Voracious radix sort
  ☆71Updated 2 weeks ago
• jonhoo / atone
  A `VecDeque` (and `Vec`) variant that spreads resize load across pushes.
  ☆115Updated 2 weeks ago
• nickbabcock / highway-rs
  Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function
  ☆174Updated 4 months ago
• danielhenrymantilla / nougat.rs
  (lifetime) GATs on stable Rust
  ☆59Updated last year
• orlp / foldhash
  A fast, non-cryptographic, minimally DoS-resistant hashing algorithm for Rust.
  ☆329Updated 4 months ago
• wvwwvwwv / scalable-delayed-dealloc
  Scalable and lock-free memory reclamation system
  ☆37Updated last week
• PSeitz / binggan
  Benchmarking library for stable Rust
  ☆47Updated this week
• avl / arcshift
  Variant of Rust's std::Arc that supports atomic replacement of the value.
  ☆103Updated 4 months ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆92Updated last year