@stdlib/array-base-index-of-same-value 0.1.0

package/LICENSE

@@ -0,0 +1,177 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS

package/NOTICE

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

package/README.md

@@ -0,0 +1,246 @@
+<!--
+
+@license Apache-2.0
+
+Copyright (c) 2025 The Stdlib Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+
+-->
+
+
+<details>
+  <summary>
+    About stdlib...
+  </summary>
+  <p>We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.</p>
+  <p>The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.</p>
+  <p>When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.</p>
+  <p>To join us in bringing numerical computing to the web, get started by checking us out on <a href="https://github.com/stdlib-js/stdlib">GitHub</a>, and please consider <a href="https://opencollective.com/stdlib">financially supporting stdlib</a>. We greatly appreciate your continued support!</p>
+</details>
+
+# indexOfSameValue
+
+[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
+
+> Return the index of the first element which equals a provided search element according to the [SameValue Algorithm][@stdlib/assert/is-same-value].
+
+<!-- Section to include introductory text. Make sure to keep an empty line after the intro `section` element and another before the `/section` close. -->
+
+<section class="intro">
+
+</section>
+
+<!-- /.intro -->
+
+<!-- Package usage documentation. -->
+
+<section class="installation">
+
+## Installation
+
+```bash
+npm install @stdlib/array-base-index-of-same-value
+```
+
+</section>
+
+<section class="usage">
+
+## Usage
+
+```javascript
+var indexOfSameValue = require( '@stdlib/array-base-index-of-same-value' );
+```
+
+#### indexOfSameValue( x, searchElement, fromIndex )
+
+Returns the index of the first element which equals a provided search element according to the [SameValue Algorithm][@stdlib/assert/is-same-value].
+
+```javascript
+var x = [ 1, 2, 3, 4, 5, 6 ];
+
+var idx = indexOfSameValue( x, 3, 0 );
+// returns 2
+```
+
+If the function is unable to find an element which equals a provided search element, the function returns `-1`.
+
+```javascript
+var x = [ 1, 2, 3, 4, 5, 6 ];
+
+var idx = indexOfSameValue( x, 7, 0 );
+// returns -1
+```
+
+To begin searching from specific index, provide a non-zero `fromIndex` argument.
+
+```javascript
+var x = [ 1, 1, 2, 1, 2, 3, 3 ];
+
+var idx = indexOfSameValue( x, 2, 3 );
+// returns 4
+```
+
+If `fromIndex` is less than zero, the starting index is resolved relative to the last array element, with the last array element corresponding to `fromIndex = -1`.
+
+```javascript
+var x = [ 1, 1, 2, 1, 2, 3, 3 ];
+
+var idx = indexOfSameValue( x, 2, -4 );
+// returns 4
+```
+
+</section>
+
+<!-- /.usage -->
+
+<!-- Package usage notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="notes">
+
+## Notes
+
+-   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 [SameValue Algorithm][@stdlib/assert/is-same-value] as specified in ECMAScript 5. As a consequence, `NaN` values are considered equal, and `-0` and `+0` are considered distinct.
+
+</section>
+
+<!-- /.notes -->
+
+<!-- Package usage examples. -->
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+```javascript
+var indexOfSameValue = require( '@stdlib/array-base-index-of-same-value' );
+
+var x = [ 'foo', 'bar', 'beep', 'boop', 'foo', 'bar' ];
+
+var idx = indexOfSameValue( x, 'beep', 0 );
+// returns 2
+
+idx = indexOfSameValue( x, 'bop', 0 );
+// returns -1
+
+idx = indexOfSameValue( x, 'foo', 1 );
+// returns 4
+
+idx = indexOfSameValue( x, 'foo', -4 );
+// returns 4
+
+idx = indexOfSameValue( x, 'foo', 5 );
+// returns -1
+```
+
+</section>
+
+<!-- /.examples -->
+
+<!-- Section to include cited references. If references are included, add a horizontal rule *before* the section. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="references">
+
+</section>
+
+<!-- /.references -->
+
+<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
+
+<section class="related">
+
+</section>
+
+<!-- /.related -->
+
+<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+
+<section class="main-repo" >
+
+* * *
+
+## Notice
+
+This package is part of [stdlib][stdlib], a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.
+
+For more information on the project, filing bug reports and feature requests, and guidance on how to develop [stdlib][stdlib], see the main project [repository][stdlib].
+
+#### Community
+
+[![Chat][chat-image]][chat-url]
+
+---
+
+## License
+
+See [LICENSE][stdlib-license].
+
+
+## Copyright
+
+Copyright &copy; 2016-2026. The Stdlib [Authors][stdlib-authors].
+
+</section>
+
+<!-- /.stdlib -->
+
+<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="links">
+
+[npm-image]: http://img.shields.io/npm/v/@stdlib/array-base-index-of-same-value.svg
+[npm-url]: https://npmjs.org/package/@stdlib/array-base-index-of-same-value
+
+[test-image]: https://github.com/stdlib-js/array-base-index-of-same-value/actions/workflows/test.yml/badge.svg?branch=v0.1.0
+[test-url]: https://github.com/stdlib-js/array-base-index-of-same-value/actions/workflows/test.yml?query=branch:v0.1.0
+
+[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/array-base-index-of-same-value/main.svg
+[coverage-url]: https://codecov.io/github/stdlib-js/array-base-index-of-same-value?branch=main
+
+<!--
+
+[dependencies-image]: https://img.shields.io/david/stdlib-js/array-base-index-of-same-value.svg
+[dependencies-url]: https://david-dm.org/stdlib-js/array-base-index-of-same-value/main
+
+-->
+
+[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
+
+[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
+
+[umd]: https://github.com/umdjs/umd
+[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
+
+[deno-url]: https://github.com/stdlib-js/array-base-index-of-same-value/tree/deno
+[deno-readme]: https://github.com/stdlib-js/array-base-index-of-same-value/blob/deno/README.md
+[umd-url]: https://github.com/stdlib-js/array-base-index-of-same-value/tree/umd
+[umd-readme]: https://github.com/stdlib-js/array-base-index-of-same-value/blob/umd/README.md
+[esm-url]: https://github.com/stdlib-js/array-base-index-of-same-value/tree/esm
+[esm-readme]: https://github.com/stdlib-js/array-base-index-of-same-value/blob/esm/README.md
+[branches-url]: https://github.com/stdlib-js/array-base-index-of-same-value/blob/main/branches.md
+
+[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/array-base-index-of-same-value/main/LICENSE
+
+[@stdlib/assert/is-same-value]: https://www.npmjs.com/package/@stdlib/assert-is-same-value
+
+</section>
+
+<!-- /.links -->

package/SECURITY.md

@@ -0,0 +1,5 @@
+# Security
+
+> Policy for reporting security vulnerabilities.
+
+See the security policy [in the main project repository](https://github.com/stdlib-js/stdlib/security).

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+/// <reference path="../docs/types/index.d.ts" />
+import indexOfSameValue from '../docs/types/index';
+export = indexOfSameValue;

package/dist/index.js

@@ -0,0 +1,5 @@
+"use strict";var s=function(r,e){return function(){return e||r((e={exports:{}}).exports,e),e.exports}};var f=s(function(P,o){
+var q=require('@stdlib/assert-is-accessor-array/dist'),l=require('@stdlib/assert-is-complex-like/dist'),p=require('@stdlib/assert-is-boolean/dist').isPrimitive,g=require('@stdlib/strided-base-reinterpret-complex/dist'),c=require('@stdlib/strided-base-reinterpret-boolean/dist'),y=require('@stdlib/array-base-assert-is-complex-typed-array/dist'),A=require('@stdlib/array-base-assert-is-booleanarray/dist'),B=require('@stdlib/array-base-resolve-getter/dist'),n=require('@stdlib/assert-is-same-value/dist'),w=require('@stdlib/complex-float64-real/dist'),C=require('@stdlib/complex-float64-imag/dist');function S(r,e,u){var i;for(i=u;i<r.length;i++)if(n(e,r[i]))return i;return-1}function V(r,e,u){var i,t;for(i=B(r),t=u;t<r.length;t++)if(n(e,i(r,t)))return t;return-1}function b(r,e,u){var i,t,a,v;if(!l(e))return-1;for(i=g(r,0),t=w(e),a=C(e),v=u*2;v<i.length;v+=2)if(n(i[v],t)&&n(i[v+1],a))return v/2;return-1}function k(r,e,u){var i,t,a;if(!p(e))return-1;for(i=c(r,0),t=e?1:0,a=u;a<i.length;a++)if(i[a]===t)return a;return-1}function G(r,e,u){return u<0&&(u+=r.length,u<0&&(u=0)),q(r)?y(r)?b(r,e,u):A(r)?k(r,e,u):V(r,e,u):S(r,e,u)}o.exports=G
+});var L=f();module.exports=L;
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/main.js", "../lib/index.js"],
+  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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 isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\nvar reinterpret = require( '@stdlib/strided-base-reinterpret-complex' );\nvar reinterpretBoolean = require( '@stdlib/strided-base-reinterpret-boolean' );\nvar isComplexTypedArray = require( '@stdlib/array-base-assert-is-complex-typed-array' );\nvar isBooleanArray = require( '@stdlib/array-base-assert-is-booleanarray' );\nvar resolveGetter = require( '@stdlib/array-base-resolve-getter' );\nvar isSameValue = require( '@stdlib/assert-is-same-value' );\nvar real = require( '@stdlib/complex-float64-real' );\nvar imag = require( '@stdlib/complex-float64-imag' );\n\n\n// FUNCTIONS //\n\n/**\n* Returns the index of the first element which equals a provided search element according to the same value algorithm.\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 = indexed( x, 2, 0 );\n* // returns 1\n*/\nfunction indexed( x, searchElement, fromIndex ) {\n\tvar i;\n\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\tif ( isSameValue( 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 according to the same value algorithm.\n*\n* @private\n* @param {Collection} 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 ( isSameValue( searchElement, get( 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 according to the same value algorithm.\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 Complex128Array = require( '@stdlib/array-complex128' );\n* var Complex128 = require( '@stdlib/complex-float64-ctor' );\n*\n* var x = new Complex128Array( [ 1.0, 2.0, 0.0, 0.0, 3.0, 4.0, 0.0, 0.0 ] );\n*\n* var idx = complex( x, new Complex128( 3.0, 4.0 ), 1 );\n* // returns 2\n*/\nfunction complex( x, searchElement, fromIndex ) {\n\tvar view;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexLike( searchElement ) ) {\n\t\treturn -1;\n\t}\n\tview = reinterpret( x, 0 );\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tfor ( i = fromIndex*2; i < view.length; i += 2 ) {\n\t\tif ( isSameValue( view[ i ], re ) && isSameValue( view[ i+1 ], im ) ) {\n\t\t\treturn i / 2;\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 according to the same value algorithm.\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 BooleanArray = require( '@stdlib/array-bool' );\n*\n* var x = new BooleanArray( [ true, false, true, false, true ] );\n*\n* var idx = boolean( x, true, 1 );\n* // returns 2\n*/\nfunction boolean( x, searchElement, fromIndex ) {\n\tvar view;\n\tvar v;\n\tvar i;\n\tif ( !isBoolean( searchElement ) ) {\n\t\treturn -1;\n\t}\n\tview = reinterpretBoolean( x, 0 );\n\tv = ( searchElement ) ? 1 : 0;\n\tfor ( i = fromIndex; i < view.length; i++ ) {\n\t\tif ( view[ i ] === v ) {\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 according to the same value algorithm.\n*\n* ## Notes\n*\n* -   The function uses the [SameValue Algorithm][ecma-262-same-value-algorithm], as specified in ECMAScript 5.\n* -   In contrast to the strict equality operator `===`, `-0` and `+0` are distinguishable and `NaNs` are the same.\n* -   If unable to find an element which equals a provided search element, the function returns `-1`.\n*\n* [ecma-262-same-value-algorithm]: http://ecma-international.org/ecma-262/5.1/#sec-9.12\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 = indexOfSameValue( 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 = indexOfSameValue( x, 2, 0 );\n* // returns 1\n*/\nfunction indexOfSameValue( x, searchElement, fromIndex ) {\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\tif ( isComplexTypedArray( x ) ) {\n\t\t\treturn complex( x, searchElement, fromIndex );\n\t\t}\n\t\tif ( isBooleanArray( x ) ) {\n\t\t\treturn boolean( x, searchElement, fromIndex );\n\t\t}\n\t\treturn accessors( x, searchElement, fromIndex );\n\t}\n\treturn indexed( x, searchElement, fromIndex );\n}\n\n\n// EXPORTS //\n\nmodule.exports = indexOfSameValue;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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 according to the same value algorithm.\n*\n* @module @stdlib/array-base-index-of-same-value\n*\n* @example\n* var indexOfSameValue = require( '@stdlib/array-base-index-of-same-value' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = indexOfSameValue( 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,gCAAiC,EAC1DC,EAAY,QAAS,2BAA4B,EAAE,YACnDC,EAAc,QAAS,0CAA2C,EAClEC,EAAqB,QAAS,0CAA2C,EACzEC,EAAsB,QAAS,kDAAmD,EAClFC,EAAiB,QAAS,2CAA4C,EACtEC,EAAgB,QAAS,mCAAoC,EAC7DC,EAAc,QAAS,8BAA+B,EACtDC,EAAO,QAAS,8BAA+B,EAC/CC,EAAO,QAAS,8BAA+B,EAoBnD,SAASC,EAASC,EAAGC,EAAeC,EAAY,CAC/C,IAAI,EACJ,IAAM,EAAIA,EAAW,EAAIF,EAAE,OAAQ,IAClC,GAAKJ,EAAaK,EAAeD,EAAG,CAAE,CAAE,EACvC,OAAO,EAGT,MAAO,EACR,CAmBA,SAASG,EAAWH,EAAGC,EAAeC,EAAY,CACjD,IAAIE,EACAC,EAGJ,IADAD,EAAMT,EAAeK,CAAE,EACjBK,EAAIH,EAAWG,EAAIL,EAAE,OAAQK,IAClC,GAAKT,EAAaK,EAAeG,EAAKJ,EAAGK,CAAE,CAAE,EAC5C,OAAOA,EAGT,MAAO,EACR,CAoBA,SAASC,EAASN,EAAGC,EAAeC,EAAY,CAC/C,IAAIK,EACAC,EACAC,EACAJ,EACJ,GAAK,CAAChB,EAAeY,CAAc,EAClC,MAAO,GAKR,IAHAM,EAAOhB,EAAaS,EAAG,CAAE,EACzBQ,EAAKX,EAAMI,CAAc,EACzBQ,EAAKX,EAAMG,CAAc,EACnBI,EAAIH,EAAU,EAAGG,EAAIE,EAAK,OAAQF,GAAK,EAC5C,GAAKT,EAAaW,EAAMF,CAAE,EAAGG,CAAG,GAAKZ,EAAaW,EAAMF,EAAE,CAAE,EAAGI,CAAG,EACjE,OAAOJ,EAAI,EAGb,MAAO,EACR,CAmBA,SAASK,EAASV,EAAGC,EAAeC,EAAY,CAC/C,IAAIK,EACAI,EACAN,EACJ,GAAK,CAACf,EAAWW,CAAc,EAC9B,MAAO,GAIR,IAFAM,EAAOf,EAAoBQ,EAAG,CAAE,EAChCW,EAAMV,EAAkB,EAAI,EACtBI,EAAIH,EAAWG,EAAIE,EAAK,OAAQF,IACrC,GAAKE,EAAMF,CAAE,IAAMM,EAClB,OAAON,EAGT,MAAO,EACR,CAmCA,SAASO,EAAkBZ,EAAGC,EAAeC,EAAY,CAOxD,OANKA,EAAY,IAChBA,GAAaF,EAAE,OACVE,EAAY,IAChBA,EAAY,IAGTd,EAAiBY,CAAE,EAClBP,EAAqBO,CAAE,EACpBM,EAASN,EAAGC,EAAeC,CAAU,EAExCR,EAAgBM,CAAE,EACfU,EAASV,EAAGC,EAAeC,CAAU,EAEtCC,EAAWH,EAAGC,EAAeC,CAAU,EAExCH,EAASC,EAAGC,EAAeC,CAAU,CAC7C,CAKAf,EAAO,QAAUyB,ICtLjB,IAAIC,EAAO,IAKX,OAAO,QAAUA",
+  "names": ["require_main", "__commonJSMin", "exports", "module", "isAccessorArray", "isComplexLike", "isBoolean", "reinterpret", "reinterpretBoolean", "isComplexTypedArray", "isBooleanArray", "resolveGetter", "isSameValue", "real", "imag", "indexed", "x", "searchElement", "fromIndex", "accessors", "get", "i", "complex", "view", "re", "im", "boolean", "v", "indexOfSameValue", "main"]
+}

package/docs/types/index.d.ts

@@ -0,0 +1,61 @@
+/*
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+// TypeScript Version: 4.1
+
+/// <reference types="@stdlib/types"/>
+
+import { Collection, AccessorArrayLike } from '@stdlib/types/array';
+
+/**
+* Returns the index of the first element which equals a provided search element according to the same value algorithm.
+*
+* ## Notes
+*
+* -   The function uses the [SameValue Algorithm][ecma-262-same-value-algorithm], as specified in ECMAScript 5.
+* -   In contrast to the strict equality operator `===`, `-0` and `+0` are distinguishable and `NaNs` are the same.
+* -   If unable to find an element which equals a provided search element, the function returns `-1`.
+* -   If `fromIndex` is less than zero, the starting index is resolved relative to the last array element, with the last array element corresponding to `fromIndex = -1`.
+*
+* [ecma-262-same-value-algorithm]: http://ecma-international.org/ecma-262/5.1/#sec-9.12
+*
+* @param x - input array
+* @param searchElement - search element
+* @param fromIndex - starting index (inclusive)
+* @returns index
+*
+* @example
+* var x = [ 1, 2, 3, 4 ];
+*
+* var idx = indexOfSameValue( x, 2, 0 );
+* // returns 1
+*
+* @example
+* var Int32Array = require( '@stdlib/array-int32' );
+*
+* var x = new Int32Array( [ 1, 2, 3, 4 ] );
+*
+* var idx = indexOfSameValue( x, 2, 0 );
+* // returns 1
+*/
+declare function indexOfSameValue( x: Collection | AccessorArrayLike<unknown>, searchElement: unknown, fromIndex: number ): number;
+
+
+// EXPORTS //
+
+export = indexOfSameValue;

package/lib/index.js

@@ -0,0 +1,42 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+/**
+* Return the index of the first element which equals a provided search element according to the same value algorithm.
+*
+* @module @stdlib/array-base-index-of-same-value
+*
+* @example
+* var indexOfSameValue = require( '@stdlib/array-base-index-of-same-value' );
+*
+* var x = [ 1, 2, 3, 4 ];
+*
+* var idx = indexOfSameValue( x, 2, 0 );
+* // returns 1
+*/
+
+// MODULES //
+
+var main = require( './main.js' );
+
+
+// EXPORTS //
+
+module.exports = main;

package/lib/main.js

@@ -0,0 +1,219 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// 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 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' );
+
+
+// FUNCTIONS //
+
+/**
+* Returns the index of the first element which equals a provided search element according to the same value algorithm.
+*
+* @private
+* @param {Collection} x - input array
+* @param {*} searchElement - search element
+* @param {NonNegativeInteger} fromIndex - starting index (inclusive)
+* @returns {integer} index
+*
+* @example
+* var x = [ 1, 2, 3, 4 ];
+*
+* var idx = indexed( x, 2, 0 );
+* // returns 1
+*/
+function indexed( x, searchElement, fromIndex ) {
+	var i;
+	for ( i = fromIndex; i < x.length; i++ ) {
+		if ( isSameValue( searchElement, x[ i ] ) ) {
+			return i;
+		}
+	}
+	return -1;
+}
+
+/**
+* Returns the index of the first element which equals a provided search element according to the same value algorithm.
+*
+* @private
+* @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 x = toAccessorArray( [ 1, 2, 3, 4 ] );
+*
+* var idx = accessors( x, 2, 0 );
+* // returns 1
+*/
+function accessors( x, searchElement, fromIndex ) {
+	var get;
+	var i;
+
+	get = resolveGetter( x );
+	for ( i = fromIndex; i < x.length; i++ ) {
+		if ( isSameValue( searchElement, get( x, i ) ) ) {
+			return i;
+		}
+	}
+	return -1;
+}
+
+/**
+* Returns the index of the first element which equals a provided search element according to the same value algorithm.
+*
+* @private
+* @param {Collection} x - input array
+* @param {*} searchElement - search element
+* @param {NonNegativeInteger} fromIndex - starting index (inclusive)
+* @returns {integer} index
+*
+* @example
+* var Complex128Array = require( '@stdlib/array-complex128' );
+* var Complex128 = require( '@stdlib/complex-float64-ctor' );
+*
+* var x = new Complex128Array( [ 1.0, 2.0, 0.0, 0.0, 3.0, 4.0, 0.0, 0.0 ] );
+*
+* var idx = complex( x, new Complex128( 3.0, 4.0 ), 1 );
+* // returns 2
+*/
+function complex( x, searchElement, fromIndex ) {
+	var view;
+	var re;
+	var im;
+	var i;
+	if ( !isComplexLike( searchElement ) ) {
+		return -1;
+	}
+	view = reinterpret( x, 0 );
+	re = real( searchElement );
+	im = imag( searchElement );
+	for ( i = fromIndex*2; i < view.length; i += 2 ) {
+		if ( isSameValue( view[ i ], re ) && isSameValue( view[ i+1 ], im ) ) {
+			return i / 2;
+		}
+	}
+	return -1;
+}
+
+/**
+* Returns the index of the first element which equals a provided search element according to the same value algorithm.
+*
+* @private
+* @param {Collection} x - input array
+* @param {*} searchElement - search element
+* @param {NonNegativeInteger} fromIndex - starting index (inclusive)
+* @returns {integer} index
+*
+* @example
+* var BooleanArray = require( '@stdlib/array-bool' );
+*
+* var x = new BooleanArray( [ true, false, true, false, true ] );
+*
+* var idx = boolean( x, true, 1 );
+* // returns 2
+*/
+function boolean( x, searchElement, fromIndex ) {
+	var view;
+	var v;
+	var i;
+	if ( !isBoolean( searchElement ) ) {
+		return -1;
+	}
+	view = reinterpretBoolean( x, 0 );
+	v = ( searchElement ) ? 1 : 0;
+	for ( i = fromIndex; i < view.length; i++ ) {
+		if ( view[ i ] === v ) {
+			return i;
+		}
+	}
+	return -1;
+}
+
+
+// MAIN //
+
+/**
+* Returns the index of the first element which equals a provided search element according to the same value algorithm.
+*
+* ## Notes
+*
+* -   The function uses the [SameValue Algorithm][ecma-262-same-value-algorithm], as specified in ECMAScript 5.
+* -   In contrast to the strict equality operator `===`, `-0` and `+0` are distinguishable and `NaNs` are the same.
+* -   If unable to find an element which equals a provided search element, the function returns `-1`.
+*
+* [ecma-262-same-value-algorithm]: http://ecma-international.org/ecma-262/5.1/#sec-9.12
+*
+* @param {Collection} x - input array
+* @param {*} searchElement - search element
+* @param {integer} fromIndex - starting index (inclusive)
+* @returns {integer} index
+*
+* @example
+* var x = [ 1, 2, 3, 4 ];
+*
+* var idx = indexOfSameValue( x, 2, 0 );
+* // returns 1
+*
+* @example
+* var Int32Array = require( '@stdlib/array-int32' );
+*
+* var x = new Int32Array( [ 1, 2, 3, 4 ] );
+*
+* var idx = indexOfSameValue( x, 2, 0 );
+* // returns 1
+*/
+function indexOfSameValue( x, searchElement, fromIndex ) {
+	if ( fromIndex < 0 ) {
+		fromIndex += x.length;
+		if ( fromIndex < 0 ) {
+			fromIndex = 0;
+		}
+	}
+	if ( isAccessorArray( x ) ) {
+		if ( isComplexTypedArray( x ) ) {
+			return complex( x, searchElement, fromIndex );
+		}
+		if ( isBooleanArray( x ) ) {
+			return boolean( x, searchElement, fromIndex );
+		}
+		return accessors( x, searchElement, fromIndex );
+	}
+	return indexed( x, searchElement, fromIndex );
+}
+
+
+// EXPORTS //
+
+module.exports = indexOfSameValue;

package/package.json

@@ -0,0 +1,80 @@
+{
+  "name": "@stdlib/array-base-index-of-same-value",
+  "version": "0.1.0",
+  "description": "Return the index of the first element which equals a provided search element according to the same value algorithm.",
+  "license": "Apache-2.0",
+  "author": {
+    "name": "The Stdlib Authors",
+    "url": "https://github.com/stdlib-js/stdlib/graphs/contributors"
+  },
+  "contributors": [
+    {
+      "name": "The Stdlib Authors",
+      "url": "https://github.com/stdlib-js/stdlib/graphs/contributors"
+    }
+  ],
+  "main": "./lib",
+  "directories": {
+    "doc": "./docs",
+    "lib": "./lib",
+    "dist": "./dist"
+  },
+  "types": "./docs/types",
+  "scripts": {},
+  "homepage": "https://stdlib.io",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/stdlib-js/array-base-index-of-same-value.git"
+  },
+  "bugs": {
+    "url": "https://github.com/stdlib-js/stdlib/issues"
+  },
+  "dependencies": {
+    "@stdlib/array-base-assert-is-booleanarray": "^0.0.2",
+    "@stdlib/array-base-assert-is-complex-typed-array": "^0.1.2",
+    "@stdlib/array-base-resolve-getter": "^0.2.2",
+    "@stdlib/assert-is-accessor-array": "^0.2.2",
+    "@stdlib/assert-is-boolean": "^0.2.2",
+    "@stdlib/assert-is-complex-like": "^0.2.2",
+    "@stdlib/assert-is-same-value": "^0.2.2",
+    "@stdlib/complex-float64-imag": "^0.1.1",
+    "@stdlib/complex-float64-real": "^0.1.1",
+    "@stdlib/strided-base-reinterpret-boolean": "^0.0.2",
+    "@stdlib/strided-base-reinterpret-complex": "^0.1.2"
+  },
+  "devDependencies": {},
+  "engines": {
+    "node": ">=0.10.0",
+    "npm": ">2.7.0"
+  },
+  "os": [
+    "aix",
+    "darwin",
+    "freebsd",
+    "linux",
+    "macos",
+    "openbsd",
+    "sunos",
+    "win32",
+    "windows"
+  ],
+  "keywords": [
+    "stdlib",
+    "stdtypes",
+    "types",
+    "data",
+    "structure",
+    "array",
+    "generic",
+    "search",
+    "find",
+    "scan",
+    "locate",
+    "index",
+    "same"
+  ],
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
+  }
+}