Lines Matching refs:Huffman

444 If you have requested a multi-pass operating mode, such as Huffman code
995         TRUE causes the compressor to compute optimal Huffman coding tables
999         Huffman tables.  In most cases optimal tables save only a few percent
1001         TRUE, you need not supply Huffman tables at all, and any you do
1100         Pointers to Huffman coding tables, one per table slot, or NULL if
1104         Note that optimal Huffman tables can be computed for an image
1106         any need to mess with providing your own Huffman tables.
1753 Huffman code optimization and multiple-scan output.  Those modes write the
1887 to the decoder's coefficient buffer.  This is fast because only Huffman
1912 should also note that the compressor currently forces Huffman optimization
1913 mode when creating a progressive JPEG file, because the default Huffman
2305 and Huffman tables.  In a situation where many images will be stored or
2331 decompression objects, a quantization or Huffman table will be retained for
2337 quantization and Huffman table struct contains a boolean field "sent_table",
2360 and Huffman tables that are currently defined in the compression object will
2381 You cannot suppress output of the computed Huffman tables when Huffman
2408 Code to load a fixed Huffman table is typically (for AC table "n"):
2414       /* counts[i] is number of Huffman codes of length i bits, i=1..16 */
2418       /* symbols[] is the list of Huffman symbols, in code-length order */
2426 into it, as illustrated above.  Ditto for Huffman tables, of course.)
2999 if Huffman-table optimization is asked for, even if progressive mode is not
3021 Note that a 12-bit library always compresses in Huffman optimization mode,
3022 in order to generate valid Huffman tables.  This is necessary because our
3023 default Huffman tables only cover 8-bit data.  If you need to output 12-bit
3024 files in one pass, you'll have to supply suitable default Huffman tables.