Trait Map

pub trait Map {
    type K;
    type V;
    type VacantEntry<'a>: VacantEntry<'a, K = Self::K, V = Self::V>
       where Self: 'a;
    type OccupiedEntry<'a>: OccupiedEntry<'a, K = Self::K, V = Self::V>
       where Self: 'a;

    // Required methods
    fn contains_key(&self, k: &Self::K) -> bool;
    fn get(&self, k: &Self::K) -> Option<&Self::V>;
    fn get_mut(&mut self, k: &Self::K) -> Option<&mut Self::V>;
    fn insert(&mut self, k: Self::K, v: Self::V) -> Option<Self::V>;
    fn entry(
        &mut self,
        k: Self::K,
    ) -> Entry<Self::VacantEntry<'_>, Self::OccupiedEntry<'_>>;
    fn remove(&mut self, k: &Self::K) -> Option<Self::V>;
}

Required Associated Types

type K

type V

type VacantEntry<'a>: VacantEntry<'a, K = Self::K, V = Self::V> where Self: 'a

type OccupiedEntry<'a>: OccupiedEntry<'a, K = Self::K, V = Self::V> where Self: 'a

Required Methods

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

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

fn get_mut(&mut self, k: &Self::K) -> Option<&mut Self::V>

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

fn entry( &mut self, k: Self::K, ) -> Entry<Self::VacantEntry<'_>, Self::OccupiedEntry<'_>>

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

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

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

where K: Ord,

type K = K

type V = V

type VacantEntry<'a> = VacantEntry<'a, K, V> where Self: 'a

type OccupiedEntry<'a> = OccupiedEntry<'a, K, V> where Self: 'a

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

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

fn get_mut(&mut self, k: &Self::K) -> Option<&mut Self::V>

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

fn entry( &mut self, k: Self::K, ) -> Entry<Self::VacantEntry<'_>, Self::OccupiedEntry<'_>>

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

impl<K, V, H> Map for IterableMap<K, V, H>

where K: Ord + BorshSerialize + BorshDeserialize + Clone, V: BorshSerialize + BorshDeserialize, H: ToKey,

type K = K

type V = V

type VacantEntry<'a> = VacantEntry<'a, K, V, H> where Self: 'a

type OccupiedEntry<'a> = OccupiedEntry<'a, K, V, H> where Self: 'a

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

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

fn get_mut(&mut self, k: &Self::K) -> Option<&mut Self::V>

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

fn entry( &mut self, k: Self::K, ) -> Entry<Self::VacantEntry<'_>, Self::OccupiedEntry<'_>>

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

impl<K, V, H> Map for LookupMap<K, V, H>

where K: Ord + BorshSerialize + Clone, V: BorshSerialize + BorshDeserialize, H: ToKey,

type K = K

type V = V

type VacantEntry<'a> = VacantEntry<'a, K, V> where Self: 'a

type OccupiedEntry<'a> = OccupiedEntry<'a, K, V> where Self: 'a

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

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

fn get_mut(&mut self, k: &Self::K) -> Option<&mut Self::V>

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

fn entry( &mut self, k: Self::K, ) -> Entry<Self::VacantEntry<'_>, Self::OccupiedEntry<'_>>

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

impl<K, V, S> Map for HashMap<K, V, S>

where K: Eq + Hash, S: BuildHasher,

type K = K

type V = V

type VacantEntry<'a> = VacantEntry<'a, K, V> where Self: 'a

type OccupiedEntry<'a> = OccupiedEntry<'a, K, V> where Self: 'a

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

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

fn get_mut(&mut self, k: &Self::K) -> Option<&mut Self::V>

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

fn entry( &mut self, k: Self::K, ) -> Entry<Self::VacantEntry<'_>, Self::OccupiedEntry<'_>>

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

Implementors