
(FPCore (re im) :precision binary64 (* (* 0.5 (sin re)) (- (exp (- im)) (exp im))))
double code(double re, double im) {
return (0.5 * sin(re)) * (exp(-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(-im) - exp(im))
end function
public static double code(double re, double im) {
return (0.5 * Math.sin(re)) * (Math.exp(-im) - Math.exp(im));
}
def code(re, im): return (0.5 * math.sin(re)) * (math.exp(-im) - math.exp(im))
function code(re, im) return Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) - exp(im))) end
function tmp = code(re, im) tmp = (0.5 * sin(re)) * (exp(-im) - exp(im)); end
code[re_, im_] := N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] - N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot \sin re\right) \cdot \left(e^{-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 (- im)) (exp im))))
double code(double re, double im) {
return (0.5 * sin(re)) * (exp(-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(-im) - exp(im))
end function
public static double code(double re, double im) {
return (0.5 * Math.sin(re)) * (Math.exp(-im) - Math.exp(im));
}
def code(re, im): return (0.5 * math.sin(re)) * (math.exp(-im) - math.exp(im))
function code(re, im) return Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) - exp(im))) end
function tmp = code(re, im) tmp = (0.5 * sin(re)) * (exp(-im) - exp(im)); end
code[re_, im_] := N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] - N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right)
\end{array}
im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
:precision binary64
(let* ((t_0 (- (exp (- im_m)) (exp im_m))))
(*
im_s
(if (<= t_0 -1e+26)
(* t_0 (* 0.5 (sin re)))
(*
(sin re)
(-
(*
(pow im_m 3.0)
(- (* -0.008333333333333333 (pow im_m 2.0)) 0.16666666666666666))
im_m))))))im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double t_0 = exp(-im_m) - exp(im_m);
double tmp;
if (t_0 <= -1e+26) {
tmp = t_0 * (0.5 * sin(re));
} else {
tmp = sin(re) * ((pow(im_m, 3.0) * ((-0.008333333333333333 * pow(im_m, 2.0)) - 0.16666666666666666)) - im_m);
}
return im_s * tmp;
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: t_0
real(8) :: tmp
t_0 = exp(-im_m) - exp(im_m)
if (t_0 <= (-1d+26)) then
tmp = t_0 * (0.5d0 * sin(re))
else
tmp = sin(re) * (((im_m ** 3.0d0) * (((-0.008333333333333333d0) * (im_m ** 2.0d0)) - 0.16666666666666666d0)) - im_m)
end if
code = im_s * tmp
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double t_0 = Math.exp(-im_m) - Math.exp(im_m);
double tmp;
if (t_0 <= -1e+26) {
tmp = t_0 * (0.5 * Math.sin(re));
} else {
tmp = Math.sin(re) * ((Math.pow(im_m, 3.0) * ((-0.008333333333333333 * Math.pow(im_m, 2.0)) - 0.16666666666666666)) - im_m);
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): t_0 = math.exp(-im_m) - math.exp(im_m) tmp = 0 if t_0 <= -1e+26: tmp = t_0 * (0.5 * math.sin(re)) else: tmp = math.sin(re) * ((math.pow(im_m, 3.0) * ((-0.008333333333333333 * math.pow(im_m, 2.0)) - 0.16666666666666666)) - im_m) return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) t_0 = Float64(exp(Float64(-im_m)) - exp(im_m)) tmp = 0.0 if (t_0 <= -1e+26) tmp = Float64(t_0 * Float64(0.5 * sin(re))); else tmp = Float64(sin(re) * Float64(Float64((im_m ^ 3.0) * Float64(Float64(-0.008333333333333333 * (im_m ^ 2.0)) - 0.16666666666666666)) - im_m)); end return Float64(im_s * tmp) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp_2 = code(im_s, re, im_m) t_0 = exp(-im_m) - exp(im_m); tmp = 0.0; if (t_0 <= -1e+26) tmp = t_0 * (0.5 * sin(re)); else tmp = sin(re) * (((im_m ^ 3.0) * ((-0.008333333333333333 * (im_m ^ 2.0)) - 0.16666666666666666)) - im_m); end tmp_2 = im_s * tmp; end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := Block[{t$95$0 = N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]}, N[(im$95$s * If[LessEqual[t$95$0, -1e+26], N[(t$95$0 * N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * N[(N[(-0.008333333333333333 * N[Power[im$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
\begin{array}{l}
t_0 := e^{-im\_m} - e^{im\_m}\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq -1 \cdot 10^{+26}:\\
\;\;\;\;t\_0 \cdot \left(0.5 \cdot \sin re\right)\\
\mathbf{else}:\\
\;\;\;\;\sin re \cdot \left({im\_m}^{3} \cdot \left(-0.008333333333333333 \cdot {im\_m}^{2} - 0.16666666666666666\right) - im\_m\right)\\
\end{array}
\end{array}
\end{array}
if (-.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)) < -1.00000000000000005e26Initial program 100.0%
if -1.00000000000000005e26 < (-.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)) Initial program 57.9%
Taylor expanded in im around 0 89.8%
distribute-rgt-in89.8%
+-commutative89.8%
*-commutative89.8%
mul-1-neg89.8%
cancel-sign-sub-inv89.8%
associate-*r*89.8%
*-commutative89.8%
associate-*r*89.8%
distribute-rgt-out89.8%
associate-*l*90.8%
distribute-lft-out--90.8%
Simplified90.8%
Taylor expanded in re around inf 90.8%
Final simplification93.2%
im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
:precision binary64
(let* ((t_0 (- (exp (- im_m)) (exp im_m))))
(*
im_s
(if (<= t_0 -1e+26)
(* t_0 (* 0.5 (sin re)))
(* (sin re) (- (* (pow im_m 3.0) -0.16666666666666666) im_m))))))im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double t_0 = exp(-im_m) - exp(im_m);
double tmp;
if (t_0 <= -1e+26) {
tmp = t_0 * (0.5 * sin(re));
} else {
tmp = sin(re) * ((pow(im_m, 3.0) * -0.16666666666666666) - im_m);
}
return im_s * tmp;
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: t_0
real(8) :: tmp
t_0 = exp(-im_m) - exp(im_m)
if (t_0 <= (-1d+26)) then
tmp = t_0 * (0.5d0 * sin(re))
else
tmp = sin(re) * (((im_m ** 3.0d0) * (-0.16666666666666666d0)) - im_m)
end if
code = im_s * tmp
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double t_0 = Math.exp(-im_m) - Math.exp(im_m);
double tmp;
if (t_0 <= -1e+26) {
tmp = t_0 * (0.5 * Math.sin(re));
} else {
tmp = Math.sin(re) * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - im_m);
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): t_0 = math.exp(-im_m) - math.exp(im_m) tmp = 0 if t_0 <= -1e+26: tmp = t_0 * (0.5 * math.sin(re)) else: tmp = math.sin(re) * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m) return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) t_0 = Float64(exp(Float64(-im_m)) - exp(im_m)) tmp = 0.0 if (t_0 <= -1e+26) tmp = Float64(t_0 * Float64(0.5 * sin(re))); else tmp = Float64(sin(re) * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - im_m)); end return Float64(im_s * tmp) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp_2 = code(im_s, re, im_m) t_0 = exp(-im_m) - exp(im_m); tmp = 0.0; if (t_0 <= -1e+26) tmp = t_0 * (0.5 * sin(re)); else tmp = sin(re) * (((im_m ^ 3.0) * -0.16666666666666666) - im_m); end tmp_2 = im_s * tmp; end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := Block[{t$95$0 = N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]}, N[(im$95$s * If[LessEqual[t$95$0, -1e+26], N[(t$95$0 * N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
\begin{array}{l}
t_0 := e^{-im\_m} - e^{im\_m}\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq -1 \cdot 10^{+26}:\\
\;\;\;\;t\_0 \cdot \left(0.5 \cdot \sin re\right)\\
\mathbf{else}:\\
\;\;\;\;\sin re \cdot \left({im\_m}^{3} \cdot -0.16666666666666666 - im\_m\right)\\
\end{array}
\end{array}
\end{array}
if (-.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)) < -1.00000000000000005e26Initial program 100.0%
if -1.00000000000000005e26 < (-.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)) Initial program 57.9%
Taylor expanded in im around 0 84.7%
+-commutative84.7%
mul-1-neg84.7%
unsub-neg84.7%
*-commutative84.7%
associate-*r*84.7%
distribute-lft-out--84.7%
associate-*r*84.7%
*-commutative84.7%
associate-*r*84.7%
associate-*r*85.2%
distribute-rgt-out--85.2%
unsub-neg85.2%
unsub-neg85.2%
Simplified85.2%
Final simplification89.0%
im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
:precision binary64
(let* ((t_0 (log1p (expm1 re))))
(*
im_s
(if (<= im_m 10000000.0)
(* im_m (- (sin re)))
(if (<= im_m 3.5e+24)
t_0
(if (<= im_m 1.3e+44)
(* re (+ im_m (* -0.16666666666666666 (* im_m (pow re 2.0)))))
(if (<= im_m 4.5e+51)
t_0
(* -0.008333333333333333 (* (sin re) (pow im_m 5.0))))))))))im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double t_0 = log1p(expm1(re));
double tmp;
if (im_m <= 10000000.0) {
tmp = im_m * -sin(re);
} else if (im_m <= 3.5e+24) {
tmp = t_0;
} else if (im_m <= 1.3e+44) {
tmp = re * (im_m + (-0.16666666666666666 * (im_m * pow(re, 2.0))));
} else if (im_m <= 4.5e+51) {
tmp = t_0;
} else {
tmp = -0.008333333333333333 * (sin(re) * pow(im_m, 5.0));
}
return im_s * tmp;
}
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double t_0 = Math.log1p(Math.expm1(re));
double tmp;
if (im_m <= 10000000.0) {
tmp = im_m * -Math.sin(re);
} else if (im_m <= 3.5e+24) {
tmp = t_0;
} else if (im_m <= 1.3e+44) {
tmp = re * (im_m + (-0.16666666666666666 * (im_m * Math.pow(re, 2.0))));
} else if (im_m <= 4.5e+51) {
tmp = t_0;
} else {
tmp = -0.008333333333333333 * (Math.sin(re) * Math.pow(im_m, 5.0));
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): t_0 = math.log1p(math.expm1(re)) tmp = 0 if im_m <= 10000000.0: tmp = im_m * -math.sin(re) elif im_m <= 3.5e+24: tmp = t_0 elif im_m <= 1.3e+44: tmp = re * (im_m + (-0.16666666666666666 * (im_m * math.pow(re, 2.0)))) elif im_m <= 4.5e+51: tmp = t_0 else: tmp = -0.008333333333333333 * (math.sin(re) * math.pow(im_m, 5.0)) return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) t_0 = log1p(expm1(re)) tmp = 0.0 if (im_m <= 10000000.0) tmp = Float64(im_m * Float64(-sin(re))); elseif (im_m <= 3.5e+24) tmp = t_0; elseif (im_m <= 1.3e+44) tmp = Float64(re * Float64(im_m + Float64(-0.16666666666666666 * Float64(im_m * (re ^ 2.0))))); elseif (im_m <= 4.5e+51) tmp = t_0; else tmp = Float64(-0.008333333333333333 * Float64(sin(re) * (im_m ^ 5.0))); end return Float64(im_s * tmp) end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := Block[{t$95$0 = N[Log[1 + N[(Exp[re] - 1), $MachinePrecision]], $MachinePrecision]}, N[(im$95$s * If[LessEqual[im$95$m, 10000000.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 3.5e+24], t$95$0, If[LessEqual[im$95$m, 1.3e+44], N[(re * N[(im$95$m + N[(-0.16666666666666666 * N[(im$95$m * N[Power[re, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 4.5e+51], t$95$0, N[(-0.008333333333333333 * N[(N[Sin[re], $MachinePrecision] * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
\begin{array}{l}
t_0 := \mathsf{log1p}\left(\mathsf{expm1}\left(re\right)\right)\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;im\_m \leq 10000000:\\
\;\;\;\;im\_m \cdot \left(-\sin re\right)\\
\mathbf{elif}\;im\_m \leq 3.5 \cdot 10^{+24}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;im\_m \leq 1.3 \cdot 10^{+44}:\\
\;\;\;\;re \cdot \left(im\_m + -0.16666666666666666 \cdot \left(im\_m \cdot {re}^{2}\right)\right)\\
\mathbf{elif}\;im\_m \leq 4.5 \cdot 10^{+51}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;-0.008333333333333333 \cdot \left(\sin re \cdot {im\_m}^{5}\right)\\
\end{array}
\end{array}
\end{array}
if im < 1e7Initial program 58.1%
Taylor expanded in im around 0 64.5%
associate-*r*64.5%
neg-mul-164.5%
Simplified64.5%
if 1e7 < im < 3.5000000000000002e24 or 1.3e44 < im < 4.5e51Initial program 100.0%
Taylor expanded in re around 0 20.0%
associate-*r*20.0%
*-commutative20.0%
Simplified20.0%
Applied egg-rr80.2%
if 3.5000000000000002e24 < im < 1.3e44Initial program 100.0%
Taylor expanded in im around 0 3.4%
associate-*r*3.4%
neg-mul-13.4%
Simplified3.4%
pow13.4%
*-commutative3.4%
add-sqr-sqrt0.0%
sqrt-unprod0.6%
sqr-neg0.6%
sqrt-prod0.6%
add-sqr-sqrt0.6%
Applied egg-rr0.6%
unpow10.6%
*-commutative0.6%
Simplified0.6%
Taylor expanded in re around 0 55.0%
if 4.5e51 < im Initial program 100.0%
Taylor expanded in im around 0 90.3%
distribute-rgt-in90.3%
+-commutative90.3%
*-commutative90.3%
mul-1-neg90.3%
cancel-sign-sub-inv90.3%
associate-*r*91.9%
*-commutative91.9%
associate-*r*91.9%
distribute-rgt-out91.9%
associate-*l*95.1%
distribute-lft-out--95.1%
Simplified95.1%
Taylor expanded in im around inf 95.1%
Final simplification71.6%
im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
:precision binary64
(let* ((t_0 (log1p (expm1 re))))
(*
im_s
(if (<= im_m 10000000.0)
(* (sin re) (- (* (pow im_m 3.0) -0.16666666666666666) im_m))
(if (<= im_m 6.1e+28)
t_0
(if (<= im_m 2.4e+44)
(* re (+ im_m (* -0.16666666666666666 (* im_m (pow re 2.0)))))
(if (<= im_m 4.5e+51)
t_0
(* -0.008333333333333333 (* (sin re) (pow im_m 5.0))))))))))im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double t_0 = log1p(expm1(re));
double tmp;
if (im_m <= 10000000.0) {
tmp = sin(re) * ((pow(im_m, 3.0) * -0.16666666666666666) - im_m);
} else if (im_m <= 6.1e+28) {
tmp = t_0;
} else if (im_m <= 2.4e+44) {
tmp = re * (im_m + (-0.16666666666666666 * (im_m * pow(re, 2.0))));
} else if (im_m <= 4.5e+51) {
tmp = t_0;
} else {
tmp = -0.008333333333333333 * (sin(re) * pow(im_m, 5.0));
}
return im_s * tmp;
}
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double t_0 = Math.log1p(Math.expm1(re));
double tmp;
if (im_m <= 10000000.0) {
tmp = Math.sin(re) * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - im_m);
} else if (im_m <= 6.1e+28) {
tmp = t_0;
} else if (im_m <= 2.4e+44) {
tmp = re * (im_m + (-0.16666666666666666 * (im_m * Math.pow(re, 2.0))));
} else if (im_m <= 4.5e+51) {
tmp = t_0;
} else {
tmp = -0.008333333333333333 * (Math.sin(re) * Math.pow(im_m, 5.0));
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): t_0 = math.log1p(math.expm1(re)) tmp = 0 if im_m <= 10000000.0: tmp = math.sin(re) * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m) elif im_m <= 6.1e+28: tmp = t_0 elif im_m <= 2.4e+44: tmp = re * (im_m + (-0.16666666666666666 * (im_m * math.pow(re, 2.0)))) elif im_m <= 4.5e+51: tmp = t_0 else: tmp = -0.008333333333333333 * (math.sin(re) * math.pow(im_m, 5.0)) return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) t_0 = log1p(expm1(re)) tmp = 0.0 if (im_m <= 10000000.0) tmp = Float64(sin(re) * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - im_m)); elseif (im_m <= 6.1e+28) tmp = t_0; elseif (im_m <= 2.4e+44) tmp = Float64(re * Float64(im_m + Float64(-0.16666666666666666 * Float64(im_m * (re ^ 2.0))))); elseif (im_m <= 4.5e+51) tmp = t_0; else tmp = Float64(-0.008333333333333333 * Float64(sin(re) * (im_m ^ 5.0))); end return Float64(im_s * tmp) end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := Block[{t$95$0 = N[Log[1 + N[(Exp[re] - 1), $MachinePrecision]], $MachinePrecision]}, N[(im$95$s * If[LessEqual[im$95$m, 10000000.0], N[(N[Sin[re], $MachinePrecision] * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 6.1e+28], t$95$0, If[LessEqual[im$95$m, 2.4e+44], N[(re * N[(im$95$m + N[(-0.16666666666666666 * N[(im$95$m * N[Power[re, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 4.5e+51], t$95$0, N[(-0.008333333333333333 * N[(N[Sin[re], $MachinePrecision] * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
\begin{array}{l}
t_0 := \mathsf{log1p}\left(\mathsf{expm1}\left(re\right)\right)\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;im\_m \leq 10000000:\\
\;\;\;\;\sin re \cdot \left({im\_m}^{3} \cdot -0.16666666666666666 - im\_m\right)\\
\mathbf{elif}\;im\_m \leq 6.1 \cdot 10^{+28}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;im\_m \leq 2.4 \cdot 10^{+44}:\\
\;\;\;\;re \cdot \left(im\_m + -0.16666666666666666 \cdot \left(im\_m \cdot {re}^{2}\right)\right)\\
\mathbf{elif}\;im\_m \leq 4.5 \cdot 10^{+51}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;-0.008333333333333333 \cdot \left(\sin re \cdot {im\_m}^{5}\right)\\
\end{array}
\end{array}
\end{array}
if im < 1e7Initial program 58.1%
Taylor expanded in im around 0 84.3%
+-commutative84.3%
mul-1-neg84.3%
unsub-neg84.3%
*-commutative84.3%
associate-*r*84.3%
distribute-lft-out--84.3%
associate-*r*84.3%
*-commutative84.3%
associate-*r*84.3%
associate-*r*84.8%
distribute-rgt-out--84.8%
unsub-neg84.8%
unsub-neg84.8%
Simplified84.8%
if 1e7 < im < 6.1000000000000002e28 or 2.40000000000000013e44 < im < 4.5e51Initial program 100.0%
Taylor expanded in re around 0 20.0%
associate-*r*20.0%
*-commutative20.0%
Simplified20.0%
Applied egg-rr80.2%
if 6.1000000000000002e28 < im < 2.40000000000000013e44Initial program 100.0%
Taylor expanded in im around 0 3.4%
associate-*r*3.4%
neg-mul-13.4%
Simplified3.4%
pow13.4%
*-commutative3.4%
add-sqr-sqrt0.0%
sqrt-unprod0.6%
sqr-neg0.6%
sqrt-prod0.6%
add-sqr-sqrt0.6%
Applied egg-rr0.6%
unpow10.6%
*-commutative0.6%
Simplified0.6%
Taylor expanded in re around 0 55.0%
if 4.5e51 < im Initial program 100.0%
Taylor expanded in im around 0 90.3%
distribute-rgt-in90.3%
+-commutative90.3%
*-commutative90.3%
mul-1-neg90.3%
cancel-sign-sub-inv90.3%
associate-*r*91.9%
*-commutative91.9%
associate-*r*91.9%
distribute-rgt-out91.9%
associate-*l*95.1%
distribute-lft-out--95.1%
Simplified95.1%
Taylor expanded in im around inf 95.1%
Final simplification86.8%
im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
:precision binary64
(let* ((t_0 (log1p (expm1 re))))
(*
im_s
(if (<= im_m 10000000.0)
(* im_m (- (sin re)))
(if (<= im_m 6.5e+25)
t_0
(if (<= im_m 2.75e+45)
(* re (+ im_m (* -0.16666666666666666 (* im_m (pow re 2.0)))))
(if (<= im_m 1.02e+90)
t_0
(* re (- (* (pow im_m 3.0) -0.16666666666666666) im_m)))))))))im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double t_0 = log1p(expm1(re));
double tmp;
if (im_m <= 10000000.0) {
tmp = im_m * -sin(re);
} else if (im_m <= 6.5e+25) {
tmp = t_0;
} else if (im_m <= 2.75e+45) {
tmp = re * (im_m + (-0.16666666666666666 * (im_m * pow(re, 2.0))));
} else if (im_m <= 1.02e+90) {
tmp = t_0;
} else {
tmp = re * ((pow(im_m, 3.0) * -0.16666666666666666) - im_m);
}
return im_s * tmp;
}
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double t_0 = Math.log1p(Math.expm1(re));
double tmp;
if (im_m <= 10000000.0) {
tmp = im_m * -Math.sin(re);
} else if (im_m <= 6.5e+25) {
tmp = t_0;
} else if (im_m <= 2.75e+45) {
tmp = re * (im_m + (-0.16666666666666666 * (im_m * Math.pow(re, 2.0))));
} else if (im_m <= 1.02e+90) {
tmp = t_0;
} else {
tmp = re * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - im_m);
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): t_0 = math.log1p(math.expm1(re)) tmp = 0 if im_m <= 10000000.0: tmp = im_m * -math.sin(re) elif im_m <= 6.5e+25: tmp = t_0 elif im_m <= 2.75e+45: tmp = re * (im_m + (-0.16666666666666666 * (im_m * math.pow(re, 2.0)))) elif im_m <= 1.02e+90: tmp = t_0 else: tmp = re * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m) return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) t_0 = log1p(expm1(re)) tmp = 0.0 if (im_m <= 10000000.0) tmp = Float64(im_m * Float64(-sin(re))); elseif (im_m <= 6.5e+25) tmp = t_0; elseif (im_m <= 2.75e+45) tmp = Float64(re * Float64(im_m + Float64(-0.16666666666666666 * Float64(im_m * (re ^ 2.0))))); elseif (im_m <= 1.02e+90) tmp = t_0; else tmp = Float64(re * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - im_m)); end return Float64(im_s * tmp) end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := Block[{t$95$0 = N[Log[1 + N[(Exp[re] - 1), $MachinePrecision]], $MachinePrecision]}, N[(im$95$s * If[LessEqual[im$95$m, 10000000.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 6.5e+25], t$95$0, If[LessEqual[im$95$m, 2.75e+45], N[(re * N[(im$95$m + N[(-0.16666666666666666 * N[(im$95$m * N[Power[re, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 1.02e+90], t$95$0, N[(re * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
\begin{array}{l}
t_0 := \mathsf{log1p}\left(\mathsf{expm1}\left(re\right)\right)\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;im\_m \leq 10000000:\\
\;\;\;\;im\_m \cdot \left(-\sin re\right)\\
\mathbf{elif}\;im\_m \leq 6.5 \cdot 10^{+25}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;im\_m \leq 2.75 \cdot 10^{+45}:\\
\;\;\;\;re \cdot \left(im\_m + -0.16666666666666666 \cdot \left(im\_m \cdot {re}^{2}\right)\right)\\
\mathbf{elif}\;im\_m \leq 1.02 \cdot 10^{+90}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;re \cdot \left({im\_m}^{3} \cdot -0.16666666666666666 - im\_m\right)\\
\end{array}
\end{array}
\end{array}
if im < 1e7Initial program 58.1%
Taylor expanded in im around 0 64.5%
associate-*r*64.5%
neg-mul-164.5%
Simplified64.5%
if 1e7 < im < 6.50000000000000005e25 or 2.75e45 < im < 1.02000000000000005e90Initial program 100.0%
Taylor expanded in re around 0 57.1%
associate-*r*57.1%
*-commutative57.1%
Simplified57.1%
Applied egg-rr43.3%
if 6.50000000000000005e25 < im < 2.75e45Initial program 100.0%
Taylor expanded in im around 0 3.4%
associate-*r*3.4%
neg-mul-13.4%
Simplified3.4%
pow13.4%
*-commutative3.4%
add-sqr-sqrt0.0%
sqrt-unprod0.6%
sqr-neg0.6%
sqrt-prod0.6%
add-sqr-sqrt0.6%
Applied egg-rr0.6%
unpow10.6%
*-commutative0.6%
Simplified0.6%
Taylor expanded in re around 0 55.0%
if 1.02000000000000005e90 < im Initial program 100.0%
Taylor expanded in im around 0 88.6%
+-commutative88.6%
mul-1-neg88.6%
unsub-neg88.6%
*-commutative88.6%
associate-*r*88.6%
distribute-lft-out--88.6%
associate-*r*88.6%
*-commutative88.6%
associate-*r*88.6%
associate-*r*98.1%
distribute-rgt-out--98.1%
unsub-neg98.1%
unsub-neg98.1%
Simplified98.1%
Taylor expanded in re around 0 71.4%
*-commutative71.4%
Simplified71.4%
Final simplification64.6%
im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
:precision binary64
(*
im_s
(if (<= im_m 0.051)
(* (sin re) (- (* (pow im_m 3.0) -0.16666666666666666) im_m))
(if (<= im_m 4.5e+61)
(* (- (exp (- im_m)) (exp im_m)) (* 0.5 re))
(* -0.008333333333333333 (* (sin re) (pow im_m 5.0)))))))im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 0.051) {
tmp = sin(re) * ((pow(im_m, 3.0) * -0.16666666666666666) - im_m);
} else if (im_m <= 4.5e+61) {
tmp = (exp(-im_m) - exp(im_m)) * (0.5 * re);
} else {
tmp = -0.008333333333333333 * (sin(re) * pow(im_m, 5.0));
}
return im_s * tmp;
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 0.051d0) then
tmp = sin(re) * (((im_m ** 3.0d0) * (-0.16666666666666666d0)) - im_m)
else if (im_m <= 4.5d+61) then
tmp = (exp(-im_m) - exp(im_m)) * (0.5d0 * re)
else
tmp = (-0.008333333333333333d0) * (sin(re) * (im_m ** 5.0d0))
end if
code = im_s * tmp
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 0.051) {
tmp = Math.sin(re) * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - im_m);
} else if (im_m <= 4.5e+61) {
tmp = (Math.exp(-im_m) - Math.exp(im_m)) * (0.5 * re);
} else {
tmp = -0.008333333333333333 * (Math.sin(re) * Math.pow(im_m, 5.0));
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): tmp = 0 if im_m <= 0.051: tmp = math.sin(re) * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m) elif im_m <= 4.5e+61: tmp = (math.exp(-im_m) - math.exp(im_m)) * (0.5 * re) else: tmp = -0.008333333333333333 * (math.sin(re) * math.pow(im_m, 5.0)) return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) tmp = 0.0 if (im_m <= 0.051) tmp = Float64(sin(re) * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - im_m)); elseif (im_m <= 4.5e+61) tmp = Float64(Float64(exp(Float64(-im_m)) - exp(im_m)) * Float64(0.5 * re)); else tmp = Float64(-0.008333333333333333 * Float64(sin(re) * (im_m ^ 5.0))); end return Float64(im_s * tmp) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp_2 = code(im_s, re, im_m) tmp = 0.0; if (im_m <= 0.051) tmp = sin(re) * (((im_m ^ 3.0) * -0.16666666666666666) - im_m); elseif (im_m <= 4.5e+61) tmp = (exp(-im_m) - exp(im_m)) * (0.5 * re); else tmp = -0.008333333333333333 * (sin(re) * (im_m ^ 5.0)); end tmp_2 = im_s * tmp; end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 0.051], N[(N[Sin[re], $MachinePrecision] * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 4.5e+61], N[(N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision] * N[(0.5 * re), $MachinePrecision]), $MachinePrecision], N[(-0.008333333333333333 * N[(N[Sin[re], $MachinePrecision] * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;im\_m \leq 0.051:\\
\;\;\;\;\sin re \cdot \left({im\_m}^{3} \cdot -0.16666666666666666 - im\_m\right)\\
\mathbf{elif}\;im\_m \leq 4.5 \cdot 10^{+61}:\\
\;\;\;\;\left(e^{-im\_m} - e^{im\_m}\right) \cdot \left(0.5 \cdot re\right)\\
\mathbf{else}:\\
\;\;\;\;-0.008333333333333333 \cdot \left(\sin re \cdot {im\_m}^{5}\right)\\
\end{array}
\end{array}
if im < 0.0509999999999999967Initial program 57.9%
Taylor expanded in im around 0 84.7%
+-commutative84.7%
mul-1-neg84.7%
unsub-neg84.7%
*-commutative84.7%
associate-*r*84.7%
distribute-lft-out--84.7%
associate-*r*84.7%
*-commutative84.7%
associate-*r*84.7%
associate-*r*85.2%
distribute-rgt-out--85.2%
unsub-neg85.2%
unsub-neg85.2%
Simplified85.2%
if 0.0509999999999999967 < im < 4.5e61Initial program 100.0%
Taylor expanded in re around 0 63.6%
associate-*r*63.6%
*-commutative63.6%
Simplified63.6%
if 4.5e61 < im Initial program 100.0%
Taylor expanded in im around 0 95.0%
distribute-rgt-in95.0%
+-commutative95.0%
*-commutative95.0%
mul-1-neg95.0%
cancel-sign-sub-inv95.0%
associate-*r*96.6%
*-commutative96.6%
associate-*r*96.6%
distribute-rgt-out96.6%
associate-*l*100.0%
distribute-lft-out--100.0%
Simplified100.0%
Taylor expanded in im around inf 100.0%
Final simplification87.5%
im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
:precision binary64
(*
im_s
(if (<= im_m 13200000.0)
(* im_m (- (sin re)))
(if (<= im_m 3.8e+98)
(* 0.16666666666666666 (* im_m (pow re 3.0)))
(if (<= im_m 1.12e+282) (* im_m (/ -2.4 (sin re))) (* im_m (- re)))))))im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 13200000.0) {
tmp = im_m * -sin(re);
} else if (im_m <= 3.8e+98) {
tmp = 0.16666666666666666 * (im_m * pow(re, 3.0));
} else if (im_m <= 1.12e+282) {
tmp = im_m * (-2.4 / sin(re));
} else {
tmp = im_m * -re;
}
return im_s * tmp;
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 13200000.0d0) then
tmp = im_m * -sin(re)
else if (im_m <= 3.8d+98) then
tmp = 0.16666666666666666d0 * (im_m * (re ** 3.0d0))
else if (im_m <= 1.12d+282) then
tmp = im_m * ((-2.4d0) / sin(re))
else
tmp = im_m * -re
end if
code = im_s * tmp
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 13200000.0) {
tmp = im_m * -Math.sin(re);
} else if (im_m <= 3.8e+98) {
tmp = 0.16666666666666666 * (im_m * Math.pow(re, 3.0));
} else if (im_m <= 1.12e+282) {
tmp = im_m * (-2.4 / Math.sin(re));
} else {
tmp = im_m * -re;
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): tmp = 0 if im_m <= 13200000.0: tmp = im_m * -math.sin(re) elif im_m <= 3.8e+98: tmp = 0.16666666666666666 * (im_m * math.pow(re, 3.0)) elif im_m <= 1.12e+282: tmp = im_m * (-2.4 / math.sin(re)) else: tmp = im_m * -re return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) tmp = 0.0 if (im_m <= 13200000.0) tmp = Float64(im_m * Float64(-sin(re))); elseif (im_m <= 3.8e+98) tmp = Float64(0.16666666666666666 * Float64(im_m * (re ^ 3.0))); elseif (im_m <= 1.12e+282) tmp = Float64(im_m * Float64(-2.4 / sin(re))); else tmp = Float64(im_m * Float64(-re)); end return Float64(im_s * tmp) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp_2 = code(im_s, re, im_m) tmp = 0.0; if (im_m <= 13200000.0) tmp = im_m * -sin(re); elseif (im_m <= 3.8e+98) tmp = 0.16666666666666666 * (im_m * (re ^ 3.0)); elseif (im_m <= 1.12e+282) tmp = im_m * (-2.4 / sin(re)); else tmp = im_m * -re; end tmp_2 = im_s * tmp; end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 13200000.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 3.8e+98], N[(0.16666666666666666 * N[(im$95$m * N[Power[re, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 1.12e+282], N[(im$95$m * N[(-2.4 / N[Sin[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im$95$m * (-re)), $MachinePrecision]]]]), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;im\_m \leq 13200000:\\
\;\;\;\;im\_m \cdot \left(-\sin re\right)\\
\mathbf{elif}\;im\_m \leq 3.8 \cdot 10^{+98}:\\
\;\;\;\;0.16666666666666666 \cdot \left(im\_m \cdot {re}^{3}\right)\\
\mathbf{elif}\;im\_m \leq 1.12 \cdot 10^{+282}:\\
\;\;\;\;im\_m \cdot \frac{-2.4}{\sin re}\\
\mathbf{else}:\\
\;\;\;\;im\_m \cdot \left(-re\right)\\
\end{array}
\end{array}
if im < 1.32e7Initial program 58.1%
Taylor expanded in im around 0 64.5%
associate-*r*64.5%
neg-mul-164.5%
Simplified64.5%
if 1.32e7 < im < 3.7999999999999999e98Initial program 100.0%
Taylor expanded in im around 0 3.2%
associate-*r*3.2%
neg-mul-13.2%
Simplified3.2%
Taylor expanded in re around 0 19.5%
mul-1-neg19.5%
+-commutative19.5%
unsub-neg19.5%
*-commutative19.5%
*-commutative19.5%
associate-*r*19.5%
Simplified19.5%
Taylor expanded in re around inf 19.0%
if 3.7999999999999999e98 < im < 1.12e282Initial program 100.0%
Taylor expanded in im around 0 88.0%
associate-*r*88.0%
distribute-rgt-out88.0%
*-commutative88.0%
Simplified88.0%
log1p-expm1-u95.1%
+-commutative95.1%
fma-define95.1%
Applied egg-rr95.1%
add-cbrt-cube95.1%
pow395.1%
Applied egg-rr95.1%
Applied egg-rr32.2%
associate-/r*32.2%
metadata-eval32.2%
Simplified32.2%
if 1.12e282 < im Initial program 100.0%
Taylor expanded in im around 0 10.4%
associate-*r*10.4%
neg-mul-110.4%
Simplified10.4%
Taylor expanded in re around 0 68.0%
associate-*r*68.0%
mul-1-neg68.0%
Simplified68.0%
Final simplification56.6%
im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
:precision binary64
(*
im_s
(if (<= im_m 280.0)
(* im_m (- (sin re)))
(if (<= im_m 9.2e+281) (* im_m (/ -2.4 (sin re))) (* im_m (- re))))))im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 280.0) {
tmp = im_m * -sin(re);
} else if (im_m <= 9.2e+281) {
tmp = im_m * (-2.4 / sin(re));
} else {
tmp = im_m * -re;
}
return im_s * tmp;
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 280.0d0) then
tmp = im_m * -sin(re)
else if (im_m <= 9.2d+281) then
tmp = im_m * ((-2.4d0) / sin(re))
else
tmp = im_m * -re
end if
code = im_s * tmp
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 280.0) {
tmp = im_m * -Math.sin(re);
} else if (im_m <= 9.2e+281) {
tmp = im_m * (-2.4 / Math.sin(re));
} else {
tmp = im_m * -re;
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): tmp = 0 if im_m <= 280.0: tmp = im_m * -math.sin(re) elif im_m <= 9.2e+281: tmp = im_m * (-2.4 / math.sin(re)) else: tmp = im_m * -re return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) tmp = 0.0 if (im_m <= 280.0) tmp = Float64(im_m * Float64(-sin(re))); elseif (im_m <= 9.2e+281) tmp = Float64(im_m * Float64(-2.4 / sin(re))); else tmp = Float64(im_m * Float64(-re)); end return Float64(im_s * tmp) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp_2 = code(im_s, re, im_m) tmp = 0.0; if (im_m <= 280.0) tmp = im_m * -sin(re); elseif (im_m <= 9.2e+281) tmp = im_m * (-2.4 / sin(re)); else tmp = im_m * -re; end tmp_2 = im_s * tmp; end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 280.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 9.2e+281], N[(im$95$m * N[(-2.4 / N[Sin[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im$95$m * (-re)), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;im\_m \leq 280:\\
\;\;\;\;im\_m \cdot \left(-\sin re\right)\\
\mathbf{elif}\;im\_m \leq 9.2 \cdot 10^{+281}:\\
\;\;\;\;im\_m \cdot \frac{-2.4}{\sin re}\\
\mathbf{else}:\\
\;\;\;\;im\_m \cdot \left(-re\right)\\
\end{array}
\end{array}
if im < 280Initial program 58.1%
Taylor expanded in im around 0 64.5%
associate-*r*64.5%
neg-mul-164.5%
Simplified64.5%
if 280 < im < 9.2000000000000003e281Initial program 100.0%
Taylor expanded in im around 0 62.7%
associate-*r*62.7%
distribute-rgt-out62.7%
*-commutative62.7%
Simplified62.7%
log1p-expm1-u91.4%
+-commutative91.4%
fma-define91.4%
Applied egg-rr91.4%
add-cbrt-cube91.3%
pow391.3%
Applied egg-rr91.3%
Applied egg-rr23.8%
associate-/r*23.8%
metadata-eval23.8%
Simplified23.8%
if 9.2000000000000003e281 < im Initial program 100.0%
Taylor expanded in im around 0 10.4%
associate-*r*10.4%
neg-mul-110.4%
Simplified10.4%
Taylor expanded in re around 0 68.0%
associate-*r*68.0%
mul-1-neg68.0%
Simplified68.0%
Final simplification55.7%
im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
:precision binary64
(*
im_s
(if (<= im_m 0.00068)
(* im_m (- (sin re)))
(* re (- (* (pow im_m 3.0) -0.16666666666666666) im_m)))))im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 0.00068) {
tmp = im_m * -sin(re);
} else {
tmp = re * ((pow(im_m, 3.0) * -0.16666666666666666) - im_m);
}
return im_s * tmp;
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 0.00068d0) then
tmp = im_m * -sin(re)
else
tmp = re * (((im_m ** 3.0d0) * (-0.16666666666666666d0)) - im_m)
end if
code = im_s * tmp
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 0.00068) {
tmp = im_m * -Math.sin(re);
} else {
tmp = re * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - im_m);
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): tmp = 0 if im_m <= 0.00068: tmp = im_m * -math.sin(re) else: tmp = re * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m) return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) tmp = 0.0 if (im_m <= 0.00068) tmp = Float64(im_m * Float64(-sin(re))); else tmp = Float64(re * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - im_m)); end return Float64(im_s * tmp) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp_2 = code(im_s, re, im_m) tmp = 0.0; if (im_m <= 0.00068) tmp = im_m * -sin(re); else tmp = re * (((im_m ^ 3.0) * -0.16666666666666666) - im_m); end tmp_2 = im_s * tmp; end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 0.00068], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], N[(re * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;im\_m \leq 0.00068:\\
\;\;\;\;im\_m \cdot \left(-\sin re\right)\\
\mathbf{else}:\\
\;\;\;\;re \cdot \left({im\_m}^{3} \cdot -0.16666666666666666 - im\_m\right)\\
\end{array}
\end{array}
if im < 6.8e-4Initial program 57.9%
Taylor expanded in im around 0 64.8%
associate-*r*64.8%
neg-mul-164.8%
Simplified64.8%
if 6.8e-4 < im Initial program 100.0%
Taylor expanded in im around 0 67.0%
+-commutative67.0%
mul-1-neg67.0%
unsub-neg67.0%
*-commutative67.0%
associate-*r*67.0%
distribute-lft-out--67.0%
associate-*r*67.0%
*-commutative67.0%
associate-*r*67.0%
associate-*r*74.0%
distribute-rgt-out--74.0%
unsub-neg74.0%
unsub-neg74.0%
Simplified74.0%
Taylor expanded in re around 0 56.7%
*-commutative56.7%
Simplified56.7%
Final simplification62.7%
im\_m = (fabs.f64 im) im\_s = (copysign.f64 #s(literal 1 binary64) im) (FPCore (im_s re im_m) :precision binary64 (* im_s (if (<= (sin re) -0.001) (* im_m re) (* im_m (- re)))))
im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double tmp;
if (sin(re) <= -0.001) {
tmp = im_m * re;
} else {
tmp = im_m * -re;
}
return im_s * tmp;
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (sin(re) <= (-0.001d0)) then
tmp = im_m * re
else
tmp = im_m * -re
end if
code = im_s * tmp
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double tmp;
if (Math.sin(re) <= -0.001) {
tmp = im_m * re;
} else {
tmp = im_m * -re;
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): tmp = 0 if math.sin(re) <= -0.001: tmp = im_m * re else: tmp = im_m * -re return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) tmp = 0.0 if (sin(re) <= -0.001) tmp = Float64(im_m * re); else tmp = Float64(im_m * Float64(-re)); end return Float64(im_s * tmp) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp_2 = code(im_s, re, im_m) tmp = 0.0; if (sin(re) <= -0.001) tmp = im_m * re; else tmp = im_m * -re; end tmp_2 = im_s * tmp; end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[N[Sin[re], $MachinePrecision], -0.001], N[(im$95$m * re), $MachinePrecision], N[(im$95$m * (-re)), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;\sin re \leq -0.001:\\
\;\;\;\;im\_m \cdot re\\
\mathbf{else}:\\
\;\;\;\;im\_m \cdot \left(-re\right)\\
\end{array}
\end{array}
if (sin.f64 re) < -1e-3Initial program 63.1%
Taylor expanded in im around 0 44.4%
associate-*r*44.4%
neg-mul-144.4%
Simplified44.4%
pow144.4%
*-commutative44.4%
add-sqr-sqrt21.1%
sqrt-unprod23.7%
sqr-neg23.7%
sqrt-prod0.9%
add-sqr-sqrt1.6%
Applied egg-rr1.6%
unpow11.6%
*-commutative1.6%
Simplified1.6%
Taylor expanded in re around 0 10.6%
*-commutative10.6%
Simplified10.6%
if -1e-3 < (sin.f64 re) Initial program 70.6%
Taylor expanded in im around 0 51.0%
associate-*r*51.0%
neg-mul-151.0%
Simplified51.0%
Taylor expanded in re around 0 38.3%
associate-*r*38.3%
mul-1-neg38.3%
Simplified38.3%
Final simplification31.4%
im\_m = (fabs.f64 im) im\_s = (copysign.f64 #s(literal 1 binary64) im) (FPCore (im_s re im_m) :precision binary64 (* im_s (if (<= im_m 60.0) (* im_m (- (sin re))) (* im_m (- re)))))
im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 60.0) {
tmp = im_m * -sin(re);
} else {
tmp = im_m * -re;
}
return im_s * tmp;
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
real(8) :: tmp
if (im_m <= 60.0d0) then
tmp = im_m * -sin(re)
else
tmp = im_m * -re
end if
code = im_s * tmp
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
double tmp;
if (im_m <= 60.0) {
tmp = im_m * -Math.sin(re);
} else {
tmp = im_m * -re;
}
return im_s * tmp;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): tmp = 0 if im_m <= 60.0: tmp = im_m * -math.sin(re) else: tmp = im_m * -re return im_s * tmp
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) tmp = 0.0 if (im_m <= 60.0) tmp = Float64(im_m * Float64(-sin(re))); else tmp = Float64(im_m * Float64(-re)); end return Float64(im_s * tmp) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp_2 = code(im_s, re, im_m) tmp = 0.0; if (im_m <= 60.0) tmp = im_m * -sin(re); else tmp = im_m * -re; end tmp_2 = im_s * tmp; end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 60.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], N[(im$95$m * (-re)), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot \begin{array}{l}
\mathbf{if}\;im\_m \leq 60:\\
\;\;\;\;im\_m \cdot \left(-\sin re\right)\\
\mathbf{else}:\\
\;\;\;\;im\_m \cdot \left(-re\right)\\
\end{array}
\end{array}
if im < 60Initial program 57.9%
Taylor expanded in im around 0 64.8%
associate-*r*64.8%
neg-mul-164.8%
Simplified64.8%
if 60 < im Initial program 100.0%
Taylor expanded in im around 0 5.0%
associate-*r*5.0%
neg-mul-15.0%
Simplified5.0%
Taylor expanded in re around 0 19.0%
associate-*r*19.0%
mul-1-neg19.0%
Simplified19.0%
Final simplification53.0%
im\_m = (fabs.f64 im) im\_s = (copysign.f64 #s(literal 1 binary64) im) (FPCore (im_s re im_m) :precision binary64 (* im_s (* im_m -2.5)))
im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
return im_s * (im_m * -2.5);
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = im_s * (im_m * (-2.5d0))
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
return im_s * (im_m * -2.5);
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): return im_s * (im_m * -2.5)
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) return Float64(im_s * Float64(im_m * -2.5)) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp = code(im_s, re, im_m) tmp = im_s * (im_m * -2.5); end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * N[(im$95$m * -2.5), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot \left(im\_m \cdot -2.5\right)
\end{array}
Initial program 68.7%
Taylor expanded in im around 0 80.1%
associate-*r*80.1%
distribute-rgt-out80.1%
*-commutative80.1%
Simplified80.1%
log1p-expm1-u94.2%
+-commutative94.2%
fma-define94.2%
Applied egg-rr94.2%
add-cbrt-cube89.8%
pow389.8%
Applied egg-rr89.8%
Applied egg-rr5.9%
associate-*r/5.9%
*-commutative5.9%
associate-/l*5.9%
*-commutative5.9%
distribute-rgt-out5.9%
times-frac5.9%
*-inverses5.9%
metadata-eval5.9%
metadata-eval5.9%
metadata-eval5.9%
metadata-eval5.9%
Simplified5.9%
Final simplification5.9%
im\_m = (fabs.f64 im) im\_s = (copysign.f64 #s(literal 1 binary64) im) (FPCore (im_s re im_m) :precision binary64 (* im_s (* im_m -1.4)))
im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
return im_s * (im_m * -1.4);
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = im_s * (im_m * (-1.4d0))
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
return im_s * (im_m * -1.4);
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): return im_s * (im_m * -1.4)
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) return Float64(im_s * Float64(im_m * -1.4)) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp = code(im_s, re, im_m) tmp = im_s * (im_m * -1.4); end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * N[(im$95$m * -1.4), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot \left(im\_m \cdot -1.4\right)
\end{array}
Initial program 68.7%
Taylor expanded in im around 0 80.1%
associate-*r*80.1%
distribute-rgt-out80.1%
*-commutative80.1%
Simplified80.1%
log1p-expm1-u94.2%
+-commutative94.2%
fma-define94.2%
Applied egg-rr94.2%
add-cbrt-cube89.8%
pow389.8%
Applied egg-rr89.8%
Applied egg-rr6.1%
times-frac6.1%
metadata-eval6.1%
*-inverses6.1%
metadata-eval6.1%
*-commutative6.1%
associate-/r*6.1%
*-inverses6.1%
metadata-eval6.1%
metadata-eval6.1%
Simplified6.1%
Final simplification6.1%
im\_m = (fabs.f64 im) im\_s = (copysign.f64 #s(literal 1 binary64) im) (FPCore (im_s re im_m) :precision binary64 (* im_s (* im_m re)))
im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
return im_s * (im_m * re);
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = im_s * (im_m * re)
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
return im_s * (im_m * re);
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): return im_s * (im_m * re)
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) return Float64(im_s * Float64(im_m * re)) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp = code(im_s, re, im_m) tmp = im_s * (im_m * re); end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * N[(im$95$m * re), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot \left(im\_m \cdot re\right)
\end{array}
Initial program 68.7%
Taylor expanded in im around 0 49.3%
associate-*r*49.3%
neg-mul-149.3%
Simplified49.3%
pow149.3%
*-commutative49.3%
add-sqr-sqrt24.8%
sqrt-unprod38.9%
sqr-neg38.9%
sqrt-prod6.7%
add-sqr-sqrt13.7%
Applied egg-rr13.7%
unpow113.7%
*-commutative13.7%
Simplified13.7%
Taylor expanded in re around 0 18.2%
*-commutative18.2%
Simplified18.2%
Final simplification18.2%
im\_m = (fabs.f64 im) im\_s = (copysign.f64 #s(literal 1 binary64) im) (FPCore (im_s re im_m) :precision binary64 (* im_s re))
im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
return im_s * re;
}
im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
real(8), intent (in) :: im_s
real(8), intent (in) :: re
real(8), intent (in) :: im_m
code = im_s * re
end function
im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
return im_s * re;
}
im\_m = math.fabs(im) im\_s = math.copysign(1.0, im) def code(im_s, re, im_m): return im_s * re
im\_m = abs(im) im\_s = copysign(1.0, im) function code(im_s, re, im_m) return Float64(im_s * re) end
im\_m = abs(im); im\_s = sign(im) * abs(1.0); function tmp = code(im_s, re, im_m) tmp = im_s * re; end
im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * re), $MachinePrecision]
\begin{array}{l}
im\_m = \left|im\right|
\\
im\_s = \mathsf{copysign}\left(1, im\right)
\\
im\_s \cdot re
\end{array}
Initial program 68.7%
Taylor expanded in re around 0 53.6%
associate-*r*53.6%
*-commutative53.6%
Simplified53.6%
Applied egg-rr28.9%
rem-log-exp3.3%
Simplified3.3%
Final simplification3.3%
(FPCore (re im)
:precision binary64
(if (< (fabs im) 1.0)
(-
(*
(sin re)
(+
(+ im (* (* (* 0.16666666666666666 im) im) im))
(* (* (* (* (* 0.008333333333333333 im) im) im) im) im))))
(* (* 0.5 (sin re)) (- (exp (- im)) (exp im)))))
double code(double re, double im) {
double tmp;
if (fabs(im) < 1.0) {
tmp = -(sin(re) * ((im + (((0.16666666666666666 * im) * im) * im)) + (((((0.008333333333333333 * im) * im) * im) * im) * im)));
} else {
tmp = (0.5 * sin(re)) * (exp(-im) - exp(im));
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (abs(im) < 1.0d0) then
tmp = -(sin(re) * ((im + (((0.16666666666666666d0 * im) * im) * im)) + (((((0.008333333333333333d0 * im) * im) * im) * im) * im)))
else
tmp = (0.5d0 * sin(re)) * (exp(-im) - exp(im))
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (Math.abs(im) < 1.0) {
tmp = -(Math.sin(re) * ((im + (((0.16666666666666666 * im) * im) * im)) + (((((0.008333333333333333 * im) * im) * im) * im) * im)));
} else {
tmp = (0.5 * Math.sin(re)) * (Math.exp(-im) - Math.exp(im));
}
return tmp;
}
def code(re, im): tmp = 0 if math.fabs(im) < 1.0: tmp = -(math.sin(re) * ((im + (((0.16666666666666666 * im) * im) * im)) + (((((0.008333333333333333 * im) * im) * im) * im) * im))) else: tmp = (0.5 * math.sin(re)) * (math.exp(-im) - math.exp(im)) return tmp
function code(re, im) tmp = 0.0 if (abs(im) < 1.0) tmp = Float64(-Float64(sin(re) * Float64(Float64(im + Float64(Float64(Float64(0.16666666666666666 * im) * im) * im)) + Float64(Float64(Float64(Float64(Float64(0.008333333333333333 * im) * im) * im) * im) * im)))); else tmp = Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) - exp(im))); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (abs(im) < 1.0) tmp = -(sin(re) * ((im + (((0.16666666666666666 * im) * im) * im)) + (((((0.008333333333333333 * im) * im) * im) * im) * im))); else tmp = (0.5 * sin(re)) * (exp(-im) - exp(im)); end tmp_2 = tmp; end
code[re_, im_] := If[Less[N[Abs[im], $MachinePrecision], 1.0], (-N[(N[Sin[re], $MachinePrecision] * N[(N[(im + N[(N[(N[(0.16666666666666666 * im), $MachinePrecision] * im), $MachinePrecision] * im), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[(N[(0.008333333333333333 * im), $MachinePrecision] * im), $MachinePrecision] * im), $MachinePrecision] * im), $MachinePrecision] * im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] - N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left|im\right| < 1:\\
\;\;\;\;-\sin re \cdot \left(\left(im + \left(\left(0.16666666666666666 \cdot im\right) \cdot im\right) \cdot im\right) + \left(\left(\left(\left(0.008333333333333333 \cdot im\right) \cdot im\right) \cdot im\right) \cdot im\right) \cdot im\right)\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right)\\
\end{array}
\end{array}
herbie shell --seed 2024089
(FPCore (re im)
:name "math.cos on complex, imaginary part"
:precision binary64
:alt
(if (< (fabs im) 1.0) (- (* (sin re) (+ (+ im (* (* (* 0.16666666666666666 im) im) im)) (* (* (* (* (* 0.008333333333333333 im) im) im) im) im)))) (* (* 0.5 (sin re)) (- (exp (- im)) (exp im))))
(* (* 0.5 (sin re)) (- (exp (- im)) (exp im))))