Struct Map 

pub struct Map<K, V>(/* private fields */);

Trait Implementations

impl<K, V> Arbitrary for Map<K, V>

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

fn any<R: Rng + ?Sized>(rng: &mut R, depth: usize) -> Self

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for Map<K, V>

where FxHashMap<K, V>: Debug,

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> Deref for Map<K, V>

type Target = HashMap<K, V, FxBuildHasher>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<K, V> DerefMut for Map<K, V>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<K: Eq + Hash, V> Extend<(K, V)> for Map<K, V>

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl From<Map<Key, Repr>> for Repr

fn from(value: MapRepr) -> Self

Converts to this type from the input type.

impl From<Map<Key, Val>> for MapVal

fn from(value: Map<Key, Val>) -> Self

Converts to this type from the input type.

impl From<Map<Key, Val>> for Val

fn from(value: Map<Key, Val>) -> Self

Converts to this type from the input type.

impl From<MapVal> for Map<Key, Val>

fn from(value: MapVal) -> Self

Converts to this type from the input type.

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

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

Creates a value from an iterator.

impl<'__deriveMoreLifetime, K, V> IntoIterator for &'__deriveMoreLifetime Map<K, V>

where &'__deriveMoreLifetime FxHashMap<K, V>: IntoIterator,

type Item = <&'__deriveMoreLifetime HashMap<K, V, FxBuildHasher> as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'__deriveMoreLifetime HashMap<K, V, FxBuildHasher> 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<'__deriveMoreLifetime, K, V> IntoIterator for &'__deriveMoreLifetime mut Map<K, V>

where &'__deriveMoreLifetime mut FxHashMap<K, V>: IntoIterator,

type Item = <&'__deriveMoreLifetime mut HashMap<K, V, FxBuildHasher> as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'__deriveMoreLifetime mut HashMap<K, V, FxBuildHasher> 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, V> IntoIterator for Map<K, V>

where FxHashMap<K, V>: IntoIterator,

type Item = <HashMap<K, V, FxBuildHasher> as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <HashMap<K, V, FxBuildHasher> 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: Eq + Hash, V: PartialEq> PartialEq for Map<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, V: Eq> Eq for Map<K, V>