Debian Codegraph @

internal/bisect/bisect.go

raw
1 package bisect
2
3 import "sort"
4
5 // Right to locate the insertion point for v in a to maintain sorted order.
6 func Right(a []int, v int) int {
7 return bisectRightRange(a, v, 0, len(a))
8 }
9
10 func bisectRightRange(a []int, v int, lo, hi int) int {
11 s := a[lo:hi]
12 return sort.Search(len(s), func(i int) bool {
13 return s[i] > v
14 })
15 }