fix: offset increment calc

---
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: headlessNode

lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_accessors.js

@@ -133,28 +133,28 @@ function unary3d( fcn, arrays, views, strides, opts ) {
 		S0 = sh[ 2 ];
 		S1 = sh[ 1 ];
 		S2 = sh[ 0 ];
-		dv0 = [ strides[2] ];
+		dv0 = [ strides[2] ];                     // offset increment for innermost loop
 		dv1 = [ strides[1] - ( S0*strides[2] ) ];
-		dv2 = [ strides[0] - ( S1*strides[1] ) - ( S0*strides[2] ) ];
+		dv2 = [ strides[0] - ( S1*strides[1] ) ]; // offset increment for outermost loop
 		for ( i = 1; i < arrays.length; i++ ) {
 			sv = arrays[ i ].strides;
 			dv0.push( sv[2] );
 			dv1.push( sv[1] - ( S0*sv[2] ) );
-			dv2.push( sv[0] - ( S1*sv[1] ) - ( S0*sv[2] ) );
+			dv2.push( sv[0] - ( S1*sv[1] ) );
 		}
 	} else {
 		// For column-major ndarrays, the first dimensions have the fastest changing indices...
 		S0 = sh[ 0 ];
 		S1 = sh[ 1 ];
 		S2 = sh[ 2 ];
-		dv0 = [ strides[0] ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
 		dv1 = [ strides[1] - ( S0*strides[0] ) ];
-		dv2 = [ strides[2] - ( S1*strides[1] ) - ( S0*strides[2] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ]; // offset increment for outermost loop
 		for ( i = 1; i < arrays.length; i++ ) {
 			sv = arrays[ i ].strides;
 			dv0.push( sv[0] );
 			dv1.push( sv[1] - ( S0*sv[0] ) );
-			dv2.push( sv[2] - ( S1*sv[1] ) - ( S0*sv[2] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
 		}
 	}
 	// Resolve a list of pointers to the first indexed elements in the respective ndarrays: