Struct logmap::OptiMap

pub struct OptiMap<K, V, S> where
    K: PartialEq + Hash,
    S: BuildHasher,  { /* fields omitted */ }

A concurrent HashMap that uses optimistic concurrency control (hence the name)

Methods

impl<K, V> OptiMap<K, V, RandomState> where
    K: PartialEq + Hash, 

pub fn new() -> Self

Creates a new OptiMap with default number of buckets and hasher

pub fn with_capacity(cap: usize) -> Self

Creates a new OptiMap with cap buckets

impl<K, V, S> OptiMap<K, V, S> where
    K: PartialEq + Hash,
    S: BuildHasher, 

pub fn with_hasher(hasher: S) -> Self

Create a new OptiMap that uses the given hasher for hashing keys

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

Creates a new OptiMap with cap collision bucket and the given Hasher

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

Gets the value associated with the given key if it exists

pub fn contains(&self, key: &K) -> bool

Checks if the map contains a given key

pub fn put(&self, key: K, value: V)

Insert a new entry in the OptiMap. Note that the map takes ownership of both the key and the value

pub fn delete(&self, key: &K)