
(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) 10000000.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) <= 10000000.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) <= 10000000.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) <= 10000000.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) <= 10000000.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) <= 10000000.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], 10000000.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 10000000:\\
\;\;\;\;\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) < 1e7Initial program 79.0%
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6487.2%
Applied egg-rr87.2%
if 1e7 < (*.f64 (PI.f64) l) Initial program 60.5%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6499.6%
Simplified99.6%
Final simplification90.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) 0.02)
(-
(* PI l_m)
(/
(*
l_m
(+
(* (* l_m l_m) (/ (* (* PI (* PI PI)) 0.3333333333333333) F))
(/ 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.02) {
tmp = (((double) M_PI) * l_m) - ((l_m * (((l_m * l_m) * (((((double) M_PI) * (((double) M_PI) * ((double) M_PI))) * 0.3333333333333333) / F)) + (((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.02) {
tmp = (Math.PI * l_m) - ((l_m * (((l_m * l_m) * (((Math.PI * (Math.PI * Math.PI)) * 0.3333333333333333) / F)) + (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.02: tmp = (math.pi * l_m) - ((l_m * (((l_m * l_m) * (((math.pi * (math.pi * math.pi)) * 0.3333333333333333) / F)) + (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.02) tmp = Float64(Float64(pi * l_m) - Float64(Float64(l_m * Float64(Float64(Float64(l_m * l_m) * Float64(Float64(Float64(pi * Float64(pi * pi)) * 0.3333333333333333) / F)) + Float64(pi / 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.02) tmp = (pi * l_m) - ((l_m * (((l_m * l_m) * (((pi * (pi * pi)) * 0.3333333333333333) / F)) + (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.02], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(l$95$m * N[(N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(N[(N[(Pi * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision] * 0.3333333333333333), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision] + N[(Pi / F), $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 0.02:\\
\;\;\;\;\pi \cdot l\_m - \frac{l\_m \cdot \left(\left(l\_m \cdot l\_m\right) \cdot \frac{\left(\pi \cdot \left(\pi \cdot \pi\right)\right) \cdot 0.3333333333333333}{F} + \frac{\pi}{F}\right)}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 0.0200000000000000004Initial program 78.9%
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6487.2%
Applied egg-rr87.2%
Taylor expanded in l around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
Simplified73.9%
if 0.0200000000000000004 < (*.f64 (PI.f64) l) Initial program 61.1%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6498.0%
Simplified98.0%
Final simplification79.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) 0.02)
(-
(* PI l_m)
(/
(/
(* l_m (+ PI (* l_m (* l_m (* (* PI (* PI PI)) 0.3333333333333333)))))
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.02) {
tmp = (((double) M_PI) * l_m) - (((l_m * (((double) M_PI) + (l_m * (l_m * ((((double) M_PI) * (((double) M_PI) * ((double) M_PI))) * 0.3333333333333333))))) / 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.02) {
tmp = (Math.PI * l_m) - (((l_m * (Math.PI + (l_m * (l_m * ((Math.PI * (Math.PI * Math.PI)) * 0.3333333333333333))))) / 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.02: tmp = (math.pi * l_m) - (((l_m * (math.pi + (l_m * (l_m * ((math.pi * (math.pi * math.pi)) * 0.3333333333333333))))) / 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.02) tmp = Float64(Float64(pi * l_m) - Float64(Float64(Float64(l_m * Float64(pi + Float64(l_m * Float64(l_m * Float64(Float64(pi * Float64(pi * pi)) * 0.3333333333333333))))) / 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.02) tmp = (pi * l_m) - (((l_m * (pi + (l_m * (l_m * ((pi * (pi * pi)) * 0.3333333333333333))))) / 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.02], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[(l$95$m * N[(Pi + N[(l$95$m * N[(l$95$m * N[(N[(Pi * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision] * 0.3333333333333333), $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)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 0.02:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{l\_m \cdot \left(\pi + l\_m \cdot \left(l\_m \cdot \left(\left(\pi \cdot \left(\pi \cdot \pi\right)\right) \cdot 0.3333333333333333\right)\right)\right)}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 0.0200000000000000004Initial program 78.9%
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6487.2%
Applied egg-rr87.2%
Taylor expanded in l around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
PI-lowering-PI.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
unpow2N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
PI-lowering-PI.f64N/A
metadata-eval72.9%
Simplified72.9%
if 0.0200000000000000004 < (*.f64 (PI.f64) l) Initial program 61.1%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6498.0%
Simplified98.0%
Final simplification79.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 (<= F 7.6e-161)
(* PI l_m)
(if (<= F 3.6e-96) (/ l_m (/ F (/ PI (- 0.0 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 (F <= 7.6e-161) {
tmp = ((double) M_PI) * l_m;
} else if (F <= 3.6e-96) {
tmp = l_m / (F / (((double) M_PI) / (0.0 - 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 (F <= 7.6e-161) {
tmp = Math.PI * l_m;
} else if (F <= 3.6e-96) {
tmp = l_m / (F / (Math.PI / (0.0 - 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 F <= 7.6e-161: tmp = math.pi * l_m elif F <= 3.6e-96: tmp = l_m / (F / (math.pi / (0.0 - 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 (F <= 7.6e-161) tmp = Float64(pi * l_m); elseif (F <= 3.6e-96) tmp = Float64(l_m / Float64(F / Float64(pi / Float64(0.0 - 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 (F <= 7.6e-161) tmp = pi * l_m; elseif (F <= 3.6e-96) tmp = l_m / (F / (pi / (0.0 - 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[F, 7.6e-161], N[(Pi * l$95$m), $MachinePrecision], If[LessEqual[F, 3.6e-96], N[(l$95$m / N[(F / N[(Pi / N[(0.0 - 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}\;F \leq 7.6 \cdot 10^{-161}:\\
\;\;\;\;\pi \cdot l\_m\\
\mathbf{elif}\;F \leq 3.6 \cdot 10^{-96}:\\
\;\;\;\;\frac{l\_m}{\frac{F}{\frac{\pi}{0 - F}}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if F < 7.6000000000000003e-161 or 3.60000000000000008e-96 < F Initial program 75.0%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6474.0%
Simplified74.0%
if 7.6000000000000003e-161 < F < 3.60000000000000008e-96Initial program 67.1%
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-*.f6456.1%
Simplified56.1%
Taylor expanded in F around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
associate-/r*N/A
associate-/l*N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6462.5%
Simplified62.5%
sub0-negN/A
clear-numN/A
distribute-neg-fracN/A
associate-*r/N/A
associate-/r/N/A
distribute-neg-fracN/A
associate-/l/N/A
neg-lowering-neg.f64N/A
associate-/l/N/A
associate-*l/N/A
clear-numN/A
times-fracN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6458.0%
Applied egg-rr58.0%
Final simplification73.0%
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.02) (- (* PI l_m) (* (/ PI F) (/ 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) <= 0.02) {
tmp = (((double) M_PI) * l_m) - ((((double) M_PI) / F) * (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) <= 0.02) {
tmp = (Math.PI * l_m) - ((Math.PI / F) * (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) <= 0.02: tmp = (math.pi * l_m) - ((math.pi / F) * (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) <= 0.02) tmp = Float64(Float64(pi * l_m) - Float64(Float64(pi / F) * Float64(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) <= 0.02) tmp = (pi * l_m) - ((pi / F) * (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], 0.02], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(Pi / F), $MachinePrecision] * N[(l$95$m / 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 \leq 0.02:\\
\;\;\;\;\pi \cdot l\_m - \frac{\pi}{F} \cdot \frac{l\_m}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 0.0200000000000000004Initial program 78.9%
Taylor expanded in l around 0
*-lowering-*.f64N/A
PI-lowering-PI.f6475.0%
Simplified75.0%
*-commutativeN/A
*-commutativeN/A
un-div-invN/A
times-fracN/A
*-lft-identityN/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f6483.8%
Applied egg-rr83.8%
if 0.0200000000000000004 < (*.f64 (PI.f64) l) Initial program 61.1%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6498.0%
Simplified98.0%
Final simplification87.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 (<= l_m 0.5) (* 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 (l_m <= 0.5) {
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 (l_m <= 0.5) {
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 l_m <= 0.5: 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 (l_m <= 0.5) 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 (l_m <= 0.5) 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[l$95$m, 0.5], 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}\;l\_m \leq 0.5:\\
\;\;\;\;\pi \cdot \left(l\_m - \frac{l\_m}{F \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 0.5Initial program 78.9%
Taylor expanded in l around 0
*-lowering-*.f64N/A
PI-lowering-PI.f6475.0%
Simplified75.0%
*-commutativeN/A
associate-*r*N/A
distribute-rgt-out--N/A
*-commutativeN/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-commutativeN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6476.7%
Applied egg-rr76.7%
if 0.5 < l Initial program 61.1%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6498.0%
Simplified98.0%
Final simplification82.0%
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 (<= l_m 0.5) (* 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 (l_m <= 0.5) {
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 (l_m <= 0.5) {
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 l_m <= 0.5: 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 (l_m <= 0.5) 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 (l_m <= 0.5) 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[l$95$m, 0.5], 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}\;l\_m \leq 0.5:\\
\;\;\;\;l\_m \cdot \left(\pi - \frac{\pi}{F \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 0.5Initial program 78.9%
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.5%
Simplified75.5%
if 0.5 < l Initial program 61.1%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6498.0%
Simplified98.0%
Final simplification81.0%
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 (<= l_m 3.7e-22) (* (/ PI F) (/ l_m (- 0.0 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 (l_m <= 3.7e-22) {
tmp = (((double) M_PI) / F) * (l_m / (0.0 - 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 (l_m <= 3.7e-22) {
tmp = (Math.PI / F) * (l_m / (0.0 - 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 l_m <= 3.7e-22: tmp = (math.pi / F) * (l_m / (0.0 - 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 (l_m <= 3.7e-22) tmp = Float64(Float64(pi / F) * Float64(l_m / Float64(0.0 - 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 (l_m <= 3.7e-22) tmp = (pi / F) * (l_m / (0.0 - 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[l$95$m, 3.7e-22], N[(N[(Pi / F), $MachinePrecision] * N[(l$95$m / N[(0.0 - 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}\;l\_m \leq 3.7 \cdot 10^{-22}:\\
\;\;\;\;\frac{\pi}{F} \cdot \frac{l\_m}{0 - F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 3.7e-22Initial program 78.4%
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.2%
Simplified75.2%
Taylor expanded in F around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
associate-/r*N/A
associate-/l*N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6436.9%
Simplified36.9%
sub0-negN/A
*-commutativeN/A
associate-/l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
neg-lowering-neg.f64N/A
/-lowering-/.f6436.9%
Applied egg-rr36.9%
if 3.7e-22 < l Initial program 63.9%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6493.8%
Simplified93.8%
Final simplification52.0%
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.5%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6471.7%
Simplified71.7%
Final simplification71.7%
herbie shell --seed 2024164
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))