
(FPCore (re im) :precision binary64 (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))
double code(double re, double im) {
return (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (0.5d0 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function
public static double code(double re, double im) {
return (0.5 * Math.sin(re)) * (Math.exp((0.0 - im)) + Math.exp(im));
}
def code(re, im): return (0.5 * math.sin(re)) * (math.exp((0.0 - im)) + math.exp(im))
function code(re, im) return Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(0.0 - im)) + exp(im))) end
function tmp = code(re, im) tmp = (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im)); end
code[re_, im_] := N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(0.0 - im), $MachinePrecision]], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot \sin re\right) \cdot \left(e^{0 - im} + e^{im}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (re im) :precision binary64 (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))
double code(double re, double im) {
return (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (0.5d0 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function
public static double code(double re, double im) {
return (0.5 * Math.sin(re)) * (Math.exp((0.0 - im)) + Math.exp(im));
}
def code(re, im): return (0.5 * math.sin(re)) * (math.exp((0.0 - im)) + math.exp(im))
function code(re, im) return Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(0.0 - im)) + exp(im))) end
function tmp = code(re, im) tmp = (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im)); end
code[re_, im_] := N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(0.0 - im), $MachinePrecision]], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot \sin re\right) \cdot \left(e^{0 - im} + e^{im}\right)
\end{array}
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (* (sin re) (fma 0.5 (exp im_m) (/ 0.5 (exp im_m)))))
im_m = fabs(im);
double code(double re, double im_m) {
return sin(re) * fma(0.5, exp(im_m), (0.5 / exp(im_m)));
}
im_m = abs(im) function code(re, im_m) return Float64(sin(re) * fma(0.5, exp(im_m), Float64(0.5 / exp(im_m)))) end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[(N[Sin[re], $MachinePrecision] * N[(0.5 * N[Exp[im$95$m], $MachinePrecision] + N[(0.5 / N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
\sin re \cdot \mathsf{fma}\left(0.5, e^{im\_m}, \frac{0.5}{e^{im\_m}}\right)
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Final simplification100.0%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (* (* (sin re) 0.5) (+ (exp im_m) (exp (- im_m)))))
im_m = fabs(im);
double code(double re, double im_m) {
return (sin(re) * 0.5) * (exp(im_m) + exp(-im_m));
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = (sin(re) * 0.5d0) * (exp(im_m) + exp(-im_m))
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return (Math.sin(re) * 0.5) * (Math.exp(im_m) + Math.exp(-im_m));
}
im_m = math.fabs(im) def code(re, im_m): return (math.sin(re) * 0.5) * (math.exp(im_m) + math.exp(-im_m))
im_m = abs(im) function code(re, im_m) return Float64(Float64(sin(re) * 0.5) * Float64(exp(im_m) + exp(Float64(-im_m)))) end
im_m = abs(im); function tmp = code(re, im_m) tmp = (sin(re) * 0.5) * (exp(im_m) + exp(-im_m)); end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Exp[im$95$m], $MachinePrecision] + N[Exp[(-im$95$m)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
\left(\sin re \cdot 0.5\right) \cdot \left(e^{im\_m} + e^{-im\_m}\right)
\end{array}
Initial program 100.0%
distribute-rgt-in100.0%
cancel-sign-sub100.0%
distribute-rgt-out--100.0%
sub-neg100.0%
remove-double-neg100.0%
neg-sub0100.0%
Simplified100.0%
Final simplification100.0%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (* (sin re) (+ 0.5 (* 0.5 (exp im_m)))))
im_m = fabs(im);
double code(double re, double im_m) {
return sin(re) * (0.5 + (0.5 * exp(im_m)));
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = sin(re) * (0.5d0 + (0.5d0 * exp(im_m)))
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return Math.sin(re) * (0.5 + (0.5 * Math.exp(im_m)));
}
im_m = math.fabs(im) def code(re, im_m): return math.sin(re) * (0.5 + (0.5 * math.exp(im_m)))
im_m = abs(im) function code(re, im_m) return Float64(sin(re) * Float64(0.5 + Float64(0.5 * exp(im_m)))) end
im_m = abs(im); function tmp = code(re, im_m) tmp = sin(re) * (0.5 + (0.5 * exp(im_m))); end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[(N[Sin[re], $MachinePrecision] * N[(0.5 + N[(0.5 * N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
\sin re \cdot \left(0.5 + 0.5 \cdot e^{im\_m}\right)
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 74.8%
fma-undefine74.8%
Applied egg-rr74.8%
Final simplification74.8%
im_m = (fabs.f64 im)
(FPCore (re im_m)
:precision binary64
(if (<= im_m 1.8)
(sin re)
(if (<= im_m 1.3e+103)
(* re (+ 0.5 (* 0.5 (exp im_m))))
(*
(sin re)
(+
1.0
(* im_m (+ 0.5 (* im_m (+ 0.25 (* im_m 0.08333333333333333))))))))))im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 1.8) {
tmp = sin(re);
} else if (im_m <= 1.3e+103) {
tmp = re * (0.5 + (0.5 * exp(im_m)));
} else {
tmp = sin(re) * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333))))));
}
return tmp;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 1.8d0) then
tmp = sin(re)
else if (im_m <= 1.3d+103) then
tmp = re * (0.5d0 + (0.5d0 * exp(im_m)))
else
tmp = sin(re) * (1.0d0 + (im_m * (0.5d0 + (im_m * (0.25d0 + (im_m * 0.08333333333333333d0))))))
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 1.8) {
tmp = Math.sin(re);
} else if (im_m <= 1.3e+103) {
tmp = re * (0.5 + (0.5 * Math.exp(im_m)));
} else {
tmp = Math.sin(re) * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333))))));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 1.8: tmp = math.sin(re) elif im_m <= 1.3e+103: tmp = re * (0.5 + (0.5 * math.exp(im_m))) else: tmp = math.sin(re) * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333)))))) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 1.8) tmp = sin(re); elseif (im_m <= 1.3e+103) tmp = Float64(re * Float64(0.5 + Float64(0.5 * exp(im_m)))); else tmp = Float64(sin(re) * Float64(1.0 + Float64(im_m * Float64(0.5 + Float64(im_m * Float64(0.25 + Float64(im_m * 0.08333333333333333))))))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 1.8) tmp = sin(re); elseif (im_m <= 1.3e+103) tmp = re * (0.5 + (0.5 * exp(im_m))); else tmp = sin(re) * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333)))))); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 1.8], N[Sin[re], $MachinePrecision], If[LessEqual[im$95$m, 1.3e+103], N[(re * N[(0.5 + N[(0.5 * N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(1.0 + N[(im$95$m * N[(0.5 + N[(im$95$m * N[(0.25 + N[(im$95$m * 0.08333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 1.8:\\
\;\;\;\;\sin re\\
\mathbf{elif}\;im\_m \leq 1.3 \cdot 10^{+103}:\\
\;\;\;\;re \cdot \left(0.5 + 0.5 \cdot e^{im\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\sin re \cdot \left(1 + im\_m \cdot \left(0.5 + im\_m \cdot \left(0.25 + im\_m \cdot 0.08333333333333333\right)\right)\right)\\
\end{array}
\end{array}
if im < 1.80000000000000004Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 69.4%
if 1.80000000000000004 < im < 1.3000000000000001e103Initial program 99.9%
+-commutative99.9%
distribute-rgt-in99.9%
associate-*r*99.9%
associate-*r*99.9%
distribute-rgt-out99.9%
distribute-rgt-in99.9%
distribute-lft-in99.9%
*-commutative99.9%
fma-define99.9%
exp-diff99.9%
associate-*l/99.9%
exp-099.9%
metadata-eval99.9%
Simplified99.9%
Taylor expanded in im around 0 93.5%
Taylor expanded in re around 0 63.0%
if 1.3000000000000001e103 < im Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in im around 0 100.0%
*-commutative100.0%
Simplified100.0%
Final simplification72.7%
im_m = (fabs.f64 im)
(FPCore (re im_m)
:precision binary64
(if (<= im_m 2.35)
(sin re)
(if (<= im_m 2e+152)
(* re (+ 0.5 (* 0.5 (exp im_m))))
(* (sin re) (+ 1.0 (* im_m (+ 0.5 (* im_m 0.25))))))))im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 2.35) {
tmp = sin(re);
} else if (im_m <= 2e+152) {
tmp = re * (0.5 + (0.5 * exp(im_m)));
} else {
tmp = sin(re) * (1.0 + (im_m * (0.5 + (im_m * 0.25))));
}
return tmp;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 2.35d0) then
tmp = sin(re)
else if (im_m <= 2d+152) then
tmp = re * (0.5d0 + (0.5d0 * exp(im_m)))
else
tmp = sin(re) * (1.0d0 + (im_m * (0.5d0 + (im_m * 0.25d0))))
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 2.35) {
tmp = Math.sin(re);
} else if (im_m <= 2e+152) {
tmp = re * (0.5 + (0.5 * Math.exp(im_m)));
} else {
tmp = Math.sin(re) * (1.0 + (im_m * (0.5 + (im_m * 0.25))));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 2.35: tmp = math.sin(re) elif im_m <= 2e+152: tmp = re * (0.5 + (0.5 * math.exp(im_m))) else: tmp = math.sin(re) * (1.0 + (im_m * (0.5 + (im_m * 0.25)))) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 2.35) tmp = sin(re); elseif (im_m <= 2e+152) tmp = Float64(re * Float64(0.5 + Float64(0.5 * exp(im_m)))); else tmp = Float64(sin(re) * Float64(1.0 + Float64(im_m * Float64(0.5 + Float64(im_m * 0.25))))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 2.35) tmp = sin(re); elseif (im_m <= 2e+152) tmp = re * (0.5 + (0.5 * exp(im_m))); else tmp = sin(re) * (1.0 + (im_m * (0.5 + (im_m * 0.25)))); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 2.35], N[Sin[re], $MachinePrecision], If[LessEqual[im$95$m, 2e+152], N[(re * N[(0.5 + N[(0.5 * N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(1.0 + N[(im$95$m * N[(0.5 + N[(im$95$m * 0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 2.35:\\
\;\;\;\;\sin re\\
\mathbf{elif}\;im\_m \leq 2 \cdot 10^{+152}:\\
\;\;\;\;re \cdot \left(0.5 + 0.5 \cdot e^{im\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\sin re \cdot \left(1 + im\_m \cdot \left(0.5 + im\_m \cdot 0.25\right)\right)\\
\end{array}
\end{array}
if im < 2.35000000000000009Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 69.4%
if 2.35000000000000009 < im < 2.0000000000000001e152Initial program 99.9%
+-commutative99.9%
distribute-rgt-in99.9%
associate-*r*99.9%
associate-*r*99.9%
distribute-rgt-out99.9%
distribute-rgt-in99.9%
distribute-lft-in99.9%
*-commutative99.9%
fma-define99.9%
exp-diff99.9%
associate-*l/99.9%
exp-099.9%
metadata-eval99.9%
Simplified99.9%
Taylor expanded in im around 0 95.2%
Taylor expanded in re around 0 69.3%
if 2.0000000000000001e152 < im Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in im around 0 96.4%
*-commutative96.4%
Simplified96.4%
Final simplification71.9%
im_m = (fabs.f64 im)
(FPCore (re im_m)
:precision binary64
(if (<= im_m 2.35)
(sin re)
(if (<= im_m 2e+152)
(* re (+ 0.5 (* 0.5 (exp im_m))))
(* (sin re) (+ 1.0 (* im_m (+ 0.5 (* im_m 0.3333333333333333))))))))im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 2.35) {
tmp = sin(re);
} else if (im_m <= 2e+152) {
tmp = re * (0.5 + (0.5 * exp(im_m)));
} else {
tmp = sin(re) * (1.0 + (im_m * (0.5 + (im_m * 0.3333333333333333))));
}
return tmp;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 2.35d0) then
tmp = sin(re)
else if (im_m <= 2d+152) then
tmp = re * (0.5d0 + (0.5d0 * exp(im_m)))
else
tmp = sin(re) * (1.0d0 + (im_m * (0.5d0 + (im_m * 0.3333333333333333d0))))
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 2.35) {
tmp = Math.sin(re);
} else if (im_m <= 2e+152) {
tmp = re * (0.5 + (0.5 * Math.exp(im_m)));
} else {
tmp = Math.sin(re) * (1.0 + (im_m * (0.5 + (im_m * 0.3333333333333333))));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 2.35: tmp = math.sin(re) elif im_m <= 2e+152: tmp = re * (0.5 + (0.5 * math.exp(im_m))) else: tmp = math.sin(re) * (1.0 + (im_m * (0.5 + (im_m * 0.3333333333333333)))) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 2.35) tmp = sin(re); elseif (im_m <= 2e+152) tmp = Float64(re * Float64(0.5 + Float64(0.5 * exp(im_m)))); else tmp = Float64(sin(re) * Float64(1.0 + Float64(im_m * Float64(0.5 + Float64(im_m * 0.3333333333333333))))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 2.35) tmp = sin(re); elseif (im_m <= 2e+152) tmp = re * (0.5 + (0.5 * exp(im_m))); else tmp = sin(re) * (1.0 + (im_m * (0.5 + (im_m * 0.3333333333333333)))); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 2.35], N[Sin[re], $MachinePrecision], If[LessEqual[im$95$m, 2e+152], N[(re * N[(0.5 + N[(0.5 * N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(1.0 + N[(im$95$m * N[(0.5 + N[(im$95$m * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 2.35:\\
\;\;\;\;\sin re\\
\mathbf{elif}\;im\_m \leq 2 \cdot 10^{+152}:\\
\;\;\;\;re \cdot \left(0.5 + 0.5 \cdot e^{im\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\sin re \cdot \left(1 + im\_m \cdot \left(0.5 + im\_m \cdot 0.3333333333333333\right)\right)\\
\end{array}
\end{array}
if im < 2.35000000000000009Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 69.4%
if 2.35000000000000009 < im < 2.0000000000000001e152Initial program 99.9%
+-commutative99.9%
distribute-rgt-in99.9%
associate-*r*99.9%
associate-*r*99.9%
distribute-rgt-out99.9%
distribute-rgt-in99.9%
distribute-lft-in99.9%
*-commutative99.9%
fma-define99.9%
exp-diff99.9%
associate-*l/99.9%
exp-099.9%
metadata-eval99.9%
Simplified99.9%
Taylor expanded in im around 0 95.2%
Taylor expanded in re around 0 69.3%
if 2.0000000000000001e152 < im Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in im around 0 100.0%
*-commutative100.0%
Simplified100.0%
Applied egg-rr96.4%
Final simplification71.9%
im_m = (fabs.f64 im)
(FPCore (re im_m)
:precision binary64
(if (<= im_m 480000.0)
(sin re)
(if (<= im_m 8.8e+70)
(* 0.5 (pow re -2.0))
(*
re
(+
1.0
(* im_m (+ 0.5 (* im_m (+ 0.25 (* im_m 0.08333333333333333))))))))))im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 480000.0) {
tmp = sin(re);
} else if (im_m <= 8.8e+70) {
tmp = 0.5 * pow(re, -2.0);
} else {
tmp = re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333))))));
}
return tmp;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 480000.0d0) then
tmp = sin(re)
else if (im_m <= 8.8d+70) then
tmp = 0.5d0 * (re ** (-2.0d0))
else
tmp = re * (1.0d0 + (im_m * (0.5d0 + (im_m * (0.25d0 + (im_m * 0.08333333333333333d0))))))
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 480000.0) {
tmp = Math.sin(re);
} else if (im_m <= 8.8e+70) {
tmp = 0.5 * Math.pow(re, -2.0);
} else {
tmp = re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333))))));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 480000.0: tmp = math.sin(re) elif im_m <= 8.8e+70: tmp = 0.5 * math.pow(re, -2.0) else: tmp = re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333)))))) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 480000.0) tmp = sin(re); elseif (im_m <= 8.8e+70) tmp = Float64(0.5 * (re ^ -2.0)); else tmp = Float64(re * Float64(1.0 + Float64(im_m * Float64(0.5 + Float64(im_m * Float64(0.25 + Float64(im_m * 0.08333333333333333))))))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 480000.0) tmp = sin(re); elseif (im_m <= 8.8e+70) tmp = 0.5 * (re ^ -2.0); else tmp = re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333)))))); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 480000.0], N[Sin[re], $MachinePrecision], If[LessEqual[im$95$m, 8.8e+70], N[(0.5 * N[Power[re, -2.0], $MachinePrecision]), $MachinePrecision], N[(re * N[(1.0 + N[(im$95$m * N[(0.5 + N[(im$95$m * N[(0.25 + N[(im$95$m * 0.08333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 480000:\\
\;\;\;\;\sin re\\
\mathbf{elif}\;im\_m \leq 8.8 \cdot 10^{+70}:\\
\;\;\;\;0.5 \cdot {re}^{-2}\\
\mathbf{else}:\\
\;\;\;\;re \cdot \left(1 + im\_m \cdot \left(0.5 + im\_m \cdot \left(0.25 + im\_m \cdot 0.08333333333333333\right)\right)\right)\\
\end{array}
\end{array}
if im < 4.8e5Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 68.6%
if 4.8e5 < im < 8.80000000000000003e70Initial program 100.0%
distribute-rgt-in100.0%
cancel-sign-sub100.0%
distribute-rgt-out--100.0%
sub-neg100.0%
remove-double-neg100.0%
neg-sub0100.0%
Simplified100.0%
Taylor expanded in re around 0 63.6%
Applied egg-rr19.0%
if 8.80000000000000003e70 < im Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 100.0%
Taylor expanded in im around 0 79.5%
*-commutative79.5%
Simplified79.5%
Taylor expanded in re around 0 73.6%
*-commutative73.6%
Simplified73.6%
Final simplification67.2%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (if (<= im_m 2.35) (sin re) (* re (+ 0.5 (* 0.5 (exp im_m))))))
im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 2.35) {
tmp = sin(re);
} else {
tmp = re * (0.5 + (0.5 * exp(im_m)));
}
return tmp;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 2.35d0) then
tmp = sin(re)
else
tmp = re * (0.5d0 + (0.5d0 * exp(im_m)))
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 2.35) {
tmp = Math.sin(re);
} else {
tmp = re * (0.5 + (0.5 * Math.exp(im_m)));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 2.35: tmp = math.sin(re) else: tmp = re * (0.5 + (0.5 * math.exp(im_m))) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 2.35) tmp = sin(re); else tmp = Float64(re * Float64(0.5 + Float64(0.5 * exp(im_m)))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 2.35) tmp = sin(re); else tmp = re * (0.5 + (0.5 * exp(im_m))); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 2.35], N[Sin[re], $MachinePrecision], N[(re * N[(0.5 + N[(0.5 * N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 2.35:\\
\;\;\;\;\sin re\\
\mathbf{else}:\\
\;\;\;\;re \cdot \left(0.5 + 0.5 \cdot e^{im\_m}\right)\\
\end{array}
\end{array}
if im < 2.35000000000000009Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 69.4%
if 2.35000000000000009 < im Initial program 99.9%
+-commutative99.9%
distribute-rgt-in99.9%
associate-*r*99.9%
associate-*r*99.9%
distribute-rgt-out99.9%
distribute-rgt-in99.9%
distribute-lft-in99.9%
*-commutative99.9%
fma-define99.9%
exp-diff99.9%
associate-*l/99.9%
exp-099.9%
metadata-eval99.9%
Simplified99.9%
Taylor expanded in im around 0 97.3%
Taylor expanded in re around 0 73.6%
Final simplification70.3%
im_m = (fabs.f64 im)
(FPCore (re im_m)
:precision binary64
(if (<= im_m 1.8)
(sin re)
(*
re
(+ 1.0 (* im_m (+ 0.5 (* im_m (+ 0.25 (* im_m 0.08333333333333333)))))))))im_m = fabs(im);
double code(double re, double im_m) {
double tmp;
if (im_m <= 1.8) {
tmp = sin(re);
} else {
tmp = re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333))))));
}
return tmp;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 1.8d0) then
tmp = sin(re)
else
tmp = re * (1.0d0 + (im_m * (0.5d0 + (im_m * (0.25d0 + (im_m * 0.08333333333333333d0))))))
end if
code = tmp
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
double tmp;
if (im_m <= 1.8) {
tmp = Math.sin(re);
} else {
tmp = re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333))))));
}
return tmp;
}
im_m = math.fabs(im) def code(re, im_m): tmp = 0 if im_m <= 1.8: tmp = math.sin(re) else: tmp = re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333)))))) return tmp
im_m = abs(im) function code(re, im_m) tmp = 0.0 if (im_m <= 1.8) tmp = sin(re); else tmp = Float64(re * Float64(1.0 + Float64(im_m * Float64(0.5 + Float64(im_m * Float64(0.25 + Float64(im_m * 0.08333333333333333))))))); end return tmp end
im_m = abs(im); function tmp_2 = code(re, im_m) tmp = 0.0; if (im_m <= 1.8) tmp = sin(re); else tmp = re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333)))))); end tmp_2 = tmp; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := If[LessEqual[im$95$m, 1.8], N[Sin[re], $MachinePrecision], N[(re * N[(1.0 + N[(im$95$m * N[(0.5 + N[(im$95$m * N[(0.25 + N[(im$95$m * 0.08333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
im_m = \left|im\right|
\\
\begin{array}{l}
\mathbf{if}\;im\_m \leq 1.8:\\
\;\;\;\;\sin re\\
\mathbf{else}:\\
\;\;\;\;re \cdot \left(1 + im\_m \cdot \left(0.5 + im\_m \cdot \left(0.25 + im\_m \cdot 0.08333333333333333\right)\right)\right)\\
\end{array}
\end{array}
if im < 1.80000000000000004Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 69.4%
if 1.80000000000000004 < im Initial program 99.9%
+-commutative99.9%
distribute-rgt-in99.9%
associate-*r*99.9%
associate-*r*99.9%
distribute-rgt-out99.9%
distribute-rgt-in99.9%
distribute-lft-in99.9%
*-commutative99.9%
fma-define99.9%
exp-diff99.9%
associate-*l/99.9%
exp-099.9%
metadata-eval99.9%
Simplified99.9%
Taylor expanded in im around 0 97.3%
Taylor expanded in im around 0 60.7%
*-commutative60.7%
Simplified60.7%
Taylor expanded in re around 0 56.0%
*-commutative56.0%
Simplified56.0%
Final simplification66.5%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (* re (+ 1.0 (* im_m (+ 0.5 (* im_m (+ 0.25 (* im_m 0.08333333333333333))))))))
im_m = fabs(im);
double code(double re, double im_m) {
return re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333))))));
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = re * (1.0d0 + (im_m * (0.5d0 + (im_m * (0.25d0 + (im_m * 0.08333333333333333d0))))))
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333))))));
}
im_m = math.fabs(im) def code(re, im_m): return re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333))))))
im_m = abs(im) function code(re, im_m) return Float64(re * Float64(1.0 + Float64(im_m * Float64(0.5 + Float64(im_m * Float64(0.25 + Float64(im_m * 0.08333333333333333))))))) end
im_m = abs(im); function tmp = code(re, im_m) tmp = re * (1.0 + (im_m * (0.5 + (im_m * (0.25 + (im_m * 0.08333333333333333)))))); end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[(re * N[(1.0 + N[(im$95$m * N[(0.5 + N[(im$95$m * N[(0.25 + N[(im$95$m * 0.08333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
re \cdot \left(1 + im\_m \cdot \left(0.5 + im\_m \cdot \left(0.25 + im\_m \cdot 0.08333333333333333\right)\right)\right)
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 74.8%
Taylor expanded in im around 0 66.3%
*-commutative66.3%
Simplified66.3%
Taylor expanded in re around 0 45.8%
*-commutative45.8%
Simplified45.8%
Final simplification45.8%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 (* re (+ 1.0 (* 0.5 im_m))))
im_m = fabs(im);
double code(double re, double im_m) {
return re * (1.0 + (0.5 * im_m));
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = re * (1.0d0 + (0.5d0 * im_m))
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return re * (1.0 + (0.5 * im_m));
}
im_m = math.fabs(im) def code(re, im_m): return re * (1.0 + (0.5 * im_m))
im_m = abs(im) function code(re, im_m) return Float64(re * Float64(1.0 + Float64(0.5 * im_m))) end
im_m = abs(im); function tmp = code(re, im_m) tmp = re * (1.0 + (0.5 * im_m)); end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := N[(re * N[(1.0 + N[(0.5 * im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
re \cdot \left(1 + 0.5 \cdot im\_m\right)
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 74.8%
Taylor expanded in im around 0 54.3%
Taylor expanded in re around 0 35.7%
*-commutative35.7%
Simplified35.7%
Final simplification35.7%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 0.0)
im_m = fabs(im);
double code(double re, double im_m) {
return 0.0;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = 0.0d0
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return 0.0;
}
im_m = math.fabs(im) def code(re, im_m): return 0.0
im_m = abs(im) function code(re, im_m) return 0.0 end
im_m = abs(im); function tmp = code(re, im_m) tmp = 0.0; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := 0.0
\begin{array}{l}
im_m = \left|im\right|
\\
0
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Applied egg-rr4.3%
sub-neg4.3%
metadata-eval4.3%
+-commutative4.3%
log1p-undefine4.3%
rem-exp-log4.3%
associate-+r+4.3%
metadata-eval4.3%
Simplified4.3%
+-commutative4.3%
*-un-lft-identity4.3%
fma-define4.3%
add-sqr-sqrt0.7%
sqrt-unprod4.2%
swap-sqr4.2%
metadata-eval4.2%
metadata-eval4.2%
swap-sqr4.2%
sqrt-unprod3.4%
add-sqr-sqrt4.2%
*-commutative4.2%
Applied egg-rr4.2%
fma-undefine4.2%
*-lft-identity4.2%
+-commutative4.2%
*-commutative4.2%
Simplified4.2%
Applied egg-rr3.0%
+-inverses3.0%
Simplified3.0%
Final simplification3.0%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 0.0005787037037037037)
im_m = fabs(im);
double code(double re, double im_m) {
return 0.0005787037037037037;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = 0.0005787037037037037d0
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return 0.0005787037037037037;
}
im_m = math.fabs(im) def code(re, im_m): return 0.0005787037037037037
im_m = abs(im) function code(re, im_m) return 0.0005787037037037037 end
im_m = abs(im); function tmp = code(re, im_m) tmp = 0.0005787037037037037; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := 0.0005787037037037037
\begin{array}{l}
im_m = \left|im\right|
\\
0.0005787037037037037
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 74.8%
Taylor expanded in im around 0 66.3%
*-commutative66.3%
Simplified66.3%
Applied egg-rr3.8%
*-commutative3.8%
+-inverses3.8%
+-rgt-identity3.8%
associate-/l*3.8%
*-inverses3.8%
metadata-eval3.8%
Simplified3.8%
Final simplification3.8%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 1.0)
im_m = fabs(im);
double code(double re, double im_m) {
return 1.0;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = 1.0d0
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return 1.0;
}
im_m = math.fabs(im) def code(re, im_m): return 1.0
im_m = abs(im) function code(re, im_m) return 1.0 end
im_m = abs(im); function tmp = code(re, im_m) tmp = 1.0; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := 1.0
\begin{array}{l}
im_m = \left|im\right|
\\
1
\end{array}
Initial program 100.0%
+-commutative100.0%
distribute-rgt-in100.0%
associate-*r*100.0%
associate-*r*100.0%
distribute-rgt-out100.0%
distribute-rgt-in100.0%
distribute-lft-in100.0%
*-commutative100.0%
fma-define100.0%
exp-diff100.0%
associate-*l/100.0%
exp-0100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in im around 0 74.8%
Taylor expanded in im around 0 66.3%
*-commutative66.3%
Simplified66.3%
Applied egg-rr4.6%
*-inverses4.6%
Simplified4.6%
Final simplification4.6%
im_m = (fabs.f64 im) (FPCore (re im_m) :precision binary64 re)
im_m = fabs(im);
double code(double re, double im_m) {
return re;
}
im_m = abs(im)
real(8) function code(re, im_m)
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = re
end function
im_m = Math.abs(im);
public static double code(double re, double im_m) {
return re;
}
im_m = math.fabs(im) def code(re, im_m): return re
im_m = abs(im) function code(re, im_m) return re end
im_m = abs(im); function tmp = code(re, im_m) tmp = re; end
im_m = N[Abs[im], $MachinePrecision] code[re_, im$95$m_] := re
\begin{array}{l}
im_m = \left|im\right|
\\
re
\end{array}
Initial program 100.0%
distribute-rgt-in100.0%
cancel-sign-sub100.0%
distribute-rgt-out--100.0%
sub-neg100.0%
remove-double-neg100.0%
neg-sub0100.0%
Simplified100.0%
Taylor expanded in im around 0 77.3%
+-commutative77.3%
unpow277.3%
fma-define77.3%
Simplified77.3%
Taylor expanded in re around 0 51.0%
*-commutative51.0%
*-commutative51.0%
associate-*l*51.0%
+-commutative51.0%
unpow251.0%
fma-undefine51.0%
Simplified51.0%
Taylor expanded in im around 0 30.3%
Final simplification30.3%
herbie shell --seed 2024066
(FPCore (re im)
:name "math.sin on complex, real part"
:precision binary64
(* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))