Struct concread::hashmap::asynch::HashMapReadSnapshot

pub struct HashMapReadSnapshot<'a, K, V> where
    K: Hash + Eq + Clone + Debug + Sync + Send + 'static,
    V: Clone + Sync + Send + 'static,  { /* private fields */ }

A point-in-time snapshot of the tree from within a read OR write. This is useful for building other transactional types ontop of this structure, as you need a way to downcast both HashMapReadTxn or HashMapWriteTxn to a singular reader type for a number of get_inner() style patterns.

This snapshot IS safe within the read thread due to the nature of the implementation borrowing the inner tree to prevent mutations within the same thread while the read snapshot is open.

Implementations

impl<'a, K: Hash + Eq + Clone + Debug + Sync + Send + 'static, V: Clone + Sync + Send + 'static> HashMapReadSnapshot<'a, K, V>

pub fn get<'b, Q: ?Sized>(&'a self, k: &'b Q) -> Option<&'a V> where
    K: Borrow<Q>,
    Q: Hash + Eq, 

Retrieve a value from the tree. If the value exists, a reference is returned as Some(&V), otherwise if not present None is returned.

pub fn contains_key<'b, Q: ?Sized>(&'a self, k: &'b Q) -> bool where
    K: Borrow<Q>,
    Q: Hash + Eq, 

Assert if a key exists in the tree.

pub fn len(&self) -> usize

Returns the current number of k:v pairs in the tree

pub fn is_empty(&self) -> bool

Determine if the set is currently empty

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

Iterator over (&K, &V) of the set

pub fn values(&self) -> ValueIter<'_, K, V>

Iterator over &K

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

Iterator over &V