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
+8 -6
1 changed files with 8 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Showing only changes of commit b6f074a72a - Show all commits
README.md
+8 -6
View File
@@ -746,12 +746,14 @@ token {w} is repeated, and uppercase operand "w" holds "w" to one draw per expan
### Performance
Each file is parsed, validated and weight-indexed once, in `New`. Proving the draw
fences adds a pass over the loaded tree per fence, and walks what a render reads only
where data binds a reference, so a set that binds none pays for the passes alone. A
`Fake` call then costs about what its output costs: an unweighted pick is O(1)
whatever the list's length, a weighted one O(log n), and long formats, deep nesting
and many tokens add cost in proportion to the output.
Each file is parsed, validated and weight-indexed once, in `New`, bar a table with a
name or a parent column, which indexes its rows on the first `Fake` that selects or
descends through it. Proving the draw fences adds a pass over the loaded tree per
fence, and walks what a render reads only where data binds a reference, so a set that
binds none pays for the passes alone. A `Fake` call then costs about what its output
costs: an unweighted pick is O(1) whatever the list's length, a weighted one
O(log n), and long formats, deep nesting and many tokens add cost in proportion to
the output.
## Versioning