Struct DenseIdMap 

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

A mapping from a NumericId to some value.

This mapping is dense: it stores a flat array indexed by K::index(), with no hashing. For sparse mappings, use a HashMap.

Implementations

impl<K: NumericId, V> DenseIdMap<K, V>

pub fn with_capacity(n: usize) -> Self

Create an empty map with space for n entries pre-allocated.

pub fn new() -> Self

Create an empty map.

pub fn clear(&mut self)

Clear the table’s contents.

pub fn capacity(&self) -> usize

Get the current capacity for the table.

pub fn n_ids(&self) -> usize

Get the number of ids currently indexed by the table (including “null” entries). This is a less useful version of “length” in other containers.

pub fn insert(&mut self, key: K, value: V)

Insert the given mapping into the table.

pub fn next_id(&self) -> K

Get the key that would be returned by the next call to DenseIdMap::push.

pub fn push(&mut self, val: V) -> K

Add the given mapping to the table, returning the key corresponding to DenseIdMap::n_ids.

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

Test whether key is set in this map.

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

Get the current mapping for key in the table.

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

Get a mutable reference to the current mapping for key in the table.

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

Extract the value mapped to by key from the table.

Panics

This method panics if key is not in the table.

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

Extract the value mapped to by key from the table, if it is present.

pub fn get_or_insert(&mut self, key: K, f: impl FnOnce() -> V) -> &mut V

Get the current mapping for key in the table, or insert the value returned by f and return a mutable reference to it.

pub fn raw(&self) -> &[Option<V>]

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

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

pub fn reserve_space(&mut self, key: K)

Reserve space up to the given key in the table.

pub fn drain(&mut self) -> impl Iterator<Item = (K, V)> + '_

impl<K: NumericId, V: Send + Sync> DenseIdMap<K, V>

pub fn par_iter(&self) -> impl ParallelIterator<Item = (K, &V)>

Get a parallel iterator over the entries in the table.

pub fn par_iter_mut(&mut self) -> impl ParallelIterator<Item = (K, &mut V)>

Get a parallel iterator over mutable references to the entries in the table.

impl<K: NumericId, V: Default> DenseIdMap<K, V>

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

Trait Implementations

impl<K: Clone, V: Clone> Clone for DenseIdMap<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: NumericId + Debug, V: Debug> Debug for DenseIdMap<K, V>

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

impl<K: Hash, V: Hash> Hash for DenseIdMap<K, V>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<K: NumericId, V> Index<K> for DenseIdMap<K, V>

type Output = V

The returned type after indexing.

fn index(&self, key: K) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K: NumericId, V> IndexMut<K> for DenseIdMap<K, V>

fn index_mut(&mut self, key: K) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<K: PartialEq, V: PartialEq> PartialEq for DenseIdMap<K, V>

fn eq(&self, other: &DenseIdMap<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: Eq, V: Eq> Eq for DenseIdMap<K, V>

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