Struct cairo_lang_utils::unordered_hash_map::UnorderedHashMap

pub struct UnorderedHashMap<Key: Hash + Eq, Value>(/* private fields */);

A hash map that does not care about the order of insertion. In particular, it does not support iterating, in order to guarantee deterministic compilation. For an iterable version see OrderedHashMap.

Implementations

impl<Key: Hash + Eq, Value> UnorderedHashMap<Key, Value>

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

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

Returns a reference to the value corresponding to the key.

The key may be any borrowed form of the map’s key type, but Hash and Eq on the borrowed form must match those for the key type.

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

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

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

The key may be any borrowed form of the map’s key type, but Hash and Eq on the borrowed form must match those for the key type.

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

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. The key is not updated, though; this matters for types that can be == without being identical.

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

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

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

The key may be any borrowed form of the map’s key type, but Hash and Eq on the borrowed form must match those for the key type.

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

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

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

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

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

pub fn len(&self) -> usize

Returns the number of elements in the map.

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

Trait Implementations

impl<Key: Clone + Hash + Eq, Value: Clone> Clone for UnorderedHashMap<Key, Value>

fn clone(&self) -> UnorderedHashMap<Key, Value>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Key: Debug + Hash + Eq, Value: Debug> Debug for UnorderedHashMap<Key, Value>

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

Formats the value using the given formatter.

impl<Key: Hash + Eq, Value> Default for UnorderedHashMap<Key, Value>

fn default() -> Self

Returns the “default value” for a type.

impl<Key: Hash + Eq, Value, const N: usize> From<[(Key, Value); N]> for UnorderedHashMap<Key, Value>

fn from(items: [(Key, Value); N]) -> Self

Converts to this type from the input type.

impl<Key: Hash + Eq, Value> FromIterator<(Key, Value)> for UnorderedHashMap<Key, Value>

fn from_iter<T: IntoIterator<Item = (Key, Value)>>(iter: T) -> Self

Creates a value from an iterator.

impl<Key, Q, Value> Index<&Q> for UnorderedHashMap<Key, Value>

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

type Output = Value

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<Key: PartialEq + Hash + Eq, Value: PartialEq> PartialEq for UnorderedHashMap<Key, Value>

fn eq(&self, other: &UnorderedHashMap<Key, Value>) -> 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<Key: Eq + Hash + Eq, Value: Eq> Eq for UnorderedHashMap<Key, Value>

impl<Key: Hash + Eq, Value> StructuralEq for UnorderedHashMap<Key, Value>

impl<Key: Hash + Eq, Value> StructuralPartialEq for UnorderedHashMap<Key, Value>