refactor: reduce assignment duplication

Signed-off-by: Athan <kgryte@gmail.com>

Author: kgryte

lib/node_modules/@stdlib/blas/ext/base/gvander/lib/base.js

@@ -77,46 +77,49 @@ function gvander( mode, M, N, x, strideX, offsetX, out, strideOut1, strideOut2,
 	isrm = isRowMajor( [ strideOut1, strideOut2 ] );
 	sx = strideX;
 
-	if ( isrm && mode > 0 ) {
-		// Row-major, increasing: x^0, x^1, ..., x^(N-1)
+	if ( isrm ) {
 		S0 = N;
 		S1 = M;
 		do0 = strideOut2;
-		do1 = strideOut1 - ( S0*strideOut2 );
-		io = offsetOut;
 		ix = offsetX;
-		for ( i1 = 0; i1 < S1; i1++ ) {
-			out[ io ] = 1.0;
-			io += do0;
-			for ( i0 = 1; i0 < S0; i0++ ) {
-				out[ io ] = out[ io - do0 ] * x[ ix ];
+
+		// Increasing: x^0, x^1, ..., x^(N-1)
+		if ( mode > 0 ) {
+			do1 = strideOut1 - ( S0*strideOut2 );
+			io = offsetOut;
+			for ( i1 = 0; i1 < S1; i1++ ) {
+				out[ io ] = 1.0;
 				io += do0;
+				for ( i0 = 1; i0 < S0; i0++ ) {
+					out[ io ] = out[ io-do0 ] * x[ ix ];
+					io += do0;
+				}
+				ix += sx;
+				io += do1;
 			}
-			ix += sx;
-			io += do1;
+			return out;
 		}
-	} else if ( isrm ) {
-		// Row-major, decreasing: x^(N-1), x^(N-2), ..., x^0
-		S0 = N;
-		S1 = M;
-		do0 = strideOut2;
+		// Decreasing: x^(N-1), x^(N-2), ..., x^0
 		do1 = strideOut1 + ( S0*strideOut2 );
 		io = offsetOut + ( ( S0-1 ) * do0 );
-		ix = offsetX;
 		for ( i1 = 0; i1 < S1; i1++ ) {
 			out[ io ] = 1.0;
 			io -= do0;
 			for ( i0 = 1; i0 < S0; i0++ ) {
-				out[ io ] = out[ io + do0 ] * x[ ix ];
+				out[ io ] = out[ io+do0 ] * x[ ix ];
 				io -= do0;
 			}
 			ix += sx;
 			io += do1;
 		}
-	} else if ( mode > 0 ) {
-		// Column-major, increasing: column j contains x^j
-		S0 = M;
-		S1 = N;
+		return out;
+	}
+	// Column-major...
+	S0 = M;
+	S1 = N;
+	
+	// Increasing: column j contains x^j
+	if ( mode > 0 ) {
 		do0 = strideOut1;
 		do1 = strideOut2 - ( S0*strideOut1 );
 		io = offsetOut;
@@ -125,25 +128,23 @@ function gvander( mode, M, N, x, strideX, offsetX, out, strideOut1, strideOut2,
 		for ( i1 = 1; i1 < S1; i1++ ) {
 			ix = offsetX;
 			for ( i0 = 0; i0 < S0; i0++ ) {
-				out[ io ] = out[ io - strideOut2 ] * x[ ix ];
+				out[ io ] = out[ io-strideOut2 ] * x[ ix ];
 				ix += sx;
 				io += do0;
 			}
 			io += do1;
 		}
-	} else {
-		// Column-major, decreasing: column 0 contains x^(N-1), last column all ones
-		S0 = M;
-		S1 = N;
-		gfill( S0, 1.0, out, strideOut1, offsetOut + ( ( S1-1 ) * strideOut2 ) );
-		for ( i1 = S1 - 2; i1 >= 0; i1-- ) {
-			io = offsetOut + ( i1 * strideOut2 );
-			ix = offsetX;
-			for ( i0 = 0; i0 < S0; i0++ ) {
-				out[ io ] = out[ io + strideOut2 ] * x[ ix ];
-				ix += sx;
-				io += strideOut1;
-			}
+		return out;
+	}
+	// Decreasing: column 0 contains x^(N-1), last column all ones
+	gfill( S0, 1.0, out, strideOut1, offsetOut + ( ( S1-1 ) * strideOut2 ) );
+	for ( i1 = S1 - 2; i1 >= 0; i1-- ) {
+		io = offsetOut + ( i1*strideOut2 );
+		ix = offsetX;
+		for ( i0 = 0; i0 < S0; i0++ ) {
+			out[ io ] = out[ io+strideOut2 ] * x[ ix ];
+			ix += sx;
+			io += strideOut1;
 		}
 	}
 	return out;