.

wcfs/δbtail_test.go

@@ -629,7 +629,7 @@ func xverifyΔBTail1(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid,
 
 	// δT must be subset of d12.
 	// changed keys, that are
-	// - in tracked set	 -> must be present in δT  (covered by kadj)
+	// - in tracked set	 -> must be present in δT
 	// - outside tracked set -> may  be present in δT  (kadj gives exact answer)
 
 	// XXX use kadj - check exactly whether k is present in δT or not present
@@ -642,7 +642,8 @@ func xverifyΔBTail1(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid,
 		}
 	}
 
-	// XXX comment, see below?
+	// k ∈ tracked set ->  must be present in δT
+	// k ∉ tracked set ->  may  be present in δT  (kadj gives exact answer)
 	for k := range d12 {
 		_, inδT := δT[k]
 		if inδT && !inδTOK.Has(k) {
@@ -659,24 +660,6 @@ func xverifyΔBTail1(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid,
 			}
 		}
 	}
-/*
-	// k ∈ tracked set ->  must be present in δT
-	// k ∉ tracked set ->  may  be present in δT
-	// k==max && tracking maxKey -> k must be present in δT
-	for k := range d12 {
-		_, inδT := δT[k]
-		if initialTrackedKeys.Has(k) || (k == maxKey && trackingMaxKey) {
-			if !inδT {
-				badf("δT: [%v] is missing", k)
-			}
-		}
-		if inδT {
-			if δT[k] != d12[k] {
-				badf("δT[%v] != d12[%v]", k, k)
-			}
-		}
-	}
-*/
 
 	if badv != nil {
 		emsg := fmt.Sprintf("%s ; tracked=%v : δT is wrong:\n\n", subj, tracked)