Struct sets::RankedSet

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

Struct holding a borrowed unordered set and a vector of its ranks (ascending or descending).

Fields

ascending: bool

v: Vec<T>

i: Vec<usize>

Implementations

impl<T> RankedSet<T>

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

Initiliser, ranks an unordered slice

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

Initiliser, ranks an unordered Set

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

From Oredered is not often needed, as the index will be trivial

pub fn from_indexed(s: &IndexedSet<T>, asc: bool) -> Self where
    T: PartialOrd + Copy, 

Converts sort index to ranks

Trait Implementations

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

Display implemented for struct IndexedSet.

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

Formats the value using the given formatter.