refactor: update benchmark, add f suffixes, missing spaces in math/base/special/gcdf

PR-URL: #3121
Ref: f8bcfd8
Private-ref: stdlib-js/todo#2301
Co-authored-by: Athan Reines <[email protected]>
Reviewed-by: Athan Reines <[email protected]> 
Signed-off-by: Athan Reines <[email protected]>

Author: gunjjoshi

lib/node_modules/@stdlib/math/base/special/gcdf/README.md

@@ -20,7 +20,7 @@ limitations under the License.
 
 # gcdf
 
-> Compute the [greatest common divisor][gcd] (gcd) of two single-precision floating point numbers.
+> Compute the [greatest common divisor][gcd] (gcd) of two single-precision floating-point numbers.
 
 <!-- Section to include introductory text. Make sure to keep an empty line after the intro `section` element and another before the `/section` close. -->
 
@@ -44,7 +44,7 @@ var gcdf = require( '@stdlib/math/base/special/gcdf' );
 
 #### gcdf( a, b )
 
-Computes the [greatest common divisor][gcd] (gcd).
+Computes the [greatest common divisor][gcd] (gcd) of two single-precision floating-point numbers.
 
 ```javascript
 var v = gcdf( 48, 18 );
@@ -139,7 +139,7 @@ for ( i = 0; i < a.length; i++ ) {
 
 #### stdlib_base_gcdf( a, b )
 
-Computes the greatest common divisor (gcd).
+Computes the greatest common divisor (gcd) of two single-precision floating-point numbers.
 
 ```c
 float v = stdlib_base_gcdf( 48.0f, 18.0f );

lib/node_modules/@stdlib/math/base/special/gcdf/benchmark/c/native/benchmark.c

@@ -91,17 +91,20 @@ static float rand_float( void ) {
 */
 static double benchmark( void ) {
 	double elapsed;
-	float a;
-	float b;
-	float y;
+	float a[ 100 ];
+	float b[ 100 ];
 	double t;
+	float y;
 	int i;
 
+	for ( i = 0; i < 100; i++ ) {
+		a[ i ] = roundf( 500.0f * rand_float() );
+		b[ i ] = roundf( 500.0f * rand_float() );
+	}
+
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
-		a = round( 500.0f * rand_float() );
-		b = round( 500.0f * rand_float() );
-		y = stdlib_base_gcdf( a, b );
+		y = stdlib_base_gcdf( a[ i % 100 ], b[ i % 100 ] );
 		if ( y != y ) {
 			printf( "should not return NaN\n" );
 			break;

lib/node_modules/@stdlib/math/base/special/gcdf/docs/repl.txt

@@ -1,7 +1,7 @@
 
 {{alias}}( a, b )
     Computes the greatest common divisor (gcd) of two single-precision
-    floating point numbers.
+    floating-point numbers.
 
     If both `a` and `b` are `0`, the function returns `0`.
 

lib/node_modules/@stdlib/math/base/special/gcdf/docs/types/index.d.ts

@@ -19,7 +19,7 @@
 // TypeScript Version: 4.1
 
 /**
-* Computes the greatest common divisor (gcd) of two single-precision floating point numbers.
+* Computes the greatest common divisor (gcd) of two single-precision floating-point numbers.
 *
 * ## Notes
 *

lib/node_modules/@stdlib/math/base/special/gcdf/include/stdlib/math/base/special/gcdf.h

@@ -27,7 +27,7 @@ extern "C" {
 #endif
 
 /**
-* Computes the greatest common divisor (gcd) of two single-precision floating point numbers.
+* Computes the greatest common divisor (gcd) of two single-precision floating-point numbers.
 */
 float stdlib_base_gcdf( const float a, const float b );
 

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

@@ -19,7 +19,7 @@
 'use strict';
 
 /**
-* Computes the greatest common divisor (gcd) of two single-precision floating point numbers using the binary GCD algorithm.
+* Computes the greatest common divisor (gcd) of two single-precision floating-point numbers using the binary GCD algorithm.
 *
 * ## References
 *
@@ -33,7 +33,7 @@
 * @returns {integer} greatest common divisor
 *
 * @example
-* var v = gcdf( 16777216.0, 65536.0 );
+* var v = gcdf( 16777216, 65536 );
 * // returns 65536
 */
 function gcdf( a, b ) {
@@ -47,22 +47,26 @@ function gcdf( a, b ) {
 	if ( b === 0 ) {
 		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 ( a % 2 === 0 && 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 ( 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 ( 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)...
 		if ( a > b ) {
 			t = b;
@@ -71,6 +75,7 @@ function gcdf( a, b ) {
 		}
 		b -= a; // b=0 iff b=a
 	}
+
 	// Restore common factors of 2...
 	return k * a;
 }

lib/node_modules/@stdlib/math/base/special/gcdf/lib/bitwise_binary_gcd.js

@@ -19,7 +19,7 @@
 'use strict';
 
 /**
-* Computes the greatest common divisor (gcd) of two single-precision floating point numbers using the binary GCD algorithm and bitwise operations.
+* Computes the greatest common divisor (gcd) of two single-precision floating-point numbers using the binary GCD algorithm and bitwise operations.
 *
 * ## References
 *
@@ -47,22 +47,26 @@ function gcdf( a, b ) {
 	if ( b === 0 ) {
 		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 & 1) === 0 && (b & 1) === 0 ) {
+	while ( ( a & 1 ) === 0 && ( b & 1 ) === 0 ) {
 		a >>>= 1; // right shift
 		b >>>= 1; // right shift
 		k += 1;
 	}
+
 	// Reduce `a` to an odd number...
-	while ( (a & 1) === 0 ) {
+	while ( ( a & 1 ) === 0 ) {
 		a >>>= 1; // right shift
 	}
+
 	// Henceforth, `a` is always odd...
 	while ( b ) {
 		// Remove all factors of 2 in `b`, as they are not common...
-		while ( (b & 1) === 0 ) {
+		while ( ( b & 1 ) === 0 ) {
 			b >>>= 1; // 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)...
 		if ( a > b ) {
 			t = b;
@@ -71,6 +75,7 @@ function gcdf( a, b ) {
 		}
 		b -= a; // b=0 iff b=a
 	}
+
 	// Restore common factors of 2...
 	return a << k;
 }

lib/node_modules/@stdlib/math/base/special/gcdf/lib/index.js

@@ -19,7 +19,7 @@
 'use strict';
 
 /**
-* Compute the greatest common divisor (gcd) of two single-precision floating point numbers.
+* Compute the greatest common divisor (gcd) of two single-precision floating-point numbers.
 *
 * @module @stdlib/math/base/special/gcdf
 *

lib/node_modules/@stdlib/math/base/special/gcdf/lib/main.js

@@ -32,7 +32,7 @@ var largeIntegersf = require( './binary_gcd.js' );
 // MAIN //
 
 /**
-* Computes the greatest common divisor (gcd) of two single-precision floating point numbers.
+* Computes the greatest common divisor (gcd) of two single-precision floating-point numbers.
 *
 * @param {integer} a - first number
 * @param {integer} b - second number

lib/node_modules/@stdlib/math/base/special/gcdf/lib/native.js

@@ -26,7 +26,7 @@ var addon = require( './../src/addon.node' );
 // MAIN //
 
 /**
-* Computes the greatest common divisor (gcd) of two single-precision floating point numbers.
+* Computes the greatest common divisor (gcd) of two single-precision floating-point numbers.
 *
 * @private
 * @param {number} a - first number