All files ndarray.js

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

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 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 1123x 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 29x 29x 29x 29x 29x 29x 29x 29x 29x 29x 29x 29x 29x 6x 6x 23x 23x 23x 23x 23x 23x 23x 23x 29x 33x 33x 12x 12x 12x 12x 33x 3x 3x 3x 3x 33x 33x 5x 5x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 23x 29x 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 //
 
/**
* Reverses a double-precision complex floating-point strided array in-place according to a mask and using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Complex128Array} x - input array
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {Uint8Array} mask - mask array
* @param {integer} strideMask - stride length for `mask`
* @param {NonNegativeInteger} offsetMask - starting index for `mask`
* @returns {Complex128Array} input array
*
* @example
* var Complex128Array = require( '@stdlib/array/complex128' );
* var Uint8Array = require( '@stdlib/array/uint8' );
*
* var x = new Complex128Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
* var mask = new Uint8Array( [ 0, 0, 0, 0 ] );
*
* zmskrev( x.length, x, 1, 0, mask, 1, 0 );
* // x => <Complex128Array>[ 7.0, 8.0, 5.0, 6.0, 3.0, 4.0, 1.0, 2.0 ]
*/
function zmskrev( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {
	var right;
	var tmpIm;
	var tmpRe;
	var view;
	var left;
	var sx;
	var ix;
	var jx;
	var im;
	var jm;
 
	if ( N <= 0 ) {
		return x;
	}
	view = reinterpret( x, 0 );
	sx = strideX * 2;
	left = 0;
	right = N - 1;
	ix = offsetX * 2;
	jx = ( offsetX + ( right * strideX ) ) * 2;
	im = offsetMask;
	jm = offsetMask + ( right * strideMask );
	while ( left < right ) {
		// Scan to find the next unmasked elements...
		while ( left < right && mask[ im ] !== 0 ) {
			left += 1;
			ix += sx;
			im += strideMask;
		}
		while ( right > left && mask[ jm ] !== 0 ) {
			right -= 1;
			jx -= sx;
			jm -= strideMask;
		}
		// Check whether there are any more elements left to reverse...
		if ( left >= right ) {
			break;
		}
		// Swap unmasked elements...
		tmpRe = view[ ix ];
		tmpIm = view[ ix+1 ];
		view[ ix ] = view[ jx ];
		view[ ix+1 ] = view[ jx+1 ];
		view[ jx ] = tmpRe;
		view[ jx+1 ] = tmpIm;
 
		// Adjust indices to point to the next reversal candidates...
		left += 1;
		ix += sx;
		im += strideMask;
		right -= 1;
		jx -= sx;
		jm -= strideMask;
	}
	return x;
}
 
 
// EXPORTS //
 
module.exports = zmskrev;