fix: address assignment bug

kgryte · kgryte · commit f2f4cba93e4b · 2025-08-15T05:48:08.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/lib/10d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/10d_blocked.js
@@ -261,7 +261,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; ) {
@@ -273,7 +273,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; ) {
@@ -285,7 +285,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; ) {
@@ -297,7 +297,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; ) {
@@ -309,7 +309,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/lib/10d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/10d_blocked_accessors.js
@@ -269,7 +269,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; ) {
@@ -281,7 +281,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; ) {
@@ -293,7 +293,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; ) {
@@ -305,7 +305,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; ) {
@@ -317,7 +317,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/lib/6d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/6d_blocked.js
@@ -233,7 +233,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/lib/6d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/6d_blocked_accessors.js
@@ -241,7 +241,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/lib/7d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/7d_blocked.js
@@ -240,7 +240,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; ) {
@@ -252,7 +252,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/lib/7d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/7d_blocked_accessors.js
@@ -248,7 +248,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; ) {
@@ -260,7 +260,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/lib/8d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/8d_blocked.js
@@ -247,7 +247,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; ) {
@@ -259,7 +259,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; ) {
@@ -271,7 +271,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/lib/8d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/8d_blocked_accessors.js
@@ -255,7 +255,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; ) {
@@ -267,7 +267,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; ) {
@@ -279,7 +279,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/lib/9d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/9d_blocked.js
@@ -254,7 +254,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; ) {
@@ -266,7 +266,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; ) {
@@ -278,7 +278,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; ) {
@@ -290,7 +290,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; ) {
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/9d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-strided1d/lib/9d_blocked_accessors.js
@@ -262,7 +262,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; ) {
@@ -274,7 +274,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; ) {
@@ -286,7 +286,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; ) {
@@ -298,7 +298,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
`@@ -261,7 +261,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`261`	`261`	`j8 -= bsize;`
`262`	`262`	`}`
`263`	`263`	`for ( k = 0; k < N; k++ ) {`
`264`		`- dv9 = sv[k][9] - ( s8*sv[k][8] );`
	`264`	`+ dv9[ k ] = sv[k][9] - ( s8*sv[k][8] );`
`265`	`265`	`ov8[ k ] = ov9[k] + ( j8*sv[k][8] );`
`266`	`266`	`}`
`267`	`267`	`for ( j7 = sh[7]; j7 > 0; ) {`
`@@ -273,7 +273,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`273`	`273`	`j7 -= bsize;`
`274`	`274`	`}`
`275`	`275`	`for ( k = 0; k < N; k++ ) {`
`276`		`- dv8 = sv[k][8] - ( s7*sv[k][7] );`
	`276`	`+ dv8[ k ] = sv[k][8] - ( s7*sv[k][7] );`
`277`	`277`	`ov7[ k ] = ov8[k] + ( j7*sv[k][7] );`
`278`	`278`	`}`
`279`	`279`	`for ( j6 = sh[6]; j6 > 0; ) {`
`@@ -285,7 +285,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`285`	`285`	`j6 -= bsize;`
`286`	`286`	`}`
`287`	`287`	`for ( k = 0; k < N; k++ ) {`
`288`		`- dv7 = sv[k][7] - ( s6*sv[k][6] );`
	`288`	`+ dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );`
`289`	`289`	`ov6[ k ] = ov7[k] + ( j6*sv[k][6] );`
`290`	`290`	`}`
`291`	`291`	`for ( j5 = sh[5]; j5 > 0; ) {`
`@@ -297,7 +297,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`297`	`297`	`j5 -= bsize;`
`298`	`298`	`}`
`299`	`299`	`for ( k = 0; k < N; k++ ) {`
`300`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`300`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`301`	`301`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`302`	`302`	`}`
`303`	`303`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -309,7 +309,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`309`	`309`	`j4 -= bsize;`
`310`	`310`	`}`
`311`	`311`	`for ( k = 0; k < N; k++ ) {`
`312`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`312`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`313`	`313`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`314`	`314`	`}`
`315`	`315`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -269,7 +269,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`269`	`269`	`j8 -= bsize;`
`270`	`270`	`}`
`271`	`271`	`for ( k = 0; k < N; k++ ) {`
`272`		`- dv9 = sv[k][9] - ( s8*sv[k][8] );`
	`272`	`+ dv9[ k ] = sv[k][9] - ( s8*sv[k][8] );`
`273`	`273`	`ov8[ k ] = ov9[k] + ( j8*sv[k][8] );`
`274`	`274`	`}`
`275`	`275`	`for ( j7 = sh[7]; j7 > 0; ) {`
`@@ -281,7 +281,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`281`	`281`	`j7 -= bsize;`
`282`	`282`	`}`
`283`	`283`	`for ( k = 0; k < N; k++ ) {`
`284`		`- dv8 = sv[k][8] - ( s7*sv[k][7] );`
	`284`	`+ dv8[ k ] = sv[k][8] - ( s7*sv[k][7] );`
`285`	`285`	`ov7[ k ] = ov8[k] + ( j7*sv[k][7] );`
`286`	`286`	`}`
`287`	`287`	`for ( j6 = sh[6]; j6 > 0; ) {`
`@@ -293,7 +293,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`293`	`293`	`j6 -= bsize;`
`294`	`294`	`}`
`295`	`295`	`for ( k = 0; k < N; k++ ) {`
`296`		`- dv7 = sv[k][7] - ( s6*sv[k][6] );`
	`296`	`+ dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );`
`297`	`297`	`ov6[ k ] = ov7[k] + ( j6*sv[k][6] );`
`298`	`298`	`}`
`299`	`299`	`for ( j5 = sh[5]; j5 > 0; ) {`
`@@ -305,7 +305,7 @@ function blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`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 blockedunary10d( fcn, arrays, views, strides, strategy, opts ) { // esl`
`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
`@@ -233,7 +233,7 @@ function blockedunary6d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`233`	`233`	`j4 -= bsize;`
`234`	`234`	`}`
`235`	`235`	`for ( k = 0; k < N; k++ ) {`
`236`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`236`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`237`	`237`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`238`	`238`	`}`
`239`	`239`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -241,7 +241,7 @@ function blockedunary6d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`241`	`241`	`j4 -= bsize;`
`242`	`242`	`}`
`243`	`243`	`for ( k = 0; k < N; k++ ) {`
`244`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`244`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`245`	`245`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`246`	`246`	`}`
`247`	`247`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -240,7 +240,7 @@ function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`240`	`240`	`j5 -= bsize;`
`241`	`241`	`}`
`242`	`242`	`for ( k = 0; k < N; k++ ) {`
`243`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`243`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`244`	`244`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`245`	`245`	`}`
`246`	`246`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -252,7 +252,7 @@ function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`252`	`252`	`j4 -= bsize;`
`253`	`253`	`}`
`254`	`254`	`for ( k = 0; k < N; k++ ) {`
`255`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`255`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`256`	`256`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`257`	`257`	`}`
`258`	`258`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -248,7 +248,7 @@ function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`248`	`248`	`j5 -= bsize;`
`249`	`249`	`}`
`250`	`250`	`for ( k = 0; k < N; k++ ) {`
`251`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`251`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`252`	`252`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`253`	`253`	`}`
`254`	`254`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -260,7 +260,7 @@ function blockedunary7d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`260`	`260`	`j4 -= bsize;`
`261`	`261`	`}`
`262`	`262`	`for ( k = 0; k < N; k++ ) {`
`263`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`263`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`264`	`264`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`265`	`265`	`}`
`266`	`266`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -247,7 +247,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`247`	`247`	`j6 -= bsize;`
`248`	`248`	`}`
`249`	`249`	`for ( k = 0; k < N; k++ ) {`
`250`		`- dv7 = sv[k][7] - ( s6*sv[k][6] );`
	`250`	`+ dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );`
`251`	`251`	`ov6[ k ] = ov7[k] + ( j6*sv[k][6] );`
`252`	`252`	`}`
`253`	`253`	`for ( j5 = sh[5]; j5 > 0; ) {`
`@@ -259,7 +259,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`259`	`259`	`j5 -= bsize;`
`260`	`260`	`}`
`261`	`261`	`for ( k = 0; k < N; k++ ) {`
`262`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`262`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`263`	`263`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`264`	`264`	`}`
`265`	`265`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -271,7 +271,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`271`	`271`	`j4 -= bsize;`
`272`	`272`	`}`
`273`	`273`	`for ( k = 0; k < N; k++ ) {`
`274`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`274`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`275`	`275`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`276`	`276`	`}`
`277`	`277`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -255,7 +255,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`255`	`255`	`j6 -= bsize;`
`256`	`256`	`}`
`257`	`257`	`for ( k = 0; k < N; k++ ) {`
`258`		`- dv7 = sv[k][7] - ( s6*sv[k][6] );`
	`258`	`+ dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );`
`259`	`259`	`ov6[ k ] = ov7[k] + ( j6*sv[k][6] );`
`260`	`260`	`}`
`261`	`261`	`for ( j5 = sh[5]; j5 > 0; ) {`
`@@ -267,7 +267,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`267`	`267`	`j5 -= bsize;`
`268`	`268`	`}`
`269`	`269`	`for ( k = 0; k < N; k++ ) {`
`270`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`270`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`271`	`271`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`272`	`272`	`}`
`273`	`273`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -279,7 +279,7 @@ function blockedunary8d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`279`	`279`	`j4 -= bsize;`
`280`	`280`	`}`
`281`	`281`	`for ( k = 0; k < N; k++ ) {`
`282`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`282`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`283`	`283`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`284`	`284`	`}`
`285`	`285`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -254,7 +254,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`254`	`254`	`j7 -= bsize;`
`255`	`255`	`}`
`256`	`256`	`for ( k = 0; k < N; k++ ) {`
`257`		`- dv8 = sv[k][8] - ( s7*sv[k][7] );`
	`257`	`+ dv8[ k ] = sv[k][8] - ( s7*sv[k][7] );`
`258`	`258`	`ov7[ k ] = ov8[k] + ( j7*sv[k][7] );`
`259`	`259`	`}`
`260`	`260`	`for ( j6 = sh[6]; j6 > 0; ) {`
`@@ -266,7 +266,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`266`	`266`	`j6 -= bsize;`
`267`	`267`	`}`
`268`	`268`	`for ( k = 0; k < N; k++ ) {`
`269`		`- dv7 = sv[k][7] - ( s6*sv[k][6] );`
	`269`	`+ dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );`
`270`	`270`	`ov6[ k ] = ov7[k] + ( j6*sv[k][6] );`
`271`	`271`	`}`
`272`	`272`	`for ( j5 = sh[5]; j5 > 0; ) {`
`@@ -278,7 +278,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`278`	`278`	`j5 -= bsize;`
`279`	`279`	`}`
`280`	`280`	`for ( k = 0; k < N; k++ ) {`
`281`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`281`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`282`	`282`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`283`	`283`	`}`
`284`	`284`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -290,7 +290,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`290`	`290`	`j4 -= bsize;`
`291`	`291`	`}`
`292`	`292`	`for ( k = 0; k < N; k++ ) {`
`293`		`- dv5 = sv[k][5] - ( s4*sv[k][4] );`
	`293`	`+ dv5[ k ] = sv[k][5] - ( s4*sv[k][4] );`
`294`	`294`	`ov4[ k ] = ov5[k] + ( j4*sv[k][4] );`
`295`	`295`	`}`
`296`	`296`	`for ( j3 = sh[3]; j3 > 0; ) {`
Original file line number	Diff line number	Diff line change
`@@ -262,7 +262,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`262`	`262`	`j7 -= bsize;`
`263`	`263`	`}`
`264`	`264`	`for ( k = 0; k < N; k++ ) {`
`265`		`- dv8 = sv[k][8] - ( s7*sv[k][7] );`
	`265`	`+ dv8[ k ] = sv[k][8] - ( s7*sv[k][7] );`
`266`	`266`	`ov7[ k ] = ov8[k] + ( j7*sv[k][7] );`
`267`	`267`	`}`
`268`	`268`	`for ( j6 = sh[6]; j6 > 0; ) {`
`@@ -274,7 +274,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`274`	`274`	`j6 -= bsize;`
`275`	`275`	`}`
`276`	`276`	`for ( k = 0; k < N; k++ ) {`
`277`		`- dv7 = sv[k][7] - ( s6*sv[k][6] );`
	`277`	`+ dv7[ k ] = sv[k][7] - ( s6*sv[k][6] );`
`278`	`278`	`ov6[ k ] = ov7[k] + ( j6*sv[k][6] );`
`279`	`279`	`}`
`280`	`280`	`for ( j5 = sh[5]; j5 > 0; ) {`
`@@ -286,7 +286,7 @@ function blockedunary9d( fcn, arrays, views, strides, strategy, opts ) { // esli`
`286`	`286`	`j5 -= bsize;`
`287`	`287`	`}`
`288`	`288`	`for ( k = 0; k < N; k++ ) {`
`289`		`- dv6 = sv[k][6] - ( s5*sv[k][5] );`
	`289`	`+ dv6[ k ] = sv[k][6] - ( s5*sv[k][5] );`
`290`	`290`	`ov5[ k ] = ov6[k] + ( j5*sv[k][5] );`
`291`	`291`	`}`
`292`	`292`	`for ( j4 = sh[4]; j4 > 0; ) {`
`@@ -298,7 +298,7 @@ function blockedunary9d( 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; ) {`