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 | 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 60x 60x 60x 60x 60x 60x 60x 8x 8x 52x 60x 26x 26x 60x 10x 10x 16x 16x 60x 46x 34x 34x 11x 11x 34x 35x 35x 5x 60x 3x 3x 3x 3x 3x | /**
* @license Apache-2.0
*
* Copyright (c) 2026 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 accessors = require( './accessors.js' );
// MAIN //
/**
* Tests whether a strided array contains at least `k` truthy elements.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {PositiveInteger} k - minimum number of truthy elements
* @param {Collection} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {boolean} boolean indicating whether the input array contains at least k truthy elements
*
* @example
* var x = [ 0.0, 0.0, 1.0, 2.0 ];
*
* var v = gsome( 4, 2, x, 1, 0 );
* // returns true
*/
function gsome( N, k, x, strideX, offsetX ) {
var count;
var ix;
var o;
var i;
if ( N <= 0 ) {
return false;
}
o = arraylike2object( x );
if ( o.accessorProtocol ) {
return accessors( N, k, o, strideX, offsetX );
}
if ( strideX === 0 ) {
return ( x[ offsetX ] ) ? k <= N : k <= 0;
}
ix = offsetX;
count = 0;
for ( i = 0; i < N; i++ ) {
if ( x[ ix ] ) {
count += 1;
if ( count >= k ) {
return true;
}
}
ix += strideX;
}
return false;
}
// EXPORTS //
module.exports = gsome;
|