@OPTIMIZE: provide an option that always forces left-predict or paeth predict

=========================================================================== * Flush the bits in the bit buffer to pending output (leaves at most 7 bi

========================================================================= */

=========================================================================== * Flush the bit buffer, keeping at most 7 bits in it. */

=========================================================================== * Reverse the first len bits of a code, using straightforward code (a fas

=========================================================================== * Flush the bit buffer and align the output on a byte boundary */

=========================================================================== Compresses the source buffer into the destination buffer. The level

=========================================================================== * Send the block data compressed using the given Huffman trees */

========================================================================= */

========================================================================= */

Return state with length and distance decoding tables and index sizes set to fixed code decoding. Normally this returns fixed tables from inffixed

=========================================================================== * Generate the codes for a given tree and bit counts (which need not be

Load up input buffer and set eof flag if last data loaded -- return -1 on error, 0 otherwise. Note that the eof flag is set when the end of the in

Decompress from input to the provided next_out and avail_out in the state. On return, state->x.have and state->x.next point to the just decompresse

Look for gzip header, set up for inflate or copy. state->x.have must be 0. If this is the first time in, allocate required memory. state->how wil

Reset gzip file state */

-- see zlib.h -- */

Decode literal, length, and distance codes and write out the resulting literal and match bytes until either not enough input or output is availa

=========================================================================== * Initialize a new block. */

Getter that returns true for user-supplied options. Returns false if not * user-supplied, even with a default value. */

For 80x86 and 680x0, an optimized version will be provided in match.asm or * match.S. The code will be functionally equivalent. */

MAKECRCH */ Generate tables for a byte-wise 32-bit CRC calculation on the polynomial: x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+

Call parse_args_internal - which does all the work * Then, validate the parsed arguments * This variant is used mainly for testing * @throws

=========================================================================== * Restore the heap property by moving down the tree starting at node k,

=========================================================================== * Scan a literal or distance tree to determine the frequencies of the cod

=========================================================================== * Send a literal or distance tree in compressed form, using the codes in

=========================================================================== * Slide the hash table when sliding the window down (could be avoided wit

create the png data from post-deflated data

this function is designed to support animated gifs, although stb_image doesn't support it two back is the image from two frames ago, used for a very s

decode one 64-entry block--

get some unsigned bits

set up the kernels

read 16bit value and convert to 24bit RGB

Update the window with the last wsize (normally 32K) bytes written before returning. If window does not exist yet, create it. This is only called