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 | 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 500x 500x 500x 500x 256x 256x 244x 500x 2x 2x 2x 2x 2x | /**
* @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 absf = require( '@stdlib/math/base/special/fast/absf' );
var f32 = require( '@stdlib/number/float64/base/to-float32' );
// VARIABLES //
// 2*cos(pi/8)/(1+cos(pi/8)):
var ALPHA = f32( 0.96043387010342 );
// 2*sin(pi/8)/(1+cos(pi/8)):
var BETA = f32( 0.397824734759316 );
// MAIN //
/**
* Computes the hypotenuse of a single-precision floating point number using the alpha max plus beta min algorithm.
*
* @param {number} x - number
* @param {number} y - number
* @returns {number} hypotenuse
*
* @example
* var h = hypotf( -5.0, 12.0 );
* // returns ~13.5
*/
function hypotf( x, y ) {
x = absf( x );
y = absf( y );
if ( x > y ) {
return f32( f32( ALPHA*x ) + f32( BETA*y ) );
}
return f32( f32( ALPHA*y ) + f32( BETA*x ) );
}
// EXPORTS //
module.exports = hypotf;
|