Struct OrderedRange 

pub struct OrderedRange<T: Ord + Clone> {
    pub lo: T,
    pub hi: T,
}

A range structure for ordered types.

Represents the interval [lo, hi] in an ordered set, supporting membership tests, containment, and iteration for integer ranges.

Fields

lo: T

Lower bound (inclusive).

hi: T

Upper bound (inclusive).

Implementations

impl<T: Ord + Clone> OrderedRange<T>

pub fn new(lo: T, hi: T) -> Self

Create a new range [lo, hi]. Panics if lo > hi.

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

Check if a value is within the range.

pub fn contains_range(&self, other: &OrderedRange<T>) -> bool

Check if another range is fully contained within this range.

pub fn overlaps(&self, other: &OrderedRange<T>) -> bool

Check if two ranges overlap.

pub fn lower(&self) -> &T

Return the lower bound.

pub fn upper(&self) -> &T

Return the upper bound.