 Roberto Ierusalimschy
|
654b16e83a
better performance for table operations (mainly for integer indices)
|
24 лет назад |
|
Roberto Ierusalimschy
|
37f3a1c045
too much optimization to "break" keys in tables; keep them as TObjects...
|
24 лет назад |
|
Roberto Ierusalimschy
|
1f9e3731d1
back to the basics (well-behaved variant record...)
|
24 лет назад |
|
Roberto Ierusalimschy
|
6b71a9cfe5
smaller tables for machines with 8-bit alignment
|
24 лет назад |
|
Roberto Ierusalimschy
|
caf01b5bfa
better implementation for list "for"
|
24 лет назад |
|
Roberto Ierusalimschy
|
ac390020e9
optimizations based on all types but number and nil are pointers
|
24 лет назад |
|
Roberto Ierusalimschy
|
7959f3aebb
easier way to erase 'dead' keys
|
24 лет назад |
|
Roberto Ierusalimschy
|
dabb19fc17
specialized versions for luaH_set (numbers and strings)
|
25 лет назад |
|
Roberto Ierusalimschy
|
4894c27962
lua_Number defined in lua.h (1st version)
|
25 лет назад |
|
Roberto Ierusalimschy
|
96253ed8ce
better support for 64-bit machines (avoid excessive use of longs)
|
25 лет назад |
|
Roberto Ierusalimschy
|
100bfec39a
new implementation for `next'
|
25 лет назад |
|
Roberto Ierusalimschy
|
8bcf622876
new signature for `luaH_set'
|
25 лет назад |
|
Roberto Ierusalimschy
|
292c953018
new auxiliar function `luaH_setstr'
|
25 лет назад |
|
Roberto Ierusalimschy
|
c542aac0b9
collect dead indices in tables
|
25 лет назад |
|
Roberto Ierusalimschy
|
11a7022067
global variables are stored in a Lua table
|
25 лет назад |
|
Roberto Ierusalimschy
|
534c3a64d3
small optimizations for table access
|
25 лет назад |
|
Roberto Ierusalimschy
|
544eeb1f9c
details
|
26 лет назад |
|
Roberto Ierusalimschy
|
e5743adb21
macros `key', `val', and `node' don't need the state
|
26 лет назад |
|
Roberto Ierusalimschy
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 лет назад |
|
Roberto Ierusalimschy
|
5a48255c9f
invariant tests over tables performed externally, through a built-in
|
26 лет назад |
|
Roberto Ierusalimschy
|
4e9f2d13d5
new implementation of hash tables.
|
26 лет назад |
|
Roberto Ierusalimschy
|
4343420d4d
simplified version of `gc' tag method (only for userdata now).
|
26 лет назад |
|
Roberto Ierusalimschy
|
c787dccd9b
"const" !!!
|
26 лет назад |
|
Roberto Ierusalimschy
|
f04c83e075
new function "lua_next" (+ new implementation for "next")
|
26 лет назад |
|
Roberto Ierusalimschy
|
57ffc3f009
luaH_set does the set, and protects its value, so luaH_move can be a
|
27 лет назад |
|
Roberto Ierusalimschy
|
1b45e967b4
table entries with ref=null always have val=null too.
|
27 лет назад |
|
Roberto Ierusalimschy
|
b9c9ccfbb4
function "move" for tables is better implemented with some "inside
|
27 лет назад |
|
Roberto Ierusalimschy
|
9a45543841
tables are better manipulated via "Hash *" instead of "TObject" or
|
27 лет назад |
|
Roberto Ierusalimschy
|
41d9ea948c
auxiliar functions "luaH_setint" & "luaH_getint".
|
27 лет назад |
|
Roberto Ierusalimschy
|
9ae0c082a3
small details by lint.
|
28 лет назад |
