Fix GCD.

ChangeLog-1999-07-09

+1999-06-08  David Chan <dpc29@hermes.cam.ac.uk>
+
+	* src/fn-math.c (gcd): Correct.
+
 1999-06-08  Morten Welinder  <terra@diku.dk>
 
 	* src/file.c (workbook_read): Temporarily switch to "C" locale

ChangeLog-2000-02-23

+1999-06-08  David Chan <dpc29@hermes.cam.ac.uk>
+
+	* src/fn-math.c (gcd): Correct.
+
 1999-06-08  Morten Welinder  <terra@diku.dk>
 
 	* src/file.c (workbook_read): Temporarily switch to "C" locale

OChangeLog-1999-07-09

+1999-06-08  David Chan <dpc29@hermes.cam.ac.uk>
+
+	* src/fn-math.c (gcd): Correct.
+
 1999-06-08  Morten Welinder  <terra@diku.dk>
 
 	* src/file.c (workbook_read): Temporarily switch to "C" locale

OChangeLog-2000-02-23

+1999-06-08  David Chan <dpc29@hermes.cam.ac.uk>
+
+	* src/fn-math.c (gcd): Correct.
+
 1999-06-08  Morten Welinder  <terra@diku.dk>
 
 	* src/file.c (workbook_read): Temporarily switch to "C" locale

plugins/fn-math/functions.c

@@ -37,30 +37,19 @@ static char *help_ = {
 #endif
 
 static int
-gcd(int a, int b)
+gcd (int a, int b)
 {
-        int ri, ri_1, ri_2, qi;
+	/* Euclid's Algorithm.	Assumes non-negative numbers.  */
 
-	if (b == 0)
-	        return a;
+	while (b != 0) {
+		int r;
 
-	qi = a/b;
-	ri_2 = a - qi*b;
-
-	if (ri_2 == 0)
-	        return 1;
-
-	qi = b/ri_2;
-	ri = ri_1 = b - qi*ri_2;
-
-	while (ri > 0) {
-	        qi = ri_2/ri_1;
-		ri = ri_2 - qi*ri_1;
-		ri_2 = ri_1;
-		ri_1 = ri;
+		r = a - (a / b) * b;	/* r = remainder from
+					 * dividing a by b	*/
+		a = b;
+		b = r;
 	}
-
-	return ri_2;
+	return a;
 }
 
 

src/fn-math.c

@@ -37,30 +37,19 @@ static char *help_ = {
 #endif
 
 static int
-gcd(int a, int b)
+gcd (int a, int b)
 {
-        int ri, ri_1, ri_2, qi;
+	/* Euclid's Algorithm.	Assumes non-negative numbers.  */
 
-	if (b == 0)
-	        return a;
+	while (b != 0) {
+		int r;
 
-	qi = a/b;
-	ri_2 = a - qi*b;
-
-	if (ri_2 == 0)
-	        return 1;
-
-	qi = b/ri_2;
-	ri = ri_1 = b - qi*ri_2;
-
-	while (ri > 0) {
-	        qi = ri_2/ri_1;
-		ri = ri_2 - qi*ri_1;
-		ri_2 = ri_1;
-		ri_1 = ri;
+		r = a - (a / b) * b;	/* r = remainder from
+					 * dividing a by b	*/
+		a = b;
+		b = r;
 	}
-
-	return ri_2;
+	return a;
 }
 
 

src/functions/fn-math.c

@@ -37,30 +37,19 @@ static char *help_ = {
 #endif
 
 static int
-gcd(int a, int b)
+gcd (int a, int b)
 {
-        int ri, ri_1, ri_2, qi;
+	/* Euclid's Algorithm.	Assumes non-negative numbers.  */
 
-	if (b == 0)
-	        return a;
+	while (b != 0) {
+		int r;
 
-	qi = a/b;
-	ri_2 = a - qi*b;
-
-	if (ri_2 == 0)
-	        return 1;
-
-	qi = b/ri_2;
-	ri = ri_1 = b - qi*ri_2;
-
-	while (ri > 0) {
-	        qi = ri_2/ri_1;
-		ri = ri_2 - qi*ri_1;
-		ri_2 = ri_1;
-		ri_1 = ri;
+		r = a - (a / b) * b;	/* r = remainder from
+					 * dividing a by b	*/
+		a = b;
+		b = r;
 	}
-
-	return ri_2;
+	return a;
 }