.

go/zodb/btree/check.go

+// TODO implement btree checking a-la ztree._check + BTrees.check.check
+
+package btree

go/zodb/btree/ziobtree.go

@@ -204,6 +204,8 @@ func (t *IOBTree) VGet(ctx context.Context, key int32, visit func(node IONode))
 			return nil, false, err
 		}
 
+		// XXX verify child keys are in valid range according to parent
+
 		if visit != nil {
 			visit(child)
 		}
@@ -278,6 +280,8 @@ func (t *IOBTree) VMinKey(ctx context.Context, visit func(node IONode)) (_ int32
 			visit(child)
 		}
 
+		// XXX verify child keys are in valid range according to parent
+
 		switch child := child.(type) {
 		case *IOBTree:
 			t = child
@@ -331,6 +335,8 @@ func (t *IOBTree) VMaxKey(ctx context.Context, visit func(node IONode)) (_ int32
 			visit(child)
 		}
 
+		// XXX verify child keys are in valid range according to parent
+
 		switch child := child.(type) {
 		case *IOBTree:
 			t = child

go/zodb/btree/zlobtree.go

@@ -204,6 +204,8 @@ func (t *LOBTree) VGet(ctx context.Context, key int64, visit func(node LONode))
 			return nil, false, err
 		}
 
+		// XXX verify child keys are in valid range according to parent
+
 		if visit != nil {
 			visit(child)
 		}
@@ -278,6 +280,8 @@ func (t *LOBTree) VMinKey(ctx context.Context, visit func(node LONode)) (_ int64
 			visit(child)
 		}
 
+		// XXX verify child keys are in valid range according to parent
+
 		switch child := child.(type) {
 		case *LOBTree:
 			t = child
@@ -331,6 +335,8 @@ func (t *LOBTree) VMaxKey(ctx context.Context, visit func(node LONode)) (_ int64
 			visit(child)
 		}
 
+		// XXX verify child keys are in valid range according to parent
+
 		switch child := child.(type) {
 		case *LOBTree:
 			t = child