static void resize (lua_State *L, Table *t, int nasize, int nhsize) {  int i;  int oldasize = t->sizearray;  int oldhsize = t->lsizenode;  Node *nold = t->node;  /* save old hash ... */  if (nasize > oldasize)  /* array part must grow? */    setarrayvector(L, t, nasize);  /* create new hash part with appropriate size */  setnodevector(L, t, nhsize);    if (nasize < oldasize) {  /* array part must shrink? */    t->sizearray = nasize;    /* re-insert elements from vanishing slice */    for (i=nasize; i<oldasize; i++) {      if (!ttisnil(&t->array[i]))        setobjt2t(L, luaH_setnum(L, t, i+1), &t->array[i]);    }    /* shrink array */    luaM_reallocvector(L, t->array, oldasize, nasize, TValue);  }  /* re-insert elements from hash part */  for (i = twoto(oldhsize) - 1; i >= 0; i--) {    Node *old = nold+i;    if (!ttisnil(gval(old)))      setobjt2t(L, luaH_set(L, t, key2tval(old)), gval(old));  }  if (nold != dummynode)    luaM_freearray(L, nold, twoto(oldhsize), Node);  /* free old array */}void luaH_resizearray (lua_State *L, Table *t, int nasize) {  int nsize = (t->node == dummynode) ? 0 : sizenode(t);  resize(L, t, nasize, nsize);}static void rehash (lua_State *L, Table *t, const TValue *ek) {  int nasize, na;  int nums[MAXBITS+1];  /* nums[i] = number of keys between 2^(i-1) and 2^i */  int i;  int totaluse;  for (i=0; i<=MAXBITS; i++) nums[i] = 0;  /* reset counts */  nasize = numusearray(t, nums);  /* count keys in array part */  totaluse = nasize;  /* all those keys are integer keys */  totaluse += numusehash(t, nums, &nasize);  /* count keys in hash part */  /* count extra key */  nasize += countint(ek, nums);  totaluse++;  /* compute new size for array part */  na = computesizes(nums, &nasize);  /* resize the table to new computed sizes */  resize(L, t, nasize, totaluse - na);}/*** }=============================================================*/Table *luaH_new (lua_State *L, int narray, int nhash) {  Table *t = luaM_new(L, Table);  luaC_link(L, obj2gco(t), LUA_TTABLE);  t->metatable = NULL;  t->flags = cast_byte(~0);  /* temporary values (kept only if some malloc fails) */  t->array = NULL;  t->sizearray = 0;  t->lsizenode = 0;  t->node = cast(Node *, dummynode);  setarrayvector(L, t, narray);  setnodevector(L, t, nhash);  return t;}void luaH_free (lua_State *L, Table *t) {  if (t->node != dummynode)    luaM_freearray(L, t->node, sizenode(t), Node);  luaM_freearray(L, t->array, t->sizearray, TValue);  luaM_free(L, t);}static Node *getfreepos (Table *t) {  while (t->lastfree-- > t->node) {    if (ttisnil(gkey(t->lastfree)))      return t->lastfree;  }  return NULL;  /* could not find a free place */}/*** inserts a new key into a hash table; first, check whether key's main ** position is free. If not, check whether colliding node is in its main ** position or not: if it is not, move colliding node to an empty place and ** put new key in its main position; otherwise (colliding node is in its main ** position), new key goes to an empty position. */static TValue *newkey (lua_State *L, Table *t, const TValue *key) {  Node *mp = mainposition(t, key);  if (!ttisnil(gval(mp)) || mp == dummynode) {    Node *othern;    Node *n = getfreepos(t);  /* get a free place */    if (n == NULL) {  /* cannot find a free place? */      rehash(L, t, key);  /* grow table */      return luaH_set(L, t, key);  /* re-insert key into grown table */    }    lua_assert(n != dummynode);    othern = mainposition(t, key2tval(mp));    if (othern != mp) {  /* is colliding node out of its main position? */      /* yes; move colliding node into free position */      while (gnext(othern) != mp) othern = gnext(othern);  /* find previous */      gnext(othern) = n;  /* redo the chain with `n' in place of `mp' */      *n = *mp;  /* copy colliding node into free pos. (mp->next also goes) */      gnext(mp) = NULL;  /* now `mp' is free */      setnilvalue(gval(mp));    }    else {  /* colliding node is in its own main position */      /* new node will go into free position */      gnext(n) = gnext(mp);  /* chain new position */      gnext(mp) = n;      mp = n;    }  }  gkey(mp)->value = key->value; gkey(mp)->tt = key->tt;  luaC_barriert(L, t, key);  lua_assert(ttisnil(gval(mp)));  return gval(mp);}/*** search function for integers*/const TValue *luaH_getnum (Table *t, int key) {  /* (1 <= key && key <= t->sizearray) */  if (cast(unsigned int, key-1) < cast(unsigned int, t->sizearray))    return &t->array[key-1];  else {    lua_Number nk = cast_num(key);    Node *n = hashnum(t, nk);    do {  /* check whether `key' is somewhere in the chain */      if (ttisnumber(gkey(n)) && luai_numeq(nvalue(gkey(n)), nk))        return gval(n);  /* that's it */      else n = gnext(n);    } while (n);    return luaO_nilobject;  }}/*** search function for strings*/const TValue *luaH_getstr (Table *t, TString *key) {  Node *n = hashstr(t, key);  do {  /* check whether `key' is somewhere in the chain */    if (ttisstring(gkey(n)) && rawtsvalue(gkey(n)) == key)      return gval(n);  /* that's it */    else n = gnext(n);  } while (n);  return luaO_nilobject;}/*** main search function*/const TValue *luaH_get (Table *t, const TValue *key) {  switch (ttype(key)) {    case LUA_TNIL: return luaO_nilobject;    case LUA_TSTRING: return luaH_getstr(t, rawtsvalue(key));    case LUA_TNUMBER: {      int k;      lua_Number n = nvalue(key);      lua_number2int(k, n);      if (luai_numeq(cast_num(k), nvalue(key))) /* index is int? */        return luaH_getnum(t, k);  /* use specialized version */      /* else go through */    }    default: {      Node *n = mainposition(t, key);      do {  /* check whether `key' is somewhere in the chain */        if (luaO_rawequalObj(key2tval(n), key))          return gval(n);  /* that's it */        else n = gnext(n);      } while (n);      return luaO_nilobject;    }  }}TValue *luaH_set (lua_State *L, Table *t, const TValue *key) {  const TValue *p = luaH_get(t, key);  t->flags = 0;  if (p != luaO_nilobject)    return cast(TValue *, p);  else {    if (ttisnil(key)) luaG_runerror(L, "table index is nil");    else if (ttisnumber(key) && luai_numisnan(nvalue(key)))      luaG_runerror(L, "table index is NaN");    return newkey(L, t, key);  }}TValue *luaH_setnum (lua_State *L, Table *t, int key) {  const TValue *p = luaH_getnum(t, key);  if (p != luaO_nilobject)    return cast(TValue *, p);  else {    TValue k;    setnvalue(&k, cast_num(key));    return newkey(L, t, &k);  }}TValue *luaH_setstr (lua_State *L, Table *t, TString *key) {  const TValue *p = luaH_getstr(t, key);  if (p != luaO_nilobject)    return cast(TValue *, p);  else {    TValue k;    setsvalue(L, &k, key);    return newkey(L, t, &k);  }}static int unbound_search (Table *t, unsigned int j) {  unsigned int i = j;  /* i is zero or a present index */  j++;  /* find `i' and `j' such that i is present and j is not */  while (!ttisnil(luaH_getnum(t, j))) {    i = j;    j *= 2;    if (j > cast(unsigned int, MAX_INT)) {  /* overflow? */      /* table was built with bad purposes: resort to linear search */      i = 1;      while (!ttisnil(luaH_getnum(t, i))) i++;      return i - 1;    }  }  /* now do a binary search between them */  while (j - i > 1) {    unsigned int m = (i+j)/2;    if (ttisnil(luaH_getnum(t, m))) j = m;    else i = m;  }  return i;}/*** Try to find a boundary in table `t'. A `boundary' is an integer index** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil).*/int luaH_getn (Table *t) {  unsigned int j = t->sizearray;  if (j > 0 && ttisnil(&t->array[j - 1])) {    /* there is a boundary in the array part: (binary) search for it */    unsigned int i = 0;    while (j - i > 1) {      unsigned int m = (i+j)/2;      if (ttisnil(&t->array[m - 1])) j = m;      else i = m;    }    return i;  }  /* else must find a boundary in hash part */  else if (t->node == dummynode)  /* hash part is empty? */    return j;  /* that is easy... */  else return unbound_search(t, j);}#if defined(LUA_DEBUG)Node *luaH_mainposition (const Table *t, const TValue *key) {  return mainposition(t, key);}int luaH_isdummy (Node *n) { return n == dummynode; }#endif