bitit 0.1.2

Bitwise iteration over integers.
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

use crate::binary::Binary;

/// An iterator over the 1-bits in a binary value.
/// Represents each bit as a single-bit mask.
///
/// # Examples
/// ```
/// use bitit::BitIter;
///
/// let x = 0b10101100u8;
/// let mut iter = x.ones();
///
/// assert_eq!(iter.next(), Some(0b00000100u8));
/// assert_eq!(iter.next_back(), Some(0b10000000u8));
/// assert_eq!(iter.next(), Some(0b00001000u8));
/// assert_eq!(iter.next(), Some(0b00100000u8));
/// assert_eq!(iter.next(), None);
/// ```
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct Ones<T: Binary> {
    n: T,
}

impl<T: Binary> Ones<T> {
    pub const fn new(n: T) -> Self {
        Self { n }
    }
}

impl<T: Binary> Iterator for Ones<T> {
    type Item = T;

    fn next(&mut self) -> Option<Self::Item> {
        self.n.has_one().then(|| {
            // Get the least significant 1 and toggle it to 0.
            let b = self.n.lowest_one();
            self.n ^= b;

            b
        })
    }
}

impl<T: Binary> DoubleEndedIterator for Ones<T> {
    fn next_back(&mut self) -> Option<Self::Item> {
        self.n.has_one().then(|| {
            // Get the most significant 1 and toggle it to 0.
            let b = self.n.highest_one();
            self.n ^= b;

            b
        })
    }
}