.

wcfs/internal/xbtree/δbtail.go

@@ -360,8 +360,8 @@ func (δTtail *_ΔTtail) rebuild(root zodb.Oid, δZtail *zodb.ΔTail, db *zodb.D
 	// go backwards and merge vδT <- treediff(lo..hi/trackNew)
 	vδZ := δZtail.Data()
 	for {
-		δtkeycov := &blib.RangedKeySet{}     // all keys coming into tracking set during this lo<-hi scan
-		trackNewCur := trackNew.Clone() // trackNew adjusted as of when going to i<- entry
+		δtkeycov := &blib.RangedKeySet{} // all keys coming into tracking set during this lo<-hi scan
+		trackNewCur := trackNew.Clone()  // trackNew adjusted as of when going to i<- entry
 		for i := len(vδZ)-1; i>=0; i-- {
 			δZ := vδZ[i]
 
@@ -415,7 +415,6 @@ func (δTtail *_ΔTtail) rebuild(root zodb.Oid, δZtail *zodb.ΔTail, db *zodb.D
 }
 
 // widenTrackNew widens trackNew to cover δtkeycov.
-// XXX -> widenTrackSet?
 func widenTrackNew(trackNew blib.PPTreeSubSet, δtkeycov *blib.RangedKeySet, root zodb.Oid, at zodb.Tid, db *zodb.DB) (err error) {
 	// XXX errctx, debug
 	defer xerr.Contextf(&err, "widenTrackNew tree<%s> @%s +%s", root, at, δtkeycov)
@@ -430,7 +429,7 @@ func widenTrackNew(trackNew blib.PPTreeSubSet, δtkeycov *blib.RangedKeySet, roo
 		trackNew.AddPath([]zodb.Oid{root})
 		return nil
 	}
-	tree := xtree.(*Tree) // must succeed	XXX better explicit panic?
+	tree := xtree.(*Tree) // must succeed
 
 	top := &nodeInRange{prefix: nil, keycov: blib.KeyRange{KeyMin, KeyMax}, node: tree}
 	V   := rangeSplit{top}