qbit/go
1
0
Fork 0
mirror of https://github.com/golang/go synced 2024-11-18 20:44:45 -07:00
Code Releases Activity

all: calculate the median uniformly

Browse Source 
Like sort.Search, use "h := int(uint(i+j) >> 1)" style code to calculate
the median.
This commit is contained in:
Jes Cok 2023-09-07 18:22:10 +08:00
parent 3466e57354
commit e2213b7388
4 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/regexp/syntax/prog.go
View File

@ -247,7 +247,7 @@ func (i *Inst) MatchRunePos(r rune) int {
lo := 0 lo := 0
hi := len(rune) / 2 hi := len(rune) / 2
for lo < hi { for lo < hi {
m := lo + (hi-lo)/2 m := int(uint(lo+hi) >> 1)
if c := rune[2*m]; c <= r { if c := rune[2*m]; c <= r {
if r <= rune[2*m+1] { if r <= rune[2*m+1] {
return m return m

2
src/time/zoneinfo.go
View File

@ -184,7 +184,7 @@ func (l *Location) lookup(sec int64) (name string, offset int, start, end int64,
lo := 0 lo := 0
hi := len(tx) hi := len(tx)
for hi-lo > 1 { for hi-lo > 1 {
m := lo + (hi-lo)/2 m := int(uint(lo+hi) >> 1)
lim := tx[m].when lim := tx[m].when
if sec < lim { if sec < lim {
end = lim end = lim

8
src/unicode/letter.go
View File

@ -106,7 +106,7 @@ func is16(ranges []Range16, r uint16) bool {
lo := 0 lo := 0
hi := len(ranges) hi := len(ranges)
for lo < hi { for lo < hi {
m := lo + (hi-lo)/2 m := int(uint(lo+hi) >> 1)
range_ := &ranges[m] range_ := &ranges[m]
if range_.Lo <= r && r <= range_.Hi { if range_.Lo <= r && r <= range_.Hi {
return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0 return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0
@ -139,7 +139,7 @@ func is32(ranges []Range32, r uint32) bool {
lo := 0 lo := 0
hi := len(ranges) hi := len(ranges)
for lo < hi { for lo < hi {
m := lo + (hi-lo)/2 m := int(uint(lo+hi) >> 1)
range_ := ranges[m] range_ := ranges[m]
if range_.Lo <= r && r <= range_.Hi { if range_.Lo <= r && r <= range_.Hi {
return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0 return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0
@ -216,7 +216,7 @@ func to(_case int, r rune, caseRange []CaseRange) (mappedRune rune, foundMapping
lo := 0 lo := 0
hi := len(caseRange) hi := len(caseRange)
for lo < hi { for lo < hi {
m := lo + (hi-lo)/2 m := int(uint(lo+hi) >> 1)
cr := caseRange[m] cr := caseRange[m]
if rune(cr.Lo) <= r && r <= rune(cr.Hi) { if rune(cr.Lo) <= r && r <= rune(cr.Hi) {
delta := cr.Delta[_case] delta := cr.Delta[_case]
@ -350,7 +350,7 @@ func SimpleFold(r rune) rune {
lo := 0 lo := 0
hi := len(caseOrbit) hi := len(caseOrbit)
for lo < hi { for lo < hi {
m := lo + (hi-lo)/2 m := int(uint(lo+hi) >> 1)
if rune(caseOrbit[m].From) < r { if rune(caseOrbit[m].From) < r {
lo = m + 1 lo = m + 1
} else { } else {

2
src/unicode/letter_test.go
View File

@ -518,7 +518,7 @@ func binary(ranges []Range16, r uint16) bool {
lo := 0 lo := 0
hi := len(ranges) hi := len(ranges)
for lo < hi { for lo < hi {
m := lo + (hi-lo)/2 m := int(uint(lo+hi) >> 1)
range_ := &ranges[m] range_ := &ranges[m]
if range_.Lo <= r && r <= range_.Hi { if range_.Lo <= r && r <= range_.Hi {
return (r-range_.Lo)%range_.Stride == 0 return (r-range_.Lo)%range_.Stride == 0