.

wcfs/internal/xbtree/δbtail_test.go

@@ -1455,7 +1455,6 @@ func TestΔBTail(t *testing.T) {
 
 	// test known cases going through tree1 -> tree2 -> ...
 	testv := []interface{} {
-/*
 		// start from non-empty tree to verify both ->empty and empty-> transitions
 		"T/B1:a,2:b",
 
@@ -1515,19 +1514,19 @@ func TestΔBTail(t *testing.T) {
 			  4:  K(1,2,3,4,5,oo),
 			  5:  K(1,2,3,4,5,oo),
 			  oo: K(1,2,3,4,5,oo)}),
-*/
+
 		// 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),
+			A{1:  K(1,2,3,4,5,6,7,oo),
+			  2:  K(1,2,3,4,5,6,7,oo),
+			  3:  K(1,2,3,4,5,6,7,oo),
+			  4:  K(1,2,3,4,5,6,7,oo),
+			  5:  K(1,2,3,4,5,6,7,oo),
+			  6:  K(1,2,3,4,5,6,7,oo),
+			  7:  K(1,2,3,4,5,6,7,oo),
 			  oo: K(1,2,3,4,5,6,7,oo)}),
 
 		// reflow of keys for rebuild: even if tracked1={}, tracked2={1}, changes to