| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Improved on_state_create implementation | Benoit Germain | 2024-06-19 | 1 | -1/+1 |
| | | | | | | * modernized implementation uses a std::variant * detect Lua functions with upvalues earlier | ||||
| * | When it is a function, config.allocator is called with a string hint | Benoit Germain | 2024-06-18 | 1 | -1/+1 |
| | | |||||
| * | Wording fix: parameter → argument | Benoit Germain | 2024-06-14 | 1 | -2/+2 |
| | | |||||
| * | lua_pushliteral -> luaG_pushstring | Benoit Germain | 2024-06-14 | 1 | -1/+1 |
| | | |||||
| * | More char* -> std::string_view conversions | Benoit Germain | 2024-06-14 | 1 | -69/+73 |
| | | |||||
| * | linda :get(), :set(), :limit() return value changes | Benoit Germain | 2024-06-12 | 1 | -20/+27 |
| | | |||||
| * | More application of the coding rules | Benoit Germain | 2024-06-11 | 1 | -5/+9 |
| | | |||||
| * | Remove what looks like to have been a bug workaround for MSVC ↵ | Benoit Germain | 2024-06-11 | 1 | -2/+1 |
| | | | | | std::unique_ptr<T[]> with custom deleter | ||||
| * | Boyscouting some luaG_ functions | Benoit Germain | 2024-06-07 | 1 | -3/+3 |
| | | |||||
| * | Use a precompiled header to speed up the build | Benoit Germain | 2024-06-07 | 1 | -4/+1 |
| | | |||||
| * | Code boyscouting | Benoit Germain | 2024-06-07 | 1 | -4/+4 |
| | | |||||
| * | Converted a few more raw string pointers to std::string_view | Benoit Germain | 2024-06-06 | 1 | -1/+1 |
| | | |||||
| * | Fix Lua stack overflow in KeyUD:peek() | Benoit Germain | 2024-06-06 | 1 | -1/+3 |
| | | |||||
| * | Refactored keeper implementation of linda:send() | Benoit Germain | 2024-06-04 | 1 | -44/+50 |
| | | |||||
| * | Refactored keeper implementation of linda:receive() | Benoit Germain | 2024-06-04 | 1 | -48/+46 |
| | | |||||
| * | Refactored keeper implementation of linda:limit() | Benoit Germain | 2024-06-04 | 1 | -23/+31 |
| | | |||||
| * | Moved keeper functions around | Benoit Germain | 2024-06-04 | 1 | -147/+148 |
| | | |||||
| * | Refactored keeper implementation of linda:get() | Benoit Germain | 2024-06-04 | 1 | -17/+23 |
| | | |||||
| * | Keeper code internal improvements | Benoit Germain | 2024-06-04 | 1 | -25/+25 |
| | | |||||
| * | Keeper code internal improvements | Benoit Germain | 2024-06-04 | 1 | -33/+42 |
| | | |||||
| * | Clarified keeper.cpp stack tracking comments | Benoit Germain | 2024-06-03 | 1 | -265/+294 |
| | | |||||
| * | Start modernizing Keeper implementation | Benoit Germain | 2024-05-31 | 1 | -208/+202 |
| | | |||||
| * | Keeper management modernisation and improvements | Benoit Germain | 2024-05-30 | 1 | -15/+221 |
| | | | | | | | | * use a std::variant to manage the distinction between one or more keeper states. Use std::unique_ptr<Keeper[]> to manage the multiple keeper case. * setting "nb_keepers" renamed "nb_user_keepers", to indicate these are in addition to internal keeper #0 used for timers. * stricter lanes.linda() argument checking. group is imposed if more than one keeper is used. * more tests | ||||
| * | Sprinkle a bit of std::ranges::iota_view | Benoit Germain | 2024-05-28 | 1 | -10/+11 |
| | | |||||
| * | Fix __lanesignore | Benoit Germain | 2024-05-22 | 1 | -20/+0 |
| | | |||||
| * | linda:limit uses nil instead of -1 to unblock | Benoit Germain | 2024-05-20 | 1 | -5/+5 |
| | | |||||
| * | Minor code tweaks | Benoit Germain | 2024-05-17 | 1 | -1/+1 |
| | | |||||
| * | Shuffling code around | Benoit Germain | 2024-05-14 | 1 | -140/+7 |
| | | |||||
| * | Progressively applying the coding rules | Benoit Germain | 2024-05-13 | 1 | -5/+5 |
| | | |||||
| * | Progressively applying the coding rules | Benoit Germain | 2024-05-13 | 1 | -164/+164 |
| | | |||||
| * | Move InterCopyContext implementation in a separate file | Benoit Germain | 2024-05-13 | 1 | -4/+1 |
| | | |||||
| * | Some code factorization | Benoit Germain | 2024-05-03 | 1 | -1/+1 |
| | | |||||
| * | Remove dependency on _G["package"] | Benoit Germain | 2024-05-02 | 1 | -4/+3 |
| | | |||||
| * | Progressively applying the coding rules | Benoit Germain | 2024-05-02 | 1 | -7/+7 |
| | | |||||
| * | Progressively applying the coding rules | Benoit Germain | 2024-04-30 | 1 | -366/+289 |
| | | |||||
| * | Progressively applying the coding rules | Benoit Germain | 2024-04-29 | 1 | -29/+29 |
| | | |||||
| * | Function parameters L → L_ | Benoit Germain | 2024-04-29 | 1 | -236/+236 |
| | | |||||
| * | C++ migration: wrap all Lua error raising API functions in a [[noreturn]] ↵ | Benoit Germain | 2024-04-26 | 1 | -5/+5 |
| | | | | | raise_... equivalent | ||||
| * | Formalize a few coding style rules, start to enforce them for constants | Benoit Germain | 2024-04-26 | 1 | -36/+36 |
| | | |||||
| * | C++ integration: cleanup in Linda/Keeper interaction | Benoit Germain | 2024-04-25 | 1 | -34/+13 |
| | | |||||
| * | C++ migration: using KeeperState = Unique<lua_State*> | Benoit Germain | 2024-04-24 | 1 | -14/+14 |
| | | |||||
| * | ASSERT_L → LUA_ASSERT | Benoit Germain | 2024-04-24 | 1 | -5/+5 |
| | | |||||
| * | C++ migration: split UniqueKey into UniqueKey+RegistryUniqueKey | Benoit Germain | 2024-04-24 | 1 | -1/+1 |
| | | |||||
| * | some dead code elimination and other trifles | Benoit Germain | 2024-04-16 | 1 | -30/+30 |
| | | |||||
| * | C++ migration: more conversion to InterCopyContext. debugspew indentation is ↵ | Benoit Germain | 2024-04-16 | 1 | -26/+33 |
| | | | | | managed by a scope object | ||||
| * | C++ migration: all linda operations go through a different lua_CFunction so ↵ | Benoit Germain | 2024-04-15 | 1 | -1/+1 |
| | | | | | as not to defeat function lookup | ||||
| * | C++ migration: deep userdata API rework. bye bye idfunc, hello DeepFactory | Benoit Germain | 2024-04-15 | 1 | -0/+2 |
| | | |||||
| * | C++ migration: keeper_call returns a std::optional | Benoit Germain | 2024-04-15 | 1 | -14/+14 |
| | | |||||
| * | C++ migration: luaG_inter_copy_* now return an enum class instead of an ↵ | Benoit Germain | 2024-04-10 | 1 | -6/+6 |
| | | | | | anonymous int | ||||
| * | C++ migration: fixed a few std::ignore | Benoit Germain | 2024-04-10 | 1 | -3/+3 |
| | | |||||
