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

Give check, children, column, columns, draw, drawn, fields, format, head, index, key, n, name, named, names, null, number, op, reads, record, root, row, t and whole one meaning each

Browse Source
This commit is contained in:
Lilleman auf Larv
2026-09-25 19:10:18 +02:00
committed by Lillem4n
parent cfe8124cc3
commit d6ac8ed9fd
29 changed files with 324 additions and 326 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/decisions.md
+2 -2
View File
@@ -650,8 +650,8 @@ import drops them by name rather than by a rank a regeneration would move.
the set of every descent through a chain of five tables is every subsequence of it, and
the direct chain is the one a reader can predict from the tables' parents.
## Each entry point to `drawCheck.reads` says what its caller gets
## Each entry point to `drawCheck.hasRead` says what its caller gets
2026-09-25, larv-review; approved 2026-09-25 by lilleman. Goal 2: a reader lands on
`readsPath` or `splitsDraws` from its caller, so each doc states where that walk stops,
though `reads` states the same stop rule. Valid while the two differ in where they stop.
though `hasRead` states the same stop rule. Valid while the two differ in where they stop.