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 | 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 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 52x 52x 52x 52x 52x 52x 4x 4x 48x 48x 52x 38x 38x 52x 10x 10x 10x 48x 52x 4x 4x 44x 44x 44x 44x 44x 44x 52x 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 gfill = require( '@stdlib/blas/ext/base/gfill' ).ndarray;
var min = require( '@stdlib/math/base/special/fast/min' );
// MAIN //
/**
* Fills the diagonal of a matrix with a specified scalar constant using alternative indexing semantics.
*
* @param {integer} M - number of rows in `A`
* @param {integer} N - number of columns in `A`
* @param {integer} k - starting index for the diagonal
* @param {*} alpha - scalar constant
* @param {Collection} A - input matrix
* @param {integer} strideA1 - stride length for the first dimension of `A`
* @param {integer} strideA2 - stride length for the second dimension of `A`
* @param {NonNegativeInteger} offsetA - starting index for `A`
* @returns {Collection} input matrix
*
* @example
* var A = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
*
* gfillDiagonal( 2, 3, 0, 7.0, A, 3, 1, 0 );
* // A => [ 7.0, 2.0, 3.0, 4.0, 7.0, 6.0 ]
*
* @example
* var A = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
*
* gfillDiagonal( 2, 3, 0, 7.0, A, 1, 2, 0 );
* // A => [ 7.0, 2.0, 3.0, 7.0, 5.0, 6.0 ]
*
* @example
* var A = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
*
* gfillDiagonal( 2, 3, 1, 8.0, A, 3, 1, 0 );
* // A => [ 1.0, 8.0, 3.0, 4.0, 5.0, 8.0 ]
*
* @example
* var A = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
*
* gfillDiagonal( 2, 3, -1, 9.0, A, 3, 1, 0 );
* // A => [ 1.0, 2.0, 3.0, 9.0, 5.0, 6.0 ]
*
* @example
* var A = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ];
*
* gfillDiagonal( 2, 3, 0, 10.0, A, 4, 1, 5 );
* // A => [ 1.0, 2.0, 3.0, 4.0, 5.0, 10.0, 7.0, 8.0, 9.0, 10.0, 10.0, 12.0 ]
*/
function gfillDiagonal( M, N, k, alpha, A, strideA1, strideA2, offsetA ) {
var dStride;
var offset;
var nDiag;
if ( M <= 0 || N <= 0 ) {
return A;
}
// Determine the number of elements on the diagonal...
if ( k >= 0 ) {
nDiag = min( M, N - k );
offset = offsetA + (k * strideA2);
} else {
nDiag = min( M + k, N );
offset = offsetA - (k * strideA1);
}
if ( nDiag <= 0 ) {
return A;
}
// The diagonal stride is the sum of strides for moving to the next diagonal element:
dStride = strideA1 + strideA2;
// Fill the diagonal:
return gfill( nDiag, alpha, A, dStride, offset );
}
// EXPORTS //
module.exports = gfillDiagonal;
|