@stdlib/stats-strided-nanmskrange 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,305 @@
+<!--
+
+@license Apache-2.0
+
+Copyright (c) 2020 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>
+
+# nanmskrange
+
+[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
+
+> Calculate the [range][range] of a strided array according to a mask, ignoring `NaN` values.
+
+<section class="intro">
+
+The [**range**][range] is defined as the difference between the maximum and minimum values.
+
+</section>
+
+<!-- /.intro -->
+
+<section class="installation">
+
+## Installation
+
+```bash
+npm install @stdlib/stats-strided-nanmskrange
+```
+
+</section>
+
+<section class="usage">
+
+## Usage
+
+```javascript
+var nanmskrange = require( '@stdlib/stats-strided-nanmskrange' );
+```
+
+#### nanmskrange( N, x, strideX, mask, strideMask )
+
+Computes the [range][range] of a strided array according to a mask, ignoring `NaN` values.
+
+```javascript
+var x = [ 1.0, -2.0, 4.0, 2.0, NaN, NaN ];
+var mask = [ 0, 0, 1, 0, 0, 0 ];
+
+var v = nanmskrange( 6, x, 1, mask, 1 );
+// returns 4.0
+```
+
+The function has the following parameters:
+
+-   **N**: number of indexed elements.
+-   **x**: input [`Array`][mdn-array] or [`typed array`][mdn-typed-array].
+-   **strideX**: stride length for `x`.
+-   **mask**: mask [`Array`][mdn-array] or [`typed array`][mdn-typed-array]. If a `mask` array element is `0`, the corresponding element in `x` is considered valid and **included** in computation. If a `mask` array element is `1`, the corresponding element in `x` is considered invalid/missing and **excluded** from computation.
+-   **strideMask**: stride length for `mask`.
+
+The `N` and stride parameters determine which elements in the strided arrays are accessed at runtime. For example, to compute the [range][range] of every other element in `x`,
+
+```javascript
+var x = [ 1.0, 2.0, -7.0, -2.0, 4.0, 3.0, 5.0, 6.0 ];
+var mask = [ 0, 0, 0, 0, 0, 0, 1, 1 ];
+
+var v = nanmskrange( 4, x, 2, mask, 2 );
+// returns 11.0
+```
+
+Note that indexing is relative to the first index. To introduce offsets, use [`typed array`][mdn-typed-array] views.
+
+<!-- eslint-disable stdlib/capitalized-comments, max-len -->
+
+```javascript
+var Float64Array = require( '@stdlib/array-float64' );
+var Uint8Array = require( '@stdlib/array-uint8' );
+
+var x0 = new Float64Array( [ 2.0, 1.0, -2.0, -2.0, 3.0, 4.0, 5.0, 6.0, NaN, NaN ] );
+var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
+
+var mask0 = new Uint8Array( [ 0, 0, 0, 0, 0, 0, 1, 1, 0, 0 ] );
+var mask1 = new Uint8Array( mask0.buffer, mask0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
+
+var v = nanmskrange( 5, x1, 2, mask1, 2 );
+// returns 6.0
+```
+
+#### nanmskrange.ndarray( N, x, strideX, offsetX, mask, strideMask, offsetMask )
+
+Computes the [range][range] of a strided array according to a mask, ignoring `NaN` values and using alternative indexing semantics.
+
+```javascript
+var x = [ 1.0, -2.0, 4.0, 2.0, NaN, NaN ];
+var mask = [ 0, 0, 1, 0, 0, 0 ];
+
+var v = nanmskrange.ndarray( 6, x, 1, 0, mask, 1, 0 );
+// returns 4.0
+```
+
+The function has the following additional parameters:
+
+-   **offsetX**: starting index for `x`.
+-   **offsetMask**: starting index for `mask`.
+
+While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameters support indexing semantics based on a starting indices. For example, to calculate the [range][range] for every other value in `x` starting from the second value
+
+```javascript
+var x = [ 2.0, 1.0, -2.0, -2.0, 3.0, 4.0, 5.0, 6.0 ];
+var mask = [ 0, 0, 0, 0, 0, 0, 1, 1 ];
+
+var v = nanmskrange.ndarray( 4, x, 2, 1, mask, 2, 1 );
+// returns 6.0
+```
+
+</section>
+
+<!-- /.usage -->
+
+<section class="notes">
+
+## Notes
+
+-   If `N <= 0`, both functions return `NaN`.
+-   Both functions support array-like objects having getter and setter accessors for array element access (e.g., [`@stdlib/array-base/accessor`][@stdlib/array/base/accessor]).
+-   Depending on the environment, the typed versions ([`dnanmskrange`][@stdlib/stats/strided/dnanmskrange], [`snanmskrange`][@stdlib/stats/strided/snanmskrange], etc.) are likely to be significantly more performant.
+
+</section>
+
+<!-- /.notes -->
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+```javascript
+var uniform = require( '@stdlib/random-base-uniform' );
+var bernoulli = require( '@stdlib/random-base-bernoulli' );
+var filledarrayBy = require( '@stdlib/array-filled-by' );
+var nanmskrange = require( '@stdlib/stats-strided-nanmskrange' );
+
+function rand() {
+    if ( bernoulli( 0.8 ) < 1 ) {
+        return NaN;
+    }
+    return uniform( -50.0, 50.0 );
+}
+
+var x = filledarrayBy( 10, 'float64', rand );
+console.log( x );
+
+var mask = filledarrayBy( x.length, 'uint8', bernoulli.factory( 0.2 ) );
+console.log( mask );
+
+var v = nanmskrange( x.length, x, 1, mask, 1 );
+console.log( v );
+```
+
+</section>
+
+<!-- /.examples -->
+
+<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
+
+<section class="related">
+
+* * *
+
+## See Also
+
+-   <span class="package-name">[`@stdlib/stats-strided/dnanmskrange`][@stdlib/stats/strided/dnanmskrange]</span><span class="delimiter">: </span><span class="description">calculate the range of a double-precision floating-point strided array according to a mask, ignoring NaN values.</span>
+-   <span class="package-name">[`@stdlib/stats-strided/mskrange`][@stdlib/stats/strided/mskrange]</span><span class="delimiter">: </span><span class="description">calculate the range of a strided array according to a mask.</span>
+-   <span class="package-name">[`@stdlib/stats-strided/nanrange`][@stdlib/stats/strided/nanrange]</span><span class="delimiter">: </span><span class="description">calculate the range of a strided array, ignoring NaN values.</span>
+-   <span class="package-name">[`@stdlib/stats-strided/nanmskmax`][@stdlib/stats/strided/nanmskmax]</span><span class="delimiter">: </span><span class="description">calculate the maximum value of a strided array according to a mask, ignoring NaN values.</span>
+-   <span class="package-name">[`@stdlib/stats-strided/nanmskmin`][@stdlib/stats/strided/nanmskmin]</span><span class="delimiter">: </span><span class="description">calculate the minimum value of a strided array according to a mask, ignoring NaN values.</span>
+-   <span class="package-name">[`@stdlib/stats-strided/snanmskrange`][@stdlib/stats/strided/snanmskrange]</span><span class="delimiter">: </span><span class="description">calculate the range of a single-precision floating-point strided array according to a mask, ignoring NaN values.</span>
+
+</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/stats-strided-nanmskrange.svg
+[npm-url]: https://npmjs.org/package/@stdlib/stats-strided-nanmskrange
+
+[test-image]: https://github.com/stdlib-js/stats-strided-nanmskrange/actions/workflows/test.yml/badge.svg?branch=v0.1.0
+[test-url]: https://github.com/stdlib-js/stats-strided-nanmskrange/actions/workflows/test.yml?query=branch:v0.1.0
+
+[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/stats-strided-nanmskrange/main.svg
+[coverage-url]: https://codecov.io/github/stdlib-js/stats-strided-nanmskrange?branch=main
+
+<!--
+
+[dependencies-image]: https://img.shields.io/david/stdlib-js/stats-strided-nanmskrange.svg
+[dependencies-url]: https://david-dm.org/stdlib-js/stats-strided-nanmskrange/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/stats-strided-nanmskrange/tree/deno
+[deno-readme]: https://github.com/stdlib-js/stats-strided-nanmskrange/blob/deno/README.md
+[umd-url]: https://github.com/stdlib-js/stats-strided-nanmskrange/tree/umd
+[umd-readme]: https://github.com/stdlib-js/stats-strided-nanmskrange/blob/umd/README.md
+[esm-url]: https://github.com/stdlib-js/stats-strided-nanmskrange/tree/esm
+[esm-readme]: https://github.com/stdlib-js/stats-strided-nanmskrange/blob/esm/README.md
+[branches-url]: https://github.com/stdlib-js/stats-strided-nanmskrange/blob/main/branches.md
+
+[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/stats-strided-nanmskrange/main/LICENSE
+
+[range]: https://en.wikipedia.org/wiki/Range_%28statistics%29
+
+[mdn-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
+
+[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
+
+[@stdlib/array/base/accessor]: https://www.npmjs.com/package/@stdlib/array-base-accessor
+
+<!-- <related-links> -->
+
+[@stdlib/stats/strided/dnanmskrange]: https://www.npmjs.com/package/@stdlib/stats-strided-dnanmskrange
+
+[@stdlib/stats/strided/mskrange]: https://www.npmjs.com/package/@stdlib/stats-strided-mskrange
+
+[@stdlib/stats/strided/nanrange]: https://www.npmjs.com/package/@stdlib/stats-strided-nanrange
+
+[@stdlib/stats/strided/nanmskmax]: https://www.npmjs.com/package/@stdlib/stats-strided-nanmskmax
+
+[@stdlib/stats/strided/nanmskmin]: https://www.npmjs.com/package/@stdlib/stats-strided-nanmskmin
+
+[@stdlib/stats/strided/snanmskrange]: https://www.npmjs.com/package/@stdlib/stats-strided-snanmskrange
+
+<!-- </related-links> -->
+
+</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 nanmskrange from '../docs/types/index';
+export = nanmskrange;

package/dist/index.js

@@ -0,0 +1,10 @@
+"use strict";var b=function(a,n){return function(){return n||a((n={exports:{}}).exports,n),n.exports}};var P=b(function(K,p){
+var A=require('@stdlib/math-base-assert-is-nan/dist');function B(a,n,v,g,u,s,l){var m,o,t,c,q,f,r,e,i,x;for(m=n.data,o=u.data,c=n.accessors[0],t=u.accessors[0],r=g,e=l,x=0;x<a&&(i=c(m,r),!(i===i&&t(o,e)===0));x++)r+=v,e+=s;if(x===a)return NaN;for(f=i,q=f,x+=1,x;x<a;x++)r+=v,e+=s,!t(o,e)&&(i=c(m,r),!A(i)&&(i<f?f=i:i>q&&(q=i)));return q-f}p.exports=B
+});var y=b(function(L,O){
+var C=require('@stdlib/math-base-assert-is-nan/dist'),j=require('@stdlib/array-base-arraylike2object/dist'),D=P();function E(a,n,v,g,u,s,l){var m,o,t,c,q,f,r,e;if(a<=0)return NaN;if(q=j(n),f=j(u),q.accessorProtocol||f.accessorProtocol)return D(a,q,v,g,f,s,l);for(t=g,c=l,e=0;e<a&&(r=n[t],!(r===r&&u[c]===0));e++)t+=v,c+=s;if(e===a)return NaN;for(o=r,m=o,e+=1,e;e<a;e++)t+=v,c+=s,!u[c]&&(r=n[t],!C(r)&&(r<o?o=r:r>m&&(m=r)));return m-o}O.exports=E
+});var w=b(function(Q,h){
+var R=require('@stdlib/strided-base-stride2offset/dist'),F=y();function G(a,n,v,g,u){var s=R(a,v),l=R(a,u);return F(a,n,v,s,g,u,l)}h.exports=G
+});var H=require('@stdlib/utils-define-nonenumerable-read-only-property/dist'),z=w(),I=y();H(z,"ndarray",I);module.exports=z;
+/** @license Apache-2.0 */
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/accessors.js", "../lib/ndarray.js", "../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 isnan = require( '@stdlib/math-base-assert-is-nan' );\n\n\n// MAIN //\n\n/**\n* Computes the range of a strided array according to a mask, ignoring `NaN` values.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array element\n* @param {Array<Function>} x.accessors - array element accessors\n* @param {integer} strideX - stride length for `x`\n* @param {NonNegativeInteger} offsetX - starting index for `x`\n* @param {Object} mask - mask array object\n* @param {Collection} mask.data - mask array element\n* @param {Array<Function>} mask.accessors - mask array element accessors\n* @param {integer} strideMask - stride length `mask`\n* @param {NonNegativeInteger} offsetMask - starting index `mask`\n* @returns {number} range\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 = toAccessorArray( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );\n* var mask = toAccessorArray( [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1 ] );\n*\n* var v = nanmskrange( 5, arraylike2object( x ), 2, 1, arraylike2object( mask ), 2, 1 );\n* // returns 6.0\n*/\nfunction nanmskrange( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {\n\tvar xbuf;\n\tvar mbuf;\n\tvar mget;\n\tvar xget;\n\tvar max;\n\tvar min;\n\tvar ix;\n\tvar im;\n\tvar v;\n\tvar i;\n\n\t// Cache references to array data:\n\txbuf = x.data;\n\tmbuf = mask.data;\n\n\t// Cache references to element accessors:\n\txget = x.accessors[ 0 ];\n\tmget = mask.accessors[ 0 ];\n\n\tix = offsetX;\n\tim = offsetMask;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tv = xget( xbuf, ix );\n\t\tif ( v === v && mget( mbuf, im ) === 0 ) {\n\t\t\tbreak;\n\t\t}\n\t\tix += strideX;\n\t\tim += strideMask;\n\t}\n\tif ( i === N ) {\n\t\treturn NaN;\n\t}\n\tmin = v;\n\tmax = min;\n\ti += 1;\n\tfor ( i; i < N; i++ ) {\n\t\tix += strideX;\n\t\tim += strideMask;\n\t\tif ( mget( mbuf, im ) ) {\n\t\t\tcontinue;\n\t\t}\n\t\tv = xget( xbuf, ix );\n\t\tif ( isnan( v ) ) {\n\t\t\tcontinue;\n\t\t}\n\t\tif ( v < min ) {\n\t\t\tmin = v;\n\t\t} else if ( v > max ) {\n\t\t\tmax = v;\n\t\t}\n\t}\n\treturn max - min;\n}\n\n\n// EXPORTS //\n\nmodule.exports = nanmskrange;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 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 isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar arraylike2object = require( '@stdlib/array-base-arraylike2object' );\nvar accessors = require( './accessors.js' );\n\n\n// MAIN //\n\n/**\n* Computes the range of a strided array according to a mask, ignoring `NaN` values.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {NumericArray} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {NonNegativeInteger} offsetX - `x` starting index\n* @param {NumericArray} mask - mask array\n* @param {integer} strideMask - `mask` stride length\n* @param {NonNegativeInteger} offsetMask - `mask` starting index\n* @returns {number} range\n*\n* @example\n* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];\n* var mask = [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1 ];\n*\n* var v = nanmskrange( 5, x, 2, 1, mask, 2, 1 );\n* // returns 6.0\n*/\nfunction nanmskrange( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {\n\tvar max;\n\tvar min;\n\tvar ix;\n\tvar im;\n\tvar ox;\n\tvar om;\n\tvar v;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn NaN;\n\t}\n\tox = arraylike2object( x );\n\tom = arraylike2object( mask );\n\tif ( ox.accessorProtocol || om.accessorProtocol ) {\n\t\treturn accessors( N, ox, strideX, offsetX, om, strideMask, offsetMask );\n\t}\n\tix = offsetX;\n\tim = offsetMask;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tv = x[ ix ];\n\t\tif ( v === v && mask[ im ] === 0 ) {\n\t\t\tbreak;\n\t\t}\n\t\tix += strideX;\n\t\tim += strideMask;\n\t}\n\tif ( i === N ) {\n\t\treturn NaN;\n\t}\n\tmin = v;\n\tmax = min;\n\ti += 1;\n\tfor ( i; i < N; i++ ) {\n\t\tix += strideX;\n\t\tim += strideMask;\n\t\tif ( mask[ im ] ) {\n\t\t\tcontinue;\n\t\t}\n\t\tv = x[ ix ];\n\t\tif ( isnan( v ) ) {\n\t\t\tcontinue;\n\t\t}\n\t\tif ( v < min ) {\n\t\t\tmin = v;\n\t\t} else if ( v > max ) {\n\t\t\tmax = v;\n\t\t}\n\t}\n\treturn max - min;\n}\n\n\n// EXPORTS //\n\nmodule.exports = nanmskrange;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 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 stride2offset = require( '@stdlib/strided-base-stride2offset' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\n/**\n* Computes the range of a strided array according to a mask, ignoring `NaN` values.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {NumericArray} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {NumericArray} mask - mask array\n* @param {integer} strideMask - `mask` stride length\n* @returns {number} range\n*\n* @example\n* var x = [ 1.0, -2.0, 4.0, 2.0, NaN ];\n* var mask = [ 0, 0, 1, 0, 0 ];\n*\n* var v = nanmskrange( x.length, x, 1, mask, 1 );\n* // returns 4.0\n*/\nfunction nanmskrange( N, x, strideX, mask, strideMask ) {\n\tvar ix = stride2offset( N, strideX );\n\tvar im = stride2offset( N, strideMask);\n\treturn ndarray( N, x, strideX, ix, mask, strideMask, im );\n}\n\n\n// EXPORTS //\n\nmodule.exports = nanmskrange;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 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* Compute the range of a strided array according to a mask, ignoring `NaN` values.\n*\n* @module @stdlib/stats-strided-nanmskrange\n*\n* @example\n* var nanmskrange = require( '@stdlib/stats-strided-nanmskrange' );\n*\n* var x = [ 1.0, -2.0, 4.0, 2.0, NaN ];\n* var mask = [ 0, 0, 1, 0, 0 ];\n*\n* var v = nanmskrange( x.length, x, 1, mask, 1 );\n* // returns 4.0\n*\n* @example\n* var nanmskrange = require( '@stdlib/stats-strided-nanmskrange' );\n*\n* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];\n* var mask = [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1 ];\n*\n* var v = nanmskrange.ndarray( 5, x, 2, 1, mask, 2, 1 );\n* // returns 6.0\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar nanmskrange = require( './main.js' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\nsetReadOnly( nanmskrange, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nmodule.exports = nanmskrange;\n"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAQ,QAAS,iCAAkC,EA+BvD,SAASC,EAAaC,EAAGC,EAAGC,EAASC,EAASC,EAAMC,EAAYC,EAAa,CAC5E,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAYJ,IATAT,EAAON,EAAE,KACTO,EAAOJ,EAAK,KAGZM,EAAOT,EAAE,UAAW,CAAE,EACtBQ,EAAOL,EAAK,UAAW,CAAE,EAEzBS,EAAKV,EACLW,EAAKR,EACCU,EAAI,EAAGA,EAAIhB,IAChBe,EAAIL,EAAMH,EAAMM,CAAG,EACd,EAAAE,IAAMA,GAAKN,EAAMD,EAAMM,CAAG,IAAM,IAFlBE,IAKnBH,GAAMX,EACNY,GAAMT,EAEP,GAAKW,IAAMhB,EACV,MAAO,KAKR,IAHAY,EAAMG,EACNJ,EAAMC,EACNI,GAAK,EACCA,EAAGA,EAAIhB,EAAGgB,IACfH,GAAMX,EACNY,GAAMT,EACD,CAAAI,EAAMD,EAAMM,CAAG,IAGpBC,EAAIL,EAAMH,EAAMM,CAAG,EACd,CAAAf,EAAOiB,CAAE,IAGTA,EAAIH,EACRA,EAAMG,EACKA,EAAIJ,IACfA,EAAMI,KAGR,OAAOJ,EAAMC,CACd,CAKAf,EAAO,QAAUE,IC/GjB,IAAAkB,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAQ,QAAS,iCAAkC,EACnDC,EAAmB,QAAS,qCAAsC,EAClEC,EAAY,IAwBhB,SAASC,EAAaC,EAAGC,EAAGC,EAASC,EAASC,EAAMC,EAAYC,EAAa,CAC5E,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKd,GAAK,EACT,MAAO,KAIR,GAFAW,EAAKd,EAAkBI,CAAE,EACzBW,EAAKf,EAAkBO,CAAK,EACvBO,EAAG,kBAAoBC,EAAG,iBAC9B,OAAOd,EAAWE,EAAGW,EAAIT,EAASC,EAASS,EAAIP,EAAYC,CAAW,EAIvE,IAFAG,EAAKN,EACLO,EAAKJ,EACCQ,EAAI,EAAGA,EAAId,IAChBa,EAAIZ,EAAGQ,CAAG,EACL,EAAAI,IAAMA,GAAKT,EAAMM,CAAG,IAAM,IAFZI,IAKnBL,GAAMP,EACNQ,GAAML,EAEP,GAAKS,IAAMd,EACV,MAAO,KAKR,IAHAQ,EAAMK,EACNN,EAAMC,EACNM,GAAK,EACCA,EAAGA,EAAId,EAAGc,IACfL,GAAMP,EACNQ,GAAML,EACD,CAAAD,EAAMM,CAAG,IAGdG,EAAIZ,EAAGQ,CAAG,EACL,CAAAb,EAAOiB,CAAE,IAGTA,EAAIL,EACRA,EAAMK,EACKA,EAAIN,IACfA,EAAMM,KAGR,OAAON,EAAMC,CACd,CAKAb,EAAO,QAAUI,ICxGjB,IAAAgB,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAgB,QAAS,oCAAqC,EAC9DC,EAAU,IAsBd,SAASC,EAAaC,EAAGC,EAAGC,EAASC,EAAMC,EAAa,CACvD,IAAIC,EAAKR,EAAeG,EAAGE,CAAQ,EAC/BI,EAAKT,EAAeG,EAAGI,CAAU,EACrC,OAAON,EAASE,EAAGC,EAAGC,EAASG,EAAIF,EAAMC,EAAYE,CAAG,CACzD,CAKAV,EAAO,QAAUG,ICRjB,IAAIQ,EAAc,QAAS,uDAAwD,EAC/EC,EAAc,IACdC,EAAU,IAKdF,EAAaC,EAAa,UAAWC,CAAQ,EAK7C,OAAO,QAAUD",
+  "names": ["require_accessors", "__commonJSMin", "exports", "module", "isnan", "nanmskrange", "N", "x", "strideX", "offsetX", "mask", "strideMask", "offsetMask", "xbuf", "mbuf", "mget", "xget", "max", "min", "ix", "im", "v", "i", "require_ndarray", "__commonJSMin", "exports", "module", "isnan", "arraylike2object", "accessors", "nanmskrange", "N", "x", "strideX", "offsetX", "mask", "strideMask", "offsetMask", "max", "min", "ix", "im", "ox", "om", "v", "i", "require_main", "__commonJSMin", "exports", "module", "stride2offset", "ndarray", "nanmskrange", "N", "x", "strideX", "mask", "strideMask", "ix", "im", "setReadOnly", "nanmskrange", "ndarray"]
+}

package/docs/types/index.d.ts

@@ -0,0 +1,104 @@
+/*
+* @license Apache-2.0
+*
+* Copyright (c) 2020 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 { NumericArray, Collection, AccessorArrayLike } from '@stdlib/types/array';
+
+/**
+* Input array.
+*/
+type InputArray = NumericArray | Collection<number> | AccessorArrayLike<number>;
+
+/**
+* Interface describing `nanmskrange`.
+*/
+interface Routine {
+	/**
+	* Computes the range of a strided array according to a mask, ignoring `NaN` values.
+	*
+	* @param N - number of indexed elements
+	* @param x - input array
+	* @param strideX - stride length for `x`
+	* @param mask - mask array
+	* @param strideMask - stride length for `mask`
+	* @returns range
+	*
+	* @example
+	* var x = [ 1.0, -2.0, 4.0, 2.0, NaN ];
+	* var mask = [ 0, 0, 1, 0, 0 ];
+	*
+	* var v = nanmskrange( x.length, x, 1, mask, 1 );
+	* // returns 4.0
+	*/
+	( N: number, x: InputArray, strideX: number, mask: InputArray, strideMask: number ): number;
+
+	/**
+	* Computes the range of a strided array according to a mask, ignoring `NaN` values and using alternative indexing semantics.
+	*
+	* @param N - number of indexed elements
+	* @param x - input array
+	* @param strideX - stride length for `x`
+	* @param offsetX - `x` starting index
+	* @param mask - mask array
+	* @param strideMask - stride length for `mask`
+	* @param offsetMask - `mask` starting index
+	* @returns range
+	*
+	* @example
+	* var x = [ 1.0, -2.0, 4.0, 2.0, NaN ];
+	* var mask = [ 0, 0, 1, 0, 0 ];
+	*
+	* var v = nanmskrange.ndarray( x.length, x, 1, 0, mask, 1, 0 );
+	* // returns 4.0
+	*/
+	ndarray( N: number, x: InputArray, strideX: number, offsetX: number, mask: InputArray, strideMask: number, offsetMask: number ): number;
+}
+
+/**
+* Computes the range of a strided array according to a mask, ignoring `NaN` values.
+*
+* @param N - number of indexed elements
+* @param x - input array
+* @param strideX - stride length for `x`
+* @param mask - mask array
+* @param strideMask - stride length for `x`
+* @returns range
+*
+* @example
+* var x = [ 1.0, -2.0, 4.0, 2.0, NaN ];
+* var mask = [ 0, 0, 1, 0, 0 ];
+*
+* var v = nanmskrange( x.length, x, 1, mask, 1 );
+* // returns 4.0
+*
+* @example
+* var x = [ 1.0, -2.0, 4.0, 2.0, NaN ];
+* var mask = [ 0, 0, 1, 0, 0 ];
+*
+* var v = nanmskrange.ndarray( x.length, x, 1, 0, mask, 1, 0 );
+* // returns 4.0
+*/
+declare var nanmskrange: Routine;
+
+
+// EXPORTS //
+
+export = nanmskrange;

package/lib/accessors.js

@@ -0,0 +1,112 @@
+/**
+* @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 isnan = require( '@stdlib/math-base-assert-is-nan' );
+
+
+// MAIN //
+
+/**
+* Computes the range of a strided array according to a mask, ignoring `NaN` values.
+*
+* @param {PositiveInteger} N - number of indexed elements
+* @param {Object} x - input array object
+* @param {Collection} x.data - input array element
+* @param {Array<Function>} x.accessors - array element accessors
+* @param {integer} strideX - stride length for `x`
+* @param {NonNegativeInteger} offsetX - starting index for `x`
+* @param {Object} mask - mask array object
+* @param {Collection} mask.data - mask array element
+* @param {Array<Function>} mask.accessors - mask array element accessors
+* @param {integer} strideMask - stride length `mask`
+* @param {NonNegativeInteger} offsetMask - starting index `mask`
+* @returns {number} range
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
+* var arraylike2object = require( '@stdlib/array-base-arraylike2object' );
+*
+* var x = toAccessorArray( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
+* var mask = toAccessorArray( [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1 ] );
+*
+* var v = nanmskrange( 5, arraylike2object( x ), 2, 1, arraylike2object( mask ), 2, 1 );
+* // returns 6.0
+*/
+function nanmskrange( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {
+	var xbuf;
+	var mbuf;
+	var mget;
+	var xget;
+	var max;
+	var min;
+	var ix;
+	var im;
+	var v;
+	var i;
+
+	// Cache references to array data:
+	xbuf = x.data;
+	mbuf = mask.data;
+
+	// Cache references to element accessors:
+	xget = x.accessors[ 0 ];
+	mget = mask.accessors[ 0 ];
+
+	ix = offsetX;
+	im = offsetMask;
+	for ( i = 0; i < N; i++ ) {
+		v = xget( xbuf, ix );
+		if ( v === v && mget( mbuf, im ) === 0 ) {
+			break;
+		}
+		ix += strideX;
+		im += strideMask;
+	}
+	if ( i === N ) {
+		return NaN;
+	}
+	min = v;
+	max = min;
+	i += 1;
+	for ( i; i < N; i++ ) {
+		ix += strideX;
+		im += strideMask;
+		if ( mget( mbuf, im ) ) {
+			continue;
+		}
+		v = xget( xbuf, ix );
+		if ( isnan( v ) ) {
+			continue;
+		}
+		if ( v < min ) {
+			min = v;
+		} else if ( v > max ) {
+			max = v;
+		}
+	}
+	return max - min;
+}
+
+
+// EXPORTS //
+
+module.exports = nanmskrange;

package/lib/index.js

@@ -0,0 +1,59 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2020 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';
+
+/**
+* Compute the range of a strided array according to a mask, ignoring `NaN` values.
+*
+* @module @stdlib/stats-strided-nanmskrange
+*
+* @example
+* var nanmskrange = require( '@stdlib/stats-strided-nanmskrange' );
+*
+* var x = [ 1.0, -2.0, 4.0, 2.0, NaN ];
+* var mask = [ 0, 0, 1, 0, 0 ];
+*
+* var v = nanmskrange( x.length, x, 1, mask, 1 );
+* // returns 4.0
+*
+* @example
+* var nanmskrange = require( '@stdlib/stats-strided-nanmskrange' );
+*
+* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
+* var mask = [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1 ];
+*
+* var v = nanmskrange.ndarray( 5, x, 2, 1, mask, 2, 1 );
+* // returns 6.0
+*/
+
+// MODULES //
+
+var setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );
+var nanmskrange = require( './main.js' );
+var ndarray = require( './ndarray.js' );
+
+
+// MAIN //
+
+setReadOnly( nanmskrange, 'ndarray', ndarray );
+
+
+// EXPORTS //
+
+module.exports = nanmskrange;

package/lib/main.js

@@ -0,0 +1,55 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2020 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 stride2offset = require( '@stdlib/strided-base-stride2offset' );
+var ndarray = require( './ndarray.js' );
+
+
+// MAIN //
+
+/**
+* Computes the range of a strided array according to a mask, ignoring `NaN` values.
+*
+* @param {PositiveInteger} N - number of indexed elements
+* @param {NumericArray} x - input array
+* @param {integer} strideX - `x` stride length
+* @param {NumericArray} mask - mask array
+* @param {integer} strideMask - `mask` stride length
+* @returns {number} range
+*
+* @example
+* var x = [ 1.0, -2.0, 4.0, 2.0, NaN ];
+* var mask = [ 0, 0, 1, 0, 0 ];
+*
+* var v = nanmskrange( x.length, x, 1, mask, 1 );
+* // returns 4.0
+*/
+function nanmskrange( N, x, strideX, mask, strideMask ) {
+	var ix = stride2offset( N, strideX );
+	var im = stride2offset( N, strideMask);
+	return ndarray( N, x, strideX, ix, mask, strideMask, im );
+}
+
+
+// EXPORTS //
+
+module.exports = nanmskrange;

package/lib/ndarray.js

@@ -0,0 +1,105 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2020 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 isnan = require( '@stdlib/math-base-assert-is-nan' );
+var arraylike2object = require( '@stdlib/array-base-arraylike2object' );
+var accessors = require( './accessors.js' );
+
+
+// MAIN //
+
+/**
+* Computes the range of a strided array according to a mask, ignoring `NaN` values.
+*
+* @param {PositiveInteger} N - number of indexed elements
+* @param {NumericArray} x - input array
+* @param {integer} strideX - `x` stride length
+* @param {NonNegativeInteger} offsetX - `x` starting index
+* @param {NumericArray} mask - mask array
+* @param {integer} strideMask - `mask` stride length
+* @param {NonNegativeInteger} offsetMask - `mask` starting index
+* @returns {number} range
+*
+* @example
+* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
+* var mask = [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1 ];
+*
+* var v = nanmskrange( 5, x, 2, 1, mask, 2, 1 );
+* // returns 6.0
+*/
+function nanmskrange( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {
+	var max;
+	var min;
+	var ix;
+	var im;
+	var ox;
+	var om;
+	var v;
+	var i;
+
+	if ( N <= 0 ) {
+		return NaN;
+	}
+	ox = arraylike2object( x );
+	om = arraylike2object( mask );
+	if ( ox.accessorProtocol || om.accessorProtocol ) {
+		return accessors( N, ox, strideX, offsetX, om, strideMask, offsetMask );
+	}
+	ix = offsetX;
+	im = offsetMask;
+	for ( i = 0; i < N; i++ ) {
+		v = x[ ix ];
+		if ( v === v && mask[ im ] === 0 ) {
+			break;
+		}
+		ix += strideX;
+		im += strideMask;
+	}
+	if ( i === N ) {
+		return NaN;
+	}
+	min = v;
+	max = min;
+	i += 1;
+	for ( i; i < N; i++ ) {
+		ix += strideX;
+		im += strideMask;
+		if ( mask[ im ] ) {
+			continue;
+		}
+		v = x[ ix ];
+		if ( isnan( v ) ) {
+			continue;
+		}
+		if ( v < min ) {
+			min = v;
+		} else if ( v > max ) {
+			max = v;
+		}
+	}
+	return max - min;
+}
+
+
+// EXPORTS //
+
+module.exports = nanmskrange;

package/package.json

@@ -0,0 +1,82 @@
+{
+  "name": "@stdlib/stats-strided-nanmskrange",
+  "version": "0.1.0",
+  "description": "Calculate the range of a strided array according to a mask, ignoring NaN values.",
+  "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/stats-strided-nanmskrange.git"
+  },
+  "bugs": {
+    "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/strided-base-stride2offset": "^0.1.0",
+    "@stdlib/utils-define-nonenumerable-read-only-property": "^0.2.2"
+  },
+  "devDependencies": {},
+  "engines": {
+    "node": ">=0.10.0",
+    "npm": ">2.7.0"
+  },
+  "os": [
+    "aix",
+    "darwin",
+    "freebsd",
+    "linux",
+    "macos",
+    "openbsd",
+    "sunos",
+    "win32",
+    "windows"
+  ],
+  "keywords": [
+    "stdlib",
+    "stdmath",
+    "statistics",
+    "stats",
+    "mathematics",
+    "math",
+    "maximum",
+    "max",
+    "minimum",
+    "min",
+    "range",
+    "extremes",
+    "domain",
+    "extent",
+    "dispersion",
+    "strided",
+    "strided array",
+    "masked",
+    "mask",
+    "masked array",
+    "typed",
+    "array"
+  ],
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
+  }
+}