Avoid naming collision with imgui_demo.cpp's HelpMarker() for unity builds.

It is the map we need iterate to find valid items, since we don't have "alive" storage anywhere

Sets the 4 signed 32-bit integer values. https://msdn.microsoft.com/en-us/library/vstudio/019beekt(v=vs.100).aspx

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

Allocates a new node from the pool, and optionally assigns name and value to it. If the allocation request cannot be accomodated, this function will t

* Check the set of <TL<TL<TL...>>> tags matches the definition. */

<summary> Computes how many bytes are needed to hold the number of bits. </summary>

empty the queue

** Free register 'reg', if it is neither a constant index nor ** a local variable. ) */

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

** Finishes a function call: calls hook if necessary, moves current ** number of results to proper place, and returns to previous call ** info. If fun

** Close all upvalues and to-be-closed variables up to the given stack ** level. Return restored 'level'. */

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

** returns current 'pc' and marks it as a jump target (to avoid wrong ** optimizations with consecutive instructions not in the same basic block). */

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

** Finish a table assignment 't[key] = val'. ** If 'slot' is NULL, 't' is not a table. Otherwise, 'slot' points ** to the entry 't[key]', or to a val

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

* Extract a large number of bits from the specified PER data pointer. */

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

** Reverse the stack segment from 'from' to 'to' ** (auxiliary to 'lua_rotate') ** Note that we move(copy) only the value inside the stack. ** (We do

Description: Move the current position (forward only). Returns: Nothing.

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