Struct AverMap 

pub struct AverMap<K, V> { /* private fields */ }

Implementations

impl<K, V> AverMap<K, V>

where K: Eq + Hash + Clone, V: Clone,

pub fn new() -> Self

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

pub fn contains_key(&self, key: &K) -> bool

pub fn insert(&self, key: K, value: V) -> Self

O(n) because &self preserves the original map.

pub fn insert_owned(self, key: K, value: V) -> Self

O(1) amortized if unique owner, O(n) clone if shared.

pub fn remove(&self, key: &K) -> Self

O(n) because &self preserves the original map.

pub fn remove_owned(self, key: &K) -> Self

O(1) amortized if unique owner, O(n) clone if shared.

pub fn keys(&self) -> impl Iterator<Item = &K>

pub fn values(&self) -> impl Iterator<Item = &V>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>

Trait Implementations

impl<K: AverDisplay + Clone + Eq + Hash + Ord, V: AverDisplay + Clone> AverDisplay for AverMap<K, V>

fn aver_display(&self) -> String

fn aver_display_inner(&self) -> String

impl<K, V> Clone for AverMap<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Eq + Hash + Clone, V: Debug + Clone> Debug for AverMap<K, V>

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

Formats the value using the given formatter.

impl<K, V> Default for AverMap<K, V>

where K: Eq + Hash + Clone, V: Clone,

fn default() -> Self

Returns the “default value” for a type.

impl<K: Eq + Hash + Clone + Ord, V: Hash + Clone> Hash for AverMap<K, V>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<K, V> Index<&K> for AverMap<K, V>

where K: Eq + Hash + Clone, V: Clone,

type Output = V

The returned type after indexing.

fn index(&self, key: &K) -> &V

Performs the indexing (container[index]) operation.

impl<K: Eq + Hash + Clone + PartialEq, V: PartialEq + Clone> PartialEq for AverMap<K, V>

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.

impl<K: Eq + Hash + Clone, V: Eq + Clone> Eq for AverMap<K, V>