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
use core::iter::FusedIterator;
use super::Chunk;
pub struct Iter<A, const N: usize> {
pub(crate) chunk: Chunk<A, N>,
}
impl<A, const N: usize> Iterator for Iter<A, N> {
type Item = A;
fn next(&mut self) -> Option<Self::Item> {
if self.chunk.is_empty() {
None
} else {
Some(self.chunk.pop_front())
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
(self.chunk.len(), Some(self.chunk.len()))
}
}
impl<A, const N: usize> DoubleEndedIterator for Iter<A, N> {
fn next_back(&mut self) -> Option<Self::Item> {
if self.chunk.is_empty() {
None
} else {
Some(self.chunk.pop_back())
}
}
}
impl<A, const N: usize> ExactSizeIterator for Iter<A, N> {}
impl<A, const N: usize> FusedIterator for Iter<A, N> {}
pub struct Drain<'a, A, const N: usize> {
pub(crate) chunk: &'a mut Chunk<A, N>,
}
impl<'a, A, const N: usize> Iterator for Drain<'a, A, N>
where
A: 'a,
{
type Item = A;
fn next(&mut self) -> Option<Self::Item> {
if self.chunk.is_empty() {
None
} else {
Some(self.chunk.pop_front())
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
(self.chunk.len(), Some(self.chunk.len()))
}
}
impl<'a, A, const N: usize> DoubleEndedIterator for Drain<'a, A, N>
where
A: 'a,
{
fn next_back(&mut self) -> Option<Self::Item> {
if self.chunk.is_empty() {
None
} else {
Some(self.chunk.pop_back())
}
}
}
impl<'a, A, const N: usize> ExactSizeIterator for Drain<'a, A, N> where A: 'a {}
impl<'a, A, const N: usize> FusedIterator for Drain<'a, A, N> where A: 'a {}