Trait sets::MutSetOps

pub trait MutSetOps<T> {
    fn munordered(&mut self);
    fn mordered(&mut self, asc: bool)
    where
        F64: From<T>;
    fn mindexed(&mut self, asc: bool)
    where
        F64: From<T>;
    fn mranked(&mut self, asc: bool);
    fn msame(&mut self, s: &mut Self)
    where
        F64: From<T>;
    fn mdelete(&mut self, item: T) -> bool;
    fn minsert(&mut self, item: 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);
}

Mutable methods for &mut Set

Required Methods

fn munordered(&mut self)

Makes a Set unordered

fn mordered(&mut self, asc: bool) where
    F64: From<T>, 

Makes a Set ordered

fn mindexed(&mut self, asc: bool) where
    F64: From<T>, 

Makes any Set indexed

fn mranked(&mut self, asc: bool)

Converts any Set type to ranked

fn msame(&mut self, s: &mut Self) where
    F64: From<T>, 

General converter: s -> Set of the same type and order as self

fn mdelete(&mut self, item: T) -> bool

Deletes an item of the same end-type from self

fn minsert(&mut self, item: T)

Inserts an item of the same end-type to self

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 Set<T> where
    T: Copy + PartialOrd + Default,