@stdlib/array-base-index-of 0.2.2 → 0.3.0

package/NOTICE

@@ -1 +1 @@
-Copyright (c) 2016-2024 The Stdlib Authors.
+Copyright (c) 2016-2026 The Stdlib Authors.

package/README.md

@@ -63,14 +63,14 @@ npm install @stdlib/array-base-index-of
 var indexOf = require( '@stdlib/array-base-index-of' );
 ```
 
-#### indexOf( x, searchElement, fromIndex, equalNaNs )
+#### indexOf( x, searchElement, fromIndex )
 
 Returns the index of the first element which equals a provided search element.
 
 ```javascript
 var x = [ 1, 2, 3, 4, 5, 6 ];
 
-var idx = indexOf( x, 3, 0, false );
+var idx = indexOf( x, 3, 0 );
 // returns 2
 ```
 
@@ -79,7 +79,7 @@ If the function is unable to find an element which equals a provided search elem
 ```javascript
 var x = [ 1, 2, 3, 4, 5, 6 ];
 
-var idx = indexOf( x, 7, 0, false );
+var idx = indexOf( x, 7, 0 );
 // returns -1
 ```
 
@@ -88,7 +88,7 @@ To begin searching from specific index, provide a non-zero `fromIndex` argument.
 ```javascript
 var x = [ 1, 1, 2, 1, 2, 3, 3 ];
 
-var idx = indexOf( x, 2, 3, false );
+var idx = indexOf( x, 2, 3 );
 // returns 4
 ```
 
@@ -97,22 +97,10 @@ If `fromIndex` is less than zero, the starting index is resolved relative to the
 ```javascript
 var x = [ 1, 1, 2, 1, 2, 3, 3 ];
 
-var idx = indexOf( x, 2, -4, false );
+var idx = indexOf( x, 2, -4 );
 // returns 4
 ```
 
-When searching for a search element, the function checks for strict equality. As a consequence, `NaN` values are considered distinct. In order to resolve the first element which is `NaN`, set the `equalNaNs` argument to `true`.
-
-```javascript
-var x = [ 1, 2, 3, NaN, 5, 6 ];
-
-var idx = indexOf( x, NaN, 0, false );
-// returns -1
-
-idx = indexOf( x, NaN, 0, true );
-// returns 3
-```
-
 </section>
 
 <!-- /.usage -->
@@ -123,13 +111,15 @@ idx = indexOf( x, NaN, 0, true );
 
 ## Notes
 
--   If provided an array-like object having an `indexOf` method and `equalNaNs` is `false`, the function defers execution to that method and assumes that the method API has the following signature:
+-   If provided an array-like object having an `indexOf` method, the function defers execution to that method and assumes that the method API has the following signature:
 
     ```text
     x.indexOf( searchElement, fromIndex )
     ```
 
--   If provided an array-like object without an `indexOf` method or if `equalNaNs` is `true`, the function performs a linear scan and returns immediately upon finding a match.
+-   If provided an array-like object without an `indexOf` method, the function performs a linear scan and returns immediately upon finding a match.
+
+-   When searching for a search element, the function checks for equality using the strict equality operator `===`. As a consequence, `NaN` values are considered distinct, and `-0` and `+0` are considered the same.
 
 </section>
 
@@ -148,19 +138,19 @@ var indexOf = require( '@stdlib/array-base-index-of' );
 
 var x = [ 'foo', 'bar', 'beep', 'boop', 'foo', 'bar' ];
 
-var idx = indexOf( x, 'beep', 0, false );
+var idx = indexOf( x, 'beep', 0 );
 // returns 2
 
-idx = indexOf( x, 'bop', 0, false );
+idx = indexOf( x, 'bop', 0 );
 // returns -1
 
-idx = indexOf( x, 'foo', 1, false );
+idx = indexOf( x, 'foo', 1 );
 // returns 4
 
-idx = indexOf( x, 'foo', -4, false );
+idx = indexOf( x, 'foo', -4 );
 // returns 4
 
-idx = indexOf( x, 'foo', 5, false );
+idx = indexOf( x, 'foo', 5 );
 // returns -1
 ```
 
