lockable 0.2.0

This library offers hash map, hash set and cache data structures where individual entries can be locked
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

use std::hash::Hash;

pub enum GetOrInsertNoneResult<'a, V> {
    Existing(&'a V),
    Inserted(&'a V),
}

/// [MapLike] needs to be implemented for each kind of map we want to support, e.g.
/// for [LruCache] and [HashMap]. This is the basis for that map becoming usable in a [LockableMapImpl]
/// instance.
pub trait MapLike<K, V>: IntoIterator<Item = (K, V)>
where
    K: Eq + PartialEq + Hash + Clone,
{
    type ItemIter<'a>: Iterator<Item = (&'a K, &'a V)>
    where
        Self: 'a,
        K: 'a,
        V: 'a;

    fn new() -> Self;

    fn len(&self) -> usize;

    fn get_or_insert_none<'s>(&'s mut self, key: &K) -> GetOrInsertNoneResult<'s, V>;

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

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

    fn iter(&self) -> Self::ItemIter<'_>;
}