txmap 0.1.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

#[cfg(test)]
mod tests {
    use crate::{
        prelude::*,
        tests::{
            creators::creators::{empty_map, map_alice, map_alice_bob},
            data::data::{ALICE, BOB},
        },
    };

    #[test]
    fn move_existing_value() {
        let map = map_alice(1);
        let tx = map
            .transaction()
            .move_value(ALICE.into(), BOB.into())
            .get_all_copied([ALICE.into(), BOB.into()])
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(vec![None, Some(1)]));
    }

    #[test]
    fn move_value_overwrites_existing() {
        let map = map_alice_bob(1, 2);
        let tx = map
            .transaction()
            .move_value(ALICE.into(), BOB.into())
            .get_all_copied([ALICE.into(), BOB.into()])
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(vec![None, Some(1)]));
    }

    #[test]
    fn move_none_removes_existing() {
        let map = map_alice(1);
        let tx = map
            .transaction()
            .move_value(BOB.into(), ALICE.into())
            .get_all_copied([BOB.into(), ALICE.into()])
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(vec![None, None]));
    }

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