All files base.js

100% Statements 331/331
100% Branches 48/48
100% Functions 1/1
100% Lines 331/331

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 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 3323x 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 3x 3x 3x 3x 3x 3x 66x 66x 66x 66x 66x 66x 66x 66x 66x 66x 66x 66x 66x 66x 66x 66x 66x 2x 2x 64x 64x 66x 28x 28x 64x 66x 28x 28x 28x 28x 28x 28x 28x 10x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 10x 28x 18x 9x 9x 7x 7x 2x 2x 5x 5x 5x 5x 5x 5x 9x 9x 9x 7x 7x 2x 2x 5x 5x 5x 5x 5x 5x 9x 14x 14x 14x 14x 14x 14x 14x 14x 18x 2x 2x 12x 12x 12x 12x 12x 12x 12x 12x 18x 2x 2x 10x 10x 10x 10x 66x 36x 36x 36x 36x 36x 36x 36x 36x 14x 7x 7x 7x 7x 7x 7x 2x 2x 7x 7x 7x 7x 7x 7x 7x 7x 7x 7x 7x 7x 2x 2x 7x 7x 7x 7x 7x 7x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 36x 22x 13x 13x 9x 9x 2x 2x 7x 7x 9x 2x 2x 7x 7x 7x 7x 22x 9x 9x 9x 9x 2x 2x 7x 7x 9x 2x 2x 7x 7x 7x 7x 9x 18x 18x 18x 18x 18x 18x 18x 18x 22x 2x 2x 16x 16x 16x 16x 16x 16x 16x 16x 22x 2x 2x 14x 14x 14x 14x 36x 48x 48x 48x 48x 48x 48x 48x 48x 48x 48x 48x 48x 48x 48x 48x 48x 48x 48x 66x 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 min = require( '@stdlib/math/base/special/min' );
 
 
// MAIN //
 
