Mercurial > hg > octave-lyh > gnulib-hg
changeset 3968:fd036b5fd367
Change argument type to 'unsigned long'.
author | Bruno Haible <bruno@clisp.org> |
---|---|
date | Wed, 06 Nov 2002 18:25:27 +0000 |
parents | e8562282a2d0 |
children | f9f4c9631e62 |
files | lib/ChangeLog lib/gcd.c lib/gcd.h |
diffstat | 3 files changed, 14 insertions(+), 9 deletions(-) [+] |
line wrap: on
line diff
--- a/lib/ChangeLog +++ b/lib/ChangeLog @@ -1,3 +1,8 @@ +2002-11-06 Bruno Haible <bruno@clisp.org> + + * gcd.h (gcd): Change argument type to 'unsigned long'. + * gcd.c (gcd): Likewise. + 2002-11-05 Bruno Haible <bruno@clisp.org> * gcd.h: New file, from gettext-0.11.5.
--- a/lib/gcd.c +++ b/lib/gcd.c @@ -1,6 +1,6 @@ /* Arithmetic. - Copyright (C) 2001 Free Software Foundation, Inc. - Written by Bruno Haible <haible@clisp.cons.org>, 2001. + Copyright (C) 2001-2002 Free Software Foundation, Inc. + Written by Bruno Haible <bruno@clisp.org>, 2001. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -22,10 +22,10 @@ #include <stdlib.h> /* Return the greatest common divisor of a > 0 and b > 0. */ -unsigned int +unsigned long gcd (a, b) - unsigned int a; - unsigned int b; + unsigned long a; + unsigned long b; { /* Why no division, as in Euclid's algorithm? Because in Euclid's algorithm the division result floor(a/b) or floor(b/a) is very often = 1 or = 2, @@ -35,7 +35,7 @@ bit in a single instruction, and the algorithm uses fewer variables than Euclid's algorithm. */ - unsigned int c = a | b; + unsigned long c = a | b; c = c ^ (c - 1); /* c = largest power of 2 that divides a and b. */
--- a/lib/gcd.h +++ b/lib/gcd.h @@ -1,6 +1,6 @@ /* Arithmetic. - Copyright (C) 2001 Free Software Foundation, Inc. - Written by Bruno Haible <haible@clisp.cons.org>, 2001. + Copyright (C) 2001-2002 Free Software Foundation, Inc. + Written by Bruno Haible <bruno@clisp.org>, 2001. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -28,6 +28,6 @@ #endif /* Return the greatest common divisor of a > 0 and b > 0. */ -extern unsigned int gcd PARAMS ((unsigned int a, unsigned int b)); +extern unsigned long gcd PARAMS ((unsigned long a, unsigned long b)); #endif /* _GCD_H */