.

wcfs/δbtail_test.go

@@ -601,20 +601,26 @@ func KAdj(t1, t2 *tTreeCommit) (kadj map[Key]SetKey) {
 // xverifyΔBTail_Update verifies how ΔBTail handles ZODB update for a tree with changes in between t1->t2.
 func xverifyΔBTail_Update(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid, t1, t2 *tTreeCommit) {
 	// verify transition at1->at2 for all initial states of tracked {keys} from kv1 + kv2 + ∞
-	allKeys := allTestKeys(t1, t2)
-	allKeyv := allKeys.SortedElements()
 
-	kadj12 := KAdj(t1, t2)
+// XXX think again whether running each case in subtest is good or not
+//	t.Run(fmt.Sprintf("Update/%s→%s", t1.tree, t2.tree), func(t *testing.T) {
+		allKeys := allTestKeys(t1, t2)
+		allKeyv := allKeys.SortedElements()
 
-	// verify at1->at2 for all combination of initial tracked keys.
-	for kidx := range IntSets(len(allKeyv)) {
-		keys := SetKey{}
-		for _, idx := range kidx {
-			keys.Add(allKeyv[idx])
-		}
+		kadj12 := KAdj(t1, t2)
 
-		xverifyΔBTail_Update1(t, subj, db, treeRoot, t1.at,t2.at, t1.xkv,t2.xkv, t2.δZ, keys, kadj12)
-	}
+		// verify at1->at2 for all combination of initial tracked keys.
+		for kidx := range IntSets(len(allKeyv)) {
+			keys := SetKey{}
+			for _, idx := range kidx {
+				keys.Add(allKeyv[idx])
+			}
+
+//			t.Run(fmt.Sprintf(" track=%s", keys), func(t *testing.T) {
+				xverifyΔBTail_Update1(t, subj, db, treeRoot, t1.at,t2.at, t1.xkv,t2.xkv, t2.δZ, keys, kadj12)
+//			})
+		}
+//	})
 }
 
 // xverifyΔBTail_Update1 verifies how ΔBTail handles ZODB update at1->at2 from initial