rossanoventurini / qwtLinks
A Rust implementation of the Quad Wavelet Tree
☆42Updated last month
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 this week
- Collection of succinct data structures in Rust☆98Updated 3 months ago
- Simple succinct data structures (in Rust)☆50Updated 6 months ago
- PtrHash minimal perfect hash function, based of PTHash☆59Updated 3 weeks ago
- A Rust interface for the Succinct Data Structure Library.☆14Updated 3 years ago
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆31Updated 2 weeks ago
- Hardware go brrr bounded context suffix array construction algorithm☆18Updated last year
- Rust libraries and programs focused on succinct data structures☆142Updated this week
- Fast and scalable minimal perfect hashing for massive key sets☆140Updated 11 months ago
- Voracious radix sort☆68Updated last year
- FM-index for Rust☆22Updated last month
- Parallel Construction of Suffix Arrays in Rust☆23Updated last month
- Low(est?)-latency OpenMP-style minimalistic scoped thread-pool designed for 'Fork-Join' parallelism in Rust and C++, avoiding memory allo…☆81Updated this week
- Succinct Data Structures for Rust☆58Updated 2 weeks ago
- Succinct data structures using very efficient rank and select☆119Updated 2 weeks ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- Integer sets as fast, sorted, integer ranges with full set operations☆87Updated 3 weeks ago
- A Rust port of the WebGraph framework☆54Updated this week
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated 3 weeks ago
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆107Updated 2 years ago
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆124Updated 4 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 2 months ago
- Fast approximate string searching☆29Updated this week
- ☆15Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆87Updated this week
- k-Medoids clustering in Rust with the FasterPAM algorithm☆24Updated 6 months ago
- A very fast interval tree data structure☆122Updated 4 months ago
- Rust implementation of a fast, easy, interval tree library nim-lapper☆62Updated last year