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 | 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 4x 4x 37x 41x 16x 16x 21x 41x 2x 2x 19x 19x 19x 19x 41x 13x 13x 13x 13x 11x 28x 28x 28x 11x 13x 9x 9x 13x 2x 2x 2x 4x 4x 41x 18x 18x 18x 6x 41x 3x 3x 3x 3x 3x | /**
* @license Apache-2.0
*
* Copyright (c) 2020 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 accessors = require( './accessors.js' );
// VARIABLES //
var M = 6;
// MAIN //
/**
* Computes the sum of strided array elements using ordinary recursive summation.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {NumericArray} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {number} sum
*
* @example
* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];
*
* var v = gsumors( 4, x, 2, 1 );
* // returns 5.0
*/
function gsumors( N, x, strideX, offsetX ) {
var ix;
var m;
var s;
var o;
var i;
if ( N <= 0 ) {
return 0.0;
}
o = arraylike2object( x );
if ( o.accessorProtocol ) {
return accessors( N, o, strideX, offsetX );
}
ix = offsetX;
if ( strideX === 0 ) {
return N * x[ ix ];
}
s = x[ ix ];
ix += strideX;
// If the stride is equal to `1`, use unrolled loops...
if ( strideX === 1 ) {
m = (N-1) % M;
// If we have a remainder, run a clean-up loop...
if ( m > 0 ) {
for ( i = 0; i < m; i++ ) {
s += x[ ix ];
ix += strideX;
}
}
if ( N < M ) {
return s;
}
for ( i = m; i < N-1; i += M ) {
s += x[ix] + x[ix+1] + x[ix+2] + x[ix+3] + x[ix+4] + x[ix+5];
ix += M;
}
return s;
}
for ( i = 1; i < N; i++ ) {
s += x[ ix ];
ix += strideX;
}
return s;
}
// EXPORTS //
module.exports = gsumors;
|