time-to-botec

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

index.js (1506B)


      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 /**
     22 * Compute the cumulative sum of strided array elements using a second-order iterative Kahan–Babuška algorithm.
     23 *
     24 * @module @stdlib/blas/ext/base/gcusumkbn2
     25 *
     26 * @example
     27 * var gcusumkbn2 = require( '@stdlib/blas/ext/base/gcusumkbn2' );
     28 *
     29 * var x = [ 1.0, -2.0, 2.0 ];
     30 * var y = [ 0.0, 0.0, 0.0 ];
     31 *
     32 * gcusumkbn2( x.length, 0.0, x, 1, y, 1 );
     33 * // y => [ 1.0, -1.0, 1.0 ]
     34 *
     35 * @example
     36 * var floor = require( '@stdlib/math/base/special/floor' );
     37 * var gcusumkbn2 = require( '@stdlib/blas/ext/base/gcusumkbn2' );
     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 * gcusumkbn2.ndarray( 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 
     47 // MODULES //
     48 
     49 var gcusumkbn2 = require( './main.js' );
     50 
     51 
     52 // EXPORTS //
     53 
     54 module.exports = gcusumkbn2;