| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | New compatibility helper luaG_rawget | Benoit Germain | 2025-03-06 | 1 | -9/+5 |
| | | |||||
| * | Minor internal code tweaks | Benoit Germain | 2025-02-05 | 1 | -1/+1 |
| | | | | | | | | * mark all eligible classes Final * new TableIndex strong type * buildfixes for HAVE_DEBUGSPEW() * overridden virtual destructors tagged as such | ||||
| * | lanes.collectgarbage() and linda:collectgarbage() | Benoit Germain | 2024-12-10 | 1 | -0/+55 |
| | | |||||
| * | New method linda:restrict() | Benoit Germain | 2024-12-03 | 1 | -12/+133 |
| | | |||||
| * | More [[nodiscard]] boyscouting | Benoit Germain | 2024-11-20 | 1 | -9/+18 |
| | | |||||
| * | Renamed intercopycontext.h → intercopycontext.hpp, state.h → state.hpp | Benoit Germain | 2024-10-28 | 1 | -2/+2 |
| | | |||||
| * | Renamed lane.h → lane.hpp, linda.h → linda.hpp, threading.h → ↵ | Benoit Germain | 2024-10-28 | 1 | -2/+2 |
| | | | | | threading.hpp | ||||
| * | Renamed allocator.h → allocator.hpp, cancel.h → cancel.hpp, keeper.h → ↵ | Benoit Germain | 2024-10-28 | 1 | -1/+1 |
| | | | | | keeper.hpp, tools.h → tools.hpp | ||||
| * | Renamed _pch.h → _pch.hpp, deep.h → deep.hpp, lanes.h → lanes.hpp | Benoit Germain | 2024-10-28 | 1 | -1/+1 |
| | | |||||
| * | Improve Unique some more | Benoit Germain | 2024-10-24 | 1 | -1/+1 |
| | | |||||
| * | Strengthen more code with UserValueIndex | Benoit Germain | 2024-10-24 | 1 | -1/+1 |
| | | |||||
| * | Make Unique even stronger | Benoit Germain | 2024-10-24 | 1 | -8/+8 |
| | | |||||
| * | Fix/suppress MSVC /Wall warnings | Benoit Germain | 2024-10-16 | 1 | -6/+6 |
| | | |||||
| * | Sprinkling StackIndex all over the place | Benoit Germain | 2024-10-08 | 1 | -44/+44 |
| | | |||||
| * | Internal improvements: new strong types StackIndex and KeeperIndex | Benoit Germain | 2024-10-07 | 1 | -1/+1 |
| | | |||||
| * | Build fixes for mingw/g++ | Benoit Germain | 2024-10-01 | 1 | -1/+1 |
| | | |||||
| * | linda:limit() and linda:set() return a second value, a string representing ↵ | Benoit Germain | 2024-06-27 | 1 | -17/+58 |
| | | | | | the fill status | ||||
| * | Change linda:limit() | Benoit Germain | 2024-06-26 | 1 | -21/+32 |
| | | | | | | | * read the current limit of a key if no limit is provided * "unlimited" is to be used to clear the limit * fix linda:set() not ignoring the limit | ||||
| * | linda:dump correctly outputs limit as "unlimited" for unlimited keys | Benoit Germain | 2024-06-24 | 1 | -1/+5 |
| | | |||||
| * | Fix wrong Linda name when not giving any | Benoit Germain | 2024-06-24 | 1 | -0/+10 |
| | | |||||
| * | 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 |
| | | |||||
