aboutsummaryrefslogtreecommitdiff
path: root/ltable.c
diff options
context:
space:
mode:
authorRoberto Ierusalimschy <roberto@inf.puc-rio.br>2011-05-31 15:27:56 -0300
committerRoberto Ierusalimschy <roberto@inf.puc-rio.br>2011-05-31 15:27:56 -0300
commit821bd7025ea7ecf399e0b50f920a460b11c649c7 (patch)
tree98cd8aa59a2cc80b6d52b164cebcb2a46b457f4a /ltable.c
parent9b7dddad7d3f4546f838834d9674eaf0f2fca3dd (diff)
downloadlua-821bd7025ea7ecf399e0b50f920a460b11c649c7.tar.gz
lua-821bd7025ea7ecf399e0b50f920a460b11c649c7.tar.bz2
lua-821bd7025ea7ecf399e0b50f920a460b11c649c7.zip
more uniform names for 'equalobj'-related functions
Diffstat (limited to 'ltable.c')
-rw-r--r--ltable.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/ltable.c b/ltable.c
index 60f579a6..410411f1 100644
--- a/ltable.c
+++ b/ltable.c
@@ -1,5 +1,5 @@
1/* 1/*
2** $Id: ltable.c,v 2.55 2011/05/02 16:45:32 roberto Exp roberto $ 2** $Id: ltable.c,v 2.56 2011/05/31 18:24:36 roberto Exp roberto $
3** Lua tables (hash) 3** Lua tables (hash)
4** See Copyright Notice in lua.h 4** See Copyright Notice in lua.h
5*/ 5*/
@@ -149,7 +149,7 @@ static int findindex (lua_State *L, Table *t, StkId key) {
149 Node *n = mainposition(t, key); 149 Node *n = mainposition(t, key);
150 do { /* check whether `key' is somewhere in the chain */ 150 do { /* check whether `key' is somewhere in the chain */
151 /* key may be dead already, but it is ok to use it in `next' */ 151 /* key may be dead already, but it is ok to use it in `next' */
152 if (luaV_rawequalObj(gkey(n), key) || 152 if (luaV_rawequalobj(gkey(n), key) ||
153 (ttisdeadkey(gkey(n)) && iscollectable(key) && 153 (ttisdeadkey(gkey(n)) && iscollectable(key) &&
154 gcvalue(gkey(n)) == gcvalue(key))) { 154 gcvalue(gkey(n)) == gcvalue(key))) {
155 i = cast_int(n - gnode(t, 0)); /* key index in hash table */ 155 i = cast_int(n - gnode(t, 0)); /* key index in hash table */
@@ -482,7 +482,7 @@ const TValue *luaH_get (Table *t, const TValue *key) {
482 default: { 482 default: {
483 Node *n = mainposition(t, key); 483 Node *n = mainposition(t, key);
484 do { /* check whether `key' is somewhere in the chain */ 484 do { /* check whether `key' is somewhere in the chain */
485 if (luaV_rawequalObj(gkey(n), key)) 485 if (luaV_rawequalobj(gkey(n), key))
486 return gval(n); /* that's it */ 486 return gval(n); /* that's it */
487 else n = gnext(n); 487 else n = gnext(n);
488 } while (n); 488 } while (n);