
(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) 5000000000.0)
(- (* PI l_m) (/ (/ (tan (* PI l_m)) F) F))
(* (* l_m (sqrt (* PI (sqrt PI)))) (sqrt (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) <= 5000000000.0) {
tmp = (((double) M_PI) * l_m) - ((tan((((double) M_PI) * l_m)) / F) / F);
} else {
tmp = (l_m * sqrt((((double) M_PI) * sqrt(((double) M_PI))))) * sqrt(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) <= 5000000000.0) {
tmp = (Math.PI * l_m) - ((Math.tan((Math.PI * l_m)) / F) / F);
} else {
tmp = (l_m * Math.sqrt((Math.PI * Math.sqrt(Math.PI)))) * Math.sqrt(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) <= 5000000000.0: tmp = (math.pi * l_m) - ((math.tan((math.pi * l_m)) / F) / F) else: tmp = (l_m * math.sqrt((math.pi * math.sqrt(math.pi)))) * math.sqrt(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) <= 5000000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(tan(Float64(pi * l_m)) / F) / F)); else tmp = Float64(Float64(l_m * sqrt(Float64(pi * sqrt(pi)))) * sqrt(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) <= 5000000000.0) tmp = (pi * l_m) - ((tan((pi * l_m)) / F) / F); else tmp = (l_m * sqrt((pi * sqrt(pi)))) * sqrt(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], 5000000000.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[(N[(l$95$m * N[Sqrt[N[(Pi * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[Sqrt[Pi], $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 5000000000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\tan \left(\pi \cdot l\_m\right)}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{\pi \cdot \sqrt{\pi}}\right) \cdot \sqrt{\sqrt{\pi}}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5e9Initial program 80.7%
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-/.f6485.4
Applied egg-rr85.4%
if 5e9 < (*.f64 (PI.f64) l) Initial program 63.8%
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
associate-*r*N/A
lower-*.f64N/A
lower-*.f6499.6
Applied egg-rr99.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) (* (tan (* PI l_m)) (/ -1.0 (* F F)))) -5e-254)
(- (* 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) + (tan((((double) M_PI) * l_m)) * (-1.0 / (F * F)))) <= -5e-254) {
tmp = -(((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) + (Math.tan((Math.PI * l_m)) * (-1.0 / (F * F)))) <= -5e-254) {
tmp = -(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) + (math.tan((math.pi * l_m)) * (-1.0 / (F * F)))) <= -5e-254: tmp = -(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(Float64(pi * l_m) + Float64(tan(Float64(pi * l_m)) * Float64(-1.0 / Float64(F * F)))) <= -5e-254) tmp = Float64(-Float64(pi * 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) + (tan((pi * l_m)) * (-1.0 / (F * F)))) <= -5e-254) tmp = -(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[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-254], (-N[(Pi * N[(l$95$m / N[(F * F), $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 + \tan \left(\pi \cdot l\_m\right) \cdot \frac{-1}{F \cdot F} \leq -5 \cdot 10^{-254}:\\
\;\;\;\;-\pi \cdot \frac{l\_m}{F \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) < -5.0000000000000003e-254Initial program 76.0%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6469.4
Simplified69.4%
Taylor expanded in F around 0
mul-1-negN/A
distribute-neg-fracN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6422.7
Simplified22.7%
lift-PI.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-frac-negN/A
div-invN/A
lift-*.f64N/A
associate-/l/N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied egg-rr22.7%
if -5.0000000000000003e-254 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) Initial program 77.8%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6475.3
Simplified75.3%
Final simplification51.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
(if (<= (* PI l_m) 2.0)
(- (* PI l_m) (/ (/ (* PI l_m) F) F))
(* (* l_m (sqrt (* PI (sqrt PI)))) (sqrt (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) <= 2.0) {
tmp = (((double) M_PI) * l_m) - (((((double) M_PI) * l_m) / F) / F);
} else {
tmp = (l_m * sqrt((((double) M_PI) * sqrt(((double) M_PI))))) * sqrt(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) <= 2.0) {
tmp = (Math.PI * l_m) - (((Math.PI * l_m) / F) / F);
} else {
tmp = (l_m * Math.sqrt((Math.PI * Math.sqrt(Math.PI)))) * Math.sqrt(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) <= 2.0: tmp = (math.pi * l_m) - (((math.pi * l_m) / F) / F) else: tmp = (l_m * math.sqrt((math.pi * math.sqrt(math.pi)))) * math.sqrt(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) <= 2.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(Float64(pi * l_m) / F) / F)); else tmp = Float64(Float64(l_m * sqrt(Float64(pi * sqrt(pi)))) * sqrt(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) <= 2.0) tmp = (pi * l_m) - (((pi * l_m) / F) / F); else tmp = (l_m * sqrt((pi * sqrt(pi)))) * sqrt(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], 2.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[(Pi * l$95$m), $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(N[(l$95$m * N[Sqrt[N[(Pi * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[Sqrt[Pi], $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:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\pi \cdot l\_m}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{\pi \cdot \sqrt{\pi}}\right) \cdot \sqrt{\sqrt{\pi}}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2Initial program 80.7%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6476.8
Simplified76.8%
lift-*.f64N/A
lift-PI.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l/N/A
*-lft-identityN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6481.5
Applied egg-rr81.5%
if 2 < (*.f64 (PI.f64) l) Initial program 64.3%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6496.2
Simplified96.2%
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
associate-*r*N/A
lower-*.f64N/A
lower-*.f6496.3
Applied egg-rr96.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) 5e-14)
(- (* PI l_m) (/ (/ (* PI l_m) F) F))
(/ (* l_m (* PI PI)) 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) <= 5e-14) {
tmp = (((double) M_PI) * l_m) - (((((double) M_PI) * l_m) / F) / F);
} else {
tmp = (l_m * (((double) M_PI) * ((double) M_PI))) / ((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) <= 5e-14) {
tmp = (Math.PI * l_m) - (((Math.PI * l_m) / F) / F);
} else {
tmp = (l_m * (Math.PI * Math.PI)) / 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) <= 5e-14: tmp = (math.pi * l_m) - (((math.pi * l_m) / F) / F) else: tmp = (l_m * (math.pi * math.pi)) / 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) <= 5e-14) tmp = Float64(Float64(pi * l_m) - Float64(Float64(Float64(pi * l_m) / F) / F)); else tmp = Float64(Float64(l_m * Float64(pi * pi)) / 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) <= 5e-14) tmp = (pi * l_m) - (((pi * l_m) / F) / F); else tmp = (l_m * (pi * pi)) / 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], 5e-14], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[(Pi * l$95$m), $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(N[(l$95$m * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision] / Pi), $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 5 \cdot 10^{-14}:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\pi \cdot l\_m}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\frac{l\_m \cdot \left(\pi \cdot \pi\right)}{\pi}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5.0000000000000002e-14Initial program 80.6%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6476.7
Simplified76.7%
lift-*.f64N/A
lift-PI.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l/N/A
*-lft-identityN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6481.4
Applied egg-rr81.4%
if 5.0000000000000002e-14 < (*.f64 (PI.f64) l) Initial program 64.9%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6496.3
Simplified96.3%
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-rr96.2%
lift-PI.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-PI.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6496.3
Applied egg-rr96.3%
lift-PI.f64N/A
lift-PI.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-PI.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l*N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-*.f64N/A
Applied egg-rr96.2%
Final simplification84.8%
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) 5e-14)
(* PI (- l_m (/ l_m (* F F))))
(/ (* l_m (* PI PI)) 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) <= 5e-14) {
tmp = ((double) M_PI) * (l_m - (l_m / (F * F)));
} else {
tmp = (l_m * (((double) M_PI) * ((double) M_PI))) / ((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) <= 5e-14) {
tmp = Math.PI * (l_m - (l_m / (F * F)));
} else {
tmp = (l_m * (Math.PI * Math.PI)) / 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) <= 5e-14: tmp = math.pi * (l_m - (l_m / (F * F))) else: tmp = (l_m * (math.pi * math.pi)) / 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) <= 5e-14) tmp = Float64(pi * Float64(l_m - Float64(l_m / Float64(F * F)))); else tmp = Float64(Float64(l_m * Float64(pi * pi)) / 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) <= 5e-14) tmp = pi * (l_m - (l_m / (F * F))); else tmp = (l_m * (pi * pi)) / 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], 5e-14], N[(Pi * N[(l$95$m - N[(l$95$m / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l$95$m * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision] / Pi), $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 5 \cdot 10^{-14}:\\
\;\;\;\;\pi \cdot \left(l\_m - \frac{l\_m}{F \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{l\_m \cdot \left(\pi \cdot \pi\right)}{\pi}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5.0000000000000002e-14Initial program 80.6%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6476.7
Simplified76.7%
lift-PI.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-PI.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-out--N/A
lower-*.f64N/A
lower--.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lower-/.f6476.7
Applied egg-rr76.7%
if 5.0000000000000002e-14 < (*.f64 (PI.f64) l) Initial program 64.9%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6496.3
Simplified96.3%
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-rr96.2%
lift-PI.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-PI.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6496.3
Applied egg-rr96.3%
lift-PI.f64N/A
lift-PI.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lift-PI.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l*N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lift-*.f64N/A
Applied egg-rr96.2%
Final simplification81.2%
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-24) (* 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) <= 2e-24) {
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) <= 2e-24) {
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) <= 2e-24: 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) <= 2e-24) 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) <= 2e-24) 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], 2e-24], 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 2 \cdot 10^{-24}:\\
\;\;\;\;\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) < 1.99999999999999985e-24Initial program 80.4%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6476.4
Simplified76.4%
lift-PI.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-PI.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-out--N/A
lower-*.f64N/A
lower--.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lower-/.f6476.4
Applied egg-rr76.4%
if 1.99999999999999985e-24 < (*.f64 (PI.f64) l) Initial program 66.0%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6496.4
Simplified96.4%
Final simplification81.2%
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-24) (* 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) <= 2e-24) {
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) <= 2e-24) {
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) <= 2e-24: 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) <= 2e-24) 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) <= 2e-24) 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], 2e-24], 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 2 \cdot 10^{-24}:\\
\;\;\;\;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) < 1.99999999999999985e-24Initial program 80.4%
Taylor expanded in l around 0
lower-*.f64N/A
lower--.f64N/A
lower-PI.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6476.4
Simplified76.4%
if 1.99999999999999985e-24 < (*.f64 (PI.f64) l) Initial program 66.0%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6496.4
Simplified96.4%
Final simplification81.2%
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 77.0%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6475.4
Simplified75.4%
Final simplification75.4%
herbie shell --seed 2024207
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))