Trait sets::MutSetOps [−][src]
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 mnonrepeat(&mut self)
fn mnonrepeat(&mut self)
Deletes any repetitions
fn mintersection(&mut self, s: &Self)
fn mintersection(&mut self, s: &Self)
Intersection of two sets of the same type
fn mdifference(&mut self, s: &Self)
fn mdifference(&mut self, s: &Self)
Removing s from self (i.e. self-s)
Implementors
These are generally better than OrderedSet(s) for bulky end types, as there is not so much of moving them around.
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.