chore: apply suggestions from review

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: passed
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: na
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: passed
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: passed
  - task: lint_c_examples
    status: passed
  - task: lint_c_benchmarks
    status: na
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

Author: anandkaranubc

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

@@ -147,24 +147,23 @@ for ( i = 0; i < 100; i++ ) {
 
 #### stdlib_base_minmax( x, y, &min, &max )
 
-Returns the minimum and maximum value.
+Evaluates the minimum and maximum values in a single pass.
 
 ```c
-#include <stdint.h>
+double x = 3.14;
+double y = 2.71;
 
 double min;
 double max;
-
-stdlib_base_minmax( 3.14, NaN );
-// returns [ NaN, NaN ]
+stdlib_base_minmax( x, y, &min, &max );
 ```
 
 The function accepts the following arguments:
 
--   **x**: `[in] double` input value.
--   **y**: `[in] double` input value.
--   **min**: `[out] double` destination for minimum value.
--   **max**: `[out] double` destination for maximum value.
+-   **x**: `[in] double` first number.
+-   **y**: `[in] double` second number.
+-   **min**: `[out] double` destination for the minimum value.
+-   **max**: `[out] double` destination for the maximum value.
 
 ```c
 void stdlib_base_minmax( const double x, const double y, double* min, double* max );
@@ -190,24 +189,18 @@ void stdlib_base_minmax( const double x, const double y, double* min, double* ma
 
 ```c
 #include "stdlib/math/base/special/minmax.h"
-#include <stdlib.h>
 #include <stdio.h>
 
 int main( void ) {
+    const double x[] = { 1.0, 0.45, -0.89, 0.0 / 0.0, -0.78, -0.22, 0.66, 0.11, -0.55, 0.0 };
+    const double y[] = { -0.22, 0.66, 0.0, -0.55, 0.33, 1.0, 0.0 / 0.0, 0.11, 0.45, -0.78 };
+
     double min;
     double max;
-    double x;
-    double y;
     int i;
-
-    const double x1[] = { 1.0, 0.45, -0.89, 0.0 / 0.0, -0.78, -0.22, 0.66, 0.11, -0.55, 0.0 };
-    const double x2[] = { -0.22, 0.66, 0.0, -0.55, 0.33, 1.0, 0.0 / 0.0, 0.11, 0.45, -0.78 };
-
-    for ( i = 0; i < 12; i++ ) {
-        x = ( ( (double)rand() / (double)RAND_MAX ) * 200.0 ) - 100.0;
-        y = ( ( (double)rand() / (double)RAND_MAX ) * 200.0 ) - 100.0;
+    for ( i = 0; i < 10; i++ ) {
         stdlib_base_minmax( x[ i ], y[ i ], &min, &max );
-        printf( "x: %lf => min: %lf, y: %lf, minmax(x, y): %lf\n", x[ i ], y[ i ]min, max );
+        printf( "x: %lf, y: %lf => min: %lf, max: %lf\n", x[ i ], y[ i ], min, max );
     }
 }
 ```

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

@@ -66,9 +66,6 @@ bench( pkg+':assign', function benchmark( b ) {
 	y = uniform( 100, -500.0, 500.0 );
 	out = [ 0.0, 0.0 ];
 
-	x = discreteUniform( 100, -500, 500 );
-	y = discreteUniform( 100, -500, 500 );
-
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
 		z = minmax.assign( x[ i%x.length ], y[ i%y.length ], out, 1, 0 );
@@ -95,6 +92,7 @@ bench( pkg+'::min,max', function benchmark( b ) {
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
+		// eslint-disable-next-line max-len
 		z = [ min( x[ i%x.length ], y[ i%y.length ] ), max( x[ i%x.length ], y[ i%y.length ] ) ];
 		if ( z.length !== 2 ) {
 			b.fail( 'should have expected length' );
@@ -118,9 +116,6 @@ bench( pkg+'::min,max,memory_reuse', function benchmark( b ) {
 	y = uniform( 100, -500.0, 500.0 );
 	z = [ 0.0, 0.0 ];
 
-	x = discreteUniform( 100, -500, 500 );
-	y = discreteUniform( 100, -500, 500 );
-
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
 		z[ 0 ] = min( x[ i%x.length ], y[ i%y.length ] );

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

@@ -22,10 +22,8 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
-var isArray = require( '@stdlib/assert/is-array' );
-var min = require( '@stdlib/math/base/special/min' );
-var max = require( '@stdlib/math/base/special/max' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var isFloat64Array = require( '@stdlib/assert/is-float64array' );
 var tryRequire = require( '@stdlib/utils/try-require' );
 var pkg = require( './../package.json' ).name;
 
@@ -46,70 +44,19 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 	var z;
 	var i;
 
-	x = discreteUniform( 100, -500, 500 );
-	y = discreteUniform( 100, -500, 500 );
+	x = uniform( 100, -500.0, 500.0 );
+	y = uniform( 100, -500.0, 500.0 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		z = minmax( x, y );
+		z = minmax( x[ i%x.length ], y[ i%y.length ] );
 		if ( z.length !== 2 ) {
 			b.fail( 'should have expected length' );
 		}
 	}
 	b.toc();
-	if ( !isArray( z ) ) {
-		b.fail( 'should return an array' );
-	}
-	b.pass( 'benchmark finished' );
-	b.end();
-});
-
-bench( pkg+'::min,max', opts, function benchmark( b ) {
-	var x;
-	var y;
-	var z;
-	var i;
-
-	x = discreteUniform( 100, -500, 500 );
-	y = discreteUniform( 100, -500, 500 );
-
-	b.tic();
-	for ( i = 0; i < b.iterations; i++ ) {
-		z = [ min( x, y ), max( x, y ) ];
-		if ( z.length !== 2 ) {
-			b.fail( 'should have expected length' );
-		}
-	}
-	b.toc();
-	if ( !isArray( z ) ) {
-		b.fail( 'should return an array' );
-	}
-	b.pass( 'benchmark finished' );
-	b.end();
-});
-
-bench( pkg+'::min,max,memory_reuse', opts, function benchmark( b ) {
-	var x;
-	var y;
-	var z;
-	var i;
-
-	z = [ 0.0, 0.0 ];
-
-	x = discreteUniform( 100, -500, 500 );
-	y = discreteUniform( 100, -500, 500 );
-
-	b.tic();
-	for ( i = 0; i < b.iterations; i++ ) {
-		z[ 0 ] = min( x, y );
-		z[ 1 ] = max( x, y );
-		if ( z.length !== 2 ) {
-			b.fail( 'should have expected length' );
-		}
-	}
-	b.toc();
-	if ( !isArray( z ) ) {
-		b.fail( 'should return an array' );
+	if ( !isFloat64Array( z ) ) {
+		b.fail( 'should return a Float64Array' );
 	}
 	b.pass( 'benchmark finished' );
 	b.end();

lib/node_modules/@stdlib/math/base/special/minmax/examples/c/example.c

@@ -26,9 +26,8 @@ int main( void ) {
 	double min;
 	double max;
 	int i;
-
 	for ( i = 0; i < 10; i++ ) {
 		stdlib_base_minmax( x[ i ], y[ i ], &min, &max );
-		printf( "x: %lf => min: %lf, y: %lf, minmax(x, y): %lf\n", x[ i ], y[ i ], min, max );
+		printf( "x: %lf, y: %lf => min: %lf, max: %lf\n", x[ i ], y[ i ], min, max );
 	}
 }

lib/node_modules/@stdlib/math/base/special/minmax/include/stdlib/math/base/special/minmax.h

@@ -27,7 +27,7 @@ extern "C" {
 #endif
 
 /**
-* Evaluates the minimum and maximum values.
+* Evaluates the minimum and maximum values in a single pass.
 */
 void stdlib_base_minmax( const double x, const double y, double *min, double *max );
 

lib/node_modules/@stdlib/math/base/special/minmax/src/main.c

@@ -21,12 +21,12 @@
 #include "stdlib/math/base/assert/is_negative_zero.h"
 
 /**
-* Evaluates the minimum and maximum values.
+* Evaluates the minimum and maximum values in a single pass.
 *
 * @param x      first number
 * @param y      second number
-* @param min    destination to store the minimum value
-* @param max    destination to store the maximum value
+* @param min    destination for the minimum value
+* @param max    destination for the maximum value
 *
 * @example
 * double x = 3.14;