 Roberto Ierusalimschy
|
8060193702
`lauxlib' is now part of the libraries (not used by core Lua)
|
25 år sedan |
|
Roberto Ierusalimschy
|
100bfec39a
new implementation for `next'
|
25 år sedan |
|
Roberto Ierusalimschy
|
e238efc536
default now is multi-state
|
25 år sedan |
|
Roberto Ierusalimschy
|
d9e61e8cea
new algorithm for traversing in GC to avoid deep recursion calls
|
25 år sedan |
|
Roberto Ierusalimschy
|
435f587ed0
(much) better handling of memory alloction errors
|
25 år sedan |
|
Roberto Ierusalimschy
|
cfba572076
remove dummy argument in LUA_ASSERT
|
25 år sedan |
|
Roberto Ierusalimschy
|
5362426ffa
error message
|
25 år sedan |
|
Roberto Ierusalimschy
|
1de5587184
`lua.h' is included before any other Lua header file
|
25 år sedan |
|
Roberto Ierusalimschy
|
8ca9534d04
access to `values' in TObject always through macros
|
25 år sedan |
|
Roberto Ierusalimschy
|
8bcf622876
new signature for `luaH_set'
|
25 år sedan |
|
Roberto Ierusalimschy
|
292c953018
new auxiliar function `luaH_setstr'
|
25 år sedan |
|
Roberto Ierusalimschy
|
c542aac0b9
collect dead indices in tables
|
25 år sedan |
|
Roberto Ierusalimschy
|
ef62b340e0
code cleaner for 16 bits.
|
25 år sedan |
|
Roberto Ierusalimschy
|
b803c0600e
details
|
25 år sedan |
|
Roberto Ierusalimschy
|
11a7022067
global variables are stored in a Lua table
|
25 år sedan |
|
Roberto Ierusalimschy
|
534c3a64d3
small optimizations for table access
|
25 år sedan |
|
Roberto Ierusalimschy
|
36e1390631
details.
|
25 år sedan |
|
Roberto Ierusalimschy
|
a69356e9e0
no more special cases for closures with 0 upvalues (performance is the same,
|
25 år sedan |
|
Roberto Ierusalimschy
|
b53dc0c485
TAG_ARRAY -> TAG_TABLE
|
25 år sedan |
|
Roberto Ierusalimschy
|
73aa465a8e
some name changes
|
25 år sedan |
|
Roberto Ierusalimschy
|
3c9d999424
many details (most by lhf).
|
25 år sedan |
|
Roberto Ierusalimschy
|
74f1c3d025
small changes for "clean C"
|
25 år sedan |
|
Roberto Ierusalimschy
|
b1b0c219f5
new ttypes to distinguish between C closures and Lua closures.
|
25 år sedan |
|
Roberto Ierusalimschy
|
b3fe203c36
keep it simple
|
26 år sedan |
|
Roberto Ierusalimschy
|
d015f1fc02
table sizes don't need to be primes; power of 2 gives the same performance.
|
26 år sedan |
|
Roberto Ierusalimschy
|
29ede6aa13
first implementation of multiple states (reentrant code).
|
26 år sedan |
|
Roberto Ierusalimschy
|
d915cf4f9d
ways to measure number of `blocks' for GC + details
|
26 år sedan |
|
Roberto Ierusalimschy
|
5a48255c9f
invariant tests over tables performed externally, through a built-in
|
26 år sedan |
|
Roberto Ierusalimschy
|
910836fb53
warnings from Visual C++
|
26 år sedan |
|
Roberto Ierusalimschy
|
4e9f2d13d5
new implementation of hash tables.
|
26 år sedan |
