main-- / rust-intervaltree
☆20Updated last year
Alternatives and similar repositories for rust-intervaltree:
Users that are interested in rust-intervaltree are comparing it to the libraries listed below
- Rust implementation of a fast, easy, interval tree library nim-lapper☆58Updated 11 months ago
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated this week
- Rust LZ4 bindings☆50Updated 2 months ago
- A BK-tree implementation in Rust.☆40Updated last year
- Trait generalization of the fundamental types☆42Updated 9 months ago
- NumPy file format (de-)serialization in Rust☆31Updated 5 years ago
- SIMD aligned data structures to work with `std::simd`.☆8Updated 2 months ago
- Small and fast library for k-means clustering.☆44Updated 3 months ago
- Fast and scalable minimal perfect hashing for massive key sets☆139Updated 8 months ago
- Fast hierarchical agglomerative clustering in Rust.☆95Updated last year
- This crate provides Discrete Interval Tree Data-Structures, which are based off BTreeMap☆43Updated 6 months ago
- Lossless functionality for platform-native strings.☆71Updated 3 weeks ago
- Simple object to count Rust iterables☆28Updated 8 months ago
- Migrated to Codeberg☆80Updated last year
- SmallVec-backed stack string optimisation☆44Updated 4 years ago
- structured parallel execution for async Rust☆33Updated 6 months ago
- Multi backend HashMap for higher performance on different key space sizes☆26Updated 2 months ago
- Automatic cfg for Rust compiler features☆95Updated 5 months ago
- A library with task executors for Rust☆32Updated 2 months ago
- A library for generating Graphviz DOT language files for graphs.☆74Updated 2 years ago
- Parse integers directly from `[u8]` slices in safe code☆56Updated last year
- A Rust data structure for efficient lower-bound lookups☆90Updated last year
- Full-service command-line parsing☆70Updated last week
- Exposes arch-specific intrinsics as safe function (via cfg).☆52Updated 2 weeks ago
- Parallel Barnes-Hut t-SNE implementation written in Rust.