** Check whether integer 'i' is less than or equal to float 'f'. ** See comments on previous function. */

** Check whether integer 'i' is less than float 'f'. If 'i' has an ** exact representation as a float ('l_intfitsf'), compare numbers as ** floats. Ot

* Parse extension * @param {*} ext * @param {string} [name=''] * @private

** Add integer part of 'x' to buffer and return new 'x' */

** returns the index for 'key' if 'key' is an appropriate key to live in ** the array part of the table, 0 otherwise. */

** t[k] = value at the top of the stack (where 'k' is a string) */

** get (if 'get' is true) or set an upvalue from a closure */

** Add a boolean to list of constants and return its index. */

** Check that 'arg' either is a table or can behave like one (that is, ** has a metatable with the required metamethods) */

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

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

** Emit an "extra argument" instruction (format 'iAx') */

** Try to "constant-fold" an operation; return 1 iff successful. ** (In this case, 'e1' has the final result.) */

copy strings in stack from top - n up to top - 1 to buffer */

** Copy 'size' bytes from 'src' to 'dest', correcting endianness if ** given 'islittle' is different from native endianness. */

** creates a new string object */

** Read an integer numeral from string 'fmt' or return 'df' if ** there is no numeral */

** Ensures expression value is in any register. */

** Ensures expression value is in register 'reg' (and therefore ** 'e' will become a non-relocatable expression). */

** Do the REPL: repeatedly read (load) a line, evaluate (call) it, and ** print any results. */

Emit a 16 bit quantity in the d array (d[2] is first digit, d[0] is last digit)

** Enter first sweep phase. ** The call to 'sweeplist' tries to make pointer point to an object ** inside the list (instead of to the header), so that