Struct sets::IndexedSet

pub struct IndexedSet<T> {
    pub ascending: bool,
    pub v: Vec<T>,
    pub i: Vec<usize>,
}

Struct holding an unordered set and its sort index. Thus it is an index ordered set (ascending or descending).

Fields

ascending: bool

v: Vec<T>

i: Vec<usize>

Implementations

impl<'a, T> IndexedSet<T>

pub fn from_slice(s: &'a [T], asc: bool) -> Self where
    T: PartialOrd + Copy, 

Initialiser, indexsorts an unordered slice

pub fn from_set(s: &'a Set<T>, asc: bool) -> Self where
    T: PartialOrd + Copy, 

Initialiser, indexsorts an unordered Set

pub fn from_ordered(s: &'a OrderedSet<T>, asc: bool) -> Self where
    T: PartialOrd + Copy, 

From Oredered, the sort index will be trivial

pub fn from_ranked(s: &'a RankedSet<T>, asc: bool) -> Self where
    T: PartialOrd + Copy, 

Converts ranks to sort index

Trait Implementations

impl<'a, T: Display> Display for IndexedSet<T> where
    T: Copy, 

Display implemented for struct IndexedSet.

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

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.

fn mreverse(&mut self)

just reverse the index

fn mnonrepeat(&mut self)

deletes repetitions.

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

Union of two IndexedSets reassigned to self.
self will be ascending ordered

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

Intersection of two IndexedSets

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

Complement of s in self (i.e. self-s)

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.

fn reverse(&self) -> Self where
    T: Copy, 

just reverse the index

fn nonrepeat(&self) -> Self

Deletes repetitions.

fn infsup(&self) -> (T, usize, T, usize)

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

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>

Search a Set for m. Returns index of the first m.

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

Union of two IndexedSets. Returns an OrderedSet.

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

Intersection of two sets of the same type. Via OrderedSet for convenience, for now. Probably should use intersect_indexed as in union above.

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

Complement of s in self (i.e. self-s)