vigna / sux-rsLinks
Rust implementations of succinct data structures
☆68Updated 2 weeks ago
Alternatives and similar repositories for sux-rs
Users that are interested in sux-rs are comparing it to the libraries listed below
Sorting:
- A Rust implementation of the Quad Wavelet Tree☆50Updated last week
- PtrHash minimal perfect hash function☆88Updated 5 months ago
- Collection of succinct data structures in Rust☆102Updated 6 months ago
- Integer sets as fast, sorted, integer ranges with full set operations☆105Updated last week
- A Rust port of the WebGraph framework☆58Updated this week
- Fast and scalable minimal perfect hashing for massive key sets☆148Updated last year
- FM-index for Rust☆26Updated 9 months ago
- Succinct data structures using very efficient rank and select☆129Updated last month
- Voracious radix sort☆71Updated 2 months ago
- A Rust interface for the Succinct Data Structure Library.☆15Updated 4 years ago
- Succinct Data Structures for Rust☆59Updated 8 months ago
- Rust libraries and programs focused on succinct data structures☆153Updated last week
- Simple succinct data structures (in Rust)☆54Updated last month
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆109Updated 2 years ago
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆129Updated 5 years ago
- Out-of-memory sorting of large datasets map / reduce style processing☆46Updated last month
- HyperTwoBits implementation☆16Updated 5 months ago
- Fast hierarchical agglomerative clustering in Rust.☆104Updated 10 months ago
- An ε-copy serialization/deserialization framework for Rust☆169Updated 2 weeks ago
- SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.☆327Updated last month
- SIMD Floating point and integer compressed vector library☆80Updated 2 years ago
- Hardware go brrr bounded context suffix array construction algorithm☆19Updated 2 years ago
- A trait + derive to recursively compute / print the memory usage of a data structure.☆40Updated 3 weeks ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- A small and fast FM-Index for Rust☆42Updated last week
- HyperLogLog implementations.☆27Updated last year
- ☆21Updated 2 years ago
- Rust implementation of a fast, easy, interval tree library nim-lapper☆70Updated 7 months ago
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆31Updated 3 weeks ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆157Updated last week