From 61c8736e6740aef4e7547ba4ac9df64bac396282 Mon Sep 17 00:00:00 2001 From: stdlib-bot <82920195+stdlib-bot@users.noreply.github.com> Date: Sat, 2 Mar 2024 21:15:26 +0000 Subject: [PATCH] Update artifacts --- array/base/count-if/coverage.ndjson | 1 + array/base/count-if/index.html | 131 +++++++ array/base/count-if/index.js.html | 223 +++++++++++ array/base/count-if/main.js.html | 574 ++++++++++++++++++++++++++++ 4 files changed, 929 insertions(+) create mode 100644 array/base/count-if/coverage.ndjson create mode 100644 array/base/count-if/index.html create mode 100644 array/base/count-if/index.js.html create mode 100644 array/base/count-if/main.js.html diff --git a/array/base/count-if/coverage.ndjson b/array/base/count-if/coverage.ndjson new file mode 100644 index 000000000..a092ab091 --- /dev/null +++ b/array/base/count-if/coverage.ndjson @@ -0,0 +1 @@ +[209,209,100,16,16,100,4,4,100,209,209,100,"ecd3518101b9c013ff9279b7f56e64015606907d","2024-03-02 16:13:49 -0500"] diff --git a/array/base/count-if/index.html b/array/base/count-if/index.html new file mode 100644 index 000000000..fe362ec74 --- /dev/null +++ b/array/base/count-if/index.html @@ -0,0 +1,131 @@ + + + + +
++ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ ++ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 +37 +38 +39 +40 +41 +42 +43 +44 +45 +46 +47 | 1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x + | /** +* @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'; + +/** +* Count the number of elements in an array that satisfy the provided testing function. +* +* @module @stdlib/array/base/count-if +* +* @example +* var countIf = require( '@stdlib/array/base/count-if' ); +* +* var x = [ 0, 1, 0, 1, 2 ]; +* +* function predicate( value ) { +* return ( value % 2 === 0 ) +* } +* +* var n = countIf( x, predicate ); +* // returns 3 +*/ + +// MODULES // + +var main = require( './main.js' ); + + +// EXPORTS // + +module.exports = main; + |
+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 +37 +38 +39 +40 +41 +42 +43 +44 +45 +46 +47 +48 +49 +50 +51 +52 +53 +54 +55 +56 +57 +58 +59 +60 +61 +62 +63 +64 +65 +66 +67 +68 +69 +70 +71 +72 +73 +74 +75 +76 +77 +78 +79 +80 +81 +82 +83 +84 +85 +86 +87 +88 +89 +90 +91 +92 +93 +94 +95 +96 +97 +98 +99 +100 +101 +102 +103 +104 +105 +106 +107 +108 +109 +110 +111 +112 +113 +114 +115 +116 +117 +118 +119 +120 +121 +122 +123 +124 +125 +126 +127 +128 +129 +130 +131 +132 +133 +134 +135 +136 +137 +138 +139 +140 +141 +142 +143 +144 +145 +146 +147 +148 +149 +150 +151 +152 +153 +154 +155 +156 +157 +158 +159 +160 +161 +162 +163 +164 | 1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +9x +9x +9x +9x +9x +9x +31x +12x +12x +31x +9x +9x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +2x +2x +2x +2x +2x +2x +2x +2x +2x +5x +2x +2x +5x +2x +2x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +2x +2x +2x +2x +2x +2x +2x +2x +2x +4x +3x +3x +4x +2x +2x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +13x +13x +4x +2x +2x +2x +2x +9x +13x +1x +1x +1x +1x +1x + | /** +* @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 isComplexTypedArray = require( '@stdlib/array/base/assert/is-complex-typed-array' ); +var isAccessorArray = require( '@stdlib/array/base/assert/is-accessor-array' ); +var resolveGetter = require( '@stdlib/array/base/resolve-getter' ); +var reinterpret = require( '@stdlib/strided/base/reinterpret-complex' ); + + +// FUNCTIONS // + +/** +* Counts the number of elements in an indexed array that satisfy the provided testing function. +* +* @private +* @param {Collection} x - input array +* @param {Function} predicate - testing function +* @param {*} [thisArg] - function context +* @returns {NonNegativeInteger} number of values for which the provided function evaluates to true +* +* @example +* var x = [ 0, 1, 0, 1 ]; +* function predicate( v ) { +* return v > 0; +* } +* var n = indexed( x, predicate ); +* // returns 2 +*/ +function indexed( x, predicate, thisArg ) { + var n; + var i; + + n = 0; + for ( i = 0; i < x.length; i++ ) { + if ( predicate.call( thisArg, x[ i ], i, x ) ) { + n += 1; + } + } + return n; +} + +/** +* Counts the number of elements in an accessor array that satisfy the provided testing function. +* +* @private +* @param {Collection} x - input array +* @param {Function} predicate - testing function +* @param {*} [thisArg] - function context +* @returns {NonNegativeInteger} number of values for which the provided function evaluates to true +* +* @example +* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' ); +* +* var x = toAccessorArray( [ 0, 1, 0, 1 ] ); +* function predicate( v ) { +* return v > 0; +* } +* var n = accessors( x, predicate ); +* // returns 2 +*/ +function accessors( x, predicate, thisArg ) { + var get; + var n; + var i; + + get = resolveGetter( x ); + + n = 0; + for ( i = 0; i < x.length; i++ ) { + if ( predicate.call( thisArg, get( x, i ), i, x ) ) { + n += 1; + } + } + return n; +} + +/** +* Counts the number of elements in a complex array that satisfy the provided testing function. +* +* @private +* @param {Collection} x - input array +* @param {Function} predicate - testing function +* @param {*} [thisArg] - function context +* @returns {NonNegativeInteger} number of values for which the provided function evaluates to true +* +* @example +* var Complex128Array = require( '@stdlib/array/complex128' ); +* +* var x = new Complex128Array( [ 1.0, 2.0, 0.0, 0.0, 3.0, 4.0, 0.0, 0.0 ] ); +* function predicate( v ) { +* return v > 0; +* } +* var n = complex( x, predicate ); +* // returns 2 +*/ +function complex( x, predicate, thisArg ) { + var view; + var n; + var i; + + view = reinterpret( x, 0 ); + + n = 0; + for ( i = 0; i < view.length; i += 2 ) { + if ( predicate.call( thisArg, view[ i ], i, view ) || predicate.call( thisArg, view[ i+1 ], i+1, view ) ) { + n += 1; + } + } + return n; +} + + +// MAIN // + +/** +* Counts the number of elements in an array that satisfy the provided testing function. +* +* @param {Collection} x - input array +* @param {Function} predicate - testing array +* @param {*} [thisArg] - function context +* @returns {NonNegativeInteger} number of truthy values +* +* @example +* var x = [ 0, 1, 0, 1, 1 ]; +* function predicate( v ) { +* return v > 0; +* } +* var n = countIf( x, predicate ); +* // returns 3 +*/ +function countIf( x, predicate, thisArg ) { + if ( isAccessorArray( x ) ) { + if ( isComplexTypedArray( x ) ) { + return complex( x, predicate, thisArg ); + } + return accessors( x, predicate, thisArg ); + } + return indexed( x, predicate, thisArg ); +} + + +// EXPORTS // + +module.exports = countIf; + |