28 lines
645 B
Go
28 lines
645 B
Go
package prompt
|
|
|
|
import "sort"
|
|
|
|
// BisectLeft to Locate the insertion point for v in a to maintain sorted order.
|
|
func BisectLeft(a []int, v int) int {
|
|
return bisectLeftRange(a, v, 0, len(a))
|
|
}
|
|
|
|
func bisectLeftRange(a []int, v int, lo, hi int) int {
|
|
s := a[lo:hi]
|
|
return sort.Search(len(s), func(i int) bool {
|
|
return s[i] >= v
|
|
})
|
|
}
|
|
|
|
// BisectRight to Locate the insertion point for v in a to maintain sorted order.
|
|
func BisectRight(a []int, v int) int {
|
|
return bisectRightRange(a, v, 0, len(a))
|
|
}
|
|
|
|
func bisectRightRange(a []int, v int, lo, hi int) int {
|
|
s := a[lo:hi]
|
|
return sort.Search(len(s), func(i int) bool {
|
|
return s[i] > v
|
|
})
|
|
}
|