Utility functions to make particular color-maps */

returns 1 if success, 0 if failure ==> nothing done*/

Test one file */

Blurs image horizontally (width 2*size+1) and writes it transposed to dst (called twice gives 2d blur) */

returns 1 if success, 0 if failure ==> nothing done*/

wpos = pos & (windowsize - 1)*/

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

* Voronoi iteration: new palette color is computed from weighted average of colors that map to that palette entry. */

write the lz77-encoded data, which has lit, len and dist codes, to compressed stream using huffman trees. tree_ll: the tree for lit and len codes. tre

in: Adam7 interlaced image, with no padding bits between scanlines, but between reduced images so that each reduced image starts at a byte. out: the

in: non-interlaced image with size w*h out: the same pixels, but re-ordered according to PNG's Adam7 interlacing, with no padding bits between scanli

* Constructs a GIF graphic control extension object * from a raw extension object. */

* Initializes a GIF extension object. */

* Initializes a GIF image object. */

* Reads the next GIF block into an image or extension object. */

* Reads the next GIF extension. */

* Reads the next GIF image and local color table. */

* Reads the GIF screen and the global color table. */

!*********************************************************************** @brief Returns the number of meaningful members in the map. @return

the tree representation used by the decoder. return value is error*/

!*************************************************************************** @brief Removes the last element. Simply decrements the size value.

=========================================================================== * Send one empty static block to give enough lookahead for inflate. * Th

=========================================================================== * Initialize the tree data structures for a new zlib stream. */

build the output filename from the input name by inserting "-fs8" or * "-or8" before the ".png" extension (or by appending that plus ".png" if * the

increase histogram popularity by difference from the final color (this is used as part of feedback loop) */

** Find the best splittable box. -1 if no boxes are splittable. */

Boundary Package Merge step, numpresent is the amount of leaves, and c is the current chain.*/

Weighted per-channel variance of the box. It's used to decide which channel to split by */

=========================================================================== * Construct the Huffman tree for the bit lengths and return the index in

////////////////////////////////////////////////////////////////////////////////////////