Struct DenseHashTable 

pub struct DenseHashTable<K, I, Iface, H, E> { /* private fields */ }

capacity == data.len(), always a power of two or 0. A slot is empty iff its key compares equal to empty_key.

Implementations

impl<K, I, Iface, H, E> DenseHashTable<K, I, Iface, H, E>

where K: Clone, Iface: ItemInterface<K, I>, H: DenseHasher<K> + Default, E: DenseEq<K> + Default,

pub fn dense_hash_table_key_usize(empty_key: K, buckets: usize) -> Self

impl<K, I, Iface, H, E> DenseHashTable<K, I, Iface, H, E>

where K: Clone, Iface: ItemInterface<K, I>, H: DenseHasher<K> + Default, E: DenseEq<K> + Default,

pub fn new(empty_key: K, buckets: usize) -> Self

DenseHashTable(const Key& empty_key, size_t buckets). buckets must be a power of two or 0. Reference: DenseHash.h ctor.

Trait Implementations

impl<K: Clone, I: Clone, Iface, H: Clone, E: Clone> Clone for DenseHashTable<K, I, Iface, H, E>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, I: Debug, Iface, H, E> Debug for DenseHashTable<K, I, Iface, H, E>

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

Formats the value using the given formatter.