Struct scrypto::prelude::NonIterMap

pub struct NonIterMap<K, V, S = RandomState>(HashMap<K, V, S>)
where
    K: Eq + Hash,
    S: BuildHasher;

A thin wrapper around a HashMap, which guarantees that a HashMap usage will not result in a non-deterministic execution (simply by disallowing the iteration over its elements).

Tuple Fields

0: HashMap<K, V, S>

Implementations

impl<K, V> NonIterMap<K, V>

where K: Hash + Eq,

pub fn new() -> NonIterMap<K, V>

Creates an empty map.

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

Gets the given key’s corresponding entry in the map for in-place manipulation.

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 get<Q>(&self, key: &Q) -> Option<&V>

where Q: Hash + Eq + ?Sized, K: Borrow<Q>,

Returns a reference to the value corresponding to the key.

pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>

where Q: Hash + Eq + ?Sized, K: Borrow<Q>,

Returns a mutable reference to the value corresponding to the key.

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

where Q: Hash + Eq + ?Sized, K: Borrow<Q>,

Returns true if the map contains a value for the specified key.

pub fn remove<Q>(&mut self, key: &Q) -> Option<V>

where Q: Hash + Eq + ?Sized, K: Borrow<Q>,

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

pub fn clear(&mut self)

Clears the map, removing all key-value pairs.

pub fn len(&self) -> usize

Returns the number of elements in the map.

pub fn is_empty(&self) -> bool

Returns whether the map is empty

Trait Implementations

impl<K, V, S> Clone for NonIterMap<K, V, S>

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V, S> Debug for NonIterMap<K, V, S>

where K: Debug + Eq + Hash, V: Debug, S: Debug + BuildHasher,

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

Formats the value using the given formatter.

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

where K: Hash + Eq,

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

Returns the “default value” for a type.

impl<K, V> FromIterator<(K, V)> for NonIterMap<K, V>

where K: Hash + Eq,

fn from_iter<T>(iter: T) -> NonIterMap<K, V>

where T: IntoIterator<Item = (K, V)>,

Creates a value from an iterator.

impl<K, V, S> PartialEq for NonIterMap<K, V, S>

where K: PartialEq + Eq + Hash, V: PartialEq, S: PartialEq + BuildHasher,

fn eq(&self, other: &NonIterMap<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, V, S> Eq for NonIterMap<K, V, S>

where K: Eq + Hash, V: Eq, S: Eq + BuildHasher,

impl<K, V, S> StructuralPartialEq for NonIterMap<K, V, S>

where K: Eq + Hash, S: BuildHasher,