search the index in the array, that has the largest value smaller than or equal to the given value, given array must be sorted (if no value is smaller

search the index in the array, that has the largest value smaller than or equal to the given value, given array must be sorted (if no value is smaller

This uses a simple combsort to sort the data. This function is not critical for overall encoding speed and the data amount isn't that large. */

This uses a simple combsort to sort the data. This function is not critical for overall encoding speed and the data amount isn't that large. */

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

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

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

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: 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

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

-------------------------------------------------------------------------------------------------

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

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

ColorImage