Struct IntervalSet 

pub struct IntervalSet<T: IntervalBound> { /* private fields */ }

A finite union of half-open intervals [start, end), kept in normal form.

Empty intervals (start == end) contribute nothing and are dropped.

Examples

Up-time of an asset in a reporting window, where planned and unplanned stops overlap:

use u_numflow::collections::IntervalSet;

let planned = IntervalSet::from_intervals([(0.0, 24.0)]).unwrap();
let unplanned = IntervalSet::from_intervals([(10.0, 30.0)]).unwrap();
let window = IntervalSet::from_intervals([(0.0, 168.0)]).unwrap();

let down = planned.union(&unplanned); // [0, 30): the 14 h overlap counts once
assert_eq!(down.measure(), 30.0);
assert_eq!(window.difference(&down).measure(), 138.0);

Implementations

impl<T: IntervalBound> IntervalSet<T>

pub fn new() -> Self

The empty set.

pub fn from_intervals<I>(intervals: I) -> Result<Self, IntervalError>

where I: IntoIterator<Item = (T, T)>,

Builds the union of (start, end) pairs, each read as [start, end).

Overlapping and touching pieces are merged; empty ones are dropped.

Errors

IntervalError::Reversed for a pair with start > end, IntervalError::NotFinite for a NaN or infinite bound — with the pair’s position in intervals.

pub fn insert(&mut self, start: T, end: T) -> Result<(), IntervalError>

Adds [start, end) to the set.

Errors

As from_intervals, with index 0.

pub fn iter(&self) -> impl Iterator<Item = (T, T)> + '_

The normal-form pieces, in increasing order.

pub fn as_slice(&self) -> &[(T, T)]

The normal-form pieces as a slice.

pub fn len(&self) -> usize

Number of disjoint pieces.

pub fn is_empty(&self) -> bool

Whether the set contains no point.

pub fn measure(&self) -> T::Length

Total length of the set — each point counted once.

pub fn contains(&self, t: T) -> bool

Whether t lies in the set (start <= t < end for some piece).

pub fn union(&self, other: &Self) -> Self

Points in either set.

pub fn intersection(&self, other: &Self) -> Self

Points in both sets.

pub fn difference(&self, other: &Self) -> Self

Points in self but not in other.

pub fn clip(&self, start: T, end: T) -> Result<Self, IntervalError>

The part of the set inside [start, end).

Errors

As from_intervals, with index 0.

Trait Implementations

impl<T: Clone + IntervalBound> Clone for IntervalSet<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + IntervalBound> Debug for IntervalSet<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: IntervalBound> Default for IntervalSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: PartialEq + IntervalBound> PartialEq for IntervalSet<T>

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<T: PartialEq + IntervalBound> StructuralPartialEq for IntervalSet<T>