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 | 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 41x 41x 41x 41x 41x 41x 41x 41x 41x 41x 41x 4x 4x 37x 41x 2x 2x 35x 35x 35x 41x 12x 12x 12x 23x 23x 23x 23x 23x 41x 13x 13x 13x 13x 5x 13x 13x 13x 13x 13x 5x 13x 5x 5x 13x 140x 140x 140x 140x 140x 140x 140x 140x 140x 8x 8x 41x 30x 30x 30x 30x 30x 10x 41x 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 gscal = require( '@stdlib/blas/base/gscal' ).ndarray;
var accessors = require( './accessors.js' );
// VARIABLES //
var M = 5;
// MAIN //
/**
* Multiplies the Hadamard product of strided arrays `x` and `y` by a constant and adds the result to a strided array `z` multiplied by a constant using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {number} alpha - first scalar constant
* @param {NumericArray} x - first input array
* @param {integer} strideX - `x` stride length
* @param {NonNegativeInteger} offsetX - starting `x` index
* @param {NumericArray} y - second input array
* @param {integer} strideY - `y` stride length
* @param {NonNegativeInteger} offsetY - starting `y` index
* @param {number} beta - second scalar constant
* @param {NumericArray} z - output array
* @param {integer} strideZ - `z` stride length
* @param {NonNegativeInteger} offsetZ - starting `z` index
* @returns {NumericArray} output array
*
* @example
* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];
* var y = [ 2.0, 3.0, 4.0, 5.0, 6.0 ];
* var z = [ 1.0, 1.0, 1.0, 1.0, 1.0 ];
*
* ghad( x.length, 2.0, x, 1, 0, y, 1, 0, 3.0, z, 1, 0 );
* // z => [ 7.0, 15.0, 27.0, 43.0, 63.0 ]
*/
function ghad( N, alpha, x, strideX, offsetX, y, strideY, offsetY, beta, z, strideZ, offsetZ ) { // eslint-disable-line max-len, max-params
var ix;
var iy;
var iz;
var ox;
var oy;
var oz;
var m;
var i;
if ( N <= 0 ) {
return z;
}
// Fast path: when alpha = 0.0, delegate to gscal (z = beta * z)
if ( alpha === 0.0 ) {
return gscal( N, beta, z, strideZ, offsetZ );
}
ox = arraylike2object( x );
oy = arraylike2object( y );
oz = arraylike2object( z );
if ( ox.accessorProtocol || oy.accessorProtocol || oz.accessorProtocol ) {
accessors( N, alpha, ox, strideX, offsetX, oy, strideY, offsetY, beta, oz, strideZ, offsetZ ); // eslint-disable-line max-len
return z;
}
ix = offsetX;
iy = offsetY;
iz = offsetZ;
// Use loop unrolling if all strides are equal to `1`...
if ( strideX === 1 && strideY === 1 && strideZ === 1 ) {
m = N % M;
// If we have a remainder, run a clean-up loop...
if ( m > 0 ) {
for ( i = 0; i < m; i++ ) {
z[ iz ] = ( alpha * x[ ix ] * y[ iy ] ) + ( beta * z[ iz ] );
ix += strideX;
iy += strideY;
iz += strideZ;
}
}
if ( N < M ) {
return z;
}
for ( i = m; i < N; i += M ) {
z[ iz ] = ( alpha * x[ ix ] * y[ iy ] ) + ( beta * z[ iz ] );
z[ iz+1 ] = ( alpha * x[ ix+1 ] * y[ iy+1 ] ) + ( beta * z[ iz+1 ] );
z[ iz+2 ] = ( alpha * x[ ix+2 ] * y[ iy+2 ] ) + ( beta * z[ iz+2 ] );
z[ iz+3 ] = ( alpha * x[ ix+3 ] * y[ iy+3 ] ) + ( beta * z[ iz+3 ] );
z[ iz+4 ] = ( alpha * x[ ix+4 ] * y[ iy+4 ] ) + ( beta * z[ iz+4 ] );
ix += M;
iy += M;
iz += M;
}
return z;
}
for ( i = 0; i < N; i++ ) {
z[ iz ] = ( alpha * x[ ix ] * y[ iy ] ) + ( beta * z[ iz ] );
ix += strideX;
iy += strideY;
iz += strideZ;
}
return z;
}
// EXPORTS //
module.exports = ghad;
|