This function is called when the application wants to use another method * of allocating and freeing memory. */

Compress the data in the compression state input */

Ship the compressed text out via chunk writes */

Write a tEXt chunk */

* Reads a character from a file stream. * Comment sequences starting with '#' are skipped until the end of line. * End of line sequences (LF, CR, CR

you can both convert from vector to buffer&size and vica versa. If you use init_buffer to take over a buffer and size, it is not needed to use cleanup

Write out all the unknown chunks for the current given location */

!*************************************************************************** @brief Appends an element to the end of the array, expanding it

* Destroys a GIF extension object. */

* Destroys a GIF image object. */

* Returns the local or the global color table (whichever is applicable), * or a predefined color table if both of these tables are missing. */

!*************************************************************************** @brief Gives current allocated size of array/number of elements. @

Second step for the ...makeFromLengths and ...makeFromFrequencies functions. numcodes, lengths and maxbitlen must already be filled in correctly. retu

* The common memory error handler. */

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

!*************************************************************************** @brief Expands array to new capacity. @param[in] uiSize New capac

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

=========================================================================== * Send a stored block */

index: bitgroup index, bits: bitgroup size(1, 2 or 4), in: bitgroup value, out: octet array to add bits to*/

* Palette can be NULL, in which case it creates a new palette from scratch. */

Return the adler32 of the bytes data[0..len-1]*/

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

=========================================================================== * 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 */

color is not allowed to already exist. Index should be >= 0 (it's signed to be compatible with using -1 for "doesn't exist")*/

returns -1 if color not present, its index otherwise*/

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

Builds two maps: noise - approximation of areas with high-frequency noise, except straight edges. 1=flat, 0=noisy. edges - noise map including

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

LZ77-encode the data. Return value is error code. The input are raw bytes, the output is in the form of unsigned integers with codes representing for

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