func sort.Search
18 uses
sort (current package)
search.go#L59: func Search(n int, f func(int) bool) int {
search.go#L84: return Search(len(a), func(i int) bool { return a[i] >= x })
search.go#L93: return Search(len(a), func(i int) bool { return a[i] >= x })
search.go#L102: return Search(len(a), func(i int) bool { return a[i] >= x })
go.etcd.io/bbolt
cursor.go#L270: index := sort.Search(len(n.inodes), func(i int) bool {
cursor.go#L293: index := sort.Search(int(p.count), func(i int) bool {
cursor.go#L318: index := sort.Search(len(n.inodes), func(i int) bool {
cursor.go#L327: index := sort.Search(int(p.count), func(i int) bool {
node.go#L82: index := sort.Search(len(n.inodes), func(i int) bool { return bytes.Compare(n.inodes[i].key, child.key) != -1 })
node.go#L126: index := sort.Search(len(n.inodes), func(i int) bool { return bytes.Compare(n.inodes[i].key, oldKey) != -1 })
node.go#L146: index := sort.Search(len(n.inodes), func(i int) bool { return bytes.Compare(n.inodes[i].key, key) != -1 })
page.go#L192: n := sort.Search(len(lead), func(i int) bool { return lead[i] > follow[0] })
go/token
position.go#L294: return sort.Search(len(a), func(i int) bool { return a[i].Offset > x }) - 1
position.go#L470: return sort.Search(len(a), func(i int) bool { return a[i].base > x }) - 1
golang.org/x/sys/unix
syscall_unix.go#L56: i := sort.Search(len(errorList), func(i int) bool {
syscall_unix.go#L67: i := sort.Search(len(signalList), func(i int) bool {
net/http
server.go#L2483: i := sort.Search(n, func(i int) bool {
src.elv.sh/pkg/wcwidth
wcwidth.go#L70: i := sort.Search(n, func(i int) bool { return r <= combining[i][1] })