.

wcfs/δbtail.go

@@ -587,7 +587,7 @@ func diffX(ctx context.Context, a, b Node, δZTC SetOid, trackIdx map[zodb.Oid]n
 
 // diffT computes difference in between two subtrees.
 //
-// a, b point to top of the subtree @old and @new revisions.
+// a, b point to top of subtrees @old and @new revisions.
 // δZTC is connected set of objects covering δZT (objects changed in this tree in old..new).
 //
 // XXX trackIdx -> just pass δBtail?

wcfs/δbtail_test.go

@@ -472,9 +472,8 @@ func xverifyΔBTail(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid, a
 
 		fmt.Println()
 		for len(q1) > 0 || len(q2) > 0 {
-			fmt.Printf("q1: %v\n", q1)
-			fmt.Printf("q2: %v\n", q2)
-
+			//fmt.Printf("q1: %v\n", q1)
+			//fmt.Printf("q2: %v\n", q2)
 			if l1 := len(q1); l1 > 0 {
 				k1 = q1[l1-1];  q1 = q1[:l1-1]
 				if !adj1.Has(k1) {
@@ -800,6 +799,13 @@ func TestΔBTail(t *testing.T) {
 	testv := []interface{} {
 		//"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)}),
+
 		// 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.