fix: minor bugs and lint errors

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

lib/node_modules/@stdlib/ndarray/base/binary-reduce-strided1d/lib/main.js

@@ -26,6 +26,7 @@ var indicesComplement = require( '@stdlib/array/base/indices-complement' );
 var takeIndexed2 = require( '@stdlib/array/base/take-indexed2' );
 var iterationOrder = require( '@stdlib/ndarray/base/iteration-order' );
 var strides2order = require( '@stdlib/ndarray/base/strides2order' );
+var anyIsEntryIn = require( '@stdlib/array/base/any-is-entry-in' );
 var numel = require( '@stdlib/ndarray/base/numel' );
 var join = require( '@stdlib/array/base/join' );
 var format = require( '@stdlib/string/format' );
@@ -128,6 +129,22 @@ var BLOCKED_ACCESSOR_BINARY = [
 var MAX_DIMS = BINARY.length - 1;
 
 
+// FUNCTIONS //
+
+/**
+* Returns a boolean indicating if at least one ndarray data buffer implements the accessor protocol.
+*
+* @private
+* @param {ndarrayLike} x - first ndarray
+* @param {ndarrayLike} y - second ndarray
+* @param {ndarrayLike} z - third ndarray
+* @returns {boolean} boolean indicating whether an ndarray data buffer implements the accessor protocol
+*/
+function hasAccessors( x, y, z ) {
+	return anyIsEntryIn( [ x, y, z ], 'accessorProtocol', true );
+}
+
+
 // MAIN //
 
 /**
@@ -485,17 +502,17 @@ function binaryReduceStrided1d( fcn, arrays, dims, options ) { // eslint-disable
 
 	// Determine whether we can avoid iteration altogether...
 	if ( K === 0 ) {
-		if ( z.accessorProtocol ) {
+		if ( hasAccessors( x, y, z ) ) {
 			return ACCESSOR_BINARY[ K ]( fcn, arr, strategy1, strategy2, opts );
 		}
 		return BINARY[ K ]( fcn, arr, strategy1, strategy2, opts );
 	}
 	// Determine whether we only have one loop dimension and can thus readily perform one-dimensional iteration...
 	if ( K === 1 ) {
-		if ( z.accessorProtocol ) {
-			return ACCESSOR_BINARY[ K ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts );
+		if ( hasAccessors( x, y, z ) ) {
+			return ACCESSOR_BINARY[ K ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts ); // eslint-disable-line max-len
 		}
-		return BINARY[ K ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts );
+		return BINARY[ K ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts ); // eslint-disable-line max-len
 	}
 	sz = z.strides;
 
@@ -513,10 +530,10 @@ function binaryReduceStrided1d( fcn, arrays, dims, options ) { // eslint-disable
 		}
 		slx = [ slx[i] ];
 		sly = [ sly[i] ];
-		if ( z.accessorProtocol ) {
-			return ACCESSOR_BINARY[ 1 ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts );
+		if ( hasAccessors( x, y, z ) ) {
+			return ACCESSOR_BINARY[ 1 ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts ); // eslint-disable-line max-len
 		}
-		return BINARY[ 1 ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts );
+		return BINARY[ 1 ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts ); // eslint-disable-line max-len
 	}
 	iox = iterationOrder( slx ); // +/-1
 	ioy = iterationOrder( sly ); // +/-1
@@ -527,22 +544,22 @@ function binaryReduceStrided1d( fcn, arrays, dims, options ) { // eslint-disable
 	ordy = strides2order( sly );
 	if ( iox !== 0 && ioy !== 0 && ioz !== 0 && ordx === strides2order( sz ) && ordy === strides2order( sz ) && K <= MAX_DIMS ) { // eslint-disable-line max-len
 		// So long as iteration for each respective array always moves in the same direction (i.e., no mixed sign strides) and the memory layouts are the same, we can leverage cache-optimal (i.e., normal) nested loops without resorting to blocked iteration...
-		if ( z.accessorProtocol ) {
+		if ( hasAccessors( x, y, z ) ) {
 			return ACCESSOR_BINARY[ K ]( fcn, arr, views, slx, sly, ordx === 1, strategy1, strategy2, opts ); // eslint-disable-line max-len
 		}
-		return BINARY[ K ]( fcn, arr, views, slx, sly, ordx === 1, strategy1, strategy2, opts );
+		return BINARY[ K ]( fcn, arr, views, slx, sly, ordx === 1, strategy1, strategy2, opts ); // eslint-disable-line max-len
 	}
 	// At this point, we're either dealing with non-contiguous n-dimensional arrays, high dimensional n-dimensional arrays, and/or arrays having differing memory layouts, so our only hope is that we can still perform blocked iteration...
 
 	// Determine whether we can perform blocked iteration...
 	if ( K <= MAX_DIMS ) {
-		if ( z.accessorProtocol ) {
+		if ( hasAccessors( x, y, z ) ) {
 			return BLOCKED_ACCESSOR_BINARY[ K-2 ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts ); // eslint-disable-line max-len
 		}
-		return BLOCKED_BINARY[ K-2 ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts );
+		return BLOCKED_BINARY[ K-2 ]( fcn, arr, views, slx, sly, strategy1, strategy2, opts ); // eslint-disable-line max-len
 	}
 	// Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)...
-	if ( z.accessorProtocol ) {
+	if ( hasAccessors( x, y, z ) ) {
 		return accessorbinarynd( fcn, arr, views, strategy1, strategy2, opts );
 	}
 	binarynd( fcn, arr, views, strategy1, strategy2, opts );