Struct concread::hashmap::HashMapReadTxn

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

An active read transaction over a HashMap. The data in this tree is guaranteed to not change and will remain consistent for the life of this transaction.

Implementations

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

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

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

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<Q>(&self, k: &Q) -> bool

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

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

pub fn to_snapshot(&self) -> HashMapReadSnapshot<'_, K, V>

Create a read-snapshot of the current tree. As this is the read variant, it IS safe, and guaranteed the tree will not change.