From: subham sarkar Date: Tue, 20 Jul 2021 17:17:14 +0000 (+0000) Subject: go/token: match the implementation of index selection with sort.Search X-Git-Tag: go1.18beta1~1653 X-Git-Url: http://www.git.cypherpunks.su/?a=commitdiff_plain;h=f98b6111eb8edda63a785db5678418b9eecbc5e9;p=gostls13.git go/token: match the implementation of index selection with sort.Search name old time/op new time/op delta SearchInts-8 15.5ns ± 2% 13.7ns ± 4% -11.87% (p=0.008 n=5+5) (see CL 36332 for the original change to sort.Search) Change-Id: If452818185b92b8b3548b066f475e493d604ea29 GitHub-Last-Rev: 32dd3cffa6b54b332948ac6a2929458defd4838f GitHub-Pull-Request: golang/go#47293 Reviewed-on: https://go-review.googlesource.com/c/go/+/335809 Reviewed-by: Robert Griesemer Trust: Robert Griesemer Trust: Than McIntosh --- diff --git a/src/go/token/position.go b/src/go/token/position.go index 0d7982c670..ce4af03923 100644 --- a/src/go/token/position.go +++ b/src/go/token/position.go @@ -540,7 +540,7 @@ func searchInts(a []int, x int) int { // TODO(gri): Remove this when compilers have caught up. i, j := 0, len(a) for i < j { - h := i + (j-i)>>1 // avoid overflow when computing h + h := int(uint(i+j) >> 1) // avoid overflow when computing h // i ≤ h < j if a[h] <= x { i = h + 1