Struct Map 

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

Garbage-collected hash map implementing Copy.

Implementations

impl<K: Obj, V: Obj> Map<K, V>

pub fn new() -> Self

Creates an empty Map.

pub fn get(&self, k: K) -> Option<V>

Returns the value to the key k. Returns None if the key k is not in the Map.

pub fn index_at(&self, k: K) -> V

The indexing operator: specr translates a[b] to a.index_at(b).

pub fn remove(&mut self, k: K) -> Option<V>

Removes k from the map. If the pair (k, v) was in the map, Some(v) is returned. Otherwise, None is returned.

pub fn contains_key(&self, k: K) -> bool

Checks whether self contains k.

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

Insert a key/value mapping into a map. If the map already has a mapping for the given key the previous value is overwritten.

pub fn try_insert(&mut self, k: K, v: V) -> Result<(), ()>

Like insert, but fails if k was already in the map.

pub fn keys(self) -> impl Iterator<Item = K>

An iterator over all keys.

pub fn values(self) -> impl Iterator<Item = V>

An iterator over all values.

pub fn len(self) -> Int

Returns the number of elements in self.

pub fn is_empty(self) -> bool

Returns true if the map contains no elements.

impl<K: Obj, V: Obj> Map<K, V>

pub fn iter(self) -> ConsumingIter<(K, V)>

Returns an iterator over all (key, value) pairs.

Trait Implementations

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

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

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

fn from_iter<T>(iter: T) -> Self

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

Creates a value from an iterator.

impl<K: Hash + Obj, V: Hash + Obj> Hash for Map<K, V>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<K: Obj, V: Obj> IntoIterator for Map<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = ConsumingIter<(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: PartialEq + Obj, V: PartialEq + Obj> PartialEq for Map<K, V>

fn eq(&self, other: &Map<K, V>) -> 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: Copy + Obj, V: Copy + Obj> Copy for Map<K, V>

impl<K: Eq + Obj, V: Eq + Obj> Eq for Map<K, V>

impl<K: Obj, V: Obj> StructuralPartialEq for Map<K, V>