Struct OwnedMap 

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

An ordinary mutable ordered map with exact node ownership. Unlike BudgetedMap, insertion has no allowance and cannot be used as an admitted producer by itself. An enclosing controlled producer must reserve entry_bytes() before allocating each new entry and retain that lease until the map is dropped. Separately allocated key/value payloads require their own reservations.

Implementations

impl<K, V> OwnedMap<K, V>

pub fn new() -> Self

pub const fn entry_bytes() -> usize

Exact allocation layout of one node, including its key, value, links and padding. Allocator bookkeeping is outside the payload allowance.

pub fn allocated_bytes(&self) -> usize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn keys(&self) -> impl ExactSizeIterator<Item = &K> + FusedIterator

pub fn values(&self) -> impl ExactSizeIterator<Item = &V> + FusedIterator

impl<K: Ord, V> OwnedMap<K, V>

pub fn get<Q: Ord + ?Sized>(&self, key: &Q) -> Option<&V>

where K: Borrow<Q>,

pub fn get_mut<Q: Ord + ?Sized>(&mut self, key: &Q) -> Option<&mut V>

where K: Borrow<Q>,

pub fn contains_key<Q: Ord + ?Sized>(&self, key: &Q) -> bool

where K: Borrow<Q>,

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

A collision replaces only the value, preserving the original key and node allocation.

pub fn append(&mut self, other: Self)

Move entries from other without allocating replacement nodes. Collisions retain this map’s original key and node, replacing only the value.

pub fn remove<Q: Ord + ?Sized>(&mut self, key: &Q) -> Option<V>

where K: Borrow<Q>,

pub fn remove_entry<Q: Ord + ?Sized>(&mut self, key: &Q) -> Option<(K, V)>

where K: Borrow<Q>,

pub fn first_from<Q: Ord + ?Sized>(&self, start: Bound<&Q>) -> Option<(&K, &V)>

where K: Borrow<Q>,

Borrow the first entry at or after a lower bound in logarithmic time without scratch allocation.

Trait Implementations

impl<K: Ord + Clone, V: Clone> Clone for OwnedMap<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for OwnedMap<K, V>

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

impl<K: Eq, V: Eq> Eq for OwnedMap<K, V>

impl<K: Ord, V> FromIterator<(K, V)> for OwnedMap<K, V>

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self

Creates a value from an iterator.

impl<K: Ord + Borrow<Q>, V, Q: Ord + ?Sized> Index<&Q> for OwnedMap<K, V>

type Output = V

The returned type after indexing.

fn index(&self, key: &Q) -> &V

Performs the indexing (container[index]) operation.

impl<'a, K, V> IntoIterator for &'a OwnedMap<K, V>

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = BudgetedMapIter<'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 OwnedMap<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = OwnedMapIntoIter<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: PartialEq, V: PartialEq> PartialEq for OwnedMap<K, V>

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

Equality operator ==.

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

Inequality operator !=.