feat: updated benchmarks with pre-computation

Author: aayush0325

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

@@ -154,7 +154,7 @@ bench( pkg+'::recursion_memoized', function benchmark( b ) {
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		x = floorf( randu() * 40.0 ); // limit upper bound
+		x = floorf( randu() * 35.0 ); // limit upper bound
 		y = lucasf( x );
 		if ( isnanf( y ) ) {
 			b.fail( 'should not return NaN' );

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

@@ -22,8 +22,7 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/base/randu' );
-var floorf = require( '@stdlib/math/base/special/floorf' );
+var randu = 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;
@@ -44,10 +43,11 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 	var y;
 	var i;
 
+	x = randu( 100, -50, 50 );
+
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		x = floorf( randu() * 34.0 );
-		y = lucasf( x );
+		y = lucasf( x[ i % 100 ] );
 		if ( isnanf( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/math/base/special/lucasf/benchmark/c/native/benchmark.c

@@ -91,15 +91,18 @@ static float rand_float( void ) {
 */
 static double benchmark( void ) {
     double elapsed;
-    int32_t x;
+    int32_t x[ 100 ];
     double t;
     float y;
     int i;
 
+	for ( i = 0 ; i < 100 ; i++ ) {
+		x[ i ] = ( int32_t )( 34.0f * rand_float() );
+	}
+
     t = tic();
     for ( i = 0; i < ITERATIONS; i++ ) {
-        x = (int32_t)( 34.0f * rand_float() );
-        y = stdlib_base_lucasf( x );
+        y = stdlib_base_lucasf( x[ i % 100 ] );
         if ( y != y ) {
             printf( "should not return NaN\n" );
             break;