orx-split-vec 3.8.0

An efficient constant access time vector with dynamic capacity and pinned elements.
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
142
143
144
145
146
147
148

use orx_pinned_vec::PinnedVec;
use orx_split_vec::SplitVec;

#[test]
fn last_on_pop() {
    let n = 164135;

    let mut vec = SplitVec::new();
    for i in 0..n {
        vec.push(i);
    }

    for _ in 0..(n - 1) {
        let expected_pop = vec.len() - 1;
        let expected_last = expected_pop - 1;
        let pop = vec.pop();
        assert_eq!(Some(expected_pop), pop);
        assert_eq!(Some(&expected_last), vec.last());
    }

    assert_eq!(vec.len(), 1);
    assert_eq!(Some(&0), vec.last());

    let pop = vec.pop();
    assert_eq!(Some(0), pop);
    assert!(vec.last().is_none());
}

#[test]
fn last_on_remove() {
    let n = 1641;
    let expected_last = n - 1;

    let mut vec = SplitVec::new();
    for i in 0..n {
        vec.push(i);
    }

    for _ in 0..(n - 1) {
        let i = if vec.len() <= 2 { 0 } else { vec.len() / 2 };
        let _ = vec.remove(i);
        assert_eq!(Some(&expected_last), vec.last());
    }

    assert_eq!(vec.len(), 1);
    assert_eq!(Some(&expected_last), vec.last());

    let last = vec.remove(0);
    assert_eq!(expected_last, last);
    assert!(vec.last().is_none());
}

#[test]
fn last_on_truncate() {
    let n = 164135;

    let mut vec = SplitVec::new();
    for i in 0..n {
        vec.push(i);
    }

    for _ in 0..(n - 1) {
        let new_len = vec.len() - 1;
        let expected_last = vec.len() - 2;
        vec.truncate(new_len);
        assert_eq!(Some(&expected_last), vec.last());
    }

    assert_eq!(vec.len(), 1);
    assert_eq!(Some(&0), vec.last());

    let pop = vec.pop();
    assert_eq!(Some(0), pop);
    assert!(vec.last().is_none());
}

#[test]
fn first_on_pop() {
    let n = 164135;
    let expected_first = 0;

    let mut vec = SplitVec::new();
    for i in 0..n {
        vec.push(i);
    }

    for _ in 0..(n - 1) {
        let expected_pop = vec.len() - 1;
        let pop = vec.pop();
        assert_eq!(Some(expected_pop), pop);
        assert_eq!(Some(&expected_first), vec.first());
    }

    assert_eq!(vec.len(), 1);
    assert_eq!(Some(&0), vec.first());

    let pop = vec.pop();
    assert_eq!(Some(0), pop);
    assert!(vec.first().is_none());
}

#[test]
fn first_on_remove() {
    let n = 1635;

    let mut vec = SplitVec::new();
    for i in 0..n {
        vec.push(i);
    }

    for i in 0..(n - 1) {
        let expected_removed = i;
        let expected_first = i + 1;
        let removed = vec.remove(0);
        assert_eq!(expected_removed, removed);
        assert_eq!(Some(&expected_first), vec.first());
    }

    assert_eq!(vec.len(), 1);
    assert_eq!(Some(&(n - 1)), vec.first());

    let last = vec.remove(0);
    assert_eq!(n - 1, last);
    assert!(vec.first().is_none());
}

#[test]
fn first_on_truncate() {
    let n = 164135;

    let mut vec = SplitVec::new();
    for i in 0..n {
        vec.push(i);
    }

    for _ in 0..(n - 1) {
        let new_len = vec.len() - 1;
        vec.truncate(new_len);
        assert_eq!(Some(&0), vec.first());
    }

    assert_eq!(vec.len(), 1);
    assert_eq!(Some(&0), vec.first());

    let pop = vec.pop();
    assert_eq!(Some(0), pop);
    assert!(vec.first().is_none());
}