chore: update implementation

Signed-off-by: Shabareesh Shetty <[email protected]>

Author: ShabiShett07

lib/node_modules/@stdlib/blas/base/dger/lib/base.js

@@ -18,11 +18,6 @@
 
 'use strict';
 
-// MODULES //
-
-var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
-
-
 // MAIN //
 
 /**
@@ -54,56 +49,25 @@ var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
 * // A => <Float64Array>[ 2.0, 3.0, 4.0, 5.0, 6.0, 7.0 ]
 */
 function dger( M, N, alpha, x, strideX, offsetX, y, strideY, offsetY, A, strideA1, strideA2, offsetA ) { // eslint-disable-line max-params, max-len
-	var isrm;
 	var tmp;
-	var ix1;
-	var iy1;
-	var sa0;
-	var sa1;
-	var i0;
-	var i1;
-	var oa;
-
-	// Note on variable naming convention: sa#, ix#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+	var idx;
+	var jy;
+	var ix;
+	var i;
+	var j;
 
-	isrm = isRowMajor( [ strideA1, strideA2 ] );
-	if ( isrm ) {
-		// For row-major matrices, the last dimension has the fastest changing index...
-		sa0 = strideA2; // stride for innermost loop
-		sa1 = strideA1; // stride for outermost loop
-	} else { // isColMajor
-		// For column-major matrices, the first dimension has the fastest changing index...
-		sa0 = strideA1; // stride for innermost loop
-		sa1 = strideA2; // stride for outermost loop
-	}
-	if ( !isrm ) {
-		iy1 = offsetY;
-		for ( i1 = 0; i1 < N; i1++ ) {
-			if ( y[ iy1 ] !== 0.0 ) {
-				tmp = alpha * y[ iy1 ];
-				ix1 = offsetX;
-				oa = offsetA + ( sa1 * i1 );
-				for ( i0 = 0; i0 < M; i0++ ) {
-					A[ oa + ( sa0 * i0 ) ] += x[ ix1 ] * tmp;
-					ix1 += strideX;
-				}
-			}
-			iy1 += strideY;
-		}
-		return A;
-	}
-	ix1 = offsetX;
-	for ( i1 = 0; i1 < M; i1++ ) {
-		if ( x[ ix1 ] !== 0.0 ) {
-			tmp = alpha * x[ ix1 ];
-			iy1 = offsetY;
-			oa = offsetA + (sa1*i1);
-			for ( i0 = 0; i0 < N; i0++ ) {
-				A[ oa + ( sa0 * i0 ) ] += y[ iy1 ] * tmp;
-				iy1 += strideY;
+	jy = offsetY;
+	for ( j = 0; j < N; j++ ) {
+		if ( y[ jy ] !== 0.0 ) {
+			tmp = alpha * y[ jy ];
+			ix = offsetX;
+			for ( i = 0; i < M; i++ ) {
+				idx = offsetA + ( i * strideA1 ) + ( j * strideA2 );
+				A[ idx ] += x[ ix ] * tmp;
+				ix += strideX;
 			}
 		}
-		ix1 += strideX;
+		jy += strideY;
 	}
 	return A;
 }