Struct huffman_compress::Tree
[−]
[src]
pub struct Tree<K> { /* fields omitted */ }
A trie used for decoding.
Methods
impl<K: Clone> Tree<K>
[src]
ⓘImportant traits for UnboundedDecoder<'a, K, I>pub fn unbounded_decoder<I>(&self, iterable: I) -> UnboundedDecoder<K, I> where
I: IntoIterator<Item = bool>,
[src]
ⓘImportant traits for UnboundedDecoder<'a, K, I>
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>,
[src]
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>
[src]
fn fmt(&self, __arg_0: &mut Formatter) -> Result
[src]
Formats the value using the given formatter. Read more