Function nom::bits::complete::tag

pub fn tag<I, O, C, E: ParseError<(I, usize)>>(
    pattern: O,
    count: C
) -> impl Fn((I, usize)) -> IResult<(I, usize), O, E>where
    I: Slice<RangeFrom<usize>> + InputIter<Item = u8> + InputLength + Clone,
    C: ToUsize,
    O: From<u8> + AddAssign + Shl<usize, Output = O> + Shr<usize, Output = O> + PartialEq,

Generates a parser taking count bits and comparing them to pattern