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 | 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 45x 45x 45x 45x 45x 45x 45x 45x 45x 45x 3x 3x 42x 42x 45x 16x 16x 16x 26x 26x 45x 17x 34x 34x 70x 70x 70x 70x 70x 34x 34x 17x 17x 9x 45x 18x 18x 18x 18x 9x 45x 18x 18x 18x 9x 45x 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 gfill = require( '@stdlib/blas/ext/base/gfill' ).ndarray;
var gcopy = require( '@stdlib/blas/base/gcopy' ).ndarray;
var accessors = require( './accessors.js' );
// MAIN //
/**
* Computes the Cartesian square for a strided array using alternative indexing semantics.
*
* ## Notes
*
* - Pairs are stored as rows in the output matrix, where the first column contains the first element of each pair and the second column contains the second element.
*
* @param {PositiveInteger} N - number of indexed elements
* @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 ];
*
* gcartesianSquare( x.length, 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 gcartesianSquare( N, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut ) { // eslint-disable-line max-len
var xobj;
var oobj;
var ix;
var jx;
var io;
var i;
var j;
if ( N <= 0 ) {
return out;
}
xobj = arraylike2object( x );
oobj = arraylike2object( out );
if ( xobj.accessorProtocol || oobj.accessorProtocol ) {
accessors( N, xobj, strideX, offsetX, oobj, strideOut1, strideOut2, offsetOut ); // eslint-disable-line max-len
return out;
}
ix = offsetX;
io = offsetOut;
if ( isRowMajor( [ strideOut1, strideOut2 ] ) ) {
for ( i = 0; i < N; i++ ) {
jx = offsetX;
for ( j = 0; j < N; j++ ) {
out[ io ] = x[ ix ];
out[ io + strideOut2 ] = x[ jx ];
jx += strideX;
io += strideOut1;
}
ix += strideX;
}
return out;
}
// Column-major...
for ( i = 0; i < N; i++ ) {
gfill( N, x[ ix ], out, strideOut1, io );
ix += strideX;
io += N * strideOut1;
}
io = offsetOut + strideOut2;
for ( i = 0; i < N; i++ ) {
gcopy( N, x, strideX, offsetX, out, strideOut1, io );
io += N * strideOut1;
}
return out;
}
// EXPORTS //
module.exports = gcartesianSquare;
|