
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
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 = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 20 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
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 = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\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
(*
R
(acos
(fma
(sin phi2)
(sin phi1)
(*
(cos phi1)
(*
(cos phi2)
(fma (sin lambda2) (sin lambda1) (* (cos lambda1) (cos lambda2)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(fma(sin(phi2), sin(phi1), (cos(phi1) * (cos(phi2) * fma(sin(lambda2), sin(lambda1), (cos(lambda1) * cos(lambda2)))))));
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * Float64(cos(phi2) * fma(sin(lambda2), sin(lambda1), Float64(cos(lambda1) * cos(lambda2)))))))) 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[(R * N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \mathsf{fma}\left(\sin \lambda_2, \sin \lambda_1, \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\right)\right)
\end{array}
Initial program 76.0%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6494.3
Applied rewrites94.3%
Taylor expanded in lambda1 around inf
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6494.3
Applied rewrites94.3%
Taylor expanded in lambda1 around inf
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites94.3%
Final simplification94.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
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= phi1 -0.00035)
(* (acos (+ (* t_1 (cos (- lambda1 lambda2))) (/ 1.0 (/ 1.0 t_0)))) R)
(if (<= phi1 5.8e-9)
(*
(acos
(fma
(sin phi2)
(sin phi1)
(*
(cos phi2)
(fma (sin lambda2) (sin lambda1) (* (cos lambda1) (cos lambda2))))))
R)
(* (acos (+ (/ (cos (- lambda2 lambda1)) (/ 1.0 t_1)) t_0)) 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 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (phi1 <= -0.00035) {
tmp = acos(((t_1 * cos((lambda1 - lambda2))) + (1.0 / (1.0 / t_0)))) * R;
} else if (phi1 <= 5.8e-9) {
tmp = acos(fma(sin(phi2), sin(phi1), (cos(phi2) * fma(sin(lambda2), sin(lambda1), (cos(lambda1) * cos(lambda2)))))) * R;
} else {
tmp = acos(((cos((lambda2 - lambda1)) / (1.0 / t_1)) + t_0)) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi1 <= -0.00035) tmp = Float64(acos(Float64(Float64(t_1 * cos(Float64(lambda1 - lambda2))) + Float64(1.0 / Float64(1.0 / t_0)))) * R); elseif (phi1 <= 5.8e-9) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(cos(phi2) * fma(sin(lambda2), sin(lambda1), Float64(cos(lambda1) * cos(lambda2)))))) * R); else tmp = Float64(acos(Float64(Float64(cos(Float64(lambda2 - lambda1)) / Float64(1.0 / t_1)) + t_0)) * 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[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.00035], N[(N[ArcCos[N[(N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi1, 5.8e-9], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] / N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.00035:\\
\;\;\;\;\cos^{-1} \left(t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \frac{1}{\frac{1}{t\_0}}\right) \cdot R\\
\mathbf{elif}\;\phi_1 \leq 5.8 \cdot 10^{-9}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_2 \cdot \mathsf{fma}\left(\sin \lambda_2, \sin \lambda_1, \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\frac{\cos \left(\lambda_2 - \lambda_1\right)}{\frac{1}{t\_1}} + t\_0\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -3.49999999999999996e-4Initial program 86.5%
lift-*.f64N/A
lift-sin.f64N/A
lift-sin.f64N/A
sin-multN/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
sin-multN/A
lift-sin.f64N/A
lift-sin.f64N/A
lift-*.f64N/A
lower-/.f6486.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.6
Applied rewrites86.6%
if -3.49999999999999996e-4 < phi1 < 5.79999999999999982e-9Initial program 69.5%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6489.3
Applied rewrites89.3%
Taylor expanded in lambda1 around inf
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6489.3
Applied rewrites89.3%
Taylor expanded in lambda1 around inf
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites89.3%
Taylor expanded in phi1 around 0
Applied rewrites89.0%
if 5.79999999999999982e-9 < phi1 Initial program 78.1%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-cos.f64N/A
lift-cos.f64N/A
cos-multN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
*-commutativeN/A
*-commutativeN/A
cos-diffN/A
lower-cos.f64N/A
lower--.f64N/A
clear-numN/A
cos-multN/A
lift-cos.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
Applied rewrites78.1%
Final simplification85.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 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= phi1 -0.00035)
(* (acos (+ (* t_1 (cos (- lambda1 lambda2))) (/ 1.0 (/ 1.0 t_0)))) R)
(if (<= phi1 3.1e-28)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R)
(* (acos (+ (/ (cos (- lambda2 lambda1)) (/ 1.0 t_1)) t_0)) 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 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (phi1 <= -0.00035) {
tmp = acos(((t_1 * cos((lambda1 - lambda2))) + (1.0 / (1.0 / t_0)))) * R;
} else if (phi1 <= 3.1e-28) {
tmp = acos((fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi2))) * R;
} else {
tmp = acos(((cos((lambda2 - lambda1)) / (1.0 / t_1)) + t_0)) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi1 <= -0.00035) tmp = Float64(acos(Float64(Float64(t_1 * cos(Float64(lambda1 - lambda2))) + Float64(1.0 / Float64(1.0 / t_0)))) * R); elseif (phi1 <= 3.1e-28) tmp = Float64(acos(Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi2))) * R); else tmp = Float64(acos(Float64(Float64(cos(Float64(lambda2 - lambda1)) / Float64(1.0 / t_1)) + t_0)) * 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[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.00035], N[(N[ArcCos[N[(N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi1, 3.1e-28], N[(N[ArcCos[N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] / N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.00035:\\
\;\;\;\;\cos^{-1} \left(t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \frac{1}{\frac{1}{t\_0}}\right) \cdot R\\
\mathbf{elif}\;\phi_1 \leq 3.1 \cdot 10^{-28}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\frac{\cos \left(\lambda_2 - \lambda_1\right)}{\frac{1}{t\_1}} + t\_0\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -3.49999999999999996e-4Initial program 86.5%
lift-*.f64N/A
lift-sin.f64N/A
lift-sin.f64N/A
sin-multN/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
sin-multN/A
lift-sin.f64N/A
lift-sin.f64N/A
lift-*.f64N/A
lower-/.f6486.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.6
Applied rewrites86.6%
if -3.49999999999999996e-4 < phi1 < 3.09999999999999992e-28Initial program 69.3%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6489.2
Applied rewrites89.2%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6488.5
Applied rewrites88.5%
if 3.09999999999999992e-28 < phi1 Initial program 78.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-cos.f64N/A
lift-cos.f64N/A
cos-multN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
*-commutativeN/A
*-commutativeN/A
cos-diffN/A
lower-cos.f64N/A
lower--.f64N/A
clear-numN/A
cos-multN/A
lift-cos.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
Applied rewrites78.4%
Final simplification85.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
(let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi1 -0.00035)
(* (acos (+ t_1 (* t_0 (cos (- lambda1 lambda2))))) R)
(if (<= phi1 3.1e-28)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R)
(* (acos (+ (/ (cos (- lambda2 lambda1)) (/ 1.0 t_0)) t_1)) 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 = cos(phi1) * cos(phi2);
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi1 <= -0.00035) {
tmp = acos((t_1 + (t_0 * cos((lambda1 - lambda2))))) * R;
} else if (phi1 <= 3.1e-28) {
tmp = acos((fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi2))) * R;
} else {
tmp = acos(((cos((lambda2 - lambda1)) / (1.0 / t_0)) + t_1)) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi1 <= -0.00035) tmp = Float64(acos(Float64(t_1 + Float64(t_0 * cos(Float64(lambda1 - lambda2))))) * R); elseif (phi1 <= 3.1e-28) tmp = Float64(acos(Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi2))) * R); else tmp = Float64(acos(Float64(Float64(cos(Float64(lambda2 - lambda1)) / Float64(1.0 / t_0)) + t_1)) * 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[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.00035], N[(N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi1, 3.1e-28], N[(N[ArcCos[N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] / N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.00035:\\
\;\;\;\;\cos^{-1} \left(t\_1 + t\_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\mathbf{elif}\;\phi_1 \leq 3.1 \cdot 10^{-28}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\frac{\cos \left(\lambda_2 - \lambda_1\right)}{\frac{1}{t\_0}} + t\_1\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -3.49999999999999996e-4Initial program 86.5%
if -3.49999999999999996e-4 < phi1 < 3.09999999999999992e-28Initial program 69.3%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6489.2
Applied rewrites89.2%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6488.5
Applied rewrites88.5%
if 3.09999999999999992e-28 < phi1 Initial program 78.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-cos.f64N/A
lift-cos.f64N/A
cos-multN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
*-commutativeN/A
*-commutativeN/A
cos-diffN/A
lower-cos.f64N/A
lower--.f64N/A
clear-numN/A
cos-multN/A
lift-cos.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
Applied rewrites78.4%
Final simplification85.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
(let* ((t_0 (* (cos lambda1) (cos lambda2))))
(if (<= lambda2 -1.85e-7)
(* (acos (* (fma (sin lambda1) (sin lambda2) t_0) (cos phi2))) R)
(if (<= lambda2 2.2e-16)
(*
(acos
(fma
(* (cos phi1) (cos phi2))
(cos lambda1)
(* (sin phi1) (sin phi2))))
R)
(if (<= lambda2 7.5e+249)
(*
(acos
(fma
(sin phi2)
(sin phi1)
(* (* (cos phi2) (cos lambda2)) (cos phi1))))
R)
(*
(acos (* (+ (* (sin lambda1) (sin lambda2)) t_0) (cos 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 = cos(lambda1) * cos(lambda2);
double tmp;
if (lambda2 <= -1.85e-7) {
tmp = acos((fma(sin(lambda1), sin(lambda2), t_0) * cos(phi2))) * R;
} else if (lambda2 <= 2.2e-16) {
tmp = acos(fma((cos(phi1) * cos(phi2)), cos(lambda1), (sin(phi1) * sin(phi2)))) * R;
} else if (lambda2 <= 7.5e+249) {
tmp = acos(fma(sin(phi2), sin(phi1), ((cos(phi2) * cos(lambda2)) * cos(phi1)))) * R;
} else {
tmp = acos((((sin(lambda1) * sin(lambda2)) + t_0) * cos(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(cos(lambda1) * cos(lambda2)) tmp = 0.0 if (lambda2 <= -1.85e-7) tmp = Float64(acos(Float64(fma(sin(lambda1), sin(lambda2), t_0) * cos(phi2))) * R); elseif (lambda2 <= 2.2e-16) tmp = Float64(acos(fma(Float64(cos(phi1) * cos(phi2)), cos(lambda1), Float64(sin(phi1) * sin(phi2)))) * R); elseif (lambda2 <= 7.5e+249) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(phi2) * cos(lambda2)) * cos(phi1)))) * R); else tmp = Float64(acos(Float64(Float64(Float64(sin(lambda1) * sin(lambda2)) + t_0) * cos(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[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, -1.85e-7], N[(N[ArcCos[N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + t$95$0), $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 2.2e-16], N[(N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 7.5e+249], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \lambda_1 \cdot \cos \lambda_2\\
\mathbf{if}\;\lambda_2 \leq -1.85 \cdot 10^{-7}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, t\_0\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 2.2 \cdot 10^{-16}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \lambda_1, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 7.5 \cdot 10^{+249}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \phi_2 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\left(\sin \lambda_1 \cdot \sin \lambda_2 + t\_0\right) \cdot \cos \phi_1\right) \cdot R\\
\end{array}
\end{array}
if lambda2 < -1.85000000000000002e-7Initial program 64.4%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6499.3
Applied rewrites99.3%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6460.1
Applied rewrites60.1%
if -1.85000000000000002e-7 < lambda2 < 2.2e-16Initial program 88.9%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6488.9
Applied rewrites88.9%
if 2.2e-16 < lambda2 < 7.49999999999999941e249Initial program 65.1%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6464.4
Applied rewrites64.4%
if 7.49999999999999941e249 < lambda2 Initial program 50.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6444.5
Applied rewrites44.5%
Applied rewrites70.7%
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 (<= lambda2 -1.85e-7)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R)
(if (<= lambda2 2.2e-16)
(*
(acos
(fma (* (cos phi1) (cos phi2)) (cos lambda1) (* (sin phi1) (sin phi2))))
R)
(if (<= lambda2 7.5e+249)
(*
(acos
(fma
(sin phi2)
(sin phi1)
(* (* (cos phi2) (cos lambda2)) (cos phi1))))
R)
(*
(acos
(*
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2)))
(cos 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 (lambda2 <= -1.85e-7) {
tmp = acos((fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi2))) * R;
} else if (lambda2 <= 2.2e-16) {
tmp = acos(fma((cos(phi1) * cos(phi2)), cos(lambda1), (sin(phi1) * sin(phi2)))) * R;
} else if (lambda2 <= 7.5e+249) {
tmp = acos(fma(sin(phi2), sin(phi1), ((cos(phi2) * cos(lambda2)) * cos(phi1)))) * R;
} else {
tmp = acos((fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))) * cos(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 (lambda2 <= -1.85e-7) tmp = Float64(acos(Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi2))) * R); elseif (lambda2 <= 2.2e-16) tmp = Float64(acos(fma(Float64(cos(phi1) * cos(phi2)), cos(lambda1), Float64(sin(phi1) * sin(phi2)))) * R); elseif (lambda2 <= 7.5e+249) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(phi2) * cos(lambda2)) * cos(phi1)))) * R); else tmp = Float64(acos(Float64(fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))) * cos(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[lambda2, -1.85e-7], N[(N[ArcCos[N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 2.2e-16], N[(N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 7.5e+249], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -1.85 \cdot 10^{-7}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 2.2 \cdot 10^{-16}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \lambda_1, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 7.5 \cdot 10^{+249}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \phi_2 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\end{array}
\end{array}
if lambda2 < -1.85000000000000002e-7Initial program 64.4%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6499.3
Applied rewrites99.3%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6460.1
Applied rewrites60.1%
if -1.85000000000000002e-7 < lambda2 < 2.2e-16Initial program 88.9%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6488.9
Applied rewrites88.9%
if 2.2e-16 < lambda2 < 7.49999999999999941e249Initial program 65.1%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6464.4
Applied rewrites64.4%
if 7.49999999999999941e249 < lambda2 Initial program 50.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6444.5
Applied rewrites44.5%
Applied rewrites70.5%
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
(let* ((t_0
(*
(acos
(*
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2)))
(cos phi1)))
R)))
(if (<= lambda2 -1.75e-11)
t_0
(if (<= lambda2 2.2e-16)
(*
(acos
(fma
(* (cos phi1) (cos phi2))
(cos lambda1)
(* (sin phi1) (sin phi2))))
R)
(if (<= lambda2 7.5e+249)
(*
(acos
(fma
(sin phi2)
(sin phi1)
(* (* (cos phi2) (cos lambda2)) (cos phi1))))
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 = acos((fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))) * cos(phi1))) * R;
double tmp;
if (lambda2 <= -1.75e-11) {
tmp = t_0;
} else if (lambda2 <= 2.2e-16) {
tmp = acos(fma((cos(phi1) * cos(phi2)), cos(lambda1), (sin(phi1) * sin(phi2)))) * R;
} else if (lambda2 <= 7.5e+249) {
tmp = acos(fma(sin(phi2), sin(phi1), ((cos(phi2) * cos(lambda2)) * cos(phi1)))) * R;
} else {
tmp = t_0;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(acos(Float64(fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))) * cos(phi1))) * R) tmp = 0.0 if (lambda2 <= -1.75e-11) tmp = t_0; elseif (lambda2 <= 2.2e-16) tmp = Float64(acos(fma(Float64(cos(phi1) * cos(phi2)), cos(lambda1), Float64(sin(phi1) * sin(phi2)))) * R); elseif (lambda2 <= 7.5e+249) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(phi2) * cos(lambda2)) * cos(phi1)))) * R); else tmp = 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[(N[ArcCos[N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]}, If[LessEqual[lambda2, -1.75e-11], t$95$0, If[LessEqual[lambda2, 2.2e-16], N[(N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 7.5e+249], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos^{-1} \left(\mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{if}\;\lambda_2 \leq -1.75 \cdot 10^{-11}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\lambda_2 \leq 2.2 \cdot 10^{-16}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \lambda_1, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 7.5 \cdot 10^{+249}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \phi_2 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if lambda2 < -1.7500000000000001e-11 or 7.49999999999999941e249 < lambda2 Initial program 62.8%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6438.3
Applied rewrites38.3%
Applied rewrites59.4%
if -1.7500000000000001e-11 < lambda2 < 2.2e-16Initial program 88.9%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6488.9
Applied rewrites88.9%
if 2.2e-16 < lambda2 < 7.49999999999999941e249Initial program 65.1%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6464.4
Applied rewrites64.4%
Final simplification74.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
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= phi1 -0.00035)
(*
(acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R)
(if (<= phi1 3.1e-28)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R)
(*
(acos (fma (* (cos (- lambda2 lambda1)) (cos phi2)) (cos phi1) t_0))
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 = sin(phi1) * sin(phi2);
double tmp;
if (phi1 <= -0.00035) {
tmp = acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
} else if (phi1 <= 3.1e-28) {
tmp = acos((fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi2))) * R;
} else {
tmp = acos(fma((cos((lambda2 - lambda1)) * cos(phi2)), cos(phi1), t_0)) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi1 <= -0.00035) tmp = Float64(acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R); elseif (phi1 <= 3.1e-28) tmp = Float64(acos(Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi2))) * R); else tmp = Float64(acos(fma(Float64(cos(Float64(lambda2 - lambda1)) * cos(phi2)), cos(phi1), t_0)) * 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[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.00035], N[(N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi1, 3.1e-28], N[(N[ArcCos[N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.00035:\\
\;\;\;\;\cos^{-1} \left(t\_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\mathbf{elif}\;\phi_1 \leq 3.1 \cdot 10^{-28}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_2, \cos \phi_1, t\_0\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -3.49999999999999996e-4Initial program 86.5%
if -3.49999999999999996e-4 < phi1 < 3.09999999999999992e-28Initial program 69.3%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6489.2
Applied rewrites89.2%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6488.5
Applied rewrites88.5%
if 3.09999999999999992e-28 < phi1 Initial program 78.4%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6478.4
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
*-commutativeN/A
*-commutativeN/A
cos-diffN/A
lower-cos.f64N/A
lower--.f6478.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6478.4
Applied rewrites78.4%
Final simplification85.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
(let* ((t_0
(*
(acos
(fma
(* (cos (- lambda2 lambda1)) (cos phi2))
(cos phi1)
(* (sin phi1) (sin phi2))))
R)))
(if (<= phi1 -0.00035)
t_0
(if (<= phi1 3.1e-28)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
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 = acos(fma((cos((lambda2 - lambda1)) * cos(phi2)), cos(phi1), (sin(phi1) * sin(phi2)))) * R;
double tmp;
if (phi1 <= -0.00035) {
tmp = t_0;
} else if (phi1 <= 3.1e-28) {
tmp = acos((fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi2))) * R;
} else {
tmp = t_0;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(acos(fma(Float64(cos(Float64(lambda2 - lambda1)) * cos(phi2)), cos(phi1), Float64(sin(phi1) * sin(phi2)))) * R) tmp = 0.0 if (phi1 <= -0.00035) tmp = t_0; elseif (phi1 <= 3.1e-28) tmp = Float64(acos(Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi2))) * R); else tmp = 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[(N[ArcCos[N[(N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]}, If[LessEqual[phi1, -0.00035], t$95$0, If[LessEqual[phi1, 3.1e-28], N[(N[ArcCos[N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], t$95$0]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_2, \cos \phi_1, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R\\
\mathbf{if}\;\phi_1 \leq -0.00035:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_1 \leq 3.1 \cdot 10^{-28}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi1 < -3.49999999999999996e-4 or 3.09999999999999992e-28 < phi1 Initial program 82.5%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6482.5
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
*-commutativeN/A
*-commutativeN/A
cos-diffN/A
lower-cos.f64N/A
lower--.f6482.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6482.5
Applied rewrites82.5%
if -3.49999999999999996e-4 < phi1 < 3.09999999999999992e-28Initial program 69.3%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6489.2
Applied rewrites89.2%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6488.5
Applied rewrites88.5%
Final simplification85.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
(let* ((t_0
(*
(acos
(fma
(sin phi2)
(sin phi1)
(* (* (cos phi2) (cos lambda2)) (cos phi1))))
R)))
(if (<= phi2 -9e-6)
t_0
(if (<= phi2 0.00043)
(*
(acos
(*
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2)))
(cos phi1)))
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 = acos(fma(sin(phi2), sin(phi1), ((cos(phi2) * cos(lambda2)) * cos(phi1)))) * R;
double tmp;
if (phi2 <= -9e-6) {
tmp = t_0;
} else if (phi2 <= 0.00043) {
tmp = acos((fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))) * cos(phi1))) * R;
} else {
tmp = t_0;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(phi2) * cos(lambda2)) * cos(phi1)))) * R) tmp = 0.0 if (phi2 <= -9e-6) tmp = t_0; elseif (phi2 <= 0.00043) tmp = Float64(acos(Float64(fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))) * cos(phi1))) * R); else tmp = 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[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]}, If[LessEqual[phi2, -9e-6], t$95$0, If[LessEqual[phi2, 0.00043], N[(N[ArcCos[N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], t$95$0]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \phi_2 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right)\right) \cdot R\\
\mathbf{if}\;\phi_2 \leq -9 \cdot 10^{-6}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 0.00043:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi2 < -9.00000000000000023e-6 or 4.29999999999999989e-4 < phi2 Initial program 82.5%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6462.7
Applied rewrites62.7%
if -9.00000000000000023e-6 < phi2 < 4.29999999999999989e-4Initial program 69.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6468.7
Applied rewrites68.7%
Applied rewrites88.4%
Final simplification75.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 -0.00175)
(* (acos (fma (sin phi2) (sin phi1) (* (cos phi1) (cos phi2)))) R)
(if (<= phi2 0.0034)
(*
(acos
(*
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2)))
(cos phi1)))
R)
(* (acos (* (cos (- lambda1 lambda2)) (cos 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 <= -0.00175) {
tmp = acos(fma(sin(phi2), sin(phi1), (cos(phi1) * cos(phi2)))) * R;
} else if (phi2 <= 0.0034) {
tmp = acos((fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))) * cos(phi1))) * R;
} else {
tmp = acos((cos((lambda1 - lambda2)) * cos(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 <= -0.00175) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * cos(phi2)))) * R); elseif (phi2 <= 0.0034) tmp = Float64(acos(Float64(fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))) * cos(phi1))) * R); else tmp = Float64(acos(Float64(cos(Float64(lambda1 - lambda2)) * cos(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[phi2, -0.00175], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi2, 0.0034], N[(N[ArcCos[N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $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 -0.00175:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot \cos \phi_2\right)\right) \cdot R\\
\mathbf{elif}\;\phi_2 \leq 0.0034:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < -0.00175000000000000004Initial program 79.9%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6460.7
Applied rewrites60.7%
Taylor expanded in lambda2 around 0
Applied rewrites34.9%
if -0.00175000000000000004 < phi2 < 0.00339999999999999981Initial program 69.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6468.7
Applied rewrites68.7%
Applied rewrites88.4%
if 0.00339999999999999981 < phi2 Initial program 85.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6449.8
Applied rewrites49.8%
Final simplification64.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
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi2 -0.0052)
(* (acos (fma (sin phi2) (sin phi1) (* (cos phi1) (cos phi2)))) R)
(if (<= phi2 0.019)
(*
(acos
(fma
(fma phi2 (* -0.5 phi2) 1.0)
(* t_0 (cos phi1))
(*
(* (sin phi1) phi2)
(fma (* -0.16666666666666666 phi2) phi2 1.0))))
R)
(* (acos (* t_0 (cos 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 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -0.0052) {
tmp = acos(fma(sin(phi2), sin(phi1), (cos(phi1) * cos(phi2)))) * R;
} else if (phi2 <= 0.019) {
tmp = acos(fma(fma(phi2, (-0.5 * phi2), 1.0), (t_0 * cos(phi1)), ((sin(phi1) * phi2) * fma((-0.16666666666666666 * phi2), phi2, 1.0)))) * R;
} else {
tmp = acos((t_0 * cos(phi2))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -0.0052) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * cos(phi2)))) * R); elseif (phi2 <= 0.019) tmp = Float64(acos(fma(fma(phi2, Float64(-0.5 * phi2), 1.0), Float64(t_0 * cos(phi1)), Float64(Float64(sin(phi1) * phi2) * fma(Float64(-0.16666666666666666 * phi2), phi2, 1.0)))) * R); else tmp = Float64(acos(Float64(t_0 * cos(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[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -0.0052], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi2, 0.019], N[(N[ArcCos[N[(N[(phi2 * N[(-0.5 * phi2), $MachinePrecision] + 1.0), $MachinePrecision] * N[(t$95$0 * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision] * N[(N[(-0.16666666666666666 * phi2), $MachinePrecision] * phi2 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(t$95$0 * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -0.0052:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot \cos \phi_2\right)\right) \cdot R\\
\mathbf{elif}\;\phi_2 \leq 0.019:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\mathsf{fma}\left(\phi_2, -0.5 \cdot \phi_2, 1\right), t\_0 \cdot \cos \phi_1, \left(\sin \phi_1 \cdot \phi_2\right) \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot \phi_2, \phi_2, 1\right)\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(t\_0 \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < -0.0051999999999999998Initial program 79.9%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6460.7
Applied rewrites60.7%
Taylor expanded in lambda2 around 0
Applied rewrites34.9%
if -0.0051999999999999998 < phi2 < 0.0189999999999999995Initial program 69.0%
Taylor expanded in phi2 around 0
Applied rewrites69.0%
if 0.0189999999999999995 < phi2 Initial program 85.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6449.8
Applied rewrites49.8%
Final simplification54.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 (<= phi1 -1.85e-25) (* (acos (* (fma 0.0 0.5 (* (cos lambda1) (cos lambda2))) (cos phi1))) R) (* (acos (* (cos (- lambda1 lambda2)) (cos 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 <= -1.85e-25) {
tmp = acos((fma(0.0, 0.5, (cos(lambda1) * cos(lambda2))) * cos(phi1))) * R;
} else {
tmp = acos((cos((lambda1 - lambda2)) * cos(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 <= -1.85e-25) tmp = Float64(acos(Float64(fma(0.0, 0.5, Float64(cos(lambda1) * cos(lambda2))) * cos(phi1))) * R); else tmp = Float64(acos(Float64(cos(Float64(lambda1 - lambda2)) * cos(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, -1.85e-25], N[(N[ArcCos[N[(N[(0.0 * 0.5 + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $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 -1.85 \cdot 10^{-25}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(0, 0.5, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -1.85000000000000004e-25Initial program 84.1%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6445.9
Applied rewrites45.9%
Applied rewrites46.4%
Taylor expanded in lambda2 around 0
Applied rewrites46.4%
if -1.85000000000000004e-25 < phi1 Initial program 72.9%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6453.0
Applied rewrites53.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
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi1 -2.25e-38)
(* (acos (* t_0 (cos phi1))) R)
(* (acos (* t_0 (cos 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 = cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -2.25e-38) {
tmp = acos((t_0 * cos(phi1))) * R;
} else {
tmp = acos((t_0 * cos(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) :: t_0
real(8) :: tmp
t_0 = cos((lambda1 - lambda2))
if (phi1 <= (-2.25d-38)) then
tmp = acos((t_0 * cos(phi1))) * r
else
tmp = acos((t_0 * cos(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 t_0 = Math.cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -2.25e-38) {
tmp = Math.acos((t_0 * Math.cos(phi1))) * R;
} else {
tmp = Math.acos((t_0 * Math.cos(phi2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) tmp = 0 if phi1 <= -2.25e-38: tmp = math.acos((t_0 * math.cos(phi1))) * R else: tmp = math.acos((t_0 * math.cos(phi2))) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi1 <= -2.25e-38) tmp = Float64(acos(Float64(t_0 * cos(phi1))) * R); else tmp = Float64(acos(Float64(t_0 * cos(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)
t_0 = cos((lambda1 - lambda2));
tmp = 0.0;
if (phi1 <= -2.25e-38)
tmp = acos((t_0 * cos(phi1))) * R;
else
tmp = acos((t_0 * cos(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_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -2.25e-38], N[(N[ArcCos[N[(t$95$0 * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(t$95$0 * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -2.25 \cdot 10^{-38}:\\
\;\;\;\;\cos^{-1} \left(t\_0 \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(t\_0 \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -2.25000000000000004e-38Initial program 84.1%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6447.8
Applied rewrites47.8%
if -2.25000000000000004e-38 < phi1 Initial program 72.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6451.9
Applied rewrites51.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 (<= phi2 0.0034) (* (acos (* (cos (- lambda1 lambda2)) (cos phi1))) R) (* (acos (* (cos phi2) (cos lambda2))) 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 <= 0.0034) {
tmp = acos((cos((lambda1 - lambda2)) * cos(phi1))) * R;
} else {
tmp = acos((cos(phi2) * cos(lambda2))) * 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 <= 0.0034d0) then
tmp = acos((cos((lambda1 - lambda2)) * cos(phi1))) * r
else
tmp = acos((cos(phi2) * cos(lambda2))) * 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 <= 0.0034) {
tmp = Math.acos((Math.cos((lambda1 - lambda2)) * Math.cos(phi1))) * R;
} else {
tmp = Math.acos((Math.cos(phi2) * Math.cos(lambda2))) * 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 <= 0.0034: tmp = math.acos((math.cos((lambda1 - lambda2)) * math.cos(phi1))) * R else: tmp = math.acos((math.cos(phi2) * math.cos(lambda2))) * 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 <= 0.0034) tmp = Float64(acos(Float64(cos(Float64(lambda1 - lambda2)) * cos(phi1))) * R); else tmp = Float64(acos(Float64(cos(phi2) * cos(lambda2))) * 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 <= 0.0034)
tmp = acos((cos((lambda1 - lambda2)) * cos(phi1))) * R;
else
tmp = acos((cos(phi2) * cos(lambda2))) * 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, 0.0034], N[(N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $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 0.0034:\\
\;\;\;\;\cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\cos \phi_2 \cdot \cos \lambda_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 0.00339999999999999981Initial program 73.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6450.7
Applied rewrites50.7%
if 0.00339999999999999981 < phi2 Initial program 85.5%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6465.1
Applied rewrites65.1%
Taylor expanded in phi1 around 0
Applied rewrites38.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 (<= lambda1 -155.0) (* (acos (* (cos lambda1) (cos phi1))) R) (* (acos (* (cos phi2) (cos lambda2))) 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 <= -155.0) {
tmp = acos((cos(lambda1) * cos(phi1))) * R;
} else {
tmp = acos((cos(phi2) * cos(lambda2))) * 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 (lambda1 <= (-155.0d0)) then
tmp = acos((cos(lambda1) * cos(phi1))) * r
else
tmp = acos((cos(phi2) * cos(lambda2))) * 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 (lambda1 <= -155.0) {
tmp = Math.acos((Math.cos(lambda1) * Math.cos(phi1))) * R;
} else {
tmp = Math.acos((Math.cos(phi2) * Math.cos(lambda2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -155.0: tmp = math.acos((math.cos(lambda1) * math.cos(phi1))) * R else: tmp = math.acos((math.cos(phi2) * math.cos(lambda2))) * 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 (lambda1 <= -155.0) tmp = Float64(acos(Float64(cos(lambda1) * cos(phi1))) * R); else tmp = Float64(acos(Float64(cos(phi2) * cos(lambda2))) * 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 (lambda1 <= -155.0)
tmp = acos((cos(lambda1) * cos(phi1))) * R;
else
tmp = acos((cos(phi2) * cos(lambda2))) * 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[lambda1, -155.0], N[(N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $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 \leq -155:\\
\;\;\;\;\cos^{-1} \left(\cos \lambda_1 \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\cos \phi_2 \cdot \cos \lambda_2\right) \cdot R\\
\end{array}
\end{array}
if lambda1 < -155Initial program 69.3%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6445.5
Applied rewrites45.5%
Taylor expanded in lambda2 around 0
Applied rewrites45.0%
if -155 < lambda1 Initial program 78.2%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6464.3
Applied rewrites64.3%
Taylor expanded in phi1 around 0
Applied rewrites35.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 -155.0) (* (acos (cos (- lambda1 lambda2))) R) (* (acos (* (cos phi2) (cos lambda2))) 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 <= -155.0) {
tmp = acos(cos((lambda1 - lambda2))) * R;
} else {
tmp = acos((cos(phi2) * cos(lambda2))) * 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 (lambda1 <= (-155.0d0)) then
tmp = acos(cos((lambda1 - lambda2))) * r
else
tmp = acos((cos(phi2) * cos(lambda2))) * 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 (lambda1 <= -155.0) {
tmp = Math.acos(Math.cos((lambda1 - lambda2))) * R;
} else {
tmp = Math.acos((Math.cos(phi2) * Math.cos(lambda2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -155.0: tmp = math.acos(math.cos((lambda1 - lambda2))) * R else: tmp = math.acos((math.cos(phi2) * math.cos(lambda2))) * 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 (lambda1 <= -155.0) tmp = Float64(acos(cos(Float64(lambda1 - lambda2))) * R); else tmp = Float64(acos(Float64(cos(phi2) * cos(lambda2))) * 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 (lambda1 <= -155.0)
tmp = acos(cos((lambda1 - lambda2))) * R;
else
tmp = acos((cos(phi2) * cos(lambda2))) * 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[lambda1, -155.0], N[(N[ArcCos[N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $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 \leq -155:\\
\;\;\;\;\cos^{-1} \cos \left(\lambda_1 - \lambda_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\cos \phi_2 \cdot \cos \lambda_2\right) \cdot R\\
\end{array}
\end{array}
if lambda1 < -155Initial program 69.3%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6445.5
Applied rewrites45.5%
Taylor expanded in phi1 around 0
Applied rewrites33.8%
if -155 < lambda1 Initial program 78.2%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6464.3
Applied rewrites64.3%
Taylor expanded in phi1 around 0
Applied rewrites35.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 (<= lambda2 2.2e-16) (* (acos (cos lambda1)) R) (* (acos (cos lambda2)) 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 (lambda2 <= 2.2e-16) {
tmp = acos(cos(lambda1)) * R;
} else {
tmp = acos(cos(lambda2)) * 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 (lambda2 <= 2.2d-16) then
tmp = acos(cos(lambda1)) * r
else
tmp = acos(cos(lambda2)) * 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 (lambda2 <= 2.2e-16) {
tmp = Math.acos(Math.cos(lambda1)) * R;
} else {
tmp = Math.acos(Math.cos(lambda2)) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 2.2e-16: tmp = math.acos(math.cos(lambda1)) * R else: tmp = math.acos(math.cos(lambda2)) * 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 (lambda2 <= 2.2e-16) tmp = Float64(acos(cos(lambda1)) * R); else tmp = Float64(acos(cos(lambda2)) * 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 (lambda2 <= 2.2e-16)
tmp = acos(cos(lambda1)) * R;
else
tmp = acos(cos(lambda2)) * 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[lambda2, 2.2e-16], N[(N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision] * R), $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.2 \cdot 10^{-16}:\\
\;\;\;\;\cos^{-1} \cos \lambda_1 \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \cos \lambda_2 \cdot R\\
\end{array}
\end{array}
if lambda2 < 2.2e-16Initial program 81.2%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6445.9
Applied rewrites45.9%
Taylor expanded in phi1 around 0
Applied rewrites28.2%
Taylor expanded in lambda2 around 0
Applied rewrites22.6%
if 2.2e-16 < lambda2 Initial program 62.8%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6435.6
Applied rewrites35.6%
Taylor expanded in phi1 around 0
Applied rewrites30.7%
Taylor expanded in lambda1 around 0
Applied rewrites30.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 (* (acos (cos (- lambda1 lambda2))) R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(cos((lambda1 - 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 = acos(cos((lambda1 - 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 Math.acos(Math.cos((lambda1 - lambda2))) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return math.acos(math.cos((lambda1 - lambda2))) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(cos(Float64(lambda1 - lambda2))) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = acos(cos((lambda1 - 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[(N[ArcCos[N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\cos^{-1} \cos \left(\lambda_1 - \lambda_2\right) \cdot R
\end{array}
Initial program 76.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6443.0
Applied rewrites43.0%
Taylor expanded in phi1 around 0
Applied rewrites28.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 (* (acos (cos lambda1)) R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(cos(lambda1)) * 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 = acos(cos(lambda1)) * 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 Math.acos(Math.cos(lambda1)) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return math.acos(math.cos(lambda1)) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(cos(lambda1)) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = acos(cos(lambda1)) * 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[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\cos^{-1} \cos \lambda_1 \cdot R
\end{array}
Initial program 76.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6443.0
Applied rewrites43.0%
Taylor expanded in phi1 around 0
Applied rewrites28.9%
Taylor expanded in lambda2 around 0
Applied rewrites19.3%
herbie shell --seed 2024259
(FPCore (R lambda1 lambda2 phi1 phi2)
:name "Spherical law of cosines"
:precision binary64
(* (acos (+ (* (sin phi1) (sin phi2)) (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))) R))