.

go/zodb/btree/btree.go

@@ -25,7 +25,7 @@
 //
 // node.Entryv() returns [] of (key, child/value).
 //
-// BTree.FirstBucket() and Bucket.Next() allows to iterate in terms of B⁺ tree nodes.
+// BTree.FirstBucket() and Bucket.Next() allow to iterate through leaf B⁺ tree nodes.
 //
 // --------
 //

go/zodb/btree/btree.go.in

@@ -135,12 +135,12 @@ func (b *Bucket) Entryv() []BucketEntry {
 
 // ---- node-level iteration ----
 
-// XXX
+// FirstBucket returns bucket containing the smallest key in the tree.
 func (t *BTree) FirstBucket() *Bucket {
 	return t.firstbucket
 }
 
-// XXX
+// Next returns tree bucket with next larger keys relative to current bucket.
 func (b *Bucket) Next() *Bucket {
 	return b.next
 }
@@ -241,7 +241,7 @@ func (t *BTree) MinKey(ctx context.Context) (_ KEY, ok bool, err error) {
 		return 0, false, nil
 	}
 
-	// NOTE -> can also use t.firstBucket
+	// NOTE -> can also use t.firstbucket
 	for {
 		child := t.data[0].child.(zodb.IPersistent)
 		t.PDeactivate()

go/zodb/btree/ziobtree.go

@@ -137,12 +137,12 @@ func (b *IOBucket) Entryv() []IOBucketEntry {
 
 // ---- node-level iteration ----
 
-// XXX
+// FirstBucket returns bucket containing the smallest key in the tree.
 func (t *IOBTree) FirstBucket() *IOBucket {
 	return t.firstbucket
 }
 
-// XXX
+// Next returns tree bucket with next larger keys relative to current bucket.
 func (b *IOBucket) Next() *IOBucket {
 	return b.next
 }
@@ -243,7 +243,7 @@ func (t *IOBTree) MinKey(ctx context.Context) (_ int32, ok bool, err error) {
 		return 0, false, nil
 	}
 
-	// NOTE -> can also use t.firstBucket
+	// NOTE -> can also use t.firstbucket
 	for {
 		child := t.data[0].child.(zodb.IPersistent)
 		t.PDeactivate()

go/zodb/btree/zlobtree.go

@@ -137,12 +137,12 @@ func (b *LOBucket) Entryv() []LOBucketEntry {
 
 // ---- node-level iteration ----
 
-// XXX
+// FirstBucket returns bucket containing the smallest key in the tree.
 func (t *LOBTree) FirstBucket() *LOBucket {
 	return t.firstbucket
 }
 
-// XXX
+// Next returns tree bucket with next larger keys relative to current bucket.
 func (b *LOBucket) Next() *LOBucket {
 	return b.next
 }
@@ -243,7 +243,7 @@ func (t *LOBTree) MinKey(ctx context.Context) (_ int64, ok bool, err error) {
 		return 0, false, nil
 	}
 
-	// NOTE -> can also use t.firstBucket
+	// NOTE -> can also use t.firstbucket
 	for {
 		child := t.data[0].child.(zodb.IPersistent)
 		t.PDeactivate()