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

=========================================================================== * Copy a stored block, storing first the length and its * one's compleme

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

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

read a PNG, the result will be in the same color type as the PNG (hence "generic")*/

Deflate for a block of type "dynamic", that is, with freely, optimally, created huffman trees*/

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

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

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

=========================================================================== * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash ta

=========================================================================== * For Z_RLE, simply look for runs of bytes, generate matches only of dist

=========================================================================== * Check if the data type is TEXT or BINARY, using the following algorithm

Repeats mediancut with different histogram weights to find palette with minimum error. feedback_loop_trials controls how long the search will take.

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

log2 approximation. A slight bit faster than std::log. */

=========================================================================== * Compute the optimal bit lengths for a tree and update the total bit len

palette must have 4 * palettesize bytes allocated, and given in format RGBARGBARGBARGBA... returns 0 if the palette is opaque, returns 1 if the palett

get the tree of a deflated block with dynamic tree, the tree itself is also Huffman compressed with a known tree*/

get the tree of a deflated block with fixed tree, as specified in the deflate specification*/

Returns how many bits needed to represent given value (max 8 bit)*/

finds median in unsorted set by sorting only minimum required */

-- see zlib.h -- */

-- see zlib.h -- */

-- see zlib.h -- */

-- see zlib.h -- */

-- see zlib.h -- */

-- see zlib.h -- */

-- see zlib.h -- */

sorts array to make sum of weights lower than halfvar one side, returns edge between <halfvar and >halfvar parts of the set */

quick select algorithm */

Do nothing if the colorspace is already invalid */

inflate a block with dynamic of fixed Huffman tree*/

Filters src image and saves it to dst, overwriting tmp in the process. Image must be width*height pixels high. Size controls radius of box blur. */

=========================================================================== * Initialize the "longest match" routines for a new zlib stream */

Automatically chooses color type that gives smallest amount of bits in the output image, e.g. grey if there are only greyscale pixels, palette if ther