refactor: use stdlib fmod instead of built-in

Author: gunjjoshi

lib/node_modules/@stdlib/math/base/special/gcd/lib/binary_gcd.js

@@ -18,6 +18,10 @@
 
 'use strict';
 
+// MODULES //
+
+var fmod = require( '@stdlib/math/base/special/fmod' );
+
 /**
 * Computes the greatest common divisor (gcd) using the binary GCD algorithm.
 *
@@ -48,19 +52,19 @@ function gcd( a, b ) {
 		return a;
 	}
 	// Reduce `a` and/or `b` to odd numbers and keep track of the greatest power of 2 dividing both `a` and `b`...
-	while ( a%2 === 0 && b%2 === 0 ) {
+	while ( fmod( a, 2 ) === 0 && fmod( b, 2 ) === 0 ) {
 		a /= 2; // right shift
 		b /= 2; // right shift
 		k *= 2; // left shift
 	}
 	// Reduce `a` to an odd number...
-	while ( a%2 === 0 ) {
+	while ( fmod( a, 2 ) === 0 ) {
 		a /= 2; // right shift
 	}
 	// Henceforth, `a` is always odd...
 	while ( b ) {
 		// Remove all factors of 2 in `b`, as they are not common...
-		while ( b%2 === 0 ) {
+		while ( fmod( b, 2 ) === 0 ) {
 			b /= 2; // right shift
 		}
 		// `a` and `b` are both odd. Swap values such that `b` is the larger of the two values, and then set `b` to the difference (which is even)...

lib/node_modules/@stdlib/math/base/special/gcd/manifest.json

@@ -38,6 +38,7 @@
       "dependencies": [
         "@stdlib/math/base/napi/binary",
         "@stdlib/math/base/assert/is-nan",
+        "@stdlib/math/base/special/fmod",
         "@stdlib/math/base/assert/is-integer",
         "@stdlib/constants/float64/pinf",
         "@stdlib/constants/float64/ninf"
@@ -55,6 +56,7 @@
       "libpath": [],
       "dependencies": [
         "@stdlib/math/base/assert/is-nan",
+        "@stdlib/math/base/special/fmod",
         "@stdlib/math/base/assert/is-integer",
         "@stdlib/constants/float64/pinf",
         "@stdlib/constants/float64/ninf"
@@ -72,6 +74,7 @@
       "libpath": [],
       "dependencies": [
         "@stdlib/math/base/assert/is-nan",
+        "@stdlib/math/base/special/fmod",
         "@stdlib/math/base/assert/is-integer",
         "@stdlib/constants/float64/pinf",
         "@stdlib/constants/float64/ninf"

lib/node_modules/@stdlib/math/base/special/gcd/src/main.c

@@ -17,12 +17,12 @@
 */
 
 #include "stdlib/math/base/special/gcd.h"
+#include "stdlib/math/base/special/fmod.h"
 #include "stdlib/math/base/assert/is_nan.h"
 #include "stdlib/math/base/assert/is_integer.h"
 #include "stdlib/constants/float64/pinf.h"
 #include "stdlib//constants/float64/ninf.h"
 #include <stdint.h>
-#include <math.h>
 
 // 2^63 - 1
 static const int64_t STDLIB_CONSTANT_INT64_MAX = 9223372036854775807;
@@ -56,19 +56,19 @@ static double largeIntegers( const double a, const double b ) {
 	k = 1.0;
 
 	// Reduce `a` and/or `b` to odd numbers and keep track of the greatest power of 2 dividing both `a` and `b`...
-	while ( fmod( ac, 2.0 ) == 0.0 && fmod( bc, 2.0 ) == 0.0 ) {
+	while ( stdlib_base_fmod( ac, 2.0 ) == 0.0 && stdlib_base_fmod( bc, 2.0 ) == 0.0 ) {
 		ac /= 2.0; // right shift
 		bc /= 2.0; // right shift
 		k *= 2.0; // left shift
 	}
 	// Reduce `a` to an odd number...
-	while ( fmod( ac, 2.0 ) == 0.0 ) {
+	while ( stdlib_base_fmod( ac, 2.0 ) == 0.0 ) {
 		ac /= 2.0; // right shift
 	}
 	// Henceforth, `a` is always odd...
 	while ( bc ) {
 		// Remove all factors of 2 in `b`, as they are not common...
-		while ( fmod( bc, 2.0 ) == 0.0 ) {
+		while ( stdlib_base_fmod( bc, 2.0 ) == 0.0 ) {
 			bc /= 2.0; // right shift
 		}
 		// `a` and `b` are both odd. Swap values such that `b` is the larger of the two values, and then set `b` to the difference (which is even)...