Struct Interval 

pub struct Interval<I, T> {
    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: PrimInt, T> Interval<I, T>

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

where I: Archive, T: Archive,

type Archived = ArchivedInterval<I, T>

The archived representation of this type.

type Resolver = IntervalResolver<I, T>

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

const COPY_OPTIMIZATION: CopyOptimization<Self> = _

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<__D: Fallible + ?Sized, I, T> Deserialize<Interval<I, T>, __D> for Archived<Interval<I, T>>

where I: Archive, <I as Archive>::Archived: Deserialize<I, __D>, T: Archive, <T as Archive>::Archived: Deserialize<T, __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<Interval<I, T>, <__D as Fallible>::Error>

Deserializes using the given deserializer

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

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

fn eq(&self, other: &Interval<I, 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<I: Ord, T> PartialOrd for Interval<I, 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<__S: Fallible + ?Sized, I, T> Serialize<__S> for Interval<I, T>

where I: Serialize<__S>, T: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

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