Lines Matching full:construct
290 /* Construct the codes of the static literal tree */
610 * Construct one Huffman tree and assigns the code bit strings and lengths.
628 /* Construct the initial heap, with least frequent element in
662 /* Construct the Huffman tree by repeatedly combining the least two
798 * Construct the Huffman tree for the bit lengths and return the index in
923 /* Construct the literal and distance trees */
