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 | 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 36x 36x 36x 36x 36x 36x 10x 10x 36x 13x 1x 1x 13x 1x 1x 24x 24x 24x 24x 24x 36x 2x 2x 2x 2x 2x | /**
* @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 isLayout = require( '@stdlib/blas/base/assert/is-layout' );
var isColumnMajor = require( '@stdlib/ndarray/base/assert/is-column-major-string' );
var resolveOrder = require( '@stdlib/blas/base/layout-resolve-enum' );
var max = require( '@stdlib/math/base/special/fast/max' );
var format = require( '@stdlib/string/format' );
var reinterpret = require( '@stdlib/strided/base/reinterpret-complex128' );
var addon = require( './../src/addon.node' );
// MAIN //
/**
* Computes the Cartesian product for two double-precision complex strided arrays.
*
* ## 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 {string} order - storage layout
* @param {NonNegativeInteger} M - number of indexed elements in `x`
* @param {NonNegativeInteger} N - number of indexed elements in `y`
* @param {Complex128Array} x - first input array
* @param {integer} strideX - stride length for `x`
* @param {Complex128Array} y - second input array
* @param {integer} strideY - stride length for `y`
* @param {Complex128Array} out - output array
* @param {integer} LDO - stride length between successive contiguous vectors of the matrix `out` (a.k.a., leading dimension of `out`)
* @throws {TypeError} first argument must be a valid order
* @throws {RangeError} ninth argument must be a valid stride length
* @returns {Complex128Array} output array
*
* @example
* var Complex128Array = require( '@stdlib/array/complex128' );
*
* var x = new Complex128Array( [ 1.0, 0.0, 2.0, 0.0 ] );
* var y = new Complex128Array( [ 3.0, 0.0, 4.0, 0.0 ] );
* var out = new Complex128Array( 8 );
*
* zcartesianProduct( 'row-major', x.length, y.length, x, 1, y, 1, out, 2 );
* // out => <Complex128Array>[ 1.0, 0.0, 3.0, 0.0, 1.0, 0.0, 4.0, 0.0, 2.0, 0.0, 3.0, 0.0, 2.0, 0.0, 4.0, 0.0 ]
*/
function zcartesianProduct( order, M, N, x, strideX, y, strideY, out, LDO ) {
var xView;
var yView;
var oView;
if ( !isLayout( order ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a valid order. Value: `%s`.', order ) );
}
if ( isColumnMajor( order ) ) {
if ( LDO < max( 1, M*N ) ) {
throw new RangeError( format( 'invalid argument. Ninth argument must be greater than or equal to max(1,%d). Value: `%d`.', M*N, LDO ) );
}
} else if ( LDO < 2 ) { // order === 'row-major'
throw new RangeError( format( 'invalid argument. Ninth argument must be greater than or equal to max(1,%d). Value: `%d`.', 2, LDO ) );
}
xView = reinterpret( x, 0 );
yView = reinterpret( y, 0 );
oView = reinterpret( out, 0 );
addon( resolveOrder( order ), M, N, xView, strideX, yView, strideY, oView, LDO );
return out;
}
// EXPORTS //
module.exports = zcartesianProduct;
|