Struct bitstream_io::huffman::WriteHuffmanTree

pub struct WriteHuffmanTree<E: Endianness, T: Ord> { /* fields omitted */ }

Methods

impl<E: Endianness, T: Ord + Clone> WriteHuffmanTree<E, T>

fn has_symbol(&self, symbol: T) -> bool

Returns true if symbol is in tree.

fn get(&self, symbol: T) -> &[(u32, u32)]

Given symbol, returns (bits, value) pairs for writing code. Panics if symbol is not found.