Agena

5.1.2 Incline II, July 12, 2025 - The `lookup` package now allows for subsets instead of subtables as lookup table entries, significantly speeding up search for and deletion of values. Just pass the string 'set' as the optional third argument to `lookup.new`: > a := lookup.new(0, 0, 'set'); > lookup.include(a, 'abc', 1, 1, 2, 2, 3); > a.abc: {1, 2, 3} All `lookup` functions and metamethods can be called as usual, so the user does not need to care about the internal setup of this data structure. - With subtables, `lookup.purge` has become 235 percent faster. - `lookup.subs` has become thrice as fast and consumes only half the memory now. - Likewise, `lookup.map` has also been rewritten, has become 5 percent faster and also consumes only half the memory now. - `lookup.getsizes`, `lookup.nextone` and functions returned by `lookup.iterate` have been protected against exhausted stack space. - New `lookup.checktable` checks all its arguments for lookup tables and issues an error if at least one of its arguments is not a lookup table. - Similarily, new `lookup.istable` checks all its arguments for lookup tables and returns `true` or `false`. - With sets, `map` can now work in-place, by passing the `inplace=true' option. - New `sets.cleanse` removes all values from a set. The function does not resize the set, call `sets.resize` afterwards if needed. - The C API function `agn_hsize` to get the size of the hash part of a table could not be used in C code. This has been fixed. - This release has been Valgrind-checked on x86 and x64 Linux to ensure there are neither internal errors nor memory leaks.