
(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 13 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 (<= phi2 3.3e-22) (* (hypot phi1 (* (- lambda1 lambda2) (cos (* phi1 0.5)))) R) (* R (hypot phi2 (* (- lambda1 lambda2) (cos (* phi2 0.5)))))))
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 <= 3.3e-22) {
tmp = hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5)))) * R;
} else {
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
}
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 <= 3.3e-22) {
tmp = Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((phi1 * 0.5)))) * R;
} else {
tmp = R * Math.hypot(phi2, ((lambda1 - lambda2) * Math.cos((phi2 * 0.5))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 3.3e-22: tmp = math.hypot(phi1, ((lambda1 - lambda2) * math.cos((phi1 * 0.5)))) * R else: tmp = R * math.hypot(phi2, ((lambda1 - lambda2) * math.cos((phi2 * 0.5)))) 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 <= 3.3e-22) tmp = Float64(hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5)))) * R); else tmp = Float64(R * hypot(phi2, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))))); 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 <= 3.3e-22)
tmp = hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5)))) * R;
else
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
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, 3.3e-22], N[(N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.3 \cdot 10^{-22}:\\
\;\;\;\;\mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if phi2 < 3.3000000000000001e-22Initial program 59.8%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6475.5
Simplified75.5%
if 3.3000000000000001e-22 < phi2 Initial program 52.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6484.2
Simplified84.2%
Final simplification77.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 4.4e-14)
(* (hypot phi1 (* (- lambda1 lambda2) (cos (* phi1 0.5)))) R)
(if (<= phi2 2.8e+130)
(*
R
(sqrt
(fma
(- lambda1 lambda2)
(* (- lambda1 lambda2) (+ 0.5 (* 0.5 (cos (+ phi2 phi1)))))
(* (- phi1 phi2) (- phi1 phi2)))))
(* R (hypot phi2 (* lambda2 (cos (* phi2 0.5))))))))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 <= 4.4e-14) {
tmp = hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5)))) * R;
} else if (phi2 <= 2.8e+130) {
tmp = R * sqrt(fma((lambda1 - lambda2), ((lambda1 - lambda2) * (0.5 + (0.5 * cos((phi2 + phi1))))), ((phi1 - phi2) * (phi1 - phi2))));
} else {
tmp = R * hypot(phi2, (lambda2 * cos((phi2 * 0.5))));
}
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 <= 4.4e-14) tmp = Float64(hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5)))) * R); elseif (phi2 <= 2.8e+130) tmp = Float64(R * sqrt(fma(Float64(lambda1 - lambda2), Float64(Float64(lambda1 - lambda2) * Float64(0.5 + Float64(0.5 * cos(Float64(phi2 + phi1))))), Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))); else tmp = Float64(R * hypot(phi2, Float64(lambda2 * cos(Float64(phi2 * 0.5))))); 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, 4.4e-14], N[(N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi2, 2.8e+130], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(0.5 + N[(0.5 * N[Cos[N[(phi2 + phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda2 * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 4.4 \cdot 10^{-14}:\\
\;\;\;\;\mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\right) \cdot R\\
\mathbf{elif}\;\phi_2 \leq 2.8 \cdot 10^{+130}:\\
\;\;\;\;R \cdot \sqrt{\mathsf{fma}\left(\lambda_1 - \lambda_2, \left(\lambda_1 - \lambda_2\right) \cdot \left(0.5 + 0.5 \cdot \cos \left(\phi_2 + \phi_1\right)\right), \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_2 \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if phi2 < 4.4000000000000002e-14Initial program 59.8%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6475.5
Simplified75.5%
if 4.4000000000000002e-14 < phi2 < 2.7999999999999999e130Initial program 67.0%
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift--.f64N/A
Applied egg-rr67.0%
if 2.7999999999999999e130 < phi2 Initial program 41.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6492.6
Simplified92.6%
Taylor expanded in lambda1 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f6484.0
Simplified84.0%
Final simplification75.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
(if (<= phi1 -2.75e+45)
(* R (hypot phi1 (* lambda1 (cos (* phi1 0.5)))))
(if (<= phi1 -5.2e-16)
(*
R
(sqrt
(fma
(- lambda1 lambda2)
(* (- lambda1 lambda2) (+ 0.5 (* 0.5 (cos (+ phi2 phi1)))))
(* (- phi1 phi2) (- phi1 phi2)))))
(* R (hypot phi2 (- lambda1 lambda2))))))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.75e+45) {
tmp = R * hypot(phi1, (lambda1 * cos((phi1 * 0.5))));
} else if (phi1 <= -5.2e-16) {
tmp = R * sqrt(fma((lambda1 - lambda2), ((lambda1 - lambda2) * (0.5 + (0.5 * cos((phi2 + phi1))))), ((phi1 - phi2) * (phi1 - phi2))));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
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.75e+45) tmp = Float64(R * hypot(phi1, Float64(lambda1 * cos(Float64(phi1 * 0.5))))); elseif (phi1 <= -5.2e-16) tmp = Float64(R * sqrt(fma(Float64(lambda1 - lambda2), Float64(Float64(lambda1 - lambda2) * Float64(0.5 + Float64(0.5 * cos(Float64(phi2 + phi1))))), Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); 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.75e+45], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -5.2e-16], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(0.5 + N[(0.5 * N[Cos[N[(phi2 + phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $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.75 \cdot 10^{+45}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 \cdot \cos \left(\phi_1 \cdot 0.5\right)\right)\\
\mathbf{elif}\;\phi_1 \leq -5.2 \cdot 10^{-16}:\\
\;\;\;\;R \cdot \sqrt{\mathsf{fma}\left(\lambda_1 - \lambda_2, \left(\lambda_1 - \lambda_2\right) \cdot \left(0.5 + 0.5 \cdot \cos \left(\phi_2 + \phi_1\right)\right), \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -2.75e45Initial program 48.1%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6472.7
Simplified72.7%
Taylor expanded in lambda2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f6459.8
Simplified59.8%
if -2.75e45 < phi1 < -5.1999999999999997e-16Initial program 61.6%
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift--.f64N/A
Applied egg-rr61.6%
if -5.1999999999999997e-16 < phi1 Initial program 60.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6477.9
Simplified77.9%
Taylor expanded in phi2 around 0
lower--.f6466.1
Simplified66.1%
Final simplification64.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 (<= phi1 -1.75e+145)
(* R (- phi2 phi1))
(if (<= phi1 -5.2e-16)
(*
R
(sqrt
(fma
(- lambda1 lambda2)
(* (- lambda1 lambda2) (+ 0.5 (* 0.5 (cos (+ phi2 phi1)))))
(* (- phi1 phi2) (- phi1 phi2)))))
(* R (hypot phi2 (- lambda1 lambda2))))))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 <= -1.75e+145) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= -5.2e-16) {
tmp = R * sqrt(fma((lambda1 - lambda2), ((lambda1 - lambda2) * (0.5 + (0.5 * cos((phi2 + phi1))))), ((phi1 - phi2) * (phi1 - phi2))));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
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 <= -1.75e+145) tmp = Float64(R * Float64(phi2 - phi1)); elseif (phi1 <= -5.2e-16) tmp = Float64(R * sqrt(fma(Float64(lambda1 - lambda2), Float64(Float64(lambda1 - lambda2) * Float64(0.5 + Float64(0.5 * cos(Float64(phi2 + phi1))))), Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); 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, -1.75e+145], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -5.2e-16], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(0.5 + N[(0.5 * N[Cos[N[(phi2 + phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.75 \cdot 10^{+145}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -5.2 \cdot 10^{-16}:\\
\;\;\;\;R \cdot \sqrt{\mathsf{fma}\left(\lambda_1 - \lambda_2, \left(\lambda_1 - \lambda_2\right) \cdot \left(0.5 + 0.5 \cdot \cos \left(\phi_2 + \phi_1\right)\right), \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -1.7500000000000001e145Initial program 39.4%
Taylor expanded in phi2 around inf
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6459.0
Simplified59.0%
Taylor expanded in phi2 around 0
+-commutativeN/A
mul-1-negN/A
sub-negN/A
distribute-lft-out--N/A
lower-*.f64N/A
lower--.f6465.4
Simplified65.4%
if -1.7500000000000001e145 < phi1 < -5.1999999999999997e-16Initial program 61.1%
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift--.f64N/A
Applied egg-rr61.1%
if -5.1999999999999997e-16 < phi1 Initial program 60.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6477.9
Simplified77.9%
Taylor expanded in phi2 around 0
lower--.f6466.1
Simplified66.1%
Final simplification65.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 -1.75e+145)
(* R (- phi2 phi1))
(if (<= phi1 -10500000.0)
(*
R
(sqrt
(fma
(- lambda1 lambda2)
(* (- lambda1 lambda2) (fma 0.5 (cos phi1) 0.5))
(* phi1 phi1))))
(* R (hypot phi2 (- lambda1 lambda2))))))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 <= -1.75e+145) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= -10500000.0) {
tmp = R * sqrt(fma((lambda1 - lambda2), ((lambda1 - lambda2) * fma(0.5, cos(phi1), 0.5)), (phi1 * phi1)));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
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 <= -1.75e+145) tmp = Float64(R * Float64(phi2 - phi1)); elseif (phi1 <= -10500000.0) tmp = Float64(R * sqrt(fma(Float64(lambda1 - lambda2), Float64(Float64(lambda1 - lambda2) * fma(0.5, cos(phi1), 0.5)), Float64(phi1 * phi1)))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); 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, -1.75e+145], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -10500000.0], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(0.5 * N[Cos[phi1], $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.75 \cdot 10^{+145}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -10500000:\\
\;\;\;\;R \cdot \sqrt{\mathsf{fma}\left(\lambda_1 - \lambda_2, \left(\lambda_1 - \lambda_2\right) \cdot \mathsf{fma}\left(0.5, \cos \phi_1, 0.5\right), \phi_1 \cdot \phi_1\right)}\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -1.7500000000000001e145Initial program 39.4%
Taylor expanded in phi2 around inf
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6459.0
Simplified59.0%
Taylor expanded in phi2 around 0
+-commutativeN/A
mul-1-negN/A
sub-negN/A
distribute-lft-out--N/A
lower-*.f64N/A
lower--.f6465.4
Simplified65.4%
if -1.7500000000000001e145 < phi1 < -1.05e7Initial program 63.3%
Applied egg-rr63.1%
Taylor expanded in phi2 around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-*.f64N/A
lower--.f64N/A
lower--.f64N/A
unpow2N/A
lower-*.f6450.9
Simplified50.9%
lift-cos.f64N/A
lift-fma.f64N/A
lift--.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6450.9
Applied egg-rr50.9%
if -1.05e7 < phi1 Initial program 60.1%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6478.3
Simplified78.3%
Taylor expanded in phi2 around 0
lower--.f6467.0
Simplified67.0%
Final simplification64.9%
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 -1.75e+145)
(* R (- phi2 phi1))
(if (<= phi1 -10500000.0)
(*
R
(sqrt
(fma
(fma 0.5 (cos phi1) 0.5)
(* (- lambda1 lambda2) (- lambda1 lambda2))
(* phi1 phi1))))
(* R (hypot phi2 (- lambda1 lambda2))))))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 <= -1.75e+145) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= -10500000.0) {
tmp = R * sqrt(fma(fma(0.5, cos(phi1), 0.5), ((lambda1 - lambda2) * (lambda1 - lambda2)), (phi1 * phi1)));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
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 <= -1.75e+145) tmp = Float64(R * Float64(phi2 - phi1)); elseif (phi1 <= -10500000.0) tmp = Float64(R * sqrt(fma(fma(0.5, cos(phi1), 0.5), Float64(Float64(lambda1 - lambda2) * Float64(lambda1 - lambda2)), Float64(phi1 * phi1)))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); 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, -1.75e+145], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -10500000.0], N[(R * N[Sqrt[N[(N[(0.5 * N[Cos[phi1], $MachinePrecision] + 0.5), $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] + N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.75 \cdot 10^{+145}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -10500000:\\
\;\;\;\;R \cdot \sqrt{\mathsf{fma}\left(\mathsf{fma}\left(0.5, \cos \phi_1, 0.5\right), \left(\lambda_1 - \lambda_2\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \phi_1\right)}\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -1.7500000000000001e145Initial program 39.4%
Taylor expanded in phi2 around inf
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6459.0
Simplified59.0%
Taylor expanded in phi2 around 0
+-commutativeN/A
mul-1-negN/A
sub-negN/A
distribute-lft-out--N/A
lower-*.f64N/A
lower--.f6465.4
Simplified65.4%
if -1.7500000000000001e145 < phi1 < -1.05e7Initial program 63.3%
Applied egg-rr63.1%
Taylor expanded in phi2 around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-*.f64N/A
lower--.f64N/A
lower--.f64N/A
unpow2N/A
lower-*.f6450.9
Simplified50.9%
if -1.05e7 < phi1 Initial program 60.1%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6478.3
Simplified78.3%
Taylor expanded in phi2 around 0
lower--.f6467.0
Simplified67.0%
Final simplification64.9%
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.8e+32) (* phi2 (fma (* R (- phi1)) (/ 1.0 phi2) R)) (* R (hypot phi2 (- lambda1 lambda2)))))
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.8e+32) {
tmp = phi2 * fma((R * -phi1), (1.0 / phi2), R);
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
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.8e+32) tmp = Float64(phi2 * fma(Float64(R * Float64(-phi1)), Float64(1.0 / phi2), R)); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); 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.8e+32], N[(phi2 * N[(N[(R * (-phi1)), $MachinePrecision] * N[(1.0 / phi2), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $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.8 \cdot 10^{+32}:\\
\;\;\;\;\phi_2 \cdot \mathsf{fma}\left(R \cdot \left(-\phi_1\right), \frac{1}{\phi_2}, R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -2.8e32Initial program 51.0%
Taylor expanded in phi2 around inf
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6454.0
Simplified54.0%
lift-/.f64N/A
lift-*.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lift-/.f64N/A
div-invN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f6459.0
Applied egg-rr59.0%
if -2.8e32 < phi1 Initial program 60.0%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6477.2
Simplified77.2%
Taylor expanded in phi2 around 0
lower--.f6466.3
Simplified66.3%
Final simplification64.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 (if (<= (- lambda1 lambda2) -2.5e+152) (* (- lambda1) (fma R (/ lambda2 (- lambda1)) R)) (* R (- phi2 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 ((lambda1 - lambda2) <= -2.5e+152) {
tmp = -lambda1 * fma(R, (lambda2 / -lambda1), R);
} else {
tmp = R * (phi2 - 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 (Float64(lambda1 - lambda2) <= -2.5e+152) tmp = Float64(Float64(-lambda1) * fma(R, Float64(lambda2 / Float64(-lambda1)), R)); else tmp = Float64(R * Float64(phi2 - 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[N[(lambda1 - lambda2), $MachinePrecision], -2.5e+152], N[((-lambda1) * N[(R * N[(lambda2 / (-lambda1)), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $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.5 \cdot 10^{+152}:\\
\;\;\;\;\left(-\lambda_1\right) \cdot \mathsf{fma}\left(R, \frac{\lambda_2}{-\lambda_1}, R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if (-.f64 lambda1 lambda2) < -2.5e152Initial program 44.3%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6483.7
Simplified83.7%
Taylor expanded in phi2 around 0
lower--.f6464.7
Simplified64.7%
Taylor expanded in lambda1 around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.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
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6456.3
Simplified56.3%
if -2.5e152 < (-.f64 lambda1 lambda2) Initial program 62.4%
Taylor expanded in phi2 around inf
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6427.6
Simplified27.6%
Taylor expanded in phi2 around 0
+-commutativeN/A
mul-1-negN/A
sub-negN/A
distribute-lft-out--N/A
lower-*.f64N/A
lower--.f6428.1
Simplified28.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) -4e+194) (* R (* lambda2 (- 1.0 (/ lambda1 lambda2)))) (* R (- phi2 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 ((lambda1 - lambda2) <= -4e+194) {
tmp = R * (lambda2 * (1.0 - (lambda1 / lambda2)));
} else {
tmp = R * (phi2 - phi1);
}
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 ((lambda1 - lambda2) <= (-4d+194)) then
tmp = r * (lambda2 * (1.0d0 - (lambda1 / lambda2)))
else
tmp = r * (phi2 - phi1)
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 ((lambda1 - lambda2) <= -4e+194) {
tmp = R * (lambda2 * (1.0 - (lambda1 / lambda2)));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if (lambda1 - lambda2) <= -4e+194: tmp = R * (lambda2 * (1.0 - (lambda1 / lambda2))) else: tmp = R * (phi2 - 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 (Float64(lambda1 - lambda2) <= -4e+194) tmp = Float64(R * Float64(lambda2 * Float64(1.0 - Float64(lambda1 / lambda2)))); else tmp = Float64(R * Float64(phi2 - phi1)); 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 ((lambda1 - lambda2) <= -4e+194)
tmp = R * (lambda2 * (1.0 - (lambda1 / lambda2)));
else
tmp = R * (phi2 - phi1);
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[N[(lambda1 - lambda2), $MachinePrecision], -4e+194], N[(R * N[(lambda2 * N[(1.0 - N[(lambda1 / lambda2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $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 -4 \cdot 10^{+194}:\\
\;\;\;\;R \cdot \left(\lambda_2 \cdot \left(1 - \frac{\lambda_1}{\lambda_2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if (-.f64 lambda1 lambda2) < -3.99999999999999978e194Initial program 46.4%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6484.5
Simplified84.5%
Taylor expanded in phi2 around 0
lower--.f6466.9
Simplified66.9%
Taylor expanded in lambda2 around inf
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6460.3
Simplified60.3%
if -3.99999999999999978e194 < (-.f64 lambda1 lambda2) Initial program 61.1%
Taylor expanded in phi2 around inf
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6427.6
Simplified27.6%
Taylor expanded in phi2 around 0
+-commutativeN/A
mul-1-negN/A
sub-negN/A
distribute-lft-out--N/A
lower-*.f64N/A
lower--.f6427.6
Simplified27.6%
Final simplification34.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 (<= phi2 -1.6e-282) (* R (- phi1)) (if (<= phi2 1.18e-5) (* lambda2 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 <= -1.6e-282) {
tmp = R * -phi1;
} else if (phi2 <= 1.18e-5) {
tmp = lambda2 * 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 <= (-1.6d-282)) then
tmp = r * -phi1
else if (phi2 <= 1.18d-5) then
tmp = lambda2 * 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 <= -1.6e-282) {
tmp = R * -phi1;
} else if (phi2 <= 1.18e-5) {
tmp = lambda2 * 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 <= -1.6e-282: tmp = R * -phi1 elif phi2 <= 1.18e-5: tmp = lambda2 * 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 <= -1.6e-282) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 1.18e-5) tmp = Float64(lambda2 * 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 <= -1.6e-282)
tmp = R * -phi1;
elseif (phi2 <= 1.18e-5)
tmp = lambda2 * 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, -1.6e-282], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 1.18e-5], N[(lambda2 * 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 -1.6 \cdot 10^{-282}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 1.18 \cdot 10^{-5}:\\
\;\;\;\;\lambda_2 \cdot R\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot R\\
\end{array}
\end{array}
if phi2 < -1.59999999999999991e-282Initial program 53.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
lower-neg.f6415.2
Simplified15.2%
if -1.59999999999999991e-282 < phi2 < 1.18000000000000005e-5Initial program 71.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6462.8
Simplified62.8%
Taylor expanded in phi2 around 0
lower--.f6462.8
Simplified62.8%
Taylor expanded in lambda2 around inf
lower-*.f6425.7
Simplified25.7%
if 1.18000000000000005e-5 < phi2 Initial program 52.5%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f6458.7
Simplified58.7%
Final simplification28.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 -9e+154) (- (* lambda1 R)) (* R (- phi2 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 (lambda1 <= -9e+154) {
tmp = -(lambda1 * R);
} else {
tmp = R * (phi2 - phi1);
}
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 (lambda1 <= (-9d+154)) then
tmp = -(lambda1 * r)
else
tmp = r * (phi2 - phi1)
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 (lambda1 <= -9e+154) {
tmp = -(lambda1 * R);
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -9e+154: tmp = -(lambda1 * R) else: tmp = R * (phi2 - 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 (lambda1 <= -9e+154) tmp = Float64(-Float64(lambda1 * R)); else tmp = Float64(R * Float64(phi2 - phi1)); 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 (lambda1 <= -9e+154)
tmp = -(lambda1 * R);
else
tmp = R * (phi2 - phi1);
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[lambda1, -9e+154], (-N[(lambda1 * R), $MachinePrecision]), N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -9 \cdot 10^{+154}:\\
\;\;\;\;-\lambda_1 \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -9.00000000000000018e154Initial program 56.8%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6489.4
Simplified89.4%
Taylor expanded in phi2 around 0
lower--.f6473.0
Simplified73.0%
Taylor expanded in lambda1 around -inf
mul-1-negN/A
lower-neg.f6467.3
Simplified67.3%
if -9.00000000000000018e154 < lambda1 Initial program 58.3%
Taylor expanded in phi2 around inf
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6427.1
Simplified27.1%
Taylor expanded in phi2 around 0
+-commutativeN/A
mul-1-negN/A
sub-negN/A
distribute-lft-out--N/A
lower-*.f64N/A
lower--.f6426.2
Simplified26.2%
Final simplification31.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.18e-5) (* lambda2 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 <= 1.18e-5) {
tmp = lambda2 * 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 <= 1.18d-5) then
tmp = lambda2 * 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 <= 1.18e-5) {
tmp = lambda2 * 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 <= 1.18e-5: tmp = lambda2 * 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 <= 1.18e-5) tmp = Float64(lambda2 * 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 <= 1.18e-5)
tmp = lambda2 * 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, 1.18e-5], N[(lambda2 * 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 1.18 \cdot 10^{-5}:\\
\;\;\;\;\lambda_2 \cdot R\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot R\\
\end{array}
\end{array}
if phi2 < 1.18000000000000005e-5Initial program 59.8%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6467.6
Simplified67.6%
Taylor expanded in phi2 around 0
lower--.f6462.1
Simplified62.1%
Taylor expanded in lambda2 around inf
lower-*.f6414.2
Simplified14.2%
if 1.18000000000000005e-5 < phi2 Initial program 52.5%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f6458.7
Simplified58.7%
Final simplification24.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 (* lambda2 R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return lambda2 * 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 = lambda2 * 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 lambda2 * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return lambda2 * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(lambda2 * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = lambda2 * 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[(lambda2 * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\lambda_2 \cdot R
\end{array}
Initial program 58.1%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6471.5
Simplified71.5%
Taylor expanded in phi2 around 0
lower--.f6462.9
Simplified62.9%
Taylor expanded in lambda2 around inf
lower-*.f6413.5
Simplified13.5%
Final simplification13.5%
herbie shell --seed 2024208
(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))))))