Auto-generated commit

Author: stdlib-bot

contains/benchmark/benchmark.length.js

@@ -63,7 +63,7 @@ function createBenchmark( fcn, len ) {
 			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a value.
 			x[ len-2 ] = randu();
 			bool = fcn( x, len-1 );
-			if ( !isBoolean( bool ) ) {
+			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
 			}
 		}

has-arraybuffer-support/benchmark/benchmark.js

@@ -36,7 +36,7 @@ bench( pkg, function benchmark( b ) {
 	for ( i = 0; i < b.iterations; i++ ) {
 		// Note: the following *could* be optimized away via loop-invariant code motion. If so, the entire loop will disappear.
 		bool = hasArrayBufferSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

is-array-array/benchmark/benchmark.js

@@ -61,7 +61,7 @@ function createBenchmark( len ) {
 			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a failing value.
 			x[ len-1 ] = i;
 			bool = isArrayArray( x );
-			if ( !isBoolean( bool ) ) {
+			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
 			}
 		}

is-between-array/benchmark/benchmark.js

@@ -62,7 +62,7 @@ function createBenchmark( len ) {
 			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a failing value.
 			x[ len-1 ] = i;
 			bool = isBetweenArray( x, 0.0, 1.0 );
-			if ( !isBoolean( bool ) ) {
+			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
 			}
 		}

is-binary-string/benchmark/benchmark.js

@@ -64,7 +64,7 @@ function createBenchmark( len ) {
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
 			bool = isBinaryString( str + (i%10) );
-			if ( !isBoolean( bool ) ) {
+			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
 			}
 		}

is-boolean-array/benchmark/benchmark.js

@@ -79,7 +79,7 @@ function createBenchmark( fcn, len, primitives ) {
 			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a failing value.
 			x[ len-1 ] = i;
 			bool = fcn( x );
-			if ( !isBoolean( bool ) ) {
+			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
 			}
 		}

is-falsy-array/benchmark/benchmark.js

@@ -61,7 +61,7 @@ function createBenchmark( len ) {
 			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a failing value.
 			x[ len-1 ] = i;
 			bool = isFalsyArray( x );
-			if ( !isBoolean( bool ) ) {
+			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
 			}
 		}

is-finite-array/benchmark/benchmark.js

@@ -72,7 +72,7 @@ function createBenchmark( fcn, len, primitives ) {
 		for ( i = 0; i < b.iterations; i++ ) {
 			x[ len-2 ] = i * 3.14;
 			bool = fcn( x );
-			if ( !isBoolean( bool ) ) {
+			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
 			}
 		}

is-function-array/benchmark/benchmark.js

@@ -62,7 +62,7 @@ function createBenchmark( len ) {
 			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a failing value.
 			x[ len-1 ] = i;
 			bool = isFunctionArray( x );
-			if ( !isBoolean( bool ) ) {
+			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
 			}
 		}

is-integer-array/benchmark/benchmark.js

@@ -70,7 +70,7 @@ function createBenchmark( fcn, len, primitives ) {
 			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a failing value.
 			x[ len-1 ] = i * 3.14;
 			bool = fcn( x );
-			if ( !isBoolean( bool ) ) {
+			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
 			}
 		}