pub enum RangeDisjoint {
    EmptyBoth,
    EmptyLhs,
    EmptyRhs,
    LessThanProper,
    LessThanAdjacent,
    GreaterThanProper,
    GreaterThanAdjacent,
}
Expand description

Ways in which a pair of ranges (A,B) can be disjoint

Variants§

§

EmptyBoth

A = B = {}

§

EmptyLhs

A = {}

§

EmptyRhs

B = {}

§

LessThanProper

[ A ] [ B ]

§

LessThanAdjacent

[ A ][ B ]

§

GreaterThanProper

[ B ] [ A ]

§

GreaterThanAdjacent

[ B ][ A ]

Implementations§

source§

impl RangeDisjoint

source

pub fn compare<T: PrimInt>( left: &RangeInclusive<T>, right: &RangeInclusive<T> ) -> Option<Self>

Tests two inclusive ranges for disjointness, returning None if they intersect.

assert_eq!(RangeDisjoint::compare (&(0..=5), &(0..=5)), None);
assert_eq!(
  RangeDisjoint::compare (&(1..=0), &(1..=0)),
  Some (RangeDisjoint::EmptyBoth));
assert_eq!(
  RangeDisjoint::compare (&(1..=0), &(0..=5)),
  Some (RangeDisjoint::EmptyLhs));
assert_eq!(
  RangeDisjoint::compare (&(0..=5), &(1..=0)),
  Some (RangeDisjoint::EmptyRhs));
assert_eq!(
  RangeDisjoint::compare (&(0..=2), &(4..=5)),
  Some (RangeDisjoint::LessThanProper));
assert_eq!(
  RangeDisjoint::compare (&(0..=2), &(3..=5)),
  Some (RangeDisjoint::LessThanAdjacent));
assert_eq!(
  RangeDisjoint::compare (&(4..=5), &(0..=2)),
  Some (RangeDisjoint::GreaterThanProper));
assert_eq!(
  RangeDisjoint::compare (&(3..=5), &(0..=2)),
  Some (RangeDisjoint::GreaterThanAdjacent));

Trait Implementations§

source§

impl Debug for RangeDisjoint

source§

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

Formats the value using the given formatter. Read more
source§

impl From<RangeDisjoint> for RangeCompare

source§

fn from(disjoint: RangeDisjoint) -> Self

Converts to this type from the input type.
source§

impl PartialEq for RangeDisjoint

source§

fn eq(&self, other: &RangeDisjoint) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl Eq for RangeDisjoint

source§

impl StructuralEq for RangeDisjoint

source§

impl StructuralPartialEq for RangeDisjoint

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.