[−][src]Enum ranges::Relation
This enum represents all possible arrangements of two GenericRange
s.
The original values were moved, possibly modified, and then stored.
Note
The following information is additionally contained if applicable:
- which of the two ranges was
self
andother
- if the overlap is a singleton
- if
start
orother
is a singleton - which of
self
andother
is shorter
This information is the result of the comparison of the starts and ends of both ranges and is
obtained "for free" and should thus be used preferably to other methods like
GenericRange::is_singleton()
.
Variants
Fields of Disjoint
first: GenericRange<T>
The end of this range is less than the start of second
.
second: GenericRange<T>
The start of this range is greater than the end of first
.
self_less: bool
When GenericRange::relation(self, other)
was invoked, either self
or other
were less.
The two ranges have no overlap but the end of the first touches the start of the second.
Diagram
first : |----------|
second: |----------|
Fields of Touching
first: GenericRange<T>
The end of this range touches the start of second
.
second: GenericRange<T>
The start of this range touches the end of first
.
self_less: bool
When GenericRange::relation(self, other)
was invoked, either self
or other
were less when sorted using Ord
.
The two ranges have an overlap of one or more elements.
Diagram
first : |----------|
second : |----------|
first disjoint : |-------|
second disjoint: |-------|
overlap : |--|
Fields of Overlapping
first_disjoint: GenericRange<T>
Range representing the disjoint part of two ranges before the overlap.
second_disjoint: GenericRange<T>
Range representing the disjoint part of two ranges after the overlap.
overlap: GenericRange<T>
Range representing the overlapping part of two ranges.
self_less: bool
When GenericRange::relation(self, other)
was invoked, either self
or other
was less.
overlap_is_singleton: bool
Indicates whether or not the overlap is by a single element, allowing optimization.
One range is contained in the other.
Diagram
first : |--------------------|
second : |----------|
first disjoint : |----|
second disjoint: |----|
overlap : |----------|
Fields of Containing
first_disjoint: GenericRange<T>
Range representing the disjoint part of two ranges before the overlap.
second_disjoint: GenericRange<T>
Range representing the disjoint part of two ranges after the overlap.
overlap: GenericRange<T>
Range representing the overlapping part of two ranges.
self_shorter: bool
When GenericRange::relation(self, other)
was invoked, either self
or other
was shorter.
Both ranges have the same start but varying endings.
Diagram
first : |-----|
second : |----------|
overlap : |-----|
disjoint: |----|
Fields of Starting
overlap: GenericRange<T>
Range representing the overlapping part of two ranges.
disjoint: GenericRange<T>
Range representing the disjoint part of two ranges.
self_shorter: bool
Indicates if self
or other
in GenericRange::relation(self, other)
is shorter.
shorter_is_singleton: bool
Depending on which of self
or other
is shorter, this boolean indicates that it is a
singleton.
Both ranges have the same end but varying starts.
Diagram
first : |----------|
second : |----|
disjoint: |-----|
overlap : |----|
Fields of Ending
disjoint: GenericRange<T>
Range representing the disjoint part of two ranges.
overlap: GenericRange<T>
Range representing the overlapping part of two ranges.
self_shorter: bool
Indicates if self
or other
in GenericRange::relation(self, other)
is shorter.
shorter_is_singleton: bool
Depending on which of self
or other
is shorter, this boolean indicates that it is a
singleton.
Equal(GenericRange<T>)
The starts and ends of both ranges are equal.
Diagram
first : |----------|
second: |----------|
equal : |----------|
One or both ranges are empty and can therefore not be compared.
Diagram
first :
second : |----|
non_empty: |----|
Fields of Empty
non_empty: Option<GenericRange<T>>
The non empty range of the two ranges, if it exists.
self_empty: Option<bool>
Indicates which of the two inputs of GenericRange::arrangement(&self, &other)
were
empty. Returns None
if both were empty.
Trait Implementations
impl<T: Debug + Domain> Debug for Relation<T>
[src]
impl<T: Eq + Domain> Eq for Relation<T>
[src]
impl<T: PartialEq + Domain> PartialEq<Relation<T>> for Relation<T>
[src]
impl<T: Domain> StructuralEq for Relation<T>
[src]
impl<T: Domain> StructuralPartialEq for Relation<T>
[src]
Auto Trait Implementations
impl<T> Send for Relation<T> where
T: Send,
T: Send,
impl<T> Sync for Relation<T> where
T: Sync,
T: Sync,
impl<T> Unpin for Relation<T> where
T: Unpin,
T: Unpin,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,