** In 5.2, could use 'luaL_testudata'... */

** Put at the cache for Lua values the value indexed by 'v' in ktable ** of the running pattern (if it is not there yet); returns its index. */

** Evaluates a capture and adds its first value to buffer 'b'; returns ** whether there was a value */

public slots

** Visit a TCall node taking care to stop recursion. If node not yet ** visited, return 'f(sib2(tree))', otherwise return 'def' (default ** value) */

** Return the size of capture 'cap'. If it is an open capture, 'close' ** must be its corresponding close. */

** Check whether a charset is empty (returns IFail), singleton (IChar), ** full (IAny), or none of those (ISet). When singleton, 'info.offset' ** retu

** Fills a tree node with basic information about the UTF-8 code point ** 'cpu': its value in 'n', its length in 'cap', and its first byte in ** 'key'

** copy 'ktable' of element 'idx' to new tree (on top of stack) */

** When joining 'ktables', constants from one of the subpatterns must ** be renumbered; 'correctkeys' corrects their indices (adding 'n' ** to each of

** Double the size of the stack */

! * \brief extractRepository * Hacky method to extract a repository * \param filename * \return */

** Build a sequence of 'n' nodes, each with tag 'tag' and 'u.n' got ** from the array 's' (or 0 if array is NULL). (TSeq is binary, so it ** must buil

** final label (after traversing any jumps) */

** Return the stack index of the first runtime capture in the given ** list of captures (or zero if no runtime captures) */

** Goes back in a list of captures looking for an open capture ** corresponding to a close one. */

** Get a byte from a compact charset. If index is inside the charset ** range, get the byte from the supporting charset (correcting it ** by the offse