
(FPCore (F l) :precision binary64 (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))
double code(double F, double l) {
return (((double) M_PI) * l) - ((1.0 / (F * F)) * tan((((double) M_PI) * l)));
}
public static double code(double F, double l) {
return (Math.PI * l) - ((1.0 / (F * F)) * Math.tan((Math.PI * l)));
}
def code(F, l): return (math.pi * l) - ((1.0 / (F * F)) * math.tan((math.pi * l)))
function code(F, l) return Float64(Float64(pi * l) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l)))) end
function tmp = code(F, l) tmp = (pi * l) - ((1.0 / (F * F)) * tan((pi * l))); end
code[F_, l_] := N[(N[(Pi * l), $MachinePrecision] - N[(N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] * N[Tan[N[(Pi * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (F l) :precision binary64 (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))
double code(double F, double l) {
return (((double) M_PI) * l) - ((1.0 / (F * F)) * tan((((double) M_PI) * l)));
}
public static double code(double F, double l) {
return (Math.PI * l) - ((1.0 / (F * F)) * Math.tan((Math.PI * l)));
}
def code(F, l): return (math.pi * l) - ((1.0 / (F * F)) * math.tan((math.pi * l)))
function code(F, l) return Float64(Float64(pi * l) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l)))) end
function tmp = code(F, l) tmp = (pi * l) - ((1.0 / (F * F)) * tan((pi * l))); end
code[F_, l_] := N[(N[(Pi * l), $MachinePrecision] - N[(N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] * N[Tan[N[(Pi * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)
\end{array}
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 #s(literal 1 binary64) l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 2e+14)
(- (* PI l_m) (/ (/ (tan (* PI l_m)) F) F))
(* (* l_m (sqrt (sqrt PI))) (sqrt (* PI (sqrt PI)))))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 2e+14) {
tmp = (((double) M_PI) * l_m) - ((tan((((double) M_PI) * l_m)) / F) / F);
} else {
tmp = (l_m * sqrt(sqrt(((double) M_PI)))) * sqrt((((double) M_PI) * sqrt(((double) M_PI))));
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if ((Math.PI * l_m) <= 2e+14) {
tmp = (Math.PI * l_m) - ((Math.tan((Math.PI * l_m)) / F) / F);
} else {
tmp = (l_m * Math.sqrt(Math.sqrt(Math.PI))) * Math.sqrt((Math.PI * Math.sqrt(Math.PI)));
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if (math.pi * l_m) <= 2e+14: tmp = (math.pi * l_m) - ((math.tan((math.pi * l_m)) / F) / F) else: tmp = (l_m * math.sqrt(math.sqrt(math.pi))) * math.sqrt((math.pi * math.sqrt(math.pi))) return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 2e+14) tmp = Float64(Float64(pi * l_m) - Float64(Float64(tan(Float64(pi * l_m)) / F) / F)); else tmp = Float64(Float64(l_m * sqrt(sqrt(pi))) * sqrt(Float64(pi * sqrt(pi)))); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if ((pi * l_m) <= 2e+14) tmp = (pi * l_m) - ((tan((pi * l_m)) / F) / F); else tmp = (l_m * sqrt(sqrt(pi))) * sqrt((pi * sqrt(pi))); end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 2e+14], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(N[(l$95$m * N[Sqrt[N[Sqrt[Pi], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(Pi * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 2 \cdot 10^{+14}:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\tan \left(\pi \cdot l\_m\right)}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{\sqrt{\pi}}\right) \cdot \sqrt{\pi \cdot \sqrt{\pi}}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e14Initial program 78.0%
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-*l/N/A
*-lft-identityN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6488.7
Applied egg-rr88.7%
if 2e14 < (*.f64 (PI.f64) l) Initial program 63.7%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.5
Simplified99.5%
lift-PI.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*r*N/A
lift-*.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
Applied egg-rr99.7%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 #s(literal 1 binary64) l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 1e-8)
(fma PI l_m (- (/ (/ (* PI l_m) F) F)))
(* (* l_m (sqrt (sqrt PI))) (sqrt (* PI (sqrt PI)))))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 1e-8) {
tmp = fma(((double) M_PI), l_m, -(((((double) M_PI) * l_m) / F) / F));
} else {
tmp = (l_m * sqrt(sqrt(((double) M_PI)))) * sqrt((((double) M_PI) * sqrt(((double) M_PI))));
}
return l_s * tmp;
}
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 1e-8) tmp = fma(pi, l_m, Float64(-Float64(Float64(Float64(pi * l_m) / F) / F))); else tmp = Float64(Float64(l_m * sqrt(sqrt(pi))) * sqrt(Float64(pi * sqrt(pi)))); end return Float64(l_s * tmp) end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 1e-8], N[(Pi * l$95$m + (-N[(N[(N[(Pi * l$95$m), $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision])), $MachinePrecision], N[(N[(l$95$m * N[Sqrt[N[Sqrt[Pi], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(Pi * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 10^{-8}:\\
\;\;\;\;\mathsf{fma}\left(\pi, l\_m, -\frac{\frac{\pi \cdot l\_m}{F}}{F}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{\sqrt{\pi}}\right) \cdot \sqrt{\pi \cdot \sqrt{\pi}}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e-8Initial program 77.8%
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
lift-*.f64N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lower-neg.f6477.8
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lower-/.f6478.6
Applied egg-rr78.6%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6472.5
Simplified72.5%
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f64N/A
lower-neg.f6482.5
Applied egg-rr82.5%
if 1e-8 < (*.f64 (PI.f64) l) Initial program 64.9%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.5
Simplified99.5%
lift-PI.f64N/A
rem-square-sqrtN/A
sqrt-unprodN/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*r*N/A
lift-*.f64N/A
sqrt-unprodN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
Applied egg-rr99.6%
Final simplification86.4%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 #s(literal 1 binary64) l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 1e-8)
(fma PI l_m (- (/ (/ (* PI l_m) F) F)))
(* PI l_m))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 1e-8) {
tmp = fma(((double) M_PI), l_m, -(((((double) M_PI) * l_m) / F) / F));
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 1e-8) tmp = fma(pi, l_m, Float64(-Float64(Float64(Float64(pi * l_m) / F) / F))); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 1e-8], N[(Pi * l$95$m + (-N[(N[(N[(Pi * l$95$m), $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision])), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 10^{-8}:\\
\;\;\;\;\mathsf{fma}\left(\pi, l\_m, -\frac{\frac{\pi \cdot l\_m}{F}}{F}\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e-8Initial program 77.8%
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
lift-*.f64N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lower-neg.f6477.8
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lower-/.f6478.6
Applied egg-rr78.6%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6472.5
Simplified72.5%
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f64N/A
lower-neg.f6482.5
Applied egg-rr82.5%
if 1e-8 < (*.f64 (PI.f64) l) Initial program 64.9%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.5
Simplified99.5%
Final simplification86.4%
l\_m = (fabs.f64 l) l\_s = (copysign.f64 #s(literal 1 binary64) l) (FPCore (l_s F l_m) :precision binary64 (* l_s (if (<= (* PI l_m) 1e-8) (- (* PI l_m) (/ (/ (* PI l_m) F) F)) (* PI l_m))))
l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 1e-8) {
tmp = (((double) M_PI) * l_m) - (((((double) M_PI) * l_m) / F) / F);
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if ((Math.PI * l_m) <= 1e-8) {
tmp = (Math.PI * l_m) - (((Math.PI * l_m) / F) / F);
} else {
tmp = Math.PI * l_m;
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if (math.pi * l_m) <= 1e-8: tmp = (math.pi * l_m) - (((math.pi * l_m) / F) / F) else: tmp = math.pi * l_m return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 1e-8) tmp = Float64(Float64(pi * l_m) - Float64(Float64(Float64(pi * l_m) / F) / F)); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if ((pi * l_m) <= 1e-8) tmp = (pi * l_m) - (((pi * l_m) / F) / F); else tmp = pi * l_m; end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 1e-8], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[(Pi * l$95$m), $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 10^{-8}:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\pi \cdot l\_m}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e-8Initial program 77.8%
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-*l/N/A
*-lft-identityN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6488.6
Applied egg-rr88.6%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6482.5
Simplified82.5%
if 1e-8 < (*.f64 (PI.f64) l) Initial program 64.9%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.5
Simplified99.5%
Final simplification86.4%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 #s(literal 1 binary64) l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 1e-8)
(fma PI (/ (- l_m) (* F F)) (* PI l_m))
(* PI l_m))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 1e-8) {
tmp = fma(((double) M_PI), (-l_m / (F * F)), (((double) M_PI) * l_m));
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 1e-8) tmp = fma(pi, Float64(Float64(-l_m) / Float64(F * F)), Float64(pi * l_m)); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 1e-8], N[(Pi * N[((-l$95$m) / N[(F * F), $MachinePrecision]), $MachinePrecision] + N[(Pi * l$95$m), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 10^{-8}:\\
\;\;\;\;\mathsf{fma}\left(\pi, \frac{-l\_m}{F \cdot F}, \pi \cdot l\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e-8Initial program 77.8%
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
lift-*.f64N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lower-neg.f6477.8
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lower-/.f6478.6
Applied egg-rr78.6%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6472.5
Simplified72.5%
Applied egg-rr72.5%
if 1e-8 < (*.f64 (PI.f64) l) Initial program 64.9%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.5
Simplified99.5%
Final simplification78.7%
l\_m = (fabs.f64 l) l\_s = (copysign.f64 #s(literal 1 binary64) l) (FPCore (l_s F l_m) :precision binary64 (* l_s (if (<= (* PI l_m) 1e-8) (* PI (- l_m (/ l_m (* F F)))) (* PI l_m))))
l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 1e-8) {
tmp = ((double) M_PI) * (l_m - (l_m / (F * F)));
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if ((Math.PI * l_m) <= 1e-8) {
tmp = Math.PI * (l_m - (l_m / (F * F)));
} else {
tmp = Math.PI * l_m;
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if (math.pi * l_m) <= 1e-8: tmp = math.pi * (l_m - (l_m / (F * F))) else: tmp = math.pi * l_m return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 1e-8) tmp = Float64(pi * Float64(l_m - Float64(l_m / Float64(F * F)))); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if ((pi * l_m) <= 1e-8) tmp = pi * (l_m - (l_m / (F * F))); else tmp = pi * l_m; end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 1e-8], N[(Pi * N[(l$95$m - N[(l$95$m / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 10^{-8}:\\
\;\;\;\;\pi \cdot \left(l\_m - \frac{l\_m}{F \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e-8Initial program 77.8%
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
lift-*.f64N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lower-neg.f6477.8
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lower-/.f6478.6
Applied egg-rr78.6%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6472.5
Simplified72.5%
Applied egg-rr72.5%
lift-PI.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6472.5
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-neg2N/A
lower-neg.f64N/A
lower-/.f6472.5
Applied egg-rr72.5%
if 1e-8 < (*.f64 (PI.f64) l) Initial program 64.9%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.5
Simplified99.5%
Final simplification78.7%
l\_m = (fabs.f64 l) l\_s = (copysign.f64 #s(literal 1 binary64) l) (FPCore (l_s F l_m) :precision binary64 (* l_s (if (<= (* PI l_m) 1e-8) (* l_m (- PI (/ PI (* F F)))) (* PI l_m))))
l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 1e-8) {
tmp = l_m * (((double) M_PI) - (((double) M_PI) / (F * F)));
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if ((Math.PI * l_m) <= 1e-8) {
tmp = l_m * (Math.PI - (Math.PI / (F * F)));
} else {
tmp = Math.PI * l_m;
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if (math.pi * l_m) <= 1e-8: tmp = l_m * (math.pi - (math.pi / (F * F))) else: tmp = math.pi * l_m return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 1e-8) tmp = Float64(l_m * Float64(pi - Float64(pi / Float64(F * F)))); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if ((pi * l_m) <= 1e-8) tmp = l_m * (pi - (pi / (F * F))); else tmp = pi * l_m; end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 1e-8], N[(l$95$m * N[(Pi - N[(Pi / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 10^{-8}:\\
\;\;\;\;l\_m \cdot \left(\pi - \frac{\pi}{F \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e-8Initial program 77.8%
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
lift-*.f64N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lower-neg.f6477.8
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lower-/.f6478.6
Applied egg-rr78.6%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6472.5
Simplified72.5%
lift-PI.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
unsub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
distribute-lft-out--N/A
lower-*.f64N/A
lower--.f64N/A
lower-/.f6471.7
Applied egg-rr71.7%
if 1e-8 < (*.f64 (PI.f64) l) Initial program 64.9%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.5
Simplified99.5%
Final simplification78.1%
l\_m = (fabs.f64 l) l\_s = (copysign.f64 #s(literal 1 binary64) l) (FPCore (l_s F l_m) :precision binary64 (* l_s (* PI l_m)))
l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
return l_s * (((double) M_PI) * l_m);
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
return l_s * (Math.PI * l_m);
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): return l_s * (math.pi * l_m)
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) return Float64(l_s * Float64(pi * l_m)) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp = code(l_s, F, l_m) tmp = l_s * (pi * l_m); end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * N[(Pi * l$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \left(\pi \cdot l\_m\right)
\end{array}
Initial program 74.8%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6471.7
Simplified71.7%
Final simplification71.7%
herbie shell --seed 2024214
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))