@@ -210,7 +200,7 @@ See [LICENSE][stdlib-license].
 
 ## Copyright
 
-Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
+Copyright &copy; 2016-2026. The Stdlib [Authors][stdlib-authors].
 
 </section>
 
@@ -223,8 +213,8 @@ Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/array-base-index-of.svg
 [npm-url]: https://npmjs.org/package/@stdlib/array-base-index-of
 
-[test-image]: https://github.com/stdlib-js/array-base-index-of/actions/workflows/test.yml/badge.svg?branch=v0.2.2
-[test-url]: https://github.com/stdlib-js/array-base-index-of/actions/workflows/test.yml?query=branch:v0.2.2
+[test-image]: https://github.com/stdlib-js/array-base-index-of/actions/workflows/test.yml/badge.svg?branch=v0.3.0
+[test-url]: https://github.com/stdlib-js/array-base-index-of/actions/workflows/test.yml?query=branch:v0.3.0
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/array-base-index-of/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/array-base-index-of?branch=main
@@ -236,8 +226,8 @@ Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
 
 -->
 
-[chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg
-[chat-url]: https://app.gitter.im/#/room/#stdlib-js_stdlib:gitter.im
+[chat-image]: https://img.shields.io/badge/zulip-join_chat-brightgreen.svg
+[chat-url]: https://stdlib.zulipchat.com
 
 [stdlib]: https://github.com/stdlib-js/stdlib
 

package/dist/index.js

@@ -1,5 +1,5 @@
-"use strict";var s=function(t,i){return function(){return i||t((i={exports:{}}).exports,i),i.exports}};var c=s(function(j,o){
-var v=require('@stdlib/array-base-arraylike2object/dist'),f=require('@stdlib/math-base-assert-is-nan/dist');function g(t,i){return typeof t[i]=="function"}function h(t,i,n,e){var r;if(e&&f(i)){for(r=n;r<t.length;r++)if(f(t[r]))return r;return-1}for(r=n;r<t.length;r++)if(i===t[r])return r;return-1}function l(t,i,n,e){var r,a,u;if(r=t.data,a=t.accessors[0],e&&f(i)){for(u=n;u<r.length;u++)if(f(a(r,u)))return u;return-1}for(u=n;u<r.length;u++)if(i===a(r,u))return u;return-1}function p(t,i,n,e){var r;return g(t,"indexOf")&&e===!1?t.indexOf(i,n):(n<0&&(n+=t.length,n<0&&(n=0)),r=v(t),r.accessorProtocol?l(r,i,n,e):h(t,i,n,e))}o.exports=p
-});var O=c();module.exports=O;
+"use strict";var f=function(r,t){return function(){return t||r((t={exports:{}}).exports,t),t.exports}};var s=f(function(q,u){
+var a=require('@stdlib/assert-is-accessor-array/dist'),c=require('@stdlib/array-base-resolve-getter/dist');function o(r,t){return typeof r[t]=="function"}function v(r,t,i){var e;for(e=i;e<r.length;e++)if(t===r[e])return e;return-1}function g(r,t,i){var e,n;for(e=c(r),n=i;n<r.length;n++)if(t===e(r,n))return n;return-1}function h(r,t,i){return o(r,"indexOf")?r.indexOf(t,i):(i<0&&(i+=r.length,i<0&&(i=0)),a(r)?g(r,t,i):v(r,t,i))}u.exports=h
+});var l=s();module.exports=l;
 /** @license Apache-2.0 */
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../lib/main.js", "../lib/index.js"],
-  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( '@stdlib/array-base-arraylike2object' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'indexOf' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = internal( x, 2, 0, false );\n* // returns 1\n*/\nfunction internal( x, searchElement, fromIndex, equalNaNs ) {\n\tvar i;\n\tif ( equalNaNs && isnan( searchElement ) ) {\n\t\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\t\tif ( isnan( x[ i ] ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\tif ( searchElement === x[ i ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Object} x - input array object\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {integer} index\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array-base-arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var idx = accessors( x, 2, 0, false );\n* // returns 1\n*/\nfunction accessors( x, searchElement, fromIndex, equalNaNs ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tif ( equalNaNs && isnan( searchElement ) ) {\n\t\tfor ( i = fromIndex; i < data.length; i++ ) {\n\t\t\tif ( isnan( get( data, i ) ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\tfor ( i = fromIndex; i < data.length; i++ ) {\n\t\tif ( searchElement === get( data, i ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// MAIN //\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* ## Notes\n*\n* -   If unable to find an element which equals a provided search element, the function returns `-1`.\n*\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {integer} fromIndex - starting index (inclusive)\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = indexOf( x, 2, 0, false );\n* // returns 1\n*\n* @example\n* var Int32Array = require( '@stdlib/array-int32' );\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var idx = indexOf( x, 2, 0, false );\n* // returns 1\n*/\nfunction indexOf( x, searchElement, fromIndex, equalNaNs ) {\n\tvar obj;\n\tif ( hasMethod( x, 'indexOf' ) && equalNaNs === false ) {\n\t\treturn x.indexOf( searchElement, fromIndex );\n\t}\n\tif ( fromIndex < 0 ) {\n\t\tfromIndex += x.length;\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex = 0;\n\t\t}\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, searchElement, fromIndex, equalNaNs );\n\t}\n\treturn internal( x, searchElement, fromIndex, equalNaNs );\n}\n\n\n// EXPORTS //\n\nmodule.exports = indexOf;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the index of the first element which equals a provided search element.\n*\n* @module @stdlib/array-base-index-of\n*\n* @example\n* var indexOf = require( '@stdlib/array-base-index-of' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = indexOf( x, 2, 0, false );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],
-  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAmB,QAAS,qCAAsC,EAClEC,EAAQ,QAAS,iCAAkC,EAqBvD,SAASC,EAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAkBA,SAASC,EAAUC,EAAGC,EAAeC,EAAWC,EAAY,CAC3D,IAAIC,EACJ,GAAKD,GAAaR,EAAOM,CAAc,EAAI,CAC1C,IAAMG,EAAIF,EAAWE,EAAIJ,EAAE,OAAQI,IAClC,GAAKT,EAAOK,EAAGI,CAAE,CAAE,EAClB,OAAOA,EAGT,MAAO,EACR,CACA,IAAMA,EAAIF,EAAWE,EAAIJ,EAAE,OAAQI,IAClC,GAAKH,IAAkBD,EAAGI,CAAE,EAC3B,OAAOA,EAGT,MAAO,EACR,CAqBA,SAASC,EAAWL,EAAGC,EAAeC,EAAWC,EAAY,CAC5D,IAAIG,EACAC,EACAH,EAKJ,GAHAE,EAAON,EAAE,KACTO,EAAMP,EAAE,UAAW,CAAE,EAEhBG,GAAaR,EAAOM,CAAc,EAAI,CAC1C,IAAMG,EAAIF,EAAWE,EAAIE,EAAK,OAAQF,IACrC,GAAKT,EAAOY,EAAKD,EAAMF,CAAE,CAAE,EAC1B,OAAOA,EAGT,MAAO,EACR,CACA,IAAMA,EAAIF,EAAWE,EAAIE,EAAK,OAAQF,IACrC,GAAKH,IAAkBM,EAAKD,EAAMF,CAAE,EACnC,OAAOA,EAGT,MAAO,EACR,CAgCA,SAASI,EAASR,EAAGC,EAAeC,EAAWC,EAAY,CAC1D,IAAIN,EACJ,OAAKD,EAAWI,EAAG,SAAU,GAAKG,IAAc,GACxCH,EAAE,QAASC,EAAeC,CAAU,GAEvCA,EAAY,IAChBA,GAAaF,EAAE,OACVE,EAAY,IAChBA,EAAY,IAGdL,EAAMH,EAAkBM,CAAE,EACrBH,EAAI,iBACDQ,EAAWR,EAAKI,EAAeC,EAAWC,CAAU,EAErDJ,EAAUC,EAAGC,EAAeC,EAAWC,CAAU,EACzD,CAKAV,EAAO,QAAUe,IC5IjB,IAAIC,EAAO,IAKX,OAAO,QAAUA",
-  "names": ["require_main", "__commonJSMin", "exports", "module", "arraylike2object", "isnan", "hasMethod", "obj", "method", "internal", "x", "searchElement", "fromIndex", "equalNaNs", "i", "accessors", "data", "get", "indexOf", "main"]
+  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isAccessorArray = require( '@stdlib/assert-is-accessor-array' );\nvar resolveGetter = require( '@stdlib/array-base-resolve-getter' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'indexOf' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = internal( x, 2, 0 );\n* // returns 1\n*/\nfunction internal( x, searchElement, fromIndex ) {\n\tvar i;\n\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\tif ( searchElement === x[ i ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Object} x - input array object\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @returns {integer} index\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n*\n* var x = toAccessorArray( [ 1, 2, 3, 4 ] );\n*\n* var idx = accessors( x, 2, 0 );\n* // returns 1\n*/\nfunction accessors( x, searchElement, fromIndex ) {\n\tvar get;\n\tvar i;\n\n\tget = resolveGetter( x );\n\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\tif ( searchElement === get( x, i ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// MAIN //\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* ## Notes\n*\n* -   If unable to find an element which equals a provided search element, the function returns `-1`.\n*\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {integer} fromIndex - starting index (inclusive)\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = indexOf( x, 2, 0 );\n* // returns 1\n*\n* @example\n* var Int32Array = require( '@stdlib/array-int32' );\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var idx = indexOf( x, 2, 0 );\n* // returns 1\n*/\nfunction indexOf( x, searchElement, fromIndex ) {\n\tif ( hasMethod( x, 'indexOf' ) ) {\n\t\treturn x.indexOf( searchElement, fromIndex );\n\t}\n\tif ( fromIndex < 0 ) {\n\t\tfromIndex += x.length;\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex = 0;\n\t\t}\n\t}\n\tif ( isAccessorArray( x ) ) {\n\t\treturn accessors( x, searchElement, fromIndex );\n\t}\n\treturn internal( x, searchElement, fromIndex );\n}\n\n\n// EXPORTS //\n\nmodule.exports = indexOf;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the index of the first element which equals a provided search element.\n*\n* @module @stdlib/array-base-index-of\n*\n* @example\n* var indexOf = require( '@stdlib/array-base-index-of' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = indexOf( x, 2, 0 );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAkB,QAAS,kCAAmC,EAC9DC,EAAgB,QAAS,mCAAoC,EAqBjE,SAASC,EAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAiBA,SAASC,EAAUC,EAAGC,EAAeC,EAAY,CAChD,IAAIC,EACJ,IAAMA,EAAID,EAAWC,EAAIH,EAAE,OAAQG,IAClC,GAAKF,IAAkBD,EAAGG,CAAE,EAC3B,OAAOA,EAGT,MAAO,EACR,CAmBA,SAASC,EAAWJ,EAAGC,EAAeC,EAAY,CACjD,IAAIG,EACAF,EAGJ,IADAE,EAAMV,EAAeK,CAAE,EACjBG,EAAID,EAAWC,EAAIH,EAAE,OAAQG,IAClC,GAAKF,IAAkBI,EAAKL,EAAGG,CAAE,EAChC,OAAOA,EAGT,MAAO,EACR,CA+BA,SAASG,EAASN,EAAGC,EAAeC,EAAY,CAC/C,OAAKN,EAAWI,EAAG,SAAU,EACrBA,EAAE,QAASC,EAAeC,CAAU,GAEvCA,EAAY,IAChBA,GAAaF,EAAE,OACVE,EAAY,IAChBA,EAAY,IAGTR,EAAiBM,CAAE,EAChBI,EAAWJ,EAAGC,EAAeC,CAAU,EAExCH,EAAUC,EAAGC,EAAeC,CAAU,EAC9C,CAKAT,EAAO,QAAUa,ICnHjB,IAAIC,EAAO,IAKX,OAAO,QAAUA",
+  "names": ["require_main", "__commonJSMin", "exports", "module", "isAccessorArray", "resolveGetter", "hasMethod", "obj", "method", "internal", "x", "searchElement", "fromIndex", "i", "accessors", "get", "indexOf", "main"]
 }

package/docs/types/index.d.ts

@@ -20,7 +20,7 @@
 
 /// <reference types="@stdlib/types"/>
 
-import { Collection, Complex64Array, Complex128Array } from '@stdlib/types/array';
+import { Collection, AccessorArrayLike } from '@stdlib/types/array';
 
 /**
 * Returns the index of the first element which equals a provided search element.
@@ -33,13 +33,12 @@ import { Collection, Complex64Array, Complex128Array } from '@stdlib/types/array
 * @param x - input array
 * @param searchElement - search element
 * @param fromIndex - starting index (inclusive)
-* @param equalNaNs - boolean indicating whether NaNs should be considered equal
 * @returns index
 *
 * @example
 * var x = [ 1, 2, 3, 4 ];
 *
-* var idx = indexOf( x, 2, 0, false );
+* var idx = indexOf( x, 2, 0 );
 * // returns 1
 *
 * @example
@@ -47,10 +46,10 @@ import { Collection, Complex64Array, Complex128Array } from '@stdlib/types/array
 *
 * var x = new Int32Array( [ 1, 2, 3, 4 ] );
 *
-* var idx = indexOf( x, 2, 0, false );
+* var idx = indexOf( x, 2, 0 );
 * // returns 1
 */
-declare function indexOf( x: Collection | Complex64Array | Complex128Array, searchElement: any, fromIndex: number, equalNaNs: boolean ): number;
+declare function indexOf( x: Collection | AccessorArrayLike<unknown>, searchElement: unknown, fromIndex: number ): number;
 
 
 // EXPORTS //

package/lib/index.js

@@ -28,7 +28,7 @@
 *
 * var x = [ 1, 2, 3, 4 ];
 *
-* var idx = indexOf( x, 2, 0, false );
+* var idx = indexOf( x, 2, 0 );
 * // returns 1
 */
 

package/lib/main.js

@@ -20,8 +20,8 @@
 
 // MODULES //
 
-var arraylike2object = require( '@stdlib/array-base-arraylike2object' );
-var isnan = require( '@stdlib/math-base-assert-is-nan' );
+var isAccessorArray = require( '@stdlib/assert-is-accessor-array' );
+var resolveGetter = require( '@stdlib/array-base-resolve-getter' );
 
 
 // FUNCTIONS //
@@ -53,25 +53,16 @@ function hasMethod( obj, method ) {
 * @param {Collection} x - input array
 * @param {*} searchElement - search element
 * @param {NonNegativeInteger} fromIndex - starting index (inclusive)
-* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal
 * @returns {integer} index
 *
 * @example
 * var x = [ 1, 2, 3, 4 ];
 *
-* var idx = internal( x, 2, 0, false );
+* var idx = internal( x, 2, 0 );
 * // returns 1
 */
-function internal( x, searchElement, fromIndex, equalNaNs ) {
+function internal( x, searchElement, fromIndex ) {
 	var i;
-	if ( equalNaNs && isnan( searchElement ) ) {
-		for ( i = fromIndex; i < x.length; i++ ) {
-			if ( isnan( x[ i ] ) ) {
-				return i;
-			}
-		}
-		return -1;
-	}
 	for ( i = fromIndex; i < x.length; i++ ) {
 		if ( searchElement === x[ i ] ) {
 			return i;
@@ -87,36 +78,23 @@ function internal( x, searchElement, fromIndex, equalNaNs ) {
 * @param {Object} x - input array object
 * @param {*} searchElement - search element
 * @param {NonNegativeInteger} fromIndex - starting index (inclusive)
-* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal
 * @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, false );
+* var idx = accessors( x, 2, 0 );
 * // returns 1
 */
-function accessors( x, searchElement, fromIndex, equalNaNs ) {
-	var data;
+function accessors( x, searchElement, fromIndex ) {
 	var get;
 	var i;
 
-	data = x.data;
-	get = x.accessors[ 0 ];
-
-	if ( equalNaNs && isnan( searchElement ) ) {
-		for ( i = fromIndex; i < data.length; i++ ) {
-			if ( isnan( get( data, i ) ) ) {
-				return i;
-			}
-		}
-		return -1;
-	}
-	for ( i = fromIndex; i < data.length; i++ ) {
-		if ( searchElement === get( data, i ) ) {
+	get = resolveGetter( x );
+	for ( i = fromIndex; i < x.length; i++ ) {
+		if ( searchElement === get( x, i ) ) {
 			return i;
 		}
 	}
@@ -136,13 +114,12 @@ function accessors( x, searchElement, fromIndex, equalNaNs ) {
 * @param {Collection} x - input array
 * @param {*} searchElement - search element
 * @param {integer} fromIndex - starting index (inclusive)
-* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal
 * @returns {integer} index
 *
 * @example
 * var x = [ 1, 2, 3, 4 ];
 *
-* var idx = indexOf( x, 2, 0, false );
+* var idx = indexOf( x, 2, 0 );
 * // returns 1
 *
 * @example
@@ -150,12 +127,11 @@ function accessors( x, searchElement, fromIndex, equalNaNs ) {
 *
 * var x = new Int32Array( [ 1, 2, 3, 4 ] );
 *
-* var idx = indexOf( x, 2, 0, false );
+* var idx = indexOf( x, 2, 0 );
 * // returns 1
 */
-function indexOf( x, searchElement, fromIndex, equalNaNs ) {
-	var obj;
-	if ( hasMethod( x, 'indexOf' ) && equalNaNs === false ) {
+function indexOf( x, searchElement, fromIndex ) {
+	if ( hasMethod( x, 'indexOf' ) ) {
 		return x.indexOf( searchElement, fromIndex );
 	}
 	if ( fromIndex < 0 ) {
@@ -164,11 +140,10 @@ function indexOf( x, searchElement, fromIndex, equalNaNs ) {
 			fromIndex = 0;
 		}
 	}
-	obj = arraylike2object( x );
-	if ( obj.accessorProtocol ) {
-		return accessors( obj, searchElement, fromIndex, equalNaNs );
+	if ( isAccessorArray( x ) ) {
+		return accessors( x, searchElement, fromIndex );
 	}
-	return internal( x, searchElement, fromIndex, equalNaNs );
+	return internal( x, searchElement, fromIndex );
 }
 
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stdlib/array-base-index-of",
-  "version": "0.2.2",
+  "version": "0.3.0",
   "description": "Return the index of the first element which equals a provided search element.",
   "license": "Apache-2.0",
   "author": {
@@ -30,8 +30,8 @@
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
   "dependencies": {
-    "@stdlib/array-base-arraylike2object": "^0.2.1",
-    "@stdlib/math-base-assert-is-nan": "^0.2.2"
+    "@stdlib/array-base-resolve-getter": "^0.2.2",
+    "@stdlib/assert-is-accessor-array": "^0.2.2"
   },
   "devDependencies": {},
   "engines": {