rossanoventurini / qwtLinks
A Rust implementation of the Quad Wavelet Tree
☆46Updated last week
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☆67Updated 2 weeks ago
- Collection of succinct data structures in Rust☆100Updated 3 months ago
- PtrHash minimal perfect hash function☆80Updated 2 months ago
- Simple succinct data structures (in Rust)☆51Updated 11 months ago
- Voracious radix sort☆69Updated last year
- FM-index for Rust☆25Updated 6 months ago
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆129Updated 4 years ago
- Succinct Data Structures for Rust☆58Updated 5 months ago
- Fast and scalable minimal perfect hashing for massive key sets☆145Updated last year
- A Rust interface for the Succinct Data Structure Library.☆13Updated 3 years ago
- Rust libraries and programs focused on succinct data structures☆151Updated 2 months ago
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated 5 months ago
- 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☆127Updated last week
- Out-of-memory sorting of large datasets map / reduce style processing☆46Updated last month
- Hardware go brrr bounded context suffix array construction algorithm☆19Updated 2 years ago
- Lower-latency OpenMP-style minimalistic scoped thread-pool designed for 'Fork-Join' parallelism in Rust and C++, avoiding memory allocati…☆283Updated 3 weeks ago
- Integer sets as fast, sorted, integer ranges with full set operations☆100Updated 3 weeks ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- Fast hierarchical agglomerative clustering in Rust.☆102Updated 7 months ago
- A Rust port of the WebGraph framework☆58Updated this week
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- A ball-tree implementation for K-NN☆17Updated last year
- Rust implementation of a fast, easy, interval tree library nim-lapper☆67Updated 4 months ago
- HyperLogLog implementations.☆25Updated last year
- Redistribute Intel MKL as a crate☆90Updated last year
- SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.☆316Updated last year
- HyperTwoBits implementation☆15Updated 2 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆32Updated 7 months ago
- Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)☆20Updated last week