bench: clean-up and resolve lint errors

Signed-off-by: Athan <[email protected]>

Author: kgryte

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

@@ -27,6 +27,7 @@ var pow = require( '@stdlib/math/base/special/pow' );
 var absf = require( '@stdlib/math/base/special/absf' );
 var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var PHI = require( '@stdlib/constants/float32/phi' );
+var zeros = require( '@stdlib/array/base/zeros' );
 var pkg = require( './../package.json' ).name;
 var NEGALUCAS = require( './../lib/negalucas.json' );
 var negalucasf = require( './../lib' );
@@ -63,11 +64,6 @@ bench( pkg+'::analytic', function benchmark( b ) {
 
 	x = discreteUniform( 100, -34, 0 );
 
-	function negalucasf( n ) {
-		var an = absf( n );
-		return pow( -1.0, an ) * roundf( pow( PHI, an ) );
-	}
-
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
 		y = negalucasf( x[ i % x.length ] );
@@ -81,6 +77,11 @@ bench( pkg+'::analytic', function benchmark( b ) {
 	}
 	b.pass( 'benchmark finished' );
 	b.end();
+
+	function negalucasf( n ) {
+		var an = absf( n );
+		return pow( -1.0, an ) * roundf( pow( PHI, an ) );
+	}
 });
 
 bench( pkg+'::table', function benchmark( b ) {
@@ -110,16 +111,6 @@ bench( pkg+'::naive_recursion', function benchmark( b ) {
 	var y;
 	var i;
 
-	function negalucasf( n ) {
-		if ( n === 0 ) {
-			return 2;
-		}
-		if ( n === -1 ) {
-			return -1;
-		}
-		return negalucasf( n+2 ) - negalucasf( n+1 );
-	}
-
 	x = discreteUniform( 100, -20, 0 );
 
 	b.tic();
@@ -135,6 +126,16 @@ bench( pkg+'::naive_recursion', function benchmark( b ) {
 	}
 	b.pass( 'benchmark finished' );
 	b.end();
+
+	function negalucasf( n ) {
+		if ( n === 0 ) {
+			return 2;
+		}
+		if ( n === -1 ) {
+			return -1;
+		}
+		return negalucasf( n+2 ) - negalucasf( n+1 );
+	}
 });
 
 bench( pkg+'::recursion_memoized', function benchmark( b ) {
@@ -144,11 +145,27 @@ bench( pkg+'::recursion_memoized', function benchmark( b ) {
 	var y;
 	var i;
 
-	arr = new Array( 35 );
+	arr = zeroes( 35 );
 	arr[ 0 ] = 2;
 	arr[ 1 ] = -1;
 	N = 1;
 
+	x = discreteUniform( 100, -20, 0 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = negalucasf( x[ i % x.length ] );
+		if ( isnanf( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+
 	function negalucasf( n ) {
 		var an = absf( n );
 		if ( an <= N ) {
@@ -157,8 +174,14 @@ bench( pkg+'::recursion_memoized', function benchmark( b ) {
 		arr[ an ] = negalucasf( n+2 ) - negalucasf( n+1 );
 		return arr[ an ];
 	}
+});
 
-	x = discreteUniform( 100, -20, 0 );
+bench( pkg+'::naive_iterative', function benchmark( b ) {
+	var x;
+	var y;
+	var i;
+
+	x = discreteUniform( 100, -34, 0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -173,12 +196,6 @@ bench( pkg+'::recursion_memoized', function benchmark( b ) {
 	}
 	b.pass( 'benchmark finished' );
 	b.end();
-});
-
-bench( pkg+'::naive_iterative', function benchmark( b ) {
-	var x;
-	var y;
-	var i;
 
 	function negalucasf( n ) {
 		var arr;
@@ -187,14 +204,20 @@ bench( pkg+'::naive_iterative', function benchmark( b ) {
 
 		an = absf( n );
 
-		arr = new Array( an+1 );
+		arr = zeros( an+1 );
 		arr[ 0 ] = 2;
 		arr[ 1 ] = -1;
 		for ( i = 2; i <= an; i++ ) {
 			arr[ i ] = arr[ i-2 ] - arr[ i-1 ];
 		}
 		return arr[ an ];
 	}
+});
+
+bench( pkg+'::iterative', function benchmark( b ) {
+	var x;
+	var y;
+	var i;
 
 	x = discreteUniform( 100, -34, 0 );
 
@@ -211,12 +234,6 @@ bench( pkg+'::naive_iterative', function benchmark( b ) {
 	}
 	b.pass( 'benchmark finished' );
 	b.end();
-});
-
-bench( pkg+'::iterative', function benchmark( b ) {
-	var x;
-	var y;
-	var i;
 
 	function negalucasf( n ) {
 		var an;
@@ -236,6 +253,19 @@ bench( pkg+'::iterative', function benchmark( b ) {
 		}
 		return b;
 	}
+});
+
+bench( pkg+'::iterative_memoized', function benchmark( b ) {
+	var arr;
+	var N;
+	var x;
+	var y;
+	var i;
+
+	arr = zeros( 35 );
+	arr[ 0 ] = 2;
+	arr[ 1 ] = -1;
+	N = 2;
 
 	x = discreteUniform( 100, -34, 0 );
 
@@ -252,19 +282,6 @@ bench( pkg+'::iterative', function benchmark( b ) {
 	}
 	b.pass( 'benchmark finished' );
 	b.end();
-});
-
-bench( pkg+'::iterative_memoized', function benchmark( b ) {
-	var arr;
-	var N;
-	var x;
-	var y;
-	var i;
-
-	arr = new Array( 35 );
-	arr[ 0 ] = 2;
-	arr[ 1 ] = -1;
-	N = 2;
 
 	function negalucasf( n ) {
 		var an;
@@ -279,20 +296,4 @@ bench( pkg+'::iterative_memoized', function benchmark( b ) {
 		}
 		return arr[ an ];
 	}
-
-	x = discreteUniform( 100, -34, 0 );
-
-	b.tic();
-	for ( i = 0; i < b.iterations; i++ ) {
-		y = negalucasf( x[ i % x.length ] );
-		if ( isnanf( y ) ) {
-			b.fail( 'should not return NaN' );
-		}
-	}
-	b.toc();
-	if ( isnanf( y ) ) {
-		b.fail( 'should not return NaN' );
-	}
-	b.pass( 'benchmark finished' );
-	b.end();
 });