stdlib-js
diff --git a/‎lib/node_modules/@stdlib/math/base/special/binomcoeff/lib/main.js
Copy file name to clipboardExpand all lines: lib/node_modules/@stdlib/math/base/special/binomcoeff/lib/main.js
+16-16Lines changed: 16 additions & 16 deletions b/‎lib/node_modules/@stdlib/math/base/special/binomcoeff/lib/main.js
Copy file name to clipboardExpand all lines: lib/node_modules/@stdlib/math/base/special/binomcoeff/lib/main.js
+16-16Lines changed: 16 additions & 16 deletions
@@ -22,9 +22,9 @@
 
 var MAX_SAFE_INTEGER = require( '@stdlib/constants/float32/max-safe-integer' );
 var PINF = require( '@stdlib/constants/float32/pinf' );
-var isIntegerf = require( '@stdlib/math/base/assert/is-integer' );
-var isnanf = require( '@stdlib/math/base/assert/is-nan' );
-var isOddf = require( '@stdlib/math/base/assert/is-odd' );
+var isIntegerf = require( '@stdlib/math/base/assert/is-integerf' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var isOddf = require( '@stdlib/math/base/assert/is-oddf' );
 var floorf = require( '@stdlib/math/base/special/floorf' );
 var gcdf = require( '@stdlib/math/base/special/gcdf' );
 var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' );
@@ -78,23 +78,23 @@ function binomcoeff( n, k ) {
 		return NaN;
 	}
 	if ( k < 0 ) {
-		return float64ToFloat32( 0.0 );
+		return 0.0;
 	}
 	sgn = float64ToFloat32( 1.0 );
 	if ( n < 0 ) {
 		n = -n + k - 1;
 		if ( isOddf( k ) ) {
-			sgn *= float64ToFloat32( -1.0 );
+			sgn = float64ToFloat32( sgn * -1.0 );
 		}
 	}
 	if ( k > n ) {
-		return float64ToFloat32( 0.0 );
+		return 0.0;
 	}
 	if ( k === 0 || k === n ) {
-		return float64ToFloat32( sgn );
+		return sgn;
 	}
 	if ( k === 1 || k === n - 1 ) {
-		return float64ToFloat32( float64ToFloat32(sgn) * float64ToFloat32(n) );
+		return float64ToFloat32( sgn * n );
 	}
 	// Minimize the number of computed terms by leveraging symmetry:
 	if ( n - k < k ) {
@@ -109,13 +109,13 @@ function binomcoeff( n, k ) {
 		if ( res > s ) {
 			break;
 		}
-		res *= float64ToFloat32( n );
-		res /= float64ToFloat32( d );
+		res = float64ToFloat32( res * n );
+		res = float64ToFloat32( res / d );
 		n -= 1;
 	}
 	// If we did not early exit from the previous loop, the answer is exact, and we can simply return...
 	if ( d > k ) {
-		return float64ToFloat32( float64ToFloat32(sgn) * float64ToFloat32(res) );
+		return float64ToFloat32( sgn * res );
 	}
 	/*
 	* Let `N` equal the provided `n`.
@@ -135,7 +135,7 @@ function binomcoeff( n, k ) {
 	*/
 	b = binomcoeff( n, k-d+1 );
 	if ( b === PINF ) {
-		return float64ToFloat32( float64ToFloat32(sgn) * float64ToFloat32(b) );
+		return float64ToFloat32( sgn * float64ToFloat32( b ) );
 	}
 	c = binomcoeff( k, k-d+1 );
 
@@ -145,10 +145,10 @@ function binomcoeff( n, k ) {
 	* To help guard against overflow and precision loss, we calculate the greatest common divisor (gcdf). In this case, we pick `b`, as `b` should be less than `res` in most (if not all) cases.
 	*/
 	g = gcdf( b, c );
-	b /= g;
-	c /= g;
-	res /= c;
-	return float64ToFloat32( float64ToFloat32(sgn) * float64ToFloat32(res) * float64ToFloat32(b) );
+	b = float64ToFloat32( b / g );
+	c = float64ToFloat32( c / g );
+	res = float64ToFloat32( res / c );
+	return float64ToFloat32( sgn * res * b );
 }