@stdlib/ndarray-base-unary-reduce-strided1d 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +177 -0
- package/NOTICE +1 -0
- package/README.md +302 -0
- package/SECURITY.md +5 -0
- package/dist/index.js +101 -0
- package/dist/index.js.map +7 -0
- package/lib/0d.js +114 -0
- package/lib/0d_accessors.js +119 -0
- package/lib/10d.js +291 -0
- package/lib/10d_accessors.js +299 -0
- package/lib/10d_blocked.js +413 -0
- package/lib/10d_blocked_accessors.js +421 -0
- package/lib/1d.js +167 -0
- package/lib/1d_accessors.js +175 -0
- package/lib/2d.js +193 -0
- package/lib/2d_accessors.js +201 -0
- package/lib/2d_blocked.js +227 -0
- package/lib/2d_blocked_accessors.js +235 -0
- package/lib/3d.js +205 -0
- package/lib/3d_accessors.js +213 -0
- package/lib/3d_blocked.js +252 -0
- package/lib/3d_blocked_accessors.js +260 -0
- package/lib/4d.js +217 -0
- package/lib/4d_accessors.js +225 -0
- package/lib/4d_blocked.js +275 -0
- package/lib/4d_blocked_accessors.js +283 -0
- package/lib/5d.js +229 -0
- package/lib/5d_accessors.js +237 -0
- package/lib/5d_blocked.js +298 -0
- package/lib/5d_blocked_accessors.js +306 -0
- package/lib/6d.js +243 -0
- package/lib/6d_accessors.js +251 -0
- package/lib/6d_blocked.js +321 -0
- package/lib/6d_blocked_accessors.js +329 -0
- package/lib/7d.js +255 -0
- package/lib/7d_accessors.js +263 -0
- package/lib/7d_blocked.js +344 -0
- package/lib/7d_blocked_accessors.js +352 -0
- package/lib/8d.js +267 -0
- package/lib/8d_accessors.js +275 -0
- package/lib/8d_blocked.js +367 -0
- package/lib/8d_blocked_accessors.js +375 -0
- package/lib/9d.js +279 -0
- package/lib/9d_accessors.js +287 -0
- package/lib/9d_blocked.js +390 -0
- package/lib/9d_blocked_accessors.js +398 -0
- package/lib/factory.js +126 -0
- package/lib/increment_offsets.js +46 -0
- package/lib/index.js +161 -0
- package/lib/initialize_array_views.js +57 -0
- package/lib/main.js +498 -0
- package/lib/nd.js +177 -0
- package/lib/nd_accessors.js +185 -0
- package/lib/offsets.js +42 -0
- package/lib/reshape_strategy.js +260 -0
- package/lib/set_view_offsets.js +52 -0
- package/package.json +90 -0
|
@@ -0,0 +1,344 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license Apache-2.0
|
|
3
|
+
*
|
|
4
|
+
* Copyright (c) 2025 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
|
+
/* eslint-disable max-depth, max-len */
|
|
20
|
+
|
|
21
|
+
'use strict';
|
|
22
|
+
|
|
23
|
+
// MODULES //
|
|
24
|
+
|
|
25
|
+
var loopOrder = require( '@stdlib/ndarray-base-unary-loop-interchange-order' );
|
|
26
|
+
var blockSize = require( '@stdlib/ndarray-base-unary-tiling-block-size' );
|
|
27
|
+
var takeIndexed = require( '@stdlib/array-base-take-indexed' );
|
|
28
|
+
var copyIndexed = require( '@stdlib/array-base-copy-indexed' );
|
|
29
|
+
var zeros = require( '@stdlib/array-base-zeros' );
|
|
30
|
+
var incrementOffsets = require( './increment_offsets.js' );
|
|
31
|
+
var setViewOffsets = require( './set_view_offsets.js' );
|
|
32
|
+
var offsets = require( './offsets.js' );
|
|
33
|
+
|
|
34
|
+
|
|
35
|
+
// MAIN //
|
|
36
|
+
|
|
37
|
+
/**
|
|
38
|
+
* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
|
|
39
|
+
*
|
|
40
|
+
* @private
|
|
41
|
+
* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function
|
|
42
|
+
* @param {Array<Object>} arrays - ndarrays
|
|
43
|
+
* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
|
|
44
|
+
* @param {IntegerArray} strides - loop dimension strides for the input ndarray
|
|
45
|
+
* @param {Function} strategy - input ndarray reshape strategy
|
|
46
|
+
* @param {Options} opts - function options
|
|
47
|
+
* @returns {void}
|
|
48
|
+
*
|
|
49
|
+
* @example
|
|
50
|
+
* var Float64Array = require( '@stdlib/array-float64' );
|
|
51
|
+
* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );
|
|
52
|
+
* var getStride = require( '@stdlib/ndarray-base-stride' );
|
|
53
|
+
* var getOffset = require( '@stdlib/ndarray-base-offset' );
|
|
54
|
+
* var getData = require( '@stdlib/ndarray-base-data-buffer' );
|
|
55
|
+
* var numelDimension = require( '@stdlib/ndarray-base-numel-dimension' );
|
|
56
|
+
* var gsum = require( '@stdlib/blas-ext-base-gsum' ).ndarray;
|
|
57
|
+
*
|
|
58
|
+
* function wrapper( arrays ) {
|
|
59
|
+
* var x = arrays[ 0 ];
|
|
60
|
+
* return gsum( numelDimension( x, 0 ), getData( x ), getStride( x, 0 ), getOffset( x ) );
|
|
61
|
+
* }
|
|
62
|
+
*
|
|
63
|
+
* // Create data buffers:
|
|
64
|
+
* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
|
|
65
|
+
* var ybuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );
|
|
66
|
+
*
|
|
67
|
+
* // Define the array shapes:
|
|
68
|
+
* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
|
|
69
|
+
* var ysh = [ 1, 1, 1, 1, 1, 1, 3 ];
|
|
70
|
+
*
|
|
71
|
+
* // Define the array strides:
|
|
72
|
+
* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
|
|
73
|
+
* var sy = [ 3, 3, 3, 3, 3, 3, 1 ];
|
|
74
|
+
*
|
|
75
|
+
* // Define the index offsets:
|
|
76
|
+
* var ox = 0;
|
|
77
|
+
* var oy = 0;
|
|
78
|
+
*
|
|
79
|
+
* // Create an input ndarray-like object:
|
|
80
|
+
* var x = {
|
|
81
|
+
* 'dtype': 'float64',
|
|
82
|
+
* 'data': xbuf,
|
|
83
|
+
* 'shape': xsh,
|
|
84
|
+
* 'strides': sx,
|
|
85
|
+
* 'offset': ox,
|
|
86
|
+
* 'order': 'row-major'
|
|
87
|
+
* };
|
|
88
|
+
*
|
|
89
|
+
* // Create an output ndarray-like object:
|
|
90
|
+
* var y = {
|
|
91
|
+
* 'dtype': 'float64',
|
|
92
|
+
* 'data': ybuf,
|
|
93
|
+
* 'shape': ysh,
|
|
94
|
+
* 'strides': sy,
|
|
95
|
+
* 'offset': oy,
|
|
96
|
+
* 'order': 'row-major'
|
|
97
|
+
* };
|
|
98
|
+
*
|
|
99
|
+
* // Initialize ndarray-like objects representing sub-array views:
|
|
100
|
+
* var views = [
|
|
101
|
+
* {
|
|
102
|
+
* 'dtype': x.dtype,
|
|
103
|
+
* 'data': x.data,
|
|
104
|
+
* 'shape': [ 2, 2 ],
|
|
105
|
+
* 'strides': [ 2, 1 ],
|
|
106
|
+
* 'offset': x.offset,
|
|
107
|
+
* 'order': x.order
|
|
108
|
+
* }
|
|
109
|
+
* ];
|
|
110
|
+
*
|
|
111
|
+
* // Define a reshape strategy:
|
|
112
|
+
* function strategy( x ) {
|
|
113
|
+
* return {
|
|
114
|
+
* 'dtype': x.dtype,
|
|
115
|
+
* 'data': x.data,
|
|
116
|
+
* 'shape': [ 4 ],
|
|
117
|
+
* 'strides': [ 1 ],
|
|
118
|
+
* 'offset': x.offset,
|
|
119
|
+
* 'order': x.order
|
|
120
|
+
* };
|
|
121
|
+
* }
|
|
122
|
+
*
|
|
123
|
+
* // Perform a reduction:
|
|
124
|
+
* blockedunary7d( wrapper, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 4 ], strategy, {} );
|
|
125
|
+
*
|
|
126
|
+
* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
|
|
127
|
+
* // returns [ [ [ [ [ [ [ 10.0, 26.0, 42.0 ] ] ] ] ] ] ]
|
|
128
|
+
*/
|
|
129
|
+
function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // eslint-disable-line max-statements
|
|
130
|
+
var bsize;
|
|
131
|
+
var ybuf;
|
|
132
|
+
var dv0;
|
|
133
|
+
var dv1;
|
|
134
|
+
var dv2;
|
|
135
|
+
var dv3;
|
|
136
|
+
var dv4;
|
|
137
|
+
var dv5;
|
|
138
|
+
var dv6;
|
|
139
|
+
var ov1;
|
|
140
|
+
var ov2;
|
|
141
|
+
var ov3;
|
|
142
|
+
var ov4;
|
|
143
|
+
var ov5;
|
|
144
|
+
var ov6;
|
|
145
|
+
var sh;
|
|
146
|
+
var s0;
|
|
147
|
+
var s1;
|
|
148
|
+
var s2;
|
|
149
|
+
var s3;
|
|
150
|
+
var s4;
|
|
151
|
+
var s5;
|
|
152
|
+
var s6;
|
|
153
|
+
var sv;
|
|
154
|
+
var ov;
|
|
155
|
+
var iv;
|
|
156
|
+
var i0;
|
|
157
|
+
var i1;
|
|
158
|
+
var i2;
|
|
159
|
+
var i3;
|
|
160
|
+
var i4;
|
|
161
|
+
var i5;
|
|
162
|
+
var i6;
|
|
163
|
+
var j0;
|
|
164
|
+
var j1;
|
|
165
|
+
var j2;
|
|
166
|
+
var j3;
|
|
167
|
+
var j4;
|
|
168
|
+
var j5;
|
|
169
|
+
var j6;
|
|
170
|
+
var N;
|
|
171
|
+
var x;
|
|
172
|
+
var y;
|
|
173
|
+
var v;
|
|
174
|
+
var o;
|
|
175
|
+
var k;
|
|
176
|
+
|
|
177
|
+
// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
|
|
178
|
+
|
|
179
|
+
N = arrays.length;
|
|
180
|
+
x = arrays[ 0 ];
|
|
181
|
+
y = arrays[ 1 ];
|
|
182
|
+
|
|
183
|
+
// Resolve the loop interchange order:
|
|
184
|
+
o = loopOrder( y.shape, strides, y.strides );
|
|
185
|
+
sh = o.sh;
|
|
186
|
+
sv = [ o.sx, o.sy ];
|
|
187
|
+
for ( k = 2; k < N; k++ ) {
|
|
188
|
+
sv.push( takeIndexed( arrays[k].strides, o.idx ) );
|
|
189
|
+
}
|
|
190
|
+
// Determine the block size:
|
|
191
|
+
bsize = blockSize( x.dtype, y.dtype );
|
|
192
|
+
|
|
193
|
+
// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
|
|
194
|
+
ov = offsets( arrays );
|
|
195
|
+
|
|
196
|
+
// Cache a reference to the output ndarray buffer:
|
|
197
|
+
ybuf = y.data;
|
|
198
|
+
|
|
199
|
+
// Cache offset increments for the innermost loop...
|
|
200
|
+
dv0 = [];
|
|
201
|
+
for ( k = 0; k < N; k++ ) {
|
|
202
|
+
dv0.push( sv[k][0] );
|
|
203
|
+
}
|
|
204
|
+
// Initialize loop variables...
|
|
205
|
+
ov1 = zeros( N );
|
|
206
|
+
ov2 = zeros( N );
|
|
207
|
+
ov3 = zeros( N );
|
|
208
|
+
ov4 = zeros( N );
|
|
209
|
+
ov5 = zeros( N );
|
|
210
|
+
ov6 = zeros( N );
|
|
211
|
+
dv1 = zeros( N );
|
|
212
|
+
dv2 = zeros( N );
|
|
213
|
+
dv3 = zeros( N );
|
|
214
|
+
dv4 = zeros( N );
|
|
215
|
+
dv5 = zeros( N );
|
|
216
|
+
dv6 = zeros( N );
|
|
217
|
+
iv = zeros( N );
|
|
218
|
+
|
|
219
|
+
// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:
|
|
220
|
+
v = copyIndexed( views );
|
|
221
|
+
|
|
222
|
+
// Iterate over blocks...
|
|
223
|
+
for ( j6 = sh[6]; j6 > 0; ) {
|
|
224
|
+
if ( j6 < bsize ) {
|
|
225
|
+
s6 = j6;
|
|
226
|
+
j6 = 0;
|
|
227
|
+
} else {
|
|
228
|
+
s6 = bsize;
|
|
229
|
+
j6 -= bsize;
|
|
230
|
+
}
|
|
231
|
+
for ( k = 0; k < N; k++ ) {
|
|
232
|
+
ov6[ k ] = ov[k] + ( j6*sv[k][6] );
|
|
233
|
+
}
|
|
234
|
+
for ( j5 = sh[5]; j5 > 0; ) {
|
|
235
|
+
if ( j5 < bsize ) {
|
|
236
|
+
s5 = j5;
|
|
237
|
+
j5 = 0;
|
|
238
|
+
} else {
|
|
239
|
+
s5 = bsize;
|
|
240
|
+
j5 -= bsize;
|
|
241
|
+
}
|
|
242
|
+
for ( k = 0; k < N; k++ ) {
|
|
243
|
+
dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );
|
|
244
|
+
ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
|
|
245
|
+
}
|
|
246
|
+
for ( j4 = sh[4]; j4 > 0; ) {
|
|
247
|
+
if ( j4 < bsize ) {
|
|
248
|
+
s4 = j4;
|
|
249
|
+
j4 = 0;
|
|
250
|
+
} else {
|
|
251
|
+
s4 = bsize;
|
|
252
|
+
j4 -= bsize;
|
|
253
|
+
}
|
|
254
|
+
for ( k = 0; k < N; k++ ) {
|
|
255
|
+
dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );
|
|
256
|
+
ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
|
|
257
|
+
}
|
|
258
|
+
for ( j3 = sh[3]; j3 > 0; ) {
|
|
259
|
+
if ( j3 < bsize ) {
|
|
260
|
+
s3 = j3;
|
|
261
|
+
j3 = 0;
|
|
262
|
+
} else {
|
|
263
|
+
s3 = bsize;
|
|
264
|
+
j3 -= bsize;
|
|
265
|
+
}
|
|
266
|
+
for ( k = 0; k < N; k++ ) {
|
|
267
|
+
dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
|
|
268
|
+
ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
|
|
269
|
+
}
|
|
270
|
+
for ( j2 = sh[2]; j2 > 0; ) {
|
|
271
|
+
if ( j2 < bsize ) {
|
|
272
|
+
s2 = j2;
|
|
273
|
+
j2 = 0;
|
|
274
|
+
} else {
|
|
275
|
+
s2 = bsize;
|
|
276
|
+
j2 -= bsize;
|
|
277
|
+
}
|
|
278
|
+
for ( k = 0; k < N; k++ ) {
|
|
279
|
+
dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
|
|
280
|
+
ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
|
|
281
|
+
}
|
|
282
|
+
for ( j1 = sh[1]; j1 > 0; ) {
|
|
283
|
+
if ( j1 < bsize ) {
|
|
284
|
+
s1 = j1;
|
|
285
|
+
j1 = 0;
|
|
286
|
+
} else {
|
|
287
|
+
s1 = bsize;
|
|
288
|
+
j1 -= bsize;
|
|
289
|
+
}
|
|
290
|
+
for ( k = 0; k < N; k++ ) {
|
|
291
|
+
dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
|
|
292
|
+
ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
|
|
293
|
+
}
|
|
294
|
+
for ( j0 = sh[0]; j0 > 0; ) {
|
|
295
|
+
if ( j0 < bsize ) {
|
|
296
|
+
s0 = j0;
|
|
297
|
+
j0 = 0;
|
|
298
|
+
} else {
|
|
299
|
+
s0 = bsize;
|
|
300
|
+
j0 -= bsize;
|
|
301
|
+
}
|
|
302
|
+
// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
|
|
303
|
+
for ( k = 0; k < N; k++ ) {
|
|
304
|
+
iv[ k ] = ov1[k] + ( j0*sv[k][0] );
|
|
305
|
+
dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
|
|
306
|
+
}
|
|
307
|
+
// Iterate over the non-reduced ndarray dimensions...
|
|
308
|
+
for ( i6 = 0; i6 < s6; i6++ ) {
|
|
309
|
+
for ( i5 = 0; i5 < s5; i5++ ) {
|
|
310
|
+
for ( i4 = 0; i4 < s4; i4++ ) {
|
|
311
|
+
for ( i3 = 0; i3 < s3; i3++ ) {
|
|
312
|
+
for ( i2 = 0; i2 < s2; i2++ ) {
|
|
313
|
+
for ( i1 = 0; i1 < s1; i1++ ) {
|
|
314
|
+
for ( i0 = 0; i0 < s0; i0++ ) {
|
|
315
|
+
setViewOffsets( views, iv );
|
|
316
|
+
v[ 0 ] = strategy( views[ 0 ] );
|
|
317
|
+
ybuf[ iv[1] ] = fcn( v, opts );
|
|
318
|
+
incrementOffsets( iv, dv0 );
|
|
319
|
+
}
|
|
320
|
+
incrementOffsets( iv, dv1 );
|
|
321
|
+
}
|
|
322
|
+
incrementOffsets( iv, dv2 );
|
|
323
|
+
}
|
|
324
|
+
incrementOffsets( iv, dv3 );
|
|
325
|
+
}
|
|
326
|
+
incrementOffsets( iv, dv4 );
|
|
327
|
+
}
|
|
328
|
+
incrementOffsets( iv, dv5 );
|
|
329
|
+
}
|
|
330
|
+
incrementOffsets( iv, dv6 );
|
|
331
|
+
}
|
|
332
|
+
}
|
|
333
|
+
}
|
|
334
|
+
}
|
|
335
|
+
}
|
|
336
|
+
}
|
|
337
|
+
}
|
|
338
|
+
}
|
|
339
|
+
}
|
|
340
|
+
|
|
341
|
+
|
|
342
|
+
// EXPORTS //
|
|
343
|
+
|
|
344
|
+
module.exports = blockedunary7d;
|
|
@@ -0,0 +1,352 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license Apache-2.0
|
|
3
|
+
*
|
|
4
|
+
* Copyright (c) 2025 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
|
+
/* eslint-disable max-depth, max-len */
|
|
20
|
+
|
|
21
|
+
'use strict';
|
|
22
|
+
|
|
23
|
+
// MODULES //
|
|
24
|
+
|
|
25
|
+
var loopOrder = require( '@stdlib/ndarray-base-unary-loop-interchange-order' );
|
|
26
|
+
var blockSize = require( '@stdlib/ndarray-base-unary-tiling-block-size' );
|
|
27
|
+
var takeIndexed = require( '@stdlib/array-base-take-indexed' );
|
|
28
|
+
var copyIndexed = require( '@stdlib/array-base-copy-indexed' );
|
|
29
|
+
var zeros = require( '@stdlib/array-base-zeros' );
|
|
30
|
+
var incrementOffsets = require( './increment_offsets.js' );
|
|
31
|
+
var setViewOffsets = require( './set_view_offsets.js' );
|
|
32
|
+
var offsets = require( './offsets.js' );
|
|
33
|
+
|
|
34
|
+
|
|
35
|
+
// MAIN //
|
|
36
|
+
|
|
37
|
+
/**
|
|
38
|
+
* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
|
|
39
|
+
*
|
|
40
|
+
* @private
|
|
41
|
+
* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function
|
|
42
|
+
* @param {Array<Object>} arrays - ndarrays
|
|
43
|
+
* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
|
|
44
|
+
* @param {IntegerArray} strides - loop dimension strides for the input ndarray
|
|
45
|
+
* @param {Function} strategy - input ndarray reshape strategy
|
|
46
|
+
* @param {Options} opts - function options
|
|
47
|
+
* @returns {void}
|
|
48
|
+
*
|
|
49
|
+
* @example
|
|
50
|
+
* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
|
|
51
|
+
* var accessors = require( '@stdlib/array-base-accessors' );
|
|
52
|
+
* var Float64Array = require( '@stdlib/array-float64' );
|
|
53
|
+
* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );
|
|
54
|
+
* var getStride = require( '@stdlib/ndarray-base-stride' );
|
|
55
|
+
* var getOffset = require( '@stdlib/ndarray-base-offset' );
|
|
56
|
+
* var getData = require( '@stdlib/ndarray-base-data-buffer' );
|
|
57
|
+
* var numelDimension = require( '@stdlib/ndarray-base-numel-dimension' );
|
|
58
|
+
* var gsum = require( '@stdlib/blas-ext-base-gsum' ).ndarray;
|
|
59
|
+
*
|
|
60
|
+
* function wrapper( arrays ) {
|
|
61
|
+
* var x = arrays[ 0 ];
|
|
62
|
+
* return gsum( numelDimension( x, 0 ), getData( x ), getStride( x, 0 ), getOffset( x ) );
|
|
63
|
+
* }
|
|
64
|
+
*
|
|
65
|
+
* // Create data buffers:
|
|
66
|
+
* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
|
|
67
|
+
* var ybuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );
|
|
68
|
+
*
|
|
69
|
+
* // Define the array shapes:
|
|
70
|
+
* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
|
|
71
|
+
* var ysh = [ 1, 1, 1, 1, 1, 1, 3 ];
|
|
72
|
+
*
|
|
73
|
+
* // Define the array strides:
|
|
74
|
+
* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
|
|
75
|
+
* var sy = [ 3, 3, 3, 3, 3, 3, 1 ];
|
|
76
|
+
*
|
|
77
|
+
* // Define the index offsets:
|
|
78
|
+
* var ox = 0;
|
|
79
|
+
* var oy = 0;
|
|
80
|
+
*
|
|
81
|
+
* // Create an input ndarray-like object:
|
|
82
|
+
* var x = {
|
|
83
|
+
* 'dtype': 'float64',
|
|
84
|
+
* 'data': xbuf,
|
|
85
|
+
* 'shape': xsh,
|
|
86
|
+
* 'strides': sx,
|
|
87
|
+
* 'offset': ox,
|
|
88
|
+
* 'order': 'row-major',
|
|
89
|
+
* 'accessors': accessors( xbuf ).accessors
|
|
90
|
+
* };
|
|
91
|
+
*
|
|
92
|
+
* // Create an output ndarray-like object:
|
|
93
|
+
* var y = {
|
|
94
|
+
* 'dtype': 'float64',
|
|
95
|
+
* 'data': ybuf,
|
|
96
|
+
* 'shape': ysh,
|
|
97
|
+
* 'strides': sy,
|
|
98
|
+
* 'offset': oy,
|
|
99
|
+
* 'order': 'row-major',
|
|
100
|
+
* 'accessors': accessors( ybuf ).accessors
|
|
101
|
+
* };
|
|
102
|
+
*
|
|
103
|
+
* // Initialize ndarray-like objects representing sub-array views:
|
|
104
|
+
* var views = [
|
|
105
|
+
* {
|
|
106
|
+
* 'dtype': x.dtype,
|
|
107
|
+
* 'data': x.data,
|
|
108
|
+
* 'shape': [ 2, 2 ],
|
|
109
|
+
* 'strides': [ 2, 1 ],
|
|
110
|
+
* 'offset': x.offset,
|
|
111
|
+
* 'order': x.order
|
|
112
|
+
* }
|
|
113
|
+
* ];
|
|
114
|
+
*
|
|
115
|
+
* // Define a reshape strategy:
|
|
116
|
+
* function strategy( x ) {
|
|
117
|
+
* return {
|
|
118
|
+
* 'dtype': x.dtype,
|
|
119
|
+
* 'data': x.data,
|
|
120
|
+
* 'shape': [ 4 ],
|
|
121
|
+
* 'strides': [ 1 ],
|
|
122
|
+
* 'offset': x.offset,
|
|
123
|
+
* 'order': x.order
|
|
124
|
+
* };
|
|
125
|
+
* }
|
|
126
|
+
*
|
|
127
|
+
* // Perform a reduction:
|
|
128
|
+
* blockedunary7d( wrapper, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 4 ], strategy, {} );
|
|
129
|
+
*
|
|
130
|
+
* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
|
|
131
|
+
* // returns [ [ [ [ [ [ [ 10.0, 26.0, 42.0 ] ] ] ] ] ] ]
|
|
132
|
+
*/
|
|
133
|
+
function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // eslint-disable-line max-statements
|
|
134
|
+
var bsize;
|
|
135
|
+
var ybuf;
|
|
136
|
+
var set;
|
|
137
|
+
var dv0;
|
|
138
|
+
var dv1;
|
|
139
|
+
var dv2;
|
|
140
|
+
var dv3;
|
|
141
|
+
var dv4;
|
|
142
|
+
var dv5;
|
|
143
|
+
var dv6;
|
|
144
|
+
var ov1;
|
|
145
|
+
var ov2;
|
|
146
|
+
var ov3;
|
|
147
|
+
var ov4;
|
|
148
|
+
var ov5;
|
|
149
|
+
var ov6;
|
|
150
|
+
var sh;
|
|
151
|
+
var s0;
|
|
152
|
+
var s1;
|
|
153
|
+
var s2;
|
|
154
|
+
var s3;
|
|
155
|
+
var s4;
|
|
156
|
+
var s5;
|
|
157
|
+
var s6;
|
|
158
|
+
var sv;
|
|
159
|
+
var ov;
|
|
160
|
+
var iv;
|
|
161
|
+
var i0;
|
|
162
|
+
var i1;
|
|
163
|
+
var i2;
|
|
164
|
+
var i3;
|
|
165
|
+
var i4;
|
|
166
|
+
var i5;
|
|
167
|
+
var i6;
|
|
168
|
+
var j0;
|
|
169
|
+
var j1;
|
|
170
|
+
var j2;
|
|
171
|
+
var j3;
|
|
172
|
+
var j4;
|
|
173
|
+
var j5;
|
|
174
|
+
var j6;
|
|
175
|
+
var N;
|
|
176
|
+
var x;
|
|
177
|
+
var y;
|
|
178
|
+
var v;
|
|
179
|
+
var o;
|
|
180
|
+
var k;
|
|
181
|
+
|
|
182
|
+
// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
|
|
183
|
+
|
|
184
|
+
N = arrays.length;
|
|
185
|
+
x = arrays[ 0 ];
|
|
186
|
+
y = arrays[ 1 ];
|
|
187
|
+
|
|
188
|
+
// Resolve the loop interchange order:
|
|
189
|
+
o = loopOrder( y.shape, strides, y.strides );
|
|
190
|
+
sh = o.sh;
|
|
191
|
+
sv = [ o.sx, o.sy ];
|
|
192
|
+
for ( k = 2; k < N; k++ ) {
|
|
193
|
+
sv.push( takeIndexed( arrays[k].strides, o.idx ) );
|
|
194
|
+
}
|
|
195
|
+
// Determine the block size:
|
|
196
|
+
bsize = blockSize( x.dtype, y.dtype );
|
|
197
|
+
|
|
198
|
+
// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
|
|
199
|
+
ov = offsets( arrays );
|
|
200
|
+
|
|
201
|
+
// Cache a reference to the output ndarray buffer:
|
|
202
|
+
ybuf = y.data;
|
|
203
|
+
|
|
204
|
+
// Cache accessors:
|
|
205
|
+
set = y.accessors[ 1 ];
|
|
206
|
+
|
|
207
|
+
// Cache offset increments for the innermost loop...
|
|
208
|
+
dv0 = [];
|
|
209
|
+
for ( k = 0; k < N; k++ ) {
|
|
210
|
+
dv0.push( sv[k][0] );
|
|
211
|
+
}
|
|
212
|
+
// Initialize loop variables...
|
|
213
|
+
ov1 = zeros( N );
|
|
214
|
+
ov2 = zeros( N );
|
|
215
|
+
ov3 = zeros( N );
|
|
216
|
+
ov4 = zeros( N );
|
|
217
|
+
ov5 = zeros( N );
|
|
218
|
+
ov6 = zeros( N );
|
|
219
|
+
dv1 = zeros( N );
|
|
220
|
+
dv2 = zeros( N );
|
|
221
|
+
dv3 = zeros( N );
|
|
222
|
+
dv4 = zeros( N );
|
|
223
|
+
dv5 = zeros( N );
|
|
224
|
+
dv6 = zeros( N );
|
|
225
|
+
iv = zeros( N );
|
|
226
|
+
|
|
227
|
+
// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:
|
|
228
|
+
v = copyIndexed( views );
|
|
229
|
+
|
|
230
|
+
// Iterate over blocks...
|
|
231
|
+
for ( j6 = sh[6]; j6 > 0; ) {
|
|
232
|
+
if ( j6 < bsize ) {
|
|
233
|
+
s6 = j6;
|
|
234
|
+
j6 = 0;
|
|
235
|
+
} else {
|
|
236
|
+
s6 = bsize;
|
|
237
|
+
j6 -= bsize;
|
|
238
|
+
}
|
|
239
|
+
for ( k = 0; k < N; k++ ) {
|
|
240
|
+
ov6[ k ] = ov[k] + ( j6*sv[k][6] );
|
|
241
|
+
}
|
|
242
|
+
for ( j5 = sh[5]; j5 > 0; ) {
|
|
243
|
+
if ( j5 < bsize ) {
|
|
244
|
+
s5 = j5;
|
|
245
|
+
j5 = 0;
|
|
246
|
+
} else {
|
|
247
|
+
s5 = bsize;
|
|
248
|
+
j5 -= bsize;
|
|
249
|
+
}
|
|
250
|
+
for ( k = 0; k < N; k++ ) {
|
|
251
|
+
dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );
|
|
252
|
+
ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
|
|
253
|
+
}
|
|
254
|
+
for ( j4 = sh[4]; j4 > 0; ) {
|
|
255
|
+
if ( j4 < bsize ) {
|
|
256
|
+
s4 = j4;
|
|
257
|
+
j4 = 0;
|
|
258
|
+
} else {
|
|
259
|
+
s4 = bsize;
|
|
260
|
+
j4 -= bsize;
|
|
261
|
+
}
|
|
262
|
+
for ( k = 0; k < N; k++ ) {
|
|
263
|
+
dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );
|
|
264
|
+
ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
|
|
265
|
+
}
|
|
266
|
+
for ( j3 = sh[3]; j3 > 0; ) {
|
|
267
|
+
if ( j3 < bsize ) {
|
|
268
|
+
s3 = j3;
|
|
269
|
+
j3 = 0;
|
|
270
|
+
} else {
|
|
271
|
+
s3 = bsize;
|
|
272
|
+
j3 -= bsize;
|
|
273
|
+
}
|
|
274
|
+
for ( k = 0; k < N; k++ ) {
|
|
275
|
+
dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
|
|
276
|
+
ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
|
|
277
|
+
}
|
|
278
|
+
for ( j2 = sh[2]; j2 > 0; ) {
|
|
279
|
+
if ( j2 < bsize ) {
|
|
280
|
+
s2 = j2;
|
|
281
|
+
j2 = 0;
|
|
282
|
+
} else {
|
|
283
|
+
s2 = bsize;
|
|
284
|
+
j2 -= bsize;
|
|
285
|
+
}
|
|
286
|
+
for ( k = 0; k < N; k++ ) {
|
|
287
|
+
dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
|
|
288
|
+
ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
|
|
289
|
+
}
|
|
290
|
+
for ( j1 = sh[1]; j1 > 0; ) {
|
|
291
|
+
if ( j1 < bsize ) {
|
|
292
|
+
s1 = j1;
|
|
293
|
+
j1 = 0;
|
|
294
|
+
} else {
|
|
295
|
+
s1 = bsize;
|
|
296
|
+
j1 -= bsize;
|
|
297
|
+
}
|
|
298
|
+
for ( k = 0; k < N; k++ ) {
|
|
299
|
+
dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
|
|
300
|
+
ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
|
|
301
|
+
}
|
|
302
|
+
for ( j0 = sh[0]; j0 > 0; ) {
|
|
303
|
+
if ( j0 < bsize ) {
|
|
304
|
+
s0 = j0;
|
|
305
|
+
j0 = 0;
|
|
306
|
+
} else {
|
|
307
|
+
s0 = bsize;
|
|
308
|
+
j0 -= bsize;
|
|
309
|
+
}
|
|
310
|
+
// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
|
|
311
|
+
for ( k = 0; k < N; k++ ) {
|
|
312
|
+
iv[ k ] = ov1[k] + ( j0*sv[k][0] );
|
|
313
|
+
dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
|
|
314
|
+
}
|
|
315
|
+
// Iterate over the non-reduced ndarray dimensions...
|
|
316
|
+
for ( i6 = 0; i6 < s6; i6++ ) {
|
|
317
|
+
for ( i5 = 0; i5 < s5; i5++ ) {
|
|
318
|
+
for ( i4 = 0; i4 < s4; i4++ ) {
|
|
319
|
+
for ( i3 = 0; i3 < s3; i3++ ) {
|
|
320
|
+
for ( i2 = 0; i2 < s2; i2++ ) {
|
|
321
|
+
for ( i1 = 0; i1 < s1; i1++ ) {
|
|
322
|
+
for ( i0 = 0; i0 < s0; i0++ ) {
|
|
323
|
+
setViewOffsets( views, iv );
|
|
324
|
+
v[ 0 ] = strategy( views[ 0 ] );
|
|
325
|
+
set( ybuf, iv[ 1 ], fcn( v, opts ) );
|
|
326
|
+
incrementOffsets( iv, dv0 );
|
|
327
|
+
}
|
|
328
|
+
incrementOffsets( iv, dv1 );
|
|
329
|
+
}
|
|
330
|
+
incrementOffsets( iv, dv2 );
|
|
331
|
+
}
|
|
332
|
+
incrementOffsets( iv, dv3 );
|
|
333
|
+
}
|
|
334
|
+
incrementOffsets( iv, dv4 );
|
|
335
|
+
}
|
|
336
|
+
incrementOffsets( iv, dv5 );
|
|
337
|
+
}
|
|
338
|
+
incrementOffsets( iv, dv6 );
|
|
339
|
+
}
|
|
340
|
+
}
|
|
341
|
+
}
|
|
342
|
+
}
|
|
343
|
+
}
|
|
344
|
+
}
|
|
345
|
+
}
|
|
346
|
+
}
|
|
347
|
+
}
|
|
348
|
+
|
|
349
|
+
|
|
350
|
+
// EXPORTS //
|
|
351
|
+
|
|
352
|
+
module.exports = blockedunary7d;
|