feat: merge loops

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: na
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: passed
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: na
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: na
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: na
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

Author: aayush0325

lib/node_modules/@stdlib/lapack/base/dppequ/lib/base.js

@@ -28,7 +28,7 @@ var min = require( '@stdlib/math/base/special/min' );
 // MAIN //
 
 /**
-* Computes the row and column scalings intended to equilibrate a symmetric positive definite matrix `A` in packed storage and reduce it's condition number (with respect to the two-norm).
+* Computes the row and column scaling factors intended to equilibrate a symmetric positive definite matrix `A` in packed storage and reduce it's condition number (with respect to the two-norm).
 *
 * @param {string} order - specifies whether `AP` is packed in row-major or column-major order
 * @param {string} uplo - 'Upper' or 'Lower' triangle of `A` is stored
@@ -72,36 +72,26 @@ function dppequ( order, uplo, N, AP, strideAP, offsetAP, S, strideS, offsetS, ou
 	smin = S[ offsetAP ];
 	amax = S[ offsetAP ];
 
-	if ( order === 'row-major' ) {
-		if ( uplo === 'U' ) { // uplo === 'U'
-			jj = 0;
-			for ( i = 1; i < N; i++ ) {
+	if ( uplo === 'U' ) { // uplo === 'U'
+		jj = 0;
+		for ( i = 1; i < N; i++ ) {
+			if ( order === 'row-major' ) {
 				jj += N - i + 1;
-				S[ offsetS + (i * strideS) ] = AP[ offsetAP + (jj * strideAP) ];
-				smin = min( smin, S[ offsetS + (i * strideS) ] );
-				amax = max( amax, S[ offsetS + (i * strideS) ] );
-			}
-		} else { // uplo === 'L'
-			jj = 0;
-			for ( i = 1; i < N; i++ ) {
+			} else { // order === 'column-major'
 				jj += i + 1;
-				S[ offsetS + (i * strideS) ] = AP[ offsetAP + (jj * strideAP) ];
-				smin = min( smin, S[ offsetS + (i * strideS) ] );
-				amax = max( amax, S[ offsetS + (i * strideS) ] );
 			}
-		}
-	} else if ( uplo === 'U' ) { // order === 'col-major'
-		jj = 0;
-		for ( i = 1; i < N; i++ ) {
-			jj += i + 1;
 			S[ offsetS + (i * strideS) ] = AP[ offsetAP + (jj * strideAP) ];
 			smin = min( smin, S[ offsetS + (i * strideS) ] );
 			amax = max( amax, S[ offsetS + (i * strideS) ] );
 		}
-	} else { // uplo === 'L', order === 'col-major'
+	} else { // uplo === 'L'
 		jj = 0;
 		for ( i = 1; i < N; i++ ) {
-			jj += N - i + 1;
+			if ( order === 'row-major' ) {
+				jj += i + 1;
+			} else { // order === 'column-major'
+				jj += N - i + 1;
+			}
 			S[ offsetS + (i * strideS) ] = AP[ offsetAP + (jj * strideAP) ];
 			smin = min( smin, S[ offsetS + (i * strideS) ] );
 			amax = max( amax, S[ offsetS + (i * strideS) ] );