larvit/fejkdata
3
0
Fork 0
Code Pull Requests 1 Actions Activity

Make great documentation goal 1.2, and plan the README's reorganisation and the nested-template gaps #33

Open
lilleman wants to merge 966 commits from worktree-todo-relative-dates-exact-counts into main
pull from: worktree-todo-relative-dates-exact-counts
merge into: larvit:main
Conversation 0 Commits 966 Files Changed 167
+2 -2
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Showing only changes of commit e4d075af6c - Show all commits
docs/decisions.md
+2 -2
View File
@@ -244,8 +244,8 @@ carry both rules and both scopes anyway, and tell them apart at every step.
## A hold set makes its draw maps on the first read ## A hold set makes its draw maps on the first read
Every render and every draw group starts from an empty hold, since goal 2 prices a reader Every render starts from an empty hold set, its draw groups included, since goal 2 prices
meeting two spellings of one empty set. Making the maps where the set is declared kept a a reader meeting two spellings of one empty set. Making the maps where the set is declared kept a
record's on its frame's stack, but a `Fake`'s set lives on the `Generator`, so there it record's on its frame's stack, but a `Fake`'s set lives on the `Generator`, so there it
cost the cheapest render two heap allocations and 240→390 ns, measured 2026-09-28. cost the cheapest render two heap allocations and 240→390 ns, measured 2026-09-28.
Lazily, a render reading a reference path pays those two allocations, a record or struct Lazily, a render reading a reference path pays those two allocations, a record or struct