time-to-botec

Benchmark sampling in different programming languages
Log | Files | Refs | README

ndarray.js (1580B)


      1 /**
      2 * @license Apache-2.0
      3 *
      4 * Copyright (c) 2020 The Stdlib Authors.
      5 *
      6 * Licensed under the Apache License, Version 2.0 (the "License");
      7 * you may not use this file except in compliance with the License.
      8 * You may obtain a copy of the License at
      9 *
     10 *    http://www.apache.org/licenses/LICENSE-2.0
     11 *
     12 * Unless required by applicable law or agreed to in writing, software
     13 * distributed under the License is distributed on an "AS IS" BASIS,
     14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
     15 * See the License for the specific language governing permissions and
     16 * limitations under the License.
     17 */
     18 
     19 'use strict';
     20 
     21 // MAIN //
     22 
     23 /**
     24 * Adds a constant to each strided array element and computes the sum using ordinary recursive summation.
     25 *
     26 * @param {PositiveInteger} N - number of indexed elements
     27 * @param {number} alpha - constant
     28 * @param {NumericArray} x - input array
     29 * @param {integer} stride - stride length
     30 * @param {NonNegativeInteger} offset - starting index
     31 * @returns {number} sum
     32 *
     33 * @example
     34 * var floor = require( '@stdlib/math/base/special/floor' );
     35 *
     36 * var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];
     37 * var N = floor( x.length / 2 );
     38 *
     39 * var v = gapxsumors( N, 5.0, x, 2, 1 );
     40 * // returns 25.0
     41 */
     42 function gapxsumors( N, alpha, x, stride, offset ) {
     43 	var sum;
     44 	var ix;
     45 	var i;
     46 
     47 	if ( N <= 0 ) {
     48 		return 0.0;
     49 	}
     50 	if ( N === 1 || stride === 0 ) {
     51 		return alpha + x[ offset ];
     52 	}
     53 	ix = offset;
     54 	sum = 0.0;
     55 	for ( i = 0; i < N; i++ ) {
     56 		sum += alpha + x[ ix ];
     57 		ix += stride;
     58 	}
     59 	return sum;
     60 }
     61 
     62 
     63 // EXPORTS //
     64 
     65 module.exports = gapxsumors;