
(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 9 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) 20000000000000.0)
(+ (* PI l_m) (/ (* (/ -1.0 F) (tan (* PI l_m))) 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) <= 20000000000000.0) {
tmp = (((double) M_PI) * l_m) + (((-1.0 / F) * tan((((double) M_PI) * l_m))) / 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) <= 20000000000000.0) {
tmp = (Math.PI * l_m) + (((-1.0 / F) * Math.tan((Math.PI * l_m))) / 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) <= 20000000000000.0: tmp = (math.pi * l_m) + (((-1.0 / F) * math.tan((math.pi * l_m))) / 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) <= 20000000000000.0) tmp = Float64(Float64(pi * l_m) + Float64(Float64(Float64(-1.0 / F) * tan(Float64(pi * l_m))) / 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) <= 20000000000000.0) tmp = (pi * l_m) + (((-1.0 / F) * tan((pi * l_m))) / 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], 20000000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[(N[(-1.0 / F), $MachinePrecision] * N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision]), $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 20000000000000:\\
\;\;\;\;\pi \cdot l\_m + \frac{\frac{-1}{F} \cdot \tan \left(\pi \cdot l\_m\right)}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e13Initial program 78.6%
associate-/r*N/A
frac-2negN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
neg-sub0N/A
--lowering--.f6489.0%
Applied egg-rr89.0%
if 2e13 < (*.f64 (PI.f64) l) Initial program 69.5%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6499.7%
Simplified99.7%
Final simplification91.9%
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) 20000000000000.0)
(- (* PI l_m) (/ (/ (tan (* 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) <= 20000000000000.0) {
tmp = (((double) M_PI) * l_m) - ((tan((((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) <= 20000000000000.0) {
tmp = (Math.PI * l_m) - ((Math.tan((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) <= 20000000000000.0: tmp = (math.pi * l_m) - ((math.tan((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) <= 20000000000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(tan(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) <= 20000000000000.0) tmp = (pi * l_m) - ((tan((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], 20000000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $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 20000000000000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\tan \left(\pi \cdot l\_m\right)}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e13Initial program 78.6%
*-commutativeN/A
un-div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6489.0%
Applied egg-rr89.0%
if 2e13 < (*.f64 (PI.f64) l) Initial program 69.5%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6499.7%
Simplified99.7%
Final simplification91.9%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 #s(literal 1 binary64) l)
(FPCore (l_s F l_m)
:precision binary64
(let* ((t_0 (* PI (* PI PI))))
(*
l_s
(if (<= (* PI l_m) 0.05)
(-
(* PI l_m)
(/
(/
(*
l_m
(+
PI
(*
(* l_m l_m)
(+
(* t_0 0.3333333333333333)
(* (* l_m l_m) (* (* PI (* PI t_0)) 0.13333333333333333))))))
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 t_0 = ((double) M_PI) * (((double) M_PI) * ((double) M_PI));
double tmp;
if ((((double) M_PI) * l_m) <= 0.05) {
tmp = (((double) M_PI) * l_m) - (((l_m * (((double) M_PI) + ((l_m * l_m) * ((t_0 * 0.3333333333333333) + ((l_m * l_m) * ((((double) M_PI) * (((double) M_PI) * t_0)) * 0.13333333333333333)))))) / 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 t_0 = Math.PI * (Math.PI * Math.PI);
double tmp;
if ((Math.PI * l_m) <= 0.05) {
tmp = (Math.PI * l_m) - (((l_m * (Math.PI + ((l_m * l_m) * ((t_0 * 0.3333333333333333) + ((l_m * l_m) * ((Math.PI * (Math.PI * t_0)) * 0.13333333333333333)))))) / 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): t_0 = math.pi * (math.pi * math.pi) tmp = 0 if (math.pi * l_m) <= 0.05: tmp = (math.pi * l_m) - (((l_m * (math.pi + ((l_m * l_m) * ((t_0 * 0.3333333333333333) + ((l_m * l_m) * ((math.pi * (math.pi * t_0)) * 0.13333333333333333)))))) / 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) t_0 = Float64(pi * Float64(pi * pi)) tmp = 0.0 if (Float64(pi * l_m) <= 0.05) tmp = Float64(Float64(pi * l_m) - Float64(Float64(Float64(l_m * Float64(pi + Float64(Float64(l_m * l_m) * Float64(Float64(t_0 * 0.3333333333333333) + Float64(Float64(l_m * l_m) * Float64(Float64(pi * Float64(pi * t_0)) * 0.13333333333333333)))))) / 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) t_0 = pi * (pi * pi); tmp = 0.0; if ((pi * l_m) <= 0.05) tmp = (pi * l_m) - (((l_m * (pi + ((l_m * l_m) * ((t_0 * 0.3333333333333333) + ((l_m * l_m) * ((pi * (pi * t_0)) * 0.13333333333333333)))))) / 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_] := Block[{t$95$0 = N[(Pi * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision]}, N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 0.05], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[(l$95$m * N[(Pi + N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(N[(t$95$0 * 0.3333333333333333), $MachinePrecision] + N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(N[(Pi * N[(Pi * t$95$0), $MachinePrecision]), $MachinePrecision] * 0.13333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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)
\\
\begin{array}{l}
t_0 := \pi \cdot \left(\pi \cdot \pi\right)\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 0.05:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{l\_m \cdot \left(\pi + \left(l\_m \cdot l\_m\right) \cdot \left(t\_0 \cdot 0.3333333333333333 + \left(l\_m \cdot l\_m\right) \cdot \left(\left(\pi \cdot \left(\pi \cdot t\_0\right)\right) \cdot 0.13333333333333333\right)\right)\right)}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 0.050000000000000003Initial program 78.7%
Taylor expanded in l around 0
Simplified64.4%
*-commutativeN/A
un-div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr74.9%
if 0.050000000000000003 < (*.f64 (PI.f64) l) Initial program 69.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6498.3%
Simplified98.3%
Final simplification81.3%
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) 20000000000000.0)
(+
(* PI l_m)
(/
(/ -1.0 F)
(* (+ (* l_m (* (* PI l_m) -0.3333333333333333)) (/ 1.0 PI)) (/ F 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) <= 20000000000000.0) {
tmp = (((double) M_PI) * l_m) + ((-1.0 / F) / (((l_m * ((((double) M_PI) * l_m) * -0.3333333333333333)) + (1.0 / ((double) M_PI))) * (F / l_m)));
} 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) <= 20000000000000.0) {
tmp = (Math.PI * l_m) + ((-1.0 / F) / (((l_m * ((Math.PI * l_m) * -0.3333333333333333)) + (1.0 / Math.PI)) * (F / l_m)));
} 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) <= 20000000000000.0: tmp = (math.pi * l_m) + ((-1.0 / F) / (((l_m * ((math.pi * l_m) * -0.3333333333333333)) + (1.0 / math.pi)) * (F / l_m))) 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) <= 20000000000000.0) tmp = Float64(Float64(pi * l_m) + Float64(Float64(-1.0 / F) / Float64(Float64(Float64(l_m * Float64(Float64(pi * l_m) * -0.3333333333333333)) + Float64(1.0 / pi)) * Float64(F / l_m)))); 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) <= 20000000000000.0) tmp = (pi * l_m) + ((-1.0 / F) / (((l_m * ((pi * l_m) * -0.3333333333333333)) + (1.0 / pi)) * (F / l_m))); 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], 20000000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[(-1.0 / F), $MachinePrecision] / N[(N[(N[(l$95$m * N[(N[(Pi * l$95$m), $MachinePrecision] * -0.3333333333333333), $MachinePrecision]), $MachinePrecision] + N[(1.0 / Pi), $MachinePrecision]), $MachinePrecision] * N[(F / l$95$m), $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 20000000000000:\\
\;\;\;\;\pi \cdot l\_m + \frac{\frac{-1}{F}}{\left(l\_m \cdot \left(\left(\pi \cdot l\_m\right) \cdot -0.3333333333333333\right) + \frac{1}{\pi}\right) \cdot \frac{F}{l\_m}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e13Initial program 78.6%
*-commutativeN/A
tan-quotN/A
clear-numN/A
associate-/r*N/A
frac-timesN/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
tan-quotN/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6489.0%
Applied egg-rr89.0%
Taylor expanded in l around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-out--N/A
metadata-evalN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6493.9%
Simplified93.9%
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f6488.1%
Applied egg-rr88.1%
if 2e13 < (*.f64 (PI.f64) l) Initial program 69.5%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6499.7%
Simplified99.7%
Final simplification91.2%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 #s(literal 1 binary64) l)
(FPCore (l_s F l_m)
:precision binary64
(let* ((t_0 (/ (/ (* PI l_m) F) (- 0.0 F))))
(*
l_s
(if (<= F 7.2e-166)
t_0
(if (<= F 4.9e-74) (* PI l_m) (if (<= F 8.8e-19) t_0 (* PI l_m)))))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double t_0 = ((((double) M_PI) * l_m) / F) / (0.0 - F);
double tmp;
if (F <= 7.2e-166) {
tmp = t_0;
} else if (F <= 4.9e-74) {
tmp = ((double) M_PI) * l_m;
} else if (F <= 8.8e-19) {
tmp = t_0;
} 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 t_0 = ((Math.PI * l_m) / F) / (0.0 - F);
double tmp;
if (F <= 7.2e-166) {
tmp = t_0;
} else if (F <= 4.9e-74) {
tmp = Math.PI * l_m;
} else if (F <= 8.8e-19) {
tmp = t_0;
} 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): t_0 = ((math.pi * l_m) / F) / (0.0 - F) tmp = 0 if F <= 7.2e-166: tmp = t_0 elif F <= 4.9e-74: tmp = math.pi * l_m elif F <= 8.8e-19: tmp = t_0 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) t_0 = Float64(Float64(Float64(pi * l_m) / F) / Float64(0.0 - F)) tmp = 0.0 if (F <= 7.2e-166) tmp = t_0; elseif (F <= 4.9e-74) tmp = Float64(pi * l_m); elseif (F <= 8.8e-19) tmp = t_0; 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) t_0 = ((pi * l_m) / F) / (0.0 - F); tmp = 0.0; if (F <= 7.2e-166) tmp = t_0; elseif (F <= 4.9e-74) tmp = pi * l_m; elseif (F <= 8.8e-19) tmp = t_0; 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_] := Block[{t$95$0 = N[(N[(N[(Pi * l$95$m), $MachinePrecision] / F), $MachinePrecision] / N[(0.0 - F), $MachinePrecision]), $MachinePrecision]}, N[(l$95$s * If[LessEqual[F, 7.2e-166], t$95$0, If[LessEqual[F, 4.9e-74], N[(Pi * l$95$m), $MachinePrecision], If[LessEqual[F, 8.8e-19], t$95$0, N[(Pi * l$95$m), $MachinePrecision]]]]), $MachinePrecision]]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
\begin{array}{l}
t_0 := \frac{\frac{\pi \cdot l\_m}{F}}{0 - F}\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;F \leq 7.2 \cdot 10^{-166}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;F \leq 4.9 \cdot 10^{-74}:\\
\;\;\;\;\pi \cdot l\_m\\
\mathbf{elif}\;F \leq 8.8 \cdot 10^{-19}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
\end{array}
if F < 7.2000000000000002e-166 or 4.9000000000000003e-74 < F < 8.7999999999999994e-19Initial program 67.6%
Taylor expanded in l around 0
*-lowering-*.f64N/A
--lowering--.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
unpow2N/A
*-lowering-*.f6458.9%
Simplified58.9%
Taylor expanded in F around 0
mul-1-negN/A
associate-/l*N/A
neg-sub0N/A
--lowering--.f64N/A
associate-/l*N/A
unpow2N/A
associate-/r*N/A
associate-/l*N/A
/-lowering-/.f64N/A
associate-/l*N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6438.3%
Simplified38.3%
sub0-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6438.3%
Applied egg-rr38.3%
if 7.2000000000000002e-166 < F < 4.9000000000000003e-74 or 8.7999999999999994e-19 < F Initial program 90.7%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6490.5%
Simplified90.5%
Final simplification57.6%
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) 0.05)
(+ (* PI l_m) (/ (* (* PI l_m) (/ -1.0 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) <= 0.05) {
tmp = (((double) M_PI) * l_m) + (((((double) M_PI) * l_m) * (-1.0 / 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) <= 0.05) {
tmp = (Math.PI * l_m) + (((Math.PI * l_m) * (-1.0 / 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) <= 0.05: tmp = (math.pi * l_m) + (((math.pi * l_m) * (-1.0 / 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) <= 0.05) tmp = Float64(Float64(pi * l_m) + Float64(Float64(Float64(pi * l_m) * Float64(-1.0 / 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) <= 0.05) tmp = (pi * l_m) + (((pi * l_m) * (-1.0 / 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], 0.05], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[(N[(Pi * l$95$m), $MachinePrecision] * N[(-1.0 / F), $MachinePrecision]), $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 0.05:\\
\;\;\;\;\pi \cdot l\_m + \frac{\left(\pi \cdot l\_m\right) \cdot \frac{-1}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 0.050000000000000003Initial program 78.7%
associate-/r*N/A
frac-2negN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
neg-sub0N/A
--lowering--.f6489.3%
Applied egg-rr89.3%
Taylor expanded in l around 0
*-lowering-*.f64N/A
PI-lowering-PI.f6485.9%
Simplified85.9%
if 0.050000000000000003 < (*.f64 (PI.f64) l) Initial program 69.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6498.3%
Simplified98.3%
Final simplification89.3%
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) 0.05) (- (* 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) <= 0.05) {
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) <= 0.05) {
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) <= 0.05: 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) <= 0.05) 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) <= 0.05) 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], 0.05], 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 0.05:\\
\;\;\;\;\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) < 0.050000000000000003Initial program 78.7%
*-commutativeN/A
un-div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6489.3%
Applied egg-rr89.3%
Taylor expanded in l around 0
unpow2N/A
associate-/r*N/A
associate-/l*N/A
/-lowering-/.f64N/A
associate-/l*N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6485.9%
Simplified85.9%
if 0.050000000000000003 < (*.f64 (PI.f64) l) Initial program 69.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6498.3%
Simplified98.3%
Final simplification89.3%
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) 0.05) (* 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) <= 0.05) {
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) <= 0.05) {
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) <= 0.05: 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) <= 0.05) 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) <= 0.05) 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], 0.05], 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 0.05:\\
\;\;\;\;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) < 0.050000000000000003Initial program 78.7%
Taylor expanded in l around 0
*-lowering-*.f64N/A
--lowering--.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
unpow2N/A
*-lowering-*.f6475.4%
Simplified75.4%
if 0.050000000000000003 < (*.f64 (PI.f64) l) Initial program 69.2%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6498.3%
Simplified98.3%
Final simplification81.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 (* 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 76.1%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6472.7%
Simplified72.7%
Final simplification72.7%
herbie shell --seed 2024191
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))