** Convert 'nvar', a compiler index level, to its corresponding ** register. For that, search for the highest variable below that level ** that is in

** If expression is a numeric constant, fills 'v' with its value ** and returns 1. Otherwise, returns 0. */

* Add N defaulted elements to the array * * @param Count - number of elements * @return - the index of the first element added */

Called when the game starts or when spawned

Find member by name. ! \param name Member name to be searched. \pre IsObject() == true \return Iterator to member, if it exist

Query a value in a subtree. ! \param root Root value of a DOM sub-tree to be resolved. It can be any value other than document root. \

interfaces of UnLua::ITypeInterface

* Remove a callback from the delegate. Parameters must be a UObject and a Lua function */

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

** Add 'str' to the buffer. If string is larger than the buffer space, ** push the string directly to the stack. */

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

** Auxiliary function used by several library functions: check for ** an optional thread as function's first argument and set 'arg' with ** 1 if this

** External interface for 'ccall' */

** set GCdebt to a new value keeping the value (totalbytes + GCdebt) ** invariant (and avoiding underflows in 'totalbytes') */

** Get the line corresponding to instruction 'pc' in function 'f'; ** first gets a base line and from there does the increments until ** the desired i

** Emit instruction 'i', checking for array sizes and saving also its ** line information. Return 'i' position. */

** Concatenate jump-list 'l2' into jump-list 'l1' */

semantic error */

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

** try to convert a value to an integer, rounding according to 'mode', ** without string coercion. ** ("Fast track" handled by macro 'tointegerns'.) *

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

-------------------------------------------------------------------------*\ * Connects or returns error message \*------------------------------------

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

* Add a callback to the delegate. Parameters must be a UObject and a Lua function */

* Add a unique element to the array * * @param Item - the element * @return - the index of the added element */

* Build value based on a FProperty */

Remove all elements in the array. ! This function do not deallocate memory in the array, i.e. the capacity is unchanged. \note Linear time com

* Empty the map, and reallocate it for the expected number of pairs. * * @param Slack (Optional) - the expected usage size after empty opera

* Copy an element at the given Lua index to the value of this property * * @param SrcIndexInStack - source Lua index * @param DestConta

* Create weak value table */

* Get a cpp instance's address */

i1 ^= i2 */

* Push a pointer with the name of meta table */

-------------------------------------------------------------------------*\ * Determines if there is any data in the read buffer \*-------------------

** Check consistency of an object: ** - Dead objects can only happen in the 'allgc' list during a sweep ** phase (controlled by the caller through 'ma

** 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, mark its ** entry as dead. This allows the collection of the key, but keeps its ** entry

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