.

wcfs/δbtail_test.go

@@ -305,7 +305,7 @@ func xverifyΔBTail1(t *testing.T, db *zodb.DB, treeRoot zodb.Oid, at1,at2 zodb.
 	// - in tracked set	 -> must be present in δT
 	// - outside tracked set -> may  be present in δT
 
-	// subset
+	// δT is subset of d12
 	for k := range δT {
 		_, ind12 := d12[k]
 		if ind12 {
@@ -313,11 +313,10 @@ func xverifyΔBTail1(t *testing.T, db *zodb.DB, treeRoot zodb.Oid, at1,at2 zodb.
 		}
 	}
 
-	// all keys from d12/tracked are in δT
+	// k ∈ tracked set ->  must be present in δT
+	// k ∉ tracked set ->  may  be present in δT
 	for k,v := range d12 {
 		_, inδT := δT[k]
-		// k ∈ tracked set ->  must be present in δT
-		// k ∉ tracked set ->  may  be present in δT
 		if initialTrackedKeys.Has(k) {
 			if !inδT {
 				badf("δT: missing key %s", k)
@@ -330,14 +329,6 @@ func xverifyΔBTail1(t *testing.T, db *zodb.DB, treeRoot zodb.Oid, at1,at2 zodb.
 		}
 	}
 
-	//for (k,v) in d12:
-	//	if k in initialTrackedKeys:
-	//		assert k in δT
-	//		assert δT[k] == v
-	//	else:
-	//		if k in δT:
-	//			assert δT[k] == v
-
 	if badv != nil {
 		emsg := fmt.Sprintf("d12: %v\nδT: %v\n\n", d12, δT)
 		emsg += strings.Join(badv, "\n")