Lines Matching full:construct
292 /* Construct the codes of the static literal tree */
612 * Construct one Huffman tree and assigns the code bit strings and lengths.
630 /* Construct the initial heap, with least frequent element in
664 /* Construct the Huffman tree by repeatedly combining the least two
800 * Construct the Huffman tree for the bit lengths and return the index in
937 /* Construct the literal and distance trees */
