bit_list/
lib.rs

1#![no_std]
2use core::marker::PhantomData;
3use lim_bit_vec::BitVec;
4use list_fn::{FlatMap, FlatMapFn, FlatMapList, ListFn, ResultFn};
5use uints::UInt;
6
7pub struct Lsb0FlatMap<T: UInt>(PhantomData<T>);
8
9impl<T: UInt> Default for Lsb0FlatMap<T> {
10    fn default() -> Self {
11        Self(Default::default())
12    }
13}
14
15impl<T: UInt> FlatMapFn for Lsb0FlatMap<T> {
16    type Input = T;
17    type OutputList = BitVec<T>;
18    fn map(&self, item: T) -> BitVec<T> {
19        BitVec::new_full(item)
20    }
21}
22
23pub trait Lsb0
24where
25    Self: ListFn,
26    Self::Item: UInt,
27    Self::End: ResultFn<Result = ()>,
28{
29    fn lsb0(self) -> FlatMapList<Self, Lsb0FlatMap<Self::Item>> {
30        self.flat_map(Lsb0FlatMap::default())
31    }
32}
33
34impl<L> Lsb0 for L
35where
36    Self: ListFn,
37    Self::Item: UInt,
38    Self::End: ResultFn<Result = ()>,
39{
40}
41
42#[cfg(test)]
43mod tests {
44    use super::*;
45    extern crate alloc;
46    use alloc::vec::Vec;
47    use list_fn::{Collect, IterWrap};
48    #[test]
49    fn it_works() {
50        let a: &[u8] = &[1, 2];
51        assert_eq!(
52            a.iter().cloned().lsb0().collect(Vec::default()).collection,
53            [
54                true, false, false, false, false, false, false, false, false, true, false, false,
55                false, false, false, false
56            ]
57        );
58        let v: Vec<u8> = [3, 4].to_vec();
59        assert_eq!(
60            v.into_iter().lsb0().collect(Vec::default()).collection,
61            [
62                true, true, false, false, false, false, false, false, false, false, true, false,
63                false, false, false, false
64            ]
65        );
66        {
67            let mut r = Vec::new();
68            let v: Vec<u8> = [3, 4].to_vec();
69            for elem in v.into_iter().lsb0().iter_wrap() {
70                r.push(elem)
71            }
72            assert_eq!(
73                r,
74                [
75                    true, true, false, false, false, false, false, false, false, false, true,
76                    false, false, false, false, false
77                ]
78            );
79        }
80    }
81}