Struct Interval 

pub struct Interval<T> {
    pub lo: T,
    pub hi: T,
}

Available on crate feature interval-tree only.

A closed interval [lo, hi] used as a key in IntervalTree.

Intervals are ordered by their lower endpoint (lo). Two intervals with the same lo are further ordered by their upper endpoint (hi).

Fields

lo: T

Inclusive lower bound.

hi: T

Inclusive upper bound.

Implementations

impl<T: Ord> Interval<T>

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

Creates a new interval [lo, hi].

Panics

Panics if lo > hi.

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

Returns true if this interval overlaps with other.

Two intervals overlap if they share at least one point: [a, b] overlaps [c, d] iff a <= d && c <= b.

pub fn contains_point(&self, point: &T) -> bool

Returns true if this interval contains point.

pub fn len(&self) -> T

where T: Sub<Output = T> + Copy,

Returns the length of the interval as hi - lo.

pub fn is_point(&self) -> bool

where T: PartialEq,

Returns true if lo == hi (a degenerate point interval).

Trait Implementations

impl<T: Ord + Clone + Default, V> Augment<Interval<T>, V> for MaxHi<T>

type Stats = T

Maximum hi value in this subtree. None only for the transient uninitialized state.

fn compute( key: &Interval<T>, _value: &V, left: Option<(&Interval<T>, &V, &Self::Stats)>, right: Option<(&Interval<T>, &V, &Self::Stats)>, ) -> Self::Stats

Computes the augmented data for a node given its key, value, and the augmented data of its left and right children.

impl<T: Clone> Clone for Interval<T>

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: Copy> Copy for Interval<T>

impl<T: Debug> Debug for Interval<T>

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

Formats the value using the given formatter.

impl<T: Display> Display for Interval<T>

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

Formats the value using the given formatter.

impl<T: Eq> Eq for Interval<T>

impl<T: Ord, KBound, V> InOrderPruningPolicy<Interval<T>, V, T> for IntervalOverlapPolicy<T, KBound>

where KBound: Borrow<T>,

fn is_match(&self, key: &Interval<T>, _value: &V, _stats: &T) -> bool

Evaluates if the current node satisfies the lookup constraints.

fn should_explore_left( &self, left: (&Interval<T>, &V, &T), _current: (&Interval<T>, &V, &T), ) -> bool

Determines if the left child branch should be explored or pruned.

fn should_explore_right( &self, right: (&Interval<T>, &V, &T), current: (&Interval<T>, &V, &T), ) -> bool

Determines if the right child branch should be explored or pruned.

impl<T: Ord> Ord for Interval<T>

fn cmp(&self, other: &Self) -> 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<T: PartialEq> PartialEq for Interval<T>

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

Equality operator ==.

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

Inequality operator !=.

impl<T: Ord> PartialOrd for Interval<T>

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<T: PartialEq> StructuralPartialEq for Interval<T>