All files ndarray.js

100% Statements 90/90
100% Branches 12/12
100% Functions 1/1
100% Lines 90/90

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 913x 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 3x 3x 3x 3x 3x 3x 3x 22x 22x 22x 22x 22x 22x 22x 22x 22x 22x 22x 4x 4x 18x 18x 18x 18x 18x 18x 18x 22x 65x 33x 33x 16x 16x 33x 65x 65x 65x 65x 18x 22x 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 isnan = require( '@stdlib/math/base/assert/is-nan' );
var reinterpretBoolean = require( '@stdlib/strided/base/reinterpret-boolean' );
var reinterpret = require( '@stdlib/strided/base/reinterpret-complex64' );
 
 
// MAIN //
 
/**
* Cumulatively tests whether at least `k` elements in a single-precision complex floating-point strided array are truthy using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {integer} k - minimum number of truthy elements
* @param {Complex64Array} x - input array
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {BooleanArray} out - output array
* @param {integer} strideOut - stride length for `out`
* @param {NonNegativeInteger} offsetOut - starting index for `out`
* @returns {BooleanArray} output array
*
* @example
* var Complex64Array = require( '@stdlib/array/complex64' );
* var BooleanArray = require( '@stdlib/array/bool' );
*
* var x = new Complex64Array( [ 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 1.0, 0.0 ] );
* var out = new BooleanArray( 4 );
*
* ccusome( 4, 2, x, 1, 0, out, 1, 0 );
* // out => <BooleanArray>[ false, false, false, true ]
*/
function ccusome( N, k, x, strideX, offsetX, out, strideOut, offsetOut ) {
	var view;
	var obuf;
	var flg;
	var cnt;
	var sx;
	var ox;
	var io;
	var i;
 
	if ( N <= 0 ) {
		return out;
	}
	view = reinterpret( x, 0 );
	obuf = reinterpretBoolean( out, 0 );
	sx = strideX * 2;
	ox = offsetX * 2;
	flg = false;
	cnt = k;
	io = offsetOut;
	for ( i = 0; i < N; i++ ) {
		if ( !flg && ( ( view[ ox ] !== 0 && !isnan( view[ ox ] ) ) || ( view[ ox+1 ] !== 0 && !isnan( view[ ox+1 ] ) ) ) ) { // eslint-disable-line max-len
			cnt -= 1;
			if ( cnt <= 0 ) {
				flg = true;
			}
		}
		obuf[ io ] = flg;
		ox += sx;
		io += strideOut;
	}
	return out;
}
 
 
// EXPORTS //
 
module.exports = ccusome;