** Add constant 'v' to prototype's list of constants (field 'k'). ** Use scanner's table to cache position of constants in constant list ** and try to

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

** Code a "conditional jump", that is, a test or comparison opcode ** followed by a jump. Return jump position. */

Return a clone object. Return a copy ('clone') of the md5 object. This can be used to efficiently compute the digests of strings that

Terminate the message-digest computation and return digest. Return the digest of the strings passed to the update() method so far. Th

** Gets the destination address of a jump instruction. Used to traverse ** a list of jumps. */

** 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 function (C or Lua). The function to be called is at *func. ** The arguments are on the stack, right after the function. ** When returns, al

** Similar to 'luaD_call', but does not allow yields during the call */

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

** search function for short strings */

** set functions from list 'l' into table at top - 'nup'; each ** function gets the 'nup' elements at the top as upvalues. ** Returns with only the ta

** returns the 'main' position of an element in a table (that is, the index ** of its hash value) */

** If key is not marked, mark its entry as dead. This allows key to be ** collected, but keeps its entry in the table. A dead node is needed ** when

** Check whether 'status' is not OK and, if so, prints the error ** message on the top of the stack. It assumes that the error object ** is a string,

** Variations of 'lua_settable', used by 'db_getinfo' to put results ** from 'lua_getinfo' into result table. Key is always a string; ** value can be

** Return true iff value at stack index 'a' is less than the value at ** index 'b' (according to the order of the sort). */

from strlib */ translate a relative string position: negative means back from end */

Convert a long integer to a byte string. If optional blocksize is given and greater than zero, pad the front of the byte string with binary z

** check whether current token is in the follow set of a block. ** 'until' closes syntactical blocks, but do not close scope, ** so it is handled in s

** clear entries with unmarked values from all weaktables in list 'l' up ** to element 'f' */

** Interface to 'lua_pcall', which sets appropriate message function ** and C-signal handler. Used to run all chunks. */

* Created by Tivie on 13-07-2015.

** Read an integer numeral and raises an error if it is larger ** than the maximum size for integers. */

* Listen to an event * @param {string} name * @param {function} callback

** advances the garbage collector until it reaches a state allowed ** by 'statemask' */

** Finishes a function call: calls hook if necessary, removes CallInfo, ** moves current number of results to proper place; returns 0 iff call ** want

** Prepares a function call: checks the stack, creates a new CallInfo ** entry, fills in the relevant information, calls hook if needed. ** If functio

** Look for n-th local variable at line 'line' in function 'func'. ** Returns NULL if not found. */

** Emit a "load constant" instruction, using either 'OP_LOADK' ** (if constant index 'k' fits in 18 bits) or an 'OP_LOADKX' ** instruction with "extra

** Path all jumps in 'list' to close upvalues up to given 'level' ** (The assertion checks that jumps either were closing nothing ** or were closing h

** this function handles only '%d', '%c', '%f', '%p', and '%s' conventional formats, plus Lua-specific '%I' and '%U' */

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

** Shift left operation. (Shift right just negates 'y'.) */

** creates a new string and anchors it in scanner's table so that ** it will not be collected until the end of the compilation ** (by that time it sho