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 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 | 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 3x 73x 73x 73x 73x 73x 73x 73x 73x 73x 73x 73x 73x 73x 73x 4x 4x 69x 69x 69x 73x 34x 34x 34x 35x 73x 20x 20x 20x 20x 20x 55x 55x 55x 55x 55x 103x 103x 103x 103x 55x 55x 55x 50x 50x 50x 50x 55x 55x 20x 20x 15x 15x 15x 15x 73x 42x 42x 42x 2x 2x 42x 42x 79x 79x 79x 79x 42x 42x 42x 39x 39x 39x 39x 42x 42x 15x 73x 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.
*/
/* eslint-disable max-params */
'use strict';
// MODULES //
var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
var accessors = require( './accessors.js' );
// MAIN //
/**
* Generates a Hankel matrix using alternative indexing semantics.
*
* @param {NonNegativeInteger} M - number of indexed elements in `r` and number of rows in the output matrix
* @param {NonNegativeInteger} N - number of indexed elements in `c` and number of columns in the output matrix
* @param {Collection} r - last row of the matrix
* @param {integer} strideR - stride length for `r`
* @param {NonNegativeInteger} offsetR - starting index for `r`
* @param {Collection} c - first column of the matrix
* @param {integer} strideC - stride length for `c`
* @param {NonNegativeInteger} offsetC - starting index for `c`
* @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 matrix
*
* @example
* var r = [ 3.0, 4.0, 5.0 ];
* var c = [ 1.0, 2.0, 3.0 ];
* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
*
* ghankel( 3, 3, r, 1, 0, c, 1, 0, out, 3, 1, 0 );
* // out => [ 1.0, 2.0, 3.0, 2.0, 3.0, 4.0, 3.0, 4.0, 5.0 ]
*/
function ghankel( M, N, r, strideR, offsetR, c, strideC, offsetC, out, strideOut1, strideOut2, offsetOut ) { // eslint-disable-line max-len
var do0;
var do1;
var oo;
var or;
var oc;
var io;
var ro;
var co;
var i0;
var i1;
var f;
if ( M <= 0 || N <= 0 ) {
return out;
}
or = arraylike2object( r );
oc = arraylike2object( c );
oo = arraylike2object( out );
if ( or.accessorProtocol || oc.accessorProtocol || oo.accessorProtocol ) {
accessors( M, N, or, strideR, offsetR, oc, strideC, offsetC, oo, strideOut1, strideOut2, offsetOut ); // eslint-disable-line max-len
return out;
}
// Note on variable naming convention: S#, do#, io, i# where # corresponds to the loop number, with `0` being the innermost loop...
if ( isRowMajor( [ strideOut1, strideOut2 ] ) ) {
// Row-first iteration (inner loop walks columns):
do0 = strideOut2;
do1 = strideOut1 - ( N * strideOut2 );
io = offsetOut;
for ( i1 = 0; i1 < M; i1++ ) {
// Anti-diagonals drawn from the first column: c[i1], c[i1+1], ..., c[N-1]
f = N - i1;
if ( f < 0 ) {
f = 0;
}
co = offsetC + ( i1 * strideC );
for ( i0 = 0; i0 < f; i0++ ) {
out[ io ] = c[ co ];
co += strideC;
io += do0;
}
// Anti-diagonals drawn from the last row: r[i1+f-N+1], r[i1+f-N+2], ..., r[i1]
ro = offsetR + ( ( i1 + f - N + 1 ) * strideR );
for ( i0 = f; i0 < N; i0++ ) {
out[ io ] = r[ ro ];
ro += strideR;
io += do0;
}
io += do1;
}
return out;
}
// Column-first iteration (inner loop walks rows):
do0 = strideOut1;
do1 = strideOut2 - ( M * strideOut1 );
io = offsetOut;
for ( i1 = 0; i1 < N; i1++ ) {
// Anti-diagonals drawn from the first column: c[i1], c[i1+1], ..., c[min(N-1,i1+M-1)]
f = N - i1;
if ( f > M ) {
f = M;
}
co = offsetC + ( i1 * strideC );
for ( i0 = 0; i0 < f; i0++ ) {
out[ io ] = c[ co ];
co += strideC;
io += do0;
}
// Anti-diagonals drawn from the last row: r[1], r[2], ..., r[i1+M-N]
ro = offsetR + strideR;
for ( i0 = f; i0 < M; i0++ ) {
out[ io ] = r[ ro ];
ro += strideR;
io += do0;
}
io += do1;
}
return out;
}
// EXPORTS //
module.exports = ghankel;
|