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 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 | 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 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 2x 2x 2x 2x 2x 2x 2x 2x 2x 6x 6x 6x 12x 12x 12x 12x 6x 2x 2x 2x 2x 2x 2x 4x 2x 2x 2x 2x 2x 2x 2x 2x 6x 6x 6x 6x 6x 6x 18x 18x 18x 6x 2x 2x 2x 4x 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';
// MAIN //
/**
* Fills the rows of a matrix from a vector of fill values.
*
* @param {integer} M - number of rows in `X`
* @param {integer} N - number of columns in `X`
* @param {Object} alpha - object of fill values
* @param {Collection} alpha.data - fill value array data
* @param {Array<Function>} alpha.accessors - array element accessors
* @param {integer} strideAlpha - stride length of `alpha`
* @param {NonNegativeInteger} offsetAlpha - starting index for `alpha`
* @param {Object} X - input matrix object
* @param {Collection} X.data - input matrix data
* @param {Array<Function>} X.accessors - array element accessors
* @param {integer} strideX1 - stride length for the first dimension of `X`
* @param {integer} strideX2 - stride length for the second dimension of `X`
* @param {NonNegativeInteger} offsetX - starting index for `X`
* @returns {Collection} input matrix
*
* @example
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
*
* var alpha = arraylike2object( toAccessorArray( [ 10.0, 20.0 ] ) );
* var X = arraylike2object( toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] ) );
*
* gfillRows( 2, 3, alpha, 1, 0, X, 1, 2, 0 );
* // X.data => [ 10.0, 20.0, 10.0, 20.0, 10.0, 20.0 ]
*/
function gfillRows( M, N, alpha, strideAlpha, offsetAlpha, X, strideX1, strideX2, offsetX ) {
var value;
var abuf;
var aget;
var xbuf;
var xset;
var ix;
var ia;
var i;
var j;
// Column-major
if ( strideX1 === 1 ) {
if ( alpha.accessorProtocol && X.accessorProtocol ) {
// Cache references to array data, accessors
abuf = alpha.data;
aget = alpha.accessors[ 0 ];
xbuf = X.data;
xset = X.accessors[ 1 ];
for ( j = 0; j < N; j++ ) {
ix = offsetX + (j * strideX2);
ia = offsetAlpha;
for ( i = 0; i < M; i++ ) {
xset( xbuf, ix, aget( abuf, ia ) );
ix += strideX1;
ia += strideAlpha;
}
}
}
else if ( alpha.accessorProtocol ) {
// Cache references to array data, accessors
abuf = alpha.data;
aget = alpha.accessors[ 0 ];
for ( j = 0; j < N; j++ ) {
ix = offsetX + (j * strideX2);
ia = offsetAlpha;
for ( i = 0; i < M; i++ ) {
X[ ix ] = aget( abuf, ia );
ix += strideX1;
ia += strideAlpha;
}
}
}
else if ( X.accessorProtocol ) {
// Cache references to array data, accessors
xbuf = X.data;
xset = X.accessors[ 1 ];
for ( j = 0; j < N; j++ ) {
ix = offsetX + (j * strideX2);
ia = offsetAlpha;
for ( i = 0; i < M; i++ ) {
xset( xbuf, ix, alpha[ ia ] );
ix += strideX1;
ia += strideAlpha;
}
}
}
return X;
}
// Row-major
if ( alpha.accessorProtocol && X.accessorProtocol ) {
// Cache references to array data, accessors
abuf = alpha.data;
aget = alpha.accessors[ 0 ];
xbuf = X.data;
xset = X.accessors[ 1 ];
for ( i = 0; i < M; i++ ) {
ix = offsetX + (i * strideX1);
ia = offsetAlpha + (i * strideAlpha);
// Cache current rows fill value
value = aget( abuf, ia );
for ( j = 0; j < N; j++ ) {
xset( xbuf, ix, value );
ix += strideX2;
}
}
}
else if ( alpha.accessorProtocol ) {
// Cache references to array data, accessors
abuf = alpha.data;
aget = alpha.accessors[ 0 ];
for ( i = 0; i < M; i++ ) {
ix = offsetX + (i * strideX1);
ia = offsetAlpha + (i * strideAlpha);
// Cache current rows fill value
value = aget( abuf, ia );
for ( j = 0; j < N; j++ ) {
X[ ix ] = value;
ix += strideX2;
}
}
}
else if ( X.accessorProtocol ) {
// Cache references to array data, accessors
xbuf = X.data;
xset = X.accessors[ 1 ];
for ( i = 0; i < M; i++ ) {
ix = offsetX + (i * strideX1);
ia = offsetAlpha + (i * strideAlpha);
value = alpha[ ia ];
for ( j = 0; j < N; j++ ) {
xset( xbuf, ix, value );
ix += strideX2;
}
}
}
return X;
}
// EXPORTS //
module.exports = gfillRows;
|