1use crate::CircularArray;
2
3
4
5pub struct CircularArrayIter<'a, const N: usize, T: 'a> {
6 circular_array: &'a CircularArray<N, T>,
7 index: usize,
8}
9
10impl <'a, const N: usize, T: 'a> CircularArrayIter<'a, N, T> {
11 pub fn new(circular_array: &'a CircularArray<N, T>) -> Self {
12 CircularArrayIter {
13 circular_array,
14 index: 0,
15 }
16 }
17}
18impl<'a, const N: usize, T> Iterator for CircularArrayIter<'a, N, T> where T: Default + Copy {
19 type Item = &'a T;
20
21 fn next(&mut self) -> Option<Self::Item> {
22 let r = if self.index < self.circular_array.len {
23 Some(&self.circular_array[self.index])
24 } else {
25 None
26 };
27 self.index += 1;
28 r
29 }
30}
31#[cfg(test)]
32mod test {
33 use super::*;
34
35 #[test]
36 fn test_circular_array_iter() {
37 let mut arr = CircularArray::<3, u32>::new();
38 arr.push(1);
39 arr.push(2);
40 arr.push(3);
41 let mut iter: CircularArrayIter<3, u32> = arr.iter();
42 assert_eq!(iter.next(), Some(&1));
43 assert_eq!(iter.next(), Some(&2));
44 assert_eq!(iter.next(), Some(&3));
45 assert_eq!(iter.next(), None);
46 assert_eq!(iter.next(), None);
47
48 let mut r = 0;
49 for &item in arr.iter() {
50 r += item;
51 }
52 assert_eq!(r, 6);
53
54 let r: u32 = arr.iter().sum();
55 assert_eq!(r, 6);
56 }
57}