\sqrt{re \cdot re + im \cdot im}\begin{array}{l}
\mathbf{if}\;re \le -2.30805639812844361 \cdot 10^{37}:\\
\;\;\;\;-1 \cdot re\\
\mathbf{elif}\;re \le -3.4890999084961649 \cdot 10^{-238}:\\
\;\;\;\;\sqrt{re \cdot re + im \cdot im}\\
\mathbf{elif}\;re \le 1.0888489179947855 \cdot 10^{-216}:\\
\;\;\;\;im\\
\mathbf{elif}\;re \le 3.48696801776793644 \cdot 10^{141}:\\
\;\;\;\;\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.3080563981284436e+37)) {
VAR = ((double) (-1.0 * re));
} else {
double VAR_1;
if ((re <= -3.489099908496165e-238)) {
VAR_1 = ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
} else {
double VAR_2;
if ((re <= 1.0888489179947855e-216)) {
VAR_2 = im;
} else {
double VAR_3;
if ((re <= 3.4869680177679364e+141)) {
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.3080563981284436e+37Initial program 42.2
Taylor expanded around -inf 13.5
if -2.3080563981284436e+37 < re < -3.489099908496165e-238 or 1.0888489179947855e-216 < re < 3.4869680177679364e+141Initial program 19.5
if -3.489099908496165e-238 < re < 1.0888489179947855e-216Initial program 31.0
Taylor expanded around 0 33.3
if 3.4869680177679364e+141 < re Initial program 59.6
Taylor expanded around inf 8.1
Final simplification18.4
herbie shell --seed 2020113
(FPCore (re im)
:name "math.abs on complex"
:precision binary64
(sqrt (+ (* re re) (* im im))))