.

wcfs/δbtail.go

@@ -40,7 +40,7 @@ type Key    = int64
 type Value  = zodb.Oid // XXX assumes key points to IPersistent
                        // XXX how to represent deletion? InvalidOid?
 
-// ΔBTail represents tail of revisional changes to BTrees.
+// ΔBtail represents tail of revisional changes to BTrees.
 //
 // It semantically consists of
 //
@@ -62,7 +62,7 @@ type Value  = zodb.Oid // XXX assumes key points to IPersistent
 // In particular a key that was not explicitly requested to be tracked, even if
 // it was changes in δZ, is not guaranted to be present in δB.
 //
-// ΔBTail provides the following operations:
+// ΔBtail provides the following operations:
 //
 //   .Track(path)		- start tracking tree nodes and keys; root=path[0], keys=path[-1].keys
 //
@@ -79,7 +79,7 @@ type Value  = zodb.Oid // XXX assumes key points to IPersistent
 // XXX incremental; not full coverage
 // XXX see also zodb.ΔTail .
 //
-// ΔBTail is not safe for concurrent access.
+// ΔBtail is not safe for concurrent access.
 // XXX -> multiple readers / single writer?
 type ΔBtail struct {
 	// raw ZODB changes; Kept to rebuild δBtail/byRoot after new Track.
@@ -113,7 +113,7 @@ type ΔRoots struct {
 
 // ΔTreeTail represent tail of revisional changes to one BTree.
 //
-// See ΔBTail documentation for details.
+// See ΔBtail documentation for details.
 //
 // XXX -> ΔTtail
 type ΔTreeTail struct {
@@ -133,7 +133,7 @@ type ΔTree struct {
 	KV   map[Key]Value
 }
 
-// NewΔBtail creats new empty ΔBTail object.
+// NewΔBtail creates new empty ΔBtail object.
 //
 // Initial tracked set is empty.
 // Initial coverage is (at₀, at₀].
@@ -145,7 +145,7 @@ func NewΔBtail(at0 zodb.Tid) *ΔBtail {
 	}
 }
 
-// XXX
+// newΔTtail creates new empty ΔTtail object.
 func newΔTtail() *ΔTreeTail {
 	return &ΔTreeTail{
 		KVAtTail:  make(map[Key]Value),