main-- / rust-intervaltreeLinks
☆21Updated last year
Alternatives and similar repositories for rust-intervaltree
Users that are interested in rust-intervaltree are comparing it to the libraries listed below
Sorting:
- Fast hierarchical agglomerative clustering in Rust.☆100Updated 3 months ago
- Integer sets as fast, sorted, integer ranges with full set operations☆89Updated last month
- Fast and scalable minimal perfect hashing for massive key sets☆140Updated last year
- A library for generating Graphviz DOT language files for graphs.☆76Updated 3 months ago
- Hidden Markov Models in Rust☆76Updated last year
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated last month
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆107Updated 2 years ago
- Rust implementation of a fast, easy, interval tree library nim-lapper☆63Updated last week
- A vec-backed tree structure with tree-specific generational indexes.☆40Updated last year
- A BK-tree implementation in Rust.☆40Updated last year
- Parallel iterator processing library for Rust☆103Updated last year
- Trait generalization of the fundamental types☆44Updated last year
- Multi backend HashMap for higher performance on different key space sizes☆28Updated 6 months ago
- SIMD aligned data structures to work with `std::simd`.☆8Updated 7 months ago
- Succinct data structures using very efficient rank and select☆119Updated 2 weeks ago
- Rust LZ4 bindings☆53Updated 6 months ago
- Multi-threaded Compression☆165Updated 2 months ago
- Parallel Barnes-Hut t-SNE implementation written in Rust.☆88Updated last week
- Rust libraries and programs focused on succinct data structures☆144Updated this week
- Histograms with a configurable number of buckets, and a terminal-friendly Display.☆31Updated last year
- Parallelized zip archive reading☆37Updated 6 months ago
- A sanity checker for global allocations in Rust☆51Updated 3 months ago
- A rust crate to find the total size of an object, on the stack and on the heap☆108Updated last year
- A Rust data structure for efficient lower-bound lookups☆91Updated last year
- Zero-cost bitsets over native Rust types☆78Updated 3 months ago
- An ε-copy serialization/deserialization framework for Rust☆149Updated 2 weeks ago
- Making floating-point behave.☆78Updated 7 months ago
- Map data structure whose keys are stored as ranges☆89Updated 6 months ago
- ☆57Updated last year
- Extract differences between arbitrary datastructures☆90Updated last year