Trait sets::SetOps

pub trait SetOps<T> {
    fn reverse(&self) -> Self;
    fn nonrepeat(&self) -> Self;
    fn infsup(&self) -> MinMax<T>;
    fn member(&self, m: T) -> bool;
    fn search(&self, m: T) -> Option<usize>;
    fn union(&self, s: &Self) -> OrderedSet<T>;
    fn intersection(&self, s: &Self) -> OrderedSet<T>;
    fn difference(&self, s: &Self) -> OrderedSet<T>;
}

Common methods for all four of the set structs.

Required methods

fn reverse(&self) -> Self

reverses the vector of explicit sets and index of indexed sets

fn nonrepeat(&self) -> Self

Deletes any repetitions

fn infsup(&self) -> MinMax<T>

Finds minimum, minimum’s first index, maximum, maximum’s first index

fn member(&self, m: T) -> bool

True if m is a member of the set

fn search(&self, m: T) -> Option<usize>

Search of a set, returns Some(index) of the last item found, or None.

fn union(&self, s: &Self) -> OrderedSet<T>

Union of two sets of the same type

fn intersection(&self, s: &Self) -> OrderedSet<T>

Intersection of two sets of the same type

fn difference(&self, s: &Self) -> OrderedSet<T>

Removing s from self (i.e. self-s)

Implementors

impl<T> SetOps<T> for IndexedSet<T> where
    T: Copy + PartialOrd, 

These are generally better than OrderedSet(s) for bulky end types, as there is not so much of moving them around.

impl<T> SetOps<T> for OrderedSet<T> where
    T: Copy + PartialOrd, 

impl<T> SetOps<T> for RankedSet<T> where
    T: Copy + PartialOrd, 

For lots of set operations, it is probably better to work in IndexedSet(s) and then only to rank the final result.

impl<T> SetOps<T> for Set<T> where
    T: Copy + PartialOrd,