All files ndarray.js

100% Statements 69/69
100% Branches 13/13
100% Functions 1/1
100% Lines 69/69

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 703x 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 30x 30x 30x 30x 30x 30x 4x 4x 30x 10x 10x 16x 16x 30x 46x 34x 34x 11x 11x 34x 35x 35x 5x 30x 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';
 
// MAIN //
 
/**
* Tests whether a double-precision floating-point strided array contains at least `k` truthy elements using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {integer} k - minimum number of truthy elements
* @param {Float64Array} x - input array
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @returns {boolean} boolean indicating whether the input array contains at least k truthy elements
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* var x = new Float64Array( [ 0.0, 0.0, 1.0, 2.0 ] );
*
* var v = dsome( 4, 2, x, 1, 0 );
* // returns true
*/
function dsome( N, k, x, strideX, offsetX ) {
	var cnt;
	var ix;
	var i;
 
	if ( N <= 0 ) {
		return false;
	}
	if ( strideX === 0 ) {
		return ( x[ offsetX ] ) ? k <= N : k <= 0;
	}
	ix = offsetX;
	cnt = 0;
	for ( i = 0; i < N; i++ ) {
		if ( x[ ix ] ) {
			cnt += 1;
			if ( cnt >= k ) {
				return true;
			}
		}
		ix += strideX;
	}
	return false;
}
 
 
// EXPORTS //
 
module.exports = dsome;