lua

commit c9ce754e38712afc1de6325cfa1291324dbdda61
parent d34271fe42580c6d93462b4460cb900f604142c9
Author: Roberto Ierusalimschy <roberto@inf.puc-rio.br>
Date:   Mon,  2 May 2011 14:32:37 -0300

comment

Diffstat:
M
lparser.c
 | 
4
++--
M
ltable.c
 | 
4
++--

2 files changed, 4 insertions(+), 4 deletions(-)
diff --git a/lparser.c b/lparser.c
@@ -1,5 +1,5 @@
 /*
-** $Id: lparser.c,v 2.107 2011/02/23 13:13:10 roberto Exp roberto $
+** $Id: lparser.c,v 2.108 2011/04/18 19:48:24 roberto Exp roberto $
 ** Lua Parser
 ** See Copyright Notice in lua.h
 */
@@ -455,7 +455,7 @@ static void breaklabel (LexState *ls) {
 
 /*
 ** generates an error for an undefined 'goto'; choose appropriate
-** message when label name is a resserved word (which can only be 'break')
+** message when label name is a reserved word (which can only be 'break')
 */
 static void undefgoto (LexState *ls, Labeldesc *gt) {
   const char *msg = (gt->name->tsv.reserved > 0)
diff --git a/ltable.c b/ltable.c
@@ -1,5 +1,5 @@
 /*
-** $Id: ltable.c,v 2.53 2010/11/11 15:38:43 roberto Exp roberto $
+** $Id: ltable.c,v 2.54 2011/04/05 18:32:28 roberto Exp roberto $
 ** Lua tables (hash)
 ** See Copyright Notice in lua.h
 */
@@ -336,7 +336,7 @@ void luaH_resizearray (lua_State *L, Table *t, int nasize) {
 
 static void rehash (lua_State *L, Table *t, const TValue *ek) {
   int nasize, na;
-  int nums[MAXBITS+1];  /* nums[i] = number of keys between 2^(i-1) and 2^i */
+  int nums[MAXBITS+1];  /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */
   int i;
   int totaluse;
   for (i=0; i<=MAXBITS; i++) nums[i] = 0;  /* reset counts */