.

wcfs/δbtail.go

@@ -670,7 +670,7 @@ func diffT(ctx context.Context, a, b *Tree, δZTC SetOid, trackIdx map[zodb.Oid]
 	for c := range bChildren { allChildren.Add(c) }
 
 	// go through all children that potentially can add to δ and process add/del/modify
-	for child := range allChildren { // XXX -> sorted?
+	for child := range allChildren { // XXX -> sorted? FIXME wrong to traverse by oid - need to ...?
 		ca := aChildren[child]
 		cb := bChildren[child]
 

wcfs/δbtail_test.go

@@ -920,6 +920,8 @@ 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
 
+		// XXX depth=3 (to verify recursion and selecting which tree children to follow or not)
+
 		// XXX more
 
 		// degenerate topology from ZODB tests