.

wcfs/δbtail_test.go

@@ -484,7 +484,6 @@ func xverifyΔBTail(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid, a
 
 	if kadjOK != nil && !reflect.DeepEqual(kadj, kadjOK) {
 		t.Errorf("%s: BUG: computed kadj is wrong:\nkadjOK: %v\nkadj  : %v\n\n", subj, kadjOK, kadj)
-		return
 	}
 
 
@@ -757,6 +756,22 @@ func TestΔBTail(t *testing.T) {
 	// test known cases going through tree1 -> tree2 -> ...
 	testv := []interface{} {
 		//"T2/B1:a-B2:c", "T2,3/B1:a-B2:c-B3:c",
+
+		// reflow of keys: even if tracked={1}, changes to all B nodes need to be rescanned:
+		// +B12 forces to look in -B23 which adds -3 into δ, which
+		// forces to look into +B34 and so on.
+		"T2,4,6/B1:a-B2:b,3:c-B4:d,5:e-B6:f,7:g",
+		Δ("T3,5,7/B1:g,2:f-B3:e,4:d-B5:c,6:b-B7:a",
+			A{1:  K(1,2,3,4,5,6,7),
+			  2:  K(1,2,3,4,5,6,7),
+			  3:  K(1,2,3,4,5,6,7),
+			  4:  K(1,2,3,4,5,6,7),
+			  5:  K(1,2,3,4,5,6,7),
+			  6:  K(1,2,3,4,5,6,7),
+			  7:  K(1,2,3,4,5,6,7),
+			  oo: K(1,2,3,4,5,6,7)}),
+
+		"T2/B1:a-B2:b", "T/B1:a,2:b",
 		"T2,3/B1:a-B2:b-B3:c", "T/B1:a,2:b",
 		"T2,3/B1:a-B2:c-B3:c", "T/B1:a,2:b",
 ///*