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 | 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 3x 3x 43x 43x 43x 43x 43x 43x 43x 43x 4x 4x 39x 39x 39x 39x 39x 39x 39x 39x 39x 39x 39x 43x 76x 23x 23x 53x 53x 53x 16x 43x 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' );
// MAIN //
/**
* Returns the index of the first element in a double-precision complex floating-point strided array which is less than a corresponding element in another double-precision complex floating-point strided array using alternative indexing semantics.
*
* ## Notes
*
* - When comparing elements, the function checks whether both the real and imaginary components of an element in `x` are less than the corresponding real and imaginary components of an element in `y` using the less-than operator `<`. As a consequence, comparisons involving `NaN` always evaluate to `false`.
* - If the function is unable to find an element in `x` which is less than a corresponding element in `y`, the function returns `-1`.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Complex128Array} x - first input array
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {Complex128Array} y - second input array
* @param {integer} strideY - stride length for `y`
* @param {NonNegativeInteger} offsetY - starting index for `y`
* @returns {integer} index
*
* @example
* var Complex128Array = require( '@stdlib/array/complex128' );
*
* var x = new Complex128Array( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );
* var y = new Complex128Array( [ 0.0, 0.0, 0.0, 0.0, 1.0, 1.0, 0.0, 0.0 ] );
*
* var idx = zfirstIndexLessThan( x.length, x, 1, 0, y, 1, 0 );
* // returns 2
*/
function zfirstIndexLessThan( N, x, strideX, offsetX, y, strideY, offsetY ) {
var viewX;
var viewY;
var ix;
var iy;
var i;
if ( N <= 0 ) {
return -1;
}
// Reinterpret the complex input arrays as real-valued arrays of interleaved real and imaginary components:
viewX = reinterpret( x, 0 );
viewY = reinterpret( y, 0 );
// Adjust the strides and offsets to account for the interleaved storage:
ix = offsetX * 2;
iy = offsetY * 2;
strideX *= 2;
strideY *= 2;
for ( i = 0; i < N; i++ ) {
if ( viewX[ ix ] < viewY[ iy ] && viewX[ ix+1 ] < viewY[ iy+1 ] ) {
return i;
}
ix += strideX;
iy += strideY;
}
return -1;
}
// EXPORTS //
module.exports = zfirstIndexLessThan;
|