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

use crate::*;
use alloc::vec::Vec;

#[test]
fn append_when_empty() {
    let mut rec = SplitVec::with_recursive_growth();

    rec.append(alloc::vec!['b', 'c']);
    assert_eq!(rec, &['b', 'c']);

    _ = rec.pop();
    assert_eq!(rec, &['b']);

    _ = rec.pop();
    assert_eq!(rec, &[]);

    rec.push('a');
    rec.push('b');
    rec.push('c');
    rec.push('d');
    rec.push('e');
    rec.push('f');
    assert_eq!(rec, &['a', 'b', 'c', 'd', 'e', 'f']);

    rec.append(alloc::vec!['h']);
    assert_eq!(rec, &['a', 'b', 'c', 'd', 'e', 'f', 'h']);
}

#[test]
fn append_remove() {
    fn assert_seq(rec: &SplitVec<usize, Recursive>, expected_len: usize) {
        assert_eq!(expected_len, rec.len());
        for i in 0..expected_len {
            assert_eq!(i, rec[i]);
        }
    }

    let mut rec = SplitVec::with_recursive_growth();

    rec.push(0);
    rec.append((1..30).collect::<Vec<_>>());

    assert_seq(&rec, 30);

    for i in 0..10 {
        rec.remove(i);
    }
    for (i, x) in rec.iter_mut().enumerate() {
        *x = i;
    }

    assert_seq(&rec, 20);

    let mut other = SplitVec::with_linear_growth(6);
    for i in 20..45 {
        other.push(i);
    }

    rec.append(other);
    assert_seq(&rec, 45);

    rec.truncate(14);
    assert_seq(&rec, 14);

    let mut other = SplitVec::with_doubling_growth();
    for i in 14..1243 {
        other.push(i);
    }

    rec.append(other);
    assert_seq(&rec, 1243);
}