Struct StableBTreeMap 

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

StableBTreeMap

ICSS-baseline ordered map owning one governed allocation. Stored codec and engine failures trap. Native callers must discard the runtime after a mutation panic.

Implementations

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

pub fn create(memory: RuntimeMemory<M>) -> Result<Self, CollectionError>

Create only in empty admitted memory.

Errors

Refuses nonempty memory or initial growth refusal.

pub fn reset(memory: RuntimeMemory<M>) -> Result<Self, CollectionError>

Explicitly replace this allocation’s collection image.

Errors

Refuses initial growth before creating the map.

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

Load the current BTR version without initialization or migration.

Errors

Refuses empty or foreign framing.

pub fn clear(&mut self)

Clear entries and reuse the map’s existing backing capacity.

pub fn reserve_pages(self, minimum: u64) -> (Self, Result<(), RuntimeGrowError>)

Reserve backing pages without promising entry capacity.

pub fn allocated_pages(self) -> (Self, u64)

Observe allocated pages while retaining exclusive custody.

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

Insert or replace. Invalid codecs and allocation failures trap.

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

Read a matching value; malformed stored values trap.

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

Test key membership without decoding values.

pub const fn is_empty(&self) -> bool

Whether no entries are committed.

pub const fn len(&self) -> u64

Number of entries.

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

Remove a matching value; codec and engine failures trap.

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

First ordered key/value pair.

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

Last ordered key/value pair.

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

Iterate in key order.

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

Iterate a bounded key range.

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

Iterate keys without reading value payloads.

pub fn keys_range( &self, bounds: impl RangeBounds<K>, ) -> impl DoubleEndedIterator<Item = K> + '_

Iterate bounded keys without reading value payloads.

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

Iterate decoded values.

Trait Implementations

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

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

The type of the elements being iterated over.

type IntoIter = MapIter<'a, K, V, M>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.