All files / blas/base/icamax/lib ndarray.js

100% Statements 75/75
100% Branches 9/9
100% Functions 1/1
100% Lines 75/75

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 763x 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 18x 18x 18x 18x 18x 18x 18x 18x 2x 2x 16x 18x 2x 2x 14x 14x 18x 26x 26x 19x 19x 19x 26x 26x 14x 18x 3x 3x 3x 3x 3x  
/**
* @license Apache-2.0
*
* Copyright (c) 2025 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 scabs1 = require( '@stdlib/blas/base/scabs1' );
 
 
// MAIN //
 
/**
* Finds the index of the first element having maximum |Re(.)| + |Im(.)|.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Complex64Array} x - input array
* @param {integer} strideX - `x` stride length
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @returns {integer} index value
*
* @example
* var Complex64Array = require( '@stdlib/array/complex64' );
*
* var x = new Complex64Array( [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ] );
*
* var y = icamax( x.length, x, 1, 0 );
* // returns 1
*/
function icamax( N, x, strideX, offsetX ) {
	var max;
	var ix;
	var v;
	var y;
	var i;
 
	if ( N < 1 ) {
		return -1;
	}
	y = 0;
	if ( N === 1 ) {
		return y;
	}
	max = scabs1( x.get( offsetX ) );
	ix = offsetX + strideX;
	for ( i = 1; i < N; i++ ) {
		v = scabs1( x.get( ix ) );
		if ( v > max ) {
			y = i;
			max = v;
		}
		ix += strideX;
	}
	return y;
}
 
 
// EXPORTS //
 
module.exports = icamax;