chore: minor clean up

Author: Neerajpathak07

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

@@ -28,7 +28,7 @@ var roundf = require( '@stdlib/math/base/special/roundf' );
 var sqrtf = require( '@stdlib/math/base/special/sqrtf' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
-var PHI = require( '@stdlib/constants/float32/phi' );
+var FLOAT32_PHI = require( '@stdlib/constants/float32/phi' );
 var pkg = require( './../package.json' ).name;
 var FIBONACCIF = require( './../lib/fibonaccif.json' );
 var fibonaccif = require( './../lib' );
@@ -68,7 +68,7 @@ bench( pkg+'::analytic', function benchmark( b ) {
 	var i;
 
 	function fibonaccif( n ) {
-		return roundf( float64ToFloat32( pow( PHI, n ) ) / SQRT_5 );
+		return roundf( float64ToFloat32( pow( FLOAT32_PHI, n ) ) / SQRT_5 );
 	}
 
 	b.tic();
@@ -143,7 +143,7 @@ bench( pkg+'::recursion_memoized', function benchmark( b ) {
 	var y;
 	var i;
 
-	arr = new Array( 79 );
+	arr = new Array( 37 );
 	arr[ 0 ] = 0;
 	arr[ 1 ] = 1;
 	arr[ 2 ] = 1;
@@ -252,7 +252,7 @@ bench( pkg+'::iterative_memoized', function benchmark( b ) {
 	var y;
 	var i;
 
-	arr = new Array( 79 );
+	arr = new Array( 37 );
 	arr[ 0 ] = 0;
 	arr[ 1 ] = 1;
 	arr[ 2 ] = 1;
@@ -338,7 +338,7 @@ bench( pkg+'::iterative_doubling_memoized', function benchmark( b ) {
 	var y;
 	var i;
 
-	arr = new Array( 79 );
+	arr = new Array( 37 );
 	arr[ 0 ] = 0;
 	arr[ 1 ] = 1;
 	arr[ 2 ] = 1;