fix: address assignment bug

kgryte · kgryte · commit cae1bebbed3f · 2025-08-15T05:50:37.000-07:00
---
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
---
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/10d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/10d_blocked.js
@@ -326,7 +326,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl
 				j8 -= bsize;
 			}
 			for ( k = 0; k < N; k++ ) {
-				dv9 = sv[k][9] - ( s8*sv[k][8] );
+				dv9[ k ] = sv[k][9] - ( s8*sv[k][8] );
 				ov8[ k ] = ov9[k] + ( j8*sv[k][8] );
 			}
 			for ( j7 = sh[7]; j7 > 0; ) {
@@ -338,7 +338,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl
 					j7 -= bsize;
 				}
 				for ( k = 0; k < N; k++ ) {
-					dv8 = sv[k][8] - ( s7*sv[k][7] );
+					dv8[ k ] = sv[k][8] - ( s7*sv[k][7] );
 					ov7[ k ] = ov8[k] + ( j7*sv[k][7] );
 				}
 				for ( j6 = sh[6]; j6 > 0; ) {
@@ -350,7 +350,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl
 						j6 -= bsize;
 					}
 					for ( k = 0; k < N; k++ ) {
-						dv7 = sv[k][7] - ( s6*sv[k][6] );
+						dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );
 						ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
 					}
 					for ( j5 = sh[5]; j5 > 0; ) {
@@ -362,7 +362,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl
 							j5 -= bsize;
 						}
 						for ( k = 0; k < N; k++ ) {
-							dv6 = sv[k][6] - ( s5*sv[k][5] );
+							dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );
 							ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
 						}
 						for ( j4 = sh[4]; j4 > 0; ) {
@@ -374,7 +374,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl
 								j4 -= bsize;
 							}
 							for ( k = 0; k < N; k++ ) {
-								dv5 = sv[k][5] - ( s4*sv[k][4] );
+								dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );
 								ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
 							}
 							for ( j3 = sh[3]; j3 > 0; ) {
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/6d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/6d_blocked.js
@@ -298,7 +298,7 @@ function blockedunary6d( fcn, arrays, views, strides, strategy, opts ) { // esli
 				j4 -= bsize;
 			}
 			for ( k = 0; k < N; k++ ) {
-				dv5 = sv[k][5] - ( s4*sv[k][4] );
+				dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );
 				ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
 			}
 			for ( j3 = sh[3]; j3 > 0; ) {
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/7d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/7d_blocked.js
@@ -305,7 +305,7 @@ function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // esli
 				j5 -= bsize;
 			}
 			for ( k = 0; k < N; k++ ) {
-				dv6 = sv[k][6] - ( s5*sv[k][5] );
+				dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );
 				ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
 			}
 			for ( j4 = sh[4]; j4 > 0; ) {
@@ -317,7 +317,7 @@ function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // esli
 					j4 -= bsize;
 				}
 				for ( k = 0; k < N; k++ ) {
-					dv5 = sv[k][5] - ( s4*sv[k][4] );
+					dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );
 					ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
 				}
 				for ( j3 = sh[3]; j3 > 0; ) {
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/8d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/8d_blocked.js
@@ -312,7 +312,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli
 				j6 -= bsize;
 			}
 			for ( k = 0; k < N; k++ ) {
-				dv7 = sv[k][7] - ( s6*sv[k][6] );
+				dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );
 				ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
 			}
 			for ( j5 = sh[5]; j5 > 0; ) {
@@ -324,7 +324,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli
 					j5 -= bsize;
 				}
 				for ( k = 0; k < N; k++ ) {
-					dv6 = sv[k][6] - ( s5*sv[k][5] );
+					dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );
 					ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
 				}
 				for ( j4 = sh[4]; j4 > 0; ) {
@@ -336,7 +336,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli
 						j4 -= bsize;
 					}
 					for ( k = 0; k < N; k++ ) {
-						dv5 = sv[k][5] - ( s4*sv[k][4] );
+						dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );
 						ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
 					}
 					for ( j3 = sh[3]; j3 > 0; ) {
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/9d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d-assign-struct/lib/9d_blocked.js
@@ -319,7 +319,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli
 				j7 -= bsize;
 			}
 			for ( k = 0; k < N; k++ ) {
-				dv8 = sv[k][8] - ( s7*sv[k][7] );
+				dv8[ k ] = sv[k][8] - ( s7*sv[k][7] );
 				ov7[ k ] = ov8[k] + ( j7*sv[k][7] );
 			}
 			for ( j6 = sh[6]; j6 > 0; ) {
@@ -331,7 +331,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli
 					j6 -= bsize;
 				}
 				for ( k = 0; k < N; k++ ) {
-					dv7 = sv[k][7] - ( s6*sv[k][6] );
+					dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );
 					ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
 				}
 				for ( j5 = sh[5]; j5 > 0; ) {
@@ -343,7 +343,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli
 						j5 -= bsize;
 					}
 					for ( k = 0; k < N; k++ ) {
-						dv6 = sv[k][6] - ( s5*sv[k][5] );
+						dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );
 						ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
 					}
 					for ( j4 = sh[4]; j4 > 0; ) {
@@ -355,7 +355,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli
 							j4 -= bsize;
 						}
 						for ( k = 0; k < N; k++ ) {
-							dv5 = sv[k][5] - ( s4*sv[k][4] );
+							dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );
 							ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
 						}
 						for ( j3 = sh[3]; j3 > 0; ) {

Original file line number	Diff line number	Diff line change
`@@ -326,7 +326,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`326`	`326`	`j8 -= bsize;`
`327`	`327`	`}`
`328`	`328`	`for ( k = 0; k < N; k++ ) {`
`329`		`- dv9 = sv[k][9] - ( s8*sv[k][8] );`
	`329`	`+ dv9[ k ] = sv[k][9] - ( s8*sv[k][8] );`
`330`	`330`	`ov8[ k ] = ov9[k] + ( j8*sv[k][8] );`
`331`	`331`	`}`
`332`	`332`	`for ( j7 = sh[7]; j7 > 0; ) {`
`@@ -338,7 +338,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`338`	`338`	`j7 -= bsize;`
`339`	`339`	`}`
`340`	`340`	`for ( k = 0; k < N; k++ ) {`
`341`		`- dv8 = sv[k][8] - ( s7*sv[k][7] );`
	`341`	`+ dv8[ k ] = sv[k][8] - ( s7*sv[k][7] );`
`342`	`342`	`ov7[ k ] = ov8[k] + ( j7*sv[k][7] );`
`343`	`343`	`}`
`344`	`344`	`for ( j6 = sh[6]; j6 > 0; ) {`
`@@ -350,7 +350,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`350`	`350`	`j6 -= bsize;`
`351`	`351`	`}`
`352`	`352`	`for ( k = 0; k < N; k++ ) {`
`353`		`- dv7 = sv[k][7] - ( s6*sv[k][6] );`
	`353`	`+ dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );`
`354`	`354`	`ov6[ k ] = ov7[k] + ( j6*sv[k][6] );`
`355`	`355`	`}`
`356`	`356`	`for ( j5 = sh[5]; j5 > 0; ) {`
`@@ -362,7 +362,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`362`	`362`	`j5 -= bsize;`
`363`	`363`	`}`
`364`	`364`	`for ( k = 0; k < N; k++ ) {`
`365`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`365`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`366`	`366`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`367`	`367`	`}`
`368`	`368`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -374,7 +374,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`374`	`374`	`j4 -= bsize;`
`375`	`375`	`}`
`376`	`376`	`for ( k = 0; k < N; k++ ) {`
`377`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`377`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`378`	`378`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`379`	`379`	`}`
`380`	`380`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -298,7 +298,7 @@ function blockedunary6d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`298`	`298`	`j4 -= bsize;`
`299`	`299`	`}`
`300`	`300`	`for ( k = 0; k < N; k++ ) {`
`301`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`301`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`302`	`302`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`303`	`303`	`}`
`304`	`304`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -305,7 +305,7 @@ function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`305`	`305`	`j5 -= bsize;`
`306`	`306`	`}`
`307`	`307`	`for ( k = 0; k < N; k++ ) {`
`308`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`308`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`309`	`309`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`310`	`310`	`}`
`311`	`311`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -317,7 +317,7 @@ function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`317`	`317`	`j4 -= bsize;`
`318`	`318`	`}`
`319`	`319`	`for ( k = 0; k < N; k++ ) {`
`320`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`320`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`321`	`321`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`322`	`322`	`}`
`323`	`323`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -312,7 +312,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`312`	`312`	`j6 -= bsize;`
`313`	`313`	`}`
`314`	`314`	`for ( k = 0; k < N; k++ ) {`
`315`		`- dv7 = sv[k][7] - ( s6*sv[k][6] );`
	`315`	`+ dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );`
`316`	`316`	`ov6[ k ] = ov7[k] + ( j6*sv[k][6] );`
`317`	`317`	`}`
`318`	`318`	`for ( j5 = sh[5]; j5 > 0; ) {`
`@@ -324,7 +324,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`324`	`324`	`j5 -= bsize;`
`325`	`325`	`}`
`326`	`326`	`for ( k = 0; k < N; k++ ) {`
`327`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`327`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`328`	`328`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`329`	`329`	`}`
`330`	`330`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -336,7 +336,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`336`	`336`	`j4 -= bsize;`
`337`	`337`	`}`
`338`	`338`	`for ( k = 0; k < N; k++ ) {`
`339`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`339`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`340`	`340`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`341`	`341`	`}`
`342`	`342`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -319,7 +319,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`319`	`319`	`j7 -= bsize;`
`320`	`320`	`}`
`321`	`321`	`for ( k = 0; k < N; k++ ) {`
`322`		`- dv8 = sv[k][8] - ( s7*sv[k][7] );`
	`322`	`+ dv8[ k ] = sv[k][8] - ( s7*sv[k][7] );`
`323`	`323`	`ov7[ k ] = ov8[k] + ( j7*sv[k][7] );`
`324`	`324`	`}`
`325`	`325`	`for ( j6 = sh[6]; j6 > 0; ) {`
`@@ -331,7 +331,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`331`	`331`	`j6 -= bsize;`
`332`	`332`	`}`
`333`	`333`	`for ( k = 0; k < N; k++ ) {`
`334`		`- dv7 = sv[k][7] - ( s6*sv[k][6] );`
	`334`	`+ dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );`
`335`	`335`	`ov6[ k ] = ov7[k] + ( j6*sv[k][6] );`
`336`	`336`	`}`
`337`	`337`	`for ( j5 = sh[5]; j5 > 0; ) {`
`@@ -343,7 +343,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`343`	`343`	`j5 -= bsize;`
`344`	`344`	`}`
`345`	`345`	`for ( k = 0; k < N; k++ ) {`
`346`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`346`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`347`	`347`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`348`	`348`	`}`
`349`	`349`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -355,7 +355,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`355`	`355`	`j4 -= bsize;`
`356`	`356`	`}`
`357`	`357`	`for ( k = 0; k < N; k++ ) {`
`358`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`358`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`359`	`359`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`360`	`360`	`}`
`361`	`361`	`for ( j3 = sh[3]; j3 > 0; ) {`