
(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 11 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 1950000000000.0)
(- (* PI l_m) (/ (/ (tan (* PI l_m)) F) F))
(* PI l_m))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if (l_m <= 1950000000000.0) {
tmp = (((double) M_PI) * l_m) - ((tan((((double) M_PI) * l_m)) / F) / F);
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if (l_m <= 1950000000000.0) {
tmp = (Math.PI * l_m) - ((Math.tan((Math.PI * l_m)) / F) / F);
} else {
tmp = Math.PI * l_m;
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if l_m <= 1950000000000.0: tmp = (math.pi * l_m) - ((math.tan((math.pi * l_m)) / F) / F) else: tmp = math.pi * l_m return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (l_m <= 1950000000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(tan(Float64(pi * l_m)) / F) / F)); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if (l_m <= 1950000000000.0) tmp = (pi * l_m) - ((tan((pi * l_m)) / F) / F); else tmp = pi * l_m; end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[l$95$m, 1950000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;l\_m \leq 1950000000000:\\
\;\;\;\;\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 l < 1.95e12Initial program 73.3%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lower-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
pow2N/A
sqr-neg-revN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lower-neg.f6483.4
Applied rewrites83.4%
lift-*.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lift-/.f64N/A
lift-neg.f64N/A
lift-neg.f6483.4
Applied rewrites83.4%
if 1.95e12 < l Initial program 53.2%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6499.6
Applied rewrites99.6%
Final simplification87.0%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 #s(literal 1 binary64) l)
(FPCore (l_s F l_m)
:precision binary64
(let* ((t_0 (- (* PI l_m) (* (/ 1.0 (* F F)) (tan (* PI l_m))))))
(*
l_s
(if (<= t_0 -2e+296)
(/ (* (- PI) l_m) (* F F))
(if (<= t_0 -5e+143)
(/ (* (* F l_m) PI) F)
(if (<= t_0 -2e-231) (* (- 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 t_0 = (((double) M_PI) * l_m) - ((1.0 / (F * F)) * tan((((double) M_PI) * l_m)));
double tmp;
if (t_0 <= -2e+296) {
tmp = (-((double) M_PI) * l_m) / (F * F);
} else if (t_0 <= -5e+143) {
tmp = ((F * l_m) * ((double) M_PI)) / F;
} else if (t_0 <= -2e-231) {
tmp = -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 t_0 = (Math.PI * l_m) - ((1.0 / (F * F)) * Math.tan((Math.PI * l_m)));
double tmp;
if (t_0 <= -2e+296) {
tmp = (-Math.PI * l_m) / (F * F);
} else if (t_0 <= -5e+143) {
tmp = ((F * l_m) * Math.PI) / F;
} else if (t_0 <= -2e-231) {
tmp = -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): t_0 = (math.pi * l_m) - ((1.0 / (F * F)) * math.tan((math.pi * l_m))) tmp = 0 if t_0 <= -2e+296: tmp = (-math.pi * l_m) / (F * F) elif t_0 <= -5e+143: tmp = ((F * l_m) * math.pi) / F elif t_0 <= -2e-231: tmp = -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) t_0 = Float64(Float64(pi * l_m) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l_m)))) tmp = 0.0 if (t_0 <= -2e+296) tmp = Float64(Float64(Float64(-pi) * l_m) / Float64(F * F)); elseif (t_0 <= -5e+143) tmp = Float64(Float64(Float64(F * l_m) * pi) / F); elseif (t_0 <= -2e-231) tmp = Float64(Float64(-l_m) * 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) t_0 = (pi * l_m) - ((1.0 / (F * F)) * tan((pi * l_m))); tmp = 0.0; if (t_0 <= -2e+296) tmp = (-pi * l_m) / (F * F); elseif (t_0 <= -5e+143) tmp = ((F * l_m) * pi) / F; elseif (t_0 <= -2e-231) tmp = -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_] := Block[{t$95$0 = N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] * N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(l$95$s * If[LessEqual[t$95$0, -2e+296], N[(N[((-Pi) * l$95$m), $MachinePrecision] / N[(F * F), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -5e+143], N[(N[(N[(F * l$95$m), $MachinePrecision] * Pi), $MachinePrecision] / F), $MachinePrecision], If[LessEqual[t$95$0, -2e-231], N[((-l$95$m) * N[(Pi / 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)
\\
\begin{array}{l}
t_0 := \pi \cdot l\_m - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot l\_m\right)\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq -2 \cdot 10^{+296}:\\
\;\;\;\;\frac{\left(-\pi\right) \cdot l\_m}{F \cdot F}\\
\mathbf{elif}\;t\_0 \leq -5 \cdot 10^{+143}:\\
\;\;\;\;\frac{\left(F \cdot l\_m\right) \cdot \pi}{F}\\
\mathbf{elif}\;t\_0 \leq -2 \cdot 10^{-231}:\\
\;\;\;\;\left(-l\_m\right) \cdot \frac{\pi}{F \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\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)))) < -1.99999999999999996e296Initial program 31.4%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lower-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
pow2N/A
sqr-neg-revN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lower-neg.f6452.8
Applied rewrites52.8%
Taylor expanded in F around 0
frac-timesN/A
sqr-neg-revN/A
pow2N/A
associate-*l/N/A
pow2N/A
associate-*r/N/A
frac-timesN/A
quot-tanN/A
*-commutativeN/A
associate-*l/N/A
Applied rewrites33.9%
Taylor expanded in l around 0
mul-1-negN/A
*-commutativeN/A
lift-*.f64N/A
lift-PI.f64N/A
lower-neg.f6427.5
Applied rewrites27.5%
if -1.99999999999999996e296 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) < -5.00000000000000012e143Initial program 73.5%
Taylor expanded in F around 0
lower-/.f64N/A
Applied rewrites28.6%
lift-*.f64N/A
lift-/.f64N/A
lift--.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites30.4%
Taylor expanded in F around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-PI.f6463.3
Applied rewrites63.3%
if -5.00000000000000012e143 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) < -2e-231Initial program 97.1%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lower-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
pow2N/A
sqr-neg-revN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lower-neg.f6497.0
Applied rewrites97.0%
Taylor expanded in F around 0
frac-timesN/A
sqr-neg-revN/A
pow2N/A
associate-*l/N/A
pow2N/A
associate-*r/N/A
frac-timesN/A
quot-tanN/A
*-commutativeN/A
associate-*l/N/A
Applied rewrites36.7%
Taylor expanded in l around 0
mul-1-negN/A
lower-neg.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
pow2N/A
lift-*.f6434.4
Applied rewrites34.4%
if -2e-231 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) Initial program 70.1%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6473.1
Applied rewrites73.1%
Final simplification57.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 (<= (- (* PI l_m) (* (/ 1.0 (* F F)) (tan (* PI l_m)))) -2e-231)
(* (- 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 (((((double) M_PI) * l_m) - ((1.0 / (F * F)) * tan((((double) M_PI) * l_m)))) <= -2e-231) {
tmp = -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 (((Math.PI * l_m) - ((1.0 / (F * F)) * Math.tan((Math.PI * l_m)))) <= -2e-231) {
tmp = -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 ((math.pi * l_m) - ((1.0 / (F * F)) * math.tan((math.pi * l_m)))) <= -2e-231: tmp = -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 (Float64(Float64(pi * l_m) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l_m)))) <= -2e-231) tmp = Float64(Float64(-l_m) * 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) - ((1.0 / (F * F)) * tan((pi * l_m)))) <= -2e-231) tmp = -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[N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] * N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-231], N[((-l$95$m) * N[(Pi / 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}\;\pi \cdot l\_m - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot l\_m\right) \leq -2 \cdot 10^{-231}:\\
\;\;\;\;\left(-l\_m\right) \cdot \frac{\pi}{F \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\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)))) < -2e-231Initial program 67.5%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lower-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
pow2N/A
sqr-neg-revN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lower-neg.f6475.3
Applied rewrites75.3%
Taylor expanded in F around 0
frac-timesN/A
sqr-neg-revN/A
pow2N/A
associate-*l/N/A
pow2N/A
associate-*r/N/A
frac-timesN/A
quot-tanN/A
*-commutativeN/A
associate-*l/N/A
Applied rewrites28.9%
Taylor expanded in l around 0
mul-1-negN/A
lower-neg.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
pow2N/A
lift-*.f6423.4
Applied rewrites23.4%
if -2e-231 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) Initial program 70.1%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6473.1
Applied rewrites73.1%
Final simplification50.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 1950000000000.0)
(- (* PI l_m) (* (/ 1.0 F) (/ (tan (* PI 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 <= 1950000000000.0) {
tmp = (((double) M_PI) * l_m) - ((1.0 / F) * (tan((((double) M_PI) * 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 <= 1950000000000.0) {
tmp = (Math.PI * l_m) - ((1.0 / F) * (Math.tan((Math.PI * 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 <= 1950000000000.0: tmp = (math.pi * l_m) - ((1.0 / F) * (math.tan((math.pi * 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 <= 1950000000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(1.0 / F) * Float64(tan(Float64(pi * 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 <= 1950000000000.0) tmp = (pi * l_m) - ((1.0 / F) * (tan((pi * 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, 1950000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(1.0 / F), $MachinePrecision] * N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] / 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 1950000000000:\\
\;\;\;\;\pi \cdot l\_m - \frac{1}{F} \cdot \frac{\tan \left(\pi \cdot l\_m\right)}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 1.95e12Initial program 73.3%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lower-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
pow2N/A
sqr-neg-revN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lower-neg.f6483.4
Applied rewrites83.4%
if 1.95e12 < l Initial program 53.2%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6499.6
Applied rewrites99.6%
Final simplification87.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 1950000000000.0)
(- (* PI l_m) (/ (* (/ 1.0 F) (tan (* PI 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 <= 1950000000000.0) {
tmp = (((double) M_PI) * l_m) - (((1.0 / F) * tan((((double) M_PI) * 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 <= 1950000000000.0) {
tmp = (Math.PI * l_m) - (((1.0 / F) * Math.tan((Math.PI * 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 <= 1950000000000.0: tmp = (math.pi * l_m) - (((1.0 / F) * math.tan((math.pi * 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 <= 1950000000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(Float64(1.0 / F) * tan(Float64(pi * 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 <= 1950000000000.0) tmp = (pi * l_m) - (((1.0 / F) * tan((pi * 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, 1950000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[(1.0 / F), $MachinePrecision] * N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;l\_m \leq 1950000000000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{1}{F} \cdot \tan \left(\pi \cdot l\_m\right)}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 1.95e12Initial program 73.3%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lower-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
pow2N/A
sqr-neg-revN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lower-neg.f6483.4
Applied rewrites83.4%
lift-*.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
metadata-evalN/A
frac-2negN/A
lower-/.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lift-neg.f6483.4
Applied rewrites83.4%
if 1.95e12 < l Initial program 53.2%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6499.6
Applied rewrites99.6%
Final simplification86.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 1.16e-40)
(+ (* PI l_m) (/ (/ (* PI l_m) (- F)) F))
(if (<= l_m 1950000000000.0)
(fma 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 (l_m <= 1.16e-40) {
tmp = (((double) M_PI) * l_m) + (((((double) M_PI) * l_m) / -F) / F);
} else if (l_m <= 1950000000000.0) {
tmp = fma(((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 = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (l_m <= 1.16e-40) tmp = Float64(Float64(pi * l_m) + Float64(Float64(Float64(pi * l_m) / Float64(-F)) / F)); elseif (l_m <= 1950000000000.0) tmp = fma(pi, l_m, Float64(tan(Float64(pi * l_m)) / Float64(Float64(-F) * F))); else tmp = Float64(pi * l_m); 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[l$95$m, 1.16e-40], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[(N[(Pi * l$95$m), $MachinePrecision] / (-F)), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 1950000000000.0], N[(Pi * l$95$m + N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] / 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}\;l\_m \leq 1.16 \cdot 10^{-40}:\\
\;\;\;\;\pi \cdot l\_m + \frac{\frac{\pi \cdot l\_m}{-F}}{F}\\
\mathbf{elif}\;l\_m \leq 1950000000000:\\
\;\;\;\;\mathsf{fma}\left(\pi, l\_m, \frac{\tan \left(\pi \cdot l\_m\right)}{\left(-F\right) \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 1.15999999999999991e-40Initial program 71.1%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lower-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
pow2N/A
sqr-neg-revN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lower-neg.f6482.1
Applied rewrites82.1%
lift-*.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lift-/.f64N/A
lift-neg.f64N/A
lift-neg.f6482.1
Applied rewrites82.1%
Taylor expanded in l around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-PI.f64N/A
lower-/.f6476.0
Applied rewrites76.0%
if 1.15999999999999991e-40 < l < 1.95e12Initial program 99.8%
Taylor expanded in F around inf
associate-*r/N/A
times-fracN/A
quot-tanN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6499.7
Applied rewrites99.7%
lift-fma.f64N/A
lift-*.f64N/A
lift-/.f64N/A
pow2N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
*-commutativeN/A
quot-tanN/A
frac-timesN/A
associate-*r/N/A
lift-PI.f64N/A
lift-*.f64N/A
*-commutativeN/A
Applied rewrites99.8%
if 1.95e12 < l Initial program 53.2%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6499.6
Applied rewrites99.6%
Final simplification82.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 160000.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 (l_m <= 160000.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 (l_m <= 160000.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 l_m <= 160000.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 (l_m <= 160000.0) tmp = Float64(Float64(pi * l_m) + Float64(Float64(Float64(pi * l_m) / Float64(-F)) / F)); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if (l_m <= 160000.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[l$95$m, 160000.0], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[(N[(Pi * l$95$m), $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}\;l\_m \leq 160000:\\
\;\;\;\;\pi \cdot l\_m + \frac{\frac{\pi \cdot l\_m}{-F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 1.6e5Initial program 73.1%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lower-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
pow2N/A
sqr-neg-revN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lower-neg.f6483.3
Applied rewrites83.3%
lift-*.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
lift-/.f64N/A
lift-neg.f64N/A
lift-neg.f6483.4
Applied rewrites83.4%
Taylor expanded in l around 0
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-PI.f64N/A
lower-/.f6476.9
Applied rewrites76.9%
if 1.6e5 < l Initial program 54.0%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6499.6
Applied rewrites99.6%
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 160000.0) (fma 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 <= 160000.0) {
tmp = fma(((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 = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (l_m <= 160000.0) tmp = fma(pi, l_m, Float64(Float64(Float64(-l_m) * pi) / Float64(F * F))); else tmp = Float64(pi * l_m); 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[l$95$m, 160000.0], N[(Pi * l$95$m + N[(N[((-l$95$m) * Pi), $MachinePrecision] / 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}\;l\_m \leq 160000:\\
\;\;\;\;\mathsf{fma}\left(\pi, l\_m, \frac{\left(-l\_m\right) \cdot \pi}{F \cdot F}\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 1.6e5Initial program 73.1%
Taylor expanded in F around inf
associate-*r/N/A
times-fracN/A
quot-tanN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-tan.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6473.1
Applied rewrites73.1%
lift-fma.f64N/A
lift-*.f64N/A
lift-/.f64N/A
pow2N/A
lift-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
*-commutativeN/A
quot-tanN/A
frac-timesN/A
associate-*r/N/A
lift-PI.f64N/A
lift-*.f64N/A
*-commutativeN/A
Applied rewrites75.3%
Taylor expanded in l around 0
mul-1-negN/A
*-commutativeN/A
lift-*.f64N/A
lift-PI.f64N/A
lower-neg.f6468.8
lift-PI.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-PI.f6468.8
Applied rewrites68.8%
if 1.6e5 < l Initial program 54.0%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6499.6
Applied rewrites99.6%
Final simplification75.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 160000.0) (* (- PI (/ PI (* F F))) 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 (l_m <= 160000.0) {
tmp = (((double) M_PI) - (((double) M_PI) / (F * F))) * 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 (l_m <= 160000.0) {
tmp = (Math.PI - (Math.PI / (F * F))) * 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 l_m <= 160000.0: tmp = (math.pi - (math.pi / (F * F))) * 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 (l_m <= 160000.0) tmp = Float64(Float64(pi - Float64(pi / Float64(F * F))) * 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 (l_m <= 160000.0) tmp = (pi - (pi / (F * F))) * 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[l$95$m, 160000.0], N[(N[(Pi - N[(Pi / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * l$95$m), $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 160000:\\
\;\;\;\;\left(\pi - \frac{\pi}{F \cdot F}\right) \cdot l\_m\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 1.6e5Initial program 73.1%
Taylor expanded in l around 0
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lift-PI.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
pow2N/A
lift-*.f6466.7
Applied rewrites66.7%
if 1.6e5 < l Initial program 54.0%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6499.6
Applied rewrites99.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 68.9%
Taylor expanded in F around inf
*-commutativeN/A
lift-*.f64N/A
lift-PI.f6469.8
Applied rewrites69.8%
l\_m = (fabs.f64 l) l\_s = (copysign.f64 #s(literal 1 binary64) l) (FPCore (l_s F l_m) :precision binary64 (* l_s 0.0))
l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
return l_s * 0.0;
}
l\_m = private
l\_s = private
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(l_s, f, l_m)
use fmin_fmax_functions
real(8), intent (in) :: l_s
real(8), intent (in) :: f
real(8), intent (in) :: l_m
code = l_s * 0.0d0
end function
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 * 0.0;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): return l_s * 0.0
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) return Float64(l_s * 0.0) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp = code(l_s, F, l_m) tmp = l_s * 0.0; 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 * 0.0), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot 0
\end{array}
Initial program 68.9%
lift-tan.f64N/A
tan-+PI-revN/A
lower-tan.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
lift-PI.f64N/A
lift-PI.f6450.1
Applied rewrites50.1%
Taylor expanded in l around 0
lift-*.f64N/A
lift-PI.f64N/A
tan-+PI-revN/A
lift-PI.f64N/A
lift-*.f64N/A
associate-*r/N/A
sin-PIN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
sin-PIN/A
log-pow-revN/A
add-log-expN/A
*-commutativeN/A
Applied rewrites2.4%
Taylor expanded in F around 0
Applied rewrites2.9%
herbie shell --seed 2025072
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))