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

Get the first child node, or null if none exists.

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

Karl Malbrain's compact CRC-32. See "A compact CCITT crc16 and crc32 C implementation that balances processor cache usage against speed": http://www.g

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

Leanify the file and move the file ahead size_leanified bytes the new location of the file will be file_pointer - size_leanified it's designed this wa

chunkName must be string of 4 characters*/

Create a handle from a node.

Microsoft visual studio, version 2005 and higher. int _snprintf_s( char *buffer, size_t sizeOfBuffer, size_t count, const char *format [,

bp = bitpointer, always in range [0, 7]. The outsize is number of necessary bytes to encode the bits. Given the value of bp and the amount of bytes, t

Returns symbol in range [257-285] (inclusive). */

Appends the length and distance to the LZ77 arrays of the ZopfliLZ77Store. context must be a ZopfliLZ77Store*. */

bitlen is the size in bits of the code*/

returns the code, or (unsigned)(-1) if error happened inbitlength is the length of the complete buffer, in bits (so its byte length times 8) */

free the above pair again*/

init a {char*, size_t} pair for use as string*/

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

Adds bits, like AddBits, but the order is inverted. The deflate specification uses both orders in one standard. */

Returns estimated cost of a block in bits. It includes the size to encode the tree and the size to encode all literal, length and distance symbols an

given the code lengths (as stored in the PNG file), generate the tree as defined by Deflate. maxbitlen is the maximum bits that a code in the tree can

Initializes a chain node with the given values and marks it as in use. */