Lines Matching full:construct
295 /* Construct the codes of the static literal tree */
616 * Construct one Huffman tree and assigns the code bit strings and lengths.
634 /* Construct the initial heap, with least frequent element in
668 /* Construct the Huffman tree by repeatedly combining the least two
804 * Construct the Huffman tree for the bit lengths and return the index in
941 /* Construct the literal and distance trees */
