Struct OpenAddressingMap

pub struct OpenAddressingMap<K, V, S> { /* private fields */ }

The main open addressing hash map with user-chosen probing strategy.

Implementations

impl<K: Hash + Eq + Clone, V: Clone> OpenAddressingMap<K, V, RandomState>

pub fn new() -> Self

impl<K: Hash + Eq + Clone, V: Clone, S: BuildHasher + Clone> OpenAddressingMap<K, V, S>

pub fn len(&self) -> usize

Returns the number of key-value pairs in the map.

pub fn is_empty(&self) -> bool

Returns true if the map is empty.

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

Insert a key-value pair. Returns the old value if the key existed. If we exceed load factor or tombstone ratio, we rehash/grow.

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

Retrieve a reference to the value for key.

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

Retrieve a mutable reference to the value for key.

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

Removes key from the table, returning the old value if present.

pub fn clear(&mut self)

Clears the table of all key-value pairs.

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>

Returns an iterator over all (key, value) pairs in the table.

Trait Implementations

impl<K: Debug, V: Debug, S: Debug> Debug for OpenAddressingMap<K, V, S>

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

Formats the value using the given formatter.

impl<K: Hash + Eq + Clone, V: Clone> Default for OpenAddressingMap<K, V, RandomState>

fn default() -> Self

Returns the “default value” for a type.