 Roberto Ierusalimschy
|
36e1390631
details.
|
25 years ago |
|
Roberto Ierusalimschy
|
a69356e9e0
no more special cases for closures with 0 upvalues (performance is the same,
|
25 years ago |
|
Roberto Ierusalimschy
|
b53dc0c485
TAG_ARRAY -> TAG_TABLE
|
25 years ago |
|
Roberto Ierusalimschy
|
73aa465a8e
some name changes
|
25 years ago |
|
Roberto Ierusalimschy
|
3c9d999424
many details (most by lhf).
|
25 years ago |
|
Roberto Ierusalimschy
|
74f1c3d025
small changes for "clean C"
|
25 years ago |
|
Roberto Ierusalimschy
|
b1b0c219f5
new ttypes to distinguish between C closures and Lua closures.
|
25 years ago |
|
Roberto Ierusalimschy
|
b3fe203c36
keep it simple
|
26 years ago |
|
Roberto Ierusalimschy
|
d015f1fc02
table sizes don't need to be primes; power of 2 gives the same performance.
|
26 years ago |
|
Roberto Ierusalimschy
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 years ago |
|
Roberto Ierusalimschy
|
d915cf4f9d
ways to measure number of `blocks' for GC + details
|
26 years ago |
|
Roberto Ierusalimschy
|
5a48255c9f
invariant tests over tables performed externally, through a built-in
|
26 years ago |
|
Roberto Ierusalimschy
|
910836fb53
warnings from Visual C++
|
26 years ago |
|
Roberto Ierusalimschy
|
4e9f2d13d5
new implementation of hash tables.
|
26 years ago |
|
Roberto Ierusalimschy
|
4343420d4d
simplified version of `gc' tag method (only for userdata now).
|
26 years ago |
|
Roberto Ierusalimschy
|
cf9a22396c
"luaH_set" only needs to check size when key is new
|
26 years ago |
|
Roberto Ierusalimschy
|
c787dccd9b
"const" !!!
|
26 years ago |
|
Roberto Ierusalimschy
|
cdd0fe9946
some C compilers cannot initialize a local struct
|
26 years ago |
|
Roberto Ierusalimschy
|
f04c83e075
new function "lua_next" (+ new implementation for "next")
|
26 years ago |
|
Roberto Ierusalimschy
|
fd7d0774e5
luaH_set does the set and protect its value; luaH_move can then be a
|
26 years ago |
|
Roberto Ierusalimschy
|
1b45e967b4
table entries with ref=null always have val=null too.
|
26 years ago |
|
Roberto Ierusalimschy
|
933bead92e
small optimizations(?)
|
26 years ago |
|
Roberto Ierusalimschy
|
b9c9ccfbb4
function "move" for tables is better implemented with some "inside
|
26 years ago |
|
Roberto Ierusalimschy
|
9a45543841
tables are better manipulated via "Hash *" instead of "TObject" or
|
26 years ago |
|
Roberto Ierusalimschy
|
8e226e6a09
small bug: nuse may change when table is rehashed;
|
27 years ago |
|
Roberto Ierusalimschy
|
5378331f2d
hash tables may shrink if use rate is too small.
|
27 years ago |
|
Roberto Ierusalimschy
|
41d9ea948c
auxiliar functions "luaH_setint" & "luaH_getint".
|
27 years ago |
|
Roberto Ierusalimschy
|
6cdf0d8768
tables can become full of "emptys" slots, and keep growing without limits.
|
27 years ago |
|
Roberto Ierusalimschy
|
5981161360
small optimizations (?)
|
27 years ago |
|
Roberto Ierusalimschy
|
0e1058cfdd
small optimizations in switch order
|
27 years ago |
