Struct idmap::table::DirectEntryTable [−][src]
pub struct DirectEntryTable<K: IntegerId, V> { /* fields omitted */ }
Expand description
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
Create a new table, initialized to the specified capacity
Get a mutable reference to the entry corresponding to the specified key
Insert a value and associate it with the specified key, returning the previous value Read more
Insert a value into a vacant slot, returning a reference to the new value
Remove the value associated with the specified key. Read more
Retain the specified entries in the map, returning if any indexes changed
Give a value that will debug the table
Auto Trait Implementations
impl<K, V> RefUnwindSafe for DirectEntryTable<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for DirectEntryTable<K, V> where
K: Send,
V: Send,
impl<K, V> Sync for DirectEntryTable<K, V> where
K: Sync,
V: Sync,
impl<K, V> Unpin for DirectEntryTable<K, V> where
K: Unpin,
V: Unpin,
impl<K, V> UnwindSafe for DirectEntryTable<K, V> where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more