.

wcfs/δbtail_test.go

@@ -1307,29 +1307,6 @@ func TestΔBTail(t *testing.T) {
 
 	// test known cases going through tree1 -> tree2 -> ...
 	testv := []interface{} {
-		// 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",
-		"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",
-
-		"T2/B1:a-B2:c", "T2,3/B1:a-B2:c-B3:c",
-
-		"T2/B1:a-B3:c",
-		Δ("T2/T-T4/B1:b-B3:d-B99:h",
-			A{1:  K(1),
-			  3:  K(3),
-			  99: K(3,99),
-			  oo: K(3,99,oo)}),
-		// XXX --------
-
-		// tree rotation
-		"T3/B2:b-B3:c,4:d",
-		"T5/T3-T7/B2:a-B3:a,4:a-B6:a-B8:a",
-
-		// XXX --------
-
 		"T/B:",
 
 		// +1
@@ -1488,6 +1465,27 @@ func TestΔBTail(t *testing.T) {
 		// found by AllStructs (SIGSEGV in ApplyΔ)
 		"T1/T-T2/T-B1:c-B2:c/B0:g",
 		"T1/T-T/B0:g-T/B1:e",
+
+		// 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",
+		"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",
+
+		"T2/B1:a-B2:c", "T2,3/B1:a-B2:c-B3:c",
+
+		"T2/B1:a-B3:c",
+		Δ("T2/T-T4/B1:b-B3:d-B99:h",
+			A{1:  K(1),
+			  3:  K(3),
+			  99: K(3,99),
+			  oo: K(3,99,oo)}),
+		// XXX --------
+
+		// tree rotation
+		"T3/B2:b-B3:c,4:d",
+		"T5/T3-T7/B2:a-B3:a,4:a-B6:a-B8:a",
 	}
 	// direct  tree_i -> tree_{i+1} -> _{i+2} ...   plus
 	// reverse ... tree_i <- _{i+1} <- _{i+2}