Skip to content

web search done right

2.0 KB
Raw Blame
const fn compute_mask(num_bits: u8) -> u8 {
    if num_bits == 8 {
        u8::MAX
    } else {
        (1u8 << num_bits) - 1
    }
}

#[inline(always)]
#[must_use]
pub(crate) fn select_bits<const START: u8, const END: u8>(code: u8) -> u8 {
    assert!(START <= END);
    assert!(END <= 8);
    let num_bits: u8 = END - START;
    let mask: u8 = compute_mask(num_bits);
    (code >> START) & mask
}

#[inline(always)]
#[must_use]
pub(crate) fn place_bits<const START: u8, const END: u8>(code: u8) -> u8 {
    assert!(START <= END);
    assert!(END <= 8);
    let num_bits: u8 = END - START;
    let mask: u8 = compute_mask(num_bits);
    assert!(code <= mask);
    code << START
}

/// Pop-front one bytes from a slice of bytes.
#[inline(always)]
pub fn pop_first_byte(bytes: &mut &[u8]) -> Option<u8> {
    if bytes.is_empty() {
        return None;
    }
    let first_byte = bytes[0];
    *bytes = &bytes[1..];
    Some(first_byte)
}

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

    #[test]
    fn test_select_bits() {
        assert_eq!(255u8, select_bits::<0, 8>(255u8));
        assert_eq!(0u8, select_bits::<0, 0>(255u8));
        assert_eq!(8u8, select_bits::<0, 4>(8u8));
        assert_eq!(4u8, select_bits::<1, 4>(8u8));
        assert_eq!(0u8, select_bits::<1, 3>(8u8));
    }

    #[test]
    fn test_place_bits() {
        assert_eq!(255u8, place_bits::<0, 8>(255u8));
        assert_eq!(4u8, place_bits::<2, 3>(1u8));
        assert_eq!(0u8, place_bits::<2, 2>(0u8));
    }

    #[test]
    #[should_panic]
    fn test_place_bits_overflows() {
        let _ = place_bits::<1, 4>(8u8);
    }

    #[test]
    fn test_pop_first_byte() {
        let mut cursor: &[u8] = &b"abcd"[..];
        assert_eq!(pop_first_byte(&mut cursor), Some(b'a'));
        assert_eq!(pop_first_byte(&mut cursor), Some(b'b'));
        assert_eq!(pop_first_byte(&mut cursor), Some(b'c'));
        assert_eq!(pop_first_byte(&mut cursor), Some(b'd'));
        assert_eq!(pop_first_byte(&mut cursor), None);
    }
}