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

Make great documentation goal 1.2, and plan the README's reorganisation and the nested-template gaps #33

Open
lilleman wants to merge 966 commits from worktree-todo-relative-dates-exact-counts into main
pull from: worktree-todo-relative-dates-exact-counts
merge into: larvit:main
Conversation 0 Commits 966 Files Changed 167
+12 -20
1 changed files with 12 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Showing only changes of commit 968d79399d - Show all commits
table_test.go
+12 -20
View File
@@ -964,9 +964,10 @@ func TestAmbiguousNameNamesARunnablePath(t *testing.T) {
} }
} }
// TestRowSetSimulatesPinning holds the walk's row set to the render's pinning: drift between // TestEnteredRowsAgreeWithPinning holds what a fence walk decides about the rows it entered to what
// the two is data that loads and then renders a family that disagrees. // pinning them refuses at render: drift between the two is data that loads and then renders a
func TestRowSetSimulatesPinning(t *testing.T) { // family that disagrees.
func TestEnteredRowsAgreeWithPinning(t *testing.T) {
f := newGenerator(t, writeFiles(t, geo()), WithSeed(1)) f := newGenerator(t, writeFiles(t, geo()), WithSeed(1))
var tables []*table var tables []*table
for _, category := range []string{"region", "municipality", "locality"} { for _, category := range []string{"region", "municipality", "locality"} {
@@ -976,33 +977,24 @@ func TestRowSetSimulatesPinning(t *testing.T) {
} }
tables = append(tables, tbl) tables = append(tables, tbl)
} }
var none pinSet
for _, entered := range tables { for _, entered := range tables {
for row := 0; row < entered.rows(); row++ { for row := 0; row < entered.rows(); row++ {
if drawn := rowSet(nil).enter(entered, row, false); len(drawn) != 1 || drawn[0] != (tablePin{entered, row}) { var drawn []tablePin
alone := none.entered(entered, row, false)
alone.each(func(tbl *table, r int) { drawn = append(drawn, tablePin{tbl, r}) })
if len(drawn) != 1 || drawn[0] != (tablePin{entered, row}) {
t.Errorf("a drawn %s enters %v, want its own row alone", entered.selectorSpelling(row), drawn) t.Errorf("a drawn %s enters %v, want its own row alone", entered.selectorSpelling(row), drawn)
} }
s := rowSet(nil).enter(entered, row, true) s := none.entered(entered, row, true)
var pinned hold
held := 0
pinned.pin(entered, row)
pinned.each(func(tbl *table, r int) {
held++
if got, in := s.rowOf(tbl); !in || got != r {
t.Errorf("entering %s leaves %s unset, though pinning it pins %s", entered.selectorSpelling(row), tbl.path, tbl.selectorSpelling(r))
}
})
if held != len(s) {
t.Errorf("entering %s holds %d rows, though pinning it pins %d", entered.selectorSpelling(row), len(s), held)
}
for _, cand := range tables { for _, cand := range tables {
for cr := 0; cr < cand.rows(); cr++ { for cr := 0; cr < cand.rows(); cr++ {
var beside hold beside := s
beside.pin(entered, row)
refused := beside.pinRow(cand, cr) != nil refused := beside.pinRow(cand, cr) != nil
if got := s.excludes(&template{cellOf: cand, cellRow: cr}); got != refused { if got := s.excludes(&template{cellOf: cand, cellRow: cr}); got != refused {
t.Errorf("excludes(%s) = %v beside %s, but pinRow refuses it = %v", cand.selectorSpelling(cr), got, entered.selectorSpelling(row), refused) t.Errorf("excludes(%s) = %v beside %s, but pinRow refuses it = %v", cand.selectorSpelling(cr), got, entered.selectorSpelling(row), refused)
} }
if got := alternatives(drawAt{alt: s}, drawAt{alt: rowSet(nil).enter(cand, cr, true)}); got != refused { if got := alternatives(drawAt{alt: s}, drawAt{alt: none.entered(cand, cr, true)}); got != refused {
t.Errorf("alternatives(%s, %s) = %v, but pinning both refuses = %v", entered.selectorSpelling(row), cand.selectorSpelling(cr), got, refused) t.Errorf("alternatives(%s, %s) = %v, but pinning both refuses = %v", entered.selectorSpelling(row), cand.selectorSpelling(cr), got, refused)
} }
} }