Lines Matching refs:Table
14 ** Hash uses a mix of chained scatter table with Brent's variation.
82 static Node *hashnum (const Table *t, lua_Number n) {
95 ** returns the `main' position of an element in a table (that is, the index
98 static Node *mainposition (const Table *t, const TValue *key) {
126 ** the array part of the table, -1 otherwise.
141 ** returns the index of a `key' for table traversals. First goes all
145 static int findindex (lua_State *L, Table *t, StkId key) {
158 i = cast_int(n - gnode(t, 0)); /* key index in hash table */
170 int luaH_next (lua_State *L, Table *t, StkId key) {
230 static int numusearray (const Table *t, int *nums) {
255 static int numusehash (const Table *t, int *nums, int *pnasize) {
271 static void setarrayvector (lua_State *L, Table *t, int size) {
280 static void setnodevector (lua_State *L, Table *t, int size) {
290 luaG_runerror(L, "table overflow");
305 void luaH_resize (lua_State *L, Table *t, int nasize, int nhsize) {
329 already present in the table */
338 void luaH_resizearray (lua_State *L, Table *t, int nasize) {
344 static void rehash (lua_State *L, Table *t, const TValue *ek) {
358 /* resize the table to new computed sizes */
369 Table *luaH_new (lua_State *L) {
370 Table *t = &luaC_newobj(L, LUA_TTABLE, sizeof(Table), NULL, 0)->h;
380 void luaH_free (lua_State *L, Table *t) {
388 static Node *getfreepos (Table *t) {
400 ** inserts a new key into a hash table; first, check whether key's main
406 TValue *luaH_newkey (lua_State *L, Table *t, const TValue *key) {
408 if (ttisnil(key)) luaG_runerror(L, "table index is nil");
410 luaG_runerror(L, "table index is NaN");
416 rehash(L, t, key); /* grow table */
418 return luaH_set(L, t, key); /* insert key into grown table */
447 const TValue *luaH_getint (Table *t, int key) {
467 const TValue *luaH_getstr (Table *t, TString *key) {
482 const TValue *luaH_get (Table *t, const TValue *key) {
511 TValue *luaH_set (lua_State *L, Table *t, const TValue *key) {
519 void luaH_setint (lua_State *L, Table *t, int key, TValue *value) {
533 static int unbound_search (Table *t, unsigned int j) {
541 /* table was built with bad purposes: resort to linear search */
558 ** Try to find a boundary in table `t'. A `boundary' is an integer index
561 int luaH_getn (Table *t) {
583 Node *luaH_mainposition (const Table *t, const TValue *key) {
