All files ndarray.js

100% Statements 116/116
100% Branches 12/12
100% Functions 1/1
100% Lines 116/116

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 113 114 115 116 1173x 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 31x 31x 31x 31x 31x 31x 31x 31x 31x 31x 31x 31x 31x 3x 3x 31x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 39x 39x 81x 81x 81x 81x 81x 81x 81x 39x 39x 20x 20x 8x 8x 8x 31x 17x 17x 17x 17x 8x 31x 17x 17x 17x 8x 31x 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 isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
var zfill = require( '@stdlib/blas/ext/base/zfill' ).ndarray;
var zcopy = require( '@stdlib/blas/base/zcopy' ).ndarray;
var reinterpret = require( '@stdlib/strided/base/reinterpret-complex128' );
 
 
// MAIN //
 
/**
* Computes the Cartesian square for a double-precision complex floating-point 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 {NonNegativeInteger} N - number of indexed elements
* @param {Complex128Array} x - input array
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {Complex128Array} 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 {Complex128Array} output array
*
* @example
* var Complex128Array = require( '@stdlib/array/complex128' );
*
* var x = new Complex128Array( [ 1.0, 2.0, 3.0, 4.0 ] );
* var out = new Complex128Array( 8 );
*
* zcartesianSquare( x.length, x, 1, 0, out, 2, 1, 0 );
* // out => <Complex128Array>[ 1.0, 2.0, 1.0, 2.0, 1.0, 2.0, 3.0, 4.0, 3.0, 4.0, 1.0, 2.0, 3.0, 4.0, 3.0, 4.0 ]
*/
function zcartesianSquare( N, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut ) { // eslint-disable-line max-len
	var viewX;
	var viewO;
	var so1;
	var so2;
	var sx;
	var ix;
	var jx;
	var io;
	var i;
	var j;
 
	if ( N <= 0 ) {
		return out;
	}
	if ( isRowMajor( [ strideOut1, strideOut2 ] ) ) {
		// Reinterpret the complex arrays as real-valued arrays:
		viewX = reinterpret( x, 0 );
		viewO = reinterpret( out, 0 );
 
		// Adjust strides and offsets according to the real-valued arrays:
		sx = strideX * 2;
		so1 = strideOut1 * 2;
		so2 = strideOut2 * 2;
		ix = offsetX * 2;
		io = offsetOut * 2;
		for ( i = 0; i < N; i++ ) {
			jx = offsetX * 2;
			for ( j = 0; j < N; j++ ) {
				viewO[ io ] = viewX[ ix ];
				viewO[ io+1 ] = viewX[ ix+1 ];
				viewO[ io+so2 ] = viewX[ jx ];
				viewO[ io+so2+1 ] = viewX[ jx+1 ];
				jx += sx;
				io += so1;
			}
			ix += sx;
		}
		return out;
	}
	// Column-major:
	ix = offsetX;
	io = offsetOut;
	for ( i = 0; i < N; i++ ) {
		zfill( N, x.get( ix ), out, strideOut1, io );
		ix += strideX;
		io += N * strideOut1;
	}
	io = offsetOut + strideOut2;
	for ( i = 0; i < N; i++ ) {
		zcopy( N, x, strideX, offsetX, out, strideOut1, io );
		io += N * strideOut1;
	}
	return out;
}
 
 
// EXPORTS //
 
module.exports = zcartesianSquare;