
(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 17 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%
(FPCore (re im) :precision binary64 (if (or (<= (exp re) 1.0) (not (<= (exp re) 2.0))) (* (exp re) im) (* (sin im) (+ re 1.0))))
double code(double re, double im) {
double tmp;
if ((exp(re) <= 1.0) || !(exp(re) <= 2.0)) {
tmp = exp(re) * im;
} else {
tmp = sin(im) * (re + 1.0);
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if ((exp(re) <= 1.0d0) .or. (.not. (exp(re) <= 2.0d0))) then
tmp = exp(re) * im
else
tmp = sin(im) * (re + 1.0d0)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if ((Math.exp(re) <= 1.0) || !(Math.exp(re) <= 2.0)) {
tmp = Math.exp(re) * im;
} else {
tmp = Math.sin(im) * (re + 1.0);
}
return tmp;
}
def code(re, im): tmp = 0 if (math.exp(re) <= 1.0) or not (math.exp(re) <= 2.0): tmp = math.exp(re) * im else: tmp = math.sin(im) * (re + 1.0) return tmp
function code(re, im) tmp = 0.0 if ((exp(re) <= 1.0) || !(exp(re) <= 2.0)) tmp = Float64(exp(re) * im); else tmp = Float64(sin(im) * Float64(re + 1.0)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if ((exp(re) <= 1.0) || ~((exp(re) <= 2.0))) tmp = exp(re) * im; else tmp = sin(im) * (re + 1.0); end tmp_2 = tmp; end
code[re_, im_] := If[Or[LessEqual[N[Exp[re], $MachinePrecision], 1.0], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 2.0]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[(N[Sin[im], $MachinePrecision] * N[(re + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{re} \leq 1 \lor \neg \left(e^{re} \leq 2\right):\\
\;\;\;\;e^{re} \cdot im\\
\mathbf{else}:\\
\;\;\;\;\sin im \cdot \left(re + 1\right)\\
\end{array}
\end{array}
if (exp.f64 re) < 1 or 2 < (exp.f64 re) Initial program 100.0%
Taylor expanded in im around 0
Simplified72.1%
if 1 < (exp.f64 re) < 2Initial program 99.7%
Taylor expanded in re around 0
+-commutativeN/A
+-lowering-+.f6491.0%
Simplified91.0%
Final simplification72.5%
(FPCore (re im) :precision binary64 (if (or (<= (exp re) 1.0) (not (<= (exp re) 2.0))) (* (exp re) im) (sin im)))
double code(double re, double im) {
double tmp;
if ((exp(re) <= 1.0) || !(exp(re) <= 2.0)) {
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) <= 1.0d0) .or. (.not. (exp(re) <= 2.0d0))) 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) <= 1.0) || !(Math.exp(re) <= 2.0)) {
tmp = Math.exp(re) * im;
} else {
tmp = Math.sin(im);
}
return tmp;
}
def code(re, im): tmp = 0 if (math.exp(re) <= 1.0) or not (math.exp(re) <= 2.0): tmp = math.exp(re) * im else: tmp = math.sin(im) return tmp
function code(re, im) tmp = 0.0 if ((exp(re) <= 1.0) || !(exp(re) <= 2.0)) 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) <= 1.0) || ~((exp(re) <= 2.0))) tmp = exp(re) * im; else tmp = sin(im); end tmp_2 = tmp; end
code[re_, im_] := If[Or[LessEqual[N[Exp[re], $MachinePrecision], 1.0], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 2.0]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[Sin[im], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{re} \leq 1 \lor \neg \left(e^{re} \leq 2\right):\\
\;\;\;\;e^{re} \cdot im\\
\mathbf{else}:\\
\;\;\;\;\sin im\\
\end{array}
\end{array}
if (exp.f64 re) < 1 or 2 < (exp.f64 re) Initial program 100.0%
Taylor expanded in im around 0
Simplified72.1%
if 1 < (exp.f64 re) < 2Initial program 99.7%
Taylor expanded in re around 0
sin-lowering-sin.f6472.4%
Simplified72.4%
Final simplification72.1%
(FPCore (re im)
:precision binary64
(if (or (<= re -0.05) (and (not (<= re 0.037)) (<= re 1e+103)))
(* (exp re) im)
(*
(sin im)
(+ 1.0 (* re (+ 1.0 (* re (+ 0.5 (* re 0.16666666666666666)))))))))
double code(double re, double im) {
double tmp;
if ((re <= -0.05) || (!(re <= 0.037) && (re <= 1e+103))) {
tmp = exp(re) * im;
} else {
tmp = sin(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666))))));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if ((re <= (-0.05d0)) .or. (.not. (re <= 0.037d0)) .and. (re <= 1d+103)) then
tmp = exp(re) * im
else
tmp = sin(im) * (1.0d0 + (re * (1.0d0 + (re * (0.5d0 + (re * 0.16666666666666666d0))))))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if ((re <= -0.05) || (!(re <= 0.037) && (re <= 1e+103))) {
tmp = Math.exp(re) * im;
} else {
tmp = Math.sin(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666))))));
}
return tmp;
}
def code(re, im): tmp = 0 if (re <= -0.05) or (not (re <= 0.037) and (re <= 1e+103)): tmp = math.exp(re) * im else: tmp = math.sin(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666)))))) return tmp
function code(re, im) tmp = 0.0 if ((re <= -0.05) || (!(re <= 0.037) && (re <= 1e+103))) tmp = Float64(exp(re) * im); else tmp = Float64(sin(im) * Float64(1.0 + Float64(re * Float64(1.0 + Float64(re * Float64(0.5 + Float64(re * 0.16666666666666666))))))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if ((re <= -0.05) || (~((re <= 0.037)) && (re <= 1e+103))) tmp = exp(re) * im; else tmp = sin(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666)))))); end tmp_2 = tmp; end
code[re_, im_] := If[Or[LessEqual[re, -0.05], And[N[Not[LessEqual[re, 0.037]], $MachinePrecision], LessEqual[re, 1e+103]]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[(N[Sin[im], $MachinePrecision] * N[(1.0 + N[(re * N[(1.0 + N[(re * N[(0.5 + N[(re * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -0.05 \lor \neg \left(re \leq 0.037\right) \land re \leq 10^{+103}:\\
\;\;\;\;e^{re} \cdot im\\
\mathbf{else}:\\
\;\;\;\;\sin im \cdot \left(1 + re \cdot \left(1 + re \cdot \left(0.5 + re \cdot 0.16666666666666666\right)\right)\right)\\
\end{array}
\end{array}
if re < -0.050000000000000003 or 0.0369999999999999982 < re < 1e103Initial program 100.0%
Taylor expanded in im around 0
Simplified95.5%
if -0.050000000000000003 < re < 0.0369999999999999982 or 1e103 < re Initial program 100.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64100.0%
Simplified100.0%
Final simplification98.4%
(FPCore (re im) :precision binary64 (if (or (<= re -1.3e-5) (not (<= re 0.0105))) (* (exp re) im) (* (sin im) (+ 1.0 (* re (+ 1.0 (* re 0.5)))))))
double code(double re, double im) {
double tmp;
if ((re <= -1.3e-5) || !(re <= 0.0105)) {
tmp = exp(re) * im;
} else {
tmp = sin(im) * (1.0 + (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 <= (-1.3d-5)) .or. (.not. (re <= 0.0105d0))) then
tmp = exp(re) * im
else
tmp = sin(im) * (1.0d0 + (re * (1.0d0 + (re * 0.5d0))))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if ((re <= -1.3e-5) || !(re <= 0.0105)) {
tmp = Math.exp(re) * im;
} else {
tmp = Math.sin(im) * (1.0 + (re * (1.0 + (re * 0.5))));
}
return tmp;
}
def code(re, im): tmp = 0 if (re <= -1.3e-5) or not (re <= 0.0105): tmp = math.exp(re) * im else: tmp = math.sin(im) * (1.0 + (re * (1.0 + (re * 0.5)))) return tmp
function code(re, im) tmp = 0.0 if ((re <= -1.3e-5) || !(re <= 0.0105)) tmp = Float64(exp(re) * im); else tmp = Float64(sin(im) * Float64(1.0 + Float64(re * Float64(1.0 + Float64(re * 0.5))))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if ((re <= -1.3e-5) || ~((re <= 0.0105))) tmp = exp(re) * im; else tmp = sin(im) * (1.0 + (re * (1.0 + (re * 0.5)))); end tmp_2 = tmp; end
code[re_, im_] := If[Or[LessEqual[re, -1.3e-5], N[Not[LessEqual[re, 0.0105]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[(N[Sin[im], $MachinePrecision] * N[(1.0 + N[(re * N[(1.0 + N[(re * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.3 \cdot 10^{-5} \lor \neg \left(re \leq 0.0105\right):\\
\;\;\;\;e^{re} \cdot im\\
\mathbf{else}:\\
\;\;\;\;\sin im \cdot \left(1 + re \cdot \left(1 + re \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if re < -1.29999999999999992e-5 or 0.0105000000000000007 < re Initial program 100.0%
Taylor expanded in im around 0
Simplified92.4%
if -1.29999999999999992e-5 < re < 0.0105000000000000007Initial program 100.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6499.8%
Simplified99.8%
Final simplification96.0%
(FPCore (re im)
:precision binary64
(let* ((t_0 (+ 1.0 (* re 0.5))) (t_1 (* re t_0)))
(if (<= re -68.0)
(* (+ re 1.0) (* im (* im (* im -0.16666666666666666))))
(if (<= re 145.0)
(sin im)
(if (<= re 1.65e+77)
(/
(* im (+ 1.0 (* t_1 (* re (* t_0 t_1)))))
(+ 1.0 (* t_1 (+ t_1 -1.0))))
(* im (* 0.16666666666666666 (* re (* re re)))))))))
double code(double re, double im) {
double t_0 = 1.0 + (re * 0.5);
double t_1 = re * t_0;
double tmp;
if (re <= -68.0) {
tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666)));
} else if (re <= 145.0) {
tmp = sin(im);
} else if (re <= 1.65e+77) {
tmp = (im * (1.0 + (t_1 * (re * (t_0 * t_1))))) / (1.0 + (t_1 * (t_1 + -1.0)));
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
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 = 1.0d0 + (re * 0.5d0)
t_1 = re * t_0
if (re <= (-68.0d0)) then
tmp = (re + 1.0d0) * (im * (im * (im * (-0.16666666666666666d0))))
else if (re <= 145.0d0) then
tmp = sin(im)
else if (re <= 1.65d+77) then
tmp = (im * (1.0d0 + (t_1 * (re * (t_0 * t_1))))) / (1.0d0 + (t_1 * (t_1 + (-1.0d0))))
else
tmp = im * (0.16666666666666666d0 * (re * (re * re)))
end if
code = tmp
end function
public static double code(double re, double im) {
double t_0 = 1.0 + (re * 0.5);
double t_1 = re * t_0;
double tmp;
if (re <= -68.0) {
tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666)));
} else if (re <= 145.0) {
tmp = Math.sin(im);
} else if (re <= 1.65e+77) {
tmp = (im * (1.0 + (t_1 * (re * (t_0 * t_1))))) / (1.0 + (t_1 * (t_1 + -1.0)));
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
return tmp;
}
def code(re, im): t_0 = 1.0 + (re * 0.5) t_1 = re * t_0 tmp = 0 if re <= -68.0: tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666))) elif re <= 145.0: tmp = math.sin(im) elif re <= 1.65e+77: tmp = (im * (1.0 + (t_1 * (re * (t_0 * t_1))))) / (1.0 + (t_1 * (t_1 + -1.0))) else: tmp = im * (0.16666666666666666 * (re * (re * re))) return tmp
function code(re, im) t_0 = Float64(1.0 + Float64(re * 0.5)) t_1 = Float64(re * t_0) tmp = 0.0 if (re <= -68.0) tmp = Float64(Float64(re + 1.0) * Float64(im * Float64(im * Float64(im * -0.16666666666666666)))); elseif (re <= 145.0) tmp = sin(im); elseif (re <= 1.65e+77) tmp = Float64(Float64(im * Float64(1.0 + Float64(t_1 * Float64(re * Float64(t_0 * t_1))))) / Float64(1.0 + Float64(t_1 * Float64(t_1 + -1.0)))); else tmp = Float64(im * Float64(0.16666666666666666 * Float64(re * Float64(re * re)))); end return tmp end
function tmp_2 = code(re, im) t_0 = 1.0 + (re * 0.5); t_1 = re * t_0; tmp = 0.0; if (re <= -68.0) tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666))); elseif (re <= 145.0) tmp = sin(im); elseif (re <= 1.65e+77) tmp = (im * (1.0 + (t_1 * (re * (t_0 * t_1))))) / (1.0 + (t_1 * (t_1 + -1.0))); else tmp = im * (0.16666666666666666 * (re * (re * re))); end tmp_2 = tmp; end
code[re_, im_] := Block[{t$95$0 = N[(1.0 + N[(re * 0.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(re * t$95$0), $MachinePrecision]}, If[LessEqual[re, -68.0], N[(N[(re + 1.0), $MachinePrecision] * N[(im * N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 145.0], N[Sin[im], $MachinePrecision], If[LessEqual[re, 1.65e+77], N[(N[(im * N[(1.0 + N[(t$95$1 * N[(re * N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(t$95$1 * N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im * N[(0.16666666666666666 * N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 1 + re \cdot 0.5\\
t_1 := re \cdot t\_0\\
\mathbf{if}\;re \leq -68:\\
\;\;\;\;\left(re + 1\right) \cdot \left(im \cdot \left(im \cdot \left(im \cdot -0.16666666666666666\right)\right)\right)\\
\mathbf{elif}\;re \leq 145:\\
\;\;\;\;\sin im\\
\mathbf{elif}\;re \leq 1.65 \cdot 10^{+77}:\\
\;\;\;\;\frac{im \cdot \left(1 + t\_1 \cdot \left(re \cdot \left(t\_0 \cdot t\_1\right)\right)\right)}{1 + t\_1 \cdot \left(t\_1 + -1\right)}\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(0.16666666666666666 \cdot \left(re \cdot \left(re \cdot re\right)\right)\right)\\
\end{array}
\end{array}
if re < -68Initial program 100.0%
Taylor expanded in re around 0
+-commutativeN/A
+-lowering-+.f643.1%
Simplified3.1%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f642.8%
Simplified2.8%
Taylor expanded in im around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6441.3%
Simplified41.3%
if -68 < re < 145Initial program 100.0%
Taylor expanded in re around 0
sin-lowering-sin.f6497.8%
Simplified97.8%
if 145 < re < 1.6499999999999999e77Initial program 100.0%
Taylor expanded in im around 0
Simplified81.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f643.0%
Simplified3.0%
flip3-+N/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr43.9%
if 1.6499999999999999e77 < re Initial program 100.0%
Taylor expanded in im around 0
Simplified86.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6475.1%
Simplified75.1%
Taylor expanded in re around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
metadata-evalN/A
associate-*r/N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6483.8%
Simplified83.8%
Taylor expanded in re around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6483.8%
Simplified83.8%
Final simplification76.7%
(FPCore (re im)
:precision binary64
(let* ((t_0 (+ 1.0 (* re 0.5))) (t_1 (* re t_0)))
(if (<= re -33.0)
(* (+ re 1.0) (* im (* im (* im -0.16666666666666666))))
(if (<= re 1.65e+77)
(/
(* im (+ 1.0 (* t_1 (* re (* t_0 t_1)))))
(+ 1.0 (* t_1 (+ t_1 -1.0))))
(* im (* 0.16666666666666666 (* re (* re re))))))))
double code(double re, double im) {
double t_0 = 1.0 + (re * 0.5);
double t_1 = re * t_0;
double tmp;
if (re <= -33.0) {
tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666)));
} else if (re <= 1.65e+77) {
tmp = (im * (1.0 + (t_1 * (re * (t_0 * t_1))))) / (1.0 + (t_1 * (t_1 + -1.0)));
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
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 = 1.0d0 + (re * 0.5d0)
t_1 = re * t_0
if (re <= (-33.0d0)) then
tmp = (re + 1.0d0) * (im * (im * (im * (-0.16666666666666666d0))))
else if (re <= 1.65d+77) then
tmp = (im * (1.0d0 + (t_1 * (re * (t_0 * t_1))))) / (1.0d0 + (t_1 * (t_1 + (-1.0d0))))
else
tmp = im * (0.16666666666666666d0 * (re * (re * re)))
end if
code = tmp
end function
public static double code(double re, double im) {
double t_0 = 1.0 + (re * 0.5);
double t_1 = re * t_0;
double tmp;
if (re <= -33.0) {
tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666)));
} else if (re <= 1.65e+77) {
tmp = (im * (1.0 + (t_1 * (re * (t_0 * t_1))))) / (1.0 + (t_1 * (t_1 + -1.0)));
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
return tmp;
}
def code(re, im): t_0 = 1.0 + (re * 0.5) t_1 = re * t_0 tmp = 0 if re <= -33.0: tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666))) elif re <= 1.65e+77: tmp = (im * (1.0 + (t_1 * (re * (t_0 * t_1))))) / (1.0 + (t_1 * (t_1 + -1.0))) else: tmp = im * (0.16666666666666666 * (re * (re * re))) return tmp
function code(re, im) t_0 = Float64(1.0 + Float64(re * 0.5)) t_1 = Float64(re * t_0) tmp = 0.0 if (re <= -33.0) tmp = Float64(Float64(re + 1.0) * Float64(im * Float64(im * Float64(im * -0.16666666666666666)))); elseif (re <= 1.65e+77) tmp = Float64(Float64(im * Float64(1.0 + Float64(t_1 * Float64(re * Float64(t_0 * t_1))))) / Float64(1.0 + Float64(t_1 * Float64(t_1 + -1.0)))); else tmp = Float64(im * Float64(0.16666666666666666 * Float64(re * Float64(re * re)))); end return tmp end
function tmp_2 = code(re, im) t_0 = 1.0 + (re * 0.5); t_1 = re * t_0; tmp = 0.0; if (re <= -33.0) tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666))); elseif (re <= 1.65e+77) tmp = (im * (1.0 + (t_1 * (re * (t_0 * t_1))))) / (1.0 + (t_1 * (t_1 + -1.0))); else tmp = im * (0.16666666666666666 * (re * (re * re))); end tmp_2 = tmp; end
code[re_, im_] := Block[{t$95$0 = N[(1.0 + N[(re * 0.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(re * t$95$0), $MachinePrecision]}, If[LessEqual[re, -33.0], N[(N[(re + 1.0), $MachinePrecision] * N[(im * N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.65e+77], N[(N[(im * N[(1.0 + N[(t$95$1 * N[(re * N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(t$95$1 * N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im * N[(0.16666666666666666 * N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 1 + re \cdot 0.5\\
t_1 := re \cdot t\_0\\
\mathbf{if}\;re \leq -33:\\
\;\;\;\;\left(re + 1\right) \cdot \left(im \cdot \left(im \cdot \left(im \cdot -0.16666666666666666\right)\right)\right)\\
\mathbf{elif}\;re \leq 1.65 \cdot 10^{+77}:\\
\;\;\;\;\frac{im \cdot \left(1 + t\_1 \cdot \left(re \cdot \left(t\_0 \cdot t\_1\right)\right)\right)}{1 + t\_1 \cdot \left(t\_1 + -1\right)}\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(0.16666666666666666 \cdot \left(re \cdot \left(re \cdot re\right)\right)\right)\\
\end{array}
\end{array}
if re < -33Initial program 100.0%
Taylor expanded in re around 0
+-commutativeN/A
+-lowering-+.f643.1%
Simplified3.1%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f642.8%
Simplified2.8%
Taylor expanded in im around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6441.3%
Simplified41.3%
if -33 < re < 1.6499999999999999e77Initial program 100.0%
Taylor expanded in im around 0
Simplified54.1%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6442.4%
Simplified42.4%
flip3-+N/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr48.2%
if 1.6499999999999999e77 < re Initial program 100.0%
Taylor expanded in im around 0
Simplified86.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6475.1%
Simplified75.1%
Taylor expanded in re around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
metadata-evalN/A
associate-*r/N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6483.8%
Simplified83.8%
Taylor expanded in re around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6483.8%
Simplified83.8%
Final simplification52.4%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* im (* im -0.16666666666666666))))
(if (<= re -75.0)
(* (+ re 1.0) (* im t_0))
(if (<= re 4.5e+56)
(* (+ 1.0 (* re (+ 1.0 (* re 0.5)))) (* im (+ 1.0 t_0)))
(*
im
(*
(* re (* re re))
(+
0.16666666666666666
(*
(+ -0.16666666666666666 (* (* im im) 0.008333333333333333))
(* 0.16666666666666666 (* im im))))))))))
double code(double re, double im) {
double t_0 = im * (im * -0.16666666666666666);
double tmp;
if (re <= -75.0) {
tmp = (re + 1.0) * (im * t_0);
} else if (re <= 4.5e+56) {
tmp = (1.0 + (re * (1.0 + (re * 0.5)))) * (im * (1.0 + t_0));
} else {
tmp = im * ((re * (re * re)) * (0.16666666666666666 + ((-0.16666666666666666 + ((im * im) * 0.008333333333333333)) * (0.16666666666666666 * (im * im)))));
}
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 = im * (im * (-0.16666666666666666d0))
if (re <= (-75.0d0)) then
tmp = (re + 1.0d0) * (im * t_0)
else if (re <= 4.5d+56) then
tmp = (1.0d0 + (re * (1.0d0 + (re * 0.5d0)))) * (im * (1.0d0 + t_0))
else
tmp = im * ((re * (re * re)) * (0.16666666666666666d0 + (((-0.16666666666666666d0) + ((im * im) * 0.008333333333333333d0)) * (0.16666666666666666d0 * (im * im)))))
end if
code = tmp
end function
public static double code(double re, double im) {
double t_0 = im * (im * -0.16666666666666666);
double tmp;
if (re <= -75.0) {
tmp = (re + 1.0) * (im * t_0);
} else if (re <= 4.5e+56) {
tmp = (1.0 + (re * (1.0 + (re * 0.5)))) * (im * (1.0 + t_0));
} else {
tmp = im * ((re * (re * re)) * (0.16666666666666666 + ((-0.16666666666666666 + ((im * im) * 0.008333333333333333)) * (0.16666666666666666 * (im * im)))));
}
return tmp;
}
def code(re, im): t_0 = im * (im * -0.16666666666666666) tmp = 0 if re <= -75.0: tmp = (re + 1.0) * (im * t_0) elif re <= 4.5e+56: tmp = (1.0 + (re * (1.0 + (re * 0.5)))) * (im * (1.0 + t_0)) else: tmp = im * ((re * (re * re)) * (0.16666666666666666 + ((-0.16666666666666666 + ((im * im) * 0.008333333333333333)) * (0.16666666666666666 * (im * im))))) return tmp
function code(re, im) t_0 = Float64(im * Float64(im * -0.16666666666666666)) tmp = 0.0 if (re <= -75.0) tmp = Float64(Float64(re + 1.0) * Float64(im * t_0)); elseif (re <= 4.5e+56) tmp = Float64(Float64(1.0 + Float64(re * Float64(1.0 + Float64(re * 0.5)))) * Float64(im * Float64(1.0 + t_0))); else tmp = Float64(im * Float64(Float64(re * Float64(re * re)) * Float64(0.16666666666666666 + Float64(Float64(-0.16666666666666666 + Float64(Float64(im * im) * 0.008333333333333333)) * Float64(0.16666666666666666 * Float64(im * im)))))); end return tmp end
function tmp_2 = code(re, im) t_0 = im * (im * -0.16666666666666666); tmp = 0.0; if (re <= -75.0) tmp = (re + 1.0) * (im * t_0); elseif (re <= 4.5e+56) tmp = (1.0 + (re * (1.0 + (re * 0.5)))) * (im * (1.0 + t_0)); else tmp = im * ((re * (re * re)) * (0.16666666666666666 + ((-0.16666666666666666 + ((im * im) * 0.008333333333333333)) * (0.16666666666666666 * (im * im))))); end tmp_2 = tmp; end
code[re_, im_] := Block[{t$95$0 = N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[re, -75.0], N[(N[(re + 1.0), $MachinePrecision] * N[(im * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 4.5e+56], N[(N[(1.0 + N[(re * N[(1.0 + N[(re * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(im * N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im * N[(N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(N[(-0.16666666666666666 + N[(N[(im * im), $MachinePrecision] * 0.008333333333333333), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 * N[(im * im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := im \cdot \left(im \cdot -0.16666666666666666\right)\\
\mathbf{if}\;re \leq -75:\\
\;\;\;\;\left(re + 1\right) \cdot \left(im \cdot t\_0\right)\\
\mathbf{elif}\;re \leq 4.5 \cdot 10^{+56}:\\
\;\;\;\;\left(1 + re \cdot \left(1 + re \cdot 0.5\right)\right) \cdot \left(im \cdot \left(1 + t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(\left(re \cdot \left(re \cdot re\right)\right) \cdot \left(0.16666666666666666 + \left(-0.16666666666666666 + \left(im \cdot im\right) \cdot 0.008333333333333333\right) \cdot \left(0.16666666666666666 \cdot \left(im \cdot im\right)\right)\right)\right)\\
\end{array}
\end{array}
if re < -75Initial program 100.0%
Taylor expanded in re around 0
+-commutativeN/A
+-lowering-+.f643.1%
Simplified3.1%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f642.8%
Simplified2.8%
Taylor expanded in im around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6441.3%
Simplified41.3%
if -75 < re < 4.5000000000000003e56Initial program 100.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6490.2%
Simplified90.2%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6446.8%
Simplified46.8%
if 4.5000000000000003e56 < re Initial program 100.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6481.4%
Simplified81.4%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified33.8%
Taylor expanded in re around inf
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6475.0%
Simplified75.0%
Final simplification51.0%
(FPCore (re im) :precision binary64 (if (<= re -1.6) (* (+ re 1.0) (* im (* im (* im -0.16666666666666666)))) (* im (+ 1.0 (* re (+ 1.0 (* re (+ 0.5 (* re 0.16666666666666666)))))))))
double code(double re, double im) {
double tmp;
if (re <= -1.6) {
tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666)));
} else {
tmp = im * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666))))));
}
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 = (re + 1.0d0) * (im * (im * (im * (-0.16666666666666666d0))))
else
tmp = im * (1.0d0 + (re * (1.0d0 + (re * (0.5d0 + (re * 0.16666666666666666d0))))))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.6) {
tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666)));
} else {
tmp = im * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666))))));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.6: tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666))) else: tmp = im * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666)))))) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.6) tmp = Float64(Float64(re + 1.0) * Float64(im * Float64(im * Float64(im * -0.16666666666666666)))); else tmp = Float64(im * Float64(1.0 + Float64(re * Float64(1.0 + Float64(re * Float64(0.5 + Float64(re * 0.16666666666666666))))))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.6) tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666))); else tmp = im * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666)))))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.6], N[(N[(re + 1.0), $MachinePrecision] * N[(im * N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im * N[(1.0 + N[(re * N[(1.0 + N[(re * N[(0.5 + N[(re * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.6:\\
\;\;\;\;\left(re + 1\right) \cdot \left(im \cdot \left(im \cdot \left(im \cdot -0.16666666666666666\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(1 + re \cdot \left(1 + re \cdot \left(0.5 + re \cdot 0.16666666666666666\right)\right)\right)\\
\end{array}
\end{array}
if re < -1.6000000000000001Initial program 100.0%
Taylor expanded in re around 0
+-commutativeN/A
+-lowering-+.f643.1%
Simplified3.1%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f642.8%
Simplified2.8%
Taylor expanded in im around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6440.8%
Simplified40.8%
if -1.6000000000000001 < re Initial program 100.0%
Taylor expanded in im around 0
Simplified61.1%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6452.5%
Simplified52.5%
Final simplification49.5%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* im (* im -0.16666666666666666))))
(if (<= re -50.0)
(* (+ re 1.0) (* im t_0))
(if (<= re 5.8e+56)
(* im (+ 1.0 t_0))
(* im (* 0.16666666666666666 (* re (* re re))))))))
double code(double re, double im) {
double t_0 = im * (im * -0.16666666666666666);
double tmp;
if (re <= -50.0) {
tmp = (re + 1.0) * (im * t_0);
} else if (re <= 5.8e+56) {
tmp = im * (1.0 + t_0);
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
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 = im * (im * (-0.16666666666666666d0))
if (re <= (-50.0d0)) then
tmp = (re + 1.0d0) * (im * t_0)
else if (re <= 5.8d+56) then
tmp = im * (1.0d0 + t_0)
else
tmp = im * (0.16666666666666666d0 * (re * (re * re)))
end if
code = tmp
end function
public static double code(double re, double im) {
double t_0 = im * (im * -0.16666666666666666);
double tmp;
if (re <= -50.0) {
tmp = (re + 1.0) * (im * t_0);
} else if (re <= 5.8e+56) {
tmp = im * (1.0 + t_0);
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
return tmp;
}
def code(re, im): t_0 = im * (im * -0.16666666666666666) tmp = 0 if re <= -50.0: tmp = (re + 1.0) * (im * t_0) elif re <= 5.8e+56: tmp = im * (1.0 + t_0) else: tmp = im * (0.16666666666666666 * (re * (re * re))) return tmp
function code(re, im) t_0 = Float64(im * Float64(im * -0.16666666666666666)) tmp = 0.0 if (re <= -50.0) tmp = Float64(Float64(re + 1.0) * Float64(im * t_0)); elseif (re <= 5.8e+56) tmp = Float64(im * Float64(1.0 + t_0)); else tmp = Float64(im * Float64(0.16666666666666666 * Float64(re * Float64(re * re)))); end return tmp end
function tmp_2 = code(re, im) t_0 = im * (im * -0.16666666666666666); tmp = 0.0; if (re <= -50.0) tmp = (re + 1.0) * (im * t_0); elseif (re <= 5.8e+56) tmp = im * (1.0 + t_0); else tmp = im * (0.16666666666666666 * (re * (re * re))); end tmp_2 = tmp; end
code[re_, im_] := Block[{t$95$0 = N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[re, -50.0], N[(N[(re + 1.0), $MachinePrecision] * N[(im * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 5.8e+56], N[(im * N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(im * N[(0.16666666666666666 * N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := im \cdot \left(im \cdot -0.16666666666666666\right)\\
\mathbf{if}\;re \leq -50:\\
\;\;\;\;\left(re + 1\right) \cdot \left(im \cdot t\_0\right)\\
\mathbf{elif}\;re \leq 5.8 \cdot 10^{+56}:\\
\;\;\;\;im \cdot \left(1 + t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(0.16666666666666666 \cdot \left(re \cdot \left(re \cdot re\right)\right)\right)\\
\end{array}
\end{array}
if re < -50Initial program 100.0%
Taylor expanded in re around 0
+-commutativeN/A
+-lowering-+.f643.1%
Simplified3.1%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f642.8%
Simplified2.8%
Taylor expanded in im around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6441.3%
Simplified41.3%
if -50 < re < 5.80000000000000014e56Initial program 100.0%
Taylor expanded in re around 0
sin-lowering-sin.f6489.0%
Simplified89.0%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6446.2%
Simplified46.2%
if 5.80000000000000014e56 < re Initial program 100.0%
Taylor expanded in im around 0
Simplified86.3%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6465.8%
Simplified65.8%
Taylor expanded in re around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
metadata-evalN/A
associate-*r/N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6473.2%
Simplified73.2%
Taylor expanded in re around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6473.2%
Simplified73.2%
(FPCore (re im) :precision binary64 (if (<= re -1.8) (* (+ re 1.0) (* im (* im (* im -0.16666666666666666)))) (+ im (* im (* 0.16666666666666666 (* re (* re re)))))))
double code(double re, double im) {
double tmp;
if (re <= -1.8) {
tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666)));
} else {
tmp = im + (im * (0.16666666666666666 * (re * (re * re))));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-1.8d0)) then
tmp = (re + 1.0d0) * (im * (im * (im * (-0.16666666666666666d0))))
else
tmp = im + (im * (0.16666666666666666d0 * (re * (re * re))))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.8) {
tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666)));
} else {
tmp = im + (im * (0.16666666666666666 * (re * (re * re))));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.8: tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666))) else: tmp = im + (im * (0.16666666666666666 * (re * (re * re)))) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.8) tmp = Float64(Float64(re + 1.0) * Float64(im * Float64(im * Float64(im * -0.16666666666666666)))); else tmp = Float64(im + Float64(im * Float64(0.16666666666666666 * Float64(re * Float64(re * re))))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.8) tmp = (re + 1.0) * (im * (im * (im * -0.16666666666666666))); else tmp = im + (im * (0.16666666666666666 * (re * (re * re)))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.8], N[(N[(re + 1.0), $MachinePrecision] * N[(im * N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im + N[(im * N[(0.16666666666666666 * N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.8:\\
\;\;\;\;\left(re + 1\right) \cdot \left(im \cdot \left(im \cdot \left(im \cdot -0.16666666666666666\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;im + im \cdot \left(0.16666666666666666 \cdot \left(re \cdot \left(re \cdot re\right)\right)\right)\\
\end{array}
\end{array}
if re < -1.80000000000000004Initial program 100.0%
Taylor expanded in re around 0
+-commutativeN/A
+-lowering-+.f643.1%
Simplified3.1%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f642.8%
Simplified2.8%
Taylor expanded in im around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6440.8%
Simplified40.8%
if -1.80000000000000004 < re Initial program 100.0%
Taylor expanded in im around 0
Simplified61.1%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6450.5%
Simplified50.5%
Taylor expanded in re around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
metadata-evalN/A
associate-*r/N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6437.8%
Simplified37.8%
Taylor expanded in re around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.0%
Simplified52.0%
(FPCore (re im) :precision binary64 (if (<= re 9e+56) (* im (+ 1.0 (* im (* im -0.16666666666666666)))) (* im (* 0.16666666666666666 (* re (* re re))))))
double code(double re, double im) {
double tmp;
if (re <= 9e+56) {
tmp = im * (1.0 + (im * (im * -0.16666666666666666)));
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= 9d+56) then
tmp = im * (1.0d0 + (im * (im * (-0.16666666666666666d0))))
else
tmp = im * (0.16666666666666666d0 * (re * (re * re)))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= 9e+56) {
tmp = im * (1.0 + (im * (im * -0.16666666666666666)));
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= 9e+56: tmp = im * (1.0 + (im * (im * -0.16666666666666666))) else: tmp = im * (0.16666666666666666 * (re * (re * re))) return tmp
function code(re, im) tmp = 0.0 if (re <= 9e+56) tmp = Float64(im * Float64(1.0 + Float64(im * Float64(im * -0.16666666666666666)))); else tmp = Float64(im * Float64(0.16666666666666666 * Float64(re * Float64(re * re)))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= 9e+56) tmp = im * (1.0 + (im * (im * -0.16666666666666666))); else tmp = im * (0.16666666666666666 * (re * (re * re))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, 9e+56], N[(im * N[(1.0 + N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im * N[(0.16666666666666666 * N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq 9 \cdot 10^{+56}:\\
\;\;\;\;im \cdot \left(1 + im \cdot \left(im \cdot -0.16666666666666666\right)\right)\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(0.16666666666666666 \cdot \left(re \cdot \left(re \cdot re\right)\right)\right)\\
\end{array}
\end{array}
if re < 9.0000000000000006e56Initial program 100.0%
Taylor expanded in re around 0
sin-lowering-sin.f6462.2%
Simplified62.2%
Taylor expanded in im around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6432.8%
Simplified32.8%
if 9.0000000000000006e56 < re Initial program 100.0%
Taylor expanded in im around 0
Simplified86.3%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6465.8%
Simplified65.8%
Taylor expanded in re around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
metadata-evalN/A
associate-*r/N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6473.2%
Simplified73.2%
Taylor expanded in re around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6473.2%
Simplified73.2%
(FPCore (re im) :precision binary64 (if (<= re 0.000235) im (* im (* 0.16666666666666666 (* re (* re re))))))
double code(double re, double im) {
double tmp;
if (re <= 0.000235) {
tmp = im;
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= 0.000235d0) then
tmp = im
else
tmp = im * (0.16666666666666666d0 * (re * (re * re)))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= 0.000235) {
tmp = im;
} else {
tmp = im * (0.16666666666666666 * (re * (re * re)));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= 0.000235: tmp = im else: tmp = im * (0.16666666666666666 * (re * (re * re))) return tmp
function code(re, im) tmp = 0.0 if (re <= 0.000235) tmp = im; else tmp = Float64(im * Float64(0.16666666666666666 * Float64(re * Float64(re * re)))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= 0.000235) tmp = im; else tmp = im * (0.16666666666666666 * (re * (re * re))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, 0.000235], im, N[(im * N[(0.16666666666666666 * N[(re * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq 0.000235:\\
\;\;\;\;im\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(0.16666666666666666 \cdot \left(re \cdot \left(re \cdot re\right)\right)\right)\\
\end{array}
\end{array}
if re < 2.34999999999999993e-4Initial program 100.0%
Taylor expanded in im around 0
Simplified67.0%
Taylor expanded in re around 0
Simplified33.4%
if 2.34999999999999993e-4 < re Initial program 100.0%
Taylor expanded in im around 0
Simplified83.1%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6452.2%
Simplified52.2%
Taylor expanded in re around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
metadata-evalN/A
associate-*r/N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6458.0%
Simplified58.0%
Taylor expanded in re around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6458.0%
Simplified58.0%
(FPCore (re im) :precision binary64 (if (<= re 0.000235) im (* im (* 0.5 (* re re)))))
double code(double re, double im) {
double tmp;
if (re <= 0.000235) {
tmp = im;
} else {
tmp = im * (0.5 * (re * re));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= 0.000235d0) then
tmp = im
else
tmp = im * (0.5d0 * (re * re))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= 0.000235) {
tmp = im;
} else {
tmp = im * (0.5 * (re * re));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= 0.000235: tmp = im else: tmp = im * (0.5 * (re * re)) return tmp
function code(re, im) tmp = 0.0 if (re <= 0.000235) tmp = im; else tmp = Float64(im * Float64(0.5 * Float64(re * re))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= 0.000235) tmp = im; else tmp = im * (0.5 * (re * re)); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, 0.000235], im, N[(im * N[(0.5 * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq 0.000235:\\
\;\;\;\;im\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(0.5 \cdot \left(re \cdot re\right)\right)\\
\end{array}
\end{array}
if re < 2.34999999999999993e-4Initial program 100.0%
Taylor expanded in im around 0
Simplified67.0%
Taylor expanded in re around 0
Simplified33.4%
if 2.34999999999999993e-4 < re Initial program 100.0%
Taylor expanded in im around 0
Simplified83.1%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6450.5%
Simplified50.5%
Taylor expanded in re around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6450.5%
Simplified50.5%
Final simplification37.8%
(FPCore (re im) :precision binary64 (if (<= im 7.5e+14) im (* re im)))
double code(double re, double im) {
double tmp;
if (im <= 7.5e+14) {
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 (im <= 7.5d+14) then
tmp = im
else
tmp = re * im
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (im <= 7.5e+14) {
tmp = im;
} else {
tmp = re * im;
}
return tmp;
}
def code(re, im): tmp = 0 if im <= 7.5e+14: tmp = im else: tmp = re * im return tmp
function code(re, im) tmp = 0.0 if (im <= 7.5e+14) tmp = im; else tmp = Float64(re * im); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (im <= 7.5e+14) tmp = im; else tmp = re * im; end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[im, 7.5e+14], im, N[(re * im), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;im \leq 7.5 \cdot 10^{+14}:\\
\;\;\;\;im\\
\mathbf{else}:\\
\;\;\;\;re \cdot im\\
\end{array}
\end{array}
if im < 7.5e14Initial program 100.0%
Taylor expanded in im around 0
Simplified79.3%
Taylor expanded in re around 0
Simplified32.6%
if 7.5e14 < im Initial program 100.0%
Taylor expanded in im around 0
Simplified43.6%
Taylor expanded in re around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6415.5%
Simplified15.5%
Taylor expanded in re around 0
Simplified10.7%
Taylor expanded in re around inf
*-lowering-*.f6411.0%
Simplified11.0%
Final simplification27.6%
(FPCore (re im) :precision binary64 (* im (+ re 1.0)))
double code(double re, double im) {
return im * (re + 1.0);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = im * (re + 1.0d0)
end function
public static double code(double re, double im) {
return im * (re + 1.0);
}
def code(re, im): return im * (re + 1.0)
function code(re, im) return Float64(im * Float64(re + 1.0)) end
function tmp = code(re, im) tmp = im * (re + 1.0); end
code[re_, im_] := N[(im * N[(re + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
im \cdot \left(re + 1\right)
\end{array}
Initial program 100.0%
Taylor expanded in im around 0
Simplified71.1%
Taylor expanded in re around 0
+-commutativeN/A
+-lowering-+.f6429.8%
Simplified29.8%
Final simplification29.8%
(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
Simplified71.1%
Taylor expanded in re around 0
Simplified25.7%
herbie shell --seed 2024130
(FPCore (re im)
:name "math.exp on complex, imaginary part"
:precision binary64
(* (exp re) (sin im)))