vigna / sux-rsLinks
Rust implementations of succinct data structures
☆60Updated last week
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☆42Updated last month
- PtrHash minimal perfect hash function☆72Updated last month
- Simple succinct data structures (in Rust)☆50Updated 10 months ago
- A Rust port of the WebGraph framework☆56Updated this week
- Fast and scalable minimal perfect hashing for massive key sets☆142Updated last year
- Rust libraries and programs focused on succinct data structures☆150Updated 3 weeks ago
- Collection of succinct data structures in Rust☆99Updated 2 months ago
- Succinct Data Structures for Rust☆57Updated 4 months ago
- A Rust interface for the Succinct Data Structure Library.☆13Updated 3 years ago
- Succinct data structures using very efficient rank and select☆126Updated 3 months ago
- Voracious radix sort☆69Updated last year
- Out-of-memory sorting of large datasets map / reduce style processing☆46Updated 2 weeks ago
- Integer sets as fast, sorted, integer ranges with full set operations☆97Updated last month
- FM-index for Rust☆23Updated 5 months ago
- An ε-copy serialization/deserialization framework for Rust☆158Updated last week
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆108Updated 2 years ago
- HyperTwoBits implementation☆14Updated last month
- Fast hierarchical agglomerative clustering in Rust.☆102Updated 5 months ago
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆128Updated 4 years ago
- SIMD Floating point and integer compressed vector library☆80Updated last year
- ☆21Updated last year
- SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.☆313Updated last year
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆144Updated last month
- Hardware go brrr bounded context suffix array construction algorithm☆18Updated last year
- Rust implementation of a fast, easy, interval tree library nim-lapper☆65Updated 3 months ago
- A BK-tree implementation in Rust.☆40Updated last year
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated 3 months ago
- ☆28Updated 11 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago