Struct huffman_compress::Tree

pub struct Tree<K> { /* fields omitted */ }

A trie used for decoding.

Methods

impl<K: Clone> Tree<K>

Important traits for UnboundedDecoder<'a, K, I>

impl<'a, K: Clone, I: IntoIterator<Item = bool>> Iterator for UnboundedDecoder<'a, K, I> type Item = K;

pub fn unbounded_decoder<I>(&self, iterable: I) -> UnboundedDecoder<K, I> where
    I: IntoIterator<Item = bool>, 

An iterator decoding symbols from a source of bits.

In pathologic cases the iterator is unbounded: If there is only one symbol the iterator will yield that symbol infinitely often without consuming any bits.

If there are no symbols the decoded sequence is empty without consuming any bits.

If the source is exhausted no further symbols will be decoded (not even incomplete ones).

pub fn decoder<I>(&self, iterable: I, num_symbols: usize) -> Decoder<K, I> where
    I: IntoIterator<Item = bool>, 

An iterator decoding up to num_symbols symbols from a source of bits.

Also see unbounded_decoder().

If there are no symbols the decoded sequence is empty without consuming any bits.

If the source is exhausted no further symbols will be decoded (not even incomplete ones).

Trait Implementations

impl<K: Debug> Debug for Tree<K>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<K: Clone> Clone for Tree<K>

fn clone(&self) -> Tree<K>

Returns a copy of the value.

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

Performs copy-assignment from source.