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 | 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 25x 25x 25x 25x 25x 25x 25x 25x 4x 4x 21x 21x 21x 21x 25x 69x 40x 40x 69x 69x 21x 25x 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-complex128' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
// MAIN //
/**
* Computes the number of non-`NaN` elements in a double-precision complex floating-point strided array.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Complex128Array} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {NonNegativeInteger} number of non-`NaN` elements
*
* @example
* var Complex128Array = require( '@stdlib/array/complex128' );
*
* var x = new Complex128Array( [ 1.0, 2.0, NaN, NaN, 3.0, 4.0 ] );
*
* var v = znancount( 3, x, 1, 0 );
* // returns 2
*/
function znancount( N, x, strideX, offsetX ) {
var count;
var view;
var ix;
var sx;
var i;
if ( N <= 0 ) {
return 0;
}
view = reinterpret( x, 0 );
ix = offsetX * 2;
sx = strideX * 2;
count = 0;
for ( i = 0; i < N; i++ ) {
if ( !isnan( view[ ix ] ) && !isnan( view[ ix+1 ] ) ) {
count += 1;
}
ix += sx;
}
return count;
}
// EXPORTS //
module.exports = znancount;
|