change in hash algorithm so that it does not need empty slot

(tables can be 100% full)
This commit is contained in:
Roberto Ierusalimschy
2005-01-05 16:20:51 -02:00
parent 65726f3e2e
commit e2498e079e
9 changed files with 125 additions and 108 deletions

View File

@@ -1,5 +1,5 @@
/*
** $Id: ltable.h,v 2.3 2004/10/06 18:34:16 roberto Exp roberto $
** $Id: ltable.h,v 2.4 2005/01/04 15:55:12 roberto Exp roberto $
** Lua tables (hash)
** See Copyright Notice in lua.h
*/
@@ -18,6 +18,8 @@
#define key2tval(n) (cast(const TValue *, gkey(n)))
extern const Node luaH_dummynode;
const TValue *luaH_getnum (Table *t, int key);
TValue *luaH_setnum (lua_State *L, Table *t, int key);
const TValue *luaH_getstr (Table *t, TString *key);