Struct huffman_compress::Tree
source · pub struct Tree<K> { /* private fields */ }
Expand description
A trie used for decoding.
Implementations§
source§impl<K: Clone> Tree<K>
impl<K: Clone> Tree<K>
sourcepub fn unbounded_decoder<I>(&self, iterable: I) -> UnboundedDecoder<'_, K, I> ⓘwhere
I: IntoIterator<Item = bool>,
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).
sourcepub fn decoder<I>(&self, iterable: I, num_symbols: usize) -> Decoder<'_, K, I>where
I: IntoIterator<Item = bool>,
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§
Auto Trait Implementations§
impl<K> RefUnwindSafe for Tree<K>where K: RefUnwindSafe,
impl<K> Send for Tree<K>where K: Send,
impl<K> Sync for Tree<K>where K: Sync,
impl<K> Unpin for Tree<K>where K: Unpin,
impl<K> UnwindSafe for Tree<K>where K: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more