axiomhq / hypertwobitsLinks
HyperTwoBits implementation
☆15Updated 2 months ago
Alternatives and similar repositories for hypertwobits
Users that are interested in hypertwobits are comparing it to the libraries listed below
Sorting:
- Rust implementations of succinct data structures☆66Updated this week
- Integer sets as fast, sorted, integer ranges with full set operations☆99Updated last week
- Succinct data structures using very efficient rank and select☆127Updated last week
- Out-of-memory sorting of large datasets map / reduce style processing☆46Updated last month
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- Lightning fast concurrent HyperLogLog for Rust.☆42Updated 3 months ago
- A trait + derive to recursively compute / print the memory usage of a data structure.☆36Updated 2 weeks ago
- HyperLogLog implementations.☆25Updated last year
- Rust implementation of a fast, bounded, Zipf-distributed random number generator☆33Updated 8 months ago
- Rust library implementing xor-filters☆142Updated 2 years ago
- ☆21Updated last year
- Functional command-line JSON processor with a bidirectional type system☆24Updated 5 months ago
- PtrHash minimal perfect hash function☆80Updated 2 months ago
- An ε-copy serialization/deserialization framework for Rust☆159Updated this week
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated 3 months ago
- Fast and scalable minimal perfect hashing for massive key sets☆144Updated last year
- 🦀 A pure rust implementation of the TFHE Fully Homomorphic Encryption Scheme☆33Updated this week
- Detect unused pub methods in a Rust workspace☆42Updated 8 months ago
- Rust libraries and programs focused on succinct data structures☆150Updated last month
- FM-index for Rust☆23Updated 6 months ago
- Rust FFI wrapper for CRoaring☆161Updated this week
- A benchmarking harness for concurrent key-value collections☆118Updated 2 years ago
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆109Updated 2 years ago
- A bit vector with the Rust standard library's portable SIMD API.☆41Updated 2 years ago
- This crate implements the "eytzinger" (aka BFS) array layout where a binary search tree is stored by layer (instead of as a sorted array)…☆24Updated 4 years ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆172Updated 2 months ago
- Fast hierarchical agglomerative clustering in Rust.☆102Updated 6 months ago
- Voracious radix sort☆69Updated last year
- ☆31Updated last month
- Perfect hashing for an imperfect world☆94Updated last month