Skip to content

Commit 502b430

Browse files
PlaneshifterPlaneshifter
committed
Add benchmark
1 parent 97747a8 commit 502b430

File tree

1 file changed

+208
-0
lines changed
  • lib/node_modules/@stdlib/random/sample/benchmark

1 file changed

+208
-0
lines changed

‎lib/node_modules/@stdlib/random/sample/benchmark/benchmark.js‎

Lines changed: 208 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,208 @@
1+
/**
2+
* @license Apache-2.0
3+
*
4+
* Copyright (c) 2018 The Stdlib Authors.
5+
*
6+
* Licensed under the Apache License, Version 2.0 (the "License");
7+
* you may not use this file except in compliance with the License.
8+
* You may obtain a copy of the License at
9+
*
10+
* http://www.apache.org/licenses/LICENSE-2.0
11+
*
12+
* Unless required by applicable law or agreed to in writing, software
13+
* distributed under the License is distributed on an "AS IS" BASIS,
14+
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15+
* See the License for the specific language governing permissions and
16+
* limitations under the License.
17+
*/
18+
19+
'use strict';
20+
21+
// MODULES //
22+
23+
var bench = require( '@stdlib/bench' );
24+
var randu = require( '@stdlib/random/base/randu' );
25+
var floor = require( '@stdlib/math/base/special/floor' );
26+
var isArray = require( '@stdlib/assert/is-array' );
27+
var pkg = require( './../package.json' ).name;
28+
var sample = require( './../lib' );
29+
30+
31+
// MAIN //
32+
33+
bench( pkg, function benchmark( b ) {
34+
var result;
35+
var arr;
36+
var len;
37+
var i;
38+
39+
arr = new Array( 100 );
40+
len = arr.length;
41+
for ( i = 0; i < len; i++ ) {
42+
arr[ i ] = floor( randu()*100.0 );
43+
}
44+
45+
b.tic();
46+
for ( i = 0; i < b.iterations; i++ ) {
47+
result = sample( arr );
48+
if ( !isArray( result ) ) {
49+
b.fail( 'should return an array' );
50+
}
51+
}
52+
b.toc();
53+
if ( !isArray( result ) ) {
54+
b.fail( 'should return an array' );
55+
}
56+
b.pass( 'benchmark finished' );
57+
b.end();
58+
});
59+
60+
bench( pkg+'::custom_probs', function benchmark( b ) {
61+
var result;
62+
var probs;
63+
var arr;
64+
var len;
65+
var i;
66+
67+
arr = [ 1, 2, 3, 4, 5, 6 ];
68+
probs = [ 0.2, 0.1, 0.1, 0.1, 0.2, 0.3 ];
69+
len = arr.length;
70+
for ( i = 0; i < len; i++ ) {
71+
arr[ i ] = floor( randu()*100.0 );
72+
}
73+
74+
b.tic();
75+
for ( i = 0; i < b.iterations; i++ ) {
76+
result = sample( arr, {
77+
'probs': probs,
78+
'size': 100
79+
});
80+
if ( !isArray( result ) ) {
81+
b.fail( 'should return an array' );
82+
}
83+
}
84+
b.toc();
85+
if ( !isArray( result ) ) {
86+
b.fail( 'should return an array' );
87+
}
88+
b.pass( 'benchmark finished' );
89+
b.end();
90+
});
91+
92+
bench( pkg+'::size=1000', function benchmark( b ) {
93+
var result;
94+
var arr;
95+
var len;
96+
var i;
97+
98+
arr = new Array( 100 );
99+
len = arr.length;
100+
for ( i = 0; i < len; i++ ) {
101+
arr[ i ] = floor( randu()*100.0 );
102+
}
103+
104+
b.tic();
105+
for ( i = 0; i < b.iterations; i++ ) {
106+
result = sample( arr, {
107+
'size': 1000
108+
});
109+
if ( !isArray( result ) ) {
110+
b.fail( 'should return an array' );
111+
}
112+
}
113+
b.toc();
114+
if ( !isArray( result ) ) {
115+
b.fail( 'should return an array' );
116+
}
117+
b.pass( 'benchmark finished' );
118+
b.end();
119+
});
120+
121+
bench( pkg+'::replace=true', function benchmark( b ) {
122+
var result;
123+
var arr;
124+
var len;
125+
var i;
126+
127+
arr = new Array( 100 );
128+
len = arr.length;
129+
for ( i = 0; i < len; i++ ) {
130+
arr[ i ] = floor( randu()*100.0 );
131+
}
132+
133+
b.tic();
134+
for ( i = 0; i < b.iterations; i++ ) {
135+
result = sample( arr, {
136+
'replace': true
137+
});
138+
if ( !isArray( result ) ) {
139+
b.fail( 'should return an array' );
140+
}
141+
}
142+
b.toc();
143+
if ( !isArray( result ) ) {
144+
b.fail( 'should return an array' );
145+
}
146+
b.pass( 'benchmark finished' );
147+
b.end();
148+
});
149+
150+
bench( pkg+'::replace=true,size=1000', function benchmark( b ) {
151+
var result;
152+
var arr;
153+
var len;
154+
var i;
155+
156+
arr = new Array( 100 );
157+
len = arr.length;
158+
for ( i = 0; i < len; i++ ) {
159+
arr[ i ] = floor( randu()*100.0 );
160+
}
161+
162+
b.tic();
163+
for ( i = 0; i < b.iterations; i++ ) {
164+
result = sample( arr, {
165+
'replace': true,
166+
'size': 1000
167+
});
168+
if ( !isArray( result ) ) {
169+
b.fail( 'should return an array' );
170+
}
171+
}
172+
b.toc();
173+
if ( !isArray( result ) ) {
174+
b.fail( 'should return an array' );
175+
}
176+
b.pass( 'benchmark finished' );
177+
b.end();
178+
});
179+
180+
bench( pkg+':factory', function benchmark( b ) {
181+
var mysample;
182+
var result;
183+
var arr;
184+
var len;
185+
var i;
186+
187+
mysample = sample.factory();
188+
189+
arr = new Array( 100 );
190+
len = arr.length;
191+
for ( i = 0; i < len; i++ ) {
192+
arr[ i ] = floor( randu()*100.0 );
193+
}
194+
195+
b.tic();
196+
for ( i = 0; i < b.iterations; i++ ) {
197+
result = mysample( arr );
198+
if ( !isArray( result ) ) {
199+
b.fail( 'should return an array' );
200+
}
201+
}
202+
b.toc();
203+
if ( !isArray( result ) ) {
204+
b.fail( 'should return an array' );
205+
}
206+
b.pass( 'benchmark finished' );
207+
b.end();
208+
});

0 commit comments

Comments
 (0)