time-to-botec

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

main.js (1779B)


      1 /**
      2 * @license Apache-2.0
      3 *
      4 * Copyright (c) 2018 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 // MODULES //
     22 
     23 var abs = require( '@stdlib/math/base/special/abs' );
     24 
     25 
     26 // VARIABLES //
     27 
     28 var M = 6;
     29 
     30 
     31 // MAIN //
     32 
     33 /**
     34 * Computes the sum of absolute values.
     35 *
     36 * @param {PositiveInteger} N - number of values to sum
     37 * @param {NumericArray} x - input array
     38 * @param {PositiveInteger} stride - `x` stride length
     39 * @returns {number} sum
     40 *
     41 * @example
     42 * var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0, 5.0 ] );
     43 *
     44 * var s = gasum( x.length, x, 1 );
     45 * // 15.0
     46 */
     47 function gasum( N, x, stride ) {
     48 	var sum;
     49 	var m;
     50 	var i;
     51 
     52 	sum = 0.0;
     53 	if ( N <= 0 || stride <= 0 ) {
     54 		return sum;
     55 	}
     56 	// Use unrolled loops if the stride is equal to `1`...
     57 	if ( stride === 1 ) {
     58 		m = N % M;
     59 
     60 		// If we have a remainder, run a clean-up loop...
     61 		if ( m > 0 ) {
     62 			for ( i = 0; i < m; i++ ) {
     63 				sum += abs( x[i] );
     64 			}
     65 		}
     66 		if ( N < M ) {
     67 			return sum;
     68 		}
     69 		for ( i = m; i < N; i += M ) {
     70 			sum += abs(x[i]) + abs(x[i+1]) + abs(x[i+2]) + abs(x[i+3]) + abs(x[i+4]) + abs(x[i+5]); // eslint-disable-line max-len
     71 		}
     72 		return sum;
     73 	}
     74 	N *= stride;
     75 	for ( i = 0; i < N; i += stride ) {
     76 		sum += abs( x[i] );
     77 	}
     78 	return sum;
     79 }
     80 
     81 
     82 // EXPORTS //
     83 
     84 module.exports = gasum;