refactor: reduce overhead by using specialized utilities

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

lib/node_modules/@stdlib/array/base/index-of-same-value/lib/main.js

@@ -20,13 +20,14 @@
 
 // MODULES //
 
+var isAccessorArray = require( '@stdlib/assert/is-accessor-array' );
 var isComplexLike = require( '@stdlib/assert/is-complex-like' );
 var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
 var reinterpret = require( '@stdlib/strided/base/reinterpret-complex' );
 var reinterpretBoolean = require( '@stdlib/strided/base/reinterpret-boolean' );
 var isComplexTypedArray = require( '@stdlib/array/base/assert/is-complex-typed-array' );
 var isBooleanArray = require( '@stdlib/array/base/assert/is-booleanarray' );
-var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
+var resolveGetter = require( '@stdlib/array/base/resolve-getter' );
 var isSameValue = require( '@stdlib/assert/is-same-value' );
 var real = require( '@stdlib/complex/float64/real' );
 var imag = require( '@stdlib/complex/float64/imag' );
@@ -63,30 +64,26 @@ function indexed( x, searchElement, fromIndex ) {
 * Returns the index of the first element which equals a provided search element according to the same value algorithm.
 *
 * @private
-* @param {Object} x - input array object
+* @param {Collection} x - input array object
 * @param {*} searchElement - search element
 * @param {NonNegativeInteger} fromIndex - starting index (inclusive)
 * @returns {integer} index
 *
 * @example
 * var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
-* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
 *
-* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );
+* var x = toAccessorArray( [ 1, 2, 3, 4 ] );
 *
 * var idx = accessors( x, 2, 0 );
 * // returns 1
 */
 function accessors( x, searchElement, fromIndex ) {
-	var data;
 	var get;
 	var i;
 
-	data = x.data;
-	get = x.accessors[ 0 ];
-
-	for ( i = fromIndex; i < data.length; i++ ) {
-		if ( isSameValue( searchElement, get( data, i ) ) ) {
+	get = resolveGetter( x );
+	for ( i = fromIndex; i < x.length; i++ ) {
+		if ( isSameValue( searchElement, get( x, i ) ) ) {
 			return i;
 		}
 	}
@@ -198,22 +195,20 @@ function boolean( x, searchElement, fromIndex ) {
 * // returns 1
 */
 function indexOfSameValue( x, searchElement, fromIndex ) {
-	var obj;
 	if ( fromIndex < 0 ) {
 		fromIndex += x.length;
 		if ( fromIndex < 0 ) {
 			fromIndex = 0;
 		}
 	}
-	obj = arraylike2object( x );
-	if ( obj.accessorProtocol ) {
+	if ( isAccessorArray( x ) ) {
 		if ( isComplexTypedArray( x ) ) {
 			return complex( x, searchElement, fromIndex );
 		}
 		if ( isBooleanArray( x ) ) {
 			return boolean( x, searchElement, fromIndex );
 		}
-		return accessors( obj, searchElement, fromIndex );
+		return accessors( x, searchElement, fromIndex );
 	}
 	return indexed( x, searchElement, fromIndex );
 }