Struct idmap::table::DenseEntryTable [−][src]
pub struct DenseEntryTable<K: IntegerId, V, T: IdTable = OrderedIdTable> { /* fields omitted */ }
Expand description
A table which densely stores its entries
This saves memory over a direct table when 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, T> RefUnwindSafe for DenseEntryTable<K, V, T> where
K: RefUnwindSafe,
T: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V, T> Send for DenseEntryTable<K, V, T> where
K: Send,
T: Send,
V: Send,
impl<K, V, T> Sync for DenseEntryTable<K, V, T> where
K: Sync,
T: Sync,
V: Sync,
impl<K, V, T> Unpin for DenseEntryTable<K, V, T> where
K: Unpin,
T: Unpin,
V: Unpin,
impl<K, V, T> UnwindSafe for DenseEntryTable<K, V, T> where
K: UnwindSafe,
T: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more