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

use crate::{test_all_growth_types, Growth, SplitVec};
use alloc::vec::Vec;
use orx_pinned_vec::PinnedVec;

#[test]
fn iter() {
    fn test<G: Growth>(mut vec: SplitVec<usize, G>) {
        let n = 564;
        let std_vec: Vec<_> = (0..n).collect();
        vec.extend(std_vec);

        for (i, x) in vec.iter().enumerate() {
            assert_eq!(i, *x);
        }
    }
    test_all_growth_types!(test);
}

#[test]
fn iter_empty_split_vec() {
    fn test<G: Growth>(mut vec: SplitVec<usize, G>) {
        vec.clear();
        let mut iter = vec.iter();
        assert!(iter.next().is_none());
        assert!(iter.next().is_none());
    }
    test_all_growth_types!(test);
}

#[test]
fn iter_empty_first_fragment() {
    fn test<G: Growth>(mut vec: SplitVec<usize, G>) {
        vec.clear();
        vec.push(0);
        _ = vec.pop();
        assert!(vec.is_empty());

        let mut iter = vec.iter();
        assert!(iter.next().is_none());
        assert!(iter.next().is_none());
    }
    test_all_growth_types!(test);
}

#[test]
fn iter_one_fragment() {
    fn test<G: Growth>(mut vec: SplitVec<usize, G>) {
        vec.clear();
        vec.push(0);
        vec.push(1);

        assert_eq!(alloc::vec![0, 1], vec.iter().copied().collect::<Vec<_>>());
    }
    test_all_growth_types!(test);
}

#[test]
fn clone() {
    fn test<G: Growth>(mut vec: SplitVec<usize, G>) {
        let n = 564;
        let std_vec: Vec<_> = (0..n).collect();
        vec.extend(std_vec);

        let iter1 = vec.iter();
        let iter2 = iter1.clone();

        for (i, (a, b)) in iter1.zip(iter2).enumerate() {
            assert_eq!(i, *a);
            assert_eq!(i, *b);
        }
    }
    test_all_growth_types!(test);
}

#[test]
fn all() {
    fn test<G: Growth>(mut vec: SplitVec<usize, G>) {
        let n = 564;
        let std_vec: Vec<_> = (0..n).collect();
        vec.extend(std_vec);

        assert!(vec.iter().all(|x| *x as isize >= -1));
        assert!(!vec.iter().all(|x| *x < 357));
    }
    test_all_growth_types!(test);
}

#[test]
fn any() {
    fn test<G: Growth>(mut vec: SplitVec<usize, G>) {
        let n = 564;
        let std_vec: Vec<_> = (0..n).collect();
        vec.extend(std_vec);

        assert!(!vec.iter().any(|x| *x as isize <= -1));
        assert!(vec.iter().any(|x| *x < 357));
    }
    test_all_growth_types!(test);
}

#[test]
fn fold() {
    fn test<G: Growth>(mut vec: SplitVec<usize, G>) {
        let n = 564;
        let std_vec: Vec<_> = (0..n).collect();
        vec.extend(std_vec);

        let sum = vec.iter().fold(0isize, |x, b| {
            if b % 2 == 0 {
                x + *b as isize
            } else {
                x - *b as isize
            }
        });

        let expected = (0..n).filter(|x| x % 2 == 0).sum::<usize>() as isize
            - (0..n).filter(|x| x % 2 == 1).sum::<usize>() as isize;

        assert_eq!(sum, expected);
    }
    test_all_growth_types!(test);
}