Struct GenMap 

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

A Daml GenMap — a map with an arbitrary key type (key/value pairs on the wire; the LF-JSON form is an array of [key, value] pairs).

Entry order is a wire detail, not part of the value: two maps with the same entries compare equal regardless of the order the ledger returned them in.

Implementations

impl<K, V> GenMap<K, V>

pub fn new() -> Self

An empty map.

pub fn iter(&self) -> Iter<'_, (K, V)>

The entries, in wire order.

pub fn len(&self) -> usize

The number of entries.

pub fn is_empty(&self) -> bool

Whether the map has no entries.

pub fn insert(&mut self, key: K, value: V)

Append an entry. Daml forbids duplicate keys; this does not check for them, so build maps from distinct keys.

Trait Implementations

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

fn clone(&self) -> Self

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

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

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

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

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K: Eq, V: Eq> Eq for GenMap<K, V>

impl<K, V> From<Vec<(K, V)>> for GenMap<K, V>

fn from(entries: Vec<(K, V)>) -> Self

Converts to this type from the input type.

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

fn from_iter<I: IntoIterator<Item = (K, V)>>(entries: I) -> Self

Creates a value from an iterator.

impl<K: FromValue, V: FromValue> FromValue for GenMap<K, V>

fn from_value(value: &Value) -> Result<Self, ValueError>

Decode a wire Value into Self.

impl<K, V> IntoIterator for GenMap<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<(K, V)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

type Item = &'a (K, V)

The type of the elements being iterated over.

type IntoIter = Iter<'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: PartialEq, V: PartialEq> PartialEq for GenMap<K, V>

Entry order is a wire detail: equality compares the entries as a multiset, so a map read back from the ledger in a different order still equals the one submitted — while a repeated entry still has to appear the same number of times on both sides (a plain “every entry occurs in the other” test would be asymmetric: [a, a] would equal [a, b] but not the reverse).

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

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

where K: Serialize, V: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<K: ToValue, V: ToValue> ToValue for GenMap<K, V>

fn to_value(&self) -> Value

Encode self as a wire Value.