Struct idmap::table::DenseEntryTable

pub struct DenseEntryTable<K: IntegerId, V, T: IdTable = OrderedIdTable> { /* fields omitted */ }

Trait Implementations

impl<K: Debug + IntegerId, V: Debug, T: Debug + IdTable> Debug for DenseEntryTable<K, V, T>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<K: IntegerId, V, T: IdTable> EntryTable<K, V> for DenseEntryTable<K, V, T>

fn new() -> Self

fn with_capacity(capacity: usize) -> Self

fn len(&self) -> usize

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

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

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

fn insert_vacant(&mut self, key: K, value: V) -> &mut V

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

fn retain<F>(&mut self, func: F) where
    F: FnMut(&K, &V) -> bool, 

Retain the specified entries in the map, returning if any indexes changed

fn clear(&mut self)

fn reserve(&mut self, amount: usize)

fn raw_debug(&self) -> &Debug where
    K: Debug,
    V: Debug, 

fn max_id(&self) -> Option<u64>

fn is_empty(&self) -> bool

impl<K: IntegerId, V, T: IdTable> EntryIterable<K, V> for DenseEntryTable<K, V, T>

type Iter = UncheckedDenseEntryIter<K, V>

unsafe fn unchecked_entries(&self) -> Self::Iter

impl<K: IntegerId, V, T: IdTable> IntoIterator for DenseEntryTable<K, V, T>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<(K, V)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.