[][src]Trait spaces::Intersection

pub trait Intersection<S = Self> {
    fn intersect(self, other: &S) -> Self;

    fn intersect_many(self, other_spaces: &[S]) -> Self
    where
        Self: Sized
, { ... } }

Trait for types that can be combined in the form of an intersection.

The intersection of a collection of sets is the set that contains only those elements present in each.

Required methods

fn intersect(self, other: &S) -> Self

Return the smallest space enclosing self and other of type Self.

Loading content...

Provided methods

fn intersect_many(self, other_spaces: &[S]) -> Self where
    Self: Sized

Return the smallest space enclosing self and all other_spaces of type Self.

Loading content...

Implementors

impl Intersection<Binary> for Binary[src]

impl Intersection<Integers> for Integers[src]

impl Intersection<Naturals> for Naturals[src]

impl Intersection<NonNegativeIntegers> for NonNegativeIntegers[src]

impl Intersection<NonZeroIntegers> for NonZeroIntegers[src]

impl Intersection<Ordinal> for Ordinal[src]

impl Intersection<NonNegativeReals> for NonNegativeReals[src]

impl Intersection<PositiveReals> for PositiveReals[src]

impl Intersection<Reals> for Reals[src]

impl<D1: Intersection, D2: Intersection> Intersection<PairSpace<D1, D2>> for PairSpace<D1, D2>[src]

impl<D: Intersection + Clone> Intersection<TwoSpace<D>> for TwoSpace<D>[src]

impl<D: Space + Intersection + Clone> Intersection<ProductSpace<D>> for ProductSpace<D>[src]

impl<T: Clone + PartialOrd> Intersection<Interval<T>> for Interval<T>[src]

Loading content...