Have the draw fence query the read fold, deleting hasRead and its helpers

This commit is contained in:
2026-09-29 21:16:50 +02:00
committed by Lillem4n
parent 8d5c7e0adf
commit 78b08b699f
4 changed files with 31 additions and 76 deletions
-6
View File
@@ -834,12 +834,6 @@ 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 `drawFence.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 `hasRead` states the same stop rule. Valid while the two differ in where they stop.
## The four path walks are four loops
2026-09-28, larv-review on systems-architect's finding; approved 2026-09-28 by lilleman.