\sqrt{re \cdot re + im \cdot im}\begin{array}{l}
\mathbf{if}\;re \le -2.1469124341159173 \cdot 10^{94}:\\
\;\;\;\;-1 \cdot re\\
\mathbf{elif}\;re \le -3.19651783577238613 \cdot 10^{-203}:\\
\;\;\;\;\sqrt{re \cdot re + im \cdot im}\\
\mathbf{elif}\;re \le 1.1868703169839283 \cdot 10^{-289}:\\
\;\;\;\;im\\
\mathbf{elif}\;re \le 9.2975351703027165 \cdot 10^{62}:\\
\;\;\;\;\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.1469124341159173e+94)) {
VAR = ((double) (-1.0 * re));
} else {
double VAR_1;
if ((re <= -3.196517835772386e-203)) {
VAR_1 = ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
} else {
double VAR_2;
if ((re <= 1.1868703169839283e-289)) {
VAR_2 = im;
} else {
double VAR_3;
if ((re <= 9.297535170302716e+62)) {
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.1469124341159173e+94Initial program 50.8
Taylor expanded around -inf 9.6
if -2.1469124341159173e+94 < re < -3.196517835772386e-203 or 1.1868703169839283e-289 < re < 9.297535170302716e+62Initial program 19.4
if -3.196517835772386e-203 < re < 1.1868703169839283e-289Initial program 30.5
Taylor expanded around 0 34.6
if 9.297535170302716e+62 < re Initial program 45.9
Taylor expanded around inf 12.6
Final simplification17.8
herbie shell --seed 2020121
(FPCore (re im)
:name "math.abs on complex"
:precision binary64
(sqrt (+ (* re re) (* im im))))