-
rust-lapper
A fast and easy interval overlap library
-
nodit
Discrete Interval Tree Data-Structures, which are based off BTreeMap
-
interavl
An optimised interval tree for efficient interval stabbing
-
iset
Map and set with interval keys (x..y)
-
meminterval
interval-tree in Rust made to store memory mappings
-
superintervals
Interval overlap library
-
normalize_interval
Normalizing interval library
-
sif-itree
immutable, flat interval tree
-
array_range_query
High-performance generic segment tree and lazy segment tree implementations in Rust for efficient range queries, range updates, and interval operations. Supports custom monoid operations with zero-cost abstractions.
-
intervaltree
generic implementation of an immutable interval tree
-
unbounded-interval-tree
An interval tree working with inclusive/exclusive bounds, as well as unbounded intervals. Provides helpers to fetch overlapping intervals, and difference of intervals.
-
nonoverlapping_interval_tree
Map data structure keyed on (non-overlapping) ranges that allows lookup of a point within a range. Can be no_std (with use of alloc crate).
-
iitree-rs
Implicit augmented interval tree (IAITree/cgranges) with memory-mapped disk storage
-
coitrees
A very fast data structure for overlap queries on sets of intervals
-
simd-intervaltree
A SIMD-accelerated interval tree with zero-allocation queries
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
range-action-map
A range tree, offering interval operation in kernel memory management, and deliver ACTION to actual VmArea。一个区间树结构,用于提供 mmap / munmap / mprotect 时对内核中区间的操作;
-
store-interval-tree
A balanced unbounded interval-tree in Rust with associated values in the nodes
-
grove
A segment tree library enabling generic user-defined queries and actions on segments of your data
-
rudac
common data structures and algorithms
-
lz_diet
An AVL balanced Discrete Interval Encoding Tree
-
rb-interval-map
rb-interval-mapis a map based on interval tree -
kd_interval_tree
Implements a K-dimensional interval tree, for fast interval-overlap lookup. Binary-tree based implementation, i.e. O(log(n)) lookups.
-
im_interval_tree
An immutable data structure for storing and querying a collection of intervals
-
rbtree-defrag-buffer
Red-black tree based defragmentation buffer that maintains inserted and free intervals
-
scailist
A fast and easy interval overlap library
-
interval-rbtree
An interval tree implementation using Red-Black Tree as its underlying data structure
-
theban_interval_tree
Interval Tree implementation
-
ivt
An interval tree implementation using inclusive ranges
-
dbs-allocator
a resource allocator for virtual machine manager
-
diet
A Discrete Interval Encoding Tree implementation
-
interval_tree
A variant of interval tree data structure in Rust
Try searching with DuckDuckGo.