Lines Matching full:trees
197 and Huffman coding. The Huffman trees for each block are independent
202 Each block consists of two parts: a pair of Huffman code trees that
204 compressed data part. (The Huffman trees themselves are compressed
217 The code trees for each block appear in a compact form just before
546 read representation of code trees (see
809 new block with fresh trees would be useful, or when the block size
