old_contents: 'use strict';
  
  // MODULES //
  
  var bench = require( '@stdlib/bench' );
  var randu = require( '@stdlib/math/base/random/randu' );
  var isBoolean = require( '@stdlib/utils/is-boolean' ).isPrimitive;
  var pow = require( '@stdlib/math/base/special/pow' );
  var pkg = require( './../package.json' ).name;
  var isBooleanArray = require( './../lib' );
  
  
  // FUNCTIONS //
  
  /**
  * Creates a benchmark function.
  *
  * @private
  * @param {Function} fcn - function to benchmark
  * @param {PositiveInteger} len - array length
  * @param {boolean} primitives - boolean indicating whether to fill array with primitives or objects
  * @returns {Function} benchmark function
  */
  function createBenchmark( fcn, len, primitives ) {
  	var x;
  	var i;
  
  	x = new Array( len );
  	if ( primitives ) {
  		for ( i = 0; i < x.length; i++ ) {
  			if ( randu() < 0.5 ) {
  				x[ i ] = false;
  			} else {
  				x[ i ] = true;
  			}
  		}
  	} else {
  		for ( i = 0; i < x.length; i++ ) {
  			if ( randu() < 0.5 ) {
  				x[ i ] = new Boolean( false ); // eslint-ignore-line no-new-wrappers
  			} else {
  				x[ i ] = new Boolean( true ); // eslint-ignore-line no-new-wrappers
  			}
  		}
  	}
  	return benchmark;
  
  	/**
  	* Benchmark function.
  	*
  	* @private
  	* @param {Benchmark} b - benchmark instance
  	*/
  	function benchmark( b ) {
  		var bool;
  		var i;
  
  		b.tic();
  		for ( i = 0; i < b.iterations; i++ ) {
  			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a failing value.
  			x[ x.length ] = i;
  			bool = fcn( x );
  			if ( !isBoolean( bool ) ) {
  				b.fail( 'should return a boolean' );
  			}
  		}
  		b.toc();
  		if ( isBoolean( bool ) ) {
  			b.pass( 'benchmark finished' );
  		} else {
  			b.fail( 'should return a boolean' );
  		}
  		b.end();
  	} // end FUNCTION benchmark()
  } // end FUNCTION createBenchmark()
  
  
  // MAIN //
  
  /**
  * Main execution sequence.
  *
  * @private
  */
  function main() {
  	var len;
  	var min;
  	var max;
  	var f;
  	var i;
  
  	min = 1; // 10^min
  	max = 6; // 10^max
  
  	for ( i = min; i <= max; i++ ) {
  		len = pow( 10, i );
  
  		f = createBenchmark( isBooleanArray, len, false );
  		bench( pkg+':len='+len, f );
  
  		f = createBenchmark( isBooleanArray.primitives, len, true );
  		bench( pkg+':primitives:len='+len, f );
  
  		f = createBenchmark( isBooleanArray.objects, len, false );
  		bench( pkg+':objects:len='+len, f );
  	}
  } // end FUNCTION main()
  
  main();
  
new_contents: 'use strict';
  
  // MODULES //
  
  var bench = require( '@stdlib/bench' );
  var randu = require( '@stdlib/math/base/random/randu' );
  var isBoolean = require( '@stdlib/utils/is-boolean' ).isPrimitive;
  var pow = require( '@stdlib/math/base/special/pow' );
  var pkg = require( './../package.json' ).name;
  var isBooleanArray = require( './../lib' );
  
  
  // FUNCTIONS //
  
  /**
  * Creates a benchmark function.
  *
  * @private
  * @param {Function} fcn - function to benchmark
  * @param {PositiveInteger} len - array length
  * @param {boolean} primitives - boolean indicating whether to fill array with primitives or objects
  * @returns {Function} benchmark function
  */
  function createBenchmark( fcn, len, primitives ) {
  	var x;
  	var i;
  
  	x = new Array( len );
  	if ( primitives ) {
  		for ( i = 0; i < x.length; i++ ) {
  			if ( randu() < 0.5 ) {
  				x[ i ] = false;
  			} else {
  				x[ i ] = true;
  			}
  		}
  	} else {
  		for ( i = 0; i < x.length; i++ ) {
  			if ( randu() < 0.5 ) {
  				x[ i ] = new Boolean( false ); // eslint-disable-line no-new-wrappers
  			} else {
  				x[ i ] = new Boolean( true ); // eslint-disable-line no-new-wrappers
  			}
  		}
  	}
  	return benchmark;
  
  	/**
  	* Benchmark function.
  	*
  	* @private
  	* @param {Benchmark} b - benchmark instance
  	*/
  	function benchmark( b ) {
  		var bool;
  		var i;
  
  		b.tic();
  		for ( i = 0; i < b.iterations; i++ ) {
  			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a failing value.
  			x[ x.length ] = i;
  			bool = fcn( x );
  			if ( !isBoolean( bool ) ) {
  				b.fail( 'should return a boolean' );
  			}
  		}
  		b.toc();
  		if ( isBoolean( bool ) ) {
  			b.pass( 'benchmark finished' );
  		} else {
  			b.fail( 'should return a boolean' );
  		}
  		b.end();
  	} // end FUNCTION benchmark()
  } // end FUNCTION createBenchmark()
  
  
  // MAIN //
  
  /**
  * Main execution sequence.
  *
  * @private
  */
  function main() {
  	var len;
  	var min;
  	var max;
  	var f;
  	var i;
  
  	min = 1; // 10^min
  	max = 6; // 10^max
  
  	for ( i = min; i <= max; i++ ) {
  		len = pow( 10, i );
  
  		f = createBenchmark( isBooleanArray, len, false );
  		bench( pkg+':len='+len, f );
  
  		f = createBenchmark( isBooleanArray.primitives, len, true );
  		bench( pkg+':primitives:len='+len, f );
  
  		f = createBenchmark( isBooleanArray.objects, len, false );
  		bench( pkg+':objects:len='+len, f );
  	}
  } // end FUNCTION main()
  
  main();
  
subject: Fix comments