diff options
Diffstat (limited to 'ltable.c')
| -rw-r--r-- | ltable.c | 4 |
1 files changed, 2 insertions, 2 deletions
| @@ -1,5 +1,5 @@ | |||
| 1 | /* | 1 | /* |
| 2 | ** $Id: ltable.c,v 2.125 2017/06/29 15:06:44 roberto Exp roberto $ | 2 | ** $Id: ltable.c,v 2.126 2017/11/08 14:50:23 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 | */ |
| @@ -685,7 +685,7 @@ static lua_Unsigned hash_search (Table *t, lua_Unsigned j) { | |||
| 685 | ** First, try the array part: if there is an array part and its last | 685 | ** First, try the array part: if there is an array part and its last |
| 686 | ** element is nil, there must be a boundary there; a binary search | 686 | ** element is nil, there must be a boundary there; a binary search |
| 687 | ** finds that boundary. Otherwise, if the hash part is empty or does not | 687 | ** finds that boundary. Otherwise, if the hash part is empty or does not |
| 688 | ** contain 'j + 1', 'j' is a boundary. Othersize, call 'hash_search' | 688 | ** contain 'j + 1', 'j' is a boundary. Otherwize, call 'hash_search' |
| 689 | ** to find a boundary in the hash part. | 689 | ** to find a boundary in the hash part. |
| 690 | */ | 690 | */ |
| 691 | lua_Unsigned luaH_getn (Table *t) { | 691 | lua_Unsigned luaH_getn (Table *t) { |