txmap 3.1.0

A concurrent transactional hash map for Rust with fine-grained locking, internal mutability and composable transactions
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96

use crate::{
    indexer::Indexer, key::TxKey, lock_policies::lock_policy::LockPolicy,
    result::MISSING_LOCK_GUARD_ERROR, shard::Shard, shard_ops::ShardOps,
};
use intmap::IntMap;
use std::hash::{BuildHasher, Hash};

pub(crate) struct MultiShardOps;

impl MultiShardOps {
    #[inline]
    pub fn move_value<K, V, L, S>(
        write_guards: &mut IntMap<u8, L::WriteGuard<'_, Shard<K, V>>>,
        key_from: &TxKey<K>,
        key_to: &TxKey<K>,
        indexer: &Indexer<S>,
    ) where
        K: Clone + Hash + Eq,
        L: LockPolicy,
        S: BuildHasher,
    {
        let removed = {
            let shard = Self::shard::<K, V, L>(write_guards, key_from);
            ShardOps::remove_entry::<K, V>(shard, key_from)
        };
        let shard_to = write_guards
            .get_mut(key_to.shard_index.0)
            .expect(MISSING_LOCK_GUARD_ERROR);
        if let Some(entry) = removed {
            ShardOps::insert::<K, V, S>(shard_to, key_to, entry.1, indexer);
        } else {
            ShardOps::remove_entry(shard_to, key_to);
        }
    }

    #[inline]
    pub fn swap_value<K, V, L, S>(
        write_guards: &mut IntMap<u8, L::WriteGuard<'_, Shard<K, V>>>,
        key_a: &TxKey<K>,
        key_b: &TxKey<K>,
        indexer: &Indexer<S>,
    ) where
        K: Clone + Hash + Eq,
        L: LockPolicy,
        S: BuildHasher,
    {
        let a = {
            let shard = Self::shard::<K, V, L>(write_guards, key_a);
            ShardOps::remove_entry::<K, V>(shard, key_a)
        };
        let b = {
            let shard = Self::shard::<K, V, L>(write_guards, key_b);
            ShardOps::remove_entry::<K, V>(shard, key_b)
        };
        match a {
            Some((a_key, a_value)) => match b {
                Some((b_key, b_value)) => {
                    {
                        let shard = Self::shard::<K, V, L>(write_guards, key_a);
                        ShardOps::insert_with_duplicate_key(shard, key_a, a_key, b_value, indexer);
                    }
                    {
                        let shard = Self::shard::<K, V, L>(write_guards, key_b);
                        ShardOps::insert_with_duplicate_key(shard, key_b, b_key, a_value, indexer);
                    }
                }
                None => {
                    let shard = Self::shard::<K, V, L>(write_guards, key_b);
                    ShardOps::insert::<K, V, S>(shard, key_b, a_value, indexer);
                }
            },
            None => {
                if let Some((_, b_value)) = b {
                    {
                        let shard = Self::shard::<K, V, L>(write_guards, key_a);
                        ShardOps::insert::<K, V, S>(shard, key_a, b_value, indexer);
                    }
                }
            }
        }
    }

    #[inline]
    fn shard<'ex, K, V, L>(
        write_guards: &'ex mut IntMap<u8, L::WriteGuard<'_, Shard<K, V>>>,
        key: &TxKey<K>,
    ) -> &'ex mut Shard<K, V>
    where
        K: Hash + Eq,
        L: LockPolicy,
    {
        write_guards
            .get_mut(key.shard_index.0)
            .expect(MISSING_LOCK_GUARD_ERROR)
    }
}