generic_slab 0.1.2

Pre-allocated storage for a uniform data type
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141

#![allow(missing_docs)]
#![cfg(feature = "range")]

use std::ops::Bound;

use generic_slab::Slab;

#[derive(Eq, PartialEq, Debug)]
struct Data(pub usize);

macro_rules! range_test {
    ($name:ident, $start:expr, $end:expr, $expected:expr) => {
        #[test]
        fn $name() {
            let lookup = test_lookup_large();

            let range: (Bound<usize>, Bound<usize>) = ($start.into(), $end.into());
            let expected: Vec<usize> = $expected;
            let actual = lookup.range(range).map(|(_, d)| d.0).collect::<Vec<_>>();
            assert_eq!(expected, actual);
        }
    };
}

range_test!(
    range_unbound_unbound,
    Bound::Unbounded,
    Bound::Unbounded,
    vec![0, 1, 3, 4, 7, 8, 9, 10, 11, 12, 13, 14, 15]
);

range_test!(
    range_included_unbound,
    Bound::Included(7),
    Bound::Unbounded,
    vec![7, 8, 9, 10, 11, 12, 13, 14, 15]
);

range_test!(
    range_excluded_unbound,
    Bound::Excluded(7),
    Bound::Unbounded,
    vec![8, 9, 10, 11, 12, 13, 14, 15]
);

range_test!(
    range_unbound_included,
    Bound::Unbounded,
    Bound::Included(7),
    vec![0, 1, 3, 4, 7]
);

range_test!(
    range_unbound_excluded,
    Bound::Unbounded,
    Bound::Excluded(7),
    vec![0, 1, 3, 4]
);

range_test!(
    range_included_included,
    Bound::Included(7),
    Bound::Included(10),
    vec![7, 8, 9, 10, 11, 12, 13]
);

range_test!(
    range_excluded_excluded,
    Bound::Excluded(7),
    Bound::Excluded(10),
    vec![8, 9, 10, 11, 12]
);

range_test!(
    range_included_excluded,
    Bound::Included(7),
    Bound::Excluded(10),
    vec![7, 8, 9, 10, 11, 12]
);

range_test!(
    range_excluded_included,
    Bound::Excluded(7),
    Bound::Included(10),
    vec![8, 9, 10, 11, 12, 13]
);

range_test!(
    range_included_excluded_edge_case,
    Bound::Included(7),
    Bound::Excluded(7),
    vec![]
);

range_test!(
    range_included_included_reverse,
    Bound::Included(10),
    Bound::Included(7),
    vec![13, 14, 15, 0, 1, 3, 4, 7]
);

/// Create a large lookup with the following data layout
/// - [ 0] Occupied  data=0  next=1  prev=5     first_occupied
/// - [ 1] Occupied  data=1  next=3  prev=0
/// - [ 2] Occupied  data=10 next=6  prev=5
/// - [ 3] Occupied  data=3  next=4  prev=1
/// - [ 4] Occupied  data=4  next=7  prev=3
/// - [ 5] Occupied  data=9  next=2  prev=8
/// - [ 6] Occupied  data=11 next=9  prev=2
/// - [ 7] Occupied  data=7  next=8  prev=4
/// - [ 8] Occupied  data=8  next=5  prev=7
/// - [ 9] Occupied  data=12 next=10 prev=6
/// - [10] Occupied  data=13 next=11 prev=9
/// - [11] Occupied  data=14 next=12 prev=10
/// - [12] Occupied  data=15 next=0  prev=11    last_occupied
fn test_lookup_large() -> Slab<Data> {
    let mut lookup = Slab::<Data>::new();
    lookup.insert(Data(0));
    lookup.insert(Data(1));
    let handle2 = lookup.insert(Data(2));
    lookup.insert(Data(3));
    lookup.insert(Data(4));
    let handle5 = lookup.insert(Data(5));
    let handle6 = lookup.insert(Data(6));
    lookup.insert(Data(7));
    lookup.insert(Data(8));

    lookup.remove(handle5);
    lookup.remove(handle2);
    lookup.remove(handle6);

    lookup.insert(Data(9));
    lookup.insert(Data(10));
    lookup.insert(Data(11));
    lookup.insert(Data(12));
    lookup.insert(Data(13));
    lookup.insert(Data(14));
    lookup.insert(Data(15));

    lookup
}