Struct Interval 

pub struct Interval<T>
where
    T: Copy + PartialOrd,
{
    pub start: T,
    pub end: T,
}

Half-open time interval [start, end).

Half-open intervals are convenient for period arithmetic because adjacent intervals such as [a, b) and [b, c) touch without overlapping.

Fields

start: T

Inclusive lower bound.

end: T

Exclusive upper bound.

Implementations

impl<T> Interval<T>

where T: Copy + PartialOrd,

pub fn new<S, E>(start: S, end: E) -> Interval<T>

where S: Into<T>, E: Into<T>,

Construct without validation.

This accepts any start/end pair, including reversed or NaN-like endpoints. Prefer try_new when the bounds come from computation or external input.

pub fn try_new<S, E>( start: S, end: E, ) -> Result<Interval<T>, InvalidIntervalError>

where S: Into<T>, E: Into<T>,

Validating constructor: rejects start > end and NaN endpoints.

Zero-length intervals where start == end are allowed.

pub fn intersection(&self, other: &Interval<T>) -> Option<Interval<T>>

Overlap as a half-open range. Returns None if the intervals touch only at a point or do not overlap.

pub fn union(&self, other: &Interval<T>) -> Vec<Interval<T>>

Smallest interval covering both self and other, together with any gap between them.

Returns one interval when they overlap or touch, two when they are strictly disjoint (sorted by start time).

This pairwise API preserves disjointness instead of forcing a merged interval that would invent coverage through the gap.

pub fn complement(&self, periods: &[Interval<T>]) -> Vec<Interval<T>>

Gaps inside self that are not covered by any interval in periods.

periods must be sorted and non-overlapping (see Interval::validate). Intervals outside self are effectively ignored except for how they advance the internal cursor.

pub fn try_complement( &self, periods: &[Interval<T>], ) -> Result<Vec<Interval<T>>, PeriodListError>

Checked variant of complement.

Validates that self is well ordered and that periods is sorted, non-overlapping, and internally valid before computing the complement.

pub fn validate(periods: &[Interval<T>]) -> Result<(), PeriodListError>

Check that a list is sorted, non-overlapping, and each start <= end.

Touching intervals such as [a, b) followed by [b, c) are valid.

pub fn intersect_many(a: &[Interval<T>], b: &[Interval<T>]) -> Vec<Interval<T>>

Intersection of two sorted, non-overlapping period lists. O(n + m).

pub fn try_intersect_many( a: &[Interval<T>], b: &[Interval<T>], ) -> Result<Vec<Interval<T>>, PeriodListError>

Checked variant of intersect_many.

Validates both input lists before computing their intersection.

pub fn union_many(a: &[Interval<T>], b: &[Interval<T>]) -> Vec<Interval<T>>

Union of two sorted period lists.

Overlapping and adjacent intervals are merged. The result is sorted and non-overlapping.

pub fn normalize(periods: &[Interval<T>]) -> Vec<Interval<T>>

Sort and merge overlapping or adjacent intervals.

This is useful for normalizing hand-built or concatenated period lists before later set operations.

Trait Implementations

impl<T> Clone for Interval<T>

where T: Clone + Copy + PartialOrd,

fn clone(&self) -> Interval<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Interval<T>

where T: Debug + Copy + PartialOrd,

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

Formats the value using the given formatter.

impl<T> Display for Interval<T>

where T: Copy + PartialOrd + Display,

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

Formats the value using the given formatter.

impl<T> PartialEq for Interval<T>

where T: PartialEq + Copy + PartialOrd,

fn eq(&self, other: &Interval<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> Copy for Interval<T>

where T: Copy + PartialOrd,

impl<T> StructuralPartialEq for Interval<T>

where T: Copy + PartialOrd,