.

wcfs/δbtail_test.go

@@ -806,20 +806,6 @@ func TestΔBTail(t *testing.T) {
 			  99: K(3,99),
 			  oo: K(3,99)}),
 
-		// 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)}),
-
 		"T/B:",
 
 		// +1
@@ -876,6 +862,20 @@ func TestΔBTail(t *testing.T) {
 			  5:  K(1,2,3,4,5),
 			  oo: K(1,2,3,4,5)}),
 
+		// 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)}),
+
 		// depth=2; bucket split; +3 in new bucket; left T remain
 		// _unchanged_ even though B under it is modified; right arm is
 		// added to tracking set because 2 migrates there.