@stdlib/array-base-count-ifs 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,248 @@
+<!--
+
+@license Apache-2.0
+
+Copyright (c) 2025 The Stdlib Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+
+-->
+
+
+<details>
+  <summary>
+    About stdlib...
+  </summary>
+  <p>We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.</p>
+  <p>The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.</p>
+  <p>When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.</p>
+  <p>To join us in bringing numerical computing to the web, get started by checking us out on <a href="https://github.com/stdlib-js/stdlib">GitHub</a>, and please consider <a href="https://opencollective.com/stdlib">financially supporting stdlib</a>. We greatly appreciate your continued support!</p>
+</details>
+
+# countIfs
+
+[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
+
+> Perform element-wise evaluation of one or more input arrays according to provided predicate functions and count the number of elements for which all predicates respectively return `true`.
+
+<!-- Section to include introductory text. Make sure to keep an empty line after the intro `section` element and another before the `/section` close. -->
+
+<section class="intro">
+
+</section>
+
+<!-- /.intro -->
+
+<!-- Package usage documentation. -->
+
+<section class="installation">
+
+## Installation
+
+```bash
+npm install @stdlib/array-base-count-ifs
+```
+
+</section>
+
+<section class="usage">
+
+## Usage
+
+```javascript
+var countIfs = require( '@stdlib/array-base-count-ifs' );
+```
+
+#### countIfs( x0, predicate0\[, x1, predicate1\[, x2, predicate2\[, ...args]]] )
+
+Performs element-wise evaluation of one or more input arrays according to provided predicate functions and counts the number of elements for which all predicates respectively return `true`.
+
+```javascript
+function predicate0( value ) {
+    return ( value > 0 );
+}
+
+function predicate1( value ) {
+    return ( value < 3 );
+}
+
+var x0 = [ 0, 1, 0, 1, 2 ];
+var x1 = [ 2, 3, 1, 2, 5 ];
+
+var out = countIfs( x0, predicate0, x1, predicate1 );
+// returns 1
+```
+
+The function has the following parameters:
+
+-   **x0**: first input array.
+-   **predicate0**: first predicate function.
+-   **x1**: second input array (_optional_).
+-   **predicate1**: second predicate function (_optional_).
+-   **x2**: third input array (_optional_).
+-   **predicate2**: third predicate function (_optional_).
+-   **args**: additional input arrays and corresponding predicate functions (_optional_).
+
+Each predicate function is provided three arguments:
+
+-   **value**: current array element.
+-   **index**: current array element index.
+-   **arr**: the corresponding input array.
+
+</section>
+
+<!-- /.usage -->
+
+<!-- Package usage notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="notes">
+
+## Notes
+
+-   The function assumes that all input arrays have the same length.
+-   The function supports array-like objects supporting the accessor protocol (e.g., [`Complex128Array`][@stdlib/array/complex128], [`Complex64Array`][@stdlib/array/complex64], etc).
+
+</section>
+
+<!-- /.notes -->
+
+<!-- Package usage examples. -->
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+<!-- eslint-disable max-len -->
+
+```javascript
+var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
+var isPositiveInteger = require( '@stdlib/assert-is-positive-integer' ).isPrimitive;
+var isNegativeInteger = require( '@stdlib/assert-is-negative-integer' ).isPrimitive;
+var naryFunction = require( '@stdlib/utils-nary-function' );
+var countIfs = require( '@stdlib/array-base-count-ifs' );
+
+var x = discreteUniform( 10, -5, 5, {
+    'dtype': 'int32'
+});
+console.log( x );
+
+var y = discreteUniform( 10, -5, 5, {
+    'dtype': 'int32'
+});
+console.log( y );
+
+var out = countIfs( x, naryFunction( isPositiveInteger, 1 ), y, naryFunction( isNegativeInteger, 1 ) );
+console.log( out );
+```
+
+</section>
+
+<!-- /.examples -->
+
+<!-- Section to include cited references. If references are included, add a horizontal rule *before* the section. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="references">
+
+</section>
+
+<!-- /.references -->
+
+<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
+
+<section class="related">
+
+</section>
+
+<!-- /.related -->
+
+<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+
+<section class="main-repo" >
+
+* * *
+
+## Notice
+
+This package is part of [stdlib][stdlib], a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.
+
+For more information on the project, filing bug reports and feature requests, and guidance on how to develop [stdlib][stdlib], see the main project [repository][stdlib].
+
+#### Community
+
+[![Chat][chat-image]][chat-url]
+
+---
+
+## License
+
+See [LICENSE][stdlib-license].
+
+
+## Copyright
+
+Copyright &copy; 2016-2026. The Stdlib [Authors][stdlib-authors].
+
+</section>
+
+<!-- /.stdlib -->
+
+<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="links">
+
+[npm-image]: http://img.shields.io/npm/v/@stdlib/array-base-count-ifs.svg
+[npm-url]: https://npmjs.org/package/@stdlib/array-base-count-ifs
+
+[test-image]: https://github.com/stdlib-js/array-base-count-ifs/actions/workflows/test.yml/badge.svg?branch=v0.1.0
+[test-url]: https://github.com/stdlib-js/array-base-count-ifs/actions/workflows/test.yml?query=branch:v0.1.0
+
+[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/array-base-count-ifs/main.svg
+[coverage-url]: https://codecov.io/github/stdlib-js/array-base-count-ifs?branch=main
+
+<!--
+
+[dependencies-image]: https://img.shields.io/david/stdlib-js/array-base-count-ifs.svg
+[dependencies-url]: https://david-dm.org/stdlib-js/array-base-count-ifs/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-count-ifs/tree/deno
+[deno-readme]: https://github.com/stdlib-js/array-base-count-ifs/blob/deno/README.md
+[umd-url]: https://github.com/stdlib-js/array-base-count-ifs/tree/umd
+[umd-readme]: https://github.com/stdlib-js/array-base-count-ifs/blob/umd/README.md
+[esm-url]: https://github.com/stdlib-js/array-base-count-ifs/tree/esm
+[esm-readme]: https://github.com/stdlib-js/array-base-count-ifs/blob/esm/README.md
+[branches-url]: https://github.com/stdlib-js/array-base-count-ifs/blob/main/branches.md
+
+[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/array-base-count-ifs/main/LICENSE
+
+[@stdlib/array/complex128]: https://www.npmjs.com/package/@stdlib/array-complex128
+
+[@stdlib/array/complex64]: https://www.npmjs.com/package/@stdlib/array-complex64
+
+</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 countIfs from '../docs/types/index';
+export = countIfs;

package/dist/index.js

@@ -0,0 +1,5 @@
+"use strict";var g=function(t,r){return function(){return r||t((r={exports:{}}).exports,r),r.exports}};var c=g(function(k,v){
+var f=require('@stdlib/array-base-arraylike2object/dist'),l=require('@stdlib/array-base-zero-to/dist');function i(t,r,s){var a,n,e,o,u;for(a=t.data,n=t.accessors[0],u=0,e=0;e<r.length;e++)o=r[e],s(n(a,o),o,a)&&(r[u]=o,u+=1);return r.length=u,r}function h(t,r,s){var a,n,e;for(e=0,a=0;a<r.length;a++)n=r[a],s(t[n],n,t)&&(r[e]=n,e+=1);return r.length=e,r}function m(){var t,r,s,a,n,e;for(r=[],t=[],e=0;e<arguments.length;e+=2)r.push(f(arguments[e])),t.push(arguments[e+1]);for(s=arguments[0].length,a=l(s),e=0;e<r.length;e++)n=r[e],n.accessorProtocol?a=i(n,a,t[e]):a=h(n.data,a,t[e]);return a.length}v.exports=m
+});var p=c();module.exports=p;
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/main.js", "../lib/index.js"],
+  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( '@stdlib/array-base-arraylike2object' );\nvar zeroTo = require( '@stdlib/array-base-zero-to' );\n\n\n// FUNCTIONS //\n\n/**\n* Returns an array of indices corresponding to the elements of an input array which pass a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Array<number>} idx - list of indices\n* @param {Function} predicate - predicate function\n* @returns {Array<number>} updated list of indices\n*\n* @example\n* var arraylike2object = require( '@stdlib/array-base-arraylike2object' );\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var zeroTo = require( '@stdlib/array-base-zero-to' );\n*\n* function predicate( v ) {\n*     return ( v > 0 );\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ -1, 2, 3, -4, 5 ] ) );\n* var idx = zeroTo( 5 );\n*\n* var out = accessors( x, idx, predicate );\n* // returns [ 1, 2, 4 ]\n*/\nfunction accessors( x, idx, predicate ) {\n\tvar buf;\n\tvar get;\n\tvar i;\n\tvar j;\n\tvar k;\n\n\tbuf = x.data;\n\tget = x.accessors[ 0 ];\n\n\tk = 0;\n\tfor ( i = 0; i < idx.length; i++ ) {\n\t\tj = idx[ i ];\n\t\tif ( predicate( get( buf, j ), j, buf ) ) {\n\t\t\tidx[ k ] = j;\n\t\t\tk += 1;\n\t\t}\n\t}\n\tidx.length = k;\n\treturn idx;\n}\n\n/**\n* Returns an array of indices corresponding to the elements of an input array which pass a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Array<number>} idx - list of indices\n* @param {Function} predicate - predicate function\n* @returns {Array<number>} updated list of indices\n*\n* @example\n* var zeroTo = require( '@stdlib/array-base-zero-to' );\n*\n* function predicate( v ) {\n*     return ( v > 0 );\n* }\n*\n* var x = [ -1, 2, 3, -4, 5 ];\n* var idx = zeroTo( 5 );\n*\n* var out = indexed( x, idx, predicate );\n* // returns [ 1, 2, 4 ]\n*/\nfunction indexed( x, idx, predicate ) {\n\tvar i;\n\tvar j;\n\tvar k;\n\n\tk = 0;\n\tfor ( i = 0; i < idx.length; i++ ) {\n\t\tj = idx[ i ];\n\t\tif ( predicate( x[ j ], j, x ) ) {\n\t\t\tidx[ k ] = j;\n\t\t\tk += 1;\n\t\t}\n\t}\n\tidx.length = k;\n\treturn idx;\n}\n\n\n// MAIN //\n\n/**\n* Performs element-wise evaluation of one or more input arrays according to provided predicate functions and counts the number of elements for which all predicates respectively return `true`.\n*\n* @param {Collection} x0 - first input array\n* @param {Function} predicate0 - first predicate function\n* @param {Collection} [x1] - second input array\n* @param {Function} [predicate1] - second predicate function\n* @param {Collection} [x2] - third input array\n* @param {Function} [predicate2] - third predicate function\n* @param {...(Collection|Function)} [args] - additional input arrays and predicate functions\n* @returns {NonNegativeInteger} result\n*\n* @example\n* function predicate0( value ) {\n*     return ( value > 0 );\n* }\n*\n* function predicate1( value ) {\n*     return ( value < 3 );\n* }\n*\n* var x0 = [ 0, 1, 0, 1, 2 ];\n* var x1 = [ 2, 3, 1, 2, 5 ];\n*\n* var n = countIfs( x0, predicate0, x1, predicate1 );\n* // returns 1\n*/\nfunction countIfs() {\n\tvar predicates;\n\tvar arrays;\n\tvar len;\n\tvar idx;\n\tvar x;\n\tvar i;\n\n\tarrays = [];\n\tpredicates = [];\n\tfor ( i = 0; i < arguments.length; i += 2 ) {\n\t\tarrays.push( arraylike2object( arguments[ i ] ) );\n\t\tpredicates.push( arguments[ i+1 ] );\n\t}\n\n\tlen = arguments[ 0 ].length;\n\tidx = zeroTo( len );\n\tfor ( i = 0; i < arrays.length; i++ ) {\n\t\tx = arrays[ i ];\n\t\tif ( x.accessorProtocol ) {\n\t\t\tidx = accessors( x, idx, predicates[ i ] );\n\t\t} else {\n\t\t\tidx = indexed( x.data, idx, predicates[ i ] );\n\t\t}\n\t}\n\treturn idx.length;\n}\n\n\n// EXPORTS //\n\nmodule.exports = countIfs;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Perform element-wise evaluation of one or more input arrays according to provided predicate functions and count the number of elements for which all predicates respectively return `true`.\n*\n* @module @stdlib/array-base-count-ifs\n*\n* @example\n* var countIfs = require( '@stdlib/array-base-count-ifs' );\n*\n* function predicate0( value ) {\n*     return ( value > 0 );\n* }\n*\n* function predicate1( value ) {\n*     return ( value < 3 );\n* }\n*\n* var x0 = [ 0, 1, 0, 1, 2 ];\n* var x1 = [ 2, 3, 1, 2, 5 ];\n*\n* var n = countIfs( x0, predicate0, x1, predicate1 );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAmB,QAAS,qCAAsC,EAClEC,EAAS,QAAS,4BAA6B,EA6BnD,SAASC,EAAWC,EAAGC,EAAKC,EAAY,CACvC,IAAIC,EACAC,EACAC,EACAC,EACAC,EAMJ,IAJAJ,EAAMH,EAAE,KACRI,EAAMJ,EAAE,UAAW,CAAE,EAErBO,EAAI,EACEF,EAAI,EAAGA,EAAIJ,EAAI,OAAQI,IAC5BC,EAAIL,EAAKI,CAAE,EACNH,EAAWE,EAAKD,EAAKG,CAAE,EAAGA,EAAGH,CAAI,IACrCF,EAAKM,CAAE,EAAID,EACXC,GAAK,GAGP,OAAAN,EAAI,OAASM,EACNN,CACR,CAwBA,SAASO,EAASR,EAAGC,EAAKC,EAAY,CACrC,IAAIG,EACAC,EACAC,EAGJ,IADAA,EAAI,EACEF,EAAI,EAAGA,EAAIJ,EAAI,OAAQI,IAC5BC,EAAIL,EAAKI,CAAE,EACNH,EAAWF,EAAGM,CAAE,EAAGA,EAAGN,CAAE,IAC5BC,EAAKM,CAAE,EAAID,EACXC,GAAK,GAGP,OAAAN,EAAI,OAASM,EACNN,CACR,CAgCA,SAASQ,GAAW,CACnB,IAAIC,EACAC,EACAC,EACAX,EACAD,EACAK,EAIJ,IAFAM,EAAS,CAAC,EACVD,EAAa,CAAC,EACRL,EAAI,EAAGA,EAAI,UAAU,OAAQA,GAAK,EACvCM,EAAO,KAAMd,EAAkB,UAAWQ,CAAE,CAAE,CAAE,EAChDK,EAAW,KAAM,UAAWL,EAAE,CAAE,CAAE,EAKnC,IAFAO,EAAM,UAAW,CAAE,EAAE,OACrBX,EAAMH,EAAQc,CAAI,EACZP,EAAI,EAAGA,EAAIM,EAAO,OAAQN,IAC/BL,EAAIW,EAAQN,CAAE,EACTL,EAAE,iBACNC,EAAMF,EAAWC,EAAGC,EAAKS,EAAYL,CAAE,CAAE,EAEzCJ,EAAMO,EAASR,EAAE,KAAMC,EAAKS,EAAYL,CAAE,CAAE,EAG9C,OAAOJ,EAAI,MACZ,CAKAL,EAAO,QAAUa,ICjIjB,IAAII,EAAO,IAKX,OAAO,QAAUA",
+  "names": ["require_main", "__commonJSMin", "exports", "module", "arraylike2object", "zeroTo", "accessors", "x", "idx", "predicate", "buf", "get", "i", "j", "k", "indexed", "countIfs", "predicates", "arrays", "len", "main"]
+}

package/docs/types/index.d.ts

@@ -0,0 +1,243 @@
+/*
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+// TypeScript Version: 4.1
+
+/// <reference types="@stdlib/types"/>
+
+import { Collection, AccessorArrayLike } from '@stdlib/types/array';
+
+/**
+* Input array.
+*/
+type InputArray<T> = Collection<T> | AccessorArrayLike<T>;
+
+/**
+* Returns a boolean indicating whether an element passes a test.
+*
+* @returns boolean indicating whether an element passes a test
+*/
+type Nullary = () => 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> = ( 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> = ( 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> = ( value: T, index: number, arr: U ) => 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 | Unary<U> | Binary<U> | Ternary<T, U>;
+
+/**
+* Performs element-wise evaluation of one or more input arrays according to provided predicate functions and counts the number of elements for which all predicates respectively return `true`.
+*
+* @param x0 - input array
+* @param predicate0 - predicate function
+* @returns result
+*
+* @example
+* function predicate0( v ) {
+*     return v > 0;
+* }
+*
+* var x0 = [ 0, 1, 0, 1, 1 ];
+*
+* var n = countIfs( x0, predicate0 );
+* // returns 3
+*/
+declare function countIfs<T = unknown, U extends InputArray<T> = InputArray<T>>( x0: U, predicate0: Predicate<T, U> ): number;
+
+/**
+* Performs element-wise evaluation of one or more input arrays according to provided predicate functions and counts the number of elements for which all predicates respectively return `true`.
+*
+* @param x0 - first input array
+* @param predicate0 - first predicate function
+* @param x1 - second input array
+* @param predicate1 - second predicate function
+* @returns result
+*
+* @example
+* function predicate0( v ) {
+*     return v > 0;
+* }
+*
+* function predicate1( v ) {
+*     return v < 0;
+* }
+*
+* var x0 = [ 0, 1, 0, 1, 1 ];
+* var x1 = [ -1, 2, 4, -5, -8 ];
+*
+* var n = countIfs( x0, predicate0, x1, predicate1 );
+* // returns 2
+*/
+declare function countIfs<T = unknown, U extends InputArray<T> = InputArray<T>>( x0: U, predicate0: Predicate<T, U>, x1: U, predicate1: Predicate<T, U> ): number;
+
+/**
+* Performs element-wise evaluation of one or more input arrays according to provided predicate functions and counts the number of elements for which all predicates respectively return `true`.
+*
+* @param x0 - first input array
+* @param predicate0 - first predicate function
+* @param x1 - second input array
+* @param predicate1 - second predicate function
+* @param x2 - third input array
+* @param predicate2 - third predicate function
+* @returns result
+*
+* @example
+* function predicate0( v ) {
+*     return v > 0;
+* }
+*
+* function predicate1( v ) {
+*     return v < 0;
+* }
+*
+* function predicate2( v ) {
+*     return v % 2 === 0;
+* }
+*
+* var x0 = [ 0, 1, 0, 1, 1 ];
+* var x1 = [ -1, -2, 4, 5, -8 ];
+* var x2 = [ 0, 4, 3, 2, 12 ];
+*
+* var n = countIfs( x0, predicate0, x1, predicate1, x2, predicate2 );
+* // returns 2
+*/
+declare function countIfs<T = unknown, U extends InputArray<T> = InputArray<T>>( x0: U, predicate0: Predicate<T, U>, x1: U, predicate1: Predicate<T, U>, x2: U, predicate2: Predicate<T, U> ): number;
+
+/**
+* Performs element-wise evaluation of one or more input arrays according to provided predicate functions and counts the number of elements for which all predicates respectively return `true`.
+*
+* @param x0 - first input array
+* @param predicate0 - first predicate function
+* @param x1 - second input array
+* @param predicate1 - second predicate function
+* @param x2 - third input array
+* @param predicate2 - third predicate function
+* @param x3 - fourth input array
+* @param predicate3 - fourth predicate function
+* @returns result
+*
+* @example
+* function predicate0( v ) {
+*     return v > 0;
+* }
+*
+* function predicate1( v ) {
+*     return v < 0;
+* }
+*
+* function predicate2( v ) {
+*     return v % 2 === 0;
+* }
+*
+* function predicate3( v ) {
+*     return v % 2 !== 0;
+* }
+*
+* var x0 = [ 0, 1, 0, 1, 1 ];
+* var x1 = [ -1, -2, 4, 5, -8 ];
+* var x2 = [ 0, 4, 3, 2, 12 ];
+* var x3 = [ 2, 9, 3, 6, 5 ];
+*
+* var n = countIfs( x0, predicate0, x1, predicate1, x3, predicate3 );
+* // returns 2
+*/
+declare function countIfs<T = unknown, U extends InputArray<T> = InputArray<T>>( x0: U, predicate0: Predicate<T, U>, x1: U, predicate1: Predicate<T, U>, x2: U, predicate2: Predicate<T, U>, x3: U, predicate3: Predicate<T, U> ): number;
+
+/**
+* Performs element-wise evaluation of one or more input arrays according to provided predicate functions and counts the number of elements for which all predicates respectively return `true`.
+*
+* @param x0 - first input array
+* @param predicate0 - first predicate function
+* @param x1 - second input array
+* @param predicate1 - second predicate function
+* @param x2 - third input array
+* @param predicate2 - third predicate function
+* @param x3 - fourth input array
+* @param predicate3 - fourth predicate function
+* @param x4 - fifth input array
+* @param predicate4 - fifth predicate function
+* @param args - additional input arrays and predicate functions
+* @returns result
+*
+* @example
+* function predicate0( v ) {
+*     return v > 0;
+* }
+*
+* function predicate1( v ) {
+*     return v < 0;
+* }
+*
+* function predicate2( v ) {
+*     return v % 2 === 0;
+* }
+*
+* function predicate3( v ) {
+*     return v % 2 !== 0;
+* }
+*
+* function predicate4( v ) {
+*     return v === true;
+* }
+*
+* var x0 = [ 0, 1, 0, 1, 1 ];
+* var x1 = [ -1, -2, 4, 5, -8 ];
+* var x2 = [ 0, 4, 3, 2, 12 ];
+* var x3 = [ 2, 9, 3, 6, 5 ];
+* var x4 = [ false, true, false, true, true ];
+*
+* var n = countIfs( x0, predicate0, x1, predicate1, x3, predicate3, x4, predicate4 );
+* // returns 2
+*/
+declare function countIfs<T = unknown, U extends InputArray<T> = InputArray<T>>( x0: U, predicate0: Predicate<T, U>, x1: U, predicate1: Predicate<T, U>, x2: U, predicate2: Predicate<T, U>, x3: U, predicate3: Predicate<T, U>, x4: U, predicate4: Predicate<T, U>, ...args: Array<U | Predicate<T, U>> ): number;
+
+
+// EXPORTS //
+
+export = countIfs;

package/lib/index.js

@@ -0,0 +1,51 @@
+/**
+* @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';
+
+/**
+* Perform element-wise evaluation of one or more input arrays according to provided predicate functions and count the number of elements for which all predicates respectively return `true`.
+*
+* @module @stdlib/array-base-count-ifs
+*
+* @example
+* var countIfs = require( '@stdlib/array-base-count-ifs' );
+*
+* function predicate0( value ) {
+*     return ( value > 0 );
+* }
+*
+* function predicate1( value ) {
+*     return ( value < 3 );
+* }
+*
+* var x0 = [ 0, 1, 0, 1, 2 ];
+* var x1 = [ 2, 3, 1, 2, 5 ];
+*
+* var n = countIfs( x0, predicate0, x1, predicate1 );
+* // returns 1
+*/
+
+// MODULES //
+
+var main = require( './main.js' );
+
+
+// EXPORTS //
+
+module.exports = main;

package/lib/main.js

@@ -0,0 +1,175 @@
+/**
+* @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 arraylike2object = require( '@stdlib/array-base-arraylike2object' );
+var zeroTo = require( '@stdlib/array-base-zero-to' );
+
+
+// FUNCTIONS //
+
+/**
+* Returns an array of indices corresponding to the elements of an input array which pass a test implemented by a predicate function.
+*
+* @private
+* @param {Collection} x - input array
+* @param {Array<number>} idx - list of indices
+* @param {Function} predicate - predicate function
+* @returns {Array<number>} updated list of indices
+*
+* @example
+* var arraylike2object = require( '@stdlib/array-base-arraylike2object' );
+* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
+* var zeroTo = require( '@stdlib/array-base-zero-to' );
+*
+* function predicate( v ) {
+*     return ( v > 0 );
+* }
+*
+* var x = arraylike2object( toAccessorArray( [ -1, 2, 3, -4, 5 ] ) );
+* var idx = zeroTo( 5 );
+*
+* var out = accessors( x, idx, predicate );
+* // returns [ 1, 2, 4 ]
+*/
+function accessors( x, idx, predicate ) {
+	var buf;
+	var get;
+	var i;
+	var j;
+	var k;
+
+	buf = x.data;
+	get = x.accessors[ 0 ];
+
+	k = 0;
+	for ( i = 0; i < idx.length; i++ ) {
+		j = idx[ i ];
+		if ( predicate( get( buf, j ), j, buf ) ) {
+			idx[ k ] = j;
+			k += 1;
+		}
+	}
+	idx.length = k;
+	return idx;
+}
+
+/**
+* Returns an array of indices corresponding to the elements of an input array which pass a test implemented by a predicate function.
+*
+* @private
+* @param {Collection} x - input array
+* @param {Array<number>} idx - list of indices
+* @param {Function} predicate - predicate function
+* @returns {Array<number>} updated list of indices
+*
+* @example
+* var zeroTo = require( '@stdlib/array-base-zero-to' );
+*
+* function predicate( v ) {
+*     return ( v > 0 );
+* }
+*
+* var x = [ -1, 2, 3, -4, 5 ];
+* var idx = zeroTo( 5 );
+*
+* var out = indexed( x, idx, predicate );
+* // returns [ 1, 2, 4 ]
+*/
+function indexed( x, idx, predicate ) {
+	var i;
+	var j;
+	var k;
+
+	k = 0;
+	for ( i = 0; i < idx.length; i++ ) {
+		j = idx[ i ];
+		if ( predicate( x[ j ], j, x ) ) {
+			idx[ k ] = j;
+			k += 1;
+		}
+	}
+	idx.length = k;
+	return idx;
+}
+
+
+// MAIN //
+
+/**
+* Performs element-wise evaluation of one or more input arrays according to provided predicate functions and counts the number of elements for which all predicates respectively return `true`.
+*
+* @param {Collection} x0 - first input array
+* @param {Function} predicate0 - first predicate function
+* @param {Collection} [x1] - second input array
+* @param {Function} [predicate1] - second predicate function
+* @param {Collection} [x2] - third input array
+* @param {Function} [predicate2] - third predicate function
+* @param {...(Collection|Function)} [args] - additional input arrays and predicate functions
+* @returns {NonNegativeInteger} result
+*
+* @example
+* function predicate0( value ) {
+*     return ( value > 0 );
+* }
+*
+* function predicate1( value ) {
+*     return ( value < 3 );
+* }
+*
+* var x0 = [ 0, 1, 0, 1, 2 ];
+* var x1 = [ 2, 3, 1, 2, 5 ];
+*
+* var n = countIfs( x0, predicate0, x1, predicate1 );
+* // returns 1
+*/
+function countIfs() {
+	var predicates;
+	var arrays;
+	var len;
+	var idx;
+	var x;
+	var i;
+
+	arrays = [];
+	predicates = [];
+	for ( i = 0; i < arguments.length; i += 2 ) {
+		arrays.push( arraylike2object( arguments[ i ] ) );
+		predicates.push( arguments[ i+1 ] );
+	}
+
+	len = arguments[ 0 ].length;
+	idx = zeroTo( len );
+	for ( i = 0; i < arrays.length; i++ ) {
+		x = arrays[ i ];
+		if ( x.accessorProtocol ) {
+			idx = accessors( x, idx, predicates[ i ] );
+		} else {
+			idx = indexed( x.data, idx, predicates[ i ] );
+		}
+	}
+	return idx.length;
+}
+
+
+// EXPORTS //
+
+module.exports = countIfs;

package/package.json

@@ -0,0 +1,68 @@
+{
+  "name": "@stdlib/array-base-count-ifs",
+  "version": "0.1.0",
+  "description": "Perform element-wise evaluation of one or more input arrays according to provided predicate functions and count the number of elements for which all predicates respectively return `true`.",
+  "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-count-ifs.git"
+  },
+  "bugs": {
+    "url": "https://github.com/stdlib-js/stdlib/issues"
+  },
+  "dependencies": {
+    "@stdlib/array-base-arraylike2object": "^0.2.1",
+    "@stdlib/array-base-zero-to": "^0.2.1"
+  },
+  "devDependencies": {},
+  "engines": {
+    "node": ">=0.10.0",
+    "npm": ">2.7.0"
+  },
+  "os": [
+    "aix",
+    "darwin",
+    "freebsd",
+    "linux",
+    "macos",
+    "openbsd",
+    "sunos",
+    "win32",
+    "windows"
+  ],
+  "keywords": [
+    "stdlib",
+    "array",
+    "count",
+    "sum",
+    "summation",
+    "countif",
+    "countifs",
+    "range",
+    "total",
+    "truthy"
+  ],
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
+  }
+}