rossanoventurini / qwtLinks
A Rust implementation of the Quad Wavelet Tree
☆43Updated 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☆66Updated this week
- Collection of succinct data structures in Rust☆100Updated 2 months ago
- Simple succinct data structures (in Rust)☆51Updated 11 months ago
- PtrHash minimal perfect hash function☆77Updated last month
- Fast and scalable minimal perfect hashing for massive key sets☆144Updated last year
- Voracious radix sort☆69Updated last year
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated 4 months ago
- Succinct Data Structures for Rust☆57Updated 4 months ago
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆128Updated 4 years ago
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆109Updated 2 years ago
- Rust libraries and programs focused on succinct data structures☆150Updated last month
- A Rust interface for the Succinct Data Structure Library.☆13Updated 3 years ago
- A ball-tree implementation for K-NN☆17Updated last year
- Succinct data structures using very efficient rank and select☆127Updated last week
- Hardware go brrr bounded context suffix array construction algorithm☆18Updated last year
- Out-of-memory sorting of large datasets map / reduce style processing☆46Updated last month
- FM-index for Rust☆23Updated 5 months ago
- Integer sets as fast, sorted, integer ranges with full set operations☆97Updated 2 months ago
- Lower-latency OpenMP-style minimalistic scoped thread-pool designed for 'Fork-Join' parallelism in Rust and C++, avoiding memory allocati…☆276Updated last week
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- A Rust port of the WebGraph framework☆56Updated last week
- Radix sort implementation for sorting by scalar keys (integers, floats, chars, bools)☆25Updated last year
- SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.☆316Updated last year
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Parallelized zip archive reading☆38Updated 10 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- A very fast interval tree data structure☆125Updated 8 months ago
- Redistribute Intel MKL as a crate☆89Updated last year
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- ☆15Updated 2 years ago