i1 ^= i2 */

* Read |len| bytes from the |pkt| and store a pointer to them in |*data|. This * just points at the underlying buffer that |pkt| is using. The caller

Note that shortcuts are currently provided for display only (future version will add explicit flags to BeginMenu() to request processing shortcuts)

Adds [constant] to the constant pool and returns its index.

Creates a new string object with a null-terminated buffer large enough to hold a string of [length] but does not fill in the bytes. The caller is exp

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

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

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

Generates a hash code for [num].

Calculates and stores the hash code for [string].

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

** Call a hook for the given event. Make sure there is a hook to be ** called. (Both 'L->hook' and 'L->hookmask', which trigger this ** function, can

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

** search function for short strings */

** Resize table 't' for the new given sizes. Both allocations (for ** the hash part and for the array part) can fail, which creates some ** subtleties

** Format and emit an 'iABC' instruction. (Assertions check consistency ** of parameters versus opcode.) */

** Format and emit an 'iABx' instruction. */

** Ensures final expression result is in a valid R/K index ** (that is, it is either in a register or in 'k' with an index ** in the range of R/K indi

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

** Return the name of the type of an object. For tables and userdata ** with metatable, use their '__name' metafield, if present. */

build a new Rand64 value */

! @brief public parser interface @param[in] strict whether to expect the last token to be EOF @param[in,out] result parsed JSON val

** translate a relative initial string position ** (negative means back from end): clip result to [1, inf). ** The length of any string in Lua must fi

** Check whether 'status' is not OK and, if so, prints the error ** message on the top of the stack. It assumes that the error object ** is a string,

** Return true iff value at stack index 'a' is less than the value at ** index 'b' (according to the order of the sort). */

parse suffixes at the end of a number

delete the section

delete the section

move cursor to first character of selection

move cursor to first character of selection

clean up the temporary component buffers

decode a jpeg huffman value from the bitstream

after a restart interval, stbi__jpeg_reset the entropy decoder and the dc prediction

initialize a callback-based context

This is how much to expand buffers to account for filters seeking outside the image boundaries.