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 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * Copyright (c) 2023
// *
// * This project is dual-licensed under the MIT and Apache licenses.
// *
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// ** APACHE 2.0 LICENSE
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// *
// * Licensed under the Apache License, Version 2.0 (the "License");
// * you may not use this file except in compliance with the License.
// * You may obtain a copy of the License at
// *
// * http://www.apache.org/licenses/LICENSE-2.0
// *
// * Unless required by applicable law or agreed to in writing, software
// * distributed under the License is distributed on an "AS IS" BASIS,
// * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// * See the License for the specific language governing permissions and
// * limitations under the License.
// *
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// ** MIT LICENSE
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// *
// * Permission is hereby granted, free of charge, to any person obtaining a
// * copy
// * of this software and associated documentation files (the "Software"), to
// * deal
// * in the Software without restriction, including without limitation the
// * rights
// * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// * copies of the Software, and to permit persons to whom the Software is
// * furnished to do so, subject to the following conditions:
// *
// * The above copyright notice and this permission notice shall be included in
// * all
// * copies or substantial portions of the Software.
// *
// * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// * FROM,
// * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// * THE
// * SOFTWARE.
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
use crate::{
Bit,
Byte,
};
/// An iterator over a byte
///
/// This struct is a wrapper struct to generate an iterator
/// for `Byte`. This allows us to map and/or loop over all the `Bit`s
/// in the `Byte`.
///
/// This iterator iterates from the Least Significant Bit (LSB) to the
/// Most Significant Bit (MSB). This means that the first `Bit` returned
/// is the last `Bit` in the `Byte` and the last `Bit` returned is the
/// first `Bit` in the `Byte`.
///
/// # Examples
///
/// ```
/// use brainfoamkit_lib::{
/// Bit,
/// Byte,
/// IterableByte,
/// };
///
/// let byte = Byte::from(0b1100_1010); // Dec: 10; Hex: 0xA; Oct: 0o12
/// let mut iter = IterableByte::new(&byte);
///
/// assert_eq!(iter.next(), Some(Bit::zero()));
/// assert_eq!(iter.next(), Some(Bit::one()));
/// assert_eq!(iter.next(), Some(Bit::zero()));
/// assert_eq!(iter.next(), Some(Bit::one()));
/// assert_eq!(iter.next(), Some(Bit::zero()));
/// assert_eq!(iter.next(), Some(Bit::zero()));
/// assert_eq!(iter.next(), Some(Bit::one()));
/// assert_eq!(iter.next(), Some(Bit::one()));
/// assert_eq!(iter.next(), None);
/// ```
///
/// # See Also
///
/// * [`Byte`](crate::Byte)
/// * [`Bit`](crate::Bit)
/// * [`Nybble`](crate::Nybble)
/// * [`IterableNybble`](crate::IterableNybble)
pub struct IterableByte<'a> {
byte: &'a Byte,
current_index: u8,
}
impl<'a> IterableByte<'a> {
/// Create a new `IterableByte` from a reference to a `Byte`
///
/// # Arguments
///
/// * `byte` - A reference to a `Byte` to iterate over
///
/// # Returns
///
/// A new `IterableNybble` that can be used to iterate over the `Nybble`
///
/// # Examples
///
/// ```
/// use brainfoamkit_lib::{
/// Byte,
/// IterableByte,
/// };
///
/// let byte = Byte::from(0b1100_1010); // Dec: 202; Hex: 0xCA; Oct: 0o312
/// let mut iter = IterableByte::new(&byte);
///
/// for bit in iter {
/// println!("{}", bit);
/// }
/// ```
#[must_use]
pub const fn new(byte: &'a Byte) -> Self {
Self {
byte,
current_index: 0,
}
}
}
impl<'a> Iterator for IterableByte<'a> {
/// The type of the element the iterator returns
type Item = Bit;
/// Advance the iterator and return the next element
///
/// # Returns
///
/// The next element in the iterator
///
/// # Examples
///
/// ```
/// use brainfoamkit_lib::{
/// Bit,
/// Byte,
/// IterableByte,
/// };
///
/// let byte = Byte::from(0b1100_1010); // Dec: 202; Hex: 0xCA; Oct: 0o312
///
/// let mut iter = IterableByte::new(&byte);
///
/// assert_eq!(iter.next(), Some(Bit::zero()));
/// assert_eq!(iter.next(), Some(Bit::one()));
/// assert_eq!(iter.next(), Some(Bit::zero()));
/// assert_eq!(iter.next(), Some(Bit::one()));
/// assert_eq!(iter.next(), Some(Bit::zero()));
/// assert_eq!(iter.next(), Some(Bit::zero()));
/// assert_eq!(iter.next(), Some(Bit::one()));
/// assert_eq!(iter.next(), Some(Bit::one()));
/// assert_eq!(iter.next(), None);
/// ```
fn next(&mut self) -> Option<Self::Item> {
let current_index = self.current_index;
let next_index = current_index + 1;
if next_index > 8 {
self.current_index = 0;
None
} else {
self.current_index = next_index;
Some(self.byte.get_bit(current_index))
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_iterable_nybble() {
let byte = Byte::from(0b11001010); // Dec: 10; Hex: 0xA; Oct: 0o12
let mut iter = byte.iter();
assert_eq!(iter.next(), Some(Bit::zero()));
assert_eq!(iter.next(), Some(Bit::one()));
assert_eq!(iter.next(), Some(Bit::zero()));
assert_eq!(iter.next(), Some(Bit::one()));
assert_eq!(iter.next(), Some(Bit::zero()));
assert_eq!(iter.next(), Some(Bit::zero()));
assert_eq!(iter.next(), Some(Bit::one()));
assert_eq!(iter.next(), Some(Bit::one()));
assert_eq!(iter.next(), None);
}
}