feat: updated code using fmodf

Author: aayush0325

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

@@ -38,7 +38,7 @@
       "dependencies": [
         "@stdlib/math/base/napi/binary",
         "@stdlib/math/base/assert/is-nanf",
-        "@stdlib/math/base/special/fmod",
+        "@stdlib/math/base/special/fmodf",
         "@stdlib/math/base/assert/is-integerf",
         "@stdlib/constants/float32/pinf",
         "@stdlib/constants/float32/ninf"
@@ -56,7 +56,7 @@
       "libpath": [],
       "dependencies": [
         "@stdlib/math/base/assert/is-nanf",
-        "@stdlib/math/base/special/fmod",
+        "@stdlib/math/base/special/fmodf",
         "@stdlib/math/base/assert/is-integerf",
         "@stdlib/constants/float32/pinf",
         "@stdlib/constants/float32/ninf"
@@ -74,7 +74,7 @@
       "libpath": [],
       "dependencies": [
         "@stdlib/math/base/assert/is-nanf",
-        "@stdlib/math/base/special/fmod",
+        "@stdlib/math/base/special/fmodf",
         "@stdlib/math/base/assert/is-integerf",
         "@stdlib/constants/float32/pinf",
         "@stdlib/constants/float32/ninf"

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

@@ -17,11 +17,11 @@
 */
 
 #include "stdlib/math/base/special/gcdf.h"
-#include "stdlib/math/base/special/fmod.h"
+#include "stdlib/math/base/special/fmodf.h"
 #include "stdlib/math/base/assert/is_nanf.h"
 #include "stdlib/math/base/assert/is_integerf.h"
 #include "stdlib/constants/float32/pinf.h"
-#include "stdlib//constants/float32/ninf.h"
+#include "stdlib/constants/float32/ninf.h"
 #include <stdint.h>
 
 // 2^32 - 1
@@ -56,19 +56,19 @@ static float largeIntegersf( const float a, const float 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 ( stdlib_base_fmod( ac, 2.0 ) == 0.0 && stdlib_base_fmod( bc, 2.0 ) == 0.0 ) {
+	while ( stdlib_base_fmodf( ac, 2.0 ) == 0.0 && stdlib_base_fmodf(f 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 ( stdlib_base_fmod( ac, 2.0 ) == 0.0 ) {
+	while ( stdlib_base_fmodf( 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 ( stdlib_base_fmod( bc, 2.0 ) == 0.0 ) {
+		while ( stdlib_base_fmodf( 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)...