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 3x 3x 3x 3x 3x 36x 36x 36x 36x 36x 36x 4x 4x 32x 32x 32x 32x 32x 32x 32x 32x 36x 73x 17x 17x 56x 56x 15x 36x 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 reinterpret = require( '@stdlib/strided/base/reinterpret-complex64' );
// MAIN //
/**
* Tests whether at least one element in a single-precision complex floating-point strided array is truthy using alternative indexing semantics.
*
* ## Notes
*
* - A complex number is truthy when at least one of its real or imaginary components is truthy.
* - The function explicitly treats `NaN` values as falsy.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Complex64Array} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {boolean} boolean indicating whether at least one element is truthy
*
* @example
* var Complex64Array = require( '@stdlib/array/complex64' );
*
* var x = new Complex64Array( [ 0.0, 0.0, 1.0, 2.0 ] );
*
* var v = cany( x.length, x, 1, 0 );
* // returns true
*/
function cany( N, x, strideX, offsetX ) {
var view;
var ix;
var i;
if ( N <= 0 ) {
return false;
}
// Reinterpret the complex input array as a real-valued array of interleaved real and imaginary components:
view = reinterpret( x, 0 );
// Adjust the stride and offset to account for the interleaved storage:
ix = offsetX * 2;
strideX *= 2;
for ( i = 0; i < N; i++ ) {
if ( view[ ix ] || view[ ix+1 ] ) {
return true;
}
ix += strideX;
}
return false;
}
// EXPORTS //
module.exports = cany;
|