
(FPCore (re im) :precision binary64 (* (exp re) (sin im)))
double code(double re, double im) {
return exp(re) * sin(im);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = exp(re) * sin(im)
end function
public static double code(double re, double im) {
return Math.exp(re) * Math.sin(im);
}
def code(re, im): return math.exp(re) * math.sin(im)
function code(re, im) return Float64(exp(re) * sin(im)) end
function tmp = code(re, im) tmp = exp(re) * sin(im); end
code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e^{re} \cdot \sin im
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (re im) :precision binary64 (* (exp re) (sin im)))
double code(double re, double im) {
return exp(re) * sin(im);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = exp(re) * sin(im)
end function
public static double code(double re, double im) {
return Math.exp(re) * Math.sin(im);
}
def code(re, im): return math.exp(re) * math.sin(im)
function code(re, im) return Float64(exp(re) * sin(im)) end
function tmp = code(re, im) tmp = exp(re) * sin(im); end
code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e^{re} \cdot \sin im
\end{array}
(FPCore (re im) :precision binary64 (* (exp re) (sin im)))
double code(double re, double im) {
return exp(re) * sin(im);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = exp(re) * sin(im)
end function
public static double code(double re, double im) {
return Math.exp(re) * Math.sin(im);
}
def code(re, im): return math.exp(re) * math.sin(im)
function code(re, im) return Float64(exp(re) * sin(im)) end
function tmp = code(re, im) tmp = exp(re) * sin(im); end
code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e^{re} \cdot \sin im
\end{array}
Initial program 100.0%
Final simplification100.0%
(FPCore (re im) :precision binary64 (if (or (<= (exp re) 0.999999998) (not (<= (exp re) 1.00000002))) (* (exp re) im) (sin im)))
double code(double re, double im) {
double tmp;
if ((exp(re) <= 0.999999998) || !(exp(re) <= 1.00000002)) {
tmp = exp(re) * im;
} else {
tmp = sin(im);
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if ((exp(re) <= 0.999999998d0) .or. (.not. (exp(re) <= 1.00000002d0))) then
tmp = exp(re) * im
else
tmp = sin(im)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if ((Math.exp(re) <= 0.999999998) || !(Math.exp(re) <= 1.00000002)) {
tmp = Math.exp(re) * im;
} else {
tmp = Math.sin(im);
}
return tmp;
}
def code(re, im): tmp = 0 if (math.exp(re) <= 0.999999998) or not (math.exp(re) <= 1.00000002): tmp = math.exp(re) * im else: tmp = math.sin(im) return tmp
function code(re, im) tmp = 0.0 if ((exp(re) <= 0.999999998) || !(exp(re) <= 1.00000002)) tmp = Float64(exp(re) * im); else tmp = sin(im); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if ((exp(re) <= 0.999999998) || ~((exp(re) <= 1.00000002))) tmp = exp(re) * im; else tmp = sin(im); end tmp_2 = tmp; end
code[re_, im_] := If[Or[LessEqual[N[Exp[re], $MachinePrecision], 0.999999998], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 1.00000002]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[Sin[im], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{re} \leq 0.999999998 \lor \neg \left(e^{re} \leq 1.00000002\right):\\
\;\;\;\;e^{re} \cdot im\\
\mathbf{else}:\\
\;\;\;\;\sin im\\
\end{array}
\end{array}
if (exp.f64 re) < 0.999999997999999946 or 1.0000000200000001 < (exp.f64 re) Initial program 100.0%
Taylor expanded in im around 0 88.2%
if 0.999999997999999946 < (exp.f64 re) < 1.0000000200000001Initial program 100.0%
Taylor expanded in re around 0 99.5%
Final simplification94.3%
(FPCore (re im)
:precision binary64
(if (<= re -1.6)
0.0
(if (or (<= re 0.059) (not (<= re 1.02e+103)))
(*
(sin im)
(+ (* (* re re) (+ (* re 0.16666666666666666) 0.5)) (+ re 1.0)))
(* (exp re) im))))
double code(double re, double im) {
double tmp;
if (re <= -1.6) {
tmp = 0.0;
} else if ((re <= 0.059) || !(re <= 1.02e+103)) {
tmp = sin(im) * (((re * re) * ((re * 0.16666666666666666) + 0.5)) + (re + 1.0));
} else {
tmp = exp(re) * im;
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-1.6d0)) then
tmp = 0.0d0
else if ((re <= 0.059d0) .or. (.not. (re <= 1.02d+103))) then
tmp = sin(im) * (((re * re) * ((re * 0.16666666666666666d0) + 0.5d0)) + (re + 1.0d0))
else
tmp = exp(re) * im
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.6) {
tmp = 0.0;
} else if ((re <= 0.059) || !(re <= 1.02e+103)) {
tmp = Math.sin(im) * (((re * re) * ((re * 0.16666666666666666) + 0.5)) + (re + 1.0));
} else {
tmp = Math.exp(re) * im;
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.6: tmp = 0.0 elif (re <= 0.059) or not (re <= 1.02e+103): tmp = math.sin(im) * (((re * re) * ((re * 0.16666666666666666) + 0.5)) + (re + 1.0)) else: tmp = math.exp(re) * im return tmp
function code(re, im) tmp = 0.0 if (re <= -1.6) tmp = 0.0; elseif ((re <= 0.059) || !(re <= 1.02e+103)) tmp = Float64(sin(im) * Float64(Float64(Float64(re * re) * Float64(Float64(re * 0.16666666666666666) + 0.5)) + Float64(re + 1.0))); else tmp = Float64(exp(re) * im); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.6) tmp = 0.0; elseif ((re <= 0.059) || ~((re <= 1.02e+103))) tmp = sin(im) * (((re * re) * ((re * 0.16666666666666666) + 0.5)) + (re + 1.0)); else tmp = exp(re) * im; end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.6], 0.0, If[Or[LessEqual[re, 0.059], N[Not[LessEqual[re, 1.02e+103]], $MachinePrecision]], N[(N[Sin[im], $MachinePrecision] * N[(N[(N[(re * re), $MachinePrecision] * N[(N[(re * 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + N[(re + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.6:\\
\;\;\;\;0\\
\mathbf{elif}\;re \leq 0.059 \lor \neg \left(re \leq 1.02 \cdot 10^{+103}\right):\\
\;\;\;\;\sin im \cdot \left(\left(re \cdot re\right) \cdot \left(re \cdot 0.16666666666666666 + 0.5\right) + \left(re + 1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;e^{re} \cdot im\\
\end{array}
\end{array}
if re < -1.6000000000000001Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -1.6000000000000001 < re < 0.058999999999999997 or 1.01999999999999991e103 < re Initial program 100.0%
Taylor expanded in re around 0 99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
distribute-rgt1-in99.8%
associate-*r*99.8%
associate-*r*99.8%
distribute-rgt-out99.8%
*-commutative99.8%
distribute-rgt-out99.8%
+-commutative99.8%
Simplified99.8%
if 0.058999999999999997 < re < 1.01999999999999991e103Initial program 99.9%
Taylor expanded in im around 0 79.1%
Final simplification97.9%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* re (* re 0.5))))
(if (<= re -80.0)
0.0
(if (<= re 4.4e-8)
(* (sin im) (+ (+ re 1.0) t_0))
(if (<= re 1.9e+154) (* (exp re) im) (* (sin im) t_0))))))
double code(double re, double im) {
double t_0 = re * (re * 0.5);
double tmp;
if (re <= -80.0) {
tmp = 0.0;
} else if (re <= 4.4e-8) {
tmp = sin(im) * ((re + 1.0) + t_0);
} else if (re <= 1.9e+154) {
tmp = exp(re) * im;
} else {
tmp = sin(im) * t_0;
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: t_0
real(8) :: tmp
t_0 = re * (re * 0.5d0)
if (re <= (-80.0d0)) then
tmp = 0.0d0
else if (re <= 4.4d-8) then
tmp = sin(im) * ((re + 1.0d0) + t_0)
else if (re <= 1.9d+154) then
tmp = exp(re) * im
else
tmp = sin(im) * t_0
end if
code = tmp
end function
public static double code(double re, double im) {
double t_0 = re * (re * 0.5);
double tmp;
if (re <= -80.0) {
tmp = 0.0;
} else if (re <= 4.4e-8) {
tmp = Math.sin(im) * ((re + 1.0) + t_0);
} else if (re <= 1.9e+154) {
tmp = Math.exp(re) * im;
} else {
tmp = Math.sin(im) * t_0;
}
return tmp;
}
def code(re, im): t_0 = re * (re * 0.5) tmp = 0 if re <= -80.0: tmp = 0.0 elif re <= 4.4e-8: tmp = math.sin(im) * ((re + 1.0) + t_0) elif re <= 1.9e+154: tmp = math.exp(re) * im else: tmp = math.sin(im) * t_0 return tmp
function code(re, im) t_0 = Float64(re * Float64(re * 0.5)) tmp = 0.0 if (re <= -80.0) tmp = 0.0; elseif (re <= 4.4e-8) tmp = Float64(sin(im) * Float64(Float64(re + 1.0) + t_0)); elseif (re <= 1.9e+154) tmp = Float64(exp(re) * im); else tmp = Float64(sin(im) * t_0); end return tmp end
function tmp_2 = code(re, im) t_0 = re * (re * 0.5); tmp = 0.0; if (re <= -80.0) tmp = 0.0; elseif (re <= 4.4e-8) tmp = sin(im) * ((re + 1.0) + t_0); elseif (re <= 1.9e+154) tmp = exp(re) * im; else tmp = sin(im) * t_0; end tmp_2 = tmp; end
code[re_, im_] := Block[{t$95$0 = N[(re * N[(re * 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[re, -80.0], 0.0, If[LessEqual[re, 4.4e-8], N[(N[Sin[im], $MachinePrecision] * N[(N[(re + 1.0), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.9e+154], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[(N[Sin[im], $MachinePrecision] * t$95$0), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := re \cdot \left(re \cdot 0.5\right)\\
\mathbf{if}\;re \leq -80:\\
\;\;\;\;0\\
\mathbf{elif}\;re \leq 4.4 \cdot 10^{-8}:\\
\;\;\;\;\sin im \cdot \left(\left(re + 1\right) + t_0\right)\\
\mathbf{elif}\;re \leq 1.9 \cdot 10^{+154}:\\
\;\;\;\;e^{re} \cdot im\\
\mathbf{else}:\\
\;\;\;\;\sin im \cdot t_0\\
\end{array}
\end{array}
if re < -80Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -80 < re < 4.3999999999999997e-8Initial program 100.0%
Taylor expanded in re around 0 99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
distribute-rgt1-in99.8%
associate-*r*99.8%
associate-*r*99.8%
distribute-rgt-out99.8%
*-commutative99.8%
distribute-rgt-out99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in re around 0 99.7%
associate-+r+99.7%
+-commutative99.7%
unpow299.7%
*-commutative99.7%
associate-*r*99.7%
Simplified99.7%
if 4.3999999999999997e-8 < re < 1.8999999999999999e154Initial program 99.9%
Taylor expanded in im around 0 84.9%
if 1.8999999999999999e154 < re Initial program 100.0%
Taylor expanded in re around 0 100.0%
associate-+r+100.0%
+-commutative100.0%
associate-+r+100.0%
distribute-rgt1-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
*-commutative100.0%
distribute-rgt-out100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in re around 0 100.0%
associate-+r+100.0%
+-commutative100.0%
unpow2100.0%
*-commutative100.0%
associate-*r*100.0%
Simplified100.0%
Taylor expanded in re around inf 100.0%
unpow2100.0%
*-commutative100.0%
associate-*r*100.0%
Simplified100.0%
Final simplification97.5%
(FPCore (re im)
:precision binary64
(if (<= re -1.0)
0.0
(if (<= re 4.4e-8)
(* (sin im) (+ re 1.0))
(if (<= re 1.9e+154) (* (exp re) im) (* (sin im) (* re (* re 0.5)))))))
double code(double re, double im) {
double tmp;
if (re <= -1.0) {
tmp = 0.0;
} else if (re <= 4.4e-8) {
tmp = sin(im) * (re + 1.0);
} else if (re <= 1.9e+154) {
tmp = exp(re) * im;
} else {
tmp = sin(im) * (re * (re * 0.5));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-1.0d0)) then
tmp = 0.0d0
else if (re <= 4.4d-8) then
tmp = sin(im) * (re + 1.0d0)
else if (re <= 1.9d+154) then
tmp = exp(re) * im
else
tmp = sin(im) * (re * (re * 0.5d0))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.0) {
tmp = 0.0;
} else if (re <= 4.4e-8) {
tmp = Math.sin(im) * (re + 1.0);
} else if (re <= 1.9e+154) {
tmp = Math.exp(re) * im;
} else {
tmp = Math.sin(im) * (re * (re * 0.5));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.0: tmp = 0.0 elif re <= 4.4e-8: tmp = math.sin(im) * (re + 1.0) elif re <= 1.9e+154: tmp = math.exp(re) * im else: tmp = math.sin(im) * (re * (re * 0.5)) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.0) tmp = 0.0; elseif (re <= 4.4e-8) tmp = Float64(sin(im) * Float64(re + 1.0)); elseif (re <= 1.9e+154) tmp = Float64(exp(re) * im); else tmp = Float64(sin(im) * Float64(re * Float64(re * 0.5))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.0) tmp = 0.0; elseif (re <= 4.4e-8) tmp = sin(im) * (re + 1.0); elseif (re <= 1.9e+154) tmp = exp(re) * im; else tmp = sin(im) * (re * (re * 0.5)); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.0], 0.0, If[LessEqual[re, 4.4e-8], N[(N[Sin[im], $MachinePrecision] * N[(re + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.9e+154], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[(N[Sin[im], $MachinePrecision] * N[(re * N[(re * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1:\\
\;\;\;\;0\\
\mathbf{elif}\;re \leq 4.4 \cdot 10^{-8}:\\
\;\;\;\;\sin im \cdot \left(re + 1\right)\\
\mathbf{elif}\;re \leq 1.9 \cdot 10^{+154}:\\
\;\;\;\;e^{re} \cdot im\\
\mathbf{else}:\\
\;\;\;\;\sin im \cdot \left(re \cdot \left(re \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if re < -1Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -1 < re < 4.3999999999999997e-8Initial program 100.0%
Taylor expanded in re around 0 99.6%
distribute-rgt1-in99.6%
Simplified99.6%
if 4.3999999999999997e-8 < re < 1.8999999999999999e154Initial program 99.9%
Taylor expanded in im around 0 84.9%
if 1.8999999999999999e154 < re Initial program 100.0%
Taylor expanded in re around 0 100.0%
associate-+r+100.0%
+-commutative100.0%
associate-+r+100.0%
distribute-rgt1-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
*-commutative100.0%
distribute-rgt-out100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in re around 0 100.0%
associate-+r+100.0%
+-commutative100.0%
unpow2100.0%
*-commutative100.0%
associate-*r*100.0%
Simplified100.0%
Taylor expanded in re around inf 100.0%
unpow2100.0%
*-commutative100.0%
associate-*r*100.0%
Simplified100.0%
Final simplification97.4%
(FPCore (re im) :precision binary64 (if (<= re -1.0) 0.0 (if (<= re 4.4e-8) (* (sin im) (+ re 1.0)) (* (exp re) im))))
double code(double re, double im) {
double tmp;
if (re <= -1.0) {
tmp = 0.0;
} else if (re <= 4.4e-8) {
tmp = sin(im) * (re + 1.0);
} else {
tmp = exp(re) * im;
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-1.0d0)) then
tmp = 0.0d0
else if (re <= 4.4d-8) then
tmp = sin(im) * (re + 1.0d0)
else
tmp = exp(re) * im
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.0) {
tmp = 0.0;
} else if (re <= 4.4e-8) {
tmp = Math.sin(im) * (re + 1.0);
} else {
tmp = Math.exp(re) * im;
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.0: tmp = 0.0 elif re <= 4.4e-8: tmp = math.sin(im) * (re + 1.0) else: tmp = math.exp(re) * im return tmp
function code(re, im) tmp = 0.0 if (re <= -1.0) tmp = 0.0; elseif (re <= 4.4e-8) tmp = Float64(sin(im) * Float64(re + 1.0)); else tmp = Float64(exp(re) * im); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.0) tmp = 0.0; elseif (re <= 4.4e-8) tmp = sin(im) * (re + 1.0); else tmp = exp(re) * im; end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.0], 0.0, If[LessEqual[re, 4.4e-8], N[(N[Sin[im], $MachinePrecision] * N[(re + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1:\\
\;\;\;\;0\\
\mathbf{elif}\;re \leq 4.4 \cdot 10^{-8}:\\
\;\;\;\;\sin im \cdot \left(re + 1\right)\\
\mathbf{else}:\\
\;\;\;\;e^{re} \cdot im\\
\end{array}
\end{array}
if re < -1Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -1 < re < 4.3999999999999997e-8Initial program 100.0%
Taylor expanded in re around 0 99.6%
distribute-rgt1-in99.6%
Simplified99.6%
if 4.3999999999999997e-8 < re Initial program 99.9%
Taylor expanded in im around 0 81.4%
Final simplification94.7%
(FPCore (re im) :precision binary64 (if (<= re -115.0) 0.0 (if (<= re 4.4e-8) (sin im) (+ im (* im (* re (+ 1.0 (* re 0.5))))))))
double code(double re, double im) {
double tmp;
if (re <= -115.0) {
tmp = 0.0;
} else if (re <= 4.4e-8) {
tmp = sin(im);
} else {
tmp = im + (im * (re * (1.0 + (re * 0.5))));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-115.0d0)) then
tmp = 0.0d0
else if (re <= 4.4d-8) then
tmp = sin(im)
else
tmp = im + (im * (re * (1.0d0 + (re * 0.5d0))))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -115.0) {
tmp = 0.0;
} else if (re <= 4.4e-8) {
tmp = Math.sin(im);
} else {
tmp = im + (im * (re * (1.0 + (re * 0.5))));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -115.0: tmp = 0.0 elif re <= 4.4e-8: tmp = math.sin(im) else: tmp = im + (im * (re * (1.0 + (re * 0.5)))) return tmp
function code(re, im) tmp = 0.0 if (re <= -115.0) tmp = 0.0; elseif (re <= 4.4e-8) tmp = sin(im); else tmp = Float64(im + Float64(im * Float64(re * Float64(1.0 + Float64(re * 0.5))))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -115.0) tmp = 0.0; elseif (re <= 4.4e-8) tmp = sin(im); else tmp = im + (im * (re * (1.0 + (re * 0.5)))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -115.0], 0.0, If[LessEqual[re, 4.4e-8], N[Sin[im], $MachinePrecision], N[(im + N[(im * N[(re * N[(1.0 + N[(re * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -115:\\
\;\;\;\;0\\
\mathbf{elif}\;re \leq 4.4 \cdot 10^{-8}:\\
\;\;\;\;\sin im\\
\mathbf{else}:\\
\;\;\;\;im + im \cdot \left(re \cdot \left(1 + re \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if re < -115Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -115 < re < 4.3999999999999997e-8Initial program 100.0%
Taylor expanded in re around 0 98.7%
if 4.3999999999999997e-8 < re Initial program 99.9%
Taylor expanded in re around 0 68.7%
associate-+r+68.7%
+-commutative68.7%
associate-+r+68.7%
distribute-rgt1-in68.7%
associate-*r*68.7%
associate-*r*68.7%
distribute-rgt-out68.7%
*-commutative68.7%
distribute-rgt-out68.7%
+-commutative68.7%
Simplified67.3%
Taylor expanded in re around 0 48.0%
associate-+r+48.0%
+-commutative48.0%
unpow248.0%
*-commutative48.0%
associate-*r*48.0%
Simplified48.0%
Taylor expanded in im around 0 40.4%
distribute-lft-in40.4%
*-rgt-identity40.4%
+-commutative40.4%
unpow240.4%
fma-def40.4%
Simplified40.4%
fma-udef40.4%
*-commutative40.4%
associate-*r*40.4%
+-commutative40.4%
*-commutative40.4%
distribute-rgt1-in40.4%
*-commutative40.4%
Applied egg-rr40.4%
Final simplification83.0%
(FPCore (re im)
:precision binary64
(let* ((t_0 (+ im (* re im))) (t_1 (* im (* (* re re) 0.5))))
(if (<= re -125.0)
0.0
(if (<= re 1.95e+114)
(+ im (* im (* re (+ 1.0 (* re 0.5)))))
(if (<= re 1.15e+147)
(/ (- (* t_0 t_0) (* t_1 t_1)) (- t_0 t_1))
(+ im (* (* re re) (* im 0.5))))))))
double code(double re, double im) {
double t_0 = im + (re * im);
double t_1 = im * ((re * re) * 0.5);
double tmp;
if (re <= -125.0) {
tmp = 0.0;
} else if (re <= 1.95e+114) {
tmp = im + (im * (re * (1.0 + (re * 0.5))));
} else if (re <= 1.15e+147) {
tmp = ((t_0 * t_0) - (t_1 * t_1)) / (t_0 - t_1);
} else {
tmp = im + ((re * re) * (im * 0.5));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = im + (re * im)
t_1 = im * ((re * re) * 0.5d0)
if (re <= (-125.0d0)) then
tmp = 0.0d0
else if (re <= 1.95d+114) then
tmp = im + (im * (re * (1.0d0 + (re * 0.5d0))))
else if (re <= 1.15d+147) then
tmp = ((t_0 * t_0) - (t_1 * t_1)) / (t_0 - t_1)
else
tmp = im + ((re * re) * (im * 0.5d0))
end if
code = tmp
end function
public static double code(double re, double im) {
double t_0 = im + (re * im);
double t_1 = im * ((re * re) * 0.5);
double tmp;
if (re <= -125.0) {
tmp = 0.0;
} else if (re <= 1.95e+114) {
tmp = im + (im * (re * (1.0 + (re * 0.5))));
} else if (re <= 1.15e+147) {
tmp = ((t_0 * t_0) - (t_1 * t_1)) / (t_0 - t_1);
} else {
tmp = im + ((re * re) * (im * 0.5));
}
return tmp;
}
def code(re, im): t_0 = im + (re * im) t_1 = im * ((re * re) * 0.5) tmp = 0 if re <= -125.0: tmp = 0.0 elif re <= 1.95e+114: tmp = im + (im * (re * (1.0 + (re * 0.5)))) elif re <= 1.15e+147: tmp = ((t_0 * t_0) - (t_1 * t_1)) / (t_0 - t_1) else: tmp = im + ((re * re) * (im * 0.5)) return tmp
function code(re, im) t_0 = Float64(im + Float64(re * im)) t_1 = Float64(im * Float64(Float64(re * re) * 0.5)) tmp = 0.0 if (re <= -125.0) tmp = 0.0; elseif (re <= 1.95e+114) tmp = Float64(im + Float64(im * Float64(re * Float64(1.0 + Float64(re * 0.5))))); elseif (re <= 1.15e+147) tmp = Float64(Float64(Float64(t_0 * t_0) - Float64(t_1 * t_1)) / Float64(t_0 - t_1)); else tmp = Float64(im + Float64(Float64(re * re) * Float64(im * 0.5))); end return tmp end
function tmp_2 = code(re, im) t_0 = im + (re * im); t_1 = im * ((re * re) * 0.5); tmp = 0.0; if (re <= -125.0) tmp = 0.0; elseif (re <= 1.95e+114) tmp = im + (im * (re * (1.0 + (re * 0.5)))); elseif (re <= 1.15e+147) tmp = ((t_0 * t_0) - (t_1 * t_1)) / (t_0 - t_1); else tmp = im + ((re * re) * (im * 0.5)); end tmp_2 = tmp; end
code[re_, im_] := Block[{t$95$0 = N[(im + N[(re * im), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(im * N[(N[(re * re), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[re, -125.0], 0.0, If[LessEqual[re, 1.95e+114], N[(im + N[(im * N[(re * N[(1.0 + N[(re * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.15e+147], N[(N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 - t$95$1), $MachinePrecision]), $MachinePrecision], N[(im + N[(N[(re * re), $MachinePrecision] * N[(im * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := im + re \cdot im\\
t_1 := im \cdot \left(\left(re \cdot re\right) \cdot 0.5\right)\\
\mathbf{if}\;re \leq -125:\\
\;\;\;\;0\\
\mathbf{elif}\;re \leq 1.95 \cdot 10^{+114}:\\
\;\;\;\;im + im \cdot \left(re \cdot \left(1 + re \cdot 0.5\right)\right)\\
\mathbf{elif}\;re \leq 1.15 \cdot 10^{+147}:\\
\;\;\;\;\frac{t_0 \cdot t_0 - t_1 \cdot t_1}{t_0 - t_1}\\
\mathbf{else}:\\
\;\;\;\;im + \left(re \cdot re\right) \cdot \left(im \cdot 0.5\right)\\
\end{array}
\end{array}
if re < -125Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -125 < re < 1.95e114Initial program 99.9%
Taylor expanded in re around 0 86.9%
associate-+r+86.9%
+-commutative86.9%
associate-+r+86.9%
distribute-rgt1-in86.9%
associate-*r*86.9%
associate-*r*86.9%
distribute-rgt-out86.9%
*-commutative86.9%
distribute-rgt-out86.9%
+-commutative86.9%
Simplified86.3%
Taylor expanded in re around 0 83.8%
associate-+r+83.8%
+-commutative83.8%
unpow283.8%
*-commutative83.8%
associate-*r*83.8%
Simplified83.8%
Taylor expanded in im around 0 42.4%
distribute-lft-in42.4%
*-rgt-identity42.4%
+-commutative42.4%
unpow242.4%
fma-def42.4%
Simplified42.4%
fma-udef42.4%
*-commutative42.4%
associate-*r*42.4%
+-commutative42.4%
*-commutative42.4%
distribute-rgt1-in42.4%
*-commutative42.4%
Applied egg-rr42.4%
if 1.95e114 < re < 1.15e147Initial program 100.0%
Taylor expanded in re around 0 100.0%
associate-+r+100.0%
+-commutative100.0%
associate-+r+100.0%
distribute-rgt1-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
*-commutative100.0%
distribute-rgt-out100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in re around 0 5.3%
associate-+r+5.3%
+-commutative5.3%
unpow25.3%
*-commutative5.3%
associate-*r*5.3%
Simplified5.3%
Taylor expanded in im around 0 4.5%
distribute-lft-in4.5%
*-rgt-identity4.5%
+-commutative4.5%
unpow24.5%
fma-def4.5%
Simplified4.5%
*-commutative4.5%
distribute-rgt1-in4.5%
fma-udef4.5%
*-commutative4.5%
associate-*r*4.5%
associate-+r+4.5%
+-commutative4.5%
+-commutative4.5%
*-commutative4.5%
distribute-lft-in4.5%
flip-+56.7%
Applied egg-rr56.7%
if 1.15e147 < re Initial program 100.0%
Taylor expanded in re around 0 100.0%
associate-+r+100.0%
+-commutative100.0%
associate-+r+100.0%
distribute-rgt1-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
*-commutative100.0%
distribute-rgt-out100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in re around 0 96.9%
associate-+r+96.9%
+-commutative96.9%
unpow296.9%
*-commutative96.9%
associate-*r*96.9%
Simplified96.9%
Taylor expanded in im around 0 74.3%
distribute-lft-in74.3%
*-rgt-identity74.3%
+-commutative74.3%
unpow274.3%
fma-def74.3%
Simplified74.3%
Taylor expanded in re around inf 74.3%
*-commutative74.3%
unpow274.3%
*-commutative74.3%
associate-*l*74.3%
Simplified74.3%
Final simplification57.4%
(FPCore (re im) :precision binary64 (if (<= re -105.0) 0.0 (* im (+ (+ re 1.0) (* re (* re 0.5))))))
double code(double re, double im) {
double tmp;
if (re <= -105.0) {
tmp = 0.0;
} else {
tmp = im * ((re + 1.0) + (re * (re * 0.5)));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-105.0d0)) then
tmp = 0.0d0
else
tmp = im * ((re + 1.0d0) + (re * (re * 0.5d0)))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -105.0) {
tmp = 0.0;
} else {
tmp = im * ((re + 1.0) + (re * (re * 0.5)));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -105.0: tmp = 0.0 else: tmp = im * ((re + 1.0) + (re * (re * 0.5))) return tmp
function code(re, im) tmp = 0.0 if (re <= -105.0) tmp = 0.0; else tmp = Float64(im * Float64(Float64(re + 1.0) + Float64(re * Float64(re * 0.5)))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -105.0) tmp = 0.0; else tmp = im * ((re + 1.0) + (re * (re * 0.5))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -105.0], 0.0, N[(im * N[(N[(re + 1.0), $MachinePrecision] + N[(re * N[(re * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -105:\\
\;\;\;\;0\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(\left(re + 1\right) + re \cdot \left(re \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if re < -105Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -105 < re Initial program 100.0%
Taylor expanded in re around 0 89.4%
associate-+r+89.4%
+-commutative89.4%
associate-+r+89.4%
distribute-rgt1-in89.4%
associate-*r*89.4%
associate-*r*89.4%
distribute-rgt-out89.4%
*-commutative89.4%
distribute-rgt-out89.4%
+-commutative89.4%
Simplified88.9%
Taylor expanded in re around 0 82.4%
associate-+r+82.4%
+-commutative82.4%
unpow282.4%
*-commutative82.4%
associate-*r*82.4%
Simplified82.4%
Taylor expanded in im around 0 45.5%
associate-+r+45.5%
unpow245.5%
*-commutative45.5%
associate-*r*45.5%
Simplified45.5%
Final simplification55.5%
(FPCore (re im) :precision binary64 (if (<= re -65.0) 0.0 (+ im (* im (* re (+ 1.0 (* re 0.5)))))))
double code(double re, double im) {
double tmp;
if (re <= -65.0) {
tmp = 0.0;
} else {
tmp = im + (im * (re * (1.0 + (re * 0.5))));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-65.0d0)) then
tmp = 0.0d0
else
tmp = im + (im * (re * (1.0d0 + (re * 0.5d0))))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -65.0) {
tmp = 0.0;
} else {
tmp = im + (im * (re * (1.0 + (re * 0.5))));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -65.0: tmp = 0.0 else: tmp = im + (im * (re * (1.0 + (re * 0.5)))) return tmp
function code(re, im) tmp = 0.0 if (re <= -65.0) tmp = 0.0; else tmp = Float64(im + Float64(im * Float64(re * Float64(1.0 + Float64(re * 0.5))))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -65.0) tmp = 0.0; else tmp = im + (im * (re * (1.0 + (re * 0.5)))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -65.0], 0.0, N[(im + N[(im * N[(re * N[(1.0 + N[(re * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -65:\\
\;\;\;\;0\\
\mathbf{else}:\\
\;\;\;\;im + im \cdot \left(re \cdot \left(1 + re \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if re < -65Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -65 < re Initial program 100.0%
Taylor expanded in re around 0 89.4%
associate-+r+89.4%
+-commutative89.4%
associate-+r+89.4%
distribute-rgt1-in89.4%
associate-*r*89.4%
associate-*r*89.4%
distribute-rgt-out89.4%
*-commutative89.4%
distribute-rgt-out89.4%
+-commutative89.4%
Simplified88.9%
Taylor expanded in re around 0 82.4%
associate-+r+82.4%
+-commutative82.4%
unpow282.4%
*-commutative82.4%
associate-*r*82.4%
Simplified82.4%
Taylor expanded in im around 0 45.5%
distribute-lft-in45.5%
*-rgt-identity45.5%
+-commutative45.5%
unpow245.5%
fma-def45.5%
Simplified45.5%
fma-udef45.5%
*-commutative45.5%
associate-*r*45.5%
+-commutative45.5%
*-commutative45.5%
distribute-rgt1-in45.5%
*-commutative45.5%
Applied egg-rr45.5%
Final simplification55.5%
(FPCore (re im) :precision binary64 (if (<= re -98.0) 0.0 (+ im (* (* re re) (* im 0.5)))))
double code(double re, double im) {
double tmp;
if (re <= -98.0) {
tmp = 0.0;
} else {
tmp = im + ((re * re) * (im * 0.5));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-98.0d0)) then
tmp = 0.0d0
else
tmp = im + ((re * re) * (im * 0.5d0))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -98.0) {
tmp = 0.0;
} else {
tmp = im + ((re * re) * (im * 0.5));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -98.0: tmp = 0.0 else: tmp = im + ((re * re) * (im * 0.5)) return tmp
function code(re, im) tmp = 0.0 if (re <= -98.0) tmp = 0.0; else tmp = Float64(im + Float64(Float64(re * re) * Float64(im * 0.5))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -98.0) tmp = 0.0; else tmp = im + ((re * re) * (im * 0.5)); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -98.0], 0.0, N[(im + N[(N[(re * re), $MachinePrecision] * N[(im * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -98:\\
\;\;\;\;0\\
\mathbf{else}:\\
\;\;\;\;im + \left(re \cdot re\right) \cdot \left(im \cdot 0.5\right)\\
\end{array}
\end{array}
if re < -98Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -98 < re Initial program 100.0%
Taylor expanded in re around 0 89.4%
associate-+r+89.4%
+-commutative89.4%
associate-+r+89.4%
distribute-rgt1-in89.4%
associate-*r*89.4%
associate-*r*89.4%
distribute-rgt-out89.4%
*-commutative89.4%
distribute-rgt-out89.4%
+-commutative89.4%
Simplified88.9%
Taylor expanded in re around 0 82.4%
associate-+r+82.4%
+-commutative82.4%
unpow282.4%
*-commutative82.4%
associate-*r*82.4%
Simplified82.4%
Taylor expanded in im around 0 45.5%
distribute-lft-in45.5%
*-rgt-identity45.5%
+-commutative45.5%
unpow245.5%
fma-def45.5%
Simplified45.5%
Taylor expanded in re around inf 44.9%
*-commutative44.9%
unpow244.9%
*-commutative44.9%
associate-*l*44.9%
Simplified44.9%
Final simplification55.0%
(FPCore (re im) :precision binary64 (if (<= re -58.0) 0.0 (if (<= re 1.0) im (* re im))))
double code(double re, double im) {
double tmp;
if (re <= -58.0) {
tmp = 0.0;
} else if (re <= 1.0) {
tmp = im;
} else {
tmp = re * im;
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-58.0d0)) then
tmp = 0.0d0
else if (re <= 1.0d0) then
tmp = im
else
tmp = re * im
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -58.0) {
tmp = 0.0;
} else if (re <= 1.0) {
tmp = im;
} else {
tmp = re * im;
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -58.0: tmp = 0.0 elif re <= 1.0: tmp = im else: tmp = re * im return tmp
function code(re, im) tmp = 0.0 if (re <= -58.0) tmp = 0.0; elseif (re <= 1.0) tmp = im; else tmp = Float64(re * im); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -58.0) tmp = 0.0; elseif (re <= 1.0) tmp = im; else tmp = re * im; end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -58.0], 0.0, If[LessEqual[re, 1.0], im, N[(re * im), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -58:\\
\;\;\;\;0\\
\mathbf{elif}\;re \leq 1:\\
\;\;\;\;im\\
\mathbf{else}:\\
\;\;\;\;re \cdot im\\
\end{array}
\end{array}
if re < -58Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -58 < re < 1Initial program 99.9%
Taylor expanded in im around 0 48.8%
Taylor expanded in re around 0 47.8%
if 1 < re Initial program 100.0%
Taylor expanded in re around 0 4.4%
distribute-rgt1-in4.4%
Simplified4.4%
Taylor expanded in re around inf 4.4%
*-commutative4.4%
Simplified4.4%
Taylor expanded in im around 0 10.3%
Final simplification47.4%
(FPCore (re im) :precision binary64 (if (<= re -1.3) 0.0 (+ im (* re im))))
double code(double re, double im) {
double tmp;
if (re <= -1.3) {
tmp = 0.0;
} else {
tmp = im + (re * im);
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-1.3d0)) then
tmp = 0.0d0
else
tmp = im + (re * im)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.3) {
tmp = 0.0;
} else {
tmp = im + (re * im);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.3: tmp = 0.0 else: tmp = im + (re * im) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.3) tmp = 0.0; else tmp = Float64(im + Float64(re * im)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.3) tmp = 0.0; else tmp = im + (re * im); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.3], 0.0, N[(im + N[(re * im), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.3:\\
\;\;\;\;0\\
\mathbf{else}:\\
\;\;\;\;im + re \cdot im\\
\end{array}
\end{array}
if re < -1.30000000000000004Initial program 100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
log1p-udef100.0%
add-exp-log100.0%
Applied egg-rr100.0%
Taylor expanded in im around 0 100.0%
if -1.30000000000000004 < re Initial program 100.0%
Taylor expanded in im around 0 59.2%
Taylor expanded in re around 0 36.2%
Final simplification47.9%
(FPCore (re im) :precision binary64 (if (<= re 1.0) im (* re im)))
double code(double re, double im) {
double tmp;
if (re <= 1.0) {
tmp = im;
} else {
tmp = re * im;
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= 1.0d0) then
tmp = im
else
tmp = re * im
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= 1.0) {
tmp = im;
} else {
tmp = re * im;
}
return tmp;
}
def code(re, im): tmp = 0 if re <= 1.0: tmp = im else: tmp = re * im return tmp
function code(re, im) tmp = 0.0 if (re <= 1.0) tmp = im; else tmp = Float64(re * im); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= 1.0) tmp = im; else tmp = re * im; end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, 1.0], im, N[(re * im), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq 1:\\
\;\;\;\;im\\
\mathbf{else}:\\
\;\;\;\;re \cdot im\\
\end{array}
\end{array}
if re < 1Initial program 100.0%
Taylor expanded in im around 0 61.6%
Taylor expanded in re around 0 36.7%
if 1 < re Initial program 100.0%
Taylor expanded in re around 0 4.4%
distribute-rgt1-in4.4%
Simplified4.4%
Taylor expanded in re around inf 4.4%
*-commutative4.4%
Simplified4.4%
Taylor expanded in im around 0 10.3%
Final simplification29.7%
(FPCore (re im) :precision binary64 im)
double code(double re, double im) {
return im;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = im
end function
public static double code(double re, double im) {
return im;
}
def code(re, im): return im
function code(re, im) return im end
function tmp = code(re, im) tmp = im; end
code[re_, im_] := im
\begin{array}{l}
\\
im
\end{array}
Initial program 100.0%
Taylor expanded in im around 0 66.7%
Taylor expanded in re around 0 27.6%
Final simplification27.6%
herbie shell --seed 2023275
(FPCore (re im)
:name "math.exp on complex, imaginary part"
:precision binary64
(* (exp re) (sin im)))