Function findindex

src/Chain/libraries/glua/ltable.cpp:168–192

** TODO�� ��key����Ȼ���ٱ��� ** returns the index of a 'key' for table traversals. First goes all ** elements in the array part, then elements in the hash part. The ** beginning of a traversal is signaled by 0. */

** beginning of a traversal is signaled by 0.
*/
static unsigned int findindex(lua_State *L, Table *t, StkId key) {
    unsigned int i;
    if (ttisnil(key)) return 0;  /* first iteration */
    i = arrayindex(key);
    if (i != 0 && i <= t->sizearray)  /* is 'key' inside array part? */
        return i;  /* yes; that's the index */
    else {
        int nx;
        Node *n = mainposition(t, key);
        for (;;) {  /* check whether 'key' is somewhere in the chain */
            /* key may be dead already, but it is ok to use it in 'next' */
            if (luaV_rawequalobj(gkey(n), key) ||
                (ttisdeadkey(gkey(n)) && iscollectable(key) &&
                deadvalue(gkey(n)) == gcvalue(key))) {
                i = cast_int(n - gnode(t, 0));  /* key index in hash table */
                /* hash elements are numbered after array ones */
                return (i + 1) + t->sizearray;
            }
            nx = gnext(n);
            if (nx == 0)
                luaG_runerror(L, "invalid key to 'next'");  /* key not found */
            else n += nx;
        }
    }
}

static std::string lua_value_to_str(const TValue *key)
{