qbit/go
1
0
Fork 0
mirror of https://github.com/golang/go synced 2024-10-03 19:31:21 -06:00
Code Releases Activity

math/big: fix binaryGCD

Browse Source 
R=rsc
CC=golang-dev
https://golang.org/cl/6297085
This commit is contained in:
Robert Griesemer 2012-06-13 10:29:06 -07:00
parent b7c5e23df0
commit f4240666be
1 changed files with 9 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
src/pkg/math/big/int.go
View File

@ -643,12 +643,13 @@ func (z *Int) GCD(x, y, a, b *Int) *Int {
return z
}
// binaryGCD sets z to the greatest common divisor of a and b, which must be
// positive, and returns z.
// binaryGCD sets z to the greatest common divisor of a and b, which both must
// be > 0, and returns z.
// See Knuth, The Art of Computer Programming, Vol. 2, Section 4.5.2, Algorithm B.
func (z *Int) binaryGCD(a, b *Int) *Int {
u := z
v := new(Int)
// use one Euclidean iteration to ensure that u and v are approx. the same size
switch {
case len(a.abs) > len(b.abs):
@ -662,6 +663,12 @@ func (z *Int) binaryGCD(a, b *Int) *Int {
v.Set(b)
}
// v might be 0 now
if len(v.abs) == 0 {
return u
}
// u > 0 && v > 0
// determine largest k such that u = u' << k, v = v' << k
k := u.abs.trailingZeroBits()
if vk := v.abs.trailingZeroBits(); vk < k {