Struct soroban_env_host::MeteredOrdMap

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

Implementations

impl<K, V> MeteredOrdMap<K, V>where
    K: Ord + Clone,
    V: Clone,

pub fn new(budget: Budget) -> Result<Self, HostError>

pub fn from_map(budget: Budget, map: OrdMap<K, V>) -> Result<Self, HostError>

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

pub fn get<BK>(&self, key: &BK) -> Result<Option<&V>, HostError>where
    BK: Ord + ?Sized,
    K: Borrow<BK>,

pub fn remove<BK>(&mut self, k: &BK) -> Result<Option<V>, HostError>where
    BK: Ord + ?Sized,
    K: Borrow<BK>,

pub fn len(&self) -> usize

pub fn contains_key<BK>(&self, k: &BK) -> Result<bool, HostError>where
    BK: Ord + ?Sized,
    K: Borrow<BK>,

pub fn extract<BK>(&self, k: &BK) -> Result<Option<(V, Self)>, HostError>where
    BK: Ord + ?Sized,
    K: Borrow<BK>,

Time: O(log n)

pub fn get_prev<BK>(&self, key: &BK) -> Result<Option<(&K, &V)>, HostError>where
    BK: Ord + ?Sized,
    K: Borrow<BK>,

pub fn get_next<BK>(&self, key: &BK) -> Result<Option<(&K, &V)>, HostError>where
    BK: Ord + ?Sized,
    K: Borrow<BK>,

pub fn get_min(&self) -> Result<Option<&(K, V)>, HostError>

Time: O(log n)

pub fn get_max(&self) -> Result<Option<&(K, V)>, HostError>

Time: O(log n)

pub fn keys(&self) -> Result<Keys<'_, K, V>, HostError>

pub fn values(&self) -> Result<Values<'_, K, V>, HostError>

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

Trait Implementations

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

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

fn default() -> Self

Returns the “default value” for a type.

impl<'a, K, V> IntoIterator for &'a MeteredOrdMap<K, V>where
    K: Ord,

type Item = (&'a K, &'a 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> IntoIterator for MeteredOrdMap<K, V>where
    K: Ord + Clone,
    V: Clone,

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) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V> Ord for MeteredOrdMap<K, V>where
    K: Ord,
    V: Ord,

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<K, V> PartialEq<MeteredOrdMap<K, V>> for MeteredOrdMap<K, V>where
    K: Ord + PartialEq,
    V: PartialEq,

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V> PartialOrd<MeteredOrdMap<K, V>> for MeteredOrdMap<K, V>where
    K: Ord,
    V: PartialOrd,

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

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

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl<K: Ord + Eq, V: Eq> Eq for MeteredOrdMap<K, V>