kampersanda / sucds
Collection of succinct data structures in Rust
☆96Updated 2 months ago
Alternatives and similar repositories for sucds:
Users that are interested in sucds are comparing it to the libraries listed below
- A Rust implementation of the Quad Wavelet Tree☆41Updated this week
- Rust libraries and programs focused on succinct data structures☆138Updated this week
- Rust implementations of succinct data structures☆58Updated 3 weeks ago
- FM-index for Rust☆22Updated last week
- Succinct data structures using very efficient rank and select☆117Updated last month
- Fast and scalable minimal perfect hashing for massive key sets☆140Updated 10 months ago
- Rust wrappers for NGT approximate nearest neighbor search☆38Updated 11 months ago
- Succinct Data Structures for Rust☆57Updated last year
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆107Updated 2 years ago
- PtrHash minimal perfect hash function, based of PTHash☆54Updated last week
- Simple succinct data structures (in Rust)☆50Updated 5 months ago
- Voracious radix sort☆67Updated last year
- A Rust interface for the Succinct Data Structure Library.☆14Updated 3 years ago
- Integer sets as fast, sorted, integer ranges with full set operations☆84Updated this week
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated last month
- A bit vector with the Rust standard library's portable SIMD API.☆40Updated 2 years ago
- An optimised interval tree for efficient interval stabbing☆14Updated 3 months ago
- Hardware go brrr bounded context suffix array construction algorithm☆18Updated last year
- Wavelet Matrix implementation written in Rust☆14Updated 2 years ago
- Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)☆21Updated last month
- Parallel Barnes-Hut t-SNE implementation written in Rust.☆77Updated 7 months ago
- Rust implementation of a fast, easy, interval tree library nim-lapper☆60Updated last year
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated last month
- Concurrency algorithms☆11Updated last month
- ☆34Updated 6 months ago
- An ε-copy serialization/deserialization framework for Rust☆148Updated 2 months ago
- A BK-tree implementation in Rust.☆40Updated last year
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆137Updated last year
- Fast hierarchical agglomerative clustering in Rust.☆96Updated 3 weeks ago
- A Rust data structure for efficient lower-bound lookups☆90Updated last year