const_primes/cache/
primes_into_iter.rs

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
use core::iter::FusedIterator;

use super::Underlying;

/// An owning iterator over prime numbers.
///
/// Created by the [`IntoIterator`] implementation on [`Primes`](super::Primes).
#[derive(Debug, Clone)]
#[cfg_attr(
    feature = "rkyv",
    derive(rkyv::Archive, rkyv::Serialize, rkyv::Deserialize)
)]
#[cfg_attr(
    feature = "zerocopy",
    derive(zerocopy::IntoBytes, zerocopy::Immutable, zerocopy::KnownLayout)
)]
#[must_use = "iterators are lazy and do nothing unless consumed"]
#[cfg_attr(feature = "zerocopy", repr(transparent))]
pub struct PrimesIntoIter<const N: usize>(core::array::IntoIter<Underlying, N>);

impl<const N: usize> PrimesIntoIter<N> {
    pub(crate) const fn new(iter: core::array::IntoIter<Underlying, N>) -> Self {
        Self(iter)
    }

    /// Returns an immutable slice of all primes that have not been yielded yet.
    pub fn as_slice(&self) -> &[Underlying] {
        self.0.as_slice()
    }
}

impl<const N: usize> Iterator for PrimesIntoIter<N> {
    type Item = Underlying;

    #[inline]
    fn next(&mut self) -> Option<Self::Item> {
        self.0.next()
    }

    #[inline]
    fn nth(&mut self, n: usize) -> Option<Self::Item> {
        self.0.nth(n)
    }

    #[inline]
    fn count(self) -> usize {
        self.0.count()
    }

    #[inline]
    fn last(self) -> Option<Self::Item> {
        self.0.last()
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        self.0.size_hint()
    }
}

impl<const N: usize> DoubleEndedIterator for PrimesIntoIter<N> {
    #[inline]
    fn next_back(&mut self) -> Option<Self::Item> {
        self.0.next_back()
    }

    #[inline]
    fn nth_back(&mut self, n: usize) -> Option<Self::Item> {
        self.0.nth_back(n)
    }
}

impl<const N: usize> FusedIterator for PrimesIntoIter<N> {}

impl<const N: usize> ExactSizeIterator for PrimesIntoIter<N> {
    #[inline]
    fn len(&self) -> usize {
        self.0.len()
    }
}