
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -2.1e-6) (* (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) phi1) R) (* (hypot (* (cos (* 0.5 phi2)) (- lambda1 lambda2)) phi2) R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.1e-6) {
tmp = hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), phi1) * R;
} else {
tmp = hypot((cos((0.5 * phi2)) * (lambda1 - lambda2)), phi2) * R;
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.1e-6) {
tmp = Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), phi1) * R;
} else {
tmp = Math.hypot((Math.cos((0.5 * phi2)) * (lambda1 - lambda2)), phi2) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -2.1e-6: tmp = math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), phi1) * R else: tmp = math.hypot((math.cos((0.5 * phi2)) * (lambda1 - lambda2)), phi2) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -2.1e-6) tmp = Float64(hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), phi1) * R); else tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi2)) * Float64(lambda1 - lambda2)), phi2) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -2.1e-6)
tmp = hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), phi1) * R;
else
tmp = hypot((cos((0.5 * phi2)) * (lambda1 - lambda2)), phi2) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -2.1e-6], N[(N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -2.1 \cdot 10^{-6}:\\
\;\;\;\;\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -2.0999999999999998e-6Initial program 59.5%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6476.1
Applied rewrites76.1%
if -2.0999999999999998e-6 < phi1 Initial program 65.2%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6477.9
Applied rewrites77.9%
Final simplification77.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (hypot (* (cos (* 0.5 phi1)) lambda1) phi1) R)))
(if (<= phi2 8.5e-278)
t_0
(if (<= phi2 1.75e-99)
(*
(hypot (* (fma -0.125 (* phi1 phi1) 1.0) (- lambda1 lambda2)) phi1)
R)
(if (<= phi2 7.2e+30)
t_0
(* (hypot (* (cos (* 0.5 phi2)) lambda2) phi2) R))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = hypot((cos((0.5 * phi1)) * lambda1), phi1) * R;
double tmp;
if (phi2 <= 8.5e-278) {
tmp = t_0;
} else if (phi2 <= 1.75e-99) {
tmp = hypot((fma(-0.125, (phi1 * phi1), 1.0) * (lambda1 - lambda2)), phi1) * R;
} else if (phi2 <= 7.2e+30) {
tmp = t_0;
} else {
tmp = hypot((cos((0.5 * phi2)) * lambda2), phi2) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(hypot(Float64(cos(Float64(0.5 * phi1)) * lambda1), phi1) * R) tmp = 0.0 if (phi2 <= 8.5e-278) tmp = t_0; elseif (phi2 <= 1.75e-99) tmp = Float64(hypot(Float64(fma(-0.125, Float64(phi1 * phi1), 1.0) * Float64(lambda1 - lambda2)), phi1) * R); elseif (phi2 <= 7.2e+30) tmp = t_0; else tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi2)) * lambda2), phi2) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * lambda1), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision]}, If[LessEqual[phi2, 8.5e-278], t$95$0, If[LessEqual[phi2, 1.75e-99], N[(N[Sqrt[N[(N[(-0.125 * N[(phi1 * phi1), $MachinePrecision] + 1.0), $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi2, 7.2e+30], t$95$0, N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision] * R), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \lambda_1, \phi_1\right) \cdot R\\
\mathbf{if}\;\phi_2 \leq 8.5 \cdot 10^{-278}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 1.75 \cdot 10^{-99}:\\
\;\;\;\;\mathsf{hypot}\left(\mathsf{fma}\left(-0.125, \phi_1 \cdot \phi_1, 1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right) \cdot R\\
\mathbf{elif}\;\phi_2 \leq 7.2 \cdot 10^{+30}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \lambda_2, \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 8.49999999999999955e-278 or 1.7499999999999999e-99 < phi2 < 7.2000000000000004e30Initial program 65.7%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6473.6
Applied rewrites73.6%
Taylor expanded in lambda2 around 0
Applied rewrites58.2%
if 8.49999999999999955e-278 < phi2 < 1.7499999999999999e-99Initial program 63.6%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f64100.0
Applied rewrites100.0%
Taylor expanded in phi1 around 0
Applied rewrites69.3%
if 7.2000000000000004e30 < phi2 Initial program 56.0%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6484.8
Applied rewrites84.8%
Taylor expanded in lambda1 around 0
Applied rewrites73.5%
Final simplification62.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (hypot (* (cos (* 0.5 phi1)) lambda1) phi1) R)))
(if (<= phi2 8.5e-278)
t_0
(if (<= phi2 1.75e-99)
(*
(hypot (* (fma -0.125 (* phi1 phi1) 1.0) (- lambda1 lambda2)) phi1)
R)
(if (<= phi2 55000.0) t_0 (* (- phi2 phi1) R))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = hypot((cos((0.5 * phi1)) * lambda1), phi1) * R;
double tmp;
if (phi2 <= 8.5e-278) {
tmp = t_0;
} else if (phi2 <= 1.75e-99) {
tmp = hypot((fma(-0.125, (phi1 * phi1), 1.0) * (lambda1 - lambda2)), phi1) * R;
} else if (phi2 <= 55000.0) {
tmp = t_0;
} else {
tmp = (phi2 - phi1) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(hypot(Float64(cos(Float64(0.5 * phi1)) * lambda1), phi1) * R) tmp = 0.0 if (phi2 <= 8.5e-278) tmp = t_0; elseif (phi2 <= 1.75e-99) tmp = Float64(hypot(Float64(fma(-0.125, Float64(phi1 * phi1), 1.0) * Float64(lambda1 - lambda2)), phi1) * R); elseif (phi2 <= 55000.0) tmp = t_0; else tmp = Float64(Float64(phi2 - phi1) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * lambda1), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision]}, If[LessEqual[phi2, 8.5e-278], t$95$0, If[LessEqual[phi2, 1.75e-99], N[(N[Sqrt[N[(N[(-0.125 * N[(phi1 * phi1), $MachinePrecision] + 1.0), $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi2, 55000.0], t$95$0, N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \lambda_1, \phi_1\right) \cdot R\\
\mathbf{if}\;\phi_2 \leq 8.5 \cdot 10^{-278}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 1.75 \cdot 10^{-99}:\\
\;\;\;\;\mathsf{hypot}\left(\mathsf{fma}\left(-0.125, \phi_1 \cdot \phi_1, 1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right) \cdot R\\
\mathbf{elif}\;\phi_2 \leq 55000:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 8.49999999999999955e-278 or 1.7499999999999999e-99 < phi2 < 55000Initial program 64.5%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6473.8
Applied rewrites73.8%
Taylor expanded in lambda2 around 0
Applied rewrites58.4%
if 8.49999999999999955e-278 < phi2 < 1.7499999999999999e-99Initial program 63.6%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f64100.0
Applied rewrites100.0%
Taylor expanded in phi1 around 0
Applied rewrites69.3%
if 55000 < phi2 Initial program 60.7%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6455.9
Applied rewrites55.9%
Taylor expanded in phi1 around 0
Applied rewrites55.9%
Final simplification59.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -2.3e+44)
(* (hypot (* (cos (* 0.5 phi1)) lambda1) phi1) R)
(if (<= phi1 -4.8e-155)
(* (hypot (* (fma -0.125 (* phi1 phi1) 1.0) (- lambda1 lambda2)) phi1) R)
(* (hypot (* (cos (* 0.5 phi2)) lambda1) phi2) R))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.3e+44) {
tmp = hypot((cos((0.5 * phi1)) * lambda1), phi1) * R;
} else if (phi1 <= -4.8e-155) {
tmp = hypot((fma(-0.125, (phi1 * phi1), 1.0) * (lambda1 - lambda2)), phi1) * R;
} else {
tmp = hypot((cos((0.5 * phi2)) * lambda1), phi2) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -2.3e+44) tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi1)) * lambda1), phi1) * R); elseif (phi1 <= -4.8e-155) tmp = Float64(hypot(Float64(fma(-0.125, Float64(phi1 * phi1), 1.0) * Float64(lambda1 - lambda2)), phi1) * R); else tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi2)) * lambda1), phi2) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -2.3e+44], N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * lambda1), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi1, -4.8e-155], N[(N[Sqrt[N[(N[(-0.125 * N[(phi1 * phi1), $MachinePrecision] + 1.0), $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * lambda1), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision] * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -2.3 \cdot 10^{+44}:\\
\;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \lambda_1, \phi_1\right) \cdot R\\
\mathbf{elif}\;\phi_1 \leq -4.8 \cdot 10^{-155}:\\
\;\;\;\;\mathsf{hypot}\left(\mathsf{fma}\left(-0.125, \phi_1 \cdot \phi_1, 1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \lambda_1, \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -2.30000000000000004e44Initial program 58.3%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6476.5
Applied rewrites76.5%
Taylor expanded in lambda2 around 0
Applied rewrites70.2%
if -2.30000000000000004e44 < phi1 < -4.8e-155Initial program 71.2%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6470.2
Applied rewrites70.2%
Taylor expanded in phi1 around 0
Applied rewrites64.2%
if -4.8e-155 < phi1 Initial program 63.9%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6475.5
Applied rewrites75.5%
Taylor expanded in lambda2 around 0
Applied rewrites59.8%
Final simplification63.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 2.2e+35) (* (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) phi1) R) (* (hypot (* (cos (* 0.5 phi2)) lambda2) phi2) R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.2e+35) {
tmp = hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), phi1) * R;
} else {
tmp = hypot((cos((0.5 * phi2)) * lambda2), phi2) * R;
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.2e+35) {
tmp = Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), phi1) * R;
} else {
tmp = Math.hypot((Math.cos((0.5 * phi2)) * lambda2), phi2) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.2e+35: tmp = math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), phi1) * R else: tmp = math.hypot((math.cos((0.5 * phi2)) * lambda2), phi2) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.2e+35) tmp = Float64(hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), phi1) * R); else tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi2)) * lambda2), phi2) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 2.2e+35)
tmp = hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), phi1) * R;
else
tmp = hypot((cos((0.5 * phi2)) * lambda2), phi2) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.2e+35], N[(N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.2 \cdot 10^{+35}:\\
\;\;\;\;\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \lambda_2, \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 2.1999999999999999e35Initial program 65.7%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6477.7
Applied rewrites77.7%
if 2.1999999999999999e35 < phi2 Initial program 54.2%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6484.2
Applied rewrites84.2%
Taylor expanded in lambda1 around 0
Applied rewrites74.3%
Final simplification77.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= (- lambda1 lambda2) -2e+216)
(* (hypot (* (fma -0.125 (* phi1 phi1) 1.0) (- lambda1 lambda2)) phi1) R)
(if (<= (- lambda1 lambda2) -4e+73)
(* (- phi1) (fma (- phi2) (/ R phi1) R))
(* (- phi2 phi1) R))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((lambda1 - lambda2) <= -2e+216) {
tmp = hypot((fma(-0.125, (phi1 * phi1), 1.0) * (lambda1 - lambda2)), phi1) * R;
} else if ((lambda1 - lambda2) <= -4e+73) {
tmp = -phi1 * fma(-phi2, (R / phi1), R);
} else {
tmp = (phi2 - phi1) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (Float64(lambda1 - lambda2) <= -2e+216) tmp = Float64(hypot(Float64(fma(-0.125, Float64(phi1 * phi1), 1.0) * Float64(lambda1 - lambda2)), phi1) * R); elseif (Float64(lambda1 - lambda2) <= -4e+73) tmp = Float64(Float64(-phi1) * fma(Float64(-phi2), Float64(R / phi1), R)); else tmp = Float64(Float64(phi2 - phi1) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -2e+216], N[(N[Sqrt[N[(N[(-0.125 * N[(phi1 * phi1), $MachinePrecision] + 1.0), $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -4e+73], N[((-phi1) * N[((-phi2) * N[(R / phi1), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 - \lambda_2 \leq -2 \cdot 10^{+216}:\\
\;\;\;\;\mathsf{hypot}\left(\mathsf{fma}\left(-0.125, \phi_1 \cdot \phi_1, 1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right) \cdot R\\
\mathbf{elif}\;\lambda_1 - \lambda_2 \leq -4 \cdot 10^{+73}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \mathsf{fma}\left(-\phi_2, \frac{R}{\phi_1}, R\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\end{array}
\end{array}
if (-.f64 lambda1 lambda2) < -2e216Initial program 56.8%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6481.5
Applied rewrites81.5%
Taylor expanded in phi1 around 0
Applied rewrites75.3%
if -2e216 < (-.f64 lambda1 lambda2) < -3.99999999999999993e73Initial program 58.6%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6468.0
Applied rewrites68.0%
Taylor expanded in phi1 around -inf
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6430.7
Applied rewrites30.7%
Applied rewrites30.7%
if -3.99999999999999993e73 < (-.f64 lambda1 lambda2) Initial program 65.8%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6429.9
Applied rewrites29.9%
Taylor expanded in phi1 around 0
Applied rewrites32.6%
Final simplification37.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -2.55e-30)
(* (* (cos (* (+ phi2 phi1) 0.5)) (- lambda1)) R)
(if (<= lambda2 2.4e+73)
(* (- phi2 phi1) R)
(if (<= lambda2 1.8e+216)
(* (- phi1) (fma (- phi2) (/ R phi1) R))
(* (* lambda2 R) (cos (* 0.5 phi1)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.55e-30) {
tmp = (cos(((phi2 + phi1) * 0.5)) * -lambda1) * R;
} else if (lambda2 <= 2.4e+73) {
tmp = (phi2 - phi1) * R;
} else if (lambda2 <= 1.8e+216) {
tmp = -phi1 * fma(-phi2, (R / phi1), R);
} else {
tmp = (lambda2 * R) * cos((0.5 * phi1));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -2.55e-30) tmp = Float64(Float64(cos(Float64(Float64(phi2 + phi1) * 0.5)) * Float64(-lambda1)) * R); elseif (lambda2 <= 2.4e+73) tmp = Float64(Float64(phi2 - phi1) * R); elseif (lambda2 <= 1.8e+216) tmp = Float64(Float64(-phi1) * fma(Float64(-phi2), Float64(R / phi1), R)); else tmp = Float64(Float64(lambda2 * R) * cos(Float64(0.5 * phi1))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -2.55e-30], N[(N[(N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision] * (-lambda1)), $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 2.4e+73], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 1.8e+216], N[((-phi1) * N[((-phi2) * N[(R / phi1), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(N[(lambda2 * R), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -2.55 \cdot 10^{-30}:\\
\;\;\;\;\left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \left(-\lambda_1\right)\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 2.4 \cdot 10^{+73}:\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 1.8 \cdot 10^{+216}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \mathsf{fma}\left(-\phi_2, \frac{R}{\phi_1}, R\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\lambda_2 \cdot R\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\\
\end{array}
\end{array}
if lambda2 < -2.54999999999999986e-30Initial program 54.5%
Taylor expanded in lambda1 around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6416.1
Applied rewrites16.1%
if -2.54999999999999986e-30 < lambda2 < 2.40000000000000002e73Initial program 70.5%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6432.8
Applied rewrites32.8%
Taylor expanded in phi1 around 0
Applied rewrites35.8%
if 2.40000000000000002e73 < lambda2 < 1.8000000000000001e216Initial program 59.4%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6474.3
Applied rewrites74.3%
Taylor expanded in phi1 around -inf
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6429.9
Applied rewrites29.9%
Applied rewrites40.7%
if 1.8000000000000001e216 < lambda2 Initial program 56.7%
Taylor expanded in lambda2 around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6469.0
Applied rewrites69.0%
Taylor expanded in phi2 around 0
Applied rewrites72.0%
Final simplification33.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -2.55e-30)
(* (* (- lambda1) R) (cos (* (+ phi2 phi1) 0.5)))
(if (<= lambda2 2.4e+73)
(* (- phi2 phi1) R)
(if (<= lambda2 1.8e+216)
(* (- phi1) (fma (- phi2) (/ R phi1) R))
(* (* lambda2 R) (cos (* 0.5 phi1)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.55e-30) {
tmp = (-lambda1 * R) * cos(((phi2 + phi1) * 0.5));
} else if (lambda2 <= 2.4e+73) {
tmp = (phi2 - phi1) * R;
} else if (lambda2 <= 1.8e+216) {
tmp = -phi1 * fma(-phi2, (R / phi1), R);
} else {
tmp = (lambda2 * R) * cos((0.5 * phi1));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -2.55e-30) tmp = Float64(Float64(Float64(-lambda1) * R) * cos(Float64(Float64(phi2 + phi1) * 0.5))); elseif (lambda2 <= 2.4e+73) tmp = Float64(Float64(phi2 - phi1) * R); elseif (lambda2 <= 1.8e+216) tmp = Float64(Float64(-phi1) * fma(Float64(-phi2), Float64(R / phi1), R)); else tmp = Float64(Float64(lambda2 * R) * cos(Float64(0.5 * phi1))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -2.55e-30], N[(N[((-lambda1) * R), $MachinePrecision] * N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 2.4e+73], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 1.8e+216], N[((-phi1) * N[((-phi2) * N[(R / phi1), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(N[(lambda2 * R), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -2.55 \cdot 10^{-30}:\\
\;\;\;\;\left(\left(-\lambda_1\right) \cdot R\right) \cdot \cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right)\\
\mathbf{elif}\;\lambda_2 \leq 2.4 \cdot 10^{+73}:\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 1.8 \cdot 10^{+216}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \mathsf{fma}\left(-\phi_2, \frac{R}{\phi_1}, R\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\lambda_2 \cdot R\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\\
\end{array}
\end{array}
if lambda2 < -2.54999999999999986e-30Initial program 54.5%
Taylor expanded in lambda1 around -inf
mul-1-negN/A
associate-*r*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6416.1
Applied rewrites16.1%
if -2.54999999999999986e-30 < lambda2 < 2.40000000000000002e73Initial program 70.5%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6432.8
Applied rewrites32.8%
Taylor expanded in phi1 around 0
Applied rewrites35.8%
if 2.40000000000000002e73 < lambda2 < 1.8000000000000001e216Initial program 59.4%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6474.3
Applied rewrites74.3%
Taylor expanded in phi1 around -inf
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6429.9
Applied rewrites29.9%
Applied rewrites40.7%
if 1.8000000000000001e216 < lambda2 Initial program 56.7%
Taylor expanded in lambda2 around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6469.0
Applied rewrites69.0%
Taylor expanded in phi2 around 0
Applied rewrites72.0%
Final simplification33.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* 0.5 phi1))))
(if (<= lambda2 -2.55e-30)
(* (* (- lambda1) t_0) R)
(if (<= lambda2 2.4e+73)
(* (- phi2 phi1) R)
(if (<= lambda2 1.8e+216)
(* (- phi1) (fma (- phi2) (/ R phi1) R))
(* (* lambda2 R) t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((0.5 * phi1));
double tmp;
if (lambda2 <= -2.55e-30) {
tmp = (-lambda1 * t_0) * R;
} else if (lambda2 <= 2.4e+73) {
tmp = (phi2 - phi1) * R;
} else if (lambda2 <= 1.8e+216) {
tmp = -phi1 * fma(-phi2, (R / phi1), R);
} else {
tmp = (lambda2 * R) * t_0;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(0.5 * phi1)) tmp = 0.0 if (lambda2 <= -2.55e-30) tmp = Float64(Float64(Float64(-lambda1) * t_0) * R); elseif (lambda2 <= 2.4e+73) tmp = Float64(Float64(phi2 - phi1) * R); elseif (lambda2 <= 1.8e+216) tmp = Float64(Float64(-phi1) * fma(Float64(-phi2), Float64(R / phi1), R)); else tmp = Float64(Float64(lambda2 * R) * t_0); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda2, -2.55e-30], N[(N[((-lambda1) * t$95$0), $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 2.4e+73], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 1.8e+216], N[((-phi1) * N[((-phi2) * N[(R / phi1), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(N[(lambda2 * R), $MachinePrecision] * t$95$0), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(0.5 \cdot \phi_1\right)\\
\mathbf{if}\;\lambda_2 \leq -2.55 \cdot 10^{-30}:\\
\;\;\;\;\left(\left(-\lambda_1\right) \cdot t\_0\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 2.4 \cdot 10^{+73}:\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 1.8 \cdot 10^{+216}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \mathsf{fma}\left(-\phi_2, \frac{R}{\phi_1}, R\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\lambda_2 \cdot R\right) \cdot t\_0\\
\end{array}
\end{array}
if lambda2 < -2.54999999999999986e-30Initial program 54.5%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6464.0
Applied rewrites64.0%
Taylor expanded in lambda1 around -inf
Applied rewrites11.9%
if -2.54999999999999986e-30 < lambda2 < 2.40000000000000002e73Initial program 70.5%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6432.8
Applied rewrites32.8%
Taylor expanded in phi1 around 0
Applied rewrites35.8%
if 2.40000000000000002e73 < lambda2 < 1.8000000000000001e216Initial program 59.4%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6474.3
Applied rewrites74.3%
Taylor expanded in phi1 around -inf
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6429.9
Applied rewrites29.9%
Applied rewrites40.7%
if 1.8000000000000001e216 < lambda2 Initial program 56.7%
Taylor expanded in lambda2 around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6469.0
Applied rewrites69.0%
Taylor expanded in phi2 around 0
Applied rewrites72.0%
Final simplification32.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 2.4e+73)
(* (- phi2 phi1) R)
(if (<= lambda2 1.8e+216)
(* (- phi1) (fma (- phi2) (/ R phi1) R))
(* (* lambda2 R) (cos (* 0.5 phi1))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.4e+73) {
tmp = (phi2 - phi1) * R;
} else if (lambda2 <= 1.8e+216) {
tmp = -phi1 * fma(-phi2, (R / phi1), R);
} else {
tmp = (lambda2 * R) * cos((0.5 * phi1));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2.4e+73) tmp = Float64(Float64(phi2 - phi1) * R); elseif (lambda2 <= 1.8e+216) tmp = Float64(Float64(-phi1) * fma(Float64(-phi2), Float64(R / phi1), R)); else tmp = Float64(Float64(lambda2 * R) * cos(Float64(0.5 * phi1))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2.4e+73], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 1.8e+216], N[((-phi1) * N[((-phi2) * N[(R / phi1), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(N[(lambda2 * R), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2.4 \cdot 10^{+73}:\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 1.8 \cdot 10^{+216}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \mathsf{fma}\left(-\phi_2, \frac{R}{\phi_1}, R\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\lambda_2 \cdot R\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\\
\end{array}
\end{array}
if lambda2 < 2.40000000000000002e73Initial program 64.8%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6428.3
Applied rewrites28.3%
Taylor expanded in phi1 around 0
Applied rewrites30.7%
if 2.40000000000000002e73 < lambda2 < 1.8000000000000001e216Initial program 59.4%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6474.3
Applied rewrites74.3%
Taylor expanded in phi1 around -inf
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6429.9
Applied rewrites29.9%
Applied rewrites40.7%
if 1.8000000000000001e216 < lambda2 Initial program 56.7%
Taylor expanded in lambda2 around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6469.0
Applied rewrites69.0%
Taylor expanded in phi2 around 0
Applied rewrites72.0%
Final simplification35.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 2.4e+73)
(* (- phi2 phi1) R)
(if (<= lambda2 1.5e+211)
(* (- phi1) (fma (- phi2) (/ R phi1) R))
(* (* lambda2 R) (cos (* 0.5 phi2))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.4e+73) {
tmp = (phi2 - phi1) * R;
} else if (lambda2 <= 1.5e+211) {
tmp = -phi1 * fma(-phi2, (R / phi1), R);
} else {
tmp = (lambda2 * R) * cos((0.5 * phi2));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2.4e+73) tmp = Float64(Float64(phi2 - phi1) * R); elseif (lambda2 <= 1.5e+211) tmp = Float64(Float64(-phi1) * fma(Float64(-phi2), Float64(R / phi1), R)); else tmp = Float64(Float64(lambda2 * R) * cos(Float64(0.5 * phi2))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2.4e+73], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 1.5e+211], N[((-phi1) * N[((-phi2) * N[(R / phi1), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(N[(lambda2 * R), $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2.4 \cdot 10^{+73}:\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 1.5 \cdot 10^{+211}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \mathsf{fma}\left(-\phi_2, \frac{R}{\phi_1}, R\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\lambda_2 \cdot R\right) \cdot \cos \left(0.5 \cdot \phi_2\right)\\
\end{array}
\end{array}
if lambda2 < 2.40000000000000002e73Initial program 64.8%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6428.3
Applied rewrites28.3%
Taylor expanded in phi1 around 0
Applied rewrites30.7%
if 2.40000000000000002e73 < lambda2 < 1.5e211Initial program 59.4%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6474.3
Applied rewrites74.3%
Taylor expanded in phi1 around -inf
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6429.9
Applied rewrites29.9%
Applied rewrites40.7%
if 1.5e211 < lambda2 Initial program 56.7%
Taylor expanded in lambda2 around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6469.0
Applied rewrites69.0%
Taylor expanded in phi1 around 0
Applied rewrites62.6%
Final simplification34.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.25e+34) (* (- phi1) (fma (- phi2) (/ R phi1) R)) (* (fma R (/ (- phi1) phi2) R) phi2)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.25e+34) {
tmp = -phi1 * fma(-phi2, (R / phi1), R);
} else {
tmp = fma(R, (-phi1 / phi2), R) * phi2;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.25e+34) tmp = Float64(Float64(-phi1) * fma(Float64(-phi2), Float64(R / phi1), R)); else tmp = Float64(fma(R, Float64(Float64(-phi1) / phi2), R) * phi2); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.25e+34], N[((-phi1) * N[((-phi2) * N[(R / phi1), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(N[(R * N[((-phi1) / phi2), $MachinePrecision] + R), $MachinePrecision] * phi2), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.25 \cdot 10^{+34}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \mathsf{fma}\left(-\phi_2, \frac{R}{\phi_1}, R\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(R, \frac{-\phi_1}{\phi_2}, R\right) \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 1.25e34Initial program 65.7%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6468.7
Applied rewrites68.7%
Taylor expanded in phi1 around -inf
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6424.9
Applied rewrites24.9%
Applied rewrites27.4%
if 1.25e34 < phi2 Initial program 54.2%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6456.4
Applied rewrites56.4%
Final simplification32.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 7e+42) (* (fma R (/ phi2 phi1) (- R)) phi1) (* (- phi2 phi1) R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7e+42) {
tmp = fma(R, (phi2 / phi1), -R) * phi1;
} else {
tmp = (phi2 - phi1) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 7e+42) tmp = Float64(fma(R, Float64(phi2 / phi1), Float64(-R)) * phi1); else tmp = Float64(Float64(phi2 - phi1) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 7e+42], N[(N[(R * N[(phi2 / phi1), $MachinePrecision] + (-R)), $MachinePrecision] * phi1), $MachinePrecision], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 7 \cdot 10^{+42}:\\
\;\;\;\;\mathsf{fma}\left(R, \frac{\phi_2}{\phi_1}, -R\right) \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 7.00000000000000047e42Initial program 65.4%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6468.4
Applied rewrites68.4%
Taylor expanded in phi1 around -inf
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6424.8
Applied rewrites24.8%
Taylor expanded in phi1 around inf
Applied rewrites26.2%
if 7.00000000000000047e42 < phi2 Initial program 55.3%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6457.5
Applied rewrites57.5%
Taylor expanded in phi1 around 0
Applied rewrites57.6%
Final simplification32.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 8e+28) (* (- phi1) R) (* phi2 R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 8e+28) {
tmp = -phi1 * R;
} else {
tmp = phi2 * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 8d+28) then
tmp = -phi1 * r
else
tmp = phi2 * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 8e+28) {
tmp = -phi1 * R;
} else {
tmp = phi2 * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 8e+28: tmp = -phi1 * R else: tmp = phi2 * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 8e+28) tmp = Float64(Float64(-phi1) * R); else tmp = Float64(phi2 * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 8e+28)
tmp = -phi1 * R;
else
tmp = phi2 * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 8e+28], N[((-phi1) * R), $MachinePrecision], N[(phi2 * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 8 \cdot 10^{+28}:\\
\;\;\;\;\left(-\phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot R\\
\end{array}
\end{array}
if phi2 < 7.99999999999999967e28Initial program 65.4%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6424.1
Applied rewrites24.1%
if 7.99999999999999967e28 < phi2 Initial program 56.0%
Taylor expanded in phi2 around inf
lower-*.f6459.9
Applied rewrites59.9%
Final simplification31.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* (- phi2 phi1) R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return (phi2 - phi1) * R;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = (phi2 - phi1) * r
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return (phi2 - phi1) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return (phi2 - phi1) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(Float64(phi2 - phi1) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = (phi2 - phi1) * R;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\left(\phi_2 - \phi_1\right) \cdot R
\end{array}
Initial program 63.5%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6428.2
Applied rewrites28.2%
Taylor expanded in phi1 around 0
Applied rewrites30.2%
Final simplification30.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* phi2 R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return phi2 * R;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = phi2 * r
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return phi2 * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return phi2 * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(phi2 * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = phi2 * R;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(phi2 * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\phi_2 \cdot R
\end{array}
Initial program 63.5%
Taylor expanded in phi2 around inf
lower-*.f6415.8
Applied rewrites15.8%
Final simplification15.8%
herbie shell --seed 2024294
(FPCore (R lambda1 lambda2 phi1 phi2)
:name "Equirectangular approximation to distance on a great circle"
:precision binary64
(* R (sqrt (+ (* (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))) (* (- phi1 phi2) (- phi1 phi2))))))