
(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) 2e+14)
(- (* PI l_m) (/ (/ (sin (* PI l_m)) F) (* F (cos (* 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) <= 2e+14) {
tmp = (((double) M_PI) * l_m) - ((sin((((double) M_PI) * l_m)) / F) / (F * cos((((double) M_PI) * 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) <= 2e+14) {
tmp = (Math.PI * l_m) - ((Math.sin((Math.PI * l_m)) / F) / (F * Math.cos((Math.PI * 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) <= 2e+14: tmp = (math.pi * l_m) - ((math.sin((math.pi * l_m)) / F) / (F * math.cos((math.pi * 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) <= 2e+14) tmp = Float64(Float64(pi * l_m) - Float64(Float64(sin(Float64(pi * l_m)) / F) / Float64(F * cos(Float64(pi * 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) <= 2e+14) tmp = (pi * l_m) - ((sin((pi * l_m)) / F) / (F * cos((pi * 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], 2e+14], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[Sin[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] / F), $MachinePrecision] / N[(F * N[Cos[N[(Pi * l$95$m), $MachinePrecision]], $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^{+14}:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\sin \left(\pi \cdot l\_m\right)}{F}}{F \cdot \cos \left(\pi \cdot l\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e14Initial program 79.1%
*-commutativeN/A
tan-quotN/A
associate-/r*N/A
frac-timesN/A
/-lowering-/.f64N/A
un-div-invN/A
/-lowering-/.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6488.6%
Applied egg-rr88.6%
if 2e14 < (*.f64 (PI.f64) l) Initial program 56.4%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6499.5%
Simplified99.5%
Final simplification90.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) 2e+14)
(- (* 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) <= 2e+14) {
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) <= 2e+14) {
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) <= 2e+14: 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) <= 2e+14) 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) <= 2e+14) 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], 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[(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^{+14}:\\
\;\;\;\;\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) < 2e14Initial program 79.1%
*-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.f6488.6%
Applied egg-rr88.6%
if 2e14 < (*.f64 (PI.f64) l) Initial program 56.4%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6499.5%
Simplified99.5%
Final simplification90.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) 2e+14)
(+
(* PI l_m)
(/
(/ 1.0 F)
(/
(-
(/
(* (* PI (* (* PI PI) 0.3333333333333333)) (* F (* l_m l_m)))
(* PI PI))
(/ 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) <= 2e+14) {
tmp = (((double) M_PI) * l_m) + ((1.0 / F) / (((((((double) M_PI) * ((((double) M_PI) * ((double) M_PI)) * 0.3333333333333333)) * (F * (l_m * l_m))) / (((double) M_PI) * ((double) M_PI))) - (F / ((double) M_PI))) / 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) <= 2e+14) {
tmp = (Math.PI * l_m) + ((1.0 / F) / (((((Math.PI * ((Math.PI * Math.PI) * 0.3333333333333333)) * (F * (l_m * l_m))) / (Math.PI * Math.PI)) - (F / Math.PI)) / 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) <= 2e+14: tmp = (math.pi * l_m) + ((1.0 / F) / (((((math.pi * ((math.pi * math.pi) * 0.3333333333333333)) * (F * (l_m * l_m))) / (math.pi * math.pi)) - (F / math.pi)) / 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) <= 2e+14) tmp = Float64(Float64(pi * l_m) + Float64(Float64(1.0 / F) / Float64(Float64(Float64(Float64(Float64(pi * Float64(Float64(pi * pi) * 0.3333333333333333)) * Float64(F * Float64(l_m * l_m))) / Float64(pi * pi)) - Float64(F / pi)) / 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) <= 2e+14) tmp = (pi * l_m) + ((1.0 / F) / (((((pi * ((pi * pi) * 0.3333333333333333)) * (F * (l_m * l_m))) / (pi * pi)) - (F / pi)) / 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], 2e+14], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[(1.0 / F), $MachinePrecision] / N[(N[(N[(N[(N[(Pi * N[(N[(Pi * Pi), $MachinePrecision] * 0.3333333333333333), $MachinePrecision]), $MachinePrecision] * N[(F * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Pi * Pi), $MachinePrecision]), $MachinePrecision] - N[(F / Pi), $MachinePrecision]), $MachinePrecision] / l$95$m), $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^{+14}:\\
\;\;\;\;\pi \cdot l\_m + \frac{\frac{1}{F}}{\frac{\frac{\left(\pi \cdot \left(\left(\pi \cdot \pi\right) \cdot 0.3333333333333333\right)\right) \cdot \left(F \cdot \left(l\_m \cdot l\_m\right)\right)}{\pi \cdot \pi} - \frac{F}{\pi}}{l\_m}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e14Initial program 79.1%
associate-*l/N/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6488.5%
Applied egg-rr88.5%
Taylor expanded in l around 0
/-lowering-/.f64N/A
Simplified94.9%
if 2e14 < (*.f64 (PI.f64) l) Initial program 56.4%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6499.5%
Simplified99.5%
Final simplification95.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 (<= l_m 6e+14)
(+
(* PI l_m)
(/
(/
l_m
(/ (- (* (* (* PI PI) 0.3333333333333333) (* F (* l_m l_m))) F) PI))
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 <= 6e+14) {
tmp = (((double) M_PI) * l_m) + ((l_m / (((((((double) M_PI) * ((double) M_PI)) * 0.3333333333333333) * (F * (l_m * l_m))) - F) / ((double) M_PI))) / 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 <= 6e+14) {
tmp = (Math.PI * l_m) + ((l_m / (((((Math.PI * Math.PI) * 0.3333333333333333) * (F * (l_m * l_m))) - F) / Math.PI)) / 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 <= 6e+14: tmp = (math.pi * l_m) + ((l_m / (((((math.pi * math.pi) * 0.3333333333333333) * (F * (l_m * l_m))) - F) / math.pi)) / 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 <= 6e+14) tmp = Float64(Float64(pi * l_m) + Float64(Float64(l_m / Float64(Float64(Float64(Float64(Float64(pi * pi) * 0.3333333333333333) * Float64(F * Float64(l_m * l_m))) - F) / pi)) / 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 <= 6e+14) tmp = (pi * l_m) + ((l_m / (((((pi * pi) * 0.3333333333333333) * (F * (l_m * l_m))) - F) / pi)) / 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, 6e+14], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[(l$95$m / N[(N[(N[(N[(N[(Pi * Pi), $MachinePrecision] * 0.3333333333333333), $MachinePrecision] * N[(F * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - F), $MachinePrecision] / Pi), $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}\;l\_m \leq 6 \cdot 10^{+14}:\\
\;\;\;\;\pi \cdot l\_m + \frac{\frac{l\_m}{\frac{\left(\left(\pi \cdot \pi\right) \cdot 0.3333333333333333\right) \cdot \left(F \cdot \left(l\_m \cdot l\_m\right)\right) - F}{\pi}}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 6e14Initial program 79.1%
associate-*l/N/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6488.5%
Applied egg-rr88.5%
Taylor expanded in l around 0
/-lowering-/.f64N/A
Simplified94.9%
--lowering--.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
associate-/l/N/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
Applied egg-rr94.9%
if 6e14 < l Initial program 56.4%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6499.5%
Simplified99.5%
Final simplification95.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 (<= (* F F) 5e-317)
(* PI l_m)
(if (<= (* F F) 2.5e-9) (/ (* PI l_m) (- 0.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 ((F * F) <= 5e-317) {
tmp = ((double) M_PI) * l_m;
} else if ((F * F) <= 2.5e-9) {
tmp = (((double) M_PI) * l_m) / (0.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 ((F * F) <= 5e-317) {
tmp = Math.PI * l_m;
} else if ((F * F) <= 2.5e-9) {
tmp = (Math.PI * l_m) / (0.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 (F * F) <= 5e-317: tmp = math.pi * l_m elif (F * F) <= 2.5e-9: tmp = (math.pi * l_m) / (0.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(F * F) <= 5e-317) tmp = Float64(pi * l_m); elseif (Float64(F * F) <= 2.5e-9) tmp = Float64(Float64(pi * l_m) / Float64(0.0 - 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 ((F * F) <= 5e-317) tmp = pi * l_m; elseif ((F * F) <= 2.5e-9) tmp = (pi * l_m) / (0.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[(F * F), $MachinePrecision], 5e-317], N[(Pi * l$95$m), $MachinePrecision], If[LessEqual[N[(F * F), $MachinePrecision], 2.5e-9], N[(N[(Pi * l$95$m), $MachinePrecision] / N[(0.0 - 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}\;F \cdot F \leq 5 \cdot 10^{-317}:\\
\;\;\;\;\pi \cdot l\_m\\
\mathbf{elif}\;F \cdot F \leq 2.5 \cdot 10^{-9}:\\
\;\;\;\;\frac{\pi \cdot l\_m}{0 - F \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 F F) < 5.00000017e-317 or 2.5000000000000001e-9 < (*.f64 F F) Initial program 73.6%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6480.4%
Simplified80.4%
if 5.00000017e-317 < (*.f64 F F) < 2.5000000000000001e-9Initial program 76.7%
*-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.f6478.3%
Applied egg-rr78.3%
Taylor expanded in l around 0
*-lowering-*.f64N/A
PI-lowering-PI.f6458.0%
Simplified58.0%
Taylor expanded in F around 0
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
neg-lowering-neg.f64N/A
unpow2N/A
*-lowering-*.f6457.0%
Simplified57.0%
Final simplification74.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 (<= l_m 27500000.0) (- (* PI l_m) (/ (* l_m (/ 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 <= 27500000.0) {
tmp = (((double) M_PI) * l_m) - ((l_m * (((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 <= 27500000.0) {
tmp = (Math.PI * l_m) - ((l_m * (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 <= 27500000.0: tmp = (math.pi * l_m) - ((l_m * (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 <= 27500000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(l_m * 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 (l_m <= 27500000.0) tmp = (pi * l_m) - ((l_m * (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, 27500000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(l$95$m * N[(Pi / 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}\;l\_m \leq 27500000:\\
\;\;\;\;\pi \cdot l\_m - \frac{l\_m \cdot \frac{\pi}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 2.75e7Initial program 79.1%
*-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.f6488.9%
Applied egg-rr88.9%
Taylor expanded in l around 0
*-lowering-*.f64N/A
PI-lowering-PI.f6484.4%
Simplified84.4%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6484.4%
Applied egg-rr84.4%
if 2.75e7 < l Initial program 57.9%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6494.5%
Simplified94.5%
Final simplification86.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 (<= l_m 27500000.0) (- (* 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 (l_m <= 27500000.0) {
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 (l_m <= 27500000.0) {
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 l_m <= 27500000.0: 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 (l_m <= 27500000.0) 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 (l_m <= 27500000.0) 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[l$95$m, 27500000.0], 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}\;l\_m \leq 27500000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\pi}{F} \cdot \frac{l\_m}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 2.75e7Initial program 79.1%
*-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.f6488.9%
Applied egg-rr88.9%
Taylor expanded in l around 0
*-lowering-*.f64N/A
PI-lowering-PI.f6484.4%
Simplified84.4%
associate-/l/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f6484.4%
Applied egg-rr84.4%
if 2.75e7 < l Initial program 57.9%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6494.5%
Simplified94.5%
Final simplification86.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 (<= l_m 27500000.0) (* 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 <= 27500000.0) {
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 <= 27500000.0) {
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 <= 27500000.0: 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 <= 27500000.0) 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 <= 27500000.0) 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, 27500000.0], 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 27500000:\\
\;\;\;\;l\_m \cdot \left(\pi - \frac{\pi}{F \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 2.75e7Initial program 79.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-*.f6474.2%
Simplified74.2%
if 2.75e7 < l Initial program 57.9%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6494.5%
Simplified94.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 (* 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.4%
Taylor expanded in l around inf
*-lowering-*.f64N/A
PI-lowering-PI.f6470.3%
Simplified70.3%
Final simplification70.3%
herbie shell --seed 2024161
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))