Struct sets::Set

pub struct Set<T> {
    pub stype: SType,
    pub ascending: bool,
    pub data: Vec<T>,
    pub index: Vec<usize>,
}

The struct type for sets

Fields

stype: SType

type of the set

ascending: bool

order: ascending (true), descending (false)

data: Vec<T>

data Vec

index: Vec<usize>

index Vec

Implementations

impl<T> Set<T>where
    T: Copy + PartialOrd + Default,

Associated functions for conversions and self operations returning Set = Self

pub const EMPTYSET: Set<T> = _

Associated constant EMPTYSET, unique for each concrete end-type T

pub fn new(set_type: SType, d: &[T], asc: bool) -> Self

all in one Initialiser creates a new Set of self_type, from slice d, in asc order

pub fn new_empty() -> Self

Creates a new empty Set

pub fn new_unordered(d: &[T]) -> Self

Initialiser - creates a new SType::Unordered Set from data

pub fn new_ordered(d: &[T], asc: bool) -> Self

Initialiser - creates a new SType::Ordered Set in asc order from data

pub fn new_indexed(d: &[T], asc: bool) -> Self

Initialiser - creates a new SType::Indexed Set in asc order from data

pub fn new_ranked(d: &[T], asc: bool) -> Self

Initialiser - creates a new SType::Ranked Set in asc order from data

pub fn to_unordered(&self) -> Self

Converter - to SType::Unordered Set Caution: this just throws away the valuable index!

pub fn to_ordered(&self, asc: bool) -> Self

Converts any Set type to ordered

pub fn to_indexed(&self, asc: bool) -> Self

Converts any Set type to indexed

pub fn to_ranked(&self, asc: bool) -> Self

Converts any Set type to ranked

pub fn to_same(&self, s: &Self) -> Self

General converter: s -> Set of the same type and order as self self only serves as a template for the type and order and is not involved in the conversion

pub fn insert(&self, item: T) -> Self

Inserts an item of the same end-type to self

pub fn delete(&self, item: T) -> Self

Deletes an item of the same end-type from self

pub fn reverse(&self) -> Self

Reverses a vec by iterating over only half of its length and swapping the items

pub fn nonrepeat(&self) -> Self

Deletes any repetitions

pub fn union(&self, s: &Self) -> Self

Union of two selfs

pub fn intersection(&self, s: &Self) -> Self

Intersection of two selfs

pub fn difference(&self, s: &Self) -> Self

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

pub fn infsup(&self) -> MinMax<T>where
    T: Default,

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

pub fn search(&self, m: T) -> Option<usize>

Search a Set self for m. Returns the subscript of the first m or None

pub fn member(&self, m: T) -> bool

True if m is a member of the self Throws away the subscript found by search

Trait Implementations

impl<T: Clone> Clone for Set<T>

fn clone(&self) -> Set<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Default> Default for Set<T>

fn default() -> Set<T>

Returns the “default value” for a type.

impl<T: Display> Display for Set<T>where
    T: Copy,

Implementation of Display trait for struct Set.

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

Formats the value using the given formatter.

impl<T> MutSetOps<T> for Set<T>where
    T: Copy + PartialOrd + Default,

fn munordered(&mut self)

Makes a Set unordered Caution: this just throws away the valuable index!

fn mordered(&mut self, quantify: &mut impl FnMut(&T) -> f64, asc: bool)

Makes a Set ordered

fn mindexed(&mut self, quantify: &mut impl FnMut(&T) -> f64, asc: bool)

Makes any Set indexed

fn mranked(&mut self, asc: bool)

Converts any Set type to ranked

fn msame(&mut self, s: &mut Self, quantify: &mut impl FnMut(&T) -> f64)

General converter: s -> Set of the same type and order as self self only serves as a template for the type and order and is not involved in the conversion

fn mdelete(&mut self, item: T) -> boolwhere
    Self: Sized,

Deletes an item from self Returns false if item not found

fn mdeleteall(&mut self, item: T) -> usizewhere
    Self: Sized,

Deletes all occurrences of a matching item from self Returns number found and deleted

fn minsert(&mut self, item: T)

Inserts an item v of the same end-type to self

fn mreverse(&mut self)

Reverses a vec by iterating over only half of its length and swapping the items

fn mnonrepeat(&mut self)

Deletes all repetitions

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

sets union

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

Intersection of two unordered sets, assigned to self

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

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