time-to-botec

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

ndarray.js (1816B)


      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 * Computes the cumulative sum of strided array elements using ordinary recursive summation.
     25 *
     26 * @param {PositiveInteger} N - number of indexed elements
     27 * @param {number} sum - initial sum
     28 * @param {NumericArray} x - input array
     29 * @param {integer} strideX - `x` stride length
     30 * @param {NonNegativeInteger} offsetX - starting index for `x`
     31 * @param {NumericArray} y - output array
     32 * @param {integer} strideY - `y` stride length
     33 * @param {NonNegativeInteger} offsetY - starting index for `y`
     34 * @returns {NumericArray} output array
     35 *
     36 * @example
     37 * var floor = require( '@stdlib/math/base/special/floor' );
     38 *
     39 * var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];
     40 * var y = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
     41 * var N = floor( x.length / 2 );
     42 *
     43 * gcusumors( N, 0.0, x, 2, 1, y, 1, 0 );
     44 * // y => [ 1.0, -1.0, 1.0, 5.0, 0.0, 0.0, 0.0, 0.0 ]
     45 */
     46 function gcusumors( N, sum, x, strideX, offsetX, y, strideY, offsetY ) {
     47 	var ix;
     48 	var iy;
     49 	var i;
     50 
     51 	if ( N <= 0 ) {
     52 		return y;
     53 	}
     54 	ix = offsetX;
     55 	iy = offsetY;
     56 	for ( i = 0; i < N; i++ ) {
     57 		sum += x[ ix ];
     58 		y[ iy ] = sum;
     59 		ix += strideX;
     60 		iy += strideY;
     61 	}
     62 	return y;
     63 }
     64 
     65 
     66 // EXPORTS //
     67 
     68 module.exports = gcusumors;