Add benchmark

Author: Planeshifter

lib/node_modules/@stdlib/random/shuffle/benchmark/benchmark.js

@@ -0,0 +1,154 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var bench = require( '@stdlib/bench' );
+var randu = require( '@stdlib/random/base/randu' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var isArray = require( '@stdlib/assert/is-array' );
+var pkg = require( './../package.json' ).name;
+var shuffle = require( './../lib' );
+
+
+// MAIN //
+
+bench( pkg, function benchmark( b ) {
+	var result;
+	var arr;
+	var len;
+	var i;
+
+	arr = new Array( 100 );
+	len = arr.length;
+	for ( i = 0; i < len; i++ ) {
+		arr[ i ] = floor( randu()*100.0 );
+	}
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		result = shuffle( arr );
+		if ( !isArray( result ) ) {
+			b.fail( 'should return an array' );
+		}
+	}
+	b.toc();
+	if ( !isArray( result ) ) {
+		b.fail( 'should return an array' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+bench( pkg+'::deep', function benchmark( b ) {
+	var result;
+	var arr;
+	var len;
+	var i;
+
+	arr = new Array( 100 );
+	len = arr.length;
+	for ( i = 0; i < len; i++ ) {
+		arr[ i ] = {
+			'beep': 'boop'
+		};
+	}
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		result = shuffle( arr, {
+			'copy': 'deep'
+		});
+		if ( !isArray( result ) ) {
+			b.fail( 'should return an array' );
+		}
+	}
+	b.toc();
+	if ( !isArray( result ) ) {
+		b.fail( 'should return an array' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+bench( pkg+'::none', function benchmark( b ) {
+	var result;
+	var arr;
+	var len;
+	var i;
+
+	arr = new Array( 100 );
+	len = arr.length;
+	for ( i = 0; i < len; i++ ) {
+		arr[ i ] = floor( randu()*100.0 );
+	}
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		result = shuffle( arr, {
+			'copy': 'none'
+		});
+		if ( !isArray( result ) ) {
+			b.fail( 'should return an array' );
+		}
+		if ( result !== arr ) {
+			b.fail( 'should mutate the input array' );
+		}
+	}
+	b.toc();
+	if ( !isArray( result ) ) {
+		b.fail( 'should return an array' );
+	}
+	if ( result !== arr ) {
+		b.fail( 'should mutate the input array' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+bench( pkg+':factory', function benchmark( b ) {
+	var myshuffle;
+	var result;
+	var arr;
+	var len;
+	var i;
+
+	myshuffle = shuffle.factory();
+
+	arr = new Array( 100 );
+	len = arr.length;
+	for ( i = 0; i < len; i++ ) {
+		arr[ i ] = floor( randu()*100.0 );
+	}
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		result = myshuffle( arr );
+		if ( !isArray( result ) ) {
+			b.fail( 'should return an array' );
+		}
+	}
+	b.toc();
+	if ( !isArray( result ) ) {
+		b.fail( 'should return an array' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});