\sqrt{re \cdot re + im \cdot im}\begin{array}{l}
\mathbf{if}\;re \le -9.340803523077166 \cdot 10^{+139}:\\
\;\;\;\;-re\\
\mathbf{elif}\;re \le -4.786656859853452 \cdot 10^{-266}:\\
\;\;\;\;\sqrt{re \cdot re + im \cdot im}\\
\mathbf{elif}\;re \le -2.7978321376001454 \cdot 10^{-306}:\\
\;\;\;\;im\\
\mathbf{elif}\;re \le 1.2882041961296455 \cdot 10^{+92}:\\
\;\;\;\;\sqrt{re \cdot re + im \cdot im}\\
\mathbf{else}:\\
\;\;\;\;re\\
\end{array}double code(double re, double im) {
return ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
}
double code(double re, double im) {
double VAR;
if ((re <= -9.340803523077166e+139)) {
VAR = ((double) -(re));
} else {
double VAR_1;
if ((re <= -4.786656859853452e-266)) {
VAR_1 = ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
} else {
double VAR_2;
if ((re <= -2.7978321376001454e-306)) {
VAR_2 = im;
} else {
double VAR_3;
if ((re <= 1.2882041961296455e+92)) {
VAR_3 = ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
} else {
VAR_3 = re;
}
VAR_2 = VAR_3;
}
VAR_1 = VAR_2;
}
VAR = VAR_1;
}
return VAR;
}



Bits error versus re



Bits error versus im
Results
if re < -9.3408035230771657e139Initial program 60.5
Taylor expanded around -inf 8.4
Simplified8.4
if -9.3408035230771657e139 < re < -4.7866568598534521e-266 or -2.79783213760014545e-306 < re < 1.28820419612964551e92Initial program 20.8
if -4.7866568598534521e-266 < re < -2.79783213760014545e-306Initial program 31.2
Taylor expanded around 0 31.5
if 1.28820419612964551e92 < re Initial program 50.9
Taylor expanded around inf 11.5
Final simplification17.9
herbie shell --seed 2020184
(FPCore (re im)
:name "math.abs on complex"
:precision binary64
(sqrt (+ (* re re) (* im im))))