Struct odht::HashTableOwned [−][src]
pub struct HashTableOwned<C: Config> { /* fields omitted */ }
Expand description
A HashTableOwned keeps the underlying data on the heap and can resize itself on demand.
Implementations
Creates a new HashTableOwned that can hold at least max_item_count
items while maintaining the specified load factor.
Retrieves the value for the given key. Returns None
if no entry is found.
Inserts the given key-value pair into the table. Grows the table if necessary.
pub fn from_iterator<I: IntoIterator<Item = (C::Key, C::Value)>>(
it: I,
max_load_factor_percent: u8
) -> Self
Constructs a HashTableOwned from its raw byte representation. The provided data must have the exact right number of bytes.
This method has linear time complexity as it needs to make its own copy of the given data.
The method will verify the header of the given data and return an error if the verification fails.
Trait Implementations
Auto Trait Implementations
impl<C> RefUnwindSafe for HashTableOwned<C> where
C: RefUnwindSafe,
impl<C> Send for HashTableOwned<C> where
C: Send,
impl<C> Sync for HashTableOwned<C> where
C: Sync,
impl<C> Unpin for HashTableOwned<C> where
C: Unpin,
impl<C> UnwindSafe for HashTableOwned<C> where
C: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more