chores

Author: DivyanshuVortex

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

@@ -25,7 +25,7 @@ var isIntegerf = require( '@stdlib/math/base/assert/is-integerf' );
 var gamma = require( '@stdlib/math/base/special/gamma' );
 var PINF = require( '@stdlib/constants/float32/pinf' );
 var FLOAT32_MAX_NTH_FACTORIAL = require( '@stdlib/constants/float32/max-nth-factorial' );
-var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' );
+var f32 = require( '@stdlib/number/float64/base/to-float32' );
 var FACTORIALS = require( './factorials.json' );
 
 
@@ -70,7 +70,7 @@ var FACTORIALS = require( './factorials.json' );
 * // returns NaN
 */
 function factorialf( x ) {
-	x = float64ToFloat32( x );
+	x = f32( x );
 	if ( isnanf( x ) ) {
 		return NaN;
 	}
@@ -79,11 +79,11 @@ function factorialf( x ) {
 			return NaN;
 		}
 		if ( x <= FLOAT32_MAX_NTH_FACTORIAL ) {
-			return float64ToFloat32( FACTORIALS[ x|0 ] );
+			return f32( FACTORIALS[ x|0 ] );
 		}
 		return PINF;
 	}
-	return float64ToFloat32( gamma( x + 1.0 ) );
+	return f32( gamma( x + 1.0 ) );
 }
 
 

lib/node_modules/@stdlib/math/base/special/factorialf/test/test.js

@@ -23,7 +23,7 @@
 var tape = require( 'tape' );
 var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var incrspace = require( '@stdlib/array/base/incrspace' );
-var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' );
+var f32 = require( '@stdlib/number/float64/base/to-float32' );
 var isAlmostSameValue = require( '@stdlib/number/float32/base/assert/is-almost-same-value' );
 var PINF = require( '@stdlib/constants/float32/pinf' );
 var NINF = require( '@stdlib/constants/float32/ninf' );
@@ -101,7 +101,7 @@ tape( 'the function evaluates the factorial function (positive integers < 35)',
 			continue;
 		}
 		v = factorialf( x[ i ] );
-		t.strictEqual( isAlmostSameValue( v, float64ToFloat32( expected[ i ] ), 1 ), true, 'returns expected value when provided ' + x[ i ] + '. Value: ' + v + '. Expected: ' + expected[ i ] + '.' );
+		t.strictEqual( isAlmostSameValue( v, f32( expected[ i ] ), 1 ), true, 'returns expected value when provided ' + x[ i ] + '. Value: ' + v + '. Expected: ' + expected[ i ] + '.' );
 	}
 	t.end();
 });
@@ -127,18 +127,18 @@ tape( 'the function evaluates the factorial function (decimal values)', function
 	for ( i = 0; i < x.length; i++ ) {
 		v = factorialf( x[ i ] );
 		if ( isnanf( v ) ) {
-			t.strictEqual( isnanf( v ), isnanf( float64ToFloat32( expected[ i ] ) ), 'returns NaN for x='+x[i] );
+			t.strictEqual( isnanf( v ), isnanf( f32( expected[ i ] ) ), 'returns NaN for x='+x[i] );
 			continue;
 		}
 		if ( v === PINF ) {
 			t.strictEqual( v, PINF, 'returns Infinity for x='+x[i] );
 			continue;
 		}
-		if ( v === 0.0 && float64ToFloat32( expected[ i ] ) === 0.0 ) {
+		if ( v === 0.0 && f32( expected[ i ] ) === 0.0 ) {
 			t.strictEqual( v, 0.0, 'returns 0.0 for x=' + x[ i ] );
 			continue;
 		}
-		t.strictEqual( isAlmostSameValue( v, float64ToFloat32( expected[ i ] ), 3000 ), true, 'within tolerance. x: ' + x[ i ] + '. Value: ' + v + '. Expected: ' + expected[ i ] + '.' );
+		t.strictEqual( isAlmostSameValue( v, f32( expected[ i ] ), 3000 ), true, 'within tolerance. x: ' + x[ i ] + '. Value: ' + v + '. Expected: ' + expected[ i ] + '.' );
 	}
 	t.end();
 });

lib/node_modules/@stdlib/math/base/special/factorialf/test/test.native.js

@@ -24,7 +24,7 @@ var resolve = require( 'path' ).resolve;
 var tape = require( 'tape' );
 var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var incrspace = require( '@stdlib/array/base/incrspace' );
-var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' );
+var f32 = require( '@stdlib/number/float64/base/to-float32' );
 var isAlmostSameValue = require( '@stdlib/number/float32/base/assert/is-almost-same-value' );
 var PINF = require( '@stdlib/constants/float32/pinf' );
 var NINF = require( '@stdlib/constants/float32/ninf' );
@@ -112,7 +112,7 @@ tape( 'the function evaluates the factorial function (positive integers < 35)',
 			continue;
 		}
 		v = factorialf( x[ i ] );
-		t.strictEqual( isAlmostSameValue( v, float64ToFloat32( expected[ i ] ), 1 ), true, 'returns expected value when provided ' + x[ i ] + '. Value: ' + v + '. Expected: ' + expected[ i ] + '.' );
+		t.strictEqual( isAlmostSameValue( v, f32( expected[ i ] ), 1 ), true, 'returns expected value when provided ' + x[ i ] + '. Value: ' + v + '. Expected: ' + expected[ i ] + '.' );
 	}
 	t.end();
 });
@@ -138,18 +138,18 @@ tape( 'the function evaluates the factorial function (decimal values)', opts, fu
 	for ( i = 0; i < x.length; i++ ) {
 		v = factorialf( x[ i ] );
 		if ( isnanf( v ) ) {
-			t.strictEqual( isnanf( v ), isnanf( float64ToFloat32( expected[ i ] ) ), 'returns NaN for x='+x[i] );
+			t.strictEqual( isnanf( v ), isnanf( f32( expected[ i ] ) ), 'returns NaN for x='+x[i] );
 			continue;
 		}
 		if ( v === PINF ) {
 			t.strictEqual( v, PINF, 'returns Infinity for x='+x[i] );
 			continue;
 		}
-		if ( v === 0.0 && float64ToFloat32( expected[ i ] ) === 0.0 ) {
+		if ( v === 0.0 && f32( expected[ i ] ) === 0.0 ) {
 			t.strictEqual( v, 0.0, 'returns 0.0 for x=' + x[ i ] );
 			continue;
 		}
-		t.strictEqual( isAlmostSameValue( v, float64ToFloat32( expected[ i ] ), 3000 ), true, 'within tolerance. x: ' + x[ i ] + '. Value: ' + v + '. Expected: ' + expected[ i ] + '.' );
+		t.strictEqual( isAlmostSameValue( v, f32( expected[ i ] ), 3000 ), true, 'within tolerance. x: ' + x[ i ] + '. Value: ' + v + '. Expected: ' + expected[ i ] + '.' );
 	}
 	t.end();
 });