Struct AssocMap

pub struct AssocMap<K, V>(pub Vec<(K, V)>);

Tuple Fields

0: Vec<(K, V)>

Implementations

impl<K, V> AssocMap<K, V>

pub fn new() -> Self

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

where K: PartialEq,

Inserts a key-value pair into the map.

If the map did not have this key present, None is returned.

If the map did have this key present, the value is updated, and the old value is returned. The key is not updated, though; this matters for types that can be == without being identical. See the module-level documentation for more.

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

where K: PartialEq, V: Clone,

Removes a key from the map, returning the value at the key if the key was previously in the map.

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for AssocMap<K, V>

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

Formats the value using the given formatter.

impl<K: Default, V: Default> Default for AssocMap<K, V>

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

Returns the “default value” for a type.

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

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

Converts to this type from the input type.

impl<K: Hash + Eq, V> From<AssocMap<K, V>> for LinkedHashMap<K, V>

fn from(m: AssocMap<K, V>) -> Self

Converts to this type from the input type.

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

fn from(m: AssocMap<K, V>) -> Self

Converts to this type from the input type.

impl<K: Hash + Eq, V> From<LinkedHashMap<K, V>> for AssocMap<K, V>

fn from(value: LinkedHashMap<K, V>) -> Self

Converts to this type from the input type.

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

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

Converts to this type from the input type.

impl<K: Hash, V: Hash> Hash for AssocMap<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: IsPlutusData, V: IsPlutusData> IsPlutusData for AssocMap<K, V>

fn to_plutus_data(&self) -> PlutusData

fn from_plutus_data(plutus_data: &PlutusData) -> Result<Self, PlutusDataError>

impl<K: Ord, V: Ord> Ord for AssocMap<K, V>

fn cmp(&self, other: &AssocMap<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.

impl<K: PartialEq, V: PartialEq> PartialEq for AssocMap<K, V>

fn eq(&self, other: &AssocMap<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: PartialOrd, V: PartialOrd> PartialOrd for AssocMap<K, V>

fn partial_cmp(&self, other: &AssocMap<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: Eq, V: Eq> Eq for AssocMap<K, V>

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