Struct HuffmanDecodeTable 

pub struct HuffmanDecodeTable { /* private fields */ }

Huffman decode table with two-level lookup.

Level 1: 8-bit fast lookup table (covers most codes). Level 2: slow path for codes longer than 8 bits.

Implementations

impl HuffmanDecodeTable

pub fn build(bits: &[u8; 16], huffval: &[u8]) -> Result<Self>

Build a decode table from JPEG-style counts and symbols.

bits: counts[i] = number of codes of length i+1 (16 entries). huffval: the symbols, in order of increasing code length.

pub fn decode(&self, reader: &mut BitReader<'_>) -> Result<u8>

Decode one Huffman symbol from the bit stream.