feat: updated benchmarks with pre-computation

Author: aayush0325

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

@@ -42,7 +42,7 @@ bench( pkg, function benchmark( b ) {
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		y = cabsf( values[ i%values.length ] );
+		y = cabsf( values[ i % values.length ] );
 		if ( isnanf( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

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

@@ -51,7 +51,7 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		y = cabsf( values[ i%values.length ] );
+		y = cabsf( values[ i % values.length ] );
 		if ( isnanf( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

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

@@ -93,19 +93,22 @@ static float rand_float( void ) {
 */
 static double benchmark( void ) {
 	double elapsed;
-	float re;
-	float im;
+	float re[ 100 ];
+	float im[ 100 ];
 	float y;
 	double t;
 	int i;
 
+	for( i = 0; i < 100; i++ ){
+		re[ i ] = ( 1000.0f * rand_float() ) - 500.0f;
+		im[ i ] = ( 1000.0f * rand_float() ) - 500.0f;
+	}
+
 	stdlib_complex64_t z;
 
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
-		re = ( 1000.0f * rand_float() ) - 500.0f;
-		im = ( 1000.0f * rand_float() ) - 500.0f;
-		z = stdlib_complex64( re, im );
+		z = stdlib_complex64( re[ i % 100 ], im[ i % 100 ] );
 		y = stdlib_base_cabsf( z );
 		if ( y != y ) {
 			printf( "should not return NaN\n" );