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 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 7059x 7059x 7059x 7059x 7059x 7059x 2x 2x 7059x 16x 8x 2x 2x 6x 6x 8x 16x 2x 2x 6x 6x 7059x 6x 6x 7059x 20x 10x 10x 10x 10x 7059x 12x 12x 7003x 7059x 2002x 1001x 1001x 1001x 1001x 5001x 7059x 1x 1x 1x 1x 1x | /**
* @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.
*
*
* ## Notice
*
* The original code, copyright and license are from [Go]{@link https://golang.org/src/math/atan2.go}. The implementation follows the original, but has been modified for JavaScript.
*
* ```text
* Copyright (c) 2009 The Go Authors. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
* ```
*/
'use strict';
// MODULES //
var isinfinitef = require( '@stdlib/math/base/assert/is-infinitef' );
var copysignf = require( '@stdlib/math/base/special/copysignf' );
var signbitf = require( '@stdlib/number/float32/base/signbit' );
var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
var atanf = require( '@stdlib/math/base/special/atanf' );
var f32 = require( '@stdlib/number/float64/base/to-float32' );
var PINF = require( '@stdlib/constants/float32/pinf' );
var PI = require( '@stdlib/constants/float32/pi' );
// VARIABLES //
var ZERO = f32( 0.0 );
var TWO = f32( 2.0 );
var THREE = f32( 3.0 );
var FOUR = f32( 4.0 );
// MAIN //
/**
* Computes the angle in the plane (in radians) between the positive x-axis and the ray from `(0,0)` to the point `(x,y)` as a single-precision floating-point number.
*
* ## Special Cases
*
* ```tex
* \begin{align*}
* \operatorname{atan2f}(y,\mathrm{NaN}) &= \mathrm{NaN}\\
* \operatorname{atan2f}(\mathrm{NaN},x) &= \mathrm{NaN}\\
* \operatorname{atan2f}( +0,x \ge 0 ) &= +0 \\
* \operatorname{atan2f}( -0, x \ge 0 ) &= -0 \\
* \operatorname{atan2f}( +0,x \le -0 ) &= +\Pi \\
* \operatorname{atan2f}( -0, x \le -0 ) &= -\Pi \\
* \operatorname{atan2f}(+\infty, +\infty) &= +\tfrac{\Pi}{4} \\
* \operatorname{atan2f}(-\infty, +\infty) &= -\tfrac{\Pi}{4} \\
* \operatorname{atan2f}(+\infty, -\infty) &= +\tfrac{3\Pi}{4} \\
* \operatorname{atan2f}(-\infty, -\infty) &= -\tfrac{3\Pi}{4} \\
* \operatorname{atan2f}(y, +\infty) &= 0.0 \\
* \operatorname{atan2f}(y>0, -\infty) &= +\Pi \\
* \operatorname{atan2f}(y<0, -\infty) &= -\Pi \\
* \operatorname{atan2f}(+\infty, x ) &= +\tfrac{\Pi}{2} \\
* \operatorname{atan2f}(-\infty, x ) &= -\tfrac{\Pi}{2} \\
* \end{align*}
* ```
*
* @param {number} y - `y` coordinate
* @param {number} x - `x` coordinate
* @returns {number} angle (in radians)
*
* @example
* var v = atan2f( 2.0, 2.0 ); // => atanf( 1.0 )
* // returns ~0.785
*
* @example
* var v = atan2f( 6.0, 2.0 ); // => atanf( 3.0 )
* // returns ~1.249
*
* @example
* var v = atan2f( -1.0, -1.0 ); // => atanf( 1.0 ) - π
* // returns ~-2.356
*
* @example
* var v = atan2f( 3.0, 0.0 ); // => π/2
* // returns ~1.571
*
* @example
* var v = atan2f( -2.0, 0.0 ); // => -π/2
* // returns ~-1.571
*
* @example
* var v = atan2f( 0.0, 0.0 );
* // returns 0.0
*
* @example
* var v = atan2f( 3.0, NaN );
* // returns NaN
*
* @example
* var v = atan2f( NaN, 2.0 );
* // returns NaN
*/
function atan2f( y, x ) {
var q;
x = f32( x );
y = f32( y );
if ( isnanf( x ) || isnanf( y ) ) {
return NaN;
}
if ( isinfinitef( x ) ) {
if ( x === PINF ) {
if ( isinfinitef( y ) ) {
return copysignf( f32( PI / FOUR ), y );
}
return copysignf( ZERO, y );
}
// Case: x is -Infinity
if ( isinfinitef( y ) ) {
return copysignf( f32( f32( THREE * PI ) / FOUR ), y );
}
return copysignf( PI, y );
}
if ( isinfinitef( y ) ) {
return copysignf( f32( PI / TWO ), y );
}
if ( y === 0.0 ) {
if ( x >= 0.0 && !signbitf( x ) ) {
return copysignf( ZERO, y );
}
return copysignf( PI, y );
}
if ( x === 0.0 ) {
return copysignf( f32( PI / TWO ), y );
}
q = atanf( f32( y / x ) );
if ( x < 0.0 ) {
if ( q <= 0.0 ) {
return f32( q + PI );
}
return f32( q - PI );
}
return q;
}
// EXPORTS //
module.exports = atan2f;
|