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

State the step-down rule at drawSteps' climbed, and name the parts of route's draw condition

Browse Source
This commit is contained in:
Lilleman auf Larv
2026-10-07 01:08:13 +02:00
committed by Lillem4n
parent ac44a2f89b
commit f272c5b025
2 changed files with 9 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
table.go
+6 -4
View File
@@ -266,11 +266,13 @@ func (t *table) route(tail []string, descended bool) (tableRoute, error) {
if err != nil {
return tableRoute{}, err
}
// A selector further down pins this table by ancestry, so the walk draws only
// where none follows; drawing first could draw a row the selector is not inside.
r := tableRoute{sel: sel, draw: sel == "" && (descended || len(tail) > 0) && !grammar.HasSelector(tail)}
selected, readsRow := sel != "", descended || len(tail) > 0
// A selector further down pins this table by ancestry; drawing first could draw a row the
// selector is not inside.
pinnedBelow := grammar.HasSelector(tail)
r := tableRoute{sel: sel, draw: !selected && readsRow && !pinnedBelow}
switch {
case len(tail) == 0 && sel == "" && !descended:
case !selected && !readsRow:
r.next = t
case len(tail) == 0:
r.next = t.rowNode