bitmac 0.3.0

Structure for accessing to single bits
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157

use std::marker::PhantomData;

use crate::{container::ContainerRead, number::Number, BitAccess};

/// An iterator over slots that moves out of a container.
pub struct IntoIter<D, B> {
    slot_idx: usize,
    data: D,
    phantom: PhantomData<B>,
}

impl<D, B> IntoIter<D, B> {
    pub(crate) fn new(data: D) -> Self {
        Self {
            slot_idx: 0,
            data,
            phantom: Default::default(),
        }
    }

    pub fn by_bits(self) -> IntoIterBits<D, B> {
        IntoIterBits {
            slot_idx: self.slot_idx,
            bit_idx: 0,
            data: self.data,
            phantom: Default::default(),
        }
    }
}

impl<D, B> Iterator for IntoIter<D, B>
where
    D: ContainerRead<B>,
    B: BitAccess,
{
    type Item = D::Slot;

    fn next(&mut self) -> Option<Self::Item> {
        if self.slot_idx < self.data.slots_count() {
            let v = self.data.get_slot(self.slot_idx);
            self.slot_idx += 1;
            Some(v)
        } else {
            None
        }
    }
}

/// An iterator over bits that moves out of a container.
pub struct IntoIterBits<D, B> {
    slot_idx: usize,
    bit_idx: usize,
    data: D,
    phantom: PhantomData<B>,
}

impl<D, B, N> Iterator for IntoIterBits<D, B>
where
    D: ContainerRead<B, Slot = N>,
    B: BitAccess,
    N: Number,
{
    type Item = bool;

    fn next(&mut self) -> Option<Self::Item> {
        if self.slot_idx < self.data.slots_count() {
            let slot = self.data.get_slot(self.slot_idx);
            let v = B::get(slot, self.bit_idx);

            self.bit_idx = (self.bit_idx + 1) % N::BITS_COUNT;
            if self.bit_idx == 0 {
                self.slot_idx += 1;
            }

            Some(v)
        } else {
            None
        }
    }
}

/// An iterator over slots.
pub struct Iter<'a, D, B> {
    slot_idx: usize,
    data: &'a D,
    phantom: PhantomData<B>,
}

impl<'a, D, B> Iter<'a, D, B> {
    pub(crate) fn new(data: &'a D) -> Self {
        Self {
            slot_idx: 0,
            data,
            phantom: Default::default(),
        }
    }

    pub fn by_bits(self) -> IterBits<'a, D, B> {
        IterBits {
            slot_idx: self.slot_idx,
            bit_idx: 0,
            data: self.data,
            phantom: Default::default(),
        }
    }
}

impl<D, B> Iterator for Iter<'_, D, B>
where
    D: ContainerRead<B>,
    B: BitAccess,
{
    type Item = D::Slot;

    fn next(&mut self) -> Option<Self::Item> {
        if self.slot_idx < self.data.slots_count() {
            let v = self.data.get_slot(self.slot_idx);
            self.slot_idx += 1;
            Some(v)
        } else {
            None
        }
    }
}

/// An iterator over bits.
pub struct IterBits<'a, D, B> {
    slot_idx: usize,
    bit_idx: usize,
    data: &'a D,
    phantom: PhantomData<B>,
}

impl<D, B, N> Iterator for IterBits<'_, D, B>
where
    D: ContainerRead<B, Slot = N>,
    B: BitAccess,
    N: Number,
{
    type Item = bool;

    fn next(&mut self) -> Option<Self::Item> {
        if self.slot_idx < self.data.slots_count() {
            let slot = self.data.get_slot(self.slot_idx);
            let v = B::get(slot, self.bit_idx);

            self.bit_idx = (self.bit_idx + 1) % N::BITS_COUNT;
            if self.bit_idx == 0 {
                self.slot_idx += 1;
            }

            Some(v)
        } else {
            None
        }
    }
}