Refactor to wrap specific implementation

Author: kgryte

lib/node_modules/@stdlib/blas/ext/base/dapxsum/README.md

@@ -160,14 +160,8 @@ console.log( v );
 
 <!-- /.examples -->
 
-* * *
-
 <section class="references">
 
-## References
-
--   Neumaier, Arnold. 1974. "Rounding Error Analysis of Some Methods for Summing Finite Sums." _Zeitschrift Für Angewandte Mathematik Und Mechanik_ 54 (1): 39–51. doi:[10.1002/zamm.19740540106][@neumaier:1974a].
-
 </section>
 
 <!-- /.references -->
@@ -178,8 +172,6 @@ console.log( v );
 
 [mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
 
-[@neumaier:1974a]: https://doi.org/10.1002/zamm.19740540106
-
 </section>
 
 <!-- /.links -->

lib/node_modules/@stdlib/blas/ext/base/dapxsum/benchmark/benchmark.native.js

@@ -20,22 +20,14 @@
 
 // MODULES //
 
-var abs = require( '@stdlib/math/base/special/abs' );
+var dapxsumkbn = require( '@stdlib/blas/ext/base/dapxsumkbn' );
 
 
 // MAIN //
 
 /**
 * Adds a constant to each double-precision floating-point strided array element and computes the sum.
 *
-* ## Method
-*
-* -   This implementation uses an "improved Kahan–Babuška algorithm", as described by Neumaier (1974).
-*
-* ## References
-*
-* -   Neumaier, Arnold. 1974. "Rounding Error Analysis of Some Methods for Summing Finite Sums." _Zeitschrift Für Angewandte Mathematik Und Mechanik_ 54 (1): 39–51. doi:[10.1002/zamm.19740540106](https://doi.org/10.1002/zamm.19740540106).
-*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} alpha - constant
 * @param {Float64Array} x - input array
@@ -52,38 +44,7 @@ var abs = require( '@stdlib/math/base/special/abs' );
 * // returns 16.0
 */
 function dapxsum( N, alpha, x, stride ) {
-	var sum;
-	var ix;
-	var v;
-	var t;
-	var c;
-	var i;
-
-	if ( N <= 0 ) {
-		return 0.0;
-	}
-	if ( N === 1 || stride === 0 ) {
-		return alpha + x[ 0 ];
-	}
-	if ( stride < 0 ) {
-		ix = (1-N) * stride;
-	} else {
-		ix = 0;
-	}
-	sum = 0.0;
-	c = 0.0;
-	for ( i = 0; i < N; i++ ) {
-		v = alpha + x[ ix ];
-		t = sum + v;
-		if ( abs( sum ) >= abs( v ) ) {
-			c += (sum-t) + v;
-		} else {
-			c += (v-t) + sum;
-		}
-		sum = t;
-		ix += stride;
-	}
-	return sum + c;
+	return dapxsumkbn( N, alpha, x, stride );
 }
 
 

lib/node_modules/@stdlib/blas/ext/base/dapxsum/benchmark/benchmark.ndarray.native.js

@@ -47,19 +47,9 @@
 
 // MODULES //
 
-var join = require( 'path' ).join;
-var tryRequire = require( '@stdlib/utils/try-require' );
 var dapxsum = require( './main.js' );
 
 
-// MAIN //
-
-var tmp = tryRequire( join( __dirname, './native.js' ) );
-if ( !(tmp instanceof Error) ) {
-	dapxsum = tmp;
-}
-
-
 // EXPORTS //
 
 module.exports = dapxsum;