fix: remove redundant code

---
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/every-by/lib/main.js

@@ -20,30 +20,18 @@
 
 // MODULES //
 
-var isComplexArray = require( '@stdlib/array/base/assert/is-complex-typed-array' );
-var isBooleanArray = require( '@stdlib/array/base/assert/is-booleanarray' );
 var iterationOrder = require( '@stdlib/ndarray/base/iteration-order' );
 var minmaxViewBufferIndex = require( '@stdlib/ndarray/base/minmax-view-buffer-index' );
 var ndarray2object = require( '@stdlib/ndarray/base/ndarraylike2object' );
-var reinterpretComplex = require( '@stdlib/strided/base/reinterpret-complex' );
-var reinterpretBoolean = require( '@stdlib/strided/base/reinterpret-boolean' );
-var gscal = require( '@stdlib/blas/base/gscal' );
 var blockedaccessorevery2d = require( './2d_blocked_accessors.js' );
 var blockedaccessorevery3d = require( './3d_blocked_accessors.js' );
-var blockedcomplexevery2d = require( './2d_blocked_complex.js' );
-var blockedcomplexevery3d = require( './3d_blocked_complex.js' );
 var blockedevery2d = require( './2d_blocked.js' );
 var blockedevery3d = require( './3d_blocked.js' );
 var accessorevery0d = require( './0d_accessors.js' );
 var accessorevery1d = require( './1d_accessors.js' );
 var accessorevery2d = require( './2d_accessors.js' );
 var accessorevery3d = require( './3d_accessors.js' );
 var accessoreverynd = require( './nd_accessors.js' );
-var complexevery0d = require( './0d_complex.js' );
-var complexevery1d = require( './1d_complex.js' );
-var complexevery2d = require( './2d_complex.js' );
-var complexevery3d = require( './3d_complex.js' );
-var complexeverynd = require( './nd_complex.js' );
 var every0d = require( './0d.js' );
 var every1d = require( './1d.js' );
 var every2d = require( './2d.js' );
@@ -65,12 +53,6 @@ var ACCESSOR_EVERY = [
 	accessorevery2d,
 	accessorevery3d
 ];
-var COMPLEX_EVERY = [
-	complexevery0d,
-	complexevery1d,
-	complexevery2d,
-	complexevery3d
-];
 var BLOCKED_EVERY = [
 	blockedevery2d, // 0
 	blockedevery3d
@@ -79,10 +61,6 @@ var BLOCKED_ACCESSOR_EVERY = [
 	blockedaccessorevery2d, // 0
 	blockedaccessorevery3d
 ];
-var BLOCKED_COMPLEX_EVERY = [
-	blockedcomplexevery2d, // 0
-	blockedcomplexevery3d
-];
 var MAX_DIMS = EVERY.length - 1;
 
 
@@ -160,25 +138,11 @@ function everyBy( arrays, clbk, thisArg ) {
 	shx = x.shape;
 	ndims = shx.length;
 
-	// Check for known array types which can be reinterpreted for better iteration performance...
-	if ( isBooleanArray( x.data ) ) {
-		x.data = reinterpretBoolean( x.data, 0 );
-		x.accessorProtocol = false;
-	} else if ( isComplexArray( x.data ) ) {
-		x.data = reinterpretComplex( x.data, 0 );
-		x.accessorProtocol = false;
-		x.strides = gscal( ndims, 2, x.strides, 1 );
-		x.offset *= 2;
-		isCmplx = true;
-	}
 	// Determine whether we can avoid iteration altogether...
 	if ( ndims === 0 ) {
 		if ( x.accessorProtocol ) {
 			return ACCESSOR_EVERY[ ndims ]( x, clbk, thisArg );
 		}
-		if ( isCmplx ) {
-			return COMPLEX_EVERY[ ndims ]( x, clbk, thisArg );
-		}
 		return EVERY[ ndims ]( x, clbk, thisArg );
 	}
 	// Compute the number of elements and the number of singleton dimensions...
@@ -204,9 +168,6 @@ function everyBy( arrays, clbk, thisArg ) {
 		if ( x.accessorProtocol ) {
 			return ACCESSOR_EVERY[ ndims ]( x, clbk, thisArg );
 		}
-		if ( isCmplx ) {
-			return COMPLEX_EVERY[ ndims ]( x, clbk, thisArg );
-		}
 		return EVERY[ ndims ]( x, clbk, thisArg );
 	}
 	sx = x.strides;
@@ -224,9 +185,6 @@ function everyBy( arrays, clbk, thisArg ) {
 		if ( x.accessorProtocol ) {
 			return ACCESSOR_EVERY[ 1 ]( x, clbk, thisArg );
 		}
-		if ( isCmplx ) {
-			return COMPLEX_EVERY[ 1 ]( x, clbk, thisArg );
-		}
 		return EVERY[ 1 ]( x, clbk, thisArg );
 	}
 	iox = iterationOrder( sx ); // +/-1
@@ -250,9 +208,6 @@ function everyBy( arrays, clbk, thisArg ) {
 			if ( x.accessorProtocol ) {
 				return ACCESSOR_EVERY[ 1 ]( x, clbk, thisArg );
 			}
-			if ( isCmplx ) {
-				return COMPLEX_EVERY[ 1 ]( x, clbk, thisArg );
-			}
 			return EVERY[ 1 ]( x, clbk, thisArg );
 		}
 		// The ndarray is non-contiguous, so we cannot directly use one-dimensional array functionality...
@@ -263,9 +218,6 @@ function everyBy( arrays, clbk, thisArg ) {
 			if ( x.accessorProtocol ) {
 				return ACCESSOR_EVERY[ ndims ]( x, clbk, thisArg );
 			}
-			if ( isCmplx ) {
-				return COMPLEX_EVERY[ ndims ]( x, clbk, thisArg );
-			}
 			return EVERY[ ndims ]( x, clbk, thisArg );
 		}
 		// Fall-through to blocked iteration...
@@ -277,18 +229,12 @@ function everyBy( arrays, clbk, thisArg ) {
 		if ( x.accessorProtocol ) {
 			return BLOCKED_ACCESSOR_EVERY[ ndims-2 ]( x, clbk, thisArg );
 		}
-		if ( isCmplx ) {
-			return BLOCKED_COMPLEX_EVERY[ ndims-2 ]( x, clbk, thisArg );
-		}
 		return BLOCKED_EVERY[ ndims-2 ]( x, clbk, thisArg );
 	}
 	// Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)...
 	if ( x.accessorProtocol ) {
 		return accessoreverynd( x, clbk, thisArg );
 	}
-	if ( isCmplx ) {
-		return complexeverynd( x, clbk, thisArg );
-	}
 	return everynd( x, clbk, thisArg );
 }