
(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 (<= (* PI l_m) 20000000000000.0)
(+ (* 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) <= 20000000000000.0) {
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) <= 20000000000000.0) {
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) <= 20000000000000.0: 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) <= 20000000000000.0) tmp = Float64(Float64(pi * l_m) + Float64(-1.0 / Float64(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) <= 20000000000000.0) 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], 20000000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(-1.0 / N[(F * N[(F / N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $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 20000000000000:\\
\;\;\;\;\pi \cdot l\_m + \frac{-1}{F \cdot \frac{F}{\tan \left(\pi \cdot l\_m\right)}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e13Initial program 79.8%
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-*l/N/A
*-lft-identityN/A
lift-*.f64N/A
associate-/r*N/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6485.1
Applied egg-rr85.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6485.1
Applied egg-rr85.1%
if 2e13 < (*.f64 (PI.f64) l) Initial program 68.0%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.6
Simplified99.6%
Final simplification88.5%
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) (* (tan (* PI l_m)) (/ -1.0 (* F F))))))
(*
l_s
(if (<= t_0 -5e+153)
(* PI l_m)
(if (<= t_0 -4e-265) (/ (* 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 t_0 = (((double) M_PI) * l_m) + (tan((((double) M_PI) * l_m)) * (-1.0 / (F * F)));
double tmp;
if (t_0 <= -5e+153) {
tmp = ((double) M_PI) * l_m;
} else if (t_0 <= -4e-265) {
tmp = (((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 t_0 = (Math.PI * l_m) + (Math.tan((Math.PI * l_m)) * (-1.0 / (F * F)));
double tmp;
if (t_0 <= -5e+153) {
tmp = Math.PI * l_m;
} else if (t_0 <= -4e-265) {
tmp = (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): t_0 = (math.pi * l_m) + (math.tan((math.pi * l_m)) * (-1.0 / (F * F))) tmp = 0 if t_0 <= -5e+153: tmp = math.pi * l_m elif t_0 <= -4e-265: tmp = (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) t_0 = Float64(Float64(pi * l_m) + Float64(tan(Float64(pi * l_m)) * Float64(-1.0 / Float64(F * F)))) tmp = 0.0 if (t_0 <= -5e+153) tmp = Float64(pi * l_m); elseif (t_0 <= -4e-265) tmp = Float64(Float64(pi * l_m) / Float64(-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) + (tan((pi * l_m)) * (-1.0 / (F * F))); tmp = 0.0; if (t_0 <= -5e+153) tmp = pi * l_m; elseif (t_0 <= -4e-265) tmp = (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_] := Block[{t$95$0 = N[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(l$95$s * If[LessEqual[t$95$0, -5e+153], N[(Pi * l$95$m), $MachinePrecision], If[LessEqual[t$95$0, -4e-265], N[(N[(Pi * l$95$m), $MachinePrecision] / (-N[(F * 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)
\\
\begin{array}{l}
t_0 := \pi \cdot l\_m + \tan \left(\pi \cdot l\_m\right) \cdot \frac{-1}{F \cdot F}\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq -5 \cdot 10^{+153}:\\
\;\;\;\;\pi \cdot l\_m\\
\mathbf{elif}\;t\_0 \leq -4 \cdot 10^{-265}:\\
\;\;\;\;\frac{\pi \cdot l\_m}{-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)))) < -5.00000000000000018e153 or -3.99999999999999994e-265 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) Initial program 69.8%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6479.3
Simplified79.3%
if -5.00000000000000018e153 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) < -3.99999999999999994e-265Initial program 96.9%
Taylor expanded in l around 0
lower-*.f64N/A
lower--.f64N/A
lower-PI.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6492.8
Simplified92.8%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6426.4
Simplified26.4%
lift-PI.f64N/A
lift-*.f64N/A
distribute-neg-frac2N/A
lift-neg.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6426.4
Applied egg-rr26.4%
Final simplification65.3%
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) (* (tan (* PI l_m)) (/ -1.0 (* F F))))))
(*
l_s
(if (<= t_0 -5e+153)
(* PI l_m)
(if (<= t_0 -4e-265) (- (* 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) + (tan((((double) M_PI) * l_m)) * (-1.0 / (F * F)));
double tmp;
if (t_0 <= -5e+153) {
tmp = ((double) M_PI) * l_m;
} else if (t_0 <= -4e-265) {
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) + (Math.tan((Math.PI * l_m)) * (-1.0 / (F * F)));
double tmp;
if (t_0 <= -5e+153) {
tmp = Math.PI * l_m;
} else if (t_0 <= -4e-265) {
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) + (math.tan((math.pi * l_m)) * (-1.0 / (F * F))) tmp = 0 if t_0 <= -5e+153: tmp = math.pi * l_m elif t_0 <= -4e-265: 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(tan(Float64(pi * l_m)) * Float64(-1.0 / Float64(F * F)))) tmp = 0.0 if (t_0 <= -5e+153) tmp = Float64(pi * l_m); elseif (t_0 <= -4e-265) 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) + (tan((pi * l_m)) * (-1.0 / (F * F))); tmp = 0.0; if (t_0 <= -5e+153) tmp = pi * l_m; elseif (t_0 <= -4e-265) 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[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(l$95$s * If[LessEqual[t$95$0, -5e+153], N[(Pi * l$95$m), $MachinePrecision], If[LessEqual[t$95$0, -4e-265], (-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 + \tan \left(\pi \cdot l\_m\right) \cdot \frac{-1}{F \cdot F}\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq -5 \cdot 10^{+153}:\\
\;\;\;\;\pi \cdot l\_m\\
\mathbf{elif}\;t\_0 \leq -4 \cdot 10^{-265}:\\
\;\;\;\;-l\_m \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)))) < -5.00000000000000018e153 or -3.99999999999999994e-265 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) Initial program 69.8%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6479.3
Simplified79.3%
if -5.00000000000000018e153 < (-.f64 (*.f64 (PI.f64) l) (*.f64 (/.f64 #s(literal 1 binary64) (*.f64 F F)) (tan.f64 (*.f64 (PI.f64) l)))) < -3.99999999999999994e-265Initial program 96.9%
Taylor expanded in l around 0
lower-*.f64N/A
lower--.f64N/A
lower-PI.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6492.8
Simplified92.8%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6426.4
Simplified26.4%
Final simplification65.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) 20000000000000.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 ((((double) M_PI) * l_m) <= 20000000000000.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 ((Math.PI * l_m) <= 20000000000000.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 (math.pi * l_m) <= 20000000000000.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 (Float64(pi * l_m) <= 20000000000000.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 ((pi * l_m) <= 20000000000000.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[N[(Pi * l$95$m), $MachinePrecision], 20000000000000.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}\;\pi \cdot l\_m \leq 20000000000000:\\
\;\;\;\;\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) < 2e13Initial program 79.8%
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-*l/N/A
*-lft-identityN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6485.1
Applied egg-rr85.1%
if 2e13 < (*.f64 (PI.f64) l) Initial program 68.0%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.6
Simplified99.6%
Final simplification88.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) 20000000000000.0)
(+
(* PI l_m)
(/
-1.0
(*
F
(/
(fma
(* F (* l_m l_m))
(/ (* (* PI (* PI PI)) 0.3333333333333333) (* PI (- PI)))
(/ F PI))
l_m))))
(* PI l_m))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 20000000000000.0) {
tmp = (((double) M_PI) * l_m) + (-1.0 / (F * (fma((F * (l_m * l_m)), (((((double) M_PI) * (((double) M_PI) * ((double) M_PI))) * 0.3333333333333333) / (((double) M_PI) * -((double) M_PI))), (F / ((double) M_PI))) / l_m)));
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 20000000000000.0) tmp = Float64(Float64(pi * l_m) + Float64(-1.0 / Float64(F * Float64(fma(Float64(F * Float64(l_m * l_m)), Float64(Float64(Float64(pi * Float64(pi * pi)) * 0.3333333333333333) / Float64(pi * Float64(-pi))), Float64(F / pi)) / l_m)))); 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[N[(Pi * l$95$m), $MachinePrecision], 20000000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(-1.0 / N[(F * N[(N[(N[(F * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(Pi * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision] * 0.3333333333333333), $MachinePrecision] / N[(Pi * (-Pi)), $MachinePrecision]), $MachinePrecision] + N[(F / Pi), $MachinePrecision]), $MachinePrecision] / l$95$m), $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 20000000000000:\\
\;\;\;\;\pi \cdot l\_m + \frac{-1}{F \cdot \frac{\mathsf{fma}\left(F \cdot \left(l\_m \cdot l\_m\right), \frac{\left(\pi \cdot \left(\pi \cdot \pi\right)\right) \cdot 0.3333333333333333}{\pi \cdot \left(-\pi\right)}, \frac{F}{\pi}\right)}{l\_m}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 2e13Initial program 79.8%
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-*l/N/A
*-lft-identityN/A
lift-*.f64N/A
associate-/r*N/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6485.1
Applied egg-rr85.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6485.1
Applied egg-rr85.1%
Taylor expanded in l around 0
lower-/.f64N/A
Simplified90.3%
if 2e13 < (*.f64 (PI.f64) l) Initial program 68.0%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6499.6
Simplified99.6%
Final simplification92.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) 5000000000000.0)
(fma
(*
l_m
(fma l_m (* l_m (* (* PI (* PI PI)) (/ 0.3333333333333333 F))) (/ PI F)))
(/ -1.0 F)
(* PI l_m))
(* PI l_m))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 5000000000000.0) {
tmp = fma((l_m * fma(l_m, (l_m * ((((double) M_PI) * (((double) M_PI) * ((double) M_PI))) * (0.3333333333333333 / F))), (((double) M_PI) / F))), (-1.0 / F), (((double) M_PI) * l_m));
} 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 (Float64(pi * l_m) <= 5000000000000.0) tmp = fma(Float64(l_m * fma(l_m, Float64(l_m * Float64(Float64(pi * Float64(pi * pi)) * Float64(0.3333333333333333 / F))), Float64(pi / F))), Float64(-1.0 / F), Float64(pi * l_m)); 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[N[(Pi * l$95$m), $MachinePrecision], 5000000000000.0], N[(N[(l$95$m * N[(l$95$m * N[(l$95$m * N[(N[(Pi * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision] * N[(0.3333333333333333 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(Pi / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / F), $MachinePrecision] + N[(Pi * l$95$m), $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 5000000000000:\\
\;\;\;\;\mathsf{fma}\left(l\_m \cdot \mathsf{fma}\left(l\_m, l\_m \cdot \left(\left(\pi \cdot \left(\pi \cdot \pi\right)\right) \cdot \frac{0.3333333333333333}{F}\right), \frac{\pi}{F}\right), \frac{-1}{F}, \pi \cdot l\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5e12Initial program 80.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
lift-*.f64N/A
sub-negN/A
+-commutativeN/A
Applied egg-rr85.3%
Taylor expanded in l around 0
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-fma.f64N/A
Simplified70.0%
if 5e12 < (*.f64 (PI.f64) l) Initial program 67.4%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6498.1
Simplified98.1%
Final simplification76.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
(if (<= (* PI l_m) 5000000000000.0)
(fma (/ l_m (- F)) (/ PI F) (* PI l_m))
(* PI l_m))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 5000000000000.0) {
tmp = fma((l_m / -F), (((double) M_PI) / F), (((double) M_PI) * l_m));
} 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 (Float64(pi * l_m) <= 5000000000000.0) tmp = fma(Float64(l_m / Float64(-F)), Float64(pi / F), Float64(pi * l_m)); 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[N[(Pi * l$95$m), $MachinePrecision], 5000000000000.0], N[(N[(l$95$m / (-F)), $MachinePrecision] * N[(Pi / F), $MachinePrecision] + N[(Pi * l$95$m), $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 5000000000000:\\
\;\;\;\;\mathsf{fma}\left(\frac{l\_m}{-F}, \frac{\pi}{F}, \pi \cdot l\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5e12Initial program 80.1%
associate-/r*N/A
frac-2negN/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6485.4
Applied egg-rr85.4%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6479.6
Simplified79.6%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sub-negN/A
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-neg2N/A
remove-double-negN/A
+-commutativeN/A
Applied egg-rr79.6%
if 5e12 < (*.f64 (PI.f64) l) Initial program 67.4%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6498.1
Simplified98.1%
Final simplification84.1%
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) 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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) <= 5000000000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(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) <= 5000000000000.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], 5000000000000.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}\;\pi \cdot l\_m \leq 5000000000000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\pi \cdot l\_m}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 5e12Initial program 80.1%
associate-/r*N/A
frac-2negN/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-neg.f6485.4
Applied egg-rr85.4%
Taylor expanded in l around 0
lower-*.f64N/A
lower-PI.f6479.6
Simplified79.6%
lift-/.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-frac-neg2N/A
distribute-frac-negN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
distribute-neg-frac2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
neg-mul-1N/A
lift-neg.f64N/A
associate-*l/N/A
lift-neg.f64N/A
frac-2negN/A
lift-/.f64N/A
*-commutativeN/A
Applied egg-rr79.6%
if 5e12 < (*.f64 (PI.f64) l) Initial program 67.4%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6498.1
Simplified98.1%
Final simplification84.1%
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) 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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], 5000000000000.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 5000000000000:\\
\;\;\;\;\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) < 5e12Initial program 80.1%
lift-*.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-*l/N/A
*-lft-identityN/A
lift-*.f64N/A
associate-/r*N/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6485.3
Applied egg-rr85.3%
lift-PI.f64N/A
lift-*.f64N/A
lift-tan.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6485.4
Applied egg-rr85.4%
Taylor expanded in l around 0
distribute-rgt-out--N/A
associate-*l/N/A
associate-/l*N/A
distribute-lft-out--N/A
lower-*.f64N/A
lower-PI.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6474.4
Simplified74.4%
if 5e12 < (*.f64 (PI.f64) l) Initial program 67.4%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6498.1
Simplified98.1%
Final simplification80.1%
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) 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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) <= 5000000000000.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], 5000000000000.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 5000000000000:\\
\;\;\;\;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) < 5e12Initial program 80.1%
Taylor expanded in l around 0
lower-*.f64N/A
lower--.f64N/A
lower-PI.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
unpow2N/A
lower-*.f6474.3
Simplified74.3%
if 5e12 < (*.f64 (PI.f64) l) Initial program 67.4%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6498.1
Simplified98.1%
Final simplification80.1%
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 77.0%
Taylor expanded in l around inf
lower-*.f64N/A
lower-PI.f6478.3
Simplified78.3%
Final simplification78.3%
herbie shell --seed 2024211
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))