txmap 3.1.5

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

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

#[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);
    for i in (0..10_000).step_by(1000) {
        assert_eq!(map.get_with(&i, |v| *v), Some(i * 3));
    }
}