.

wcfs/δbtail_test.go

@@ -590,7 +590,7 @@ func xverifyΔBTail1(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid,
 		}
 	}
 
-	// XXX verify δbtail trackIdx against @at1
+	// verify δbtail.holeIdx  against @at1
 	// holes1 = tracked1 \ kv1
 	holes1 := SetKey{}
 	for k := range initialTrackedKeys {
@@ -603,7 +603,7 @@ func xverifyΔBTail1(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid,
 		badf("δbtail.holeIdx1 wrong  ; holeIdx=%v  holeIdxOK=%v", δbtail.holeIdx, holes1)
 	}
 
-	// XXX verify δbtail holeIdx  against @at1
+	// XXX verify δbtail trackIdx against @at1
 
 	// δB <- δZ
 	δB, err := δbtail.Update(δZ); X(err)
@@ -612,18 +612,20 @@ func xverifyΔBTail1(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid,
 		return
 	}
 
+	// verify δbtail.holeIdx  against @at2
 	// holes2 = tracked2 \ kv2  ( = kadj[tracked1] \ kv2)
 	holes2 := SetKey{}
 	for k := range kadjTracked {
-		if k == kInf {
-			continue // ∞ is translated to maxk2
-		}
 		_, keyin2 := xkv2.Get(k).kv[k]
 		if !keyin2 {
 			holes2.Add(k)
 		}
 	}
-	// XXX verify
+	/* XXX reenable
+	if !reflect.DeepEqual(holes2, δbtail.holeIdx.SetKey) {
+		badf("δbtail.holeIdx2 wrong  ; holeIdx=%v  holeIdxOK=%v", δbtail.holeIdx, holes2)
+	}
+	*/
 
 	// XXX verify δbtail index consistency against @at2
 	// XXX verify that removed keys remain in trackedIdx (holes), so that e.g.