Struct Map 

pub struct Map<K, V>(pub(crate) GcCow<HashMap<K, V>>)
where
    K: Obj,
    V: Obj;

Garbage-collected hash map implementing Copy. This implements Ord but the order is not meaningful; this is just so one can use BTreeMaps. In particular, the order might differ across two runs of the same program.

Tuple Fields

0: GcCow<HashMap<K, V>>

Implementations

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

where K: Obj, V: Obj,

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

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

where K: Obj, V: Obj,

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

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

Trait Implementations

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

where K: Clone + Obj, V: Clone + Obj,

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

where K: Copy + Obj, V: Copy + Obj,

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

where K: Debug + Obj, V: Debug + Obj,

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

Formats the value using the given formatter.

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

where K: Obj, V: Obj,

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

Returns the “default value” for a type.

impl<'de, K, V> Deserialize<'de> for Map<K, V>

where K: Obj + Deserialize<'de>, V: Obj + Deserialize<'de>,

fn deserialize<D>( deserializer: D, ) -> Result<Map<K, V>, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

where K: Eq + Obj, V: Eq + Obj,

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

where K: Obj, V: Obj,

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

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

Creates a value from an iterator.

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

where K: Hash + Obj, V: Hash + Obj,

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

where __H: Hasher,

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

where K: Obj, V: Obj,

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) -> <Map<K, V> as IntoIterator>::IntoIter

Creates an iterator from a value.

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

where K: Ord + Obj, V: Ord + Obj,

fn cmp(&self, other: &Map<K, V>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

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

Restrict a value to a certain range.

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

where K: PartialEq + Obj, V: PartialEq + Obj,

fn eq(&self, other: &Map<K, V>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

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

where K: PartialOrd + Obj, V: PartialOrd + Obj,

fn partial_cmp(&self, other: &Map<K, V>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

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

where K: Serialize + Obj, V: Serialize + Obj,

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

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

where K: PartialEq + Obj, V: PartialEq + Obj,