Struct DirectEntryTable

pub struct DirectEntryTable<K: IntegerId, V> { /* private fields */ }

A entry table that stores in a flat array

This has very fast O(1) access but can waste memory if the entries are sparse

Trait Implementations

impl<K: Clone + IntegerId, V: Clone> Clone for DirectEntryTable<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + IntegerId, V: Debug> Debug for DirectEntryTable<K, V>

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

Formats the value using the given formatter.

impl<K: IntegerId, V> EntryIterable<K, V> for DirectEntryTable<K, V>

type Iter = UncheckedSparseEntryIter<K, V>

👎Deprecated since 0.2.22: With the advent of GAT, this API is needlessly unsafe

The type that iterates over this table’s pointers

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

👎Deprecated since 0.2.22: With the advent of GAT, this API is needlessly unsafe

Iterate over raw pointers in this table

impl<K: IntegerId, V> EntryTable<K, V> for DirectEntryTable<K, V>

fn new() -> Self

Create a new table

fn with_capacity(capacity: usize) -> Self

Create a new table, initialized to the specified capacity

fn len(&self) -> usize

The number of entries in the table

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

Get the entry corresponding to the specified key

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

Get a mutable reference to the entry corresponding to the specified key

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

Insert a value and associate it with the specified key, returning the previous value

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

Insert a value into a vacant slot, returning a reference to the new value

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

Remove the value associated with the specified key.

fn retain<F>(&mut self, func: F)

where F: FnMut(&K, &mut V) -> bool,

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

fn clear(&mut self)

Clear the table

fn reserve(&mut self, amount: usize)

Reserve room for more entries

fn raw_debug(&self) -> &dyn Debug

where K: Debug, V: Debug,

Give a value that will debug the table

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

Get the maximum id of the table

fn cloned(&self) -> Self

where K: Clone, V: Clone,

Clone the table

fn is_empty(&self) -> bool

If this table is empty

impl<K: IntegerId, V> IntoIterator for DirectEntryTable<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = SparseEntryIntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.