diff options
| author | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2001-08-31 16:46:07 -0300 |
|---|---|---|
| committer | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2001-08-31 16:46:07 -0300 |
| commit | e1d072571ec6f9d830e575a2ecdc95fd43428e53 (patch) | |
| tree | 830fab7f2acb9adaee2d63073d339cc9557a5437 /ltable.c | |
| parent | 7651a5c6b2ee6ec59cadec6199319d482071f176 (diff) | |
| download | lua-e1d072571ec6f9d830e575a2ecdc95fd43428e53.tar.gz lua-e1d072571ec6f9d830e575a2ecdc95fd43428e53.tar.bz2 lua-e1d072571ec6f9d830e575a2ecdc95fd43428e53.zip | |
better syntax for type casts
Diffstat (limited to 'ltable.c')
| -rw-r--r-- | ltable.c | 14 |
1 files changed, 7 insertions, 7 deletions
| @@ -32,9 +32,9 @@ | |||
| 32 | #define TagDefault LUA_TTABLE | 32 | #define TagDefault LUA_TTABLE |
| 33 | 33 | ||
| 34 | 34 | ||
| 35 | #define hashnum(t,n) (node(t, lmod((lu_hash)(ls_hash)(n), t->size))) | 35 | #define hashnum(t,n) (node(t, lmod(cast(lu_hash, cast(ls_hash, n)), t->size))) |
| 36 | #define hashstr(t,str) (node(t, lmod((str)->tsv.hash, t->size))) | 36 | #define hashstr(t,str) (node(t, lmod((str)->tsv.hash, t->size))) |
| 37 | #define hashpointer(t,p) (node(t, lmod(IntPoint(p), t->size))) | 37 | #define hashpointer(t,p) (node(t, lmod(IntPoint(p), t->size))) |
| 38 | 38 | ||
| 39 | 39 | ||
| 40 | /* | 40 | /* |
| @@ -61,8 +61,8 @@ Node *luaH_next (lua_State *L, Hash *t, const TObject *key) { | |||
| 61 | const TObject *v = luaH_get(t, key); | 61 | const TObject *v = luaH_get(t, key); |
| 62 | if (v == &luaO_nilobject) | 62 | if (v == &luaO_nilobject) |
| 63 | luaD_error(L, l_s("invalid key for `next'")); | 63 | luaD_error(L, l_s("invalid key for `next'")); |
| 64 | i = (int)(((const lu_byte *)v - | 64 | i = cast(int, (cast(const lu_byte *, v) - |
| 65 | (const lu_byte *)(val(node(t, 0)))) / sizeof(Node)) + 1; | 65 | cast(const lu_byte *, val(node(t, 0)))) / sizeof(Node)) + 1; |
| 66 | } | 66 | } |
| 67 | for (; i<t->size; i++) { | 67 | for (; i<t->size; i++) { |
| 68 | Node *n = node(t, i); | 68 | Node *n = node(t, i); |
| @@ -259,8 +259,8 @@ const TObject *luaH_get (Hash *t, const TObject *key) { | |||
| 259 | switch (ttype(key)) { | 259 | switch (ttype(key)) { |
| 260 | case LUA_TSTRING: return luaH_getstr(t, tsvalue(key)); | 260 | case LUA_TSTRING: return luaH_getstr(t, tsvalue(key)); |
| 261 | case LUA_TNUMBER: { | 261 | case LUA_TNUMBER: { |
| 262 | int k = (int)nvalue(key); | 262 | int k = cast(int, nvalue(key)); |
| 263 | if ((lua_Number)k == nvalue(key)) /* is an integer index? */ | 263 | if (cast(lua_Number, k) == nvalue(key)) /* is an integer index? */ |
| 264 | return luaH_getnum(t, k); /* use specialized version */ | 264 | return luaH_getnum(t, k); /* use specialized version */ |
| 265 | /* else go through */ | 265 | /* else go through */ |
| 266 | } | 266 | } |
