itybity 0.3.3

An itty bitty crate providing bit iterators and bit iterator accessories.
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
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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
use core::{fmt::Debug, marker::PhantomData, ops::Range};

use rayon::{
    iter::{
        plumbing::{bridge, Consumer, Producer, ProducerCallback, UnindexedConsumer},
        FlatMap, ParallelIterator,
    },
    prelude::{IndexedParallelIterator, IntoParallelIterator, IntoParallelRefIterator},
};

use crate::{BitIter, BitIterable, BitLength, BitOrder, GetBit, Lsb0, Msb0};

/// Trait for types that can be converted into a borrowing parallel bit iterator.
///
/// # Note
///
/// This trait should be preferred over [`IntoParallelBits`] as it allows
/// shared access to the underlying data without cloning.
pub trait ToParallelBits<'a> {
    /// The Lsb0 parallel bit iterator type.
    type IterLsb0: ParallelIterator<Item = bool>;
    /// The Msb0 parallel bit iterator type.
    type IterMsb0: ParallelIterator<Item = bool>;

    /// Creates a parallel bit iterator over `self` in Lsb0 order.
    fn par_iter_lsb0(&'a self) -> Self::IterLsb0;

    /// Creates a parallel bit iterator over `self` in Msb0 order.
    fn par_iter_msb0(&'a self) -> Self::IterMsb0;
}

impl<'a, T> ToParallelBits<'a> for T
where
    T: BitIterable + Sync + 'a,
{
    type IterLsb0 = ParallelBitIterRef<'a, T, Lsb0>;
    type IterMsb0 = ParallelBitIterRef<'a, T, Msb0>;

    fn par_iter_lsb0(&'a self) -> Self::IterLsb0 {
        ParallelBitIterRef::from(self)
    }

    fn par_iter_msb0(&'a self) -> Self::IterMsb0 {
        ParallelBitIterRef::from(self)
    }
}

/// Trait for types that can be converted into a parallel bit iterator.
///
/// # Note
///
/// [`ToParallelBits`] should be preferred over [`IntoParallelBits`] as it allows
/// shared access to the underlying data without cloning.
pub trait IntoParallelBits
where
    Self: BitIterable + Send,
{
    /// The Lsb0 parallel bit iterator type.
    type IterLsb0: ParallelIterator<Item = bool>;
    /// The Msb0 parallel bit iterator type.
    type IterMsb0: ParallelIterator<Item = bool>;

    /// Converts `self` into a parallel bit iterator in Lsb0 order.
    fn into_par_iter_lsb0(self) -> Self::IterLsb0;

    /// Converts `self` into a parallel bit iterator in Msb0 order.
    fn into_par_iter_msb0(self) -> Self::IterMsb0;
}

impl<T> IntoParallelBits for T
where
    T: BitIterable + Clone + Send,
{
    type IterLsb0 = ParallelBitIter<T, Lsb0>;
    type IterMsb0 = ParallelBitIter<T, Msb0>;

    fn into_par_iter_lsb0(self) -> Self::IterLsb0 {
        ParallelBitIter::from(self)
    }

    fn into_par_iter_msb0(self) -> Self::IterMsb0 {
        ParallelBitIter::from(self)
    }
}

/// Trait for converting parallel iterators over values into parallel iterators over bits.
///
/// This trait is automatically implemented for all types that implement [`IntoParallelIterator`] where
/// the item type implements [`IntoParallelBits`].
///
/// # Note
///
/// This trait uses [`IntoParallelBits`] to convert the underlying type into a bit iterator. This causes
/// the underlying type to be cloned for each iterator.
///
/// See [`IntoParallelRefBitIterator`] for a trait which allows iterating over the bits of the underlying data
/// without cloning.
pub trait IntoParallelBitIterator {
    /// The Lsb0 parallel bit iterator type.
    type IterLsb0: ParallelIterator<Item = bool>;
    /// The Msb0 parallel bit iterator type.
    type IterMsb0: ParallelIterator<Item = bool>;

    /// Converts `self` into a parallel bit iterator in Lsb0 order.
    fn into_par_iter_lsb0(self) -> Self::IterLsb0;

    /// Converts `self` into a parallel bit iterator in Msb0 order.
    fn into_par_iter_msb0(self) -> Self::IterMsb0;
}

impl<T> IntoParallelBitIterator for T
where
    T: IntoParallelIterator,
    T::Item: IntoParallelBits,
{
    type IterLsb0 = FlatMap<T::Iter, fn(T::Item) -> <T::Item as IntoParallelBits>::IterLsb0>;
    type IterMsb0 = FlatMap<T::Iter, fn(T::Item) -> <T::Item as IntoParallelBits>::IterMsb0>;

    fn into_par_iter_lsb0(self) -> Self::IterLsb0 {
        self.into_par_iter()
            .flat_map(IntoParallelBits::into_par_iter_lsb0)
    }

    fn into_par_iter_msb0(self) -> Self::IterMsb0 {
        self.into_par_iter()
            .flat_map(IntoParallelBits::into_par_iter_msb0)
    }
}

/// Trait for converting parallel iterators over value *references* into parallel iterators over bits.
///
/// This trait is automatically implemented for all types that implement [`IntoParallelRefIterator`] where
/// the item type implements [`ToParallelBits`].
///
/// Use of this trait is preferred instead of [`IntoParallelBitIterator`] as it allows shared access to
/// the underlying data without cloning.
pub trait IntoParallelRefBitIterator<'a> {
    /// The Lsb0 parallel bit iterator type.
    type IterLsb0: ParallelIterator<Item = bool> + 'a;
    /// The Msb0 parallel bit iterator type.
    type IterMsb0: ParallelIterator<Item = bool> + 'a;

    /// Creates a parallel bit iterator over `self` in Lsb0 order.
    fn par_iter_lsb0(&'a self) -> Self::IterLsb0;

    /// Creates a parallel bit iterator over `self` in Msb0 order.
    fn par_iter_msb0(&'a self) -> Self::IterMsb0;
}

impl<'a, T> IntoParallelRefBitIterator<'a> for T
where
    T: IntoParallelRefIterator<'a> + ?Sized,
    T::Iter: 'a,
    T::Item: BitIterable + Sync + Clone + 'a,
{
    type IterLsb0 = FlatMap<T::Iter, fn(T::Item) -> <T::Item as IntoParallelBits>::IterLsb0>;
    type IterMsb0 = FlatMap<T::Iter, fn(T::Item) -> <T::Item as IntoParallelBits>::IterMsb0>;

    fn par_iter_lsb0(&'a self) -> Self::IterLsb0 {
        self.par_iter()
            .flat_map(IntoParallelBits::into_par_iter_lsb0)
    }

    fn par_iter_msb0(&'a self) -> Self::IterMsb0 {
        self.par_iter()
            .flat_map(IntoParallelBits::into_par_iter_msb0)
    }
}

/// Parallel iterator over bits.
#[derive(Debug, Clone)]
pub struct ParallelBitIter<T, O>
where
    O: BitOrder,
{
    range: Range<usize>,
    bit_order: PhantomData<O>,
    value: T,
}

impl<T, O> From<T> for ParallelBitIter<T, O>
where
    T: GetBit<O> + BitLength,
    O: BitOrder,
{
    fn from(value: T) -> Self {
        Self {
            value,
            range: 0..T::BITS,
            bit_order: PhantomData,
        }
    }
}

impl<T, O> ParallelIterator for ParallelBitIter<T, O>
where
    T: GetBit<O> + BitLength + Clone + Send,
    O: BitOrder,
{
    type Item = bool;

    fn drive_unindexed<C>(self, consumer: C) -> C::Result
    where
        C: UnindexedConsumer<Self::Item>,
    {
        bridge(self, consumer)
    }

    fn opt_len(&self) -> Option<usize> {
        Some(self.range.len())
    }
}

impl<T, O> IndexedParallelIterator for ParallelBitIter<T, O>
where
    T: GetBit<O> + BitLength + Clone + Send,
    O: BitOrder,
{
    fn len(&self) -> usize {
        self.range.len()
    }

    fn drive<C: Consumer<Self::Item>>(self, consumer: C) -> C::Result {
        bridge(self, consumer)
    }

    fn with_producer<CB: ProducerCallback<Self::Item>>(self, callback: CB) -> CB::Output {
        callback.callback(self)
    }
}

impl<T, O> Producer for ParallelBitIter<T, O>
where
    T: GetBit<O> + BitLength + Clone + Send,
    O: BitOrder,
{
    type Item = bool;
    type IntoIter = BitIter<T, O>;

    fn into_iter(self) -> Self::IntoIter {
        BitIter {
            value: self.value,
            range: self.range,
            bit_order: PhantomData,
        }
    }

    fn split_at(self, index: usize) -> (Self, Self) {
        assert!(index <= self.range.len());

        let mid = self.range.start.wrapping_add(index);
        let left = self.range.start..mid;
        let right = mid..self.range.end;

        (
            Self {
                value: self.value.clone(),
                range: left,
                bit_order: PhantomData,
            },
            Self {
                value: self.value,
                range: right,
                bit_order: PhantomData,
            },
        )
    }
}

/// Parallel iterator over bits by reference.
#[derive(Debug, Clone)]
pub struct ParallelBitIterRef<'a, T, O>
where
    O: BitOrder,
{
    range: Range<usize>,
    bit_order: PhantomData<O>,
    value: &'a T,
}

impl<'a, T, O> From<&'a T> for ParallelBitIterRef<'a, T, O>
where
    T: GetBit<O> + BitLength,
    O: BitOrder,
{
    fn from(value: &'a T) -> Self {
        Self {
            value,
            range: 0..T::BITS,
            bit_order: PhantomData,
        }
    }
}

impl<T, O> ParallelIterator for ParallelBitIterRef<'_, T, O>
where
    T: GetBit<O> + BitLength + Sync,
    O: BitOrder,
{
    type Item = bool;

    fn drive_unindexed<C>(self, consumer: C) -> C::Result
    where
        C: UnindexedConsumer<Self::Item>,
    {
        bridge(self, consumer)
    }

    fn opt_len(&self) -> Option<usize> {
        Some(self.range.len())
    }
}

impl<T, O> IndexedParallelIterator for ParallelBitIterRef<'_, T, O>
where
    T: GetBit<O> + BitLength + Sync,
    O: BitOrder,
{
    fn len(&self) -> usize {
        self.range.len()
    }

    fn drive<C: Consumer<Self::Item>>(self, consumer: C) -> C::Result {
        bridge(self, consumer)
    }

    fn with_producer<CB: ProducerCallback<Self::Item>>(self, callback: CB) -> CB::Output {
        callback.callback(self)
    }
}

impl<'a, T, O> Producer for ParallelBitIterRef<'a, T, O>
where
    T: GetBit<O> + BitLength + Sync,
    O: BitOrder,
{
    type Item = bool;
    type IntoIter = BitIter<&'a T, O>;

    fn into_iter(self) -> Self::IntoIter {
        BitIter {
            value: self.value,
            range: self.range,
            bit_order: PhantomData,
        }
    }

    fn split_at(self, index: usize) -> (Self, Self) {
        assert!(index <= self.range.len());

        let mid = self.range.start.wrapping_add(index);
        let left = self.range.start..mid;
        let right = mid..self.range.end;

        (
            Self {
                value: self.value,
                range: left,
                bit_order: PhantomData,
            },
            Self {
                value: self.value,
                range: right,
                bit_order: PhantomData,
            },
        )
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use rstest::*;

    use crate::StrToBits;

    trait Fixtures<T> {
        const ZERO: T;
        const ONE: T;
        const TWO: T;
        const MAX: T;
    }

    macro_rules! impl_fixtures {
        ($($ty:ty),*) => {
            $(
                impl Fixtures<$ty> for $ty {
                    const ZERO: $ty = 0;
                    const ONE: $ty = 1;
                    const TWO: $ty = 2;
                    const MAX: $ty = <$ty>::MAX;
                }
            )*
        };
    }

    impl_fixtures!(u8, u16, u32, u64, u128, usize, i8, i16, i32, i64, i128, isize);

    #[rstest]
    #[case::u8(PhantomData::<u8>)]
    #[case::u16(PhantomData::<u16>)]
    #[case::u32(PhantomData::<u32>)]
    #[case::u64(PhantomData::<u64>)]
    #[case::u128(PhantomData::<u128>)]
    #[case::usize(PhantomData::<usize>)]
    #[case::i8(PhantomData::<i8>)]
    #[case::i16(PhantomData::<i16>)]
    #[case::i32(PhantomData::<i32>)]
    #[case::i64(PhantomData::<i64>)]
    #[case::i128(PhantomData::<i128>)]
    #[case::isize(PhantomData::<isize>)]
    fn test_into_par_bit_iter<T>(#[case] _ty: PhantomData<T>)
    where
        T: Fixtures<T> + BitIterable + Clone + Send + Copy + std::fmt::Binary,
    {
        for value in [T::ZERO, T::ONE, T::TWO, T::MAX] {
            let expected_msb0_bits = format!("{:0width$b}", value, width = T::BITS).to_bit_vec();
            let expected_lsb0_bits = expected_msb0_bits
                .iter()
                .copied()
                .rev()
                .collect::<Vec<bool>>();

            assert_eq!(
                value.into_par_iter_msb0().collect::<Vec<bool>>(),
                expected_msb0_bits
            );
            assert_eq!(
                value.into_par_iter_lsb0().collect::<Vec<bool>>(),
                expected_lsb0_bits
            );
        }
    }

    #[rstest]
    #[case::u8(PhantomData::<u8>)]
    #[case::u16(PhantomData::<u16>)]
    #[case::u32(PhantomData::<u32>)]
    #[case::u64(PhantomData::<u64>)]
    #[case::u128(PhantomData::<u128>)]
    #[case::usize(PhantomData::<usize>)]
    #[case::i8(PhantomData::<i8>)]
    #[case::i16(PhantomData::<i16>)]
    #[case::i32(PhantomData::<i32>)]
    #[case::i64(PhantomData::<i64>)]
    #[case::i128(PhantomData::<i128>)]
    #[case::isize(PhantomData::<isize>)]
    fn test_to_par_bit_iter_slice<T>(#[case] _ty: PhantomData<T>)
    where
        T: Fixtures<T> + BitIterable + Copy + Sync + std::fmt::Binary,
    {
        let expected_msb0_bits = format!(
            "{:0width$b}{:0width$b}{:0width$b}{:0width$b}",
            T::ZERO,
            T::ONE,
            T::TWO,
            T::MAX,
            width = T::BITS
        )
        .to_bit_vec();
        let expected_lsb0_bits = expected_msb0_bits
            .chunks(T::BITS)
            .flat_map(|chunk| chunk.iter().copied().rev())
            .collect::<Vec<bool>>();

        let slice = [T::ZERO, T::ONE, T::TWO, T::MAX];

        assert_eq!(
            slice.par_iter_msb0().collect::<Vec<bool>>(),
            expected_msb0_bits
        );
        assert_eq!(
            slice.par_iter_lsb0().collect::<Vec<bool>>(),
            expected_lsb0_bits
        );
    }
}