@stdlib/array-base-cuany-by 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,244 @@
+<!--
+
+@license Apache-2.0
+
+Copyright (c) 2024 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>
+
+# cuanyBy
+
+[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
+
+> Cumulatively test whether at least one element in a provided array passes a test implemented by a predicate function.
+
+<section class="installation">
+
+## Installation
+
+```bash
+npm install @stdlib/array-base-cuany-by
+```
+
+</section>
+
+<section class="usage">
+
+## Usage
+
+```javascript
+var cuanyBy = require( '@stdlib/array-base-cuany-by' );
+```
+
+#### cuanyBy( x, predicate\[, thisArg] )
+
+Cumulatively tests whether at least one element in a provided array passes a test implemented by a `predicate` function.
+
+```javascript
+function isPositive( value ) {
+    return ( value > 0 );
+}
+
+var x = [ 0, 0, 0, 1, 0 ];
+
+var y = cuanyBy( x, isPositive );
+// returns [ false, false, false, true, true ]
+```
+
+The `predicate` function is provided three arguments:
+
+-   **value**: current array element.
+-   **index**: current array element index.
+-   **arr**: input array.
+
+To set the `predicate` function execution context, provide a `thisArg`.
+
+```javascript
+function isPositive( value ) {
+    this.count += 1;
+    return ( value > 0 );
+}
+
+var x = [ 0, 0, 0, 1, 0 ];
+
+var context = {
+    'count': 0
+};
+
+var out = cuanyBy( x, isPositive, context );
+// returns [ false, false, false, true, true ]
+
+var cnt = context.count;
+// returns 4
+```
+
+#### cuanyBy.assign( x, out, stride, offset, predicate\[, thisArg] )
+
+Cumulatively tests whether at least one element in a provided array passes a test implemented by a `predicate` function and assigns results to a provided output array.
+
+```javascript
+function isPositive( value ) {
+    return ( value > 0 );
+}
+
+var x = [ 0, 0, 0, 1, 0 ];
+var y = [ false, null, false, null, false, null, false, null, false, null ];
+
+var out = cuanyBy.assign( x, y, 2, 0, isPositive );
+// returns [ false, null, false, null, false, null, true, null, true, null ]
+
+var bool = ( out === y );
+// returns true
+```
+
+The function supports the following parameters:
+
+-   **x**: input array.
+-   **out**: output array.
+-   **stride**: output array stride.
+-   **offset**: output array offset.
+-   **predicate**: test function.
+
+</section>
+
+<!-- /.usage -->
+
+<section class="notes">
+
+</section>
+
+<!-- /.notes -->
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+```javascript
+var bernoulli = require( '@stdlib/random-array-bernoulli' );
+var cuanyBy = require( '@stdlib/array-base-cuany-by' );
+
+function isPositive( value ) {
+    return ( value > 0 );
+}
+
+// Create an array of random values:
+var x = bernoulli( 10, 0.1 );
+console.log( x );
+
+// Cumulatively determine whether at least one element is positive:
+var out = cuanyBy( x, isPositive );
+console.log( out );
+```
+
+</section>
+
+<!-- /.examples -->
+
+<!-- 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-cuany-by.svg
+[npm-url]: https://npmjs.org/package/@stdlib/array-base-cuany-by
+
+[test-image]: https://github.com/stdlib-js/array-base-cuany-by/actions/workflows/test.yml/badge.svg?branch=v0.1.0
+[test-url]: https://github.com/stdlib-js/array-base-cuany-by/actions/workflows/test.yml?query=branch:v0.1.0
+
+[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/array-base-cuany-by/main.svg
+[coverage-url]: https://codecov.io/github/stdlib-js/array-base-cuany-by?branch=main
+
+<!--
+
+[dependencies-image]: https://img.shields.io/david/stdlib-js/array-base-cuany-by.svg
+[dependencies-url]: https://david-dm.org/stdlib-js/array-base-cuany-by/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-cuany-by/tree/deno
+[deno-readme]: https://github.com/stdlib-js/array-base-cuany-by/blob/deno/README.md
+[umd-url]: https://github.com/stdlib-js/array-base-cuany-by/tree/umd
+[umd-readme]: https://github.com/stdlib-js/array-base-cuany-by/blob/umd/README.md
+[esm-url]: https://github.com/stdlib-js/array-base-cuany-by/tree/esm
+[esm-readme]: https://github.com/stdlib-js/array-base-cuany-by/blob/esm/README.md
+[branches-url]: https://github.com/stdlib-js/array-base-cuany-by/blob/main/branches.md
+
+[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/array-base-cuany-by/main/LICENSE
+
+</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 cuanyBy from '../docs/types/index';
+export = cuanyBy;

package/dist/index.js

@@ -0,0 +1,7 @@
+"use strict";var d=function(a,r){return function(){return r||a((r={exports:{}}).exports,r),r.exports}};var f=d(function(z,y){
+var q=require('@stdlib/array-base-arraylike2object/dist');function b(a,r,t,i,o,c){var e,s,n;for(e=!1,s=i,n=0;n<a.length;n++)!e&&o.call(c,a[n],n,a)&&(e=!0),r[s]=e,s+=t;return r}function j(a,r,t,i,o,c){var e,s,n,g,v,l,u;for(e=a.data,s=r.data,n=a.accessors[0],g=r.accessors[1],v=!1,l=i,u=0;u<e.length;u++)!v&&o.call(c,n(e,u),u,a)&&(v=!0),g(s,l,v),l+=t;return s}function k(a,r,t,i,o,c){var e=q(a),s=q(r);return e.accessorProtocol||s.accessorProtocol?j(e,s,t,i,o,c):(b(a,r,t,i,o,c),r)}y.exports=k
+});var p=d(function(C,h){
+var m=require('@stdlib/array-base-filled/dist'),x=f();function B(a,r,t){var i=m(!1,a.length);return x(a,i,1,0,r,t)}h.exports=B
+});var O=require('@stdlib/utils-define-nonenumerable-read-only-property/dist'),P=p(),R=f();O(P,"assign",R);module.exports=P;
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/assign.js", "../lib/main.js", "../lib/index.js"],
+  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( '@stdlib/array-base-arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Collection} y - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array offset\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {Collection} output array\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ false, false, false, true, false  ];\n* var y = [ false, null, false, null, false, null, false, null, false, null ];\n*\n* var out = indexed( x, y, 2, 0, isPositive );\n* // returns [ false, null, false, null, false, null, true, null, true, null ]\n*/\nfunction indexed( x, y, stride, offset, predicate, thisArg ) {\n\tvar flg;\n\tvar io;\n\tvar i;\n\n\tflg = false;\n\tio = offset;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( !flg && predicate.call(thisArg, x[ i ], i, x ) ) {\n\t\t\tflg = true;\n\t\t}\n\t\ty[ io ] = flg;\n\t\tio += stride;\n\t}\n\treturn y;\n}\n\n/**\n* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Object} y - output array object\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array offset\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {Collection} output array\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array-base-arraylike2object' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = toAccessorArray( [ false, false, false, true, false ] );\n* var y = toAccessorArray( [ false, null, false, null, false, null, false, null, false, null ] );\n*\n* var arr = accessors( arraylike2object( x ), arraylike2object( y ), 2, 0, isPositive );\n*\n* var v = y.get( 0 );\n* // returns false\n*\n* v = y.get( 2 );\n* // returns false\n*\n* v = y.get( 4 );\n* // returns false\n*\n* v = y.get( 6 );\n* // returns true\n*\n* v = y.get( 8 );\n* // returns true\n*/\nfunction accessors( x, y, stride, offset, predicate, thisArg ) {\n\tvar xdata;\n\tvar ydata;\n\tvar xget;\n\tvar yset;\n\tvar flg;\n\tvar io;\n\tvar i;\n\n\txdata = x.data;\n\tydata = y.data;\n\n\txget = x.accessors[ 0 ];\n\tyset = y.accessors[ 1 ];\n\n\tflg = false;\n\tio = offset;\n\tfor ( i = 0; i < xdata.length; i++ ) {\n\t\tif ( !flg && predicate.call( thisArg, xget( xdata, i ), i, x ) ) {\n\t\t\tflg = true;\n\t\t}\n\t\tyset( ydata, io, flg );\n\t\tio += stride;\n\t}\n\treturn ydata;\n}\n\n\n// MAIN //\n\n/**\n* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function and assigns results to a provided output array.\n*\n* @param {Collection} x - input array\n* @param {Collection} y - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array offset\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {Collection} output array\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 1, 0 ];\n* var y = [ false, null, false, null, false, null, false, null, false, null ];\n*\n* var out = assign( x, y, 2, 0, isPositive );\n// returns [ false, null, false, null, false, null, true, null, true, null ]\n*\n* var bool = ( y === out );\n* // returns true\n*/\nfunction assign( x, y, stride, offset, predicate, thisArg ) {\n\tvar xo = arraylike2object( x );\n\tvar yo = arraylike2object( y );\n\n\tif (\n\t\txo.accessorProtocol ||\n\t\tyo.accessorProtocol\n\t) {\n\t\treturn accessors( xo, yo, stride, offset, predicate, thisArg );\n\t}\n\tindexed( x, y, stride, offset, predicate, thisArg );\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = assign;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 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 filled = require( '@stdlib/array-base-filled' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\n/**\n* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {Array} output array\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 1, 0 ];\n*\n* var y = cuanyBy( x, isPositive );\n* // returns [ false, false, false, true, true ]\n*/\nfunction cuanyBy( x, predicate, thisArg ) {\n\tvar y = filled( false, x.length );\n\treturn assign( x, y, 1, 0, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = cuanyBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 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* Cumulatively test whether at least one element in a provided array passes a test implemented by a predicate function.\n*\n* @module @stdlib/array-base-cuany-by\n*\n* @example\n* var cuanyBy = require( '@stdlib/array-base-cuany-by' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 1, 0 ];\n*\n* var y = cuanyBy( x, isPositive );\n* // returns [ false, false, false, true, true ]\n*\n* @example\n* var cuanyBy = require( '@stdlib/array-base-cuany-by' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 1, 0 ];\n* var y = [ false, null, false, null, false, null, false, null, false, null ];\n*\n* var arr = cuanyBy.assign( x, y, 2, 0, isPositive );\n* // returns [ false, null, false, null, false, null, true, null, true, null ]\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAmB,QAAS,qCAAsC,EA4BtE,SAASC,EAASC,EAAGC,EAAGC,EAAQC,EAAQC,EAAWC,EAAU,CAC5D,IAAIC,EACAC,EACAC,EAIJ,IAFAF,EAAM,GACNC,EAAKJ,EACCK,EAAI,EAAGA,EAAIR,EAAE,OAAQQ,IACrB,CAACF,GAAOF,EAAU,KAAKC,EAASL,EAAGQ,CAAE,EAAGA,EAAGR,CAAE,IACjDM,EAAM,IAEPL,EAAGM,CAAG,EAAID,EACVC,GAAML,EAEP,OAAOD,CACR,CA0CA,SAASQ,EAAWT,EAAGC,EAAGC,EAAQC,EAAQC,EAAWC,EAAU,CAC9D,IAAIK,EACAC,EACAC,EACAC,EACAP,EACAC,EACAC,EAUJ,IARAE,EAAQV,EAAE,KACVW,EAAQV,EAAE,KAEVW,EAAOZ,EAAE,UAAW,CAAE,EACtBa,EAAOZ,EAAE,UAAW,CAAE,EAEtBK,EAAM,GACNC,EAAKJ,EACCK,EAAI,EAAGA,EAAIE,EAAM,OAAQF,IACzB,CAACF,GAAOF,EAAU,KAAMC,EAASO,EAAMF,EAAOF,CAAE,EAAGA,EAAGR,CAAE,IAC5DM,EAAM,IAEPO,EAAMF,EAAOJ,EAAID,CAAI,EACrBC,GAAML,EAEP,OAAOS,CACR,CA8BA,SAASG,EAAQd,EAAGC,EAAGC,EAAQC,EAAQC,EAAWC,EAAU,CAC3D,IAAIU,EAAKjB,EAAkBE,CAAE,EACzBgB,EAAKlB,EAAkBG,CAAE,EAE7B,OACCc,EAAG,kBACHC,EAAG,iBAEIP,EAAWM,EAAIC,EAAId,EAAQC,EAAQC,EAAWC,CAAQ,GAE9DN,EAASC,EAAGC,EAAGC,EAAQC,EAAQC,EAAWC,CAAQ,EAC3CJ,EACR,CAKAJ,EAAO,QAAUiB,ICnLjB,IAAAG,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAS,QAAS,2BAA4B,EAC9CC,EAAS,IAuBb,SAASC,EAASC,EAAGC,EAAWC,EAAU,CACzC,IAAIC,EAAIN,EAAQ,GAAOG,EAAE,MAAO,EAChC,OAAOF,EAAQE,EAAGG,EAAG,EAAG,EAAGF,EAAWC,CAAQ,CAC/C,CAKAN,EAAO,QAAUG,ICDjB,IAAIK,EAAc,QAAS,uDAAwD,EAC/EC,EAAO,IACPC,EAAS,IAKbF,EAAaC,EAAM,SAAUC,CAAO,EAKpC,OAAO,QAAUD",
+  "names": ["require_assign", "__commonJSMin", "exports", "module", "arraylike2object", "indexed", "x", "y", "stride", "offset", "predicate", "thisArg", "flg", "io", "i", "accessors", "xdata", "ydata", "xget", "yset", "assign", "xo", "yo", "require_main", "__commonJSMin", "exports", "module", "filled", "assign", "cuanyBy", "x", "predicate", "thisArg", "y", "setReadOnly", "main", "assign"]
+}

package/docs/types/index.d.ts

@@ -0,0 +1,202 @@
+/*
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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, TypedArray, BooleanArray } from '@stdlib/types/array';
+
+/**
+* Returns a boolean indicating whether an element passes a test.
+*
+* @returns boolean indicating whether an element passes a test
+*/
+type Nullary<U> = ( this: U ) => boolean;
+
+/**
+* Returns a boolean indicating whether an element passes a test.
+*
+* @param value - current array element
+* @returns boolean indicating whether an element passes a test
+*/
+type Unary<T, U> = ( this: U, value: T ) => boolean;
+
+/**
+* Returns a boolean indicating whether an element passes a test.
+*
+* @param value - current array element
+* @param index - current array element index
+* @returns boolean indicating whether an element passes a test
+*/
+type Binary<T, U> = ( this: U, value: T, index: number ) => boolean;
+
+/**
+* Returns a boolean indicating whether an element passes a test.
+*
+* @param value - current array element
+* @param index - current array element index
+* @param arr - input array
+* @returns boolean indicating whether an element passes a test
+*/
+type Ternary<T, U> = ( this: U, value: T, index: number, arr: Collection<T> | AccessorArrayLike<T> ) => boolean;
+
+/**
+* Returns a boolean indicating whether an element passes a test.
+*
+* @param value - current array element
+* @param index - current array element index
+* @param arr - input array
+* @returns boolean indicating whether an element passes a test
+*/
+type Predicate<T, U> = Nullary<U> | Unary<T, U> | Binary<T, U> | Ternary<T, U>;
+
+/**
+* Interface describing `cuanyBy`.
+*/
+interface CuAnyBy {
+	/**
+	* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function.
+	*
+	* @param x - input array
+	* @param predicate - predicate function
+	* @param thisArg - predicate function execution context
+	* @returns output array
+	*
+	* @example
+	* function isPositive( v ) {
+	*     return v > 0;
+	* }
+	*
+	* var x = [ 0, 0, 0, 1, 0 ];
+	*
+	* var y = cuanyBy( x, isPositive );
+	* // returns [ false, false, false, true, true ];
+	*/
+	<T = unknown, U = unknown>( x: Collection<T> | AccessorArrayLike<T>, predicate: Predicate<T, U>, thisArg?: ThisParameterType<Predicate<T, U>> ): Array<boolean>;
+
+	/**
+	* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function and assigns the results to a provided output array.
+	*
+	* @param x - input array
+	* @param y - output array
+	* @param stride - output array stride
+	* @param offset - output array offset
+	* @param predicate - predicate function
+	* @param thisArg - predicate function execution context
+	* @returns output array
+	*
+	* @example
+	* function isPositive( v ) {
+	*     return v > 0;
+	* }
+	*
+	* var x = [ 0, 0, 0, 1, 0 ];
+	* var y = [ false, null, false, null, false, null, true, null, true, null ];
+	*
+	* var arr = cuanyBy.assign( x, y, 2, 0, isPositive );
+	* // returns [ false, null, false, null, false, null, true, null, true, null ];
+	*/
+	assign<T = unknown, U = unknown, V = unknown>( x: Collection<T> | AccessorArrayLike<T>, out: Array<U>, stride: number, offset: number, predicate: Predicate<T, V>, thisArg?: ThisParameterType<Predicate<T, V>> ): Array<U | boolean>;
+
+	/**
+	* Cumulatively tests whether at least one array element in a provided array passes a test implemented by a predicate function and assigns the results to the provided output array.
+	*
+	* @param x - input array
+	* @param out - output array
+	* @param stride - output array stride
+	* @param offset - output array offset
+	* @param predicate - test function
+	* @param thisArg - execution context
+	* @returns output array
+	*
+	* @example
+	* var BooleanArray = require( '@stdlib/array-bool' );
+	*
+	* function isPositive( v ) {
+	*     return ( v > 0 );
+	* }
+	* var x = [ 0, 1, 0, 1, 0 ];
+	* var y = new BooleanArray( [ false, false, false, false, false, false, false, false, false, false ] );
+	*
+	* var arr = cuanyBy.assign( x, y, 2, 0, isPositive );
+	* // returns <BooleanArray>
+	*
+	* var v = arr.get( 4 );
+	* // returns true
+	*/
+	assign<T, U extends TypedArray | BooleanArray, V = unknown>( x: Collection<T> | AccessorArrayLike<T>, out: U, stride: number, offset: number, predicate: Predicate<T, V>, thisArg?: ThisParameterType<Predicate<T, V>> ): U;
+
+	/**
+	* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function and assigns the results to a provided output array.
+	*
+	* @param x - input array
+	* @param y - output array
+	* @param stride - output array stride
+	* @param offset - output array offset
+	* @param predicate - predicate function
+	* @param thisArg - predicate function execution context
+	* @returns output array
+	*
+	* @example
+	* function isPositive( v ) {
+	*     return v > 0;
+	* }
+	*
+	* var x = [ 0, 0, 0, 1, 0 ];
+	* var y = [ false, null, false, null, false, null, true, null, true, null ];
+	*
+	* var arr = cuanyBy.assign( x, y, 2, 0, isPositive );
+	* // returns [ false, null, false, null, false, null, true, null, true, null ];
+	*/
+	assign<T = unknown, U = unknown, V = unknown>( x: Collection<T> | AccessorArrayLike<T>, out: Collection<U> | AccessorArrayLike<U>, stride: number, offset: number, predicate: Predicate<T, V>, thisArg?: ThisParameterType<Predicate<T, V>> ): Collection<U | boolean> | AccessorArrayLike<U | boolean>;
+}
+
+/**
+* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function.
+*
+* @param x - input array
+* @returns output array
+*
+* @example
+* function isPositive( value ) {
+*	return ( value > 0 );
+* }
+*
+* var x = [ 0, 0, 0, 1, 0 ];
+*
+* var y = cuanyBy( x, isPositive );
+* // returns [ false, false, false, true, true ]
+*
+* @example
+* function isPositive( value ) {
+*	return ( value > 0 );
+* }
+*
+* var x = [ 0, 0, 0, 1, 0 ];
+* var y = [ false, null, false, null, false, null, false, null, false, null ];
+*
+* var arr = cuanyBy.assign( x, y, 2, 0, isPositive );
+* // returns [ false, null, false, null, false, null, true, null, true, null ]
+*/
+declare var cuanyBy: CuAnyBy;
+
+
+// EXPORTS //
+
+export = cuanyBy;

package/lib/assign.js

@@ -0,0 +1,180 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 arraylike2object = require( '@stdlib/array-base-arraylike2object' );
+
+
+// FUNCTIONS //
+
+/**
+* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function.
+*
+* @private
+* @param {Collection} x - input array
+* @param {Collection} y - output array
+* @param {integer} stride - output array stride
+* @param {NonNegativeInteger} offset - output array offset
+* @param {Function} predicate - test function
+* @param {*} thisArg - execution context
+* @returns {Collection} output array
+*
+* @example
+* function isPositive( v ) {
+*     return v > 0;
+* }
+*
+* var x = [ false, false, false, true, false  ];
+* var y = [ false, null, false, null, false, null, false, null, false, null ];
+*
+* var out = indexed( x, y, 2, 0, isPositive );
+* // returns [ false, null, false, null, false, null, true, null, true, null ]
+*/
+function indexed( x, y, stride, offset, predicate, thisArg ) {
+	var flg;
+	var io;
+	var i;
+
+	flg = false;
+	io = offset;
+	for ( i = 0; i < x.length; i++ ) {
+		if ( !flg && predicate.call(thisArg, x[ i ], i, x ) ) {
+			flg = true;
+		}
+		y[ io ] = flg;
+		io += stride;
+	}
+	return y;
+}
+
+/**
+* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function.
+*
+* @private
+* @param {Object} x - input array object
+* @param {Object} y - output array object
+* @param {integer} stride - output array stride
+* @param {NonNegativeInteger} offset - output array offset
+* @param {Function} predicate - test function
+* @param {*} thisArg - execution context
+* @returns {Collection} output array
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
+* var arraylike2object = require( '@stdlib/array-base-arraylike2object' );
+*
+* function isPositive( v ) {
+*     return v > 0;
+* }
+*
+* var x = toAccessorArray( [ false, false, false, true, false ] );
+* var y = toAccessorArray( [ false, null, false, null, false, null, false, null, false, null ] );
+*
+* var arr = accessors( arraylike2object( x ), arraylike2object( y ), 2, 0, isPositive );
+*
+* var v = y.get( 0 );
+* // returns false
+*
+* v = y.get( 2 );
+* // returns false
+*
+* v = y.get( 4 );
+* // returns false
+*
+* v = y.get( 6 );
+* // returns true
+*
+* v = y.get( 8 );
+* // returns true
+*/
+function accessors( x, y, stride, offset, predicate, thisArg ) {
+	var xdata;
+	var ydata;
+	var xget;
+	var yset;
+	var flg;
+	var io;
+	var i;
+
+	xdata = x.data;
+	ydata = y.data;
+
+	xget = x.accessors[ 0 ];
+	yset = y.accessors[ 1 ];
+
+	flg = false;
+	io = offset;
+	for ( i = 0; i < xdata.length; i++ ) {
+		if ( !flg && predicate.call( thisArg, xget( xdata, i ), i, x ) ) {
+			flg = true;
+		}
+		yset( ydata, io, flg );
+		io += stride;
+	}
+	return ydata;
+}
+
+
+// MAIN //
+
+/**
+* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function and assigns results to a provided output array.
+*
+* @param {Collection} x - input array
+* @param {Collection} y - output array
+* @param {integer} stride - output array stride
+* @param {NonNegativeInteger} offset - output array offset
+* @param {Function} predicate - test function
+* @param {*} [thisArg] - execution context
+* @returns {Collection} output array
+*
+* @example
+* function isPositive( v ) {
+*     return v > 0;
+* }
+*
+* var x = [ 0, 0, 0, 1, 0 ];
+* var y = [ false, null, false, null, false, null, false, null, false, null ];
+*
+* var out = assign( x, y, 2, 0, isPositive );
+// returns [ false, null, false, null, false, null, true, null, true, null ]
+*
+* var bool = ( y === out );
+* // returns true
+*/
+function assign( x, y, stride, offset, predicate, thisArg ) {
+	var xo = arraylike2object( x );
+	var yo = arraylike2object( y );
+
+	if (
+		xo.accessorProtocol ||
+		yo.accessorProtocol
+	) {
+		return accessors( xo, yo, stride, offset, predicate, thisArg );
+	}
+	indexed( x, y, stride, offset, predicate, thisArg );
+	return y;
+}
+
+
+// EXPORTS //
+
+module.exports = assign;

package/lib/index.js

@@ -0,0 +1,66 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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';
+
+/**
+* Cumulatively test whether at least one element in a provided array passes a test implemented by a predicate function.
+*
+* @module @stdlib/array-base-cuany-by
+*
+* @example
+* var cuanyBy = require( '@stdlib/array-base-cuany-by' );
+*
+* function isPositive( v ) {
+*     return v > 0;
+* }
+*
+* var x = [ 0, 0, 0, 1, 0 ];
+*
+* var y = cuanyBy( x, isPositive );
+* // returns [ false, false, false, true, true ]
+*
+* @example
+* var cuanyBy = require( '@stdlib/array-base-cuany-by' );
+*
+* function isPositive( v ) {
+*     return v > 0;
+* }
+*
+* var x = [ 0, 0, 0, 1, 0 ];
+* var y = [ false, null, false, null, false, null, false, null, false, null ];
+*
+* var arr = cuanyBy.assign( x, y, 2, 0, isPositive );
+* // returns [ false, null, false, null, false, null, true, null, true, null ]
+*/
+
+// MODULES //
+
+var setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );
+var main = require( './main.js' );
+var assign = require( './assign.js' );
+
+
+// MAIN //
+
+setReadOnly( main, 'assign', assign );
+
+
+// EXPORTS //
+
+module.exports = main;

package/lib/main.js

@@ -0,0 +1,55 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 filled = require( '@stdlib/array-base-filled' );
+var assign = require( './assign.js' );
+
+
+// MAIN //
+
+/**
+* Cumulatively tests whether at least one element in a provided array passes a test implemented by a predicate function.
+*
+* @param {Collection} x - input array
+* @param {Function} predicate - test function
+* @param {*} [thisArg] - execution context
+* @returns {Array} output array
+*
+* @example
+* function isPositive( v ) {
+*     return v > 0;
+* }
+*
+* var x = [ 0, 0, 0, 1, 0 ];
+*
+* var y = cuanyBy( x, isPositive );
+* // returns [ false, false, false, true, true ]
+*/
+function cuanyBy( x, predicate, thisArg ) {
+	var y = filled( false, x.length );
+	return assign( x, y, 1, 0, predicate, thisArg );
+}
+
+
+// EXPORTS //
+
+module.exports = cuanyBy;

package/package.json

@@ -0,0 +1,73 @@
+{
+  "name": "@stdlib/array-base-cuany-by",
+  "version": "0.1.0",
+  "description": "Cumulatively test whether at least one element in a provided array passes a test implemented by a predicate function.",
+  "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-cuany-by.git"
+  },
+  "bugs": {
+    "url": "https://github.com/stdlib-js/stdlib/issues"
+  },
+  "dependencies": {
+    "@stdlib/array-base-arraylike2object": "^0.2.1",
+    "@stdlib/array-base-filled": "^0.2.2",
+    "@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",
+    "stdtypes",
+    "types",
+    "data",
+    "structure",
+    "utils",
+    "generic",
+    "array",
+    "cuany",
+    "cumulative",
+    "test",
+    "some",
+    "array.some",
+    "validate"
+  ],
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
+  }
+}