All files ndarray.js

100% Statements 94/94
100% Branches 8/8
100% Functions 1/1
100% Lines 94/94

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 91 92 93 94 953x 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 27x 27x 27x 27x 27x 27x 27x 27x 27x 27x 4x 4x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 27x 63x 35x 35x 35x 63x 63x 23x 27x 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' );
var realf = require( '@stdlib/complex/float32/real' );
var imagf = require( '@stdlib/complex/float32/imag' );
 
 
// MAIN //
 
/**
* Replaces single-precision complex floating-point strided array elements not equal to a provided search element with a specified scalar constant using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Complex64} searchElement - search element
* @param {Complex64} alpha - scalar constant
* @param {Complex64Array} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {Complex64Array} input array
*
* @example
* var Complex64Array = require( '@stdlib/array/complex64' );
* var Complex64 = require( '@stdlib/complex/float32/ctor' );
*
* var x = new Complex64Array( [ 1.0, 2.0, 0.0, 0.0, 3.0, 4.0, 0.0, 0.0 ] );
*
* var searchElement = new Complex64( 0.0, 0.0 );
* var alpha = new Complex64( 5.0, 5.0 );
*
* cfillNotEqual( x.length, searchElement, alpha, x, 1, 0 );
* // x => <Complex64Array>[ 5.0, 5.0, 0.0, 0.0, 5.0, 5.0, 0.0, 0.0 ]
*/
function cfillNotEqual( N, searchElement, alpha, x, strideX, offsetX ) {
	var view;
	var sre;
	var sim;
	var re;
	var im;
	var ix;
	var i;
 
	if ( N <= 0 ) {
		return x;
	}
 
	// Decompose the search element into its real and imaginary components:
	sre = realf( searchElement );
	sim = imagf( searchElement );
 
	// Decompose the constant into its real and imaginary components:
	re = realf( alpha );
	im = imagf( alpha );
 
	// 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 ] !== sre || view[ ix+1 ] !== sim ) {
			view[ ix ] = re;
			view[ ix+1 ] = im;
		}
		ix += strideX;
	}
	return x;
}
 
 
// EXPORTS //
 
module.exports = cfillNotEqual;