Struct SortedParMap 

pub struct SortedParMap {
    pub ps: HashMap<Par, Par>,
    pub sorted_list: Vec<(Par, Par)>,
    /* private fields */
}

Fields

ps: HashMap<Par, Par>

sorted_list: Vec<(Par, Par)>

Implementations

impl SortedParMap

pub fn create_from_map(map: HashMap<Par, Par>) -> Self

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

pub fn create_from_empty() -> Self

pub fn insert(&mut self, kv: (Par, Par)) -> SortedParMap

pub fn extend(&mut self, kvs: Vec<(Par, Par)>) -> SortedParMap

pub fn remove(&mut self, key: Par) -> SortedParMap

pub fn remove_multiple(&mut self, keys: Vec<Par>) -> SortedParMap

pub fn apply(&self, key: Par) -> Option<Par>

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

pub fn get(&self, key: Par) -> Option<Par>

pub fn get_or_else(&self, key: Par, default: Par) -> Par

pub fn keys(&self) -> Vec<Par>

pub fn values(&self) -> Vec<Par>

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

pub fn length(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl Clone for SortedParMap

fn clone(&self) -> SortedParMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortedParMap

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

Formats the value using the given formatter.

impl IntoIterator for SortedParMap

type Item = (Par, Par)

The type of the elements being iterated over.

type IntoIter = IntoIter<<SortedParMap as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for SortedParMap

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.