txmap 1.0.0

A concurrent transactional hash map with fine-grained locking and internal mutability
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140

#[cfg(test)]
mod tests {
    use crate::{
        builders::builder_traits::{IntoTransaction, TxOpBuilder, TxResultBuilder},
        result::TxResult,
        tests::{
            creators::creators::{empty_map, empty_typed_map, map_alice},
            data::data::ALICE,
        },
    };

    #[test]
    fn insert_with_creates_entry() {
        let map = empty_map();
        let tx = map
            .transaction()
            .insert_with(ALICE.into(), |_key| 42)
            .get_copied(ALICE.into())
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(Some(42)));
    }

    #[test]
    fn insert_with_overwrites_existing() {
        let map = map_alice(1);
        let tx = map
            .transaction()
            .insert_with(ALICE.into(), |_key| 42)
            .get_copied(ALICE.into())
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(Some(42)));
    }

    #[test]
    fn insert_with_if_absent_creates_entry() {
        let map = empty_map();
        let tx = map
            .transaction()
            .insert_with_if_absent(ALICE.into(), |_key| 42)
            .get_copied(ALICE.into())
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(Some(42)));
    }

    #[test]
    fn insert_with_if_absent_does_not_overwrite_existing() {
        let map = map_alice(1);
        let tx = map
            .transaction()
            .insert_with_if_absent(ALICE.into(), |_key| 42)
            .get_copied(ALICE.into())
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(Some(1)));
    }

    #[test]
    fn insert_default_creates_default_entry() {
        let map = empty_map();
        let tx = map
            .transaction()
            .insert_default(ALICE.into())
            .get_copied(ALICE.into())
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(Some(0)));
    }

    #[test]
    fn insert_default_overwrites_existing() {
        let map = map_alice(1);
        let tx = map
            .transaction()
            .insert_default(ALICE.into())
            .get_copied(ALICE.into())
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(Some(0)));
    }

    #[test]
    fn insert_default_if_absent_creates_default_entry() {
        let map = empty_map();
        let tx = map
            .transaction()
            .insert_default_if_absent(ALICE.into())
            .get_copied(ALICE.into())
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(Some(0)));
    }

    #[test]
    fn insert_default_if_absent_does_not_overwrite_existing() {
        let map = map_alice(1);
        let tx = map
            .transaction()
            .insert_default_if_absent(ALICE.into())
            .get_copied(ALICE.into())
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(Some(1)));
    }

    #[test]
    fn duplicate_keys_dont_cause_issues() {
        let map = empty_map();
        for i in 0..=100 {
            map.insert(ALICE.into(), i);
        }
        assert_eq!(map.len(), 1);
        assert_eq!(map.get_copied(&ALICE.into()), Some(100));
    }

    #[test]
    fn huge_string_keys() {
        let map = empty_map();
        let big_key = "x".repeat(10_000);
        map.insert(big_key.clone(), 42);
        assert_eq!(map.get_with(&big_key, |v| *v), Some(42));
    }

    #[test]
    fn clear_then_reinsert() {
        let map = empty_map();
        map.insert(ALICE.into(), 1);
        map.clear();
        assert!(map.is_empty());
        map.insert(ALICE.into(), 2);
        assert_eq!(map.get_with(&ALICE.into(), |v| *v), Some(2));
    }

    #[test]
    fn large_number_of_keys() {
        let map = empty_typed_map();
        for i in 0..10_000 {
            map.insert(i, i * 3);
        }
        assert_eq!(map.len(), 10_000);
        // Verify a few values
        for i in (0..10_000).step_by(1000) {
            assert_eq!(map.get_with(&i, |v| *v), Some(i * 3));
        }
    }
}