.

wcfs/internal/xbtree/treediff.go

@@ -35,7 +35,7 @@ package xbtree
 // BTree diff algorithm
 //
 // diffT, diffB and δMerge constitute the diff algorithm implementation.
-// diff(A,B) works on pair of A and B whole key range splitted into regions
+// diff(A,B) works on pair of A and B whole key ranges splitted into regions
 // covered by tree nodes. The splitting represents current state of recursion
 // into corresponding tree. If a node in particular key range is Bucket, that
 // bucket contributes to δ- in case of A, and to δ+ in case of B. If a node in

wcfs/internal/xbtree/δbtail_test.go

@@ -1061,8 +1061,6 @@ func xverifyΔBTail_rebuild_TR(t *testing.T, δbtail *ΔBtail, tj *xbtreetest.Co
 	subj += " + rebuild"
 	δbtail.assertTrack(t, subj, trackSetAfterRebuild, ø)
 
-	// XXX verify Get -> XXX assertΔTtail ?
-
 	// verify δbtail.byRoot[treeRoot]
 	assertΔTtail(t, subj, δbtail, tj, treeRoot, vδTok...)
 }