local_vec 0.5.0

fixed-capacity vector allocated on the stack
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

use crate::LocalVec;
use std::iter::{Iterator, IntoIterator};

impl<T, const N: usize> IntoIterator for LocalVec<T, N> {
    type Item = T;

    type IntoIter = LocalVecIter<T, N>;

    fn into_iter(self) -> LocalVecIter<T, N> {
        let mut vec = self;
        vec.reverse();
        
        LocalVecIter {
            elems: vec,
        }
    }
}

pub struct LocalVecIter<T, const N: usize> {
    elems: LocalVec<T, N>,
}

impl<T, const N: usize> Iterator for LocalVecIter<T, N> {
    type Item = T;

    fn next(&mut self) -> Option<T> {
        self.elems.pop()
    }
}

#[cfg(test)]
mod tests {
    use super::LocalVec;

    #[test]
    fn test_iter() {
        let vec = LocalVec::<_, 3>::from_array([1, 2, 3]);
        let mut iter = vec.into_iter();
        matches!(iter.next(), Some(1));
        matches!(iter.next(), Some(2));
        matches!(iter.next(), Some(3));
        matches!(iter.next(), None);
        matches!(iter.next(), None);
    }

    #[test]
    fn test_iter_empty() {
        let vec = LocalVec::<usize, 2>::new();
        let mut iter = vec.into_iter();
        matches!(iter.next(), None);
        matches!(iter.next(), None);
    }

    #[test]
    fn test_iter_zero_cap() {
        let vec = LocalVec::<usize, 0>::new();
        let mut iter = vec.into_iter();
        matches!(iter.next(), None);
        matches!(iter.next(), None);
    }
}