! * Mapped search row. */

Our URL parser. * * This is designed to be shared by http_parser_execute() for URL validation, * hence it has a state transition + byte-for-byte in

! * Swap object from other. */

------------------------------------------------------------------------------ Name: toJson ----------------------------------------------------------

Write the 32-bit values in table[0..k-1] to out, five per line in hexadecimal separated by commas. */

Return x^(n * 2^k) modulo p(x). Requires that x2n_table[] has been initialized. */

! * Get application work dir. */

Generate the little and big-endian braid tables for the given n and z_word_t size w. Each array must have room for w blocks of 256 elements. */

=========================================================================== * Construct one Huffman tree and assigns the code bit strings and lengths

=========================================================================== * Check that the match at match_start is indeed a match. */

! * Get tab buttons count. */

! * Get media duration. */

Fetch data and put it in the output buffer. Assumes state->x.have is 0. Data is either copied from the input file or decompressed from the input

Use read() to load a buffer -- return -1 on error, otherwise 0. Read from state->fd, and update state->eof, state->err, and state->msg as appropri

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

Read len bytes into buf from file, or less than len up to the end of the input. Return the number of bytes read. If zero is returned, either the

Skip len uncompressed bytes of output. Return -1 on error, 0 on success. */

! * Get the current raw data. */

* Initialize the encryption keys and the random header according to * the given password. */