ccl 5.1.5

Fast datastructures for use in highly concurrent systems.
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

use super::*;
use rayon::prelude::*;

#[test]
fn insert_then_assert_st() {
    let map = NestedMap::default();

    for i in 0..1024_i32 {
        map.insert(i, i * 7);
    }

    for i in 0..1024_i32 {
        assert_eq!(i * 7, *map.get(&i).unwrap());
    }
}

#[test]
fn insert_rayon() {
    const INSV: u64 = 518;
    let map = NestedMap::default();

    (0..100000).into_par_iter().for_each(|i| {
        map.insert(i, INSV);
    });
}

#[test]
fn len() {
    let map = NestedMap::default();

    for i in 0..1024_i32 {
        map.insert(i, i);
    }

    assert_eq!(map.len(), 1024);
}

#[test]
fn is_empty() {
    let map: NestedMap<i32, i32> = NestedMap::default();

    assert_eq!(map.is_empty(), true);
}

#[test]
fn iter_count_fold() {
    let map = NestedMap::default();

    for i in 0..1024_i32 {
        map.insert(i, i);
    }

    for r in map.iter() {
        assert!(*r >= 0 && *r < 1024);
    }

    assert_eq!(map.iter().count(), 1024);
}

#[test]
fn intoiter() {
    let map = NestedMap::default();

    for i in 0..1024_i32 {
        map.insert(i, i);
    }

    for r in &map {
        assert!(*r >= 0 && *r < 1024);
    }

    assert_eq!(map.iter().count(), 1024);
}

#[test]
fn ref_drop_exist() {
    let map = NestedMap::default();

    map.insert("wokeblox", 492_i32);
    let r = map.get(&"wokeblox").unwrap();
    map.remove(&"wokeblox");
    assert_eq!(*r, 492_i32);
}