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

use crate::tests::{creators::*, data::*};

#[test]
fn new_map_is_empty() {
    let map = empty_map();
    assert!(map.is_empty());
    assert_eq!(map.len(), 0);
}

#[test]
fn insert_and_get_with() {
    let map = empty_map();
    assert_eq!(map.insert(ALICE.into(), 42), None);
    assert_eq!(map.insert(ALICE.into(), 99), Some(42));
    let val = map.get_with(&ALICE.into(), |v| *v);
    assert_eq!(val, Some(99));
}

#[test]
fn remove_returns_value() {
    let map = empty_map();
    map.insert(ALICE.into(), 7);
    assert_eq!(map.remove(&ALICE.into()), Some(7));
    assert_eq!(map.remove(&ALICE.into()), None);
    assert!(map.is_empty());
}

#[test]
fn clear_empties_map() {
    let map = map_alice_bob(1, 2);
    assert_eq!(map.len(), 2);
    map.clear();
    assert!(map.is_empty());
}

#[test]
fn fold_accumulates_matching_entries() {
    let map = map_alice_bob_chuck(3, 7, 29);
    let sum = map.fold(0u64, |_k, v| Some(*v), |acc, v| acc + v);
    assert_eq!(sum, 39);
    let filtered = map.fold(
        0u64,
        |k, v| if k.as_str() != BOB { Some(*v) } else { None },
        |acc, v| acc + v,
    );
    assert_eq!(filtered, 32);
}

#[test]
fn get_with_on_missing_key() {
    let map = empty_map();
    let missing = map.get_with(&ALICE.into(), |v| *v);
    assert_eq!(missing, None);
}

#[test]
fn insert_overwrites_and_returns_previous() {
    let map = map_alice(7);
    let previous_7 = map.insert(ALICE.into(), 42);
    assert_eq!(previous_7, Some(7));
    let previous_42 = map.insert(ALICE.into(), 100);
    assert_eq!(previous_42, Some(42));
}