Cydhra / versLinks
Succinct data structures using very efficient rank and select
☆126Updated 3 months ago
Alternatives and similar repositories for vers
Users that are interested in vers are comparing it to the libraries listed below
Sorting:
- An ε-copy serialization/deserialization framework for Rust☆156Updated last week
- Rust libraries and programs focused on succinct data structures☆149Updated 2 weeks ago
- Perfect hashing for an imperfect world☆93Updated 3 weeks ago
- Integer sets as fast, sorted, integer ranges with full set operations☆97Updated last month
- ☆277Updated 2 weeks ago
- A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…☆102Updated 2 months ago
- An extremely fast, high-quality, non-cryptographic hash function. Platform independent compile-time and run-time hashing in rust.☆168Updated this week
- ☆36Updated 3 years ago
- A concurrent, append-only vector.☆200Updated last month
- A fast, non-cryptographic, minimally DoS-resistant hashing algorithm for Rust.☆303Updated last month
- Faster implementations of standard library operations like find, filter, position etc.☆178Updated 7 months ago
- High-precision, one-shot and consistent benchmarking framework/harness for Rust. All Valgrind tools at your fingertips.☆165Updated last week
- Rust microbenchmarking harness based on paired-testing methodology☆140Updated this week
- Atomically updatable variants of Arc and Weak for lock-free concurrency.☆185Updated 11 months ago
- Yet another string type for Rust☆89Updated last week
- ☆142Updated last month
- A trait + derive to recursively compute / print the memory usage of a data structure.☆33Updated 7 months ago
- Parallel iterator processing library for Rust☆103Updated 2 years ago
- An asynchronous, multi-producer, single-consumer (MPSC) bounded channel that operates at tachyonic speeds☆138Updated last year
- How fast can we recognize a word from a small pre-determined set?☆80Updated 8 months ago
- Variant of Rust's std::Arc that supports atomic replacement of the value.☆101Updated last month
- Parallel processing with disjoint indices in Rust☆90Updated 5 months ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- A Rust code linter☆216Updated last year
- Fantastic serialization library☆160Updated last year
- cargo-add command to make dependencies into dylibs☆101Updated 3 years ago
- Map data structure whose keys are stored as ranges☆95Updated 3 weeks ago
- The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.☆295Updated 2 weeks ago
- Recipes for avoiding bounds checks in Rust, without unsafe!☆126Updated 2 years ago
- An SoA library for Rust☆151Updated 7 months ago