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

UIWidget private functions

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

Based off BoolInVec(bool scalar)

Based off BoolInVec(bool scalar)

Generates an array of vertices and normals for a 3D rectangle (cuboid) If pPoints is NULL or pNumberOfPoints is less than computed number of floats re

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

* Parse JSON string and fill tokens. */

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

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

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

** convert an acceptable stack index into an absolute index */

** Let x = AB, where A is a prefix of length 'n'. Then, ** rotate x n == BA. But BA == (A^r . B^r)^r. */