mirrors/lua
1
0
Fork 0
mirror of https://github.com/lua/lua synced 2025-01-21 08:32:03 +03:00
Code Issues Packages Projects Releases Wiki Activity

comment

Browse Source
This commit is contained in:
Roberto Ierusalimschy 2011-05-02 14:33:01 -03:00
parent d34271fe42
commit c9ce754e38
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
lparser.c
View File

@ -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)

4
ltable.c
View File

@ -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 */