Struct HopscotchMap 

pub struct HopscotchMap<K: 'static, V: 'static, S = FixedState> { /* private fields */ }

A concurrent, lock-free hash map based on Hopscotch Hashing.

Implementations

impl<K, V> HopscotchMap<K, V, FixedState>

where K: Hash + Eq + Clone + 'static, V: Clone + 'static,

pub fn new() -> Self

Creates a new HopscotchMap with default capacity and hasher.

pub fn with_capacity(capacity: usize) -> Self

Creates a new HopscotchMap with the specified capacity and default hasher.

impl<K, V, S> HopscotchMap<K, V, S>

where K: Hash + Eq + Clone + 'static, V: Clone + 'static, S: BuildHasher,

pub fn with_hasher(hasher: S) -> Self

Creates a new HopscotchMap with the specified hasher and default capacity.

pub fn with_capacity_and_hasher(capacity: usize, hasher: S) -> Self

Creates a new HopscotchMap with the specified capacity and hasher.

pub fn len(&self) -> usize

Returns the number of elements in the map.

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

pub fn capacity(&self) -> usize

Returns the current capacity of the map.

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

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns the value corresponding to the key.

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

Inserts a key-value pair into the map.

pub fn get_or_insert(&self, key: K, value: V) -> V

Returns the value corresponding to the key, or inserts the given value if the key is not present.

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

Insert a key-value pair only if the key does not exist. Returns None if inserted, Some(existing_value) if the key already exists.

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

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Removes a key from the map, returning the value at the key if the key was previously in the map.

pub fn clear(&self)

Clears the map, removing all key-value pairs.

pub fn iter(&self) -> HopscotchIter<'_, K, V, S>

Returns an iterator over the map entries.

pub fn keys(&self) -> HopscotchKeys<'_, K, V, S>

Returns an iterator over the map keys.

pub fn hasher(&self) -> &S

Get the underlying hasher.

Trait Implementations

impl<K, V> Default for HopscotchMap<K, V, FixedState>

where K: Hash + Eq + Clone + 'static, V: Clone + 'static,

Available on crate feature std only.

fn default() -> Self

Returns the “default value” for a type.

impl<K, V, S> Drop for HopscotchMap<K, V, S>

fn drop(&mut self)

Executes the destructor for this type.

impl<'a, K, V, S> IntoIterator for &'a HopscotchMap<K, V, S>

where K: Hash + Eq + Clone + 'static, V: Clone + 'static, S: BuildHasher,

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = HopscotchIter<'a, K, V, S>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: Send, V: Send, S: Send> Send for HopscotchMap<K, V, S>

impl<K: Sync, V: Sync, S: Sync> Sync for HopscotchMap<K, V, S>