Encodes the Huffman tree and returns how many bits its encoding takes. If out is a null pointer, only returns the size and runs faster. */

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

Create the Huffman tree given the symbol frequencies*/

* Return a code (byte). * This function can be called iteratively. * @param raw raw code. * @return code */

Returns the next Huffman-coded symbol.

Same as FFT8, but all inputs are real. TODO: Since this does not need to be in-place, maybe there is a faster FFT than this one, which is derived from

Update the sliding hash value with the given byte. All calls to this function must be made on consecutive input characters. Since the hash value exist

Gets the amount of extra bits for the given length, cfr. the DEFLATE spec. */

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

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

buffer must have at least 4 allocated bytes available*/

* ASN.1 DER decoding routines */

* Decode a base64-formatted buffer */

* Encode a buffer into base64 format */

Constant-flow "greater than" comparison: * return x > y * * This is equivalent to \p x > \p y, but is likely to be compiled * to code using bitwis

* output = MD5( input buffer ) */

* Modulo: r = A mod b */

* Baseline multiplication: X = A * b */

Implementation that should never be optimized out by the compiler */

* Parse a private key */

* Check for the consistency of all fields in an RSA private key context */