| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | `lauxlib' is now part of the libraries (not used by core Lua) | Roberto Ierusalimschy | 2000-09-11 | 1 | -2/+1 |
| | | |||||
| * | new implementation for `next' | Roberto Ierusalimschy | 2000-08-31 | 1 | -5/+19 |
| | | |||||
| * | default now is multi-state | Roberto Ierusalimschy | 2000-08-09 | 1 | -3/+1 |
| | | |||||
| * | new algorithm for traversing in GC to avoid deep recursion calls | Roberto Ierusalimschy | 2000-08-07 | 1 | -5/+7 |
| | | |||||
| * | (much) better handling of memory alloction errors | Roberto Ierusalimschy | 2000-08-04 | 1 | -4/+6 |
| | | |||||
| * | remove dummy argument in LUA_ASSERT | Roberto Ierusalimschy | 2000-06-30 | 1 | -4/+4 |
| | | |||||
| * | error message | Roberto Ierusalimschy | 2000-06-28 | 1 | -3/+3 |
| | | |||||
| * | `lua.h' is included before any other Lua header file | Roberto Ierusalimschy | 2000-06-12 | 1 | -2/+3 |
| | | |||||
| * | access to `values' in TObject always through macros | Roberto Ierusalimschy | 2000-06-08 | 1 | -2/+2 |
| | | |||||
| * | new signature for `luaH_set' | Roberto Ierusalimschy | 2000-06-06 | 1 | -28/+23 |
| | | |||||
| * | new auxiliar function `luaH_setstr' | Roberto Ierusalimschy | 2000-06-05 | 1 | -1/+9 |
| | | |||||
| * | collect dead indices in tables | Roberto Ierusalimschy | 2000-06-05 | 1 | -1/+23 |
| | | |||||
| * | code cleaner for 16 bits. | Roberto Ierusalimschy | 2000-05-24 | 1 | -6/+17 |
| | | |||||
| * | details | Roberto Ierusalimschy | 2000-05-11 | 1 | -13/+6 |
| | | |||||
| * | global variables are stored in a Lua table | Roberto Ierusalimschy | 2000-05-08 | 1 | -7/+15 |
| | | |||||
| * | small optimizations for table access | Roberto Ierusalimschy | 2000-04-25 | 1 | -11/+37 |
| | | |||||
| * | details. | Roberto Ierusalimschy | 2000-03-31 | 1 | -2/+2 |
| | | |||||
| * | no more special cases for closures with 0 upvalues (performance is the same, | Roberto Ierusalimschy | 2000-03-29 | 1 | -7/+1 |
| | | | | | memory use a little higher, code much simpler). | ||||
| * | TAG_ARRAY -> TAG_TABLE | Roberto Ierusalimschy | 2000-03-27 | 1 | -3/+3 |
| | | |||||
| * | some name changes | Roberto Ierusalimschy | 2000-03-10 | 1 | -15/+15 |
| | | |||||
| * | many details (most by lhf). | Roberto Ierusalimschy | 2000-03-03 | 1 | -2/+2 |
| | | |||||
| * | small changes for "clean C" | Roberto Ierusalimschy | 2000-02-08 | 1 | -2/+2 |
| | | |||||
| * | new ttypes to distinguish between C closures and Lua closures. | Roberto Ierusalimschy | 1999-12-23 | 1 | -3/+3 |
| | | |||||
| * | keep it simple | Roberto Ierusalimschy | 1999-12-07 | 1 | -44/+14 |
| | | |||||
| * | table sizes don't need to be primes; power of 2 gives the same performance. | Roberto Ierusalimschy | 1999-11-26 | 1 | -6/+8 |
| | | |||||
| * | first implementation of multiple states (reentrant code). | Roberto Ierusalimschy | 1999-11-22 | 1 | -39/+41 |
| | | |||||
| * | ways to measure number of `blocks' for GC + details | Roberto Ierusalimschy | 1999-11-10 | 1 | -6/+6 |
| | | |||||
| * | invariant tests over tables performed externally, through a built-in | Roberto Ierusalimschy | 1999-10-26 | 1 | -41/+4 |
| | | | | | function (when DEBUG is ion). | ||||
| * | warnings from Visual C++ | Roberto Ierusalimschy | 1999-10-19 | 1 | -2/+2 |
| | | |||||
| * | new implementation of hash tables. | Roberto Ierusalimschy | 1999-10-14 | 1 | -73/+198 |
| | | |||||
| * | simplified version of `gc' tag method (only for userdata now). | Roberto Ierusalimschy | 1999-10-04 | 1 | -14/+11 |
| | | |||||
| * | "luaH_set" only needs to check size when key is new | Roberto Ierusalimschy | 1999-09-22 | 1 | -24/+18 |
| | | |||||
| * | "const" !!! | Roberto Ierusalimschy | 1999-08-16 | 1 | -7/+7 |
| | | |||||
| * | some C compilers cannot initialize a local struct | Roberto Ierusalimschy | 1999-05-21 | 1 | -2/+3 |
| | | |||||
| * | new function "lua_next" (+ new implementation for "next") | Roberto Ierusalimschy | 1999-02-23 | 1 | -23/+5 |
| | | |||||
| * | luaH_set does the set and protect its value; luaH_move can then be a | Roberto Ierusalimschy | 1999-01-25 | 1 | -31/+16 |
| | | | | | | macro. New algorithm for double hashing (does not use "%"). | ||||
| * | table entries with ref=null always have val=null too. | Roberto Ierusalimschy | 1999-01-25 | 1 | -28/+15 |
| | | |||||
| * | small optimizations(?) | Roberto Ierusalimschy | 1999-01-22 | 1 | -49/+36 |
| | | |||||
| * | function "move" for tables is better implemented with some "inside | Roberto Ierusalimschy | 1999-01-04 | 1 | -1/+11 |
| | | | | | information". | ||||
| * | tables are better manipulated via "Hash *" instead of "TObject" or | Roberto Ierusalimschy | 1998-12-30 | 1 | -6/+3 |
| | | | | | "lua_Object". | ||||
| * | small bug: nuse may change when table is rehashed; | Roberto Ierusalimschy | 1998-08-11 | 1 | -11/+10 |
| | | | | | 3/2 is a good fraction for hash limit (instead of 0.7, using floats) | ||||
| * | hash tables may shrink if use rate is too small. | Roberto Ierusalimschy | 1998-08-10 | 1 | -7/+3 |
| | | |||||
| * | auxiliar functions "luaH_setint" & "luaH_getint". | Roberto Ierusalimschy | 1998-07-12 | 1 | -2/+19 |
| | | |||||
| * | tables can become full of "emptys" slots, and keep growing without limits. | Roberto Ierusalimschy | 1998-01-28 | 1 | -17/+17 |
| | | |||||
| * | small optimizations (?) | Roberto Ierusalimschy | 1998-01-13 | 1 | -2/+3 |
| | | |||||
| * | small optimizations in switch order | Roberto Ierusalimschy | 1998-01-09 | 1 | -5/+5 |
| | | |||||
| * | optimization: closures without upvalues don't need to be closures | Roberto Ierusalimschy | 1997-12-15 | 1 | -2/+8 |
| | | |||||
| * | details (mainly error messages) | Roberto Ierusalimschy | 1997-12-09 | 1 | -2/+2 |
| | | |||||
| * | small modifications (format, small optimizations, etc) | Roberto Ierusalimschy | 1997-11-21 | 1 | -2/+2 |
| | | |||||
| * | first implementation of centralized global state. | Roberto Ierusalimschy | 1997-11-19 | 1 | -8/+6 |
| | | |||||
 |
index : lua | |
| A mirror of https://github.com/lua/lua |
| summaryrefslogtreecommitdiff |