Roberto Ierusalimschy
|
d015f1fc02
|
table sizes don't need to be primes; power of 2 gives the same performance.
|
1999-11-26 16:59:20 -02:00 |
|
Roberto Ierusalimschy
|
29ede6aa13
|
first implementation of multiple states (reentrant code).
|
1999-11-22 11:12:07 -02:00 |
|
Roberto Ierusalimschy
|
d915cf4f9d
|
ways to measure number of `blocks' for GC + details
|
1999-11-10 13:39:35 -02:00 |
|
Roberto Ierusalimschy
|
5a48255c9f
|
invariant tests over tables performed externally, through a built-in
function (when DEBUG is ion).
|
1999-10-26 08:53:40 -02:00 |
|
Roberto Ierusalimschy
|
910836fb53
|
warnings from Visual C++
|
1999-10-19 11:33:22 -02:00 |
|
Roberto Ierusalimschy
|
4e9f2d13d5
|
new implementation of hash tables.
|
1999-10-14 17:13:31 -02:00 |
|
Roberto Ierusalimschy
|
4343420d4d
|
simplified version of `gc' tag method (only for userdata now).
|
1999-10-04 15:51:04 -02:00 |
|
Roberto Ierusalimschy
|
cf9a22396c
|
"luaH_set" only needs to check size when key is new
|
1999-09-22 11:38:45 -03:00 |
|
Roberto Ierusalimschy
|
c787dccd9b
|
"const" !!!
|
1999-08-16 17:52:00 -03:00 |
|
Roberto Ierusalimschy
|
cdd0fe9946
|
some C compilers cannot initialize a local struct
|
1999-05-21 16:41:49 -03:00 |
|
Roberto Ierusalimschy
|
f04c83e075
|
new function "lua_next" (+ new implementation for "next")
|
1999-02-23 11:57:28 -03:00 |
|
Roberto Ierusalimschy
|
fd7d0774e5
|
luaH_set does the set and protect its value; luaH_move can then be a
macro.
New algorithm for double hashing (does not use "%").
|
1999-01-25 15:41:19 -02:00 |
|
Roberto Ierusalimschy
|
1b45e967b4
|
table entries with ref=null always have val=null too.
|
1999-01-25 10:30:11 -02:00 |
|
Roberto Ierusalimschy
|
933bead92e
|
small optimizations(?)
|
1999-01-22 16:47:23 -02:00 |
|
Roberto Ierusalimschy
|
b9c9ccfbb4
|
function "move" for tables is better implemented with some "inside
information".
|
1999-01-04 10:54:33 -02:00 |
|
Roberto Ierusalimschy
|
9a45543841
|
tables are better manipulated via "Hash *" instead of "TObject" or
"lua_Object".
|
1998-12-30 11:14:46 -02:00 |
|
Roberto Ierusalimschy
|
8e226e6a09
|
small bug: nuse may change when table is rehashed;
3/2 is a good fraction for hash limit (instead of 0.7, using floats)
|
1998-08-11 13:38:34 -03:00 |
|
Roberto Ierusalimschy
|
5378331f2d
|
hash tables may shrink if use rate is too small.
|
1998-08-10 18:36:32 -03:00 |
|
Roberto Ierusalimschy
|
41d9ea948c
|
auxiliar functions "luaH_setint" & "luaH_getint".
|
1998-07-12 13:15:19 -03:00 |
|
Roberto Ierusalimschy
|
6cdf0d8768
|
tables can become full of "emptys" slots, and keep growing without limits.
|
1998-01-28 14:50:33 -02:00 |
|
Roberto Ierusalimschy
|
5981161360
|
small optimizations (?)
|
1998-01-13 16:06:27 -02:00 |
|
Roberto Ierusalimschy
|
0e1058cfdd
|
small optimizations in switch order
|
1998-01-09 12:44:55 -02:00 |
|
Roberto Ierusalimschy
|
45e533599f
|
optimization: closures without upvalues don't need to be closures
|
1997-12-15 14:17:20 -02:00 |
|
Roberto Ierusalimschy
|
80b3d28f4a
|
details (mainly error messages)
|
1997-12-09 11:50:08 -02:00 |
|
Roberto Ierusalimschy
|
accd7bc253
|
small modifications (format, small optimizations, etc)
|
1997-11-21 17:00:46 -02:00 |
|
Roberto Ierusalimschy
|
592a3f289b
|
first implementation of centralized global state.
|
1997-11-19 15:29:23 -02:00 |
|
Roberto Ierusalimschy
|
e78cf96c97
|
first version of Cclosures.
|
1997-10-24 15:17:24 -02:00 |
|
Roberto Ierusalimschy
|
907368ead5
|
GC now considers an "estimate" of object size, instead of just the number
of objects.
|
1997-10-23 14:26:37 -02:00 |
|
Roberto Ierusalimschy
|
2c89651fc6
|
macro "val" should live together with macro "ref".
|
1997-10-18 14:29:15 -02:00 |
|
Roberto Ierusalimschy
|
eb617df2d8
|
better way to traverse GCnode lists.
|
1997-09-26 13:46:20 -03:00 |
|
Roberto Ierusalimschy
|
a404f6e0e6
|
Lua tables (hash)
|
1997-09-16 16:25:59 -03:00 |
|