forked from stdlib-js/stdlib
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbenchmark.1d.js
More file actions
149 lines (129 loc) · 3.16 KB
/
benchmark.1d.js
File metadata and controls
149 lines (129 loc) · 3.16 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
/**
* @license Apache-2.0
*
* Copyright (c) 2025 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 discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var pow = require( '@stdlib/math/base/special/pow' );
var add = require( '@stdlib/number/float64/base/add' );
var filledarray = require( '@stdlib/array/filled' );
var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
var orders = require( '@stdlib/ndarray/orders' );
var format = require( '@stdlib/string/format' );
var pkg = require( './../package.json' ).name;
var binary = require( './../lib' );
// VARIABLES //
var TYPES = [
'float64'
];
var ORDERS = orders();
// FUNCTIONS //
/**
* Creates a benchmark function.
*
* @private
* @param {PositiveInteger} len - ndarray length
* @param {NonNegativeIntegerArray} shape - ndarray shape
* @param {string} xtype - input ndarray data type
* @param {string} ytype - output ndarray data type
* @param {string} order - memory layout
* @returns {Function} benchmark function
*/
function createBenchmark( len, shape, xtype, ytype, order ) {
var x;
var y;
x = discreteUniform( len, -100, 100, {
'dtype': xtype
});
y = filledarray( 0.0, len, ytype );
x = {
'dtype': xtype,
'data': x,
'shape': shape,
'strides': shape2strides( shape, order ),
'offset': 0,
'order': order
};
y = {
'dtype': ytype,
'data': y,
'shape': shape,
'strides': shape2strides( shape, order ),
'offset': 0,
'order': order
};
return benchmark;
/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var i;
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
binary( [ x, x, y ], add );
if ( isnan( y.data[ i%len ] ) ) {
b.fail( 'should not return NaN' );
}
}
b.toc();
if ( isnan( y.data[ i%len ] ) ) {
b.fail( 'should not return NaN' );
}
b.pass( 'benchmark finished' );
b.end();
}
}
// MAIN //
/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var ord;
var sh;
var t1;
var t2;
var f;
var i;
var j;
var k;
min = 1; // 10^min
max = 6; // 10^max
for ( k = 0; k < ORDERS.length; k++ ) {
ord = ORDERS[ k ];
for ( j = 0; j < TYPES.length; j++ ) {
t1 = TYPES[ j ];
t2 = TYPES[ j ];
for ( i = min; i <= max; i++ ) {
len = pow( 10, i );
sh = [ len ];
f = createBenchmark( len, sh, t1, t2, ord );
bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,yorder=%s,xtype=%s,ytype=%s', pkg, sh.length, len, sh.join( ',' ), ord, ord, t1, t2 ), f );
}
}
}
}
main();