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

/*
 * 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_remove() {
    let mut vec = BTreeVec::<u8, 7>::create();
    for i in 0..8 {
        vec.push(i);
    }
    vec.remove(7);
    vec.remove(5);
    vec.remove(3);
    vec.remove(1);
    assert!(vec.len() == 4);
    for i in 0..4 {
        assert!(vec[i as usize] == i * 2);
    }
}

#[test]
fn medium_remove() {
    let mut vec = BTreeVec::<u8, 8>::create();
    for i in 0..32 {
        vec.push(i);
    }
    for i in 0..16 {
        vec.remove(i);
    }
    assert!(vec.len() == 16);
    for i in 0..16 {
        assert!(vec[i as usize] == i * 2 + 1);
    }
}

#[test]
fn large_remove() {
    let mut vec = BTreeVec::<u8, 7>::create();
    for i in 0..128 {
        vec.push(i);
    }
    for i in 0..64 {
        vec.remove(i);
    }
    assert!(vec.len() == 64);
    for i in 0..64 {
        assert!(vec[i as usize] == i * 2 + 1);
    }
}

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

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