rossanoventurini / qwtLinks
A Rust implementation of the Quad Wavelet Tree
☆42Updated 3 months 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☆59Updated 3 weeks ago
- Simple succinct data structures (in Rust)☆51Updated 8 months ago
- Collection of succinct data structures in Rust☆99Updated 3 weeks ago
- PtrHash minimal perfect hash function☆66Updated last month
- Voracious radix sort☆68Updated last year
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆31Updated 2 months ago
- FM-index for Rust☆22Updated 3 months ago
- Hardware go brrr bounded context suffix array construction algorithm☆18Updated last year
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆129Updated 4 years ago
- Rust libraries and programs focused on succinct data structures☆144Updated last week
- Succinct Data Structures for Rust☆58Updated 2 months ago
- A Rust interface for the Succinct Data Structure Library.☆14Updated 3 years ago
- Fast and scalable minimal perfect hashing for massive key sets☆141Updated last year
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆109Updated 2 years ago
- Succinct data structures using very efficient rank and select☆125Updated last month
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated 3 weeks ago
- Low(est?)-latency OpenMP-style minimalistic scoped thread-pool designed for 'Fork-Join' parallelism in Rust and C++, avoiding memory allo…☆96Updated this week
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- Integer sets as fast, sorted, integer ranges with full set operations☆91Updated last week
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- ☆15Updated 2 years ago
- A Rust port of the WebGraph framework☆55Updated 3 weeks ago
- SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.☆311Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- A ball-tree implementation for K-NN☆17Updated 11 months ago
- Rust implementation of a fast, easy, interval tree library nim-lapper☆63Updated last month
- Parallel Construction of Suffix Arrays in Rust☆26Updated 3 months ago
- A very fast interval tree data structure☆126Updated 6 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated this week
- Clustering, Learning and Approximation of Manifolds☆20Updated 3 weeks ago