Struct Interval

pub struct Interval<I, T>
where
    I: PrimInt + Unsigned + Ord + Clone + Send + Sync,
    T: Eq + Clone + Send + Sync,
{
    pub start: I,
    pub stop: I,
    pub val: T,
}

Represent a range from [start, stop) Inclusive start, exclusive of stop

Fields

start: I

stop: I

val: T

Implementations

impl<I, T> Interval<I, T>

where I: PrimInt + Unsigned + Ord + Clone + Send + Sync, T: Eq + Clone + Send + Sync,

pub fn intersect(&self, other: &Interval<I, T>) -> I

Compute the intsect between two intervals

pub fn overlap(&self, start: I, stop: I) -> bool

Check if two intervals overlap

Trait Implementations

impl<I, T> Clone for Interval<I, T>

where I: PrimInt + Unsigned + Ord + Clone + Send + Sync + Clone, T: Eq + Clone + Send + Sync + Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I, T> Debug for Interval<I, T>

where I: PrimInt + Unsigned + Ord + Clone + Send + Sync + Debug, T: Eq + Clone + Send + Sync + Debug,

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

Formats the value using the given formatter.

impl<I, T> Ord for Interval<I, T>

where I: PrimInt + Unsigned + Ord + Clone + Send + Sync, T: Eq + Clone + Send + Sync,

fn cmp(&self, other: &Interval<I, T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<I, T> PartialEq for Interval<I, T>

where I: PrimInt + Unsigned + Ord + Clone + Send + Sync, T: Eq + Clone + Send + Sync,

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

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

const 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<I, T> PartialOrd for Interval<I, T>

where I: PrimInt + Unsigned + Ord + Clone + Send + Sync, T: Eq + Clone + Send + Sync,

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<I, T> Eq for Interval<I, T>

where I: PrimInt + Unsigned + Ord + Clone + Send + Sync + Eq, T: Eq + Clone + Send + Sync + Eq,