Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 | 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 51x 51x 51x 51x 51x 51x 51x 51x 51x 51x 51x 51x 51x 51x 6x 6x 45x 45x 51x 17x 17x 17x 28x 51x 20x 20x 79x 79x 171x 171x 171x 171x 171x 171x 79x 79x 51x 8x 8x 17x 17x 17x 80x 80x 80x 80x 80x 17x 8x 28x 51x 3x 3x 3x 3x 3x | /**
* @license Apache-2.0
*
* Copyright (c) 2026 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 arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
var pow = require( '@stdlib/math/base/special/pow' );
var accessors = require( './accessors.js' );
// MAIN //
/**
* Computes the Cartesian power for a strided array using alternative indexing semantics.
*
* ## Notes
*
* - `k`-tuples are stored as rows in the output matrix, where the `j`-th column contains the `j`-th element of each tuple.
*
* @param {NonNegativeInteger} N - number of indexed elements
* @param {NonNegativeInteger} k - power
* @param {Collection} x - input array
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {Collection} out - output array
* @param {integer} strideOut1 - stride length for the first dimension of `out`
* @param {integer} strideOut2 - stride length for the second dimension of `out`
* @param {NonNegativeInteger} offsetOut - starting index for `out`
* @returns {Collection} output array
*
* @example
* var x = [ 1.0, 2.0 ];
* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
*
* gcartesianPower( x.length, 2, x, 1, 0, out, 2, 1, 0 );
* // out => [ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ]
*/
function gcartesianPower( N, k, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut ) { // eslint-disable-line max-len
var len;
var ox;
var oo;
var oj;
var io;
var ix;
var sj;
var i;
var j;
var s;
var t;
if ( N <= 0 || k <= 0 ) {
return out;
}
ox = arraylike2object( x );
oo = arraylike2object( out );
if ( ox.accessorProtocol || oo.accessorProtocol ) {
accessors( N, k, ox, strideX, offsetX, oo, strideOut1, strideOut2, offsetOut ); // eslint-disable-line max-len
return out;
}
len = pow( N, k );
if ( isRowMajor( [ strideOut1, strideOut2 ] ) ) {
io = offsetOut;
for ( i = 0; i < len; i++ ) {
t = i;
for ( j = k-1; j >= 0; j-- ) {
s = t % N;
t = (t-s) / N;
ix = offsetX + (s*strideX);
oj = io + (j*strideOut2);
out[ oj ] = x[ ix ];
}
io += strideOut1;
}
} else { // isColMajor
sj = len;
for ( j = 0; j < k; j++ ) {
sj /= N;
io = offsetOut + (j*strideOut2);
for ( i = 0; i < len; i++ ) {
s = ((i-(i%sj))/sj) % N;
ix = offsetX + (s*strideX);
out[ io ] = x[ ix ];
io += strideOut1;
}
}
}
return out;
}
// EXPORTS //
module.exports = gcartesianPower;
|