Struct SortedParHashSet 

pub struct SortedParHashSet {
    pub ps: HashSet<Par>,
    pub sorted_pars: Vec<Par>,
    pub sorted_ps: HashSet<Par>,
}

Fields

ps: HashSet<Par>

sorted_pars: Vec<Par>

sorted_ps: HashSet<Par>

Implementations

impl SortedParHashSet

pub fn create_from_vec(vec: Vec<Par>) -> Self

pub fn create_from_set(set: HashSet<Par>) -> Self

pub fn create_from_empty() -> Self

pub fn insert(&mut self, elem: Par) -> SortedParHashSet

pub fn remove(&mut self, elem: Par) -> SortedParHashSet

pub fn contains(&self, elem: Par) -> bool

pub fn union(&self, that: HashSet<Par>) -> SortedParHashSet

pub fn equals(&self, that: SortedParHashSet) -> bool

pub fn length(&self) -> usize

pub fn sort(par: &Par) -> Par

Trait Implementations

impl Clone for SortedParHashSet

fn clone(&self) -> SortedParHashSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortedParHashSet

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

Formats the value using the given formatter.

impl PartialEq for SortedParHashSet

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.