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

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

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

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

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

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

Look for gzip header, set up for inflate or copy. state->x.have must be 0. If this is the first time in, allocate required memory. state->how wil

Reset gzip file state */

-- see zlib.h -- */

-- see zlib.h -- */

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

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

For 80x86 and 680x0, an optimized version will be provided in match.asm or * match.S. The code will be functionally equivalent. */

MAKECRCH */ Generate tables for a byte-wise 32-bit CRC calculation on the polynomial: x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+

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

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

=========================================================================== * Send a literal or distance tree in compressed form, using the codes in

traverse the layout to locate the nearest character to a display position

discard the oldest entry in the undo list

canoncialize the selection so start <= end

find minimum y position if it starts at x1

rects array must be big enough to accommodate all characters in the given ranges

rects array must be big enough to accommodate all characters in the given ranges

check if a utf8 string contains a prefix which is the utf16 string; if so return length of matching utf8 string

Update the window with the last wsize (normally 32K) bytes written before returning. If window does not exist yet, create it. This is only called

--------------------------------------------------------------------------------------

Load embedded ProggyClean.ttf at size 13

Pass in translated ASCII characters for text input. - with glfw you can get those from the callback set in glfwSetCharCallback() - on Windows you can

--------------------------------------------------------------------------------------

Push a new ImGui window to add widgets to. - A default window called "Debug" is automatically stacked at the beginning of every frame so you can use w

--------------------------------------------------------------------------------

--------------------------------------------------------------------------------------

--------------------------------------------------------------------------------

Upper-right button to close a window.

--------------------------------------------------------------------------------------

-----------------------------------------------------------------------------

--------------------------------------------------------------------------------

--------------------------------------------------------------------------------------