chore: stuff from code review

Author: aayush0325

lib/node_modules/@stdlib/math/base/special/lcmf/benchmark/benchmark.js

@@ -40,7 +40,7 @@ bench( pkg, function benchmark( b ) {
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		z = lcmf( x[ i%x.length ], y[ i%y.length ] );
+		z = lcmf( x[ i % x.length ], y[ i % y.length ] );
 		if ( isnanf( z ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/math/base/special/lcmf/benchmark/benchmark.native.js

@@ -49,7 +49,7 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		z = lcmf( x[ i%x.length ], y[ i%y.length ] );
+		z = lcmf( x[ i % x.length ], y[ i % y.length ] );
 		if ( isnanf( z ) ) {
 			b.fail( 'should not return NaN' );
 		}

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

@@ -28,7 +28,7 @@
 * @return     least common multiple
 *
 * @example
-* float out = stdlib_base_lcmf( 21.0f, 6.0f );
+* double out = stdlib_base_lcmf( 21.0f, 6.0f );
 * // returns 42.0f
 */
 float stdlib_base_lcmf( const float a, const float b ) {
@@ -49,7 +49,6 @@ float stdlib_base_lcmf( const float a, const float b ) {
 	} else {
 		bn = b;
 	}
-
 	// Note: we rely on `gcdf` to perform further argument validation...
 	d = stdlib_base_gcdf( an, bn );
 	if ( stdlib_base_is_nanf( d ) ) {