All files / base/gcusome/lib ndarray.js

60.22% Statements 53/88
100% Branches 1/1
0% Functions 0/1
60.22% Lines 53/88

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 891x 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                                                                       1x 1x 1x 1x 1x  
/**
* @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 //
 
/**
* Cumulatively tests whether at least `k` elements in a strided array are truthy using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {integer} k - minimum number of truthy elements
* @param {Collection} x - input array
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {Collection} out - output array
* @param {integer} strideOut - stride length for `out`
* @param {NonNegativeInteger} offsetOut - starting index for `out`
* @returns {Collection} output array
*
* @example
* var x = [ 0, 0, 1, 1, 1 ];
* var out = [ false, false, false, false, false ];
*
* gcusome( 5, 2, x, 1, 0, out, 1, 0 );
* // out => [ false, false, false, true, true ]
*/
function gcusome( N, k, x, strideX, offsetX, out, strideOut, offsetOut ) {
	var flg;
	var cnt;
	var ox;
	var oo;
	var ix;
	var io;
	var i;

	if ( N <= 0 ) {
		return out;
	}
	ox = arraylike2object( x );
	oo = arraylike2object( out );
	if ( ox.accessorProtocol || oo.accessorProtocol ) {
		accessors( N, k, ox, strideX, offsetX, oo, strideOut, offsetOut );
		return out;
	}
	flg = false;
	cnt = k;
	ix = offsetX;
	io = offsetOut;
	for ( i = 0; i < N; i++ ) {
		if ( !flg && x[ ix ] ) {
			cnt -= 1;
			if ( cnt <= 0 ) {
				flg = true;
			}
		}
		out[ io ] = flg;
		ix += strideX;
		io += strideOut;
	}
	return out;
}
 
 
// EXPORTS //
 
module.exports = gcusome;