** Create a new local variable with the given 'name'. Return its index ** in the function. */

Sets the buffer data and capacity. */

** Accept current char if it is in 'set' (of size 2) */

Open a Zip file. path contain the full pathname (by example, on a Windows NT computer "c:\\test\\zlib114.zip" or on an Unix computer "zlib/z

/

i1 ^= i2 */

returns an iterator to the beginning

** If L1 != L, L1 can be in any state, and therefore there are no ** guarantees about its stack space; any push in L1 must be ** checked. */

///////////////////////////////////////////////////////////////////////////

** Clear keys for empty entries in tables. If entry is empty ** and its key is not marked, mark its entry as dead. This allows the ** collection of th

Returns the number of decimal digits in n. Leading zeros are not counted except for n == 0 in which case count_digits returns 1.

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

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

** Emit code for binary expressions that "produce values" ** (everything but logical operators 'and'/'or' and comparison ** operators). ** Expression

** increment line number and skips newline sequence (any of ** \n, \r, \n\r, or \r\n) */

** tells whether a key or value can be cleared from a weak ** table. Non-collectable objects are never removed from weak ** tables. Strings behave as

** Call a hook for the given event. Make sure there is a hook to be ** called. (Both 'L->hook' and 'L->hookmask', which trigger this ** function, can

** search function for short strings */

** Resize table 't' for the new given sizes. Both allocations (for ** the hash part and for the array part) can fail, which creates some ** subtleties

** beware: when using this function you probably need to check a GC ** barrier and invalidate the TM cache. */

** Format and emit an 'iABC' instruction. (Assertions check consistency ** of parameters versus opcode.) */

** Format and emit an 'iABx' instruction. */

** Ensures final expression result is in a valid R/K index ** (that is, it is either in a register or in 'k' with an index ** in the range of R/K indi

** Path all jumps in 'list' to jump to 'target'. ** (The assert means that we cannot fix a jump to a forward address ** because we only know addresses

** ensure that stack[idx][fname] has a table and push that table ** into the stack */

** Main operation for concatenation: concat 'total' values in the stack, ** from 'L->top - total' up to 'L->top - 1'. */