Trait sets::MutSetOps

pub trait MutSetOps<T> {
    fn mreverse(&mut self);
    fn mnonrepeat(&mut self);
    fn munion(&mut self, s: &Self);
    fn mintersection(&mut self, s: &Self);
    fn mdifference(&mut self, s: &Self);
}

Required methods

fn mreverse(&mut self)

reverses the vector of explicit sets and index of indexed sets

fn mnonrepeat(&mut self)

Deletes any repetitions

fn munion(&mut self, s: &Self)

Union of two sets of the same type

fn mintersection(&mut self, s: &Self)

Intersection of two sets of the same type

fn mdifference(&mut self, s: &Self)

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

Implementors

impl<T> MutSetOps<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> MutSetOps<T> for OrderedSet<T> where
    T: Copy + PartialOrd, 

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

The primitive functions from indxvec all expect indexed sets, so for now we convert from ranks to sort indices using .invindex(). Even though that is a simple operation, for lots of set operations, it will be slightly quicker to work in IndexedSet(s) and only to rank the final result.

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