refactor: apply code review suggestions

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

---
type: pre_push_report
description: Results of running various checks prior to pushing changes.
report:
  - task: run_javascript_examples
    status: na
  - task: run_c_examples
    status: na
  - task: run_cpp_examples
    status: na
  - task: run_javascript_readme_examples
    status: na
  - task: run_c_benchmarks
    status: na
  - task: run_cpp_benchmarks
    status: na
  - task: run_fortran_benchmarks
    status: na
  - task: run_javascript_benchmarks
    status: na
  - task: run_julia_benchmarks
    status: na
  - task: run_python_benchmarks
    status: na
  - task: run_r_benchmarks
    status: na
  - task: run_javascript_tests
    status: na
---

Author: headlessNode

lib/node_modules/@stdlib/blas/ext/base/gnansumpw/lib/accessors.js

@@ -76,6 +76,7 @@ function gnansumpw( N, x, strideX, offsetX ) {
 	var M;
 	var s;
 	var n;
+	var v;
 	var i;
 
 	// Cache reference to array data:
@@ -86,67 +87,86 @@ function gnansumpw( N, x, strideX, offsetX ) {
 
 	ix = offsetX;
 	if ( strideX === 0 ) {
-		if ( isnan( xget( xbuf, ix ) ) ) {
+		v = xget( xbuf, ix );
+		if ( isnan( v ) ) {
 			return 0.0;
 		}
-		return N * xget( xbuf, ix );
+		return N * v;
 	}
 	if ( N < 8 ) {
 		// Use simple summation...
 		s = 0.0;
 		for ( i = 0; i < N; i++ ) {
-			if ( isnan( xget( xbuf, ix ) ) === false ) {
-				s += xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			if ( isnan( v ) === false ) {
+				s += v;
 			}
 			ix += strideX;
 		}
 		return s;
 	}
 	if ( N <= BLOCKSIZE ) {
 		// Sum a block with 8 accumulators (by loop unrolling, we lower the effective blocksize to 16)...
-		s0 = ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+		v = xget( xbuf, ix );
+		s0 = ( isnan( v ) ) ? 0.0 : v;
 		ix += strideX;
-		s1 = ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+		v = xget( xbuf, ix );
+		s1 = ( isnan( v ) ) ? 0.0 : v;
 		ix += strideX;
-		s2 = ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+		v = xget( xbuf, ix );
+		s2 = ( isnan( v ) ) ? 0.0 : v;
 		ix += strideX;
-		s3 = ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+		v = xget( xbuf, ix );
+		s3 = ( isnan( v ) ) ? 0.0 : v;
 		ix += strideX;
-		s4 = ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+		v = xget( xbuf, ix );
+		s4 = ( isnan( v ) ) ? 0.0 : v;
 		ix += strideX;
-		s5 = ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+		v = xget( xbuf, ix );
+		s5 = ( isnan( v ) ) ? 0.0 : v;
 		ix += strideX;
-		s6 = ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+		v = xget( xbuf, ix );
+		s6 = ( isnan( v ) ) ? 0.0 : v;
 		ix += strideX;
-		s7 = ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+		v = xget( xbuf, ix );
+		s7 = ( isnan( v ) ) ? 0.0 : v;
 		ix += strideX;
 
 		M = N % 8;
 		for ( i = 8; i < N-M; i += 8 ) {
-			s0 += ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			s0 += ( isnan( v ) ) ? 0.0 : v;
 			ix += strideX;
-			s1 += ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			s1 += ( isnan( v ) ) ? 0.0 : v;
 			ix += strideX;
-			s2 += ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			s2 += ( isnan( v ) ) ? 0.0 : v;
 			ix += strideX;
-			s3 += ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			s3 += ( isnan( v ) ) ? 0.0 : v;
 			ix += strideX;
-			s4 += ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			s4 += ( isnan( v ) ) ? 0.0 : v;
 			ix += strideX;
-			s5 += ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			s5 += ( isnan( v ) ) ? 0.0 : v;
 			ix += strideX;
-			s6 += ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			s6 += ( isnan( v ) ) ? 0.0 : v;
 			ix += strideX;
-			s7 += ( isnan( xget( xbuf, ix ) ) ) ? 0.0 : xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			s7 += ( isnan( v ) ) ? 0.0 : v;
 			ix += strideX;
 		}
 		// Pairwise sum the accumulators:
 		s = ( (s0+s1) + (s2+s3) ) + ( (s4+s5) + (s6+s7) );
 
 		// Clean-up loop...
 		for ( i; i < N; i++ ) {
-			if ( isnan( xget( xbuf, ix ) ) === false ) {
-				s += xget( xbuf, ix );
+			v = xget( xbuf, ix );
+			if ( isnan( v ) === false ) {
+				s += v;
 			}
 			ix += strideX;
 		}