Struct Map 

pub struct Map<K: 'static, V: 'static> { /* private fields */ }

An immutable map.

Construct one with From or FromIterator.

Implementations

impl<K, V> Map<K, V>

pub fn get_entry<Q>(&self, key: &Q) -> Option<(&K, &V)>

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

Returns the key-value entry corresponding to the given key, if present.

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 given key, if present.

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

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

Returns true if the map contains an entry for the given key.

pub fn len(&self) -> usize

Returns the number of entries in the map.

pub fn is_empty(&self) -> bool

Returns true if the map contains no entries.

pub fn entries(&self) -> MapEntries<'_, K, V>

Returns an iterator over the key-value pairs of the map in an unspecified order.

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

Returns an iterator over the keys of the map in an unspecified order.

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

Returns an iterator over the values of the map in an unspecified order.

impl<K, V> Map<K, V>

where K: Bake, V: Bake,

pub fn to_tokens(&self) -> TokenStream

Available on crate feature codegen only.

Serializes the Map into a token stream of literal Rust code that reconstructs it. Used for embedding in generated code.

Trait Implementations

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

where K: Bake, V: Bake,

Available on crate feature codegen only.

fn bake(&self, ctx: &CrateEnv) -> TokenStream

Returns a TokenStream that would evaluate to self.

impl<K: Clone + 'static, V: Clone + 'static> 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: Debug, V: Debug> Debug for Map<K, V>

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

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> Eq for Map<K, V>

where K: Eq + Hash, V: Eq,

impl<K, V, const N: usize> From<[(K, V); N]> for Map<K, V>

where K: Eq + Hash,

Available on crate feature construct only.

fn from(entries: [(K, V); N]) -> Self

Panics

Panics if:

• there are more than 65535 entries
• any duplicate keys are present
• no perfect hash function can be found for the keys

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

where K: Eq + Hash,

Available on crate feature construct only.

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

Panics

Panics if:

• there are more than 65535 entries
• any duplicate keys are present
• no perfect hash function can be found for the keys

impl<Q, K, V> Index<&Q> for Map<K, V>

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

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

Panics

Panics if there is no entry for the given key.

type Output = V

The returned type after indexing.

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

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

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

where K: Eq + Hash, V: PartialEq,

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.