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
use crate::fragment::fragment_struct::Fragment;
use std::iter::FusedIterator;

/// Iterator over the `SplitVec`.
///
/// This struct is created by `SplitVec::iter()` method.
#[derive(Debug)]
#[must_use = "iterators are lazy and do nothing unless consumed"]
pub struct Iter<'a, T> {
    iter_outer: std::slice::Iter<'a, Fragment<T>>,
    iter_inner: std::slice::Iter<'a, T>,
}

impl<'a, T> Iter<'a, T> {
    pub(crate) fn new(fragments: &'a [Fragment<T>]) -> Self {
        let mut iter_outer = fragments.iter();
        let iter_inner = iter_outer.next().map(|x| x.iter()).unwrap_or([].iter());
        Self {
            iter_outer,
            iter_inner,
        }
    }

    fn next_fragment(&mut self) -> Option<&'a T> {
        match self.iter_outer.next() {
            Some(f) => {
                self.iter_inner = f.iter();
                self.next()
            }
            None => None,
        }
    }
}

impl<'a, T> Clone for Iter<'a, T> {
    fn clone(&self) -> Self {
        Self {
            iter_outer: self.iter_outer.clone(),
            iter_inner: self.iter_inner.clone(),
        }
    }
}

impl<'a, T> Iterator for Iter<'a, T> {
    type Item = &'a T;

    #[inline(always)]
    fn next(&mut self) -> Option<Self::Item> {
        let next_element = self.iter_inner.next();
        if next_element.is_some() {
            next_element
        } else {
            self.next_fragment()
        }
    }
}

impl<T> FusedIterator for Iter<'_, T> {}

#[cfg(test)]
mod tests {
    use crate::{test_all_growth_types, Growth, SplitVec};
    use orx_pinned_vec::PinnedVec;

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

            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!(vec![0, 1], vec.iter().copied().collect::<Vec<_>>());
        }
        test_all_growth_types!(test);
    }
}