Compile each path's steps, leaves and cover once at link, deleting pathCover, coverPath and pathLeaves

2026-09-30 17:09:50 +02:00
parent 0f58784a1b
commit 6b9755b3ef
10 changed files with 149 additions and 103 deletions
@@ -842,11 +842,12 @@ 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.

-## The four path walks are four loops
+## The path walks are separate loops

 2026-09-28, larv-review on systems-architect's finding; approved 2026-09-28 by lilleman.
 Re-tested 2026-09-29 by collapsing them into one loop switching on a mode field.
-Goals 2 and 11: `pathCheck`, `pathCover`, `pathProbe` and `pathDraw` stay four loops.
+Goals 2 and 11: `pathCheck`, `pathProbe` and `pathDraw` stay separate loops; `pathCover`
+became the cover `pathCheck` compiles, on 2026-09-30.
 One loop fails `perf_test.go`: the check's leaves, the probe's selectors and the errors
 naming a level leak the walker's contents, and Go tracks a struct's fields as one, so
 the draw's pins, arm and memo leak with them. Held by pointer, a repeat of a reference