bench: update random value generation

Author: hrshya

lib/node_modules/@stdlib/math/base/special/negalucasf/README.md

@@ -18,7 +18,7 @@ limitations under the License.
 
 -->
 
-# negaLucas
+# negaLucasf
 
 > Compute the nth [negaLucas number][lucas-number] in single-precision floating-point format.
 

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

@@ -21,7 +21,7 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/array/discrete-uniform' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
 var roundf = require( '@stdlib/math/base/special/roundf' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var absf = require( '@stdlib/math/base/special/absf' );
@@ -39,7 +39,7 @@ bench( pkg, function benchmark( b ) {
 	var y;
 	var i;
 
-	x = randu( 100, -34, 0 );
+	x = discreteUniform( 100, -34, 0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -61,7 +61,7 @@ bench( pkg+'::analytic', function benchmark( b ) {
 	var y;
 	var i;
 
-	x = randu( 100, -34, 0 );
+	x = discreteUniform( 100, -34, 0 );
 
 	function negalucasf( n ) {
 		var an = absf( n );
@@ -88,7 +88,7 @@ bench( pkg+'::table', function benchmark( b ) {
 	var y;
 	var i;
 
-	x = randu( 100, -34, 0 );
+	x = discreteUniform( 100, -34, 0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -120,7 +120,7 @@ bench( pkg+'::naive_recursion', function benchmark( b ) {
 		return negalucasf( n+2 ) - negalucasf( n+1 );
 	}
 
-	x = randu( 100, -20, 0 );
+	x = discreteUniform( 100, -20, 0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -158,7 +158,7 @@ bench( pkg+'::recursion_memoized', function benchmark( b ) {
 		return arr[ an ];
 	}
 
-	x = randu( 100, -20, 0 );
+	x = discreteUniform( 100, -20, 0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -196,7 +196,7 @@ bench( pkg+'::naive_iterative', function benchmark( b ) {
 		return arr[ an ];
 	}
 
-	x = randu( 100, -34, 0 );
+	x = discreteUniform( 100, -34, 0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -237,7 +237,7 @@ bench( pkg+'::iterative', function benchmark( b ) {
 		return b;
 	}
 
-	x = randu( 100, -34, 0 );
+	x = discreteUniform( 100, -34, 0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -280,7 +280,7 @@ bench( pkg+'::iterative_memoized', function benchmark( b ) {
 		return arr[ an ];
 	}
 
-	x = randu( 100, -34, 0 );
+	x = discreteUniform( 100, -34, 0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {

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

@@ -22,7 +22,7 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/array/discrete-uniform' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
 var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var tryRequire = require( '@stdlib/utils/try-require' );
 var pkg = require( './../package.json' ).name;
@@ -43,7 +43,7 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 	var y;
 	var i;
 
-	x = randu( 100, -34, 0 );
+	x = discreteUniform( 100, -34, 0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {

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

@@ -46,30 +46,30 @@ tape( 'if provided a positive number, the function returns `NaN`', function test
 	var v;
 	var i;
 
-	t.strictEqual( isnanf( negalucasf( 3.14 ) ), true, 'returns NaN' );
+	t.strictEqual( isnanf( negalucasf( 3.14 ) ), true, 'returns expected value' );
 
 	for ( i = 1; i < 100; i++ ) {
 		v = negalucasf( i );
-		t.strictEqual( isnanf( v ), true, 'returns NaN when provided ' + i );
+		t.strictEqual( isnanf( v ), true, 'returns expected value when provided ' + i );
 	}
 	t.end();
 });
 
 tape( 'if provided negative infinity, the function returns `NaN`', function test( t ) {
 	var v = negalucasf( NINF );
-	t.strictEqual( isnanf( v ), true, 'returns NaN when provided -infinity' );
+	t.strictEqual( isnanf( v ), true, 'returns expected value' );
 	t.end();
 });
 
 tape( 'if provided `NaN`, the function returns `NaN`', function test( t ) {
 	var v = negalucasf( NaN );
-	t.strictEqual( isnanf( v ), true, 'returns NaN when provided a NaN' );
+	t.strictEqual( isnanf( v ), true, 'returns expected value' );
 	t.end();
 });
 
 tape( 'if provided a non-integer, the function returns `NaN`', function test( t ) {
 	var v = negalucasf( -3.14 );
-	t.strictEqual( isnanf( v ), true, 'returns NaN' );
+	t.strictEqual( isnanf( v ), true, 'returns expected value' );
 	t.end();
 });
 
@@ -100,7 +100,7 @@ tape( 'if provided nonpositive integers less than `-34`, the function returns `N
 	var v;
 	for ( i = -35; i > -500; i-- ) {
 		v = negalucasf( i );
-		t.strictEqual( isnanf( v ), true, 'returns NaN when provided ' + i );
+		t.strictEqual( isnanf( v ), true, 'returns expected value when provided ' + i );
 	}
 	t.end();
 });

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

@@ -56,7 +56,7 @@ tape( 'if provided a positive number, the function returns `NaN`', opts, functio
 
 	for ( i = 1; i < 100; i++ ) {
 		v = negalucasf( i );
-		t.strictEqual( isnanf( v ), true, 'returns NaN when provided ' + i );
+		t.strictEqual( isnanf( v ), true, 'returns expected value when provided ' + i );
 	}
 	t.end();
 });
@@ -88,7 +88,7 @@ tape( 'if provided nonpositive integers less than `-34`, the function returns `N
 	var v;
 	for ( i = -35; i > -500; i-- ) {
 		v = negalucasf( i );
-		t.strictEqual( isnanf( v ), true, 'returns NaN when provided ' + i );
+		t.strictEqual( isnanf( v ), true, 'returns expected value when provided ' + i );
 	}
 	t.end();
 });