Struct Interval 

pub struct Interval<N>(/* private fields */)
where
    N: Ord + Clone;

An Interval wraps the std::ops::Range from the stdlib and is defined by a start and end field where end should be >= start.

Implementations

impl<N> Interval<N>

where N: Ord + Clone,

pub fn new(r: Range<N>) -> Result<Interval<N>, Error>

Construct a new Interval from the given Range. Will return Err if end < start.

Methods from Deref<Target = Range<N>>

pub fn contains<U>(&self, item: &U) -> bool

where Idx: PartialOrd<U>, U: PartialOrd<Idx> + ?Sized,

Returns true if item is contained in the range.

Examples

assert!(!(3..5).contains(&2));
assert!( (3..5).contains(&3));
assert!( (3..5).contains(&4));
assert!(!(3..5).contains(&5));

assert!(!(3..3).contains(&3));
assert!(!(3..2).contains(&3));

assert!( (0.0..1.0).contains(&0.5));
assert!(!(0.0..1.0).contains(&f32::NAN));
assert!(!(0.0..f32::NAN).contains(&0.5));
assert!(!(f32::NAN..1.0).contains(&0.5));

pub fn is_empty(&self) -> bool

Returns true if the range contains no items.

Examples

assert!(!(3..5).is_empty());
assert!( (3..3).is_empty());
assert!( (3..2).is_empty());

The range is empty if either side is incomparable:

assert!(!(3.0..5.0).is_empty());
assert!( (3.0..f32::NAN).is_empty());
assert!( (f32::NAN..5.0).is_empty());

Trait Implementations

impl<N> Clone for Interval<N>

where N: Clone + Ord,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N> Debug for Interval<N>

where N: Debug + Ord + Clone,

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

Formats the value using the given formatter.

impl<N> Default for Interval<N>

where N: Default + Ord + Clone,

fn default() -> Interval<N>

Returns the “default value” for a type.

impl<N> Deref for Interval<N>

where N: Ord + Clone,

Use the Deref operator to get a reference to Range wrapped by the Interval newtype.

type Target = Range<N>

The resulting type after dereferencing.

fn deref(&self) -> &<Interval<N> as Deref>::Target

Dereferences the value.

impl<'de, N> Deserialize<'de> for Interval<N>

where N: Ord + Clone + Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D, ) -> Result<Interval<N>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a, N> From<&'a Range<N>> for Interval<N>

where N: Ord + Clone,

Convert a reference to a Range to an interval by cloning. This conversion will panic if the Range has end < start

fn from(r: &Range<N>) -> Interval<N>

Converts to this type from the input type.

impl<N> From<Range<N>> for Interval<N>

where N: Ord + Clone,

Convert a Range into an Interval. This conversion will panic if the Range has end < start

fn from(r: Range<N>) -> Interval<N>

Converts to this type from the input type.

impl<N> Hash for Interval<N>

where N: Hash + Ord + Clone,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<N> PartialEq for Interval<N>

where N: PartialEq + Ord + Clone,

fn eq(&self, other: &Interval<N>) -> 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<N> Serialize for Interval<N>

where N: Ord + Clone + Serialize,

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<N> Eq for Interval<N>

where N: Eq + Ord + Clone,

impl<N> StructuralPartialEq for Interval<N>

where N: Ord + Clone,