@brief sets the binary subtype @sa https://json.nlohmann.me/api/byte_container_with_subtype/set_subtype/

** If function yielded, its 'func' can be in the 'extra' field. The ** next function restores 'func' to its correct value for debugging ** purposes. (

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

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

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

i1 ^= i2 */

i1 ^= i2 */

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

** Convert a BinOpr to an OpCode (ORDER OPR - ORDER OP) */

** Convert a BinOpr to an OpCode (ORDER OPR - ORDER OP) */

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

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

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

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

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

! * @brief string escaping as described in RFC 6901 (Sect. 4) * @param[in] s string to escape * @return escaped string * * Note the order of e

auxiliary function to define indexing expressions */

** "Generic" get version. (Not that generic: not valid for integers, ** which may be in array part, nor for floats with integral values.) ** See expla

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

** increment line number and skips newline sequence (any of ** \n, \r, \n\r, or \r\n) */

** increment line number and skips newline sequence (any of ** \n, \r, \n\r, or \r\n) */

** increment line number and skips newline sequence (any of ** \n, \r, \n\r, or \r\n) */

return whether the iterator can be dereferenced

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

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

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

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

** Find a "name" for the constant 'c'. */

** Advances the garbage collector until it reaches the given state. ** (The option 'fast' is only for testing; in normal code, 'fast' ** here is alway

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