btree-vec 0.3.4

A growable array (vector) implemented using a B-tree
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

/*
 * Copyright (C) 2021 taylor.fish <contact@taylor.fish>
 *
 * This file is part of btree-vec.
 *
 * btree-vec is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * btree-vec is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with btree-vec. If not, see <https://www.gnu.org/licenses/>.
 */

use btree_vec::BTreeVec;

#[test]
fn basic_push() {
    let mut vec = BTreeVec::<u8, 7>::create();
    for i in 0..8 {
        vec.push(i);
    }
    assert!(vec.len() == 8);
    for i in 0..8 {
        assert!(vec[i as usize] == i);
    }
}

#[test]
fn medium_push() {
    let mut vec = BTreeVec::<u8, 7>::create();
    for i in 0..32 {
        vec.push(i);
    }
    assert!(vec.len() == 32);
    for i in 0..32 {
        assert!(vec[i as usize] == i);
    }
}

#[test]
fn large_push() {
    let mut vec = BTreeVec::<u8, 8>::create();
    for i in 0..128 {
        vec.push(i);
    }
    assert!(vec.len() == 128);
    for i in 0..128 {
        assert!(vec[i as usize] == i);
    }
}

#[test]
fn basic_insert_front() {
    let mut vec = BTreeVec::<u8, 7>::create();
    for i in 0..8 {
        vec.insert(0, i);
    }
    assert!(vec.len() == 8);
    for i in 0..8 {
        assert!(vec[i as usize] == 8 - i - 1);
    }
}

#[test]
fn medium_insert_front() {
    let mut vec = BTreeVec::<u8, 7>::create();
    for i in 0..32 {
        vec.insert(0, i);
    }
    assert!(vec.len() == 32);
    for i in 0..32 {
        assert!(vec[i as usize] == 32 - i - 1);
    }
}

#[test]
fn large_insert_front() {
    let mut vec = BTreeVec::<u8, 7>::create();
    for i in 0..128 {
        vec.insert(0, i);
    }
    assert!(vec.len() == 128);
    for i in 0..128 {
        assert!(vec[i as usize] == 128 - i - 1);
    }
}

#[test]
fn basic_insert_middle() {
    let mut v = Vec::new();
    let mut vec = BTreeVec::<u8, 7>::create();
    for i in 0..4 {
        vec.push(i);
        v.push(i);
    }
    for i in 0..4 {
        vec.insert(2 + i as usize, i + 10);
        v.insert(2 + i as usize, i + 10);
    }
    assert!(vec.len() == 8);
    for i in 0..8 {
        assert!(vec[i] == v[i]);
    }
}

#[test]
fn medium_insert_middle() {
    let mut v = Vec::new();
    let mut vec = BTreeVec::<u8, 8>::create();
    for i in 0..16 {
        vec.push(i);
        v.push(i);
    }
    for i in 0..16 {
        vec.insert(2 + i as usize, i + 100);
        v.insert(2 + i as usize, i + 100);
    }
    assert!(vec.len() == 32);
    for i in 0..16 {
        assert!(vec[i] == v[i]);
    }
}

#[test]
fn large_insert_middle() {
    let mut v = Vec::new();
    let mut vec = BTreeVec::<u8, 7>::create();
    for i in 0..64 {
        vec.push(i);
        v.push(i);
    }
    for i in 0..64 {
        vec.insert(2 + i as usize, i + 100);
        v.insert(2 + i as usize, i + 100);
    }
    assert!(vec.len() == 128);
    for i in 0..64 {
        assert!(vec[i] == v[i]);
    }
}