@stdlib/ndarray-base-nullary-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.
@@ -0,0 +1,402 @@
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-nullary-loop-interchange-order' );
26
+ var blockSize = require( '@stdlib/ndarray-base-nullary-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
+ * Applies a one-dimensional strided array function to a list of specified dimensions in an 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 {NonNegativeIntegerArray} shape - loop dimensions
45
+ * @param {IntegerArray} stridesX - loop dimension strides for the ndarray
46
+ * @param {Object} strategyX - strategy for marshaling data to and from an ndarray view
47
+ * @param {Options} opts - function options
48
+ * @returns {void}
49
+ *
50
+ * @example
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 ndarraylike2scalar = require( '@stdlib/ndarray-base-ndarraylike2scalar' );
57
+ * var gsorthp = require( '@stdlib/blas-ext-base-gsorthp' ).ndarray;
58
+ *
59
+ * function wrapper( arrays ) {
60
+ * var x = arrays[ 0 ];
61
+ * var o = arrays[ 1 ];
62
+ * return gsorthp( numelDimension( x, 0 ), ndarraylike2scalar( o ), getData( x ), getStride( x, 0 ), getOffset( x ) );
63
+ * }
64
+ *
65
+ * // Create a data buffer:
66
+ * var xbuf = [ 12.0, 11.0, 10.0, 9.0, 8.0, 7.0, 6.0, 5.0, 4.0, 3.0, 2.0, 1.0 ];
67
+ *
68
+ * // Define an array shape:
69
+ * var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
70
+ *
71
+ * // Define the array strides:
72
+ * var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
73
+ *
74
+ * // Define the index offset:
75
+ * var ox = 0;
76
+ * var oy = 0;
77
+ *
78
+ * // Create an ndarray-like object:
79
+ * var x = {
80
+ * 'dtype': 'generic',
81
+ * 'data': xbuf,
82
+ * 'shape': xsh,
83
+ * 'strides': sx,
84
+ * 'offset': ox,
85
+ * 'order': 'row-major'
86
+ * };
87
+ *
88
+ * // Create an ndarray-like object for the sort order:
89
+ * var sortOrder = {
90
+ * 'dtype': 'generic',
91
+ * 'data': [ 1.0 ],
92
+ * 'shape': [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ],
93
+ * 'strides': [ 0, 0, 0, 0, 0, 0, 0, 0, 0 ],
94
+ * 'offset': 0,
95
+ * 'order': 'row-major'
96
+ * };
97
+ *
98
+ * // Initialize ndarray-like objects representing sub-array views:
99
+ * var views = [
100
+ * {
101
+ * 'dtype': x.dtype,
102
+ * 'data': x.data,
103
+ * 'shape': [ 2, 2 ],
104
+ * 'strides': [ 2, 1 ],
105
+ * 'offset': x.offset,
106
+ * 'order': x.order
107
+ * },
108
+ * {
109
+ * 'dtype': sortOrder.dtype,
110
+ * 'data': sortOrder.data,
111
+ * 'shape': [],
112
+ * 'strides': [ 0 ],
113
+ * 'offset': sortOrder.offset,
114
+ * 'order': sortOrder.order
115
+ * }
116
+ * ];
117
+ *
118
+ * // Define an input strategy:
119
+ * function inputStrategy( x ) {
120
+ * return {
121
+ * 'dtype': x.dtype,
122
+ * 'data': x.data,
123
+ * 'shape': [ 4 ],
124
+ * 'strides': [ 1 ],
125
+ * 'offset': x.offset,
126
+ * 'order': x.order
127
+ * };
128
+ * }
129
+ *
130
+ * // Define an output strategy:
131
+ * function outputStrategy( x ) {
132
+ * return x;
133
+ * }
134
+ *
135
+ * var strategy = {
136
+ * 'input': inputStrategy,
137
+ * 'output': outputStrategy
138
+ * }
139
+ *
140
+ * // Apply strided function:
141
+ * blockednullary9d( wrapper, [ x, sortOrder ], views, [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ], [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], strategy, {} );
142
+ *
143
+ * var arr = ndarray2array( x.data, x.shape, x.strides, x.offset, x.order );
144
+ * // returns [ [ [ [ [ [ [ [ [ [ [ 9.0, 10.0 ], [ 11.0, 12.0 ] ], [ [ 5.0, 6.0 ], [ 7.0, 8.0 ] ], [ [ 1.0, 2.0 ], [ 3.0, 4.0 ] ] ] ] ] ] ] ] ] ] ]
145
+ */
146
+ function blockednullary9d( fcn, arrays, views, shape, stridesX, strategyX, opts ) { // eslint-disable-line max-statements, max-lines-per-function
147
+ var bsize;
148
+ var dv0;
149
+ var dv1;
150
+ var dv2;
151
+ var dv3;
152
+ var dv4;
153
+ var dv5;
154
+ var dv6;
155
+ var dv7;
156
+ var dv8;
157
+ var ov1;
158
+ var ov2;
159
+ var ov3;
160
+ var ov4;
161
+ var ov5;
162
+ var ov6;
163
+ var ov7;
164
+ var ov8;
165
+ var sh;
166
+ var s0;
167
+ var s1;
168
+ var s2;
169
+ var s3;
170
+ var s4;
171
+ var s5;
172
+ var s6;
173
+ var s7;
174
+ var s8;
175
+ var sv;
176
+ var ov;
177
+ var iv;
178
+ var i0;
179
+ var i1;
180
+ var i2;
181
+ var i3;
182
+ var i4;
183
+ var i5;
184
+ var i6;
185
+ var i7;
186
+ var i8;
187
+ var j0;
188
+ var j1;
189
+ var j2;
190
+ var j3;
191
+ var j4;
192
+ var j5;
193
+ var j6;
194
+ var j7;
195
+ var j8;
196
+ var N;
197
+ var x;
198
+ var v;
199
+ var o;
200
+ var k;
201
+
202
+ // Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
203
+
204
+ N = arrays.length;
205
+ x = arrays[ 0 ];
206
+
207
+ // Resolve the loop interchange order:
208
+ o = loopOrder( shape, stridesX );
209
+ sh = o.sh;
210
+ sv = [ o.sx ];
211
+ for ( k = 1; k < N; k++ ) {
212
+ sv.push( takeIndexed( arrays[k].strides, o.idx ) );
213
+ }
214
+ // Determine the block size:
215
+ bsize = blockSize( x.dtype );
216
+
217
+ // Resolve a list of pointers to the first indexed elements in the respective ndarrays:
218
+ ov = offsets( arrays );
219
+
220
+ // Cache offset increments for the innermost loop...
221
+ dv0 = [];
222
+ for ( k = 0; k < N; k++ ) {
223
+ dv0.push( sv[k][0] );
224
+ }
225
+ // Initialize loop variables...
226
+ ov1 = zeros( N );
227
+ ov2 = zeros( N );
228
+ ov3 = zeros( N );
229
+ ov4 = zeros( N );
230
+ ov5 = zeros( N );
231
+ ov6 = zeros( N );
232
+ ov7 = zeros( N );
233
+ ov8 = zeros( N );
234
+ dv1 = zeros( N );
235
+ dv2 = zeros( N );
236
+ dv3 = zeros( N );
237
+ dv4 = zeros( N );
238
+ dv5 = zeros( N );
239
+ dv6 = zeros( N );
240
+ dv7 = zeros( N );
241
+ dv8 = zeros( N );
242
+ iv = zeros( N );
243
+
244
+ // 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:
245
+ v = copyIndexed( views );
246
+
247
+ // Iterate over blocks...
248
+ for ( j8 = sh[8]; j8 > 0; ) {
249
+ if ( j8 < bsize ) {
250
+ s8 = j8;
251
+ j8 = 0;
252
+ } else {
253
+ s8 = bsize;
254
+ j8 -= bsize;
255
+ }
256
+ for ( k = 0; k < N; k++ ) {
257
+ ov8[ k ] = ov[k] + ( j8*sv[k][8] );
258
+ }
259
+ for ( j7 = sh[7]; j7 > 0; ) {
260
+ if ( j7 < bsize ) {
261
+ s7 = j7;
262
+ j7 = 0;
263
+ } else {
264
+ s7 = bsize;
265
+ j7 -= bsize;
266
+ }
267
+ for ( k = 0; k < N; k++ ) {
268
+ dv8 = sv[k][8] - ( s7*sv[k][7] );
269
+ ov7[ k ] = ov8[k] + ( j7*sv[k][7] );
270
+ }
271
+ for ( j6 = sh[6]; j6 > 0; ) {
272
+ if ( j6 < bsize ) {
273
+ s6 = j6;
274
+ j6 = 0;
275
+ } else {
276
+ s6 = bsize;
277
+ j6 -= bsize;
278
+ }
279
+ for ( k = 0; k < N; k++ ) {
280
+ dv7 = sv[k][7] - ( s6*sv[k][6] );
281
+ ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
282
+ }
283
+ for ( j5 = sh[5]; j5 > 0; ) {
284
+ if ( j5 < bsize ) {
285
+ s5 = j5;
286
+ j5 = 0;
287
+ } else {
288
+ s5 = bsize;
289
+ j5 -= bsize;
290
+ }
291
+ for ( k = 0; k < N; k++ ) {
292
+ dv6 = sv[k][6] - ( s5*sv[k][5] );
293
+ ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
294
+ }
295
+ for ( j4 = sh[4]; j4 > 0; ) {
296
+ if ( j4 < bsize ) {
297
+ s4 = j4;
298
+ j4 = 0;
299
+ } else {
300
+ s4 = bsize;
301
+ j4 -= bsize;
302
+ }
303
+ for ( k = 0; k < N; k++ ) {
304
+ dv5 = sv[k][5] - ( s4*sv[k][4] );
305
+ ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
306
+ }
307
+ for ( j3 = sh[3]; j3 > 0; ) {
308
+ if ( j3 < bsize ) {
309
+ s3 = j3;
310
+ j3 = 0;
311
+ } else {
312
+ s3 = bsize;
313
+ j3 -= bsize;
314
+ }
315
+ for ( k = 0; k < N; k++ ) {
316
+ dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
317
+ ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
318
+ }
319
+ for ( j2 = sh[2]; j2 > 0; ) {
320
+ if ( j2 < bsize ) {
321
+ s2 = j2;
322
+ j2 = 0;
323
+ } else {
324
+ s2 = bsize;
325
+ j2 -= bsize;
326
+ }
327
+ for ( k = 0; k < N; k++ ) {
328
+ dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
329
+ ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
330
+ }
331
+ for ( j1 = sh[1]; j1 > 0; ) {
332
+ if ( j1 < bsize ) {
333
+ s1 = j1;
334
+ j1 = 0;
335
+ } else {
336
+ s1 = bsize;
337
+ j1 -= bsize;
338
+ }
339
+ for ( k = 0; k < N; k++ ) {
340
+ dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
341
+ ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
342
+ }
343
+ for ( j0 = sh[0]; j0 > 0; ) {
344
+ if ( j0 < bsize ) {
345
+ s0 = j0;
346
+ j0 = 0;
347
+ } else {
348
+ s0 = bsize;
349
+ j0 -= bsize;
350
+ }
351
+ // Compute index offsets and loop offset increments for the first ndarray elements in the current block...
352
+ for ( k = 0; k < N; k++ ) {
353
+ iv[ k ] = ov1[k] + ( j0*sv[k][0] );
354
+ dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
355
+ }
356
+ // Iterate over the loop dimensions...
357
+ for ( i8 = 0; i8 < s8; i8++ ) {
358
+ for ( i7 = 0; i7 < s7; i7++ ) {
359
+ for ( i6 = 0; i6 < s6; i6++ ) {
360
+ for ( i5 = 0; i5 < s5; i5++ ) {
361
+ for ( i4 = 0; i4 < s4; i4++ ) {
362
+ for ( i3 = 0; i3 < s3; i3++ ) {
363
+ for ( i2 = 0; i2 < s2; i2++ ) {
364
+ for ( i1 = 0; i1 < s1; i1++ ) {
365
+ for ( i0 = 0; i0 < s0; i0++ ) {
366
+ setViewOffsets( views, iv );
367
+ v[ 0 ] = strategyX.input( views[ 0 ] );
368
+ fcn( v, opts );
369
+ strategyX.output( views[ 0 ] );
370
+ incrementOffsets( iv, dv0 );
371
+ }
372
+ incrementOffsets( iv, dv1 );
373
+ }
374
+ incrementOffsets( iv, dv2 );
375
+ }
376
+ incrementOffsets( iv, dv3 );
377
+ }
378
+ incrementOffsets( iv, dv4 );
379
+ }
380
+ incrementOffsets( iv, dv5 );
381
+ }
382
+ incrementOffsets( iv, dv6 );
383
+ }
384
+ incrementOffsets( iv, dv7 );
385
+ }
386
+ incrementOffsets( iv, dv8 );
387
+ }
388
+ }
389
+ }
390
+ }
391
+ }
392
+ }
393
+ }
394
+ }
395
+ }
396
+ }
397
+ }
398
+
399
+
400
+ // EXPORTS //
401
+
402
+ module.exports = blockednullary9d;
@@ -0,0 +1,43 @@
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
+ 'use strict';
20
+
21
+ // MAIN //
22
+
23
+ /**
24
+ * Returns default options.
25
+ *
26
+ * @private
27
+ * @returns {Object} default options
28
+ *
29
+ * @example
30
+ * var o = defaults();
31
+ * // returns {...}
32
+ */
33
+ function defaults() {
34
+ return {
35
+ // Require that the order of element traversal match the memory layout of the target ndarray:
36
+ 'strictTraversalOrder': false
37
+ };
38
+ }
39
+
40
+
41
+ // EXPORTS //
42
+
43
+ module.exports = defaults;
package/lib/factory.js ADDED
@@ -0,0 +1,172 @@
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
+ 'use strict';
20
+
21
+ // MODULES //
22
+
23
+ var isFunction = require( '@stdlib/assert-is-function' );
24
+ var mainFactory = require( './main_factory.js' );
25
+ var main = require( './main.js' );
26
+
27
+
28
+ // MAIN //
29
+
30
+ /**
31
+ * Return a function for applying a one-dimensional strided array function to a list of specified dimensions in an ndarray.
32
+ *
33
+ * @param {Function} [fcn] - wrapper for a one-dimensional strided array function
34
+ * @param {Options} [options] - function options
35
+ * @param {boolean} [options.strictTraversalOrder=false] - boolean specifying whether to require that element traversal match the memory layout of the target ndarray
36
+ * @throws {TypeError} options argument must be an object
37
+ * @throws {TypeError} must provide valid options
38
+ * @returns {Function} function for applying a strided array function
39
+ *
40
+ * @example
41
+ * var ndarray2array = require( '@stdlib/ndarray-base-to-array' );
42
+ * var getStride = require( '@stdlib/ndarray-base-stride' );
43
+ * var getOffset = require( '@stdlib/ndarray-base-offset' );
44
+ * var getData = require( '@stdlib/ndarray-base-data-buffer' );
45
+ * var numelDimension = require( '@stdlib/ndarray-base-numel-dimension' );
46
+ * var ndarraylike2scalar = require( '@stdlib/ndarray-base-ndarraylike2scalar' );
47
+ * var gsorthp = require( '@stdlib/blas-ext-base-gsorthp' ).ndarray;
48
+ *
49
+ * function wrapper( arrays ) {
50
+ * var x = arrays[ 0 ];
51
+ * var o = arrays[ 1 ];
52
+ * return gsorthp( numelDimension( x, 0 ), ndarraylike2scalar( o ), getData( x ), getStride( x, 0 ), getOffset( x ) );
53
+ * }
54
+ *
55
+ * // Create a data buffer:
56
+ * var xbuf = [ 12.0, 11.0, 10.0, 9.0, 8.0, 7.0, 6.0, 5.0, 4.0, 3.0, 2.0, 1.0 ];
57
+ *
58
+ * // Define an array shape:
59
+ * var xsh = [ 1, 3, 2, 2 ];
60
+ *
61
+ * // Define the array strides:
62
+ * var sx = [ 12, 4, 2, 1 ];
63
+ *
64
+ * // Define the index offset:
65
+ * var ox = 0;
66
+ *
67
+ * // Create an ndarray-like object:
68
+ * var x = {
69
+ * 'dtype': 'generic',
70
+ * 'data': xbuf,
71
+ * 'shape': xsh,
72
+ * 'strides': sx,
73
+ * 'offset': ox,
74
+ * 'order': 'row-major'
75
+ * };
76
+ *
77
+ * // Create an ndarray-like object for the sort order:
78
+ * var sortOrder = {
79
+ * 'dtype': 'generic',
80
+ * 'data': [ 1.0 ],
81
+ * 'shape': [ 1, 3 ],
82
+ * 'strides': [ 0, 0 ],
83
+ * 'offset': 0,
84
+ * 'order': 'row-major'
85
+ * };
86
+ *
87
+ * // Create a function for applying a strided function:
88
+ * var sorthp = factory( wrapper );
89
+ * // returns <Function>
90
+ *
91
+ * // Apply strided function:
92
+ * sorthp( [ x, sortOrder ], [ 2, 3 ] );
93
+ *
94
+ * var arr = ndarray2array( x.data, x.shape, x.strides, x.offset, x.order );
95
+ * // returns [ [ [ [ 9.0, 10.0 ], [ 11.0, 12.0 ] ], [ [ 5.0, 6.0 ], [ 7.0, 8.0 ] ], [ [ 1.0, 2.0 ], [ 3.0, 4.0 ] ] ] ]
96
+ */
97
+ function factory() {
98
+ var nullary;
99
+ var nargs;
100
+ var fcn;
101
+ var f;
102
+
103
+ nargs = arguments.length;
104
+
105
+ // Case: factory()
106
+ if ( nargs === 0 ) {
107
+ nullary = main;
108
+ f = wrap;
109
+ }
110
+ // Case: factory( fcn, opts )
111
+ else if ( nargs > 1 ) {
112
+ nullary = mainFactory( arguments[ 1 ] );
113
+ fcn = arguments[ 0 ];
114
+ f = apply;
115
+ }
116
+ // Case: factory( fcn )
117
+ else if ( isFunction( arguments[ 0 ] ) ) {
118
+ nullary = main;
119
+ fcn = arguments[ 0 ];
120
+ f = apply;
121
+ }
122
+ // Case: factory( opts )
123
+ else {
124
+ nullary = mainFactory( arguments[ 0 ] );
125
+ f = wrap;
126
+ }
127
+ return f;
128
+
129
+ /**
130
+ * Applies a one-dimensional strided array function to a list of specified dimensions in an ndarray.
131
+ *
132
+ * @private
133
+ * @param {ArrayLikeObject<Object>} arrays - array-like object containing ndarrays
134
+ * @param {IntegerArray} dims - list of dimensions to which to apply a strided array function
135
+ * @param {Options} [options] - function options
136
+ * @returns {void}
137
+ */
138
+ function apply( arrays, dims, options ) {
139
+ var opts;
140
+ if ( arguments.length > 2 ) {
141
+ opts = options;
142
+ } else {
143
+ opts = {};
144
+ }
145
+ return nullary( fcn, arrays, dims, opts );
146
+ }
147
+
148
+ /**
149
+ * Applies a one-dimensional strided array function to a list of specified dimensions in an ndarray.
150
+ *
151
+ * @private
152
+ * @param {Function} fcn - wrapper for a one-dimensional strided array function
153
+ * @param {ArrayLikeObject<Object>} arrays - array-like object containing ndarrays
154
+ * @param {IntegerArray} dims - list of dimensions to which to apply a strided array function
155
+ * @param {Options} [options] - function options
156
+ * @returns {void}
157
+ */
158
+ function wrap( fcn, arrays, dims, options ) {
159
+ var opts;
160
+ if ( arguments.length > 3 ) {
161
+ opts = options;
162
+ } else {
163
+ opts = {};
164
+ }
165
+ return nullary( fcn, arrays, dims, opts );
166
+ }
167
+ }
168
+
169
+
170
+ // EXPORTS //
171
+
172
+ module.exports = factory;
@@ -0,0 +1,46 @@
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
+ 'use strict';
20
+
21
+ // MAIN //
22
+
23
+ /**
24
+ * Increments index offsets according to a list of increments.
25
+ *
26
+ * ## Notes
27
+ *
28
+ * - This function mutates the list of index offsets.
29
+ *
30
+ * @private
31
+ * @param {NonNegativeIntegerArray} offsets - list of index offsets
32
+ * @param {NonNegativeIntegerArray} inc - list of increments
33
+ * @returns {NonNegativeIntegerArray} updated offsets
34
+ */
35
+ function incrementOffsets( offsets, inc ) {
36
+ var i;
37
+ for ( i = 0; i < offsets.length; i++ ) {
38
+ offsets[ i ] += inc[ i ];
39
+ }
40
+ return offsets;
41
+ }
42
+
43
+
44
+ // EXPORTS //
45
+
46
+ module.exports = incrementOffsets;