#union-find #disjoint-set #range #primitive-integer

no-std range_union_find

A union-find data structure for ranges

10 releases

0.5.0 Jun 2, 2023
0.4.4 Jan 3, 2023
0.4.3 Oct 23, 2022
0.4.2 May 19, 2022
0.4.1 Jul 2, 2021

#1200 in Data structures

Download history 7758/week @ 2024-10-02 5654/week @ 2024-10-09 10596/week @ 2024-10-16 7935/week @ 2024-10-23 7647/week @ 2024-10-30 6249/week @ 2024-11-06 5724/week @ 2024-11-13 8084/week @ 2024-11-20 10133/week @ 2024-11-27 13854/week @ 2024-12-04 14004/week @ 2024-12-11 6731/week @ 2024-12-18 568/week @ 2024-12-25 5583/week @ 2025-01-01 13683/week @ 2025-01-08 10367/week @ 2025-01-15

30,285 downloads per month
Used in 2 crates (via choice-string)

MIT/Apache

65KB
1K SLoC

range_union_find

Crates.io Crates.io License License

This crate implements a union-find data structure for ranges that supports PrimInts and Floats.

See the API documentation for more information.


lib.rs:

Provides a data structure backed by a vector for unioning ranges of integers. We intelligently merge inserted ranges to minimize required storage.

Example usage:

let mut range_holder = RangeUnionFind::<u32>::new();
range_holder.insert_range(&(4..=8))?;
range_holder.insert_range(&(6..=10))?;
assert_eq!(range_holder.has_range(&(2..=12))?, OverlapType::Partial(7));
assert_eq!(range_holder.has_range(&(5..=9))?, OverlapType::Contained);

The main type is the RangeUnionFind struct, with the NumInRange trait implemented for primitive integer and float types that can be used to form ranges. While we make a best effort to support floating point ranges, unexpected issues may arise with floating point imprecision.

Dependencies

~140–410KB