Struct PrefixCode 

pub struct PrefixCode { /* private fields */ }

A canonical prefix (Huffman) decoder built from per-symbol code lengths (RFC 9649 §3.7.2).

Decoding uses the classic canonical algorithm (no large lookup table): bits are read one at a time and accumulated MSB-first until they identify a symbol. A single-symbol code returns its symbol without consuming any bits.

Implementations

impl PrefixCode

pub fn from_code_lengths(code_lengths: &[u8]) -> Result<Self>

Builds a decoder from code_lengths (one entry per symbol; 0 = unused).

Errors

Returns Error::InvalidInput if a length exceeds MAX_CODE_LENGTH, if no symbol is used, or if the lengths do not form a complete tree (the single-symbol leaf is the one permitted incomplete tree, per §3.7.2).

pub fn read_symbol(&self, r: &mut BitReader<'_>) -> Result<u16>

Reads one symbol from r.

Errors

Returns Error::InvalidInput on truncation or if the bits do not match any code.

Trait Implementations

impl Clone for PrefixCode

fn clone(&self) -> PrefixCode

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PrefixCode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.