Called just before sending the first frame of each message

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

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

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

For the default windowBits of 15 and memLevel of 8, this function returns a close to exact, as well as small, upper bound on the compressed size.

Called by the base class

Report a failure

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

=========================================================================== * Generate the codes for a given tree and bit counts (which need not be

Returns an instance of the executor used to submit completion handlers

Load up input buffer and set eof flag if last data loaded -- return -1 on error, 0 otherwise. Note that the eof flag is set when the end of the in

Decompress from input to the provided next_out and avail_out in the state. On return, state->x.have and state->x.next point to the just decompresse

Reset gzip file state */

-- see zlib.h -- */

Does the parser need to see an EOF to find the end of the message? */

Decode literal, length, and distance codes and write out the resulting literal and match bytes until either not enough input or output is availa

append the empty block codes and inflate

=========================================================================== * Initialize a new block. */

=========================================================================== * Set match_start to the longest match starting at the given string and

Maximum number of characters in the decimal representation of a binary number. This includes the potential minus sign.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

Return a reasonable mime type based on the extension of a file.

=========================================================================== * Restore the heap property by moving down the tree starting at node k,

Start the asynchronous operation

Start the asynchronous operation

Start the asynchronous operation

Start the asynchronous operation

=========================================================================== * Scan a literal or distance tree to determine the frequencies of the cod