
(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 12 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) 0.0) (not (<= (exp re) 1.0))) (* (exp re) im) (* (sin im) (+ re 1.0))))
double code(double re, double im) {
double tmp;
if ((exp(re) <= 0.0) || !(exp(re) <= 1.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) <= 0.0d0) .or. (.not. (exp(re) <= 1.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) <= 0.0) || !(Math.exp(re) <= 1.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) <= 0.0) or not (math.exp(re) <= 1.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) <= 0.0) || !(exp(re) <= 1.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) <= 0.0) || ~((exp(re) <= 1.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], 0.0], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 1.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 0 \lor \neg \left(e^{re} \leq 1\right):\\
\;\;\;\;e^{re} \cdot im\\
\mathbf{else}:\\
\;\;\;\;\sin im \cdot \left(re + 1\right)\\
\end{array}
\end{array}
if (exp.f64 re) < 0.0 or 1 < (exp.f64 re) Initial program 100.0%
Taylor expanded in im around 0 84.2%
if 0.0 < (exp.f64 re) < 1Initial program 100.0%
Taylor expanded in re around 0 99.6%
distribute-rgt1-in99.6%
Simplified99.6%
Final simplification91.3%
(FPCore (re im) :precision binary64 (if (or (<= (exp re) 0.0) (not (<= (exp re) 1.0))) (* (exp re) im) (sin im)))
double code(double re, double im) {
double tmp;
if ((exp(re) <= 0.0) || !(exp(re) <= 1.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) <= 0.0d0) .or. (.not. (exp(re) <= 1.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) <= 0.0) || !(Math.exp(re) <= 1.0)) {
tmp = Math.exp(re) * im;
} else {
tmp = Math.sin(im);
}
return tmp;
}
def code(re, im): tmp = 0 if (math.exp(re) <= 0.0) or not (math.exp(re) <= 1.0): tmp = math.exp(re) * im else: tmp = math.sin(im) return tmp
function code(re, im) tmp = 0.0 if ((exp(re) <= 0.0) || !(exp(re) <= 1.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) <= 0.0) || ~((exp(re) <= 1.0))) tmp = exp(re) * im; else tmp = sin(im); end tmp_2 = tmp; end
code[re_, im_] := If[Or[LessEqual[N[Exp[re], $MachinePrecision], 0.0], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 1.0]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[Sin[im], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{re} \leq 0 \lor \neg \left(e^{re} \leq 1\right):\\
\;\;\;\;e^{re} \cdot im\\
\mathbf{else}:\\
\;\;\;\;\sin im\\
\end{array}
\end{array}
if (exp.f64 re) < 0.0 or 1 < (exp.f64 re) Initial program 100.0%
Taylor expanded in im around 0 84.2%
if 0.0 < (exp.f64 re) < 1Initial program 100.0%
Taylor expanded in re around 0 98.9%
Final simplification91.0%
(FPCore (re im)
:precision binary64
(if (<= re -1.8e+160)
(* re (/ im re))
(if (<= re 0.000146)
(sin im)
(+ im (* im (* re (+ 1.0 (* re (+ 0.5 (* re 0.16666666666666666))))))))))
double code(double re, double im) {
double tmp;
if (re <= -1.8e+160) {
tmp = re * (im / re);
} else if (re <= 0.000146) {
tmp = sin(im);
} else {
tmp = im + (im * (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.8d+160)) then
tmp = re * (im / re)
else if (re <= 0.000146d0) then
tmp = sin(im)
else
tmp = im + (im * (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.8e+160) {
tmp = re * (im / re);
} else if (re <= 0.000146) {
tmp = Math.sin(im);
} else {
tmp = im + (im * (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666))))));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.8e+160: tmp = re * (im / re) elif re <= 0.000146: tmp = math.sin(im) else: tmp = im + (im * (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666)))))) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.8e+160) tmp = Float64(re * Float64(im / re)); elseif (re <= 0.000146) tmp = sin(im); else tmp = Float64(im + Float64(im * 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.8e+160) tmp = re * (im / re); elseif (re <= 0.000146) tmp = sin(im); else tmp = im + (im * (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666)))))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.8e+160], N[(re * N[(im / re), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 0.000146], N[Sin[im], $MachinePrecision], N[(im + N[(im * 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.8 \cdot 10^{+160}:\\
\;\;\;\;re \cdot \frac{im}{re}\\
\mathbf{elif}\;re \leq 0.000146:\\
\;\;\;\;\sin im\\
\mathbf{else}:\\
\;\;\;\;im + im \cdot \left(re \cdot \left(1 + re \cdot \left(0.5 + re \cdot 0.16666666666666666\right)\right)\right)\\
\end{array}
\end{array}
if re < -1.80000000000000011e160Initial program 100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in re around 0 2.3%
Taylor expanded in re around inf 2.3%
Taylor expanded in re around 0 46.6%
if -1.80000000000000011e160 < re < 1.45999999999999998e-4Initial program 100.0%
Taylor expanded in re around 0 76.9%
if 1.45999999999999998e-4 < re Initial program 100.0%
Taylor expanded in im around 0 70.1%
Taylor expanded in re around 0 44.0%
Taylor expanded in im around 0 49.4%
Final simplification65.5%
(FPCore (re im)
:precision binary64
(if (<= re -1.8e+160)
(* re (/ im re))
(if (or (<= re 3.1e+231) (not (<= re 1.08e+279)))
(+ im (* re (* im (* re (+ 0.5 (* re 0.16666666666666666))))))
(* im (+ 1.0 (+ re (* re (* im (* im -0.16666666666666666)))))))))
double code(double re, double im) {
double tmp;
if (re <= -1.8e+160) {
tmp = re * (im / re);
} else if ((re <= 3.1e+231) || !(re <= 1.08e+279)) {
tmp = im + (re * (im * (re * (0.5 + (re * 0.16666666666666666)))));
} else {
tmp = im * (1.0 + (re + (re * (im * (im * -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.8d+160)) then
tmp = re * (im / re)
else if ((re <= 3.1d+231) .or. (.not. (re <= 1.08d+279))) then
tmp = im + (re * (im * (re * (0.5d0 + (re * 0.16666666666666666d0)))))
else
tmp = im * (1.0d0 + (re + (re * (im * (im * (-0.16666666666666666d0))))))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -1.8e+160) {
tmp = re * (im / re);
} else if ((re <= 3.1e+231) || !(re <= 1.08e+279)) {
tmp = im + (re * (im * (re * (0.5 + (re * 0.16666666666666666)))));
} else {
tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666)))));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.8e+160: tmp = re * (im / re) elif (re <= 3.1e+231) or not (re <= 1.08e+279): tmp = im + (re * (im * (re * (0.5 + (re * 0.16666666666666666))))) else: tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666))))) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.8e+160) tmp = Float64(re * Float64(im / re)); elseif ((re <= 3.1e+231) || !(re <= 1.08e+279)) tmp = Float64(im + Float64(re * Float64(im * Float64(re * Float64(0.5 + Float64(re * 0.16666666666666666)))))); else tmp = Float64(im * Float64(1.0 + Float64(re + Float64(re * Float64(im * Float64(im * -0.16666666666666666)))))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.8e+160) tmp = re * (im / re); elseif ((re <= 3.1e+231) || ~((re <= 1.08e+279))) tmp = im + (re * (im * (re * (0.5 + (re * 0.16666666666666666))))); else tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666))))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.8e+160], N[(re * N[(im / re), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[re, 3.1e+231], N[Not[LessEqual[re, 1.08e+279]], $MachinePrecision]], N[(im + N[(re * N[(im * N[(re * N[(0.5 + N[(re * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im * N[(1.0 + N[(re + N[(re * N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.8 \cdot 10^{+160}:\\
\;\;\;\;re \cdot \frac{im}{re}\\
\mathbf{elif}\;re \leq 3.1 \cdot 10^{+231} \lor \neg \left(re \leq 1.08 \cdot 10^{+279}\right):\\
\;\;\;\;im + re \cdot \left(im \cdot \left(re \cdot \left(0.5 + re \cdot 0.16666666666666666\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(1 + \left(re + re \cdot \left(im \cdot \left(im \cdot -0.16666666666666666\right)\right)\right)\right)\\
\end{array}
\end{array}
if re < -1.80000000000000011e160Initial program 100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in re around 0 2.3%
Taylor expanded in re around inf 2.3%
Taylor expanded in re around 0 46.6%
if -1.80000000000000011e160 < re < 3.0999999999999999e231 or 1.08000000000000004e279 < re Initial program 100.0%
Taylor expanded in im around 0 64.4%
Taylor expanded in re around 0 40.0%
pow140.0%
associate-*r*40.0%
*-commutative40.0%
Applied egg-rr40.0%
unpow140.0%
*-commutative40.0%
Simplified40.0%
distribute-rgt-in39.9%
associate-*r*39.9%
*-commutative39.9%
Applied egg-rr39.9%
Taylor expanded in re around inf 41.4%
cube-mult41.4%
unpow241.4%
associate-*l*39.7%
distribute-lft-in34.9%
unpow234.9%
*-commutative34.9%
associate-*r*34.9%
*-commutative34.9%
associate-*r*34.9%
associate-*r*34.9%
*-commutative34.9%
associate-*r*34.9%
unpow234.9%
associate-*l*39.8%
associate-*r/39.9%
*-commutative39.9%
associate-/l*39.9%
*-rgt-identity39.9%
associate-*r/39.9%
rgt-mult-inverse39.9%
*-rgt-identity39.9%
Simplified40.0%
Taylor expanded in im around 0 40.0%
if 3.0999999999999999e231 < re < 1.08000000000000004e279Initial program 100.0%
Taylor expanded in re around 0 6.9%
Taylor expanded in im around 0 75.7%
Taylor expanded in re around inf 75.7%
distribute-lft-out75.7%
unpow275.7%
associate-*r/75.7%
unpow275.7%
distribute-lft-out75.7%
+-commutative75.7%
Simplified75.7%
Taylor expanded in im around 0 75.7%
+-commutative75.7%
distribute-rgt-in75.7%
associate-*l/75.7%
*-lft-identity75.7%
*-lft-identity75.7%
distribute-lft-out75.7%
unpow275.7%
associate-*r/75.7%
associate-*r*75.7%
unpow275.7%
associate-*r*75.7%
distribute-lft-in75.7%
+-commutative75.7%
*-commutative75.7%
associate-*l*75.7%
Simplified75.7%
Taylor expanded in re around inf 75.7%
Final simplification41.9%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* re (+ 0.5 (* re 0.16666666666666666)))))
(if (<= re -1.8e+160)
(* re (/ im re))
(if (<= re 3.1e+231)
(+ im (* im (* re (+ 1.0 t_0))))
(if (<= re 1.08e+279)
(* im (+ 1.0 (+ re (* re (* im (* im -0.16666666666666666))))))
(+ im (* re (* im t_0))))))))
double code(double re, double im) {
double t_0 = re * (0.5 + (re * 0.16666666666666666));
double tmp;
if (re <= -1.8e+160) {
tmp = re * (im / re);
} else if (re <= 3.1e+231) {
tmp = im + (im * (re * (1.0 + t_0)));
} else if (re <= 1.08e+279) {
tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666)))));
} else {
tmp = im + (re * (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 * (0.5d0 + (re * 0.16666666666666666d0))
if (re <= (-1.8d+160)) then
tmp = re * (im / re)
else if (re <= 3.1d+231) then
tmp = im + (im * (re * (1.0d0 + t_0)))
else if (re <= 1.08d+279) then
tmp = im * (1.0d0 + (re + (re * (im * (im * (-0.16666666666666666d0))))))
else
tmp = im + (re * (im * t_0))
end if
code = tmp
end function
public static double code(double re, double im) {
double t_0 = re * (0.5 + (re * 0.16666666666666666));
double tmp;
if (re <= -1.8e+160) {
tmp = re * (im / re);
} else if (re <= 3.1e+231) {
tmp = im + (im * (re * (1.0 + t_0)));
} else if (re <= 1.08e+279) {
tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666)))));
} else {
tmp = im + (re * (im * t_0));
}
return tmp;
}
def code(re, im): t_0 = re * (0.5 + (re * 0.16666666666666666)) tmp = 0 if re <= -1.8e+160: tmp = re * (im / re) elif re <= 3.1e+231: tmp = im + (im * (re * (1.0 + t_0))) elif re <= 1.08e+279: tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666))))) else: tmp = im + (re * (im * t_0)) return tmp
function code(re, im) t_0 = Float64(re * Float64(0.5 + Float64(re * 0.16666666666666666))) tmp = 0.0 if (re <= -1.8e+160) tmp = Float64(re * Float64(im / re)); elseif (re <= 3.1e+231) tmp = Float64(im + Float64(im * Float64(re * Float64(1.0 + t_0)))); elseif (re <= 1.08e+279) tmp = Float64(im * Float64(1.0 + Float64(re + Float64(re * Float64(im * Float64(im * -0.16666666666666666)))))); else tmp = Float64(im + Float64(re * Float64(im * t_0))); end return tmp end
function tmp_2 = code(re, im) t_0 = re * (0.5 + (re * 0.16666666666666666)); tmp = 0.0; if (re <= -1.8e+160) tmp = re * (im / re); elseif (re <= 3.1e+231) tmp = im + (im * (re * (1.0 + t_0))); elseif (re <= 1.08e+279) tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666))))); else tmp = im + (re * (im * t_0)); end tmp_2 = tmp; end
code[re_, im_] := Block[{t$95$0 = N[(re * N[(0.5 + N[(re * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[re, -1.8e+160], N[(re * N[(im / re), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 3.1e+231], N[(im + N[(im * N[(re * N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.08e+279], N[(im * N[(1.0 + N[(re + N[(re * N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im + N[(re * N[(im * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := re \cdot \left(0.5 + re \cdot 0.16666666666666666\right)\\
\mathbf{if}\;re \leq -1.8 \cdot 10^{+160}:\\
\;\;\;\;re \cdot \frac{im}{re}\\
\mathbf{elif}\;re \leq 3.1 \cdot 10^{+231}:\\
\;\;\;\;im + im \cdot \left(re \cdot \left(1 + t\_0\right)\right)\\
\mathbf{elif}\;re \leq 1.08 \cdot 10^{+279}:\\
\;\;\;\;im \cdot \left(1 + \left(re + re \cdot \left(im \cdot \left(im \cdot -0.16666666666666666\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;im + re \cdot \left(im \cdot t\_0\right)\\
\end{array}
\end{array}
if re < -1.80000000000000011e160Initial program 100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in re around 0 2.3%
Taylor expanded in re around inf 2.3%
Taylor expanded in re around 0 46.6%
if -1.80000000000000011e160 < re < 3.0999999999999999e231Initial program 100.0%
Taylor expanded in im around 0 63.8%
Taylor expanded in re around 0 38.7%
Taylor expanded in im around 0 40.5%
if 3.0999999999999999e231 < re < 1.08000000000000004e279Initial program 100.0%
Taylor expanded in re around 0 6.9%
Taylor expanded in im around 0 75.7%
Taylor expanded in re around inf 75.7%
distribute-lft-out75.7%
unpow275.7%
associate-*r/75.7%
unpow275.7%
distribute-lft-out75.7%
+-commutative75.7%
Simplified75.7%
Taylor expanded in im around 0 75.7%
+-commutative75.7%
distribute-rgt-in75.7%
associate-*l/75.7%
*-lft-identity75.7%
*-lft-identity75.7%
distribute-lft-out75.7%
unpow275.7%
associate-*r/75.7%
associate-*r*75.7%
unpow275.7%
associate-*r*75.7%
distribute-lft-in75.7%
+-commutative75.7%
*-commutative75.7%
associate-*l*75.7%
Simplified75.7%
Taylor expanded in re around inf 75.7%
if 1.08000000000000004e279 < re Initial program 100.0%
Taylor expanded in im around 0 83.3%
Taylor expanded in re around 0 83.3%
pow183.3%
associate-*r*83.3%
*-commutative83.3%
Applied egg-rr83.3%
unpow183.3%
*-commutative83.3%
Simplified83.3%
distribute-rgt-in83.3%
associate-*r*83.3%
*-commutative83.3%
Applied egg-rr83.3%
Taylor expanded in re around inf 83.3%
cube-mult83.3%
unpow283.3%
associate-*l*83.3%
distribute-lft-in16.7%
unpow216.7%
*-commutative16.7%
associate-*r*16.7%
*-commutative16.7%
associate-*r*16.7%
associate-*r*16.7%
*-commutative16.7%
associate-*r*16.7%
unpow216.7%
associate-*l*83.3%
associate-*r/83.3%
*-commutative83.3%
associate-/l*83.3%
*-rgt-identity83.3%
associate-*r/83.3%
rgt-mult-inverse83.3%
*-rgt-identity83.3%
Simplified83.3%
Taylor expanded in im around 0 83.3%
Final simplification43.4%
(FPCore (re im)
:precision binary64
(if (<= re -1.8e+160)
(* re (/ im re))
(if (<= re 3.1e+231)
(+ im (* im (* re (+ 1.0 (* re 0.5)))))
(if (<= re 1.08e+279)
(* im (+ 1.0 (+ re (* re (* im (* im -0.16666666666666666))))))
(+ im (* re (* re (* im 0.5))))))))
double code(double re, double im) {
double tmp;
if (re <= -1.8e+160) {
tmp = re * (im / re);
} else if (re <= 3.1e+231) {
tmp = im + (im * (re * (1.0 + (re * 0.5))));
} else if (re <= 1.08e+279) {
tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666)))));
} 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 <= (-1.8d+160)) then
tmp = re * (im / re)
else if (re <= 3.1d+231) then
tmp = im + (im * (re * (1.0d0 + (re * 0.5d0))))
else if (re <= 1.08d+279) then
tmp = im * (1.0d0 + (re + (re * (im * (im * (-0.16666666666666666d0))))))
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 <= -1.8e+160) {
tmp = re * (im / re);
} else if (re <= 3.1e+231) {
tmp = im + (im * (re * (1.0 + (re * 0.5))));
} else if (re <= 1.08e+279) {
tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666)))));
} else {
tmp = im + (re * (re * (im * 0.5)));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.8e+160: tmp = re * (im / re) elif re <= 3.1e+231: tmp = im + (im * (re * (1.0 + (re * 0.5)))) elif re <= 1.08e+279: tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666))))) else: tmp = im + (re * (re * (im * 0.5))) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.8e+160) tmp = Float64(re * Float64(im / re)); elseif (re <= 3.1e+231) tmp = Float64(im + Float64(im * Float64(re * Float64(1.0 + Float64(re * 0.5))))); elseif (re <= 1.08e+279) tmp = Float64(im * Float64(1.0 + Float64(re + Float64(re * Float64(im * Float64(im * -0.16666666666666666)))))); else tmp = Float64(im + Float64(re * Float64(re * Float64(im * 0.5)))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.8e+160) tmp = re * (im / re); elseif (re <= 3.1e+231) tmp = im + (im * (re * (1.0 + (re * 0.5)))); elseif (re <= 1.08e+279) tmp = im * (1.0 + (re + (re * (im * (im * -0.16666666666666666))))); else tmp = im + (re * (re * (im * 0.5))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.8e+160], N[(re * N[(im / re), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 3.1e+231], N[(im + N[(im * N[(re * N[(1.0 + N[(re * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.08e+279], N[(im * N[(1.0 + N[(re + N[(re * N[(im * N[(im * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im + N[(re * N[(re * N[(im * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.8 \cdot 10^{+160}:\\
\;\;\;\;re \cdot \frac{im}{re}\\
\mathbf{elif}\;re \leq 3.1 \cdot 10^{+231}:\\
\;\;\;\;im + im \cdot \left(re \cdot \left(1 + re \cdot 0.5\right)\right)\\
\mathbf{elif}\;re \leq 1.08 \cdot 10^{+279}:\\
\;\;\;\;im \cdot \left(1 + \left(re + re \cdot \left(im \cdot \left(im \cdot -0.16666666666666666\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;im + re \cdot \left(re \cdot \left(im \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if re < -1.80000000000000011e160Initial program 100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in re around 0 2.3%
Taylor expanded in re around inf 2.3%
Taylor expanded in re around 0 46.6%
if -1.80000000000000011e160 < re < 3.0999999999999999e231Initial program 100.0%
Taylor expanded in im around 0 63.8%
Taylor expanded in re around 0 35.1%
*-commutative35.1%
Simplified35.1%
Taylor expanded in im around 0 37.8%
if 3.0999999999999999e231 < re < 1.08000000000000004e279Initial program 100.0%
Taylor expanded in re around 0 6.9%
Taylor expanded in im around 0 75.7%
Taylor expanded in re around inf 75.7%
distribute-lft-out75.7%
unpow275.7%
associate-*r/75.7%
unpow275.7%
distribute-lft-out75.7%
+-commutative75.7%
Simplified75.7%
Taylor expanded in im around 0 75.7%
+-commutative75.7%
distribute-rgt-in75.7%
associate-*l/75.7%
*-lft-identity75.7%
*-lft-identity75.7%
distribute-lft-out75.7%
unpow275.7%
associate-*r/75.7%
associate-*r*75.7%
unpow275.7%
associate-*r*75.7%
distribute-lft-in75.7%
+-commutative75.7%
*-commutative75.7%
associate-*l*75.7%
Simplified75.7%
Taylor expanded in re around inf 75.7%
if 1.08000000000000004e279 < re Initial program 100.0%
Taylor expanded in im around 0 83.3%
Taylor expanded in re around 0 83.3%
pow183.3%
associate-*r*83.3%
*-commutative83.3%
Applied egg-rr83.3%
unpow183.3%
*-commutative83.3%
Simplified83.3%
distribute-rgt-in83.3%
associate-*r*83.3%
*-commutative83.3%
Applied egg-rr83.3%
Taylor expanded in re around inf 83.3%
cube-mult83.3%
unpow283.3%
associate-*l*83.3%
distribute-lft-in16.7%
unpow216.7%
*-commutative16.7%
associate-*r*16.7%
*-commutative16.7%
associate-*r*16.7%
associate-*r*16.7%
*-commutative16.7%
associate-*r*16.7%
unpow216.7%
associate-*l*83.3%
associate-*r/83.3%
*-commutative83.3%
associate-/l*83.3%
*-rgt-identity83.3%
associate-*r/83.3%
rgt-mult-inverse83.3%
*-rgt-identity83.3%
Simplified83.3%
Taylor expanded in re around 0 83.3%
associate-*r*83.3%
*-commutative83.3%
*-commutative83.3%
Simplified83.3%
Final simplification41.2%
(FPCore (re im) :precision binary64 (if (<= re -1.8e+160) (* re (/ im re)) (+ im (* im (* re (+ 1.0 (* re 0.5)))))))
double code(double re, double im) {
double tmp;
if (re <= -1.8e+160) {
tmp = re * (im / re);
} 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 <= (-1.8d+160)) then
tmp = re * (im / re)
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 <= -1.8e+160) {
tmp = re * (im / re);
} else {
tmp = im + (im * (re * (1.0 + (re * 0.5))));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.8e+160: tmp = re * (im / re) else: tmp = im + (im * (re * (1.0 + (re * 0.5)))) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.8e+160) tmp = Float64(re * Float64(im / re)); 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 <= -1.8e+160) tmp = re * (im / re); else tmp = im + (im * (re * (1.0 + (re * 0.5)))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.8e+160], N[(re * N[(im / re), $MachinePrecision]), $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 -1.8 \cdot 10^{+160}:\\
\;\;\;\;re \cdot \frac{im}{re}\\
\mathbf{else}:\\
\;\;\;\;im + im \cdot \left(re \cdot \left(1 + re \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if re < -1.80000000000000011e160Initial program 100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in re around 0 2.3%
Taylor expanded in re around inf 2.3%
Taylor expanded in re around 0 46.6%
if -1.80000000000000011e160 < re Initial program 100.0%
Taylor expanded in im around 0 63.0%
Taylor expanded in re around 0 36.0%
*-commutative36.0%
Simplified36.0%
Taylor expanded in im around 0 38.6%
Final simplification39.6%
(FPCore (re im) :precision binary64 (if (<= re -1.8e+160) (* re (/ im re)) (+ im (* re (* re (* im 0.5))))))
double code(double re, double im) {
double tmp;
if (re <= -1.8e+160) {
tmp = re * (im / re);
} 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 <= (-1.8d+160)) then
tmp = re * (im / re)
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 <= -1.8e+160) {
tmp = re * (im / re);
} else {
tmp = im + (re * (re * (im * 0.5)));
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -1.8e+160: tmp = re * (im / re) else: tmp = im + (re * (re * (im * 0.5))) return tmp
function code(re, im) tmp = 0.0 if (re <= -1.8e+160) tmp = Float64(re * Float64(im / re)); else tmp = Float64(im + Float64(re * Float64(re * Float64(im * 0.5)))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -1.8e+160) tmp = re * (im / re); else tmp = im + (re * (re * (im * 0.5))); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -1.8e+160], N[(re * N[(im / re), $MachinePrecision]), $MachinePrecision], N[(im + N[(re * N[(re * N[(im * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -1.8 \cdot 10^{+160}:\\
\;\;\;\;re \cdot \frac{im}{re}\\
\mathbf{else}:\\
\;\;\;\;im + re \cdot \left(re \cdot \left(im \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if re < -1.80000000000000011e160Initial program 100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in re around 0 2.3%
Taylor expanded in re around inf 2.3%
Taylor expanded in re around 0 46.6%
if -1.80000000000000011e160 < re Initial program 100.0%
Taylor expanded in im around 0 63.0%
Taylor expanded in re around 0 39.4%
pow139.4%
associate-*r*39.4%
*-commutative39.4%
Applied egg-rr39.4%
unpow139.4%
*-commutative39.4%
Simplified39.4%
distribute-rgt-in39.4%
associate-*r*39.4%
*-commutative39.4%
Applied egg-rr39.4%
Taylor expanded in re around inf 40.8%
cube-mult40.8%
unpow240.8%
associate-*l*39.1%
distribute-lft-in34.1%
unpow234.1%
*-commutative34.1%
associate-*r*34.1%
*-commutative34.1%
associate-*r*34.1%
associate-*r*34.1%
*-commutative34.1%
associate-*r*34.1%
unpow234.1%
associate-*l*39.3%
associate-*r/39.4%
*-commutative39.4%
associate-/l*39.4%
*-rgt-identity39.4%
associate-*r/39.4%
rgt-mult-inverse39.4%
*-rgt-identity39.4%
Simplified39.4%
Taylor expanded in re around 0 36.0%
associate-*r*36.0%
*-commutative36.0%
*-commutative36.0%
Simplified36.0%
(FPCore (re im) :precision binary64 (if (<= im 0.056) (* re (/ im re)) (* re im)))
double code(double re, double im) {
double tmp;
if (im <= 0.056) {
tmp = re * (im / re);
} 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 <= 0.056d0) then
tmp = re * (im / re)
else
tmp = re * im
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (im <= 0.056) {
tmp = re * (im / re);
} else {
tmp = re * im;
}
return tmp;
}
def code(re, im): tmp = 0 if im <= 0.056: tmp = re * (im / re) else: tmp = re * im return tmp
function code(re, im) tmp = 0.0 if (im <= 0.056) tmp = Float64(re * Float64(im / re)); else tmp = Float64(re * im); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (im <= 0.056) tmp = re * (im / re); else tmp = re * im; end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[im, 0.056], N[(re * N[(im / re), $MachinePrecision]), $MachinePrecision], N[(re * im), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;im \leq 0.056:\\
\;\;\;\;re \cdot \frac{im}{re}\\
\mathbf{else}:\\
\;\;\;\;re \cdot im\\
\end{array}
\end{array}
if im < 0.0560000000000000012Initial program 100.0%
Taylor expanded in im around 0 76.6%
Taylor expanded in re around 0 32.8%
Taylor expanded in re around inf 32.7%
Taylor expanded in re around 0 38.7%
if 0.0560000000000000012 < im Initial program 100.0%
Taylor expanded in re around 0 48.7%
distribute-rgt1-in48.7%
Simplified48.7%
Taylor expanded in re around inf 3.7%
Taylor expanded in im around 0 9.0%
Final simplification31.0%
(FPCore (re im) :precision binary64 (if (<= im 0.056) im (* re im)))
double code(double re, double im) {
double tmp;
if (im <= 0.056) {
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 <= 0.056d0) 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 <= 0.056) {
tmp = im;
} else {
tmp = re * im;
}
return tmp;
}
def code(re, im): tmp = 0 if im <= 0.056: tmp = im else: tmp = re * im return tmp
function code(re, im) tmp = 0.0 if (im <= 0.056) tmp = im; else tmp = Float64(re * im); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (im <= 0.056) tmp = im; else tmp = re * im; end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[im, 0.056], im, N[(re * im), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;im \leq 0.056:\\
\;\;\;\;im\\
\mathbf{else}:\\
\;\;\;\;re \cdot im\\
\end{array}
\end{array}
if im < 0.0560000000000000012Initial program 100.0%
Taylor expanded in im around 0 76.6%
Taylor expanded in re around 0 30.9%
if 0.0560000000000000012 < im Initial program 100.0%
Taylor expanded in re around 0 48.7%
distribute-rgt1-in48.7%
Simplified48.7%
Taylor expanded in re around inf 3.7%
Taylor expanded in im around 0 9.0%
Final simplification25.3%
(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 67.7%
Taylor expanded in re around 0 23.6%
herbie shell --seed 2024107
(FPCore (re im)
:name "math.exp on complex, imaginary part"
:precision binary64
(* (exp re) (sin im)))