Struct style::rule_tree::map::Map

pub(super) struct Map<K, V> {
    inner: MapInner<K, V>,
}

Fields

inner: MapInner<K, V>

Implementations

impl<K, V> Map<K, V>

where K: Eq + Hash,

pub(super) fn is_empty(&self) -> bool

pub(super) fn len(&self) -> usize

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

pub(super) fn entry( &mut self, key: K, key_from_value: impl FnOnce(&V) -> K, ) -> Entry<'_, K, V>

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

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.

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

type Item = &'a V

The type of the elements being iterated over.

type IntoIter = MapIter<'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> MallocShallowSizeOf for Map<K, V>

where K: Eq + Hash,

fn shallow_size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of immediate heap-allocated descendant structures, but not the space taken up by the value itself. Anything beyond the immediate descendants must be measured separately, using iteration.