/**
* Computes one dqds transform in ping-pong form.
*
* ## Notes
*
* -   `Z` is a 1-D array of length >= `4*N0` storing interleaved q/e values.
* -   `PP` is `0` for ping, `1` for pong.
*
* @private
* @param {integer} I0 - the first index
* @param {integer} N0 - the last index
* @param {Float64Array} Z - the QD array
* @param {integer} strideZ - stride length for `Z`
* @param {NonNegativeInteger} offsetZ - starting index for `Z`
* @param {integer} PP - ping-pong flag (0 or 1)
* @param {number} TAU - the shift
* @param {number} SIGMA - the accumulated shift
* @param {boolean} IEEE - IEEE arithmetic flag
* @param {number} EPS - epsilon used by the routine
* @param {Float64Array} out - output array containing `DMIN`, `DMIN1`, `DMIN2`, `DN`, `DNM1`, and `DNM2` respectively
* @param {integer} strideOut - stride length for `out`
* @param {NonNegativeInteger} offsetOut - starting index of `out`
* @returns {Float64Array} output array
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* var out = new Float64Array( 6 );
* var Z = new Float64Array( [ 5, 0, 7, 0, 9, 0, 3, 0, 11, 0, 4, 0, 20, 0, 0, 0 ] );
*
* dlasq5( 0, 3, Z, 1, 0, 0, 0.1, 0.0, true, 2.220446049250313e-16, out, 1, 0 );
* // out => <Float64Array>[ ~3.606, ~3.606, ~3.606, ~11.823, ~5.904, ~3.606 ]
*/
function dlasq5( I0, N0, Z, strideZ, offsetZ, PP, TAU, SIGMA, IEEE, EPS, out, strideOut, offsetOut ) { // eslint-disable-line max-len, max-params
	var dthresh;
	var dmin1;
	var dmin2;
	var dnm1;
	var dnm2;
	var emin;
	var dmin;
	var temp;
	var j4p2;
	var idx;
	var j4;
	var dn;
	var d;
 
	// Quick return...
	if ( ( N0 - I0 - 1 ) <= 0 ) {
		return out;
	}
 
	dthresh = EPS * ( SIGMA + TAU );
	if ( TAU < ( dthresh * 0.5 ) ) {
		TAU = 0;
	}
 
	if ( TAU > 0 || TAU < 0 ) {
		j4 = offsetZ + ( strideZ*( ( 4*I0 ) + PP ) );
		emin = Z[ j4 + ( 4*strideZ ) ];
		d = Z[ j4 ] - TAU;
		dmin = d;
		dmin1 = -Z[ j4 ];
 
		if ( IEEE ) {
			if ( PP === 0 ) {
				j4 = offsetZ + ( strideZ * ( ( 4*I0 ) + 3 ) );
				for ( idx = ( 4*I0 ) + 3; idx <= ( 4*N0 ) - 9; idx += 4 ) {
					Z[ j4 - ( 2*strideZ ) ] = d + Z[ j4 - strideZ ];
					temp = Z[ j4 + strideZ ] / Z[ j4 - ( 2*strideZ ) ];
					d = ( d*temp ) - TAU;
					dmin = min( dmin, d );
					Z[ j4 ] = Z[ j4 - strideZ ]*temp;
					emin = min( Z[ j4 ], emin );
					j4 += 4*strideZ;
				}
			} else {
				j4 = offsetZ + ( strideZ * ( ( 4*I0 ) + 3 ) );
				for ( idx = ( 4*I0 ) + 3; idx <= ( 4*N0 ) - 9; idx += 4 ) {
					Z[ j4 - ( 3*strideZ ) ] = d + Z[ j4 ];
					temp = Z[ j4 + ( 2*strideZ ) ] / Z[ j4 - ( 3*strideZ ) ];
					d = ( d*temp ) - TAU;
					dmin = min( dmin, d );
					Z[ j4 - strideZ ] = Z[ j4 ] * temp;
					emin = min( Z[ j4 - strideZ ], emin );
					j4 += 4*strideZ;
				}
			}
 
			// Unroll last two steps.
			dnm2 = d;
			dmin2 = dmin;
 
			j4 = offsetZ + ( strideZ * ( ( 4*N0 ) - 5 - PP ) );
			j4p2 = j4 + ( strideZ * ( ( 2*PP ) - 1 ) );
			Z[ j4 - ( 2*strideZ ) ] = dnm2 + Z[ j4p2 ];
			Z[ j4 ] = Z[ j4p2 + ( 2*strideZ ) ] * ( Z[ j4p2 ] / Z[ j4 - ( 2*strideZ ) ] );
			dnm1 = ( Z[ j4p2 + ( 2*strideZ ) ]*( dnm2 / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
			dmin = min( dmin, dnm1 );
 
			dmin1 = dmin;
			j4 += 4*strideZ;
			j4p2 = j4 + ( strideZ * ( ( 2*PP ) - 1 ) );
			Z[ j4 - ( 2*strideZ ) ] = dnm1 + Z[ j4p2 ];
			Z[ j4 ] = Z[ j4p2 + ( 2*strideZ ) ] * ( Z[ j4p2 ] / Z[ j4 - ( 2*strideZ ) ] );
			dn = ( Z[ j4p2 + ( 2*strideZ ) ]*( dnm1 / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
			dmin = min( dmin, dn );
		} else {
			if ( PP === 0 ) {
				j4 = offsetZ + ( strideZ * ( ( 4*I0 ) + 3 ) );
				for ( idx = ( 4*I0 ) + 3; idx <= ( 4*N0 ) - 9; idx += 4 ) {
					Z[ j4 - ( 2*strideZ ) ] = d + Z[ j4 - strideZ ];
					if ( d < 0 ) {
						return out;
					}
					Z[ j4 ] = Z[ j4 + strideZ ] * ( Z[ j4 - strideZ ] / Z[ j4 - ( 2*strideZ ) ] );
					d = ( Z[ j4 + strideZ ]*( d / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
					dmin = min( dmin, d );
					emin = min( emin, Z[ j4 ] );
					j4 += 4*strideZ;
				}
			} else {
				j4 = offsetZ + ( strideZ * ( ( 4*I0 ) + 3 ) );
				for ( idx = ( 4*I0 ) + 3; idx <= ( 4*N0 ) - 9; idx += 4 ) {
					Z[ j4 - ( 3*strideZ ) ] = d + Z[ j4 ];
					if ( d < 0 ) {
						return out;
					}
					Z[ j4 - strideZ ] = Z[ j4 + ( 2*strideZ ) ] * ( Z[ j4 ] / Z[ j4 - ( 3*strideZ ) ] );
					d = ( Z[ j4 + ( 2*strideZ ) ]*( d / Z[ j4 - ( 3*strideZ ) ] ) ) - TAU;
					dmin = min( dmin, d );
					emin = min( emin, Z[ j4 - strideZ ] );
					j4 += 4*strideZ;
				}
			}
 
			// Unroll last two steps.
			dnm2 = d;
			dmin2 = dmin;
 
			j4 = offsetZ + ( strideZ * ( ( 4*N0 ) - 5 - PP ) );
			j4p2 = j4 + ( strideZ * ( ( 2*PP ) - 1 ) );
			Z[ j4 - ( 2*strideZ ) ] = dnm2 + Z[ j4p2 ];
			if ( dnm2 < 0 ) {
				return out;
			}
			Z[ j4 ] = Z[ j4p2 + ( 2*strideZ ) ] * ( Z[ j4p2 ] / Z[ j4 - ( 2*strideZ ) ] );
			dnm1 = ( Z[ j4p2 + ( 2*strideZ ) ]*( dnm2 / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
			dmin = min( dmin, dnm1 );
 
			dmin1 = dmin;
			j4 += 4*strideZ;
			j4p2 = j4 + ( strideZ * ( ( 2*PP ) - 1 ) );
			Z[ j4 - ( 2*strideZ ) ] = dnm1 + Z[ j4p2 ];
			if ( dnm1 < 0 ) {
				return out;
			}
			Z[ j4 ] = Z[ j4p2 + ( 2*strideZ ) ] * ( Z[ j4p2 ] / Z[ j4 - ( 2*strideZ ) ] );
			dn = ( Z[ j4p2 + ( 2*strideZ ) ]*( dnm1 / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
			dmin = min( dmin, dn );
		}
	} else {
		// This is the version that sets d's to zero if they are small enough
		j4 = offsetZ + ( strideZ * ( ( 4*I0 ) + PP ) );
		emin = Z[ j4 + ( 4*strideZ ) ];
		d = Z[ j4 ];
		dmin = d;
		dmin1 = -Z[ j4 ];
 
		if ( IEEE ) {
			if ( PP === 0 ) {
				j4 = offsetZ + ( strideZ * ( ( 4*I0 ) + 3 ) );
				for ( idx = ( 4*I0 ) + 3; idx <= ( 4*N0 ) - 9; idx += 4 ) {
					Z[ j4 - ( 2*strideZ ) ] = d + Z[ j4 - strideZ ];
					temp = Z[ j4 + strideZ ] / Z[ j4 - ( 2*strideZ ) ];
					d = ( d*temp ) - TAU;
					if ( d < dthresh ) {
						d = 0;
					}
					dmin = min( dmin, d );
					Z[ j4 ] = Z[ j4 - strideZ ] * temp;
					emin = min( Z[ j4 ], emin );
					j4 += 4*strideZ;
				}
			} else {
				j4 = offsetZ + ( strideZ * ( ( 4*I0 ) + 3 ) );
				for ( idx = ( 4*I0 ) + 3; idx <= ( 4*N0 ) - 9; idx += 4 ) {
					Z[ j4 - ( 3*strideZ ) ] = d + Z[ j4 ];
					temp = Z[ j4 + ( 2*strideZ ) ] / Z[ j4 - ( 3*strideZ ) ];
					d = ( d*temp ) - TAU;
					if ( d < dthresh ) {
						d = 0;
					}
					dmin = min( dmin, d );
					Z[ j4 - strideZ ] = Z[ j4 ] * temp;
					emin = min( Z[ j4 - strideZ ], emin );
					j4 += 4*strideZ;
				}
			}
 
			// Unroll last two steps.
			dnm2 = d;
			dmin2 = dmin;
 
			j4 = offsetZ + ( strideZ * ( ( 4*N0 ) - 5 - PP ) );
			j4p2 = j4 + ( strideZ * ( ( 2*PP ) - 1 ) );
			Z[ j4 - ( 2*strideZ ) ] = dnm2 + Z[ j4p2 ];
			Z[ j4 ] = Z[ j4p2 + ( 2*strideZ ) ] * ( Z[ j4p2 ] / Z[ j4 - ( 2*strideZ ) ] );
			dnm1 = ( Z[ j4p2 + ( 2*strideZ ) ]*( dnm2 / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
			dmin = min( dmin, dnm1 );
 
			dmin1 = dmin;
			j4 += 4*strideZ;
			j4p2 = j4 + ( strideZ * ( ( 2*PP ) - 1 ) );
			Z[ j4 - ( 2*strideZ ) ] = dnm1 + Z[ j4p2 ];
			Z[ j4 ] = Z[ j4p2 + ( 2*strideZ ) ] * ( Z[ j4p2 ] / Z[ j4 - ( 2*strideZ ) ] );
			dn = ( Z[ j4p2 + ( 2*strideZ ) ]*( dnm1 / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
			dmin = min( dmin, dn );
		} else {
			if ( PP === 0 ) {
				j4 = offsetZ + ( strideZ * ( ( 4*I0 ) + 3 ) );
				for ( idx = ( 4*I0 ) + 3; idx <= ( 4*N0 ) - 9; idx += 4 ) {
					Z[ j4 - ( 2*strideZ ) ] = d + Z[ j4 - strideZ ];
					if ( d < 0 ) {
						return out;
					}
					Z[ j4 ] = Z[ j4 + strideZ ] * ( Z[ j4 - strideZ ] / Z[ j4 - ( 2*strideZ ) ] );
					d = ( Z[ j4 + strideZ ]*( d / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
					if ( d < dthresh ) {
						d = 0;
					}
					dmin = min( dmin, d );
					emin = min( emin, Z[ j4 ] );
					j4 += 4*strideZ;
				}
			} else {
				j4 = offsetZ + ( strideZ * ( ( 4*I0 ) + 3 ) );
				for ( idx = ( 4*I0 ) + 3; idx <= ( 4*N0 ) - 9; idx += 4 ) {
					Z[ j4 - ( 3*strideZ ) ] = d + Z[ j4 ];
					if ( d < 0 ) {
						return out;
					}
					Z[ j4 - strideZ ] = Z[ j4 + ( 2*strideZ ) ] * ( Z[ j4 ] / Z[ j4 - ( 3*strideZ ) ] );
					d = ( Z[ j4 + ( 2*strideZ ) ]*( d / Z[ j4 - ( 3*strideZ ) ] ) ) - TAU;
					if ( d < dthresh ) {
						d = 0;
					}
					dmin = min( dmin, d );
					emin = min( emin, Z[ j4 - strideZ ] );
					j4 += 4*strideZ;
				}
			}
 
			// Unroll last two steps.
			dnm2 = d;
			dmin2 = dmin;
 
			j4 = offsetZ + ( strideZ * ( ( 4*N0 ) - 5 - PP ) );
			j4p2 = j4 + ( strideZ * ( ( 2*PP ) - 1 ) );
			Z[ j4 - ( 2*strideZ ) ] = dnm2 + Z[ j4p2 ];
			if ( dnm2 < 0 ) {
				return out;
			}
			Z[ j4 ] = Z[ j4p2 + ( 2*strideZ ) ] * ( Z[ j4p2 ] / Z[ j4 - ( 2*strideZ ) ] );
			dnm1 = ( Z[ j4p2 + ( 2*strideZ ) ]*( dnm2 / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
 
			dmin = min( dmin, dnm1 );
			dmin1 = dmin;
			j4 += 4*strideZ;
			j4p2 = j4 + ( strideZ * ( ( 2*PP ) - 1 ) );
			Z[ j4 - ( 2*strideZ ) ] = dnm1 + Z[ j4p2 ];
			if ( dnm1 < 0 ) {
				return out;
			}
			Z[ j4 ] = Z[ j4p2 + ( 2*strideZ ) ] * ( Z[ j4p2 ] / Z[ j4 - ( 2*strideZ ) ] );
			dn = ( Z[ j4p2 + ( 2*strideZ ) ]*( dnm1 / Z[ j4 - ( 2*strideZ ) ] ) ) - TAU;
			dmin = min( dmin, dn );
		}
	}
 
	Z[ j4 + ( 2*strideZ ) ] = dn;
	Z[ offsetZ + ( strideZ * ( ( 4*N0 ) + 3 - PP ) ) ] = emin;
 
	idx = offsetOut;
	out[ idx ] = dmin;
	idx += strideOut;
	out[ idx ] = dmin1;
	idx += strideOut;
	out[ idx ] = dmin2;
	idx += strideOut;
	out[ idx ] = dn;
	idx += strideOut;
	out[ idx ] = dnm1;
	idx += strideOut;
	out[ idx ] = dnm2;
 
	return out;
}
 
 
// EXPORTS //
 
module.exports = dlasq5;