代调的往上爬......

细谈一下lua里很多人有疑问的table长度问题。1. > tbl = {1,2,3} > print(#tbl) 3 > 2. > tbl = {1,nil,3} > print(#tbl) 3 > 3. > tbl = {1,nil,3,nil} > print(#tbl) 1 > 情况1正常，情况2有点不正常，情况3很不正常，好

先看rehash实现:static void rehash (lua_State *L, Table *t, const TValue *ek) { int nasize, na; int nums[MAXBITS+1]; /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */ int i; int totaluse;

先看table.insert调用的C函数:static int tinsert (lua_State *L) { int e = aux_getn(L, 1) + 1; /* first empty element */ int pos; /* where to insert new element */ switch (lua_gettop(L)) { case 2: