rossanoventurini / qwtLinks
A Rust implementation of the Quad Wavelet Tree
☆41Updated 3 weeks ago
Alternatives and similar repositories for qwt
Users that are interested in qwt are comparing it to the libraries listed below
Sorting:
- Rust implementations of succinct data structures☆58Updated last week
- Simple succinct data structures (in Rust)☆50Updated 6 months ago
- Collection of succinct data structures in Rust☆96Updated 2 months ago
- PtrHash minimal perfect hash function, based of PTHash☆56Updated last week
- A Rust interface for the Succinct Data Structure Library.☆14Updated 3 years ago
- FM-index for Rust☆22Updated last month
- Succinct data structures using very efficient rank and select☆119Updated 2 weeks ago
- Voracious radix sort☆68Updated last year
- Succinct Data Structures for Rust☆58Updated last year
- Hardware go brrr bounded context suffix array construction algorithm☆18Updated last year
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated 3 weeks ago
- Rust libraries and programs focused on succinct data structures☆140Updated last week
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆124Updated 4 years ago
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated this week
- A Rust port of the WebGraph framework☆53Updated last week
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- Fast and scalable minimal perfect hashing for massive key sets☆140Updated 10 months ago
- Low(est?)-latency OpenMP-style minimalistic scoped thread-pool designed for 'Fork-Join' parallelism in Rust and C++, avoiding memory allo…☆60Updated this week
- Radix sort implementation for sorting by scalar keys (integers, floats, chars, bools)☆22Updated 9 months ago
- Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)☆21Updated last month
- HyperLogLog implementations.☆23Updated 9 months ago
- Integer sets as fast, sorted, integer ranges with full set operations☆85Updated last week
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆107Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Parallel Construction of Suffix Arrays in Rust☆23Updated last month
- SIMD Floating point and integer compressed vector library☆80Updated last year
- Fast hierarchical agglomerative clustering in Rust.☆96Updated last month
- Fast stochastic simulator for chemical reaction networks☆46Updated 3 weeks ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago