
(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 7 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) 50000.0)
(- (* PI l_m) (/ (/ (tan (* PI l_m)) F) F))
(* (* l_m (* PI PI)) (/ 1.0 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) <= 50000.0) {
tmp = (((double) M_PI) * l_m) - ((tan((((double) M_PI) * l_m)) / F) / F);
} else {
tmp = (l_m * (((double) M_PI) * ((double) M_PI))) * (1.0 / ((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) <= 50000.0) {
tmp = (Math.PI * l_m) - ((Math.tan((Math.PI * l_m)) / F) / F);
} else {
tmp = (l_m * (Math.PI * Math.PI)) * (1.0 / 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) <= 50000.0: tmp = (math.pi * l_m) - ((math.tan((math.pi * l_m)) / F) / F) else: tmp = (l_m * (math.pi * math.pi)) * (1.0 / 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) <= 50000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(tan(Float64(pi * l_m)) / F) / F)); else tmp = Float64(Float64(l_m * Float64(pi * pi)) * Float64(1.0 / 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) <= 50000.0) tmp = (pi * l_m) - ((tan((pi * l_m)) / F) / F); else tmp = (l_m * (pi * pi)) * (1.0 / 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], 50000.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[(Pi * Pi), $MachinePrecision]), $MachinePrecision] * N[(1.0 / Pi), $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 50000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\tan \left(\pi \cdot l\_m\right)}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \left(\pi \cdot \pi\right)\right) \cdot \frac{1}{\pi}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5e4Initial program 80.9%
*-commutativeN/A
un-div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6491.1
Applied egg-rr91.1%
if 5e4 < (*.f64 (PI.f64) l) Initial program 57.3%
Taylor expanded in l around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
PI-lowering-PI.f6499.6
Simplified99.6%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6499.6
Applied egg-rr99.6%
*-rgt-identityN/A
rgt-mult-inverseN/A
clear-numN/A
associate-*l*N/A
associate-/l*N/A
+-rgt-identityN/A
associate-*r/N/A
div-invN/A
associate-*l*N/A
lft-mult-inverseN/A
*-rgt-identityN/A
div-invN/A
*-lowering-*.f64N/A
Applied egg-rr99.6%
+-rgt-identityN/A
+-rgt-identityN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
PI-lowering-PI.f6499.7
Applied egg-rr99.7%
Final simplification93.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) 50000.0)
(- (* PI l_m) (/ (/ l_m F) (/ F PI)))
(* (* l_m (* PI PI)) (/ 1.0 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) <= 50000.0) {
tmp = (((double) M_PI) * l_m) - ((l_m / F) / (F / ((double) M_PI)));
} else {
tmp = (l_m * (((double) M_PI) * ((double) M_PI))) * (1.0 / ((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) <= 50000.0) {
tmp = (Math.PI * l_m) - ((l_m / F) / (F / Math.PI));
} else {
tmp = (l_m * (Math.PI * Math.PI)) * (1.0 / 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) <= 50000.0: tmp = (math.pi * l_m) - ((l_m / F) / (F / math.pi)) else: tmp = (l_m * (math.pi * math.pi)) * (1.0 / 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) <= 50000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(l_m / F) / Float64(F / pi))); else tmp = Float64(Float64(l_m * Float64(pi * pi)) * Float64(1.0 / 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) <= 50000.0) tmp = (pi * l_m) - ((l_m / F) / (F / pi)); else tmp = (l_m * (pi * pi)) * (1.0 / 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], 50000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(l$95$m / F), $MachinePrecision] / N[(F / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(l$95$m * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision] * N[(1.0 / Pi), $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 50000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{l\_m}{F}}{\frac{F}{\pi}}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \left(\pi \cdot \pi\right)\right) \cdot \frac{1}{\pi}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5e4Initial program 80.9%
*-commutativeN/A
un-div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6491.1
Applied egg-rr91.1%
Taylor expanded in l around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6484.0
Simplified84.0%
associate-/l*N/A
associate-*l/N/A
un-div-invN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6484.0
Applied egg-rr84.0%
if 5e4 < (*.f64 (PI.f64) l) Initial program 57.3%
Taylor expanded in l around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
PI-lowering-PI.f6499.6
Simplified99.6%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6499.6
Applied egg-rr99.6%
*-rgt-identityN/A
rgt-mult-inverseN/A
clear-numN/A
associate-*l*N/A
associate-/l*N/A
+-rgt-identityN/A
associate-*r/N/A
div-invN/A
associate-*l*N/A
lft-mult-inverseN/A
*-rgt-identityN/A
div-invN/A
*-lowering-*.f64N/A
Applied egg-rr99.6%
+-rgt-identityN/A
+-rgt-identityN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
PI-lowering-PI.f6499.7
Applied egg-rr99.7%
Final simplification87.5%
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) 50000.0)
(- (* PI l_m) (/ (* PI (/ l_m F)) F))
(* (* l_m (* PI PI)) (/ 1.0 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) <= 50000.0) {
tmp = (((double) M_PI) * l_m) - ((((double) M_PI) * (l_m / F)) / F);
} else {
tmp = (l_m * (((double) M_PI) * ((double) M_PI))) * (1.0 / ((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) <= 50000.0) {
tmp = (Math.PI * l_m) - ((Math.PI * (l_m / F)) / F);
} else {
tmp = (l_m * (Math.PI * Math.PI)) * (1.0 / 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) <= 50000.0: tmp = (math.pi * l_m) - ((math.pi * (l_m / F)) / F) else: tmp = (l_m * (math.pi * math.pi)) * (1.0 / 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) <= 50000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(pi * Float64(l_m / F)) / F)); else tmp = Float64(Float64(l_m * Float64(pi * pi)) * Float64(1.0 / 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) <= 50000.0) tmp = (pi * l_m) - ((pi * (l_m / F)) / F); else tmp = (l_m * (pi * pi)) * (1.0 / 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], 50000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(Pi * N[(l$95$m / F), $MachinePrecision]), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(N[(l$95$m * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision] * N[(1.0 / Pi), $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 50000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\pi \cdot \frac{l\_m}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \left(\pi \cdot \pi\right)\right) \cdot \frac{1}{\pi}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5e4Initial program 80.9%
*-commutativeN/A
un-div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
tan-lowering-tan.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6491.1
Applied egg-rr91.1%
Taylor expanded in l around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6484.0
Simplified84.0%
associate-*l/N/A
un-div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
un-div-invN/A
/-lowering-/.f64N/A
PI-lowering-PI.f6484.0
Applied egg-rr84.0%
if 5e4 < (*.f64 (PI.f64) l) Initial program 57.3%
Taylor expanded in l around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
PI-lowering-PI.f6499.6
Simplified99.6%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6499.6
Applied egg-rr99.6%
*-rgt-identityN/A
rgt-mult-inverseN/A
clear-numN/A
associate-*l*N/A
associate-/l*N/A
+-rgt-identityN/A
associate-*r/N/A
div-invN/A
associate-*l*N/A
lft-mult-inverseN/A
*-rgt-identityN/A
div-invN/A
*-lowering-*.f64N/A
Applied egg-rr99.6%
+-rgt-identityN/A
+-rgt-identityN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
PI-lowering-PI.f6499.7
Applied egg-rr99.7%
Final simplification87.5%
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) 50000.0)
(* PI (- l_m (/ l_m (* F F))))
(* (* l_m (* PI PI)) (/ 1.0 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) <= 50000.0) {
tmp = ((double) M_PI) * (l_m - (l_m / (F * F)));
} else {
tmp = (l_m * (((double) M_PI) * ((double) M_PI))) * (1.0 / ((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) <= 50000.0) {
tmp = Math.PI * (l_m - (l_m / (F * F)));
} else {
tmp = (l_m * (Math.PI * Math.PI)) * (1.0 / 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) <= 50000.0: tmp = math.pi * (l_m - (l_m / (F * F))) else: tmp = (l_m * (math.pi * math.pi)) * (1.0 / 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) <= 50000.0) tmp = Float64(pi * Float64(l_m - Float64(l_m / Float64(F * F)))); else tmp = Float64(Float64(l_m * Float64(pi * pi)) * Float64(1.0 / 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) <= 50000.0) tmp = pi * (l_m - (l_m / (F * F))); else tmp = (l_m * (pi * pi)) * (1.0 / 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], 50000.0], 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] * N[(1.0 / Pi), $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 50000:\\
\;\;\;\;\pi \cdot \left(l\_m - \frac{l\_m}{F \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \left(\pi \cdot \pi\right)\right) \cdot \frac{1}{\pi}\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5e4Initial program 80.9%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
un-div-invN/A
distribute-neg-frac2N/A
distribute-rgt-neg-inN/A
*-rgt-identityN/A
times-fracN/A
distribute-neg-frac2N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr91.1%
Taylor expanded in l around 0
mul-1-negN/A
sub-negN/A
distribute-rgt-out--N/A
associate-*l/N/A
associate-/l*N/A
distribute-lft-out--N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6474.8
Simplified74.8%
if 5e4 < (*.f64 (PI.f64) l) Initial program 57.3%
Taylor expanded in l around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
PI-lowering-PI.f6499.6
Simplified99.6%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6499.6
Applied egg-rr99.6%
*-rgt-identityN/A
rgt-mult-inverseN/A
clear-numN/A
associate-*l*N/A
associate-/l*N/A
+-rgt-identityN/A
associate-*r/N/A
div-invN/A
associate-*l*N/A
lft-mult-inverseN/A
*-rgt-identityN/A
div-invN/A
*-lowering-*.f64N/A
Applied egg-rr99.6%
+-rgt-identityN/A
+-rgt-identityN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
PI-lowering-PI.f6499.7
Applied egg-rr99.7%
Final simplification80.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 (<= (* PI l_m) 50000.0) (* 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) <= 50000.0) {
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) <= 50000.0) {
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) <= 50000.0: 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) <= 50000.0) 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) <= 50000.0) 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], 50000.0], 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 50000:\\
\;\;\;\;\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) < 5e4Initial program 80.9%
sub-negN/A
+-commutativeN/A
*-commutativeN/A
un-div-invN/A
distribute-neg-frac2N/A
distribute-rgt-neg-inN/A
*-rgt-identityN/A
times-fracN/A
distribute-neg-frac2N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr91.1%
Taylor expanded in l around 0
mul-1-negN/A
sub-negN/A
distribute-rgt-out--N/A
associate-*l/N/A
associate-/l*N/A
distribute-lft-out--N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6474.8
Simplified74.8%
if 5e4 < (*.f64 (PI.f64) l) Initial program 57.3%
Taylor expanded in l around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
PI-lowering-PI.f6499.6
Simplified99.6%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.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) 50000.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 ((((double) M_PI) * l_m) <= 50000.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 ((Math.PI * l_m) <= 50000.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 (math.pi * l_m) <= 50000.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 (Float64(pi * l_m) <= 50000.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 ((pi * l_m) <= 50000.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[N[(Pi * l$95$m), $MachinePrecision], 50000.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}\;\pi \cdot l\_m \leq 50000:\\
\;\;\;\;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) < 5e4Initial program 80.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-*.f6473.8
Simplified73.8%
if 5e4 < (*.f64 (PI.f64) l) Initial program 57.3%
Taylor expanded in l around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
PI-lowering-PI.f6499.6
Simplified99.6%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.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 (* 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 75.6%
Taylor expanded in l around inf
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
PI-lowering-PI.f6476.7
Simplified76.7%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6476.7
Applied egg-rr76.7%
herbie shell --seed 2024199
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))