Auto-generated commit

Author: stdlib-bot

deep-equal/benchmark/benchmark.js

@@ -85,7 +85,7 @@ bench( pkg, function benchmark( b ) {
 		x = values[ xi ];
 		y = values[ yi ];
 		out = deepEqual( x, y );
-		if ( !isBoolean( out ) ) {
+		if ( typeof out !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-arrow-function-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 = hasArrowFunctionSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-async-await-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 = hasAsyncAwaitSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-async-iterator-symbol-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 = hasAsyncIteratorSymbolSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-bigint-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 = hasBigIntSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-bigint64array-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 = hasBigInt64ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-biguint64array-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 = hasBigUint64ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-class-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 = hasClassSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-dataview-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 = hasDataViewSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-float32array-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 = hasFloat32ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-float64array-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 = hasFloat64ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-function-name-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 = hasFunctionNameSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-generator-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 = hasGeneratorSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-globalthis-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 = hasGlobalThisSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-int16array-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 = hasInt16ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-int32array-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 = hasInt32ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-int8array-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 = hasInt8ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-iterator-symbol-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 = hasIteratorSymbolSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-map-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 = hasMapSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-own-property/benchmark/benchmark.js

@@ -43,7 +43,7 @@ bench( pkg, function benchmark( b ) {
 		obj = {};
 		obj[ key ] = i;
 		bool = hasOwnProp( obj, key );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}
@@ -67,7 +67,7 @@ bench( pkg+'::built-in', function benchmark( b ) {
 		obj = {};
 		obj[ key ] = i;
 		bool = obj.hasOwnProperty( key );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-property/benchmark/benchmark.js

@@ -41,7 +41,7 @@ bench( pkg, function benchmark( b ) {
 		obj = {};
 		obj[ key ] = i;
 		bool = hasProp( obj, key );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}
@@ -65,7 +65,7 @@ bench( pkg+'::built-in', function benchmark( b ) {
 		obj = {};
 		obj[ key ] = i;
 		bool = ( key in obj );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-proxy-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 = hasProxySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-set-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 = hasSetSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-sharedarraybuffer-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 = hasSharedArrayBufferSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-symbol-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 = hasSymbolSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-tostringtag-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 = hasToStringTagSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-uint16array-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 = hasUint16ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-uint32array-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 = hasUint32ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-uint8array-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 = hasUint8ArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-uint8clampedarray-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 = hasUint8ClampedArraySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-utf16-surrogate-pair-at/benchmark/benchmark.js

@@ -41,7 +41,7 @@ bench( pkg, function benchmark( b ) {
 	for ( i = 0; i < b.iterations; i++ ) {
 		x = floor( randu() * UNICODE_MAX );
 		bool = hasUTF16SurrogatePairAt( fromCodePoint( x ), 0 );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-wasm-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 = hasWebAssemblySupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-weakmap-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 = hasWeakMapSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

has-weakset-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 = hasWeakSetSupport();
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

instance-of/benchmark/benchmark.js

@@ -46,7 +46,7 @@ bench( pkg, function benchmark( b ) {
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
 		bool = instanceOf( vals[ i%vals.length ], Object );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}
@@ -76,7 +76,7 @@ bench( pkg+'::built-in', function benchmark( b ) {
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
 		bool = ( vals[ i%vals.length ] instanceof Object );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

is-absolute-http-uri/benchmark/benchmark.js

@@ -77,7 +77,7 @@ bench( pkg, function benchmark( b ) {
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
 		bool = isAbsoluteHttpURI( values[ i % values.length ] );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

is-absolute-path/benchmark/benchmark.js

@@ -38,7 +38,7 @@ bench( pkg, function benchmark( b ) {
 	for ( i = 0; i < b.iterations; i++ ) {
 		str = '/foo/bar/beep/boop/'+fromCodePoint( 97 + (i%26) );
 		bool = isAbsolutePath( str );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}
@@ -59,7 +59,7 @@ bench( pkg+':posix', function benchmark( b ) {
 	for ( i = 0; i < b.iterations; i++ ) {
 		str = '/foo/bar/beep/boop/'+fromCodePoint( 97 + (i%26) );
 		bool = isAbsolutePath.posix( str );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}
@@ -80,7 +80,7 @@ bench( pkg+':win32', function benchmark( b ) {
 	for ( i = 0; i < b.iterations; i++ ) {
 		str = 'C:\\foo\\bar\\beep\\boop\\'+fromCodePoint( 97 + (i%26) );
 		bool = isAbsolutePath.win32( str );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

is-absolute-uri/benchmark/benchmark.js

@@ -77,7 +77,7 @@ bench( pkg, function benchmark( b ) {
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
 		bool = isAbsoluteURI( values[ i % values.length ] );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}

is-accessor-property-in/benchmark/benchmark.js

@@ -38,7 +38,7 @@ bench( pkg, function benchmark( b ) {
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
 		bool = isAccessorPropertyIn( arr, i );
-		if ( !isBoolean( bool ) ) {
+		if ( typeof bool !== 'boolean' ) {
 			b.fail( 'should return a boolean' );
 		}
 	}