Struct MeteredOrdMap

pub struct MeteredOrdMap<K, V, Ctx> { /* private fields */ }

Implementations

impl<K, V, Ctx> MeteredOrdMap<K, V, Ctx>

where K: MeteredClone, V: MeteredClone, Ctx: AsBudget + Compare<K, Error = HostError>,

pub fn new() -> Self

pub fn from_map(map: Vec<(K, V)>, ctx: &Ctx) -> Result<Self, HostError>

pub fn from_exact_iter<I: Iterator<Item = (K, V)>>( iter: I, ctx: &Ctx, ) -> Result<Self, HostError>

pub fn insert(&self, key: K, value: V, ctx: &Ctx) -> Result<Self, HostError>

pub fn get<Q>(&self, key: &Q, ctx: &Ctx) -> Result<Option<&V>, HostError>

where K: Borrow<Q>, Ctx: Compare<Q, Error = HostError>,

pub fn get_at_index( &self, index: usize, ctx: &Ctx, ) -> Result<&(K, V), HostError>

pub fn remove<Q>( &self, key: &Q, ctx: &Ctx, ) -> Result<Option<(Self, V)>, HostError>

where K: Borrow<Q>, Ctx: Compare<Q, Error = HostError>,

Returns a Some((new_self, val)) pair where new_self no longer contains an entry for key, if the key existed, otherwise None if key didn’t exist (in which case there’s no need to clone).

pub fn len(&self) -> usize

pub fn contains_key<Q>(&self, key: &Q, ctx: &Ctx) -> Result<bool, HostError>

where K: Borrow<Q>, Ctx: Compare<Q, Error = HostError>,

pub fn keys(&self, ctx: &Ctx) -> Result<impl Iterator<Item = &K>, HostError>

pub fn values(&self, ctx: &Ctx) -> Result<impl Iterator<Item = &V>, HostError>

pub fn iter( &self, ctx: &Ctx, ) -> Result<impl Iterator<Item = &(K, V)>, HostError>

Trait Implementations

impl<K, V, Ctx> Clone for MeteredOrdMap<K, V, Ctx>

where K: MeteredClone, V: MeteredClone, Ctx: AsBudget,

Clone should not be used directly, used MeteredClone instead if possible. Clone is defined here to satisfy trait requirements.

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> Compare<MeteredOrdMap<K, V, Budget>> for Budget

where K: DeclaredSizeForMetering, V: DeclaredSizeForMetering, Budget: Compare<K, Error = HostError> + Compare<V, Error = HostError>,

type Error = HostError

fn compare( &self, a: &MeteredOrdMap<K, V, Budget>, b: &MeteredOrdMap<K, V, Budget>, ) -> Result<Ordering, Self::Error>

impl<K, V> Compare<MeteredOrdMap<K, V, Host>> for Host

where K: DeclaredSizeForMetering, V: DeclaredSizeForMetering, Host: Compare<K, Error = HostError> + Compare<V, Error = HostError>,

type Error = HostError

fn compare( &self, a: &MeteredOrdMap<K, V, Host>, b: &MeteredOrdMap<K, V, Host>, ) -> Result<Ordering, Self::Error>

impl<K, V, Ctx> Default for MeteredOrdMap<K, V, Ctx>

where Ctx: Default,

fn default() -> Self

Returns the “default value” for a type.

impl<K, V, Ctx> Hash for MeteredOrdMap<K, V, Ctx>

where K: Hash, V: Hash,

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<'a, K, V, Ctx> IntoIterator for &'a MeteredOrdMap<K, V, Ctx>

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

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.