bitvec_nom2/
lib.rs

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
//! This crate provides input types for [nom parser combinators](https://crates.io/crates/nom)
//! using [bitvec](https://crates.io/crates/bitvec).
//! With those, you can use common nom combinators directly on streams of bits.
//!
//! ## Example
//!
//! ```rust,ignore
//! let data = [0xA5u8, 0x69, 0xF0, 0xC3];
//! let bits = data.view_bits::<Msb0>();
//!
//! fn parser(bits: &BitSlice<Msb0, u8>) -> IResult<&BitSlice<Msb0, u8>, &BitSlice<Msb0, u8>> {
//!   tag(bits![1, 0, 1, 0])(bits)
//! }
//!
//! assert_eq!(parser(bits), Ok((&bits[..4], &bits[4..])));
//! ```
#![no_std]

extern crate alloc;

use bitvec::prelude::*;

mod input;

#[derive(Copy, Clone, Debug, PartialEq, Eq)]
#[repr(transparent)]
pub struct BSlice<'a, T: BitStore, O: BitOrder>(pub &'a BitSlice<T, O>);
pub struct BArray<T: BitStore, O: BitOrder>(pub BitArray<T, O>);

impl<'a, T: BitStore, O: BitOrder> From<&'a BitSlice<T, O>> for BSlice<'a, T, O> {
    fn from(slice: &'a BitSlice<T, O>) -> Self {
        Self(slice)
    }
}

impl<'a, T: BitStore, O: BitOrder> From<BSlice<'a, T, O>> for &'a BitSlice<T, O> {
    fn from(slice: BSlice<'a, T, O>) -> Self {
        slice.0
    }
}

impl<'a, T: BitStore, O: BitOrder> core::ops::Deref for BSlice<'_, T, O> {
    type Target = BitSlice<T, O>;

    fn deref(&self) -> &Self::Target {
        self.0
    }
}

impl<T: BitStore, O: BitOrder> From<BitArray<T, O>> for BArray<T, O> {
    fn from(slice: BitArray<T, O>) -> Self {
        Self(slice)
    }
}

impl<T: BitStore, O: BitOrder> From<BArray<T, O>> for BitArray<T, O> {
    fn from(slice: BArray<T, O>) -> Self {
        slice.0
    }
}

impl<'a, T: BitStore, O: BitOrder> core::ops::Deref for BArray<T, O> {
    type Target = BitArray<T, O>;

    fn deref(&self) -> &Self::Target {
        &self.0
    }
}