Trait sets::SetOps [−][src]
pub trait SetOps<T> where
T: Copy, { fn reverse(&self) -> Self
where
T: PartialOrd + Copy; fn nonrepeat(&self) -> Self
where
T: PartialOrd + Copy; fn infsup(&self) -> (T, usize, T, usize)
where
T: PartialOrd + Copy; fn member(&self, m: T) -> bool
where
T: PartialOrd; fn search(&self, m: T) -> Option<usize>
where
T: PartialOrd; fn union(&self, s: &Self) -> OrderedSet<T>
where
T: PartialOrd; fn intersection(&self, s: &Self) -> OrderedSet<T>
where
T: PartialOrd; fn difference(&self, s: &Self) -> OrderedSet<T>
where
T: PartialOrd; }
Expand description
Common methods for all four of the set structs.
Required methods
fn reverse(&self) -> Self where
T: PartialOrd + Copy,
fn reverse(&self) -> Self where
T: PartialOrd + Copy,
reverses the vector of explicit sets and index of indexed sets
fn nonrepeat(&self) -> Self where
T: PartialOrd + Copy,
fn nonrepeat(&self) -> Self where
T: PartialOrd + Copy,
Deletes any repetitions
Finds minimum, minimum’s first index, maximum, maximum’s first index
fn member(&self, m: T) -> bool where
T: PartialOrd,
fn member(&self, m: T) -> bool where
T: PartialOrd,
True if m is a member of the set
fn search(&self, m: T) -> Option<usize> where
T: PartialOrd,
fn search(&self, m: T) -> Option<usize> where
T: PartialOrd,
Search of a set, returns Some(index) of the last item found, or None.
fn union(&self, s: &Self) -> OrderedSet<T> where
T: PartialOrd,
fn union(&self, s: &Self) -> OrderedSet<T> where
T: PartialOrd,
Union of two sets of the same type
fn intersection(&self, s: &Self) -> OrderedSet<T> where
T: PartialOrd,
fn intersection(&self, s: &Self) -> OrderedSet<T> where
T: PartialOrd,
Intersection of two sets of the same type
fn difference(&self, s: &Self) -> OrderedSet<T> where
T: PartialOrd,
fn difference(&self, s: &Self) -> OrderedSet<T> where
T: PartialOrd,
Removing s from self (i.e. self-s)