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 | 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 80x 80x 80x 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 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 4x 4x 58x 58x 58x 58x 62x 18x 18x 18x 40x 40x 62x 8x 8x 8x 40x 40x 62x 8x 8x 8x 40x 40x 40x 40x 40x 40x 40x 62x 32x 70x 70x 70x 70x 70x 38x 70x 32x 32x 70x 62x 8x 16x 16x 16x 16x 36x 36x 36x 36x 36x 20x 36x 16x 16x 36x 16x 8x 40x 62x 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-len, max-params */
'use strict';
// MODULES //
var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var consensusOrder = require( '@stdlib/ndarray/base/consensus-order' );
var gcopy = require( '@stdlib/blas/base/gcopy' ).ndarray;
var accessors = require( './accessors.js' );
// FUNCTIONS //
/**
* Tests whether a character matches a known transpose operation.
*
* @private
* @param {string} str - input value
* @returns {boolean} boolean indicating whether the input value is a recognized transpose operation
*
* @example
* var bool = isTransposed( 'transpose' );
* // returns true
*
* @example
* var bool = isTransposed( 'no-transpose' );
* // returns false
*/
function isTransposed( str ) {
return ( str !== 'no-transpose' );
}
// MAIN //
/**
* Takes rows from one of two input matrices depending on a condition.
*
* @private
* @param {(integer|string)} transA - specifies whether `A` should be transposed or not transposed
* @param {(integer|string)} transB - specifies whether `B` should be transposed or not transposed
* @param {NonNegativeInteger} M - number of indexed elements in `condition` and number of rows in `op(A)`, `op(B)`, and `out`
* @param {NonNegativeInteger} N - number of columns in `op(A)`, `op(B)` and `out`
* @param {Collection} condition - condition array
* @param {integer} strideC - stride length for `condition`
* @param {NonNegativeInteger} offsetC - starting index for `condition`
* @param {Collection} A - first 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`
* @param {Collection} B - second input matrix
* @param {integer} strideB1 - stride length for the first dimension of `B`
* @param {integer} strideB2 - stride length for the second dimension of `B`
* @param {NonNegativeInteger} offsetB - starting index for `B`
* @param {Collection} out - output matrix
* @param {integer} strideO1 - stride length for the first dimension of `out`
* @param {integer} strideO2 - stride length for the second dimension of `out`
* @param {NonNegativeInteger} offsetO - starting index for `out`
* @returns {Collection} output matrix
*
* @example
* var A = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
* var B = [ 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ];
* var condition = [ 1, 0 ];
* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
*
* base( 'no-transpose', 'no-transpose', 2, 3, condition, 1, 0, A, 3, 1, 0, B, 3, 1, 0, out, 3, 1, 0 );
* // out => [ 1.0, 2.0, 3.0, 10.0, 11.0, 12.0 ]
*/
function base( transA, transB, M, N, condition, strideC, offsetC, A, strideA1, strideA2, offsetA, B, strideB1, strideB2, offsetB, out, strideO1, strideO2, offsetO ) {
var rowOffsetOut;
var colOffsetOut;
var rowOffsetA;
var rowOffsetB;
var colOffsetA;
var colOffsetB;
var order;
var sa1;
var sa2;
var sb1;
var sb2;
var oc;
var oa;
var ob;
var oo;
var ic;
var ia;
var ib;
var io;
var i;
var j;
if ( M <= 0 || N <= 0 ) {
return out;
}
oc = arraylike2object( condition );
oa = arraylike2object( A );
ob = arraylike2object( B );
oo = arraylike2object( out );
if ( oc.accessorProtocol || oa.accessorProtocol || ob.accessorProtocol || oo.accessorProtocol ) {
accessors( transA, transB, M, N, oc, strideC, offsetC, oa, strideA1, strideA2, offsetA, ob, strideB1, strideB2, offsetB, oo, strideO1, strideO2, offsetO );
return out;
}
sa1 = strideA1;
sa2 = strideA2;
if ( isTransposed( transA ) ) {
sa1 = strideA2;
sa2 = strideA1;
}
sb1 = strideB1;
sb2 = strideB2;
if ( isTransposed( transB ) ) {
sb1 = strideB2;
sb2 = strideB1;
}
// Determine consensus order:
order = consensusOrder([
[ sa1, sa2 ],
[ sb1, sb2 ],
[ strideO1, strideO2 ]
]);
if ( order === 'row-major' ) {
for ( i = 0; i < M; i++ ) {
ic = offsetC + ( i * strideC );
rowOffsetA = offsetA + ( i * sa1 );
rowOffsetB = offsetB + ( i * sb1 );
rowOffsetOut = offsetO + ( i * strideO1 );
if ( condition[ ic ] ) {
gcopy( N, A, sa2, rowOffsetA, out, strideO2, rowOffsetOut );
} else {
gcopy( N, B, sb2, rowOffsetB, out, strideO2, rowOffsetOut );
}
}
} else {
for ( j = 0; j < N; j++ ) {
colOffsetA = offsetA + ( j * sa2 );
colOffsetB = offsetB + ( j * sb2 );
colOffsetOut = offsetO + ( j * strideO2 );
for ( i = 0; i < M; i++ ) {
ic = offsetC + ( i * strideC );
ia = colOffsetA + ( i * sa1 );
ib = colOffsetB + ( i * sb1 );
io = colOffsetOut + ( i * strideO1 );
if ( condition[ ic ] ) {
out[ io ] = A[ ia ];
} else {
out[ io ] = B[ ib ];
}
}
}
}
return out;
}
// EXPORTS //
module.exports = base;
|