qbit/go
1
0
Fork 0
mirror of https://github.com/golang/go synced 2024-11-19 17:24:41 -07:00
Code Releases Activity

big: removed some gratuitous +/-1's

Browse Source 
R=mtj, bradfitz
CC=golang-dev
https://golang.org/cl/4584046
This commit is contained in:
Robert Griesemer 2011-06-08 11:24:24 -07:00
parent 636c5fac2d
commit 2de06655f1
1 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
src/pkg/big/nat.go
View File

@ -764,13 +764,12 @@ func (x nat) string(charset string) string {
if b == b&-b { if b == b&-b {
// shift is base-b digit size in bits // shift is base-b digit size in bits
shift := uint(trailingZeroBits(b)) // shift > 0 because b >= 2 shift := uint(trailingZeroBits(b)) // shift > 0 because b >= 2
m := len(x)
mask := Word(1)<<shift - 1 mask := Word(1)<<shift - 1
w := x[0] w := x[0]
nbits := uint(_W) // number of unprocessed bits in w nbits := uint(_W) // number of unprocessed bits in w
// convert less-significant words // convert less-significant words
for k := 0; k < m-1; k++ { for k := 1; k < len(x); k++ {
// convert full digits // convert full digits
for nbits >= shift { for nbits >= shift {
i-- i--
@ -782,16 +781,16 @@ func (x nat) string(charset string) string {
// convert any partial leading digit and advance to next word // convert any partial leading digit and advance to next word
if nbits == 0 { if nbits == 0 {
// no partial digit remaining, just advance // no partial digit remaining, just advance
w = x[k+1] w = x[k]
nbits = _W nbits = _W
} else { } else {
// partial digit in current (k) and next (k+1) word // partial digit in current (k-1) and next (k) word
w |= x[k+1] << nbits w |= x[k] << nbits
i-- i--
s[i] = charset[w&mask] s[i] = charset[w&mask]
// advance // advance
w = x[k+1] >> (shift - nbits) w = x[k] >> (shift - nbits)
nbits = _W - (shift - nbits) nbits = _W - (shift - nbits)
} }
} }