bench: fix memory leak and use double-precision utility

Author: kgryte

lib/node_modules/@stdlib/blas/ext/base/zfill/benchmark/benchmark.js

@@ -22,7 +22,7 @@
 
 var bench = require( '@stdlib/bench' );
 var uniform = require( '@stdlib/random/array/uniform' );
-var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var Complex128Array = require( '@stdlib/array/complex128' );
 var Complex128 = require( '@stdlib/complex/float64/ctor' );
@@ -70,12 +70,12 @@ function createBenchmark( len ) {
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
 			zfill( x.length, z, x, 1 );
-			if ( isnanf( xbuf[ i%(len*2) ] ) ) {
+			if ( isnan( xbuf[ i%(len*2) ] ) ) {
 				b.fail( 'should not return NaN' );
 			}
 		}
 		b.toc();
-		if ( isnanf( xbuf[ i%(len*2) ] ) ) {
+		if ( isnan( xbuf[ i%(len*2) ] ) ) {
 			b.fail( 'should not return NaN' );
 		}
 		b.pass( 'benchmark finished' );

lib/node_modules/@stdlib/blas/ext/base/zfill/benchmark/benchmark.native.js

@@ -23,7 +23,7 @@
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
 var uniform = require( '@stdlib/random/array/uniform' );
-var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var Complex128Array = require( '@stdlib/array/complex128' );
 var Complex128 = require( '@stdlib/complex/float64/ctor' );
@@ -75,12 +75,12 @@ function createBenchmark( len ) {
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
 			zfill( x.length, z, x, 1 );
-			if ( isnanf( xbuf[ i%(len*2) ] ) ) {
+			if ( isnan( xbuf[ i%(len*2) ] ) ) {
 				b.fail( 'should not return NaN' );
 			}
 		}
 		b.toc();
-		if ( isnanf( xbuf[ i%(len*2) ] ) ) {
+		if ( isnan( xbuf[ i%(len*2) ] ) ) {
 			b.fail( 'should not return NaN' );
 		}
 		b.pass( 'benchmark finished' );

lib/node_modules/@stdlib/blas/ext/base/zfill/benchmark/benchmark.ndarray.js

@@ -22,7 +22,7 @@
 
 var bench = require( '@stdlib/bench' );
 var uniform = require( '@stdlib/random/array/uniform' );
-var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var Complex128Array = require( '@stdlib/array/complex128' );
 var Complex128 = require( '@stdlib/complex/float64/ctor' );
@@ -70,12 +70,12 @@ function createBenchmark( len ) {
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
 			zfill( x.length, z, x, 1, 0 );
-			if ( isnanf( xbuf[ i%(len*2) ] ) ) {
+			if ( isnan( xbuf[ i%(len*2) ] ) ) {
 				b.fail( 'should not return NaN' );
 			}
 		}
 		b.toc();
-		if ( isnanf( xbuf[ i%(len*2) ] ) ) {
+		if ( isnan( xbuf[ i%(len*2) ] ) ) {
 			b.fail( 'should not return NaN' );
 		}
 		b.pass( 'benchmark finished' );

lib/node_modules/@stdlib/blas/ext/base/zfill/benchmark/benchmark.ndarray.native.js

@@ -23,7 +23,7 @@
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
 var uniform = require( '@stdlib/random/array/uniform' );
-var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var Complex128Array = require( '@stdlib/array/complex128' );
 var Complex128 = require( '@stdlib/complex/float64/ctor' );
@@ -75,12 +75,12 @@ function createBenchmark( len ) {
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
 			zfill( x.length, z, x, 1, 0 );
-			if ( isnanf( xbuf[ i%(len*2) ] ) ) {
+			if ( isnan( xbuf[ i%(len*2) ] ) ) {
 				b.fail( 'should not return NaN' );
 			}
 		}
 		b.toc();
-		if ( isnanf( xbuf[ i%(len*2) ] ) ) {
+		if ( isnan( xbuf[ i%(len*2) ] ) ) {
 			b.fail( 'should not return NaN' );
 		}
 		b.pass( 'benchmark finished' );

lib/node_modules/@stdlib/blas/ext/base/zfill/benchmark/c/benchmark.length.c

@@ -97,12 +97,12 @@ static double rand_double( void ) {
 */
 static double benchmark( int iterations, int len ) {
 	stdlib_complex128_t alpha;
-	double *x;
 	double elapsed;
+	double *x;
 	double t;
 	int i;
 
-	x = (double *)malloc( len*2 * sizeof( double ) );
+	x = (double *)malloc( len * 2 * sizeof( double ) );
 	alpha = stdlib_complex128( 1.0, 0.0 );
 	for ( i = 0; i < len*2; i+=2 ) {
 		x[ i ] = ( rand_double()*2.0 ) - 1.0;
@@ -120,6 +120,7 @@ static double benchmark( int iterations, int len ) {
 	if ( x[ 0 ] != x[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
 	return elapsed;
 }