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

(tables can be 100% full)

1 files changed, 3 insertions, 1 deletions

diff --git a/ltable.h b/ltable.h
index 3927f088..d8ba8c8a 100644
--- a/ltable.h
+++ b/ltable.h
@@ -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);