Struct RSortedMap 

pub struct RSortedMap<K, V>(/* private fields */);

A FFI-safe ordered map backed by a sorted RVec<Tuple2<K, V>>.

Keys are kept in ascending Ord order. Lookup and insertion are O(n) for rare mutations and O(log n) for reads via binary search. This is intended as a drop-in replacement for BTreeMap where deterministic iteration order matters.

Implementations

impl<K, V> RSortedMap<K, V>

where K: Ord,

pub fn new() -> RSortedMap<K, V>

Creates an empty map.

pub fn len(&self) -> usize

Returns the number of entries.

pub fn is_empty(&self) -> bool

Returns true if the map contains no entries.

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

Returns a reference to the value for key, or None if absent.

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

Returns true if the map contains key.

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

Returns a mutable reference to the value for key, or None if absent.

pub fn get_or_insert(&mut self, key: K, default: V) -> &mut V

Returns a mutable reference to the value for key, inserting default if absent.

Equivalent to BTreeMap::entry(key).or_insert(default). O(n).

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

Removes key and returns its value if present.

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

Inserts key → value. Returns the previous value if the key was already present.

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

Removes key and returns (key, value) if it was present.

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>

Iterates over (&K, &V) pairs in key order.

pub fn keys(&self) -> impl Iterator<Item = &K>

Iterates over keys in order.

pub fn values(&self) -> impl Iterator<Item = &V>

Iterates over values in key order.

Trait Implementations

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

where K: Clone, V: Clone,

fn clone(&self) -> RSortedMap<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for RSortedMap<K, V>

where K: Debug, V: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<K, V> Default for RSortedMap<K, V>

where K: Default, V: Default,

fn default() -> RSortedMap<K, V>

Returns the “default value” for a type.

impl<K, V> FromIterator<(K, V)> for RSortedMap<K, V>

where K: Ord,

fn from_iter<I>(iter: I) -> RSortedMap<K, V>

where I: IntoIterator<Item = (K, V)>,

Creates a value from an iterator.

impl<K, V> GetStaticEquivalent_ for RSortedMap<K, V>

where K: StableAbi, V: StableAbi,

type StaticEquivalent = _static_RSortedMap<<K as GetStaticEquivalent_>::StaticEquivalent, <V as GetStaticEquivalent_>::StaticEquivalent>

The 'static equivalent of Self

impl<K, V> IntoIterator for RSortedMap<K, V>

where K: Ord,

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = Map<IntoIter<Tuple2<K, V>>, fn(Tuple2<K, V>) -> (K, V)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <RSortedMap<K, V> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<K, V> PartialEq for RSortedMap<K, V>

where K: PartialEq, V: PartialEq,

fn eq(&self, other: &RSortedMap<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<K, V> StableAbi for RSortedMap<K, V>

where K: StableAbi, V: StableAbi,

const LAYOUT: &'static TypeLayout

The layout of the type provided by implementors.

type IsNonZeroType = False

Whether this type has a single invalid bit-pattern.

const ABI_CONSTS: AbiConsts = _

const-equivalents of the associated types.

impl<K, V> Eq for RSortedMap<K, V>

where K: Eq, V: Eq,

impl<K, V> StructuralPartialEq for RSortedMap<K, V>