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

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

chunkName must be string of 4 characters*/

in an idat chunk, each scanline is a multiple of 8 bits, unlike the lodepng output buffer*/

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

bitlen is the size in bits of the code*/

free the above pair again*/

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

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

creates a new chain node with the given parameters, from the memory in the lists */

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

resize and give all new elements the value*/

compress using the default or custom zlib function */

Outputs various dimensions and positions in the image related to the Adam7 reduced images. passw: output containing the width of the 7 passes passh: o

Get RGBA16 color of pixel with index i (y * width + x) from the raw image with given color type, but the given color type must be 16-bit itself.*/

Create the Huffman tree given the symbol frequencies*/

return type is a LodePNG error code*/

Get RGBA8 color of pixel with index i (y * width + x) from the raw image with given color type.*/

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

Return the CRC of the bytes buf[0..len-1].*/

buffer must have at least 4 allocated bytes available*/

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

Returns 0 if the two intervals i1 and i2 are disjoint, or the length of their overlap otherwise.

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

#include "clb/Algorithm/Sort.h" int CompareRectShortSide(const Rect &a, const Rect &b) { using namespace std; int smallerSideA = min(a.width, a.he

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

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

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

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

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

get the literal and length code tree of a deflated block with fixed tree, as per the deflate specification*/