
(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 (<= (* l_m PI) 1e+16)
(- (* l_m PI) (/ (/ (tan (* l_m PI)) F) F))
(* l_m PI))))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 * ((double) M_PI)) <= 1e+16) {
tmp = (l_m * ((double) M_PI)) - ((tan((l_m * ((double) M_PI))) / F) / F);
} else {
tmp = l_m * ((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 ((l_m * Math.PI) <= 1e+16) {
tmp = (l_m * Math.PI) - ((Math.tan((l_m * Math.PI)) / F) / F);
} else {
tmp = l_m * 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 (l_m * math.pi) <= 1e+16: tmp = (l_m * math.pi) - ((math.tan((l_m * math.pi)) / F) / F) else: tmp = l_m * 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(l_m * pi) <= 1e+16) tmp = Float64(Float64(l_m * pi) - Float64(Float64(tan(Float64(l_m * pi)) / F) / F)); else tmp = Float64(l_m * 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 ((l_m * pi) <= 1e+16) tmp = (l_m * pi) - ((tan((l_m * pi)) / F) / F); else tmp = l_m * 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[(l$95$m * Pi), $MachinePrecision], 1e+16], N[(N[(l$95$m * Pi), $MachinePrecision] - N[(N[(N[Tan[N[(l$95$m * Pi), $MachinePrecision]], $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(l$95$m * 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}\;l\_m \cdot \pi \leq 10^{+16}:\\
\;\;\;\;l\_m \cdot \pi - \frac{\frac{\tan \left(l\_m \cdot \pi\right)}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \pi\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e16Initial program 78.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6485.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.9
Applied rewrites85.9%
if 1e16 < (*.f64 (PI.f64) l) Initial program 61.8%
Taylor expanded in F around inf
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6499.5
Applied rewrites99.5%
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 (<= (- (* l_m PI) (* (tan (* l_m PI)) (/ 1.0 (* F F)))) -4e-287)
(* (/ PI (* (- F) F)) l_m)
(* l_m PI))))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 * ((double) M_PI)) - (tan((l_m * ((double) M_PI))) * (1.0 / (F * F)))) <= -4e-287) {
tmp = (((double) M_PI) / (-F * F)) * l_m;
} else {
tmp = l_m * ((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 (((l_m * Math.PI) - (Math.tan((l_m * Math.PI)) * (1.0 / (F * F)))) <= -4e-287) {
tmp = (Math.PI / (-F * F)) * l_m;
} else {
tmp = l_m * 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 ((l_m * math.pi) - (math.tan((l_m * math.pi)) * (1.0 / (F * F)))) <= -4e-287: tmp = (math.pi / (-F * F)) * l_m else: tmp = l_m * 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(Float64(l_m * pi) - Float64(tan(Float64(l_m * pi)) * Float64(1.0 / Float64(F * F)))) <= -4e-287) tmp = Float64(Float64(pi / Float64(Float64(-F) * F)) * l_m); else tmp = Float64(l_m * 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 (((l_m * pi) - (tan((l_m * pi)) * (1.0 / (F * F)))) <= -4e-287) tmp = (pi / (-F * F)) * l_m; else tmp = l_m * 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[(N[(l$95$m * Pi), $MachinePrecision] - N[(N[Tan[N[(l$95$m * Pi), $MachinePrecision]], $MachinePrecision] * N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e-287], N[(N[(Pi / N[((-F) * F), $MachinePrecision]), $MachinePrecision] * l$95$m), $MachinePrecision], N[(l$95$m * 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}\;l\_m \cdot \pi - \tan \left(l\_m \cdot \pi\right) \cdot \frac{1}{F \cdot F} \leq -4 \cdot 10^{-287}:\\
\;\;\;\;\frac{\pi}{\left(-F\right) \cdot F} \cdot l\_m\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \pi\\
\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)))) < -4.00000000000000009e-287Initial program 72.9%
rem-square-sqrtN/A
sqrt-unprodN/A
lift-PI.f64N/A
add-sqr-sqrtN/A
associate-*r*N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-PI.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lift-PI.f64N/A
lower-sqrt.f6472.6
Applied rewrites72.6%
Taylor expanded in l around 0
*-commutativeN/A
sub-negN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
lower-PI.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6467.7
Applied rewrites67.7%
Taylor expanded in F around 0
Applied rewrites27.8%
if -4.00000000000000009e-287 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) Initial program 75.6%
Taylor expanded in F around inf
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6475.7
Applied rewrites75.7%
Final simplification53.4%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 #s(literal 1 binary64) l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* l_m PI) 1e+16)
(-
(* l_m PI)
(/
(/
(* (fma (* 0.3333333333333333 (* l_m l_m)) (* (* PI PI) PI) PI) l_m)
F)
F))
(* l_m PI))))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 * ((double) M_PI)) <= 1e+16) {
tmp = (l_m * ((double) M_PI)) - (((fma((0.3333333333333333 * (l_m * l_m)), ((((double) M_PI) * ((double) M_PI)) * ((double) M_PI)), ((double) M_PI)) * l_m) / F) / F);
} else {
tmp = l_m * ((double) M_PI);
}
return l_s * tmp;
}
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(l_m * pi) <= 1e+16) tmp = Float64(Float64(l_m * pi) - Float64(Float64(Float64(fma(Float64(0.3333333333333333 * Float64(l_m * l_m)), Float64(Float64(pi * pi) * pi), pi) * l_m) / F) / F)); else tmp = Float64(l_m * pi); end return Float64(l_s * tmp) end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(l$95$m * Pi), $MachinePrecision], 1e+16], N[(N[(l$95$m * Pi), $MachinePrecision] - N[(N[(N[(N[(N[(0.3333333333333333 * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(Pi * Pi), $MachinePrecision] * Pi), $MachinePrecision] + Pi), $MachinePrecision] * l$95$m), $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(l$95$m * 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}\;l\_m \cdot \pi \leq 10^{+16}:\\
\;\;\;\;l\_m \cdot \pi - \frac{\frac{\mathsf{fma}\left(0.3333333333333333 \cdot \left(l\_m \cdot l\_m\right), \left(\pi \cdot \pi\right) \cdot \pi, \pi\right) \cdot l\_m}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \pi\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e16Initial program 78.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6485.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.9
Applied rewrites85.9%
Taylor expanded in l around 0
*-commutativeN/A
lower-*.f64N/A
Applied rewrites76.1%
if 1e16 < (*.f64 (PI.f64) l) Initial program 61.8%
Taylor expanded in F around inf
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6499.5
Applied rewrites99.5%
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 PI) 1e+16) (- (* l_m PI) (/ (/ (* l_m PI) F) F)) (* l_m PI))))
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 * ((double) M_PI)) <= 1e+16) {
tmp = (l_m * ((double) M_PI)) - (((l_m * ((double) M_PI)) / F) / F);
} else {
tmp = l_m * ((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 ((l_m * Math.PI) <= 1e+16) {
tmp = (l_m * Math.PI) - (((l_m * Math.PI) / F) / F);
} else {
tmp = l_m * 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 (l_m * math.pi) <= 1e+16: tmp = (l_m * math.pi) - (((l_m * math.pi) / F) / F) else: tmp = l_m * 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(l_m * pi) <= 1e+16) tmp = Float64(Float64(l_m * pi) - Float64(Float64(Float64(l_m * pi) / F) / F)); else tmp = Float64(l_m * 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 ((l_m * pi) <= 1e+16) tmp = (l_m * pi) - (((l_m * pi) / F) / F); else tmp = l_m * 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[(l$95$m * Pi), $MachinePrecision], 1e+16], N[(N[(l$95$m * Pi), $MachinePrecision] - N[(N[(N[(l$95$m * Pi), $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(l$95$m * 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}\;l\_m \cdot \pi \leq 10^{+16}:\\
\;\;\;\;l\_m \cdot \pi - \frac{\frac{l\_m \cdot \pi}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \pi\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e16Initial program 78.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6485.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.9
Applied rewrites85.9%
Taylor expanded in l around 0
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6481.4
Applied rewrites81.4%
if 1e16 < (*.f64 (PI.f64) l) Initial program 61.8%
Taylor expanded in F around inf
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6499.5
Applied rewrites99.5%
Final simplification85.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 PI) 1e+16) (- (* l_m PI) (/ (* (/ PI F) l_m) F)) (* l_m PI))))
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 * ((double) M_PI)) <= 1e+16) {
tmp = (l_m * ((double) M_PI)) - (((((double) M_PI) / F) * l_m) / F);
} else {
tmp = l_m * ((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 ((l_m * Math.PI) <= 1e+16) {
tmp = (l_m * Math.PI) - (((Math.PI / F) * l_m) / F);
} else {
tmp = l_m * 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 (l_m * math.pi) <= 1e+16: tmp = (l_m * math.pi) - (((math.pi / F) * l_m) / F) else: tmp = l_m * 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(l_m * pi) <= 1e+16) tmp = Float64(Float64(l_m * pi) - Float64(Float64(Float64(pi / F) * l_m) / F)); else tmp = Float64(l_m * 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 ((l_m * pi) <= 1e+16) tmp = (l_m * pi) - (((pi / F) * l_m) / F); else tmp = l_m * 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[(l$95$m * Pi), $MachinePrecision], 1e+16], N[(N[(l$95$m * Pi), $MachinePrecision] - N[(N[(N[(Pi / F), $MachinePrecision] * l$95$m), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(l$95$m * 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}\;l\_m \cdot \pi \leq 10^{+16}:\\
\;\;\;\;l\_m \cdot \pi - \frac{\frac{\pi}{F} \cdot l\_m}{F}\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \pi\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e16Initial program 78.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6485.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.9
Applied rewrites85.9%
Taylor expanded in l around 0
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-PI.f6481.9
Applied rewrites81.9%
if 1e16 < (*.f64 (PI.f64) l) Initial program 61.8%
Taylor expanded in F around inf
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6499.5
Applied rewrites99.5%
Final simplification86.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 PI) 1e+16)
(fma PI l_m (/ (* l_m PI) (* (- F) F)))
(* l_m PI))))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 * ((double) M_PI)) <= 1e+16) {
tmp = fma(((double) M_PI), l_m, ((l_m * ((double) M_PI)) / (-F * F)));
} else {
tmp = l_m * ((double) M_PI);
}
return l_s * tmp;
}
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(l_m * pi) <= 1e+16) tmp = fma(pi, l_m, Float64(Float64(l_m * pi) / Float64(Float64(-F) * F))); else tmp = Float64(l_m * pi); end return Float64(l_s * tmp) end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(l$95$m * Pi), $MachinePrecision], 1e+16], N[(Pi * l$95$m + N[(N[(l$95$m * Pi), $MachinePrecision] / N[((-F) * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(l$95$m * 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}\;l\_m \cdot \pi \leq 10^{+16}:\\
\;\;\;\;\mathsf{fma}\left(\pi, l\_m, \frac{l\_m \cdot \pi}{\left(-F\right) \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \pi\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e16Initial program 78.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6485.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.9
Applied rewrites85.9%
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
div-invN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
Applied rewrites78.9%
Taylor expanded in l around 0
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6474.4
Applied rewrites74.4%
if 1e16 < (*.f64 (PI.f64) l) Initial program 61.8%
Taylor expanded in F around inf
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6499.5
Applied rewrites99.5%
Final simplification80.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 PI) 1e+16) (* (fma PI (/ -1.0 (* F F)) PI) l_m) (* l_m PI))))
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 * ((double) M_PI)) <= 1e+16) {
tmp = fma(((double) M_PI), (-1.0 / (F * F)), ((double) M_PI)) * l_m;
} else {
tmp = l_m * ((double) M_PI);
}
return l_s * tmp;
}
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(l_m * pi) <= 1e+16) tmp = Float64(fma(pi, Float64(-1.0 / Float64(F * F)), pi) * l_m); else tmp = Float64(l_m * pi); end return Float64(l_s * tmp) end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(l$95$m * Pi), $MachinePrecision], 1e+16], N[(N[(Pi * N[(-1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] + Pi), $MachinePrecision] * l$95$m), $MachinePrecision], N[(l$95$m * 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}\;l\_m \cdot \pi \leq 10^{+16}:\\
\;\;\;\;\mathsf{fma}\left(\pi, \frac{-1}{F \cdot F}, \pi\right) \cdot l\_m\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \pi\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e16Initial program 78.6%
rem-square-sqrtN/A
sqrt-unprodN/A
lift-PI.f64N/A
add-sqr-sqrtN/A
associate-*r*N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-PI.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lift-PI.f64N/A
lower-sqrt.f6478.3
Applied rewrites78.3%
Taylor expanded in l around 0
*-commutativeN/A
sub-negN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
lower-PI.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6474.7
Applied rewrites74.7%
Applied rewrites74.7%
if 1e16 < (*.f64 (PI.f64) l) Initial program 61.8%
Taylor expanded in F around inf
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6499.5
Applied rewrites99.5%
Final simplification80.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 PI) 1e+16) (* (- PI (/ PI (* F F))) l_m) (* l_m PI))))
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 * ((double) M_PI)) <= 1e+16) {
tmp = (((double) M_PI) - (((double) M_PI) / (F * F))) * l_m;
} else {
tmp = l_m * ((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 ((l_m * Math.PI) <= 1e+16) {
tmp = (Math.PI - (Math.PI / (F * F))) * l_m;
} else {
tmp = l_m * 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 (l_m * math.pi) <= 1e+16: tmp = (math.pi - (math.pi / (F * F))) * l_m else: tmp = l_m * 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(l_m * pi) <= 1e+16) tmp = Float64(Float64(pi - Float64(pi / Float64(F * F))) * l_m); else tmp = Float64(l_m * 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 ((l_m * pi) <= 1e+16) tmp = (pi - (pi / (F * F))) * l_m; else tmp = l_m * 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[(l$95$m * Pi), $MachinePrecision], 1e+16], N[(N[(Pi - N[(Pi / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * l$95$m), $MachinePrecision], N[(l$95$m * 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}\;l\_m \cdot \pi \leq 10^{+16}:\\
\;\;\;\;\left(\pi - \frac{\pi}{F \cdot F}\right) \cdot l\_m\\
\mathbf{else}:\\
\;\;\;\;l\_m \cdot \pi\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1e16Initial program 78.6%
Taylor expanded in l around 0
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-PI.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6474.7
Applied rewrites74.7%
if 1e16 < (*.f64 (PI.f64) l) Initial program 61.8%
Taylor expanded in F around inf
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6499.5
Applied rewrites99.5%
Final simplification80.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 (* l_m PI)))
l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
return l_s * (l_m * ((double) M_PI));
}
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 * (l_m * Math.PI);
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): return l_s * (l_m * math.pi)
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) return Float64(l_s * Float64(l_m * pi)) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp = code(l_s, F, l_m) tmp = l_s * (l_m * pi); 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[(l$95$m * Pi), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \left(l\_m \cdot \pi\right)
\end{array}
Initial program 74.4%
Taylor expanded in F around inf
*-commutativeN/A
lower-*.f64N/A
lower-PI.f6472.7
Applied rewrites72.7%
Final simplification72.7%
herbie shell --seed 2024240
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))