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 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 | 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 85x 85x 85x 85x 85x 85x 85x 85x 85x 85x 85x 85x 85x 85x 85x 85x 85x 85x 6x 6x 79x 79x 79x 79x 79x 79x 85x 39x 39x 39x 40x 85x 26x 26x 26x 26x 26x 101x 101x 101x 101x 101x 43x 43x 101x 101x 37x 37x 101x 101x 44x 44x 44x 101x 101x 101x 197x 197x 197x 197x 101x 101x 53x 53x 53x 101x 101x 85x 14x 14x 14x 14x 14x 44x 44x 44x 8x 8x 44x 44x 10x 10x 44x 44x 31x 31x 31x 44x 44x 44x 111x 111x 111x 111x 44x 44x 28x 28x 28x 44x 44x 14x 40x 85x 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 resolveMode = require( './mode.js' );
var accessors = require( './accessors.js' );
// MAIN //
/**
* Generates a convolution matrix using alternative indexing semantics.
*
* @param {string} mode - convolution mode
* @param {NonNegativeInteger} m - number of indexed elements in `x`
* @param {NonNegativeInteger} N - number of columns in the output matrix
* @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 matrix
*
* @example
* var x = [ 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, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
*
* gconvolutionMatrix( 'full', 3, 3, x, 1, 0, out, 3, 1, 0 );
* // out => [ 1.0, 0.0, 0.0, 2.0, 1.0, 0.0, 3.0, 2.0, 1.0, 0.0, 3.0, 2.0, 0.0, 0.0, 3.0 ]
*/
function gconvolutionMatrix( mode, m, N, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut ) { // eslint-disable-line max-len
var startRow;
var jstart;
var istart;
var jend;
var iend;
var do0;
var do1;
var tmp;
var ox;
var oo;
var io;
var ix;
var k;
var i;
var j;
if ( m <= 0 || N <= 0 ) {
return out;
}
tmp = resolveMode( mode, m, N, [ 0, 0 ] );
k = tmp[ 0 ];
startRow = tmp[ 1 ];
ox = arraylike2object( x );
oo = arraylike2object( out );
if ( ox.accessorProtocol || oo.accessorProtocol ) {
accessors( k, startRow, m, N, ox, strideX, offsetX, 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 ( i = 0; i < k; i++ ) {
tmp = i + startRow;
// Compute the valid column range:
jstart = tmp - m + 1;
if ( jstart < 0 ) {
jstart = 0;
}
jend = tmp;
if ( jend > N - 1 ) {
jend = N - 1;
}
// Leading zeros:
for ( j = 0; j < jstart; j++ ) {
out[ io ] = 0.0;
io += do0;
}
// Values from `x` (index decreases as column increases):
ix = offsetX + ( ( tmp - jstart ) * strideX );
for ( j = jstart; j <= jend; j++ ) {
out[ io ] = x[ ix ];
ix -= strideX;
io += do0;
}
// Trailing zeros:
for ( j = jend + 1; j < N; j++ ) {
out[ io ] = 0.0;
io += do0;
}
io += do1;
}
} else {
// Column-first iteration (inner loop walks rows):
do0 = strideOut1;
do1 = strideOut2 - ( k * strideOut1 );
io = offsetOut;
for ( j = 0; j < N; j++ ) {
// Compute the valid row range:
istart = j - startRow;
if ( istart < 0 ) {
istart = 0;
}
iend = j - startRow + m - 1;
if ( iend > k - 1 ) {
iend = k - 1;
}
// Leading zeros:
for ( i = 0; i < istart; i++ ) {
out[ io ] = 0.0;
io += do0;
}
// Values from `x` (index increases as row increases):
ix = offsetX + ( ( istart + startRow - j ) * strideX );
for ( i = istart; i <= iend; i++ ) {
out[ io ] = x[ ix ];
ix += strideX;
io += do0;
}
// Trailing zeros:
for ( i = iend + 1; i < k; i++ ) {
out[ io ] = 0.0;
io += do0;
}
io += do1;
}
}
return out;
}
// EXPORTS //
module.exports = gconvolutionMatrix;
|