Struct StableBTreeMap 

pub struct StableBTreeMap<K: Storable + Ord + Clone, V: Storable, M: Memory = DefaultMemoryImpl> { /* private fields */ }

Governed upstream BTreeMap; initialization and failures follow upstream contracts.

Implementations

impl<K: Storable + Ord + Clone, V: Storable, M: Memory> StableBTreeMap<K, V, M>

pub fn new(memory: RuntimeMemory<M>) -> Self

Delegates to upstream BTreeMap::new with the governed allocation.

pub fn init(memory: RuntimeMemory<M>) -> Self

Delegates to upstream BTreeMap::init with the governed allocation.

pub fn load(memory: RuntimeMemory<M>) -> Self

Delegates to upstream BTreeMap::load with the governed allocation.

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

Delegates to upstream BTreeMap::insert with the governed allocation.

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

Delegates to upstream BTreeMap::get with the governed allocation.

pub fn contains_key(&self, key: &K) -> bool

Delegates to upstream BTreeMap::contains_key with the governed allocation.

pub fn is_empty(&self) -> bool

Delegates to upstream BTreeMap::is_empty with the governed allocation.

pub fn len(&self) -> u64

Delegates to upstream BTreeMap::len with the governed allocation.

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

Delegates to upstream BTreeMap::remove with the governed allocation.

pub fn first_key_value(&self) -> Option<(K, V)>

Delegates to upstream BTreeMap::first_key_value with the governed allocation.

pub fn last_key_value(&self) -> Option<(K, V)>

Delegates to upstream BTreeMap::last_key_value with the governed allocation.

pub fn pop_first(&mut self) -> Option<(K, V)>

Delegates to upstream BTreeMap::pop_first with the governed allocation.

pub fn pop_last(&mut self) -> Option<(K, V)>

Delegates to upstream BTreeMap::pop_last with the governed allocation.

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

Delegates to upstream BTreeMap::iter with the governed allocation.

pub fn range(&self, key_range: impl RangeBounds<K>) -> MapIter<'_, K, V, M>

Delegates to upstream BTreeMap::range with the governed allocation.

pub fn keys(&self) -> impl DoubleEndedIterator<Item = K> + '_

Delegates to upstream BTreeMap::keys with the governed allocation.

pub fn values(&self) -> impl DoubleEndedIterator<Item = V> + '_

Delegates to upstream BTreeMap::values with the governed allocation.

Trait Implementations

impl<'a, K: Storable + Ord + Clone, V: Storable, M: Memory> IntoIterator for &'a StableBTreeMap<K, V, M>

type Item = <Iter<'a, K, V, RuntimeMemory<M>> as Iterator>::Item

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, V, RuntimeMemory<M>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.