time-to-botec

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

ndarray.js (1893B)


      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 {integer} stride - `x` stride length
     39 * @param {NonNegativeInteger} offset - starting `x` index
     40 * @returns {number} sum
     41 *
     42 * @example
     43 * var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0, 5.0 ] );
     44 *
     45 * var s = gasum( x.length, x, 1, 0 );
     46 * // 15.0
     47 */
     48 function gasum( N, x, stride, offset ) {
     49 	var sum;
     50 	var ix;
     51 	var m;
     52 	var i;
     53 
     54 	sum = 0.0;
     55 	if ( N <= 0 ) {
     56 		return sum;
     57 	}
     58 	ix = offset;
     59 
     60 	// Use unrolled loops if the stride is equal to `1`...
     61 	if ( stride === 1 ) {
     62 		m = N % M;
     63 
     64 		// If we have a remainder, run a clean-up loop...
     65 		if ( m > 0 ) {
     66 			for ( i = 0; i < m; i++ ) {
     67 				sum += abs( x[ix] );
     68 				ix += stride;
     69 			}
     70 		}
     71 		if ( N < M ) {
     72 			return sum;
     73 		}
     74 		for ( i = m; i < N; i += M ) {
     75 			sum += abs( x[ix] ) + abs( x[ix+1] ) + abs( x[ix+2] ) + abs( x[ix+3] ) + abs( x[ix+4] ) + abs( x[ix+5] ); // eslint-disable-line max-len
     76 			ix += M;
     77 		}
     78 		return sum;
     79 	}
     80 	for ( i = 0; i < N; i++ ) {
     81 		sum += abs( x[ix] );
     82 		ix += stride;
     83 	}
     84 	return sum;
     85 }
     86 
     87 
     88 // EXPORTS //
     89 
     90 module.exports = gasum;