#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

#1265 in Data structures

Download history 7157/week @ 2024-11-16 10316/week @ 2024-11-23 12378/week @ 2024-11-30 14644/week @ 2024-12-07 10740/week @ 2024-12-14 1434/week @ 2024-12-21 2233/week @ 2024-12-28 11620/week @ 2025-01-04 12965/week @ 2025-01-11 12586/week @ 2025-01-18 13087/week @ 2025-01-25 15416/week @ 2025-02-01 18480/week @ 2025-02-08 8714/week @ 2025-02-15 8399/week @ 2025-02-22 9085/week @ 2025-03-01

48,311 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