MCPcopy Create free account
hub / github.com/CppCXY/EmmyLuaCodeStyle / luaH_next

Function luaH_next

3rd/lua-5.4.3/src/ltable.c:338–357  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

336
337
338int luaH_next (lua_State *L, Table *t, StkId key) {
339 unsigned int asize = luaH_realasize(t);
340 unsigned int i = findindex(L, t, s2v(key), asize); /* find original key */
341 for (; i < asize; i++) { /* try first array part */
342 if (!isempty(&t->array[i])) { /* a non-empty entry? */
343 setivalue(s2v(key), i + 1);
344 setobj2s(L, key + 1, &t->array[i]);
345 return 1;
346 }
347 }
348 for (i -= asize; cast_int(i) < sizenode(t); i++) { /* hash part */
349 if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */
350 Node *n = gnode(t, i);
351 getnodekey(L, s2v(key), n);
352 setobj2s(L, key + 1, gval(n));
353 return 1;
354 }
355 }
356 return 0; /* no more elements */
357}
358
359
360static void freehash (lua_State *L, Table *t) {

Callers 1

lua_nextFunction · 0.85

Calls 2

luaH_realasizeFunction · 0.85
findindexFunction · 0.85

Tested by

no test coverage detected