.

wcfs/δbtail_test.go

@@ -781,16 +781,7 @@ func TestΔBTail(t *testing.T) {
 
 	// test known cases going through tree1 -> tree2 -> ...
 	testv := []interface{} {
-		// found by AllStructs ([1] is not changed, but because B1 is
-		// unlinked and 1 migrates to othe bucket, changes in that
-		// other bucket must be included into δT)
-		"T1,2/B0:e-B1:d-B2:g,3:a",
-		"T1/B0:d-B1:d,2:d",
-
-		// XXX the same issue as ^^^ but with depth=2
-		"T1,2/T-T-T/B0:a-B1:b-B2:c,3:d",
-		"T1/T-T/B0:e-B1:b,2:f",
-
+		// XXX TODO classify
 		"T2/B1:a-B7:g", "T2,8/B1:a-B7:g-B9:i",
 
 		"T2/B1:a-B2:b", "T/B1:a,2:b",
@@ -805,6 +796,7 @@ func TestΔBTail(t *testing.T) {
 			  3:  K(3),
 			  99: K(3,99),
 			  oo: K(3,99)}),
+		// XXX --------
 
 		"T/B:",
 
@@ -915,6 +907,17 @@ func TestΔBTail(t *testing.T) {
 		"T3/B1:a,2:b-B4:d,8:h",
 		"T2,5/B1:a-B2:b,4:d-B8:h", // XXX add A
 
+		// found by AllStructs ([1] is not changed, but because B1 is
+		// unlinked and 1 migrates to othe bucket, changes in that
+		// other bucket must be included into δT)
+		"T1,2/B0:e-B1:d-B2:g,3:a",
+		"T1/B0:d-B1:d,2:d",
+
+		// XXX the same issue as ^^^ but with depth=2
+		"T1,2/T-T-T/B0:a-B1:b-B2:c,3:d",
+		"T1/T-T/B0:e-B1:b,2:f",
+
+
 		// XXX depth=3 (to verify recursion and selecting which tree children to follow or not)
 
 		// XXX more