Trait math::set::traits::Intersect

pub trait Intersect<S, O> {
    fn intersect(&self, other: S) -> O;
    fn has_non_empty_intersection_with(&self, other: S) -> bool;
}

Required methods

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

fn has_non_empty_intersection_with(&self, other: S) -> bool

Loading content...

Implementations on Foreign Types

impl<T: Clone + Eq + Hash, '_> Intersect<&'_ HashSet<T, RandomState>, HashSet<T, RandomState>> for HashSet<T>

fn intersect(&self, other: &HashSet<T>) -> HashSet<T>

fn has_non_empty_intersection_with(&self, other: &HashSet<T>) -> bool

Loading content...

Implementors

impl<E, '_> Intersect<&'_ ContiguousIntegerSet<E>, OrderedIntegerSet<E>> for OrderedIntegerSet<E> where
    E: Integer + Copy + ToPrimitive, 

fn intersect(&self, other: &ContiguousIntegerSet<E>) -> OrderedIntegerSet<E>

fn has_non_empty_intersection_with(
    &self,
    other: &ContiguousIntegerSet<E>
) -> bool

impl<E, '_> Intersect<&'_ OrderedIntegerSet<E>, OrderedIntegerSet<E>> for OrderedIntegerSet<E> where
    E: Integer + Copy + ToPrimitive, 

fn intersect(&self, other: &OrderedIntegerSet<E>) -> OrderedIntegerSet<E>

fn has_non_empty_intersection_with(&self, other: &OrderedIntegerSet<E>) -> bool

impl<E: Integer + Copy, '_> Intersect<&'_ ContiguousIntegerSet<E>, Option<ContiguousIntegerSet<E>>> for ContiguousIntegerSet<E>

fn intersect(
    &self,
    other: &ContiguousIntegerSet<E>
) -> Option<ContiguousIntegerSet<E>>

fn has_non_empty_intersection_with(
    &self,
    other: &ContiguousIntegerSet<E>
) -> bool

impl<E: Integer + Copy + ToPrimitive, '_> Intersect<&'_ OrderedIntegerSet<E>, OrderedIntegerSet<E>> for ContiguousIntegerSet<E>

fn intersect(&self, other: &OrderedIntegerSet<E>) -> OrderedIntegerSet<E>

fn has_non_empty_intersection_with(&self, other: &OrderedIntegerSet<E>) -> bool

Loading content...