Struct erg_common::dict::Dict

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

Implementations

impl<K, V> Dict<K, V>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

pub fn keys(&self) -> Keys<'_, K, V>

pub fn values(&self) -> Values<'_, K, V>

pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>

pub fn into_values(self) -> IntoValues<K, V>

pub fn iter(&self) -> Iter<'_, K, V>

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>

pub fn clear(&mut self)

pub fn retain<F>(&mut self, f: F)where F: FnMut(&K, &mut V) -> bool,

remove all elements for which the predicate returns false

impl<K: Hash + Eq, V> Dict<K, V>

pub fn get<Q>(&self, k: &Q) -> Option<&V>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn get_by(&self, k: &K, cmp: impl Fn(&K, &K) -> bool) -> Option<&V>

pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn contains_key<Q>(&self, k: &Q) -> boolwhere K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn insert(&mut self, k: K, v: V) -> Option<V>

pub fn remove<Q>(&mut self, k: &Q) -> Option<V>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn extend<I: IntoIterator<Item = (K, V)>>(&mut self, iter: I)

NOTE: This method does not consider pairing with values and keys. That is, a value may be paired with a different key (can be considered equal). If you need to consider the pairing of the keys and values, use guaranteed_extend instead.

pub fn guaranteed_extend<I: IntoIterator<Item = (K, V)>>(&mut self, other: I)

pub fn merge(&mut self, other: Self)

pub fn concat(self, other: Self) -> Self

pub fn diff(self, other: &Self) -> Self

pub fn entry(&mut self, k: K) -> Entry<'_, K, V>

Trait Implementations

impl<K: Clone, V: Clone> Clone for Dict<K, V>

fn clone(&self) -> Dict<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for Dict<K, V>

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

Formats the value using the given formatter.

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

fn default() -> Dict<K, V>

Returns the “default value” for a type.

impl<K: Display, V: Display> Display for Dict<K, V>

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

Formats the value using the given formatter.

impl<K: Hash + Eq, V> FromIterator<(K, V)> for Dict<K, V>

fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Dict<K, V>

Creates a value from an iterator.

impl<K: Hash, V: Hash> Hash for Dict<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> IntoIterator for Dict<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = <HashMap<K, V, BuildHasherDefault<FxHasher>> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

fn eq(&self, other: &Dict<K, V>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<K: Hash + Eq, V: Hash + Eq> Eq for Dict<K, V>