Name the path walks after their entry points, keep the probe allocation-free, and record why the walks are four loops

This commit is contained in:
2026-09-28 00:26:33 +02:00
committed by Lillem4n
parent 917c93564f
commit 68033bd42f
8 changed files with 35 additions and 29 deletions
+1 -1
View File
@@ -100,7 +100,7 @@ func operandReader(t *template, head string) string {
// coverPath collects what holding one path pins: every choice level the path
// passes through, whole, and the leaf it renders.
func coverPath(n node, tail []string, into map[node]bool) {
_, _ = (&coverWalk{into: into}).walk(n, tail)
_, _ = (&pathCover{into: into}).walk(n, tail)
}
// cover collects a level and everything contained in it. A fixed string outside a