Skip to content

Commit 3b993eb

Browse files
committed
Merge branch 'unary-red-sub-by' of https://github.com/headlessnode/stdlib into pr/headlessNode/7008
2 parents 084389b + 3f6c1d0 commit 3b993eb

File tree

17 files changed

+5398
-2
lines changed

17 files changed

+5398
-2
lines changed
Lines changed: 298 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,298 @@
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, max-params, max-statements */
20+
21+
'use strict';
22+
23+
// MODULES //
24+
25+
var zeroTo = require( '@stdlib/array/base/zero-to' );
26+
var reverse = require( '@stdlib/array/base/reverse' );
27+
var take = require( '@stdlib/array/base/take-indexed' );
28+
var incrementOffsets = require( './increment_offsets.js' );
29+
var setViewOffsets = require( './set_view_offsets.js' );
30+
var offsets = require( './offsets.js' );
31+
var wrap = require( './callback_wrapper.js' );
32+
33+
34+
// MAIN //
35+
36+
/**
37+
* Performs a reduction over an input ndarray according to a callback function and assigns results to a provided output ndarray.
38+
*
39+
* @private
40+
* @param {Function} fcn - reduction function
41+
* @param {Array<Object>} arrays - ndarrays
42+
* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
43+
* @param {NonNegativeIntegerArray} ibuf - workspace for storing iteration indices
44+
* @param {NonNegativeIntegerArray} ldims - list of loop dimensions
45+
* @param {NonNegativeIntegerArray} cdims - list of "core" dimensions
46+
* @param {IntegerArray} strides - loop dimension strides for the input ndarray
47+
* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order
48+
* @param {Options} opts - reduction function options
49+
* @param {boolean} hasOpts - boolean indicating whether to pass an options argument to a reduction function
50+
* @param {Function} clbk - callback function
51+
* @param {thisArg} thisArg - callback execution context
52+
* @returns {void}
53+
*
54+
* @example
55+
* var Float64Array = require( '@stdlib/array/float64' );
56+
* var filled = require( '@stdlib/array/base/filled' );
57+
* var zeros = require( '@stdlib/array/base/zeros' );
58+
* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
59+
* var base = require( '@stdlib/ndarray/base/every-by' );
60+
*
61+
* function clbk( value ) {
62+
* return value > 0.0;
63+
* }
64+
*
65+
* // Create data buffers:
66+
* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
67+
* var ybuf = filled( false, 3 );
68+
*
69+
* // Define the array shapes:
70+
* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
71+
* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 ];
72+
*
73+
* // Define the array strides:
74+
* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
75+
* var sy = [ 3, 3, 3, 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+
* };
90+
*
91+
* // Create an output ndarray-like object:
92+
* var y = {
93+
* 'dtype': 'generic',
94+
* 'data': ybuf,
95+
* 'shape': ysh,
96+
* 'strides': sy,
97+
* 'offset': oy,
98+
* 'order': 'row-major'
99+
* };
100+
*
101+
* // Initialize ndarray-like objects representing sub-array views:
102+
* var views = [
103+
* {
104+
* 'dtype': x.dtype,
105+
* 'data': x.data,
106+
* 'shape': [ 2, 2 ],
107+
* 'strides': [ 2, 1 ],
108+
* 'offset': x.offset,
109+
* 'order': x.order
110+
* }
111+
* ];
112+
*
113+
* // Create a workspace array for storing iteration indices:
114+
* var ibuf = zeros( xsh.length );
115+
*
116+
* // Define the loop and core dimensions:
117+
* var ldims = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ];
118+
* var cdims = [ 10, 11 ];
119+
*
120+
* // Resolve the loop dimension strides for the input array:
121+
* var slx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ];
122+
*
123+
* // Perform a reduction:
124+
* unary10d( base, [ x, y ], views, ibuf, ldims, cdims, slx, true, null, false, clbk, {} );
125+
*
126+
* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
127+
* // returns [ [ [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ] ] ]
128+
*/
129+
function unary10d( fcn, arrays, views, ibuf, ldims, cdims, strides, isRowMajor, opts, hasOpts, clbk, thisArg ) {
130+
var ybuf;
131+
var idx;
132+
var dv0;
133+
var dv1;
134+
var dv2;
135+
var dv3;
136+
var dv4;
137+
var dv5;
138+
var dv6;
139+
var dv7;
140+
var dv8;
141+
var dv9;
142+
var sh;
143+
var S0;
144+
var S1;
145+
var S2;
146+
var S3;
147+
var S4;
148+
var S5;
149+
var S6;
150+
var S7;
151+
var S8;
152+
var S9;
153+
var sv;
154+
var iv;
155+
var i0;
156+
var i1;
157+
var i2;
158+
var i3;
159+
var i4;
160+
var i5;
161+
var i6;
162+
var i7;
163+
var i8;
164+
var i9;
165+
var x;
166+
var y;
167+
var f;
168+
var i;
169+
170+
// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
171+
172+
// Cache a reference to the input ndarray:
173+
x = arrays[ 0 ];
174+
175+
// Resolve the output ndarray and associated shape:
176+
y = arrays[ 1 ];
177+
sh = y.shape;
178+
idx = zeroTo( sh.length );
179+
180+
// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
181+
if ( isRowMajor ) {
182+
// For row-major ndarrays, the last dimensions have the fastest changing indices...
183+
S0 = sh[ 9 ];
184+
S1 = sh[ 8 ];
185+
S2 = sh[ 7 ];
186+
S3 = sh[ 6 ];
187+
S4 = sh[ 5 ];
188+
S5 = sh[ 4 ];
189+
S6 = sh[ 3 ];
190+
S7 = sh[ 2 ];
191+
S8 = sh[ 1 ];
192+
S9 = sh[ 0 ];
193+
dv0 = [ strides[9] ]; // offset increment for innermost loop
194+
dv1 = [ strides[8] - ( S0*strides[9] ) ];
195+
dv2 = [ strides[7] - ( S1*strides[8] ) ];
196+
dv3 = [ strides[6] - ( S2*strides[7] ) ];
197+
dv4 = [ strides[5] - ( S3*strides[6] ) ];
198+
dv5 = [ strides[4] - ( S4*strides[5] ) ];
199+
dv6 = [ strides[3] - ( S5*strides[4] ) ];
200+
dv7 = [ strides[2] - ( S6*strides[3] ) ];
201+
dv8 = [ strides[1] - ( S7*strides[2] ) ];
202+
dv9 = [ strides[0] - ( S8*strides[1] ) ]; // offset increment for outermost loop
203+
for ( i = 1; i < arrays.length; i++ ) {
204+
sv = arrays[ i ].strides;
205+
dv0.push( sv[9] );
206+
dv1.push( sv[8] - ( S0*sv[9] ) );
207+
dv2.push( sv[7] - ( S1*sv[8] ) );
208+
dv3.push( sv[6] - ( S2*sv[7] ) );
209+
dv4.push( sv[5] - ( S3*sv[6] ) );
210+
dv5.push( sv[4] - ( S4*sv[5] ) );
211+
dv6.push( sv[3] - ( S5*sv[4] ) );
212+
dv7.push( sv[2] - ( S6*sv[3] ) );
213+
dv8.push( sv[1] - ( S7*sv[2] ) );
214+
dv9.push( sv[0] - ( S8*sv[1] ) );
215+
}
216+
} else { // order === 'column-major'
217+
// For column-major ndarrays, the first dimensions have the fastest changing indices...
218+
S0 = sh[ 0 ];
219+
S1 = sh[ 1 ];
220+
S2 = sh[ 2 ];
221+
S3 = sh[ 3 ];
222+
S4 = sh[ 4 ];
223+
S5 = sh[ 5 ];
224+
S6 = sh[ 6 ];
225+
S7 = sh[ 7 ];
226+
S8 = sh[ 8 ];
227+
S9 = sh[ 9 ];
228+
dv0 = [ strides[0] ]; // offset increment for innermost loop
229+
dv1 = [ strides[1] - ( S0*strides[0] ) ];
230+
dv2 = [ strides[2] - ( S1*strides[1] ) ];
231+
dv3 = [ strides[3] - ( S2*strides[2] ) ];
232+
dv4 = [ strides[4] - ( S3*strides[3] ) ];
233+
dv5 = [ strides[5] - ( S4*strides[4] ) ];
234+
dv6 = [ strides[6] - ( S5*strides[5] ) ];
235+
dv7 = [ strides[7] - ( S6*strides[6] ) ];
236+
dv8 = [ strides[8] - ( S7*strides[7] ) ];
237+
dv9 = [ strides[9] - ( S8*strides[8] ) ]; // offset increment for outermost loop
238+
for ( i = 1; i < arrays.length; i++ ) {
239+
sv = arrays[ i ].strides;
240+
dv0.push( sv[0] );
241+
dv1.push( sv[1] - ( S0*sv[0] ) );
242+
dv2.push( sv[2] - ( S1*sv[1] ) );
243+
dv3.push( sv[3] - ( S2*sv[2] ) );
244+
dv4.push( sv[4] - ( S3*sv[3] ) );
245+
dv5.push( sv[5] - ( S4*sv[4] ) );
246+
dv6.push( sv[6] - ( S5*sv[5] ) );
247+
dv7.push( sv[7] - ( S6*sv[6] ) );
248+
dv8.push( sv[8] - ( S7*sv[7] ) );
249+
dv9.push( sv[9] - ( S8*sv[8] ) );
250+
}
251+
idx = reverse( idx );
252+
}
253+
// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
254+
iv = offsets( arrays );
255+
256+
// Cache a reference to the output ndarray buffer:
257+
ybuf = y.data;
258+
259+
// Iterate over the non-reduced ndarray dimensions...
260+
for ( i9 = 0; i9 < S9; i9++ ) {
261+
for ( i8 = 0; i8 < S8; i8++ ) {
262+
for ( i7 = 0; i7 < S7; i7++ ) {
263+
for ( i6 = 0; i6 < S6; i6++ ) {
264+
for ( i5 = 0; i5 < S5; i5++ ) {
265+
for ( i4 = 0; i4 < S4; i4++ ) {
266+
for ( i3 = 0; i3 < S3; i3++ ) {
267+
for ( i2 = 0; i2 < S2; i2++ ) {
268+
for ( i1 = 0; i1 < S1; i1++ ) {
269+
for ( i0 = 0; i0 < S0; i0++ ) {
270+
setViewOffsets( views, iv );
271+
f = wrap( x.ref, ibuf, ldims, take( [ i9, i8, i7, i6, i5, i4, i3, i2, i1, i0 ], idx ), cdims, clbk, thisArg );
272+
ybuf[ iv[1] ] = ( hasOpts ) ? fcn( views, opts, f ) : fcn( views, f );
273+
incrementOffsets( iv, dv0 );
274+
}
275+
incrementOffsets( iv, dv1 );
276+
}
277+
incrementOffsets( iv, dv2 );
278+
}
279+
incrementOffsets( iv, dv3 );
280+
}
281+
incrementOffsets( iv, dv4 );
282+
}
283+
incrementOffsets( iv, dv5 );
284+
}
285+
incrementOffsets( iv, dv6 );
286+
}
287+
incrementOffsets( iv, dv7 );
288+
}
289+
incrementOffsets( iv, dv8 );
290+
}
291+
incrementOffsets( iv, dv9 );
292+
}
293+
}
294+
295+
296+
// EXPORTS //
297+
298+
module.exports = unary10d;

0 commit comments

Comments
 (0)