Struct casper_execution_engine::shared::additive_map::AdditiveMap

pub struct AdditiveMap<K, V, S = RandomState>(/* private fields */);

An associative container that looks and works like a normal HashMap except that, instead of overwriting existing items, it adds the new value to the existing value.

Implementations

impl<K: Eq + Hash, V> AdditiveMap<K, V, RandomState>

pub fn new() -> Self

Creates an empty AdditiveMap.

impl<K: Eq + Hash, V: AddAssign + Default, S: BuildHasher> AdditiveMap<K, V, S>

pub fn insert_add(&mut self, key: K, value_to_add: V)

Modifies the existing value stored under key, or the default value for V if none, by adding value_to_add.

impl<K, V, S> AdditiveMap<K, V, S>

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

An iterator visiting all keys in arbitrary order. The iterator element type is &'a K.

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

An iterator visiting all values in arbitrary order. The iterator element type is &'a V.

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

An iterator visiting all key-value pairs in arbitrary order. The iterator element type is (&'a K, &'a V).

pub fn len(&self) -> usize

Returns the number of keys in the map.

pub fn is_empty(&self) -> bool

Returns true if the map contains no keys.

impl<K: Eq + Hash, V, S: BuildHasher> AdditiveMap<K, V, S>

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

Returns a reference to the value corresponding to a key.

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

Inserts a key-value pair into the map.

If the map did not have this key present, None is returned. If the map did have this key present, the value is updated, and the old value is returned.

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

Removes a key from the map, returning the value at the key if the key was previously in the map.

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

Removes a key from the map, returning the stored key and value if the key was previously in the map.

Trait Implementations

impl<K: Clone, V: Clone, S: Clone> Clone for AdditiveMap<K, V, S>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Eq + Hash + Debug, V: Debug, S: BuildHasher> Debug for AdditiveMap<K, V, S>

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

Formats the value using the given formatter.

impl<K: Eq + Hash, V, S: BuildHasher + Default> Default for AdditiveMap<K, V, S>

fn default() -> Self

Returns the “default value” for a type.

impl From<ExecutionJournal> for AdditiveMap<Key, Transform>

fn from(journal: ExecutionJournal) -> Self

Converts to this type from the input type.

impl<K: Eq + Hash, V, S: BuildHasher + Default> FromIterator<(K, V)> for AdditiveMap<K, V, S>

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self

Creates a value from an iterator.

impl<K, Q, V, S> Index<&Q> for AdditiveMap<K, V, S>where K: Eq + Hash + Borrow<Q>, Q: Eq + Hash + ?Sized, S: BuildHasher,

type Output = V

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<'a, K, V, S> IntoIterator for &'a AdditiveMap<K, V, S>

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, K, V>

Creates an iterator from a value.

impl<'a, K, V, S> IntoIterator for &'a mut AdditiveMap<K, V, S>

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.

type IntoIter = IterMut<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IterMut<'a, K, V>

Creates an iterator from a value.

impl<K, V, S> IntoIterator for AdditiveMap<K, V, S>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IntoIter<K, V>

Creates an iterator from a value.

impl<K: Eq + Hash, V: PartialEq, S: BuildHasher> PartialEq for AdditiveMap<K, V, S>

fn eq(&self, other: &AdditiveMap<K, V, S>) -> 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: Eq + Hash, V: Eq, S: BuildHasher> Eq for AdditiveMap<K, V, S>