.

wcfs/δbtail.go

@@ -332,10 +332,10 @@ func (tidx trackIndex) verify() {
 //
 // In other words it removes B nodes from A while still maintaining A as P-connected.
 func (A trackIndex) DifferenceInplace(B trackIndex) {
-	fmt.Printf("\n\nDifferenceInplace:\n")
-	fmt.Printf("  A: %s\n", A)
-	fmt.Printf("  B: %s\n", B)
-	defer fmt.Printf("->D: %s\n", A)
+	//fmt.Printf("\n\nDifferenceInplace:\n")
+	//fmt.Printf("  A: %s\n", A)
+	//fmt.Printf("  B: %s\n", B)
+	//defer fmt.Printf("->D: %s\n", A)
 
 	A.verify()
 	B.verify()
@@ -402,10 +402,10 @@ func (A trackIndex) DifferenceInplace(B trackIndex) {
 //
 // In other words it adds B nodes to A.
 func (A trackIndex) UnionInplace(B trackIndex) {
-	fmt.Printf("\n\nUnionInplace:\n")
-	fmt.Printf("  A: %s\n", A)
-	fmt.Printf("  B: %s\n", B)
-	defer fmt.Printf("->U: %s\n", A)
+	//fmt.Printf("\n\nUnionInplace:\n")
+	//fmt.Printf("  A: %s\n", A)
+	//fmt.Printf("  B: %s\n", B)
+	//defer fmt.Printf("->U: %s\n", A)
 
 	A.verify()
 	B.verify()
@@ -439,11 +439,11 @@ func (A trackIndex) UnionInplace(B trackIndex) {
 
 // ApplyΔ applies δ to trackIdx.	XXX
 func (tidx trackIndex) ApplyΔ(δ *δtrackIndex) {
-	fmt.Printf("\n\nApplyΔ\n")
-	fmt.Printf("  A: %s\n", tidx)
-	fmt.Printf("  -: %s\n", δ.Del)
-	fmt.Printf("  +: %s\n", δ.Add)
-	defer fmt.Printf("\n->B: %s\n", tidx)
+	//fmt.Printf("\n\nApplyΔ\n")
+	//fmt.Printf("  A: %s\n", tidx)
+	//fmt.Printf("  -: %s\n", δ.Del)
+	//fmt.Printf("  +: %s\n", δ.Add)
+	//defer fmt.Printf("\n->B: %s\n", tidx)
 
 	tidx.verify()
 	δ.Del.verify()

wcfs/δbtail_test.go

@@ -1479,6 +1479,11 @@ func TestΔBTail(t *testing.T) {
 		"T1/T-T2/T-B1:c-B2:c/B0:g",
 		"T1/T-T/B0:g-T/B1:e",
 
+		// found by AllStructs (trackIdx corruption: oid is pointerd by
+		// some .parent bu is not present)
+		"T1/T-T/B0:g-T2/B1:h-B2:g",
+		"T/T1/T-T2/B0:e-B1:f-B2:g",
+
 		// XXX TODO classify
 		"T2/B1:a-B7:g", "T2,8/B1:a-B7:g-B9:i",