Enum Inclusion

pub enum Inclusion<T> {
    Left(T),
    Both(T, T),
    Right(T),
}

The sets an element is included in.

Variants

Left(T)

Both(T, T)

Right(T)

Implementations

impl<T> Inclusion<T>

pub fn union(self) -> T

Return the element, whichever set it is in. If it is in both sets, the left element is returned.

pub fn intersection(self) -> Option<T>

Return the element if it is in both sets. The left element is returned.

pub fn difference(self) -> Option<T>

Return the element if it is in the left set.

pub fn symmetric_difference(self) -> Option<T>

Return the element if it is in exactly one set.

pub fn ordering(&self) -> Ordering

Return an Ordering based on where the element is from.

• Ordering::Less: from the right set.
• Ordering::Equal: from both sets
• Ordering::Greater: from the left set.

Trait Implementations

impl<T: Clone> Clone for Inclusion<T>

fn clone(&self) -> Inclusion<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Inclusion<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for Inclusion<T>

fn eq(&self, other: &Inclusion<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<T: Copy> Copy for Inclusion<T>

impl<T: Eq> Eq for Inclusion<T>

impl<T> StructuralPartialEq for Inclusion<T>