
(FPCore (F l) :precision binary64 (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))
double code(double F, double l) {
return (((double) M_PI) * l) - ((1.0 / (F * F)) * tan((((double) M_PI) * l)));
}
public static double code(double F, double l) {
return (Math.PI * l) - ((1.0 / (F * F)) * Math.tan((Math.PI * l)));
}
def code(F, l): return (math.pi * l) - ((1.0 / (F * F)) * math.tan((math.pi * l)))
function code(F, l) return Float64(Float64(pi * l) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l)))) end
function tmp = code(F, l) tmp = (pi * l) - ((1.0 / (F * F)) * tan((pi * l))); end
code[F_, l_] := N[(N[(Pi * l), $MachinePrecision] - N[(N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] * N[Tan[N[(Pi * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (F l) :precision binary64 (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))
double code(double F, double l) {
return (((double) M_PI) * l) - ((1.0 / (F * F)) * tan((((double) M_PI) * l)));
}
public static double code(double F, double l) {
return (Math.PI * l) - ((1.0 / (F * F)) * Math.tan((Math.PI * l)));
}
def code(F, l): return (math.pi * l) - ((1.0 / (F * F)) * math.tan((math.pi * l)))
function code(F, l) return Float64(Float64(pi * l) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l)))) end
function tmp = code(F, l) tmp = (pi * l) - ((1.0 / (F * F)) * tan((pi * l))); end
code[F_, l_] := N[(N[(Pi * l), $MachinePrecision] - N[(N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] * N[Tan[N[(Pi * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)
\end{array}
l_m = (fabs.f64 l)
l_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 2e+14)
(+ (* PI l_m) (/ (/ -1.0 F) (/ (* F (cos (* PI l_m))) (sin (* 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) / ((F * cos((((double) M_PI) * l_m))) / sin((((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) / ((F * Math.cos((Math.PI * l_m))) / Math.sin((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) / ((F * math.cos((math.pi * l_m))) / math.sin((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(F * cos(Float64(pi * l_m))) / sin(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) + ((-1.0 / F) / ((F * cos((pi * l_m))) / sin((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[(F * N[Cos[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[Sin[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{-1}{F}}{\frac{F \cdot \cos \left(\pi \cdot l_m\right)}{\sin \left(\pi \cdot l_m\right)}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e14Initial program 78.8%
associate-/r/78.8%
associate-/l*84.4%
clear-num84.5%
add-sqr-sqrt42.2%
sqrt-prod65.1%
sqr-neg65.1%
sqrt-unprod24.7%
add-sqr-sqrt50.6%
div-inv50.6%
clear-num50.6%
associate-*l/50.6%
*-un-lft-identity50.6%
add-sqr-sqrt24.7%
sqrt-unprod65.1%
sqr-neg65.1%
sqrt-prod42.3%
add-sqr-sqrt84.5%
Applied egg-rr84.5%
Taylor expanded in F around 0 84.5%
if 2e14 < (*.f64 (PI.f64) l) Initial program 69.9%
sqr-neg69.9%
associate-*l/69.9%
*-lft-identity69.9%
sqr-neg69.9%
Simplified69.9%
Taylor expanded in l around 0 49.8%
*-commutative49.8%
times-frac49.8%
Applied egg-rr49.8%
Taylor expanded in F around inf 99.6%
Final simplification88.1%
l_m = (fabs.f64 l)
l_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 2e+14)
(+ (* PI l_m) (/ (/ -1.0 F) (/ F (tan (* 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) / (F / tan((((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) / (F / Math.tan((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) / (F / math.tan((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(F / tan(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) + ((-1.0 / F) / (F / tan((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[(F / N[Tan[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{-1}{F}}{\frac{F}{\tan \left(\pi \cdot l_m\right)}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e14Initial program 78.8%
associate-/r/78.8%
associate-/l*84.4%
clear-num84.5%
add-sqr-sqrt42.2%
sqrt-prod65.1%
sqr-neg65.1%
sqrt-unprod24.7%
add-sqr-sqrt50.6%
div-inv50.6%
clear-num50.6%
associate-*l/50.6%
*-un-lft-identity50.6%
add-sqr-sqrt24.7%
sqrt-unprod65.1%
sqr-neg65.1%
sqrt-prod42.3%
add-sqr-sqrt84.5%
Applied egg-rr84.5%
if 2e14 < (*.f64 (PI.f64) l) Initial program 69.9%
sqr-neg69.9%
associate-*l/69.9%
*-lft-identity69.9%
sqr-neg69.9%
Simplified69.9%
Taylor expanded in l around 0 49.8%
*-commutative49.8%
times-frac49.8%
Applied egg-rr49.8%
Taylor expanded in F around inf 99.6%
Final simplification88.1%
l_m = (fabs.f64 l)
l_s = (copysign.f64 1 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 78.8%
associate-*l/78.8%
*-un-lft-identity78.8%
associate-/r*84.5%
Applied egg-rr84.5%
if 2e14 < (*.f64 (PI.f64) l) Initial program 69.9%
sqr-neg69.9%
associate-*l/69.9%
*-lft-identity69.9%
sqr-neg69.9%
Simplified69.9%
Taylor expanded in l around 0 49.8%
*-commutative49.8%
times-frac49.8%
Applied egg-rr49.8%
Taylor expanded in F around inf 99.6%
Final simplification88.1%
l_m = (fabs.f64 l)
l_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 50000000000000.0)
(- (* PI l_m) (/ (* 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) <= 50000000000000.0) {
tmp = (((double) M_PI) * l_m) - ((((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) <= 50000000000000.0) {
tmp = (Math.PI * l_m) - ((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) <= 50000000000000.0: tmp = (math.pi * l_m) - ((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) <= 50000000000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(pi * Float64(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) <= 50000000000000.0) tmp = (pi * l_m) - ((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], 50000000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(Pi * N[(l$95$m / 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}\;\pi \cdot l_m \leq 50000000000000:\\
\;\;\;\;\pi \cdot l_m - \frac{\pi \cdot \frac{l_m}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5e13Initial program 78.6%
sqr-neg78.6%
associate-*l/78.7%
*-lft-identity78.7%
sqr-neg78.7%
Simplified78.7%
Taylor expanded in l around 0 74.4%
*-commutative74.4%
times-frac80.1%
Applied egg-rr80.1%
associate-*l/80.1%
Applied egg-rr80.1%
if 5e13 < (*.f64 (PI.f64) l) Initial program 70.4%
sqr-neg70.4%
associate-*l/70.4%
*-lft-identity70.4%
sqr-neg70.4%
Simplified70.4%
Taylor expanded in l around 0 49.0%
*-commutative49.0%
times-frac49.0%
Applied egg-rr49.0%
Taylor expanded in F around inf 98.0%
Final simplification84.5%
l_m = (fabs.f64 l)
l_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= l_m 18000000000000.0)
(* l_m (+ PI (* (/ PI F) (/ -1.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 <= 18000000000000.0) {
tmp = l_m * (((double) M_PI) + ((((double) M_PI) / F) * (-1.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 <= 18000000000000.0) {
tmp = l_m * (Math.PI + ((Math.PI / F) * (-1.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 <= 18000000000000.0: tmp = l_m * (math.pi + ((math.pi / F) * (-1.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 <= 18000000000000.0) tmp = Float64(l_m * Float64(pi + Float64(Float64(pi / F) * Float64(-1.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 <= 18000000000000.0) tmp = l_m * (pi + ((pi / F) * (-1.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, 18000000000000.0], N[(l$95$m * N[(Pi + N[(N[(Pi / F), $MachinePrecision] * N[(-1.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}\;l_m \leq 18000000000000:\\
\;\;\;\;l_m \cdot \left(\pi + \frac{\pi}{F} \cdot \frac{-1}{F}\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l_m\\
\end{array}
\end{array}
if l < 1.8e13Initial program 78.6%
sqr-neg78.6%
associate-*l/78.7%
*-lft-identity78.7%
sqr-neg78.7%
Simplified78.7%
Taylor expanded in l around 0 74.4%
*-un-lft-identity74.4%
pow274.4%
times-frac74.4%
Applied egg-rr74.4%
if 1.8e13 < l Initial program 70.4%
sqr-neg70.4%
associate-*l/70.4%
*-lft-identity70.4%
sqr-neg70.4%
Simplified70.4%
Taylor expanded in l around 0 49.0%
*-commutative49.0%
times-frac49.0%
Applied egg-rr49.0%
Taylor expanded in F around inf 98.0%
Final simplification80.1%
l_m = (fabs.f64 l)
l_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= l_m 18000000000000.0)
(- (* PI 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 <= 18000000000000.0) {
tmp = (((double) M_PI) * 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 <= 18000000000000.0) {
tmp = (Math.PI * 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 <= 18000000000000.0: tmp = (math.pi * 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 <= 18000000000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(l_m / F) * Float64(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 <= 18000000000000.0) tmp = (pi * 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, 18000000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(l$95$m / F), $MachinePrecision] * N[(Pi / 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 18000000000000:\\
\;\;\;\;\pi \cdot l_m - \frac{l_m}{F} \cdot \frac{\pi}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l_m\\
\end{array}
\end{array}
if l < 1.8e13Initial program 78.6%
sqr-neg78.6%
associate-*l/78.7%
*-lft-identity78.7%
sqr-neg78.7%
Simplified78.7%
Taylor expanded in l around 0 74.4%
*-commutative74.4%
times-frac80.1%
Applied egg-rr80.1%
if 1.8e13 < l Initial program 70.4%
sqr-neg70.4%
associate-*l/70.4%
*-lft-identity70.4%
sqr-neg70.4%
Simplified70.4%
Taylor expanded in l around 0 49.0%
*-commutative49.0%
times-frac49.0%
Applied egg-rr49.0%
Taylor expanded in F around inf 98.0%
Final simplification84.5%
l_m = (fabs.f64 l)
l_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= l_m 18000000000000.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 <= 18000000000000.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 <= 18000000000000.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 <= 18000000000000.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 <= 18000000000000.0) tmp = Float64(Float64(pi * l_m) - Float64(pi / Float64(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 <= 18000000000000.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, 18000000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(Pi / N[(F / N[(l$95$m / 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 18000000000000:\\
\;\;\;\;\pi \cdot l_m - \frac{\pi}{\frac{F}{\frac{l_m}{F}}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l_m\\
\end{array}
\end{array}
if l < 1.8e13Initial program 78.6%
sqr-neg78.6%
associate-*l/78.7%
*-lft-identity78.7%
sqr-neg78.7%
Simplified78.7%
Taylor expanded in l around 0 74.4%
*-commutative74.4%
times-frac80.1%
Applied egg-rr80.1%
associate-*r/80.1%
Applied egg-rr80.1%
associate-*l/80.1%
associate-*r/80.1%
associate-/l*80.1%
Simplified80.1%
if 1.8e13 < l Initial program 70.4%
sqr-neg70.4%
associate-*l/70.4%
*-lft-identity70.4%
sqr-neg70.4%
Simplified70.4%
Taylor expanded in l around 0 49.0%
*-commutative49.0%
times-frac49.0%
Applied egg-rr49.0%
Taylor expanded in F around inf 98.0%
Final simplification84.5%
l_m = (fabs.f64 l) l_s = (copysign.f64 1 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 76.6%
sqr-neg76.6%
associate-*l/76.7%
*-lft-identity76.7%
sqr-neg76.7%
Simplified76.7%
Taylor expanded in l around 0 68.3%
*-commutative68.3%
times-frac72.6%
Applied egg-rr72.6%
Taylor expanded in F around inf 73.5%
Final simplification73.5%
herbie shell --seed 2024024
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))