\sqrt{re \cdot re + im \cdot im}\begin{array}{l}
\mathbf{if}\;re \le -2.07621210558784363 \cdot 10^{93}:\\
\;\;\;\;-1 \cdot re\\
\mathbf{elif}\;re \le 1.24837089590244688 \cdot 10^{-261}:\\
\;\;\;\;\sqrt{re \cdot re + im \cdot im}\\
\mathbf{elif}\;re \le 3.46573922954344998 \cdot 10^{-184}:\\
\;\;\;\;im\\
\mathbf{elif}\;re \le 4.0706681104305729 \cdot 10^{132}:\\
\;\;\;\;\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 <= -2.0762121055878436e+93)) {
VAR = ((double) (-1.0 * re));
} else {
double VAR_1;
if ((re <= 1.2483708959024469e-261)) {
VAR_1 = ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
} else {
double VAR_2;
if ((re <= 3.46573922954345e-184)) {
VAR_2 = im;
} else {
double VAR_3;
if ((re <= 4.070668110430573e+132)) {
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 < -2.07621210558784363e93Initial program 51.1
Taylor expanded around -inf 10.7
if -2.07621210558784363e93 < re < 1.24837089590244688e-261 or 3.46573922954344998e-184 < re < 4.0706681104305729e132Initial program 19.9
if 1.24837089590244688e-261 < re < 3.46573922954344998e-184Initial program 30.7
Taylor expanded around 0 32.9
if 4.0706681104305729e132 < re Initial program 57.5
Taylor expanded around inf 8.5
Final simplification17.5
herbie shell --seed 2020168
(FPCore (re im)
:name "math.abs on complex"
:precision binary64
(sqrt (+ (* re re) (* im im))))