.

wcfs/internal/xbtree/δbtail.go

@@ -234,7 +234,7 @@ func (δBtail *ΔBtail) Tail() zodb.Tid { return δBtail.δZtail.Tail() }
 // XXX path -> []oid ?
 //
 // XXX catch cycles on add?
-// XXX no need to pass in key
+// XXX no need to pass in key?  (-> all keys, covered by leaf keyrange, will be added to tracking set of keys)
 func (δBtail *ΔBtail) Track(key Key, nodePath []Node) error { // XXX Tree|Bucket; path[0] = root
 
 	path := nodePathToPath(nodePath)
@@ -406,7 +406,7 @@ func (δTtail *ΔTtail) rebuild(root zodb.Oid, δZtail *zodb.ΔTail, db *zodb.DB
 
 // rebuild1 rebuilds δT for single δZ.
 //
-// δtrackNew/δtkeycov represents how trackNew changes when going from atPrev <- δZ.Rev .
+// δtrackNew/δtkeycov represents how trackNew changes when going through `atPrev <- δZ.Rev` .
 func (δTtail *ΔTtail) rebuild1(atPrev zodb.Tid, δZ zodb.ΔRevEntry, trackNew PPTreeSubSet, db *zodb.DB) (δtrackNew *ΔPPTreeSubSet, δtkeycov *RangedKeySet, err error) {
 	defer xerr.Contextf(&err, "rebuild1 %s<-%s", atPrev, δZ.Rev)
 
@@ -612,7 +612,7 @@ func (δBtail *ΔBtail) ForgetPast(revCut zodb.Tid) {
 
 // update brings .δBtail up to date by recomputing diff XXX and taking new
 // entries in .δZtail into account.
-// func (δBtail *ΔBtail) update()
+// func (δBtail *ΔBtail) update()	XXX kill
 
 
 // Get returns root[key] as of @at database state plus revision that changed it.
@@ -705,6 +705,7 @@ func (δBtail *ΔBtail) GetAt(ctx context.Context, root *Tree, key Key, at zodb.
 func (δBtail *ΔBtail) SliceByRootRev(root zodb.Oid, lo, hi zodb.Tid) /*readonly*/[]ΔTree {
 	xtail.AssertSlice(δBtail, lo, hi)
 	// XXX locking
+	// XXX rebuild
 	δTtail, ok := δBtail.vδTbyRoot[root]
 	if !ok {
 		return []ΔTree{}