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
  ☆112Updated last week
• vigna / epserde-rs
  An ε-copy serialization/deserialization framework for Rust
  ☆144Updated last month
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆96Updated last month
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆55Updated last week
• RagnarGrootKoerkamp / PtrHash
  PtrHash minimal perfect hash function, based of PTHash
  ☆51Updated last week
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆84Updated this week
• iai-callgrind / iai-callgrind
  High-precision and consistent benchmarking framework/harness for Rust
  ☆131Updated this week
• orlp / foldhash
  A fast, non-cryptographic, minimally DoS-resistant hashing algorithm for Rust.
  ☆238Updated 3 weeks ago
• stalwartlabs / hashify
  Perfect hashing for an imperfect world
  ☆88Updated 2 months ago
• facebookexperimental / allocative
  Library and proc macro to analyze memory usage of data structures in rust.
  ☆149Updated last month
• sarah-quinones / pulp
  ☆242Updated 2 months 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…
  ☆89Updated this week
• ejmahler / strength_reduce
  Faster integer division and modulus operations
  ☆87Updated 2 years ago
• lun3x / multi_index_map
  Simple and flexible multi-index containers.
  ☆106Updated 7 months ago
• StephanvanSchaik / mmap-rs
  A cross-platform and safe Rust API to create and manage memory mappings in the virtual address space of the calling process.
  ☆66Updated last year
• sarah-quinones / fastdiv
  ☆35Updated 3 years ago
• koute / schnellru
  A fast and flexible LRU map.
  ☆181Updated 3 months ago
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆137Updated 11 months ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆90Updated last year
• Crazytieguy / gat-lending-iterator
  ☆21Updated 6 months ago
• valebes / ppl
  Parallelo Parallel Library (PPL) is a small parallel framework that brings Structured Parallel Programming in Rust.
  ☆75Updated last week
• aarc-rs / aarc
  Atomically updatable variants of Arc and Weak for lock-free concurrency.
  ☆181Updated 5 months ago
• ibraheemdev / boxcar
  A concurrent, append-only vector.
  ☆153Updated 2 weeks ago
• avl / arcshift
  Variant of Rust's std::Arc that supports atomic replacement of the value.
  ☆85Updated this week
• matklad / arbtest
  A minimalist property-based testing library
  ☆109Updated last month
• tomtomwombat / fastbloom
  The fastest Bloom filter in Rust. No accuracy compromises. Compatible with any hasher.
  ☆204Updated last month
• willcrichton / indexical
  Human-friendly indexed collections
  ☆53Updated last month
• nickbabcock / highway-rs
  Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function
  ☆162Updated this week
• wvwwvwwv / scalable-delayed-dealloc
  Scalable and lock-free memory reclamation system
  ☆25Updated last month
• wyfo / swap-buffer-queue
  A buffering MPSC queue.
  ☆78Updated 8 months ago