** Return the number of variables in the stack for function 'fs' */

Convert from decibels to a linear scale factor */

========================================================================= * Check for a valid deflate stream state. Return 0 if ok, 1 if not. */

========================================================================= * Flush as much pending output as possible. All deflate() output, except fo

** Ensures final expression result is in next available register. */

** Garbage-collection function */

** Return the "variable description" (Vardesc) of a given ** variable */

Convert formant freqencies and bandwidth into resonator difference equation coefficents */

** Search function for integers. If integer is inside 'alimit', get it ** directly from the array part. Otherwise, if 'alimit' is not equal to ** the

** Returns the real size of the 'array' array */

** 'luaL_addvalue' is the only function in the Buffer system where the ** box (if existent) is not on the top of the stack. So, instead of ** calling

Test a bit. Returns 1 if bit is set.

** Free register used by expression 'e' (if any) */

Compress whatever is at avail_in and next_in and write to the output file. Return -1 if there is an error writing to the output file or if gz_init(

this is a weird definition of log2() for which log2(1) = 1, log2(2) = 2, log2(4) = 3 as required by the specification. fast(?) implementation from stb

Build a set of tables to decode the provided canonical Huffman code. The code lengths are lens[0..codes-1]. The result starts at *table, whose

** Ensure that expression 'e' is not a variable (nor a constant). ** (Expression still may have jump lists.) */

** Reserve 'n' registers in register stack */

** Ensures the stack has at least 'space' extra slots, raising an error ** if it cannot fulfill the request. (The error handling needs a few ** extra

Returns an iterator to the beginning of the output range.