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

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

    #[test]
    fn remove_multiple_keys() {
        let map = map_alice_bob_chuck(1, 2, 3);
        let tx = map
            .transaction()
            .remove([ALICE.into(), BOB.into()])
            .get_copied(CHUCK.into())
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(Some(3)));
        assert_eq!(map.len(), 1);
    }

    #[test]
    fn remove_where_conditionally() {
        let map = map_alice_bob_chuck(1, 2, 3);
        let tx = map
            .transaction()
            .remove_where([ALICE.into(), BOB.into(), CHUCK.into()], |_k, v| *v >= 2)
            .get_all_copied([ALICE.into(), BOB.into(), CHUCK.into()])
            .into_transaction();
        assert_eq!(tx.execute(), TxResult::Completed(vec![Some(1), None, None]));
        assert_eq!(map.len(), 1);
    }

    #[test]
    fn param_remove() {
        let map = map_alice_bob_chuck(1, 2, 3);
        let tx = map
            .transaction()
            .with_param::<()>()
            .remove([ALICE.into()])
            .into_transaction();
        assert_eq!(tx.execute(&()), TxResult::Completed(()));
        assert_eq!(map.len(), 2);
    }
}