fix #47. fix #48

Jason E. Aten, Ph.D. · Jason E. Aten, Ph.D. · commit d77eabacbbee · 2025-03-16T16:27:02.000Z
diff --git a/btree.go b/btree.go
@@ -116,7 +116,7 @@ func (tr *BTree) DeleteHint(key any, hint *PathHint) (prev any) {
 	if key == nil {
 		return nil
 	}
-	v, ok := tr.base.DeleteHint(key, nil)
+	v, ok := tr.base.DeleteHint(key, hint)
 	if !ok {
 		return nil
 	}
diff --git a/btreeg.go b/btreeg.go
@@ -94,7 +94,7 @@ func (n *node[T]) leaf() bool {
 func (tr *BTreeG[T]) bsearch(n *node[T], key T) (index int, found bool) {
 	low, high := 0, len(n.items)
 	for low < high {
-		h := (low + high) / 2
+		h := int(uint(low+high) >> 1) // avoid overflow when computing h
 		if !tr.less(key, n.items[h]) {
 			low = h + 1
 		} else {

Original file line number	Diff line number	Diff line change
`@@ -116,7 +116,7 @@ func (tr BTree) DeleteHint(key any, hint PathHint) (prev any) {`
`116`	`116`	`if key == nil {`
`117`	`117`	`return nil`
`118`	`118`	`}`
`119`		`- v, ok := tr.base.DeleteHint(key, nil)`
	`119`	`+ v, ok := tr.base.DeleteHint(key, hint)`
`120`	`120`	`if !ok {`
`121`	`121`	`return nil`
`122`	`122`	`}`