
(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 32 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: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(fma
(cos phi2)
(*
(cos phi1)
(fma (sin lambda2) (sin lambda1) (* (cos lambda2) (cos lambda1))))
(* (sin phi1) (sin phi2))))
R))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(fma(cos(phi2), (cos(phi1) * fma(sin(lambda2), sin(lambda1), (cos(lambda2) * cos(lambda1)))), (sin(phi1) * sin(phi2)))) * R;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(fma(cos(phi2), Float64(cos(phi1) * fma(sin(lambda2), sin(lambda1), Float64(cos(lambda2) * cos(lambda1)))), Float64(sin(phi1) * sin(phi2)))) * R) end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1 \cdot \mathsf{fma}\left(\sin \lambda_2, \sin \lambda_1, \cos \lambda_2 \cdot \cos \lambda_1\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R
\end{array}
Initial program 73.4%
cos-diff94.3%
Applied egg-rr94.3%
cos-neg94.3%
*-commutative94.3%
fma-def94.3%
cos-neg94.3%
Simplified94.3%
add-cbrt-cube94.3%
Applied egg-rr94.3%
Taylor expanded in phi1 around 0 94.3%
*-commutative94.3%
*-commutative94.3%
associate-*r*94.3%
*-commutative94.3%
*-commutative94.3%
fma-def94.3%
Simplified94.3%
Final simplification94.3%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(cos phi2)
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * (cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))))));
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))))) end
NOTE: 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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\right)
\end{array}
Initial program 73.4%
cos-diff94.3%
Applied egg-rr94.3%
cos-neg94.3%
*-commutative94.3%
fma-def94.3%
cos-neg94.3%
Simplified94.3%
Taylor expanded in lambda2 around -inf 94.3%
Final simplification94.3%
NOTE: 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 phi2) (cos phi1)))
(t_2 (cos (- lambda1 lambda2))))
(if (<= phi2 -0.0035)
(* R (- (* PI 0.5) (asin (+ t_0 (* t_1 t_2)))))
(if (<= phi2 3700.0)
(*
R
(acos
(+
(* phi2 (sin phi1))
(*
t_1
(fma
(cos lambda2)
(cos lambda1)
(* (sin lambda2) (sin lambda1)))))))
(* R (pow (pow (acos (fma t_2 t_1 t_0)) 3.0) 0.3333333333333333))))))assert(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(phi2) * cos(phi1);
double t_2 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -0.0035) {
tmp = R * ((((double) M_PI) * 0.5) - asin((t_0 + (t_1 * t_2))));
} else if (phi2 <= 3700.0) {
tmp = R * acos(((phi2 * sin(phi1)) + (t_1 * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1))))));
} else {
tmp = R * pow(pow(acos(fma(t_2, t_1, t_0)), 3.0), 0.3333333333333333);
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi2) * cos(phi1)) t_2 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -0.0035) tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(Float64(t_0 + Float64(t_1 * t_2))))); elseif (phi2 <= 3700.0) tmp = Float64(R * acos(Float64(Float64(phi2 * sin(phi1)) + Float64(t_1 * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1))))))); else tmp = Float64(R * ((acos(fma(t_2, t_1, t_0)) ^ 3.0) ^ 0.3333333333333333)); end return tmp end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -0.0035], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 + N[(t$95$1 * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3700.0], N[(R * N[ArcCos[N[(N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Power[N[Power[N[ArcCos[N[(t$95$2 * t$95$1 + t$95$0), $MachinePrecision]], $MachinePrecision], 3.0], $MachinePrecision], 0.3333333333333333], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_2 \cdot \cos \phi_1\\
t_2 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -0.0035:\\
\;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(t_0 + t_1 \cdot t_2\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 3700:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \sin \phi_1 + t_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot {\left({\cos^{-1} \left(\mathsf{fma}\left(t_2, t_1, t_0\right)\right)}^{3}\right)}^{0.3333333333333333}\\
\end{array}
\end{array}
if phi2 < -0.00350000000000000007Initial program 79.9%
add-cbrt-cube80.0%
pow380.0%
Applied egg-rr80.0%
acos-asin79.9%
div-inv79.9%
metadata-eval79.9%
rem-cbrt-cube79.9%
Applied egg-rr79.9%
if -0.00350000000000000007 < phi2 < 3700Initial program 66.3%
cos-diff89.2%
Applied egg-rr89.2%
cos-neg89.2%
*-commutative89.2%
fma-def89.3%
cos-neg89.3%
Simplified89.3%
Taylor expanded in phi2 around 0 89.3%
if 3700 < phi2 Initial program 80.1%
add-cbrt-cube79.7%
pow1/380.1%
Applied egg-rr80.1%
Final simplification84.4%
NOTE: 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 phi2) (cos phi1)))
(t_2 (cos (- lambda1 lambda2))))
(if (<= phi2 -0.00037)
(* R (- (* PI 0.5) (asin (+ t_0 (* t_1 t_2)))))
(if (<= phi2 4400.0)
(*
R
(acos
(+
(* phi2 (sin phi1))
(*
(fma (sin lambda2) (sin lambda1) (* (cos lambda2) (cos lambda1)))
t_1))))
(* R (pow (pow (acos (fma t_2 t_1 t_0)) 3.0) 0.3333333333333333))))))assert(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(phi2) * cos(phi1);
double t_2 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -0.00037) {
tmp = R * ((((double) M_PI) * 0.5) - asin((t_0 + (t_1 * t_2))));
} else if (phi2 <= 4400.0) {
tmp = R * acos(((phi2 * sin(phi1)) + (fma(sin(lambda2), sin(lambda1), (cos(lambda2) * cos(lambda1))) * t_1)));
} else {
tmp = R * pow(pow(acos(fma(t_2, t_1, t_0)), 3.0), 0.3333333333333333);
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi2) * cos(phi1)) t_2 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -0.00037) tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(Float64(t_0 + Float64(t_1 * t_2))))); elseif (phi2 <= 4400.0) tmp = Float64(R * acos(Float64(Float64(phi2 * sin(phi1)) + Float64(fma(sin(lambda2), sin(lambda1), Float64(cos(lambda2) * cos(lambda1))) * t_1)))); else tmp = Float64(R * ((acos(fma(t_2, t_1, t_0)) ^ 3.0) ^ 0.3333333333333333)); end return tmp end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -0.00037], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 + N[(t$95$1 * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 4400.0], N[(R * N[ArcCos[N[(N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Power[N[Power[N[ArcCos[N[(t$95$2 * t$95$1 + t$95$0), $MachinePrecision]], $MachinePrecision], 3.0], $MachinePrecision], 0.3333333333333333], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_2 \cdot \cos \phi_1\\
t_2 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -0.00037:\\
\;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(t_0 + t_1 \cdot t_2\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 4400:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \sin \phi_1 + \mathsf{fma}\left(\sin \lambda_2, \sin \lambda_1, \cos \lambda_2 \cdot \cos \lambda_1\right) \cdot t_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot {\left({\cos^{-1} \left(\mathsf{fma}\left(t_2, t_1, t_0\right)\right)}^{3}\right)}^{0.3333333333333333}\\
\end{array}
\end{array}
if phi2 < -3.6999999999999999e-4Initial program 79.9%
add-cbrt-cube80.0%
pow380.0%
Applied egg-rr80.0%
acos-asin79.9%
div-inv79.9%
metadata-eval79.9%
rem-cbrt-cube79.9%
Applied egg-rr79.9%
if -3.6999999999999999e-4 < phi2 < 4400Initial program 66.3%
cos-diff89.2%
Applied egg-rr89.2%
cos-neg89.2%
*-commutative89.2%
fma-def89.3%
cos-neg89.3%
Simplified89.3%
Taylor expanded in phi2 around 0 89.3%
Taylor expanded in lambda2 around inf 89.2%
fma-def89.2%
Simplified89.2%
if 4400 < phi2 Initial program 80.1%
add-cbrt-cube79.7%
pow1/380.1%
Applied egg-rr80.1%
Final simplification84.4%
NOTE: 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 phi2) (cos phi1)))
(t_2 (cos (- lambda1 lambda2))))
(if (<= phi2 -0.0018)
(* R (- (* PI 0.5) (asin (+ t_0 (* t_1 t_2)))))
(if (<= phi2 3700.0)
(*
R
(acos
(+
(*
t_1
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda2) (sin lambda1))))
(* phi2 (sin phi1)))))
(* R (pow (pow (acos (fma t_2 t_1 t_0)) 3.0) 0.3333333333333333))))))assert(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(phi2) * cos(phi1);
double t_2 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -0.0018) {
tmp = R * ((((double) M_PI) * 0.5) - asin((t_0 + (t_1 * t_2))));
} else if (phi2 <= 3700.0) {
tmp = R * acos(((t_1 * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1)))) + (phi2 * sin(phi1))));
} else {
tmp = R * pow(pow(acos(fma(t_2, t_1, t_0)), 3.0), 0.3333333333333333);
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi2) * cos(phi1)) t_2 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -0.0018) tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(Float64(t_0 + Float64(t_1 * t_2))))); elseif (phi2 <= 3700.0) tmp = Float64(R * acos(Float64(Float64(t_1 * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1)))) + Float64(phi2 * sin(phi1))))); else tmp = Float64(R * ((acos(fma(t_2, t_1, t_0)) ^ 3.0) ^ 0.3333333333333333)); end return tmp end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -0.0018], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 + N[(t$95$1 * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3700.0], N[(R * N[ArcCos[N[(N[(t$95$1 * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Power[N[Power[N[ArcCos[N[(t$95$2 * t$95$1 + t$95$0), $MachinePrecision]], $MachinePrecision], 3.0], $MachinePrecision], 0.3333333333333333], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_2 \cdot \cos \phi_1\\
t_2 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -0.0018:\\
\;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(t_0 + t_1 \cdot t_2\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 3700:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_2 \cdot \sin \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot {\left({\cos^{-1} \left(\mathsf{fma}\left(t_2, t_1, t_0\right)\right)}^{3}\right)}^{0.3333333333333333}\\
\end{array}
\end{array}
if phi2 < -0.0018Initial program 79.9%
add-cbrt-cube80.0%
pow380.0%
Applied egg-rr80.0%
acos-asin79.9%
div-inv79.9%
metadata-eval79.9%
rem-cbrt-cube79.9%
Applied egg-rr79.9%
if -0.0018 < phi2 < 3700Initial program 66.3%
cos-diff89.2%
Applied egg-rr89.2%
cos-neg89.2%
*-commutative89.2%
fma-def89.3%
cos-neg89.3%
Simplified89.3%
Taylor expanded in phi2 around 0 89.3%
Taylor expanded in lambda2 around inf 89.2%
if 3700 < phi2 Initial program 80.1%
add-cbrt-cube79.7%
pow1/380.1%
Applied egg-rr80.1%
Final simplification84.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(* (cos phi2) (cos phi1))
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda2) (sin lambda1))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))));
}
NOTE: 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 = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi2) * Math.cos(phi1)) * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda2) * Math.sin(lambda1))))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi2) * math.cos(phi1)) * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda2) * math.sin(lambda1))))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi2) * cos(phi1)) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1))))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))));
end
NOTE: 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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right)\right)
\end{array}
Initial program 73.4%
cos-diff33.4%
+-commutative33.4%
Applied egg-rr94.3%
Final simplification94.3%
NOTE: 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 phi2) (cos phi1)))
(t_2 (cos (- lambda1 lambda2))))
(if (<= phi2 -0.00038)
(* R (- (* PI 0.5) (asin (+ t_0 (* t_1 t_2)))))
(if (<= phi2 3700.0)
(*
R
(acos
(+
(*
t_1
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda2) (sin lambda1))))
(* phi2 (sin phi1)))))
(* R (exp (log (acos (fma t_2 t_1 t_0)))))))))assert(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(phi2) * cos(phi1);
double t_2 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -0.00038) {
tmp = R * ((((double) M_PI) * 0.5) - asin((t_0 + (t_1 * t_2))));
} else if (phi2 <= 3700.0) {
tmp = R * acos(((t_1 * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1)))) + (phi2 * sin(phi1))));
} else {
tmp = R * exp(log(acos(fma(t_2, t_1, t_0))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi2) * cos(phi1)) t_2 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -0.00038) tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(Float64(t_0 + Float64(t_1 * t_2))))); elseif (phi2 <= 3700.0) tmp = Float64(R * acos(Float64(Float64(t_1 * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1)))) + Float64(phi2 * sin(phi1))))); else tmp = Float64(R * exp(log(acos(fma(t_2, t_1, t_0))))); end return tmp end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -0.00038], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 + N[(t$95$1 * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3700.0], N[(R * N[ArcCos[N[(N[(t$95$1 * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Exp[N[Log[N[ArcCos[N[(t$95$2 * t$95$1 + t$95$0), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_2 \cdot \cos \phi_1\\
t_2 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -0.00038:\\
\;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(t_0 + t_1 \cdot t_2\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 3700:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_2 \cdot \sin \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot e^{\log \cos^{-1} \left(\mathsf{fma}\left(t_2, t_1, t_0\right)\right)}\\
\end{array}
\end{array}
if phi2 < -3.8000000000000002e-4Initial program 79.9%
add-cbrt-cube80.0%
pow380.0%
Applied egg-rr80.0%
acos-asin79.9%
div-inv79.9%
metadata-eval79.9%
rem-cbrt-cube79.9%
Applied egg-rr79.9%
if -3.8000000000000002e-4 < phi2 < 3700Initial program 66.3%
cos-diff89.2%
Applied egg-rr89.2%
cos-neg89.2%
*-commutative89.2%
fma-def89.3%
cos-neg89.3%
Simplified89.3%
Taylor expanded in phi2 around 0 89.3%
Taylor expanded in lambda2 around inf 89.2%
if 3700 < phi2 Initial program 80.1%
add-exp-log80.1%
+-commutative80.1%
*-commutative80.1%
fma-def80.1%
Applied egg-rr80.1%
Final simplification84.4%
NOTE: 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 phi2) (cos phi1)))
(t_2 (* t_1 (cos (- lambda1 lambda2)))))
(if (<= phi1 -0.0037)
(* R (acos (+ t_2 (cbrt (pow t_0 3.0)))))
(if (<= phi1 0.0155)
(*
R
(acos
(+
(*
t_1
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda2) (sin lambda1))))
(* phi1 (sin phi2)))))
(* R (acos (+ t_2 (expm1 (log1p t_0)))))))))assert(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(phi2) * cos(phi1);
double t_2 = t_1 * cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -0.0037) {
tmp = R * acos((t_2 + cbrt(pow(t_0, 3.0))));
} else if (phi1 <= 0.0155) {
tmp = R * acos(((t_1 * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1)))) + (phi1 * sin(phi2))));
} else {
tmp = R * acos((t_2 + expm1(log1p(t_0))));
}
return tmp;
}
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double t_1 = Math.cos(phi2) * Math.cos(phi1);
double t_2 = t_1 * Math.cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -0.0037) {
tmp = R * Math.acos((t_2 + Math.cbrt(Math.pow(t_0, 3.0))));
} else if (phi1 <= 0.0155) {
tmp = R * Math.acos(((t_1 * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda2) * Math.sin(lambda1)))) + (phi1 * Math.sin(phi2))));
} else {
tmp = R * Math.acos((t_2 + Math.expm1(Math.log1p(t_0))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi2) * cos(phi1)) t_2 = Float64(t_1 * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi1 <= -0.0037) tmp = Float64(R * acos(Float64(t_2 + cbrt((t_0 ^ 3.0))))); elseif (phi1 <= 0.0155) tmp = Float64(R * acos(Float64(Float64(t_1 * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1)))) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * acos(Float64(t_2 + expm1(log1p(t_0))))); end return tmp end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.0037], N[(R * N[ArcCos[N[(t$95$2 + N[Power[N[Power[t$95$0, 3.0], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 0.0155], N[(R * N[ArcCos[N[(N[(t$95$1 * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$2 + N[(Exp[N[Log[1 + t$95$0], $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_2 \cdot \cos \phi_1\\
t_2 := t_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -0.0037:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_2 + \sqrt[3]{{t_0}^{3}}\right)\\
\mathbf{elif}\;\phi_1 \leq 0.0155:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_2 + \mathsf{expm1}\left(\mathsf{log1p}\left(t_0\right)\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.0037000000000000002Initial program 81.1%
add-cbrt-cube81.1%
pow381.2%
Applied egg-rr81.2%
if -0.0037000000000000002 < phi1 < 0.0155Initial program 66.6%
Taylor expanded in phi1 around 0 66.6%
cos-diff43.3%
+-commutative43.3%
Applied egg-rr90.6%
if 0.0155 < phi1 Initial program 83.0%
expm1-log1p-u83.0%
Applied egg-rr83.0%
Final simplification86.9%
NOTE: 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 phi2) (cos phi1)))
(t_1 (+ (* (sin phi1) (sin phi2)) (* t_0 (cos (- lambda1 lambda2))))))
(if (<= phi2 -0.006)
(* R (- (* PI 0.5) (asin t_1)))
(if (<= phi2 3700.0)
(*
R
(acos
(+
(*
t_0
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda2) (sin lambda1))))
(* phi2 (sin phi1)))))
(* R (acos t_1))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos(phi1);
double t_1 = (sin(phi1) * sin(phi2)) + (t_0 * cos((lambda1 - lambda2)));
double tmp;
if (phi2 <= -0.006) {
tmp = R * ((((double) M_PI) * 0.5) - asin(t_1));
} else if (phi2 <= 3700.0) {
tmp = R * acos(((t_0 * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1)))) + (phi2 * sin(phi1))));
} else {
tmp = R * acos(t_1);
}
return tmp;
}
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi2) * Math.cos(phi1);
double t_1 = (Math.sin(phi1) * Math.sin(phi2)) + (t_0 * Math.cos((lambda1 - lambda2)));
double tmp;
if (phi2 <= -0.006) {
tmp = R * ((Math.PI * 0.5) - Math.asin(t_1));
} else if (phi2 <= 3700.0) {
tmp = R * Math.acos(((t_0 * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda2) * Math.sin(lambda1)))) + (phi2 * Math.sin(phi1))));
} else {
tmp = R * Math.acos(t_1);
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi2) * math.cos(phi1) t_1 = (math.sin(phi1) * math.sin(phi2)) + (t_0 * math.cos((lambda1 - lambda2))) tmp = 0 if phi2 <= -0.006: tmp = R * ((math.pi * 0.5) - math.asin(t_1)) elif phi2 <= 3700.0: tmp = R * math.acos(((t_0 * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda2) * math.sin(lambda1)))) + (phi2 * math.sin(phi1)))) else: tmp = R * math.acos(t_1) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(phi1)) t_1 = Float64(Float64(sin(phi1) * sin(phi2)) + Float64(t_0 * cos(Float64(lambda1 - lambda2)))) tmp = 0.0 if (phi2 <= -0.006) tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(t_1))); elseif (phi2 <= 3700.0) tmp = Float64(R * acos(Float64(Float64(t_0 * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1)))) + Float64(phi2 * sin(phi1))))); else tmp = Float64(R * acos(t_1)); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi2) * cos(phi1);
t_1 = (sin(phi1) * sin(phi2)) + (t_0 * cos((lambda1 - lambda2)));
tmp = 0.0;
if (phi2 <= -0.006)
tmp = R * ((pi * 0.5) - asin(t_1));
elseif (phi2 <= 3700.0)
tmp = R * acos(((t_0 * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1)))) + (phi2 * sin(phi1))));
else
tmp = R * acos(t_1);
end
tmp_2 = tmp;
end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.006], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[t$95$1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3700.0], N[(R * N[ArcCos[N[(N[(t$95$0 * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[t$95$1], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \phi_1\\
t_1 := \sin \phi_1 \cdot \sin \phi_2 + t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -0.006:\\
\;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} t_1\right)\\
\mathbf{elif}\;\phi_2 \leq 3700:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_2 \cdot \sin \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} t_1\\
\end{array}
\end{array}
if phi2 < -0.0060000000000000001Initial program 79.9%
add-cbrt-cube80.0%
pow380.0%
Applied egg-rr80.0%
acos-asin79.9%
div-inv79.9%
metadata-eval79.9%
rem-cbrt-cube79.9%
Applied egg-rr79.9%
if -0.0060000000000000001 < phi2 < 3700Initial program 66.3%
cos-diff89.2%
Applied egg-rr89.2%
cos-neg89.2%
*-commutative89.2%
fma-def89.3%
cos-neg89.3%
Simplified89.3%
Taylor expanded in phi2 around 0 89.3%
Taylor expanded in lambda2 around inf 89.2%
if 3700 < phi2 Initial program 80.1%
Final simplification84.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -0.0058)
(*
R
(acos
(+
(* phi1 (sin phi2))
(*
(cos phi1)
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda2) (sin lambda1)))))))
(*
R
(acos
(+
(* (* (cos phi2) (cos phi1)) (cos (- lambda1 lambda2)))
(log (exp (* (sin phi1) (sin phi2)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -0.0058) {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))));
} else {
tmp = R * acos((((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2))) + log(exp((sin(phi1) * sin(phi2))))));
}
return tmp;
}
NOTE: 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 <= (-0.0058d0)) then
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))))
else
tmp = r * acos((((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2))) + log(exp((sin(phi1) * sin(phi2))))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -0.0058) {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi1) * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda2) * Math.sin(lambda1))))));
} else {
tmp = R * Math.acos((((Math.cos(phi2) * Math.cos(phi1)) * Math.cos((lambda1 - lambda2))) + Math.log(Math.exp((Math.sin(phi1) * Math.sin(phi2))))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -0.0058: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi1) * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda2) * math.sin(lambda1)))))) else: tmp = R * math.acos((((math.cos(phi2) * math.cos(phi1)) * math.cos((lambda1 - lambda2))) + math.log(math.exp((math.sin(phi1) * math.sin(phi2)))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -0.0058) tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1))))))); else tmp = Float64(R * acos(Float64(Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2))) + log(exp(Float64(sin(phi1) * sin(phi2))))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= -0.0058)
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))));
else
tmp = R * acos((((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2))) + log(exp((sin(phi1) * sin(phi2))))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -0.0058], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[Log[N[Exp[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -0.0058:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right) + \log \left(e^{\sin \phi_1 \cdot \sin \phi_2}\right)\right)\\
\end{array}
\end{array}
if lambda2 < -0.0058Initial program 59.1%
Taylor expanded in phi1 around 0 31.5%
Taylor expanded in phi2 around 0 21.8%
cos-diff39.1%
+-commutative39.1%
Applied egg-rr41.5%
if -0.0058 < lambda2 Initial program 79.5%
add-cbrt-cube79.4%
pow379.4%
Applied egg-rr79.4%
rem-cbrt-cube79.5%
add-log-exp79.5%
Applied egg-rr79.5%
Final simplification68.2%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -0.0155)
(*
R
(acos
(+
(* phi1 (sin phi2))
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1)))))))
(*
R
(acos
(+
(* (* (cos phi2) (cos phi1)) (cos (- lambda1 lambda2)))
(log (exp (* (sin phi1) (sin phi2)))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -0.0155) {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1))))));
} else {
tmp = R * acos((((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2))) + log(exp((sin(phi1) * sin(phi2))))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -0.0155) tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1))))))); else tmp = Float64(R * acos(Float64(Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2))) + log(exp(Float64(sin(phi1) * sin(phi2))))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -0.0155], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[Log[N[Exp[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -0.0155:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right) + \log \left(e^{\sin \phi_1 \cdot \sin \phi_2}\right)\right)\\
\end{array}
\end{array}
if lambda2 < -0.0155Initial program 59.1%
Taylor expanded in phi1 around 0 31.5%
Taylor expanded in phi2 around 0 21.8%
cos-diff98.7%
Applied egg-rr41.5%
cos-neg98.7%
*-commutative98.7%
fma-def98.8%
cos-neg98.8%
Simplified41.5%
if -0.0155 < lambda2 Initial program 79.5%
add-cbrt-cube79.4%
pow379.4%
Applied egg-rr79.4%
rem-cbrt-cube79.5%
add-log-exp79.5%
Applied egg-rr79.5%
Final simplification68.2%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -0.016)
(*
R
(acos
(+
(* phi1 (sin phi2))
(*
(cos phi1)
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda2) (sin lambda1)))))))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi2) (cos phi1)) (cos (- lambda1 lambda2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -0.016) {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
}
return tmp;
}
NOTE: 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 <= (-0.016d0)) then
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -0.016) {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi1) * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda2) * Math.sin(lambda1))))));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi2) * Math.cos(phi1)) * Math.cos((lambda1 - lambda2)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -0.016: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi1) * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda2) * math.sin(lambda1)))))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi2) * math.cos(phi1)) * math.cos((lambda1 - lambda2))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -0.016) tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1))))))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= -0.016)
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1))))));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -0.016], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -0.016:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if lambda2 < -0.016Initial program 59.1%
Taylor expanded in phi1 around 0 31.5%
Taylor expanded in phi2 around 0 21.8%
cos-diff39.1%
+-commutative39.1%
Applied egg-rr41.5%
if -0.016 < lambda2 Initial program 79.5%
Final simplification68.2%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -1750000000000.0)
(*
R
(acos
(+
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))
(* phi2 phi1))))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi2) (cos phi1)) (cos (- lambda1 lambda2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -1750000000000.0) {
tmp = R * acos(((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))) + (phi2 * phi1)));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -1750000000000.0) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))) + Float64(phi2 * phi1)))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2)))))); end return tmp end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -1750000000000.0], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -1750000000000:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_2 \cdot \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if lambda2 < -1.75e12Initial program 59.5%
Taylor expanded in phi1 around 0 32.4%
Taylor expanded in phi2 around 0 22.3%
Taylor expanded in phi2 around 0 20.2%
*-commutative20.2%
Simplified20.2%
cos-diff98.7%
Applied egg-rr40.7%
cos-neg98.7%
*-commutative98.7%
fma-def98.8%
cos-neg98.8%
Simplified40.7%
if -1.75e12 < lambda2 Initial program 79.0%
Final simplification68.1%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -1650000000000.0)
(*
R
(acos
(+
(*
(cos phi1)
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda2) (sin lambda1))))
(* phi2 phi1))))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi2) (cos phi1)) (cos (- lambda1 lambda2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -1650000000000.0) {
tmp = R * acos(((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1)))) + (phi2 * phi1)));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
}
return tmp;
}
NOTE: 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 <= (-1650000000000.0d0)) then
tmp = r * acos(((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1)))) + (phi2 * phi1)))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -1650000000000.0) {
tmp = R * Math.acos(((Math.cos(phi1) * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda2) * Math.sin(lambda1)))) + (phi2 * phi1)));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi2) * Math.cos(phi1)) * Math.cos((lambda1 - lambda2)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -1650000000000.0: tmp = R * math.acos(((math.cos(phi1) * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda2) * math.sin(lambda1)))) + (phi2 * phi1))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi2) * math.cos(phi1)) * math.cos((lambda1 - lambda2))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -1650000000000.0) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda2) * sin(lambda1)))) + Float64(phi2 * phi1)))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= -1650000000000.0)
tmp = R * acos(((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda2) * sin(lambda1)))) + (phi2 * phi1)));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -1650000000000.0], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -1650000000000:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_2 \cdot \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if lambda2 < -1.65e12Initial program 59.5%
Taylor expanded in phi1 around 0 32.4%
Taylor expanded in phi2 around 0 22.3%
Taylor expanded in phi2 around 0 20.2%
*-commutative20.2%
Simplified20.2%
cos-diff40.7%
+-commutative40.7%
Applied egg-rr40.7%
if -1.65e12 < lambda2 Initial program 79.0%
Final simplification68.1%
NOTE: 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 phi2) (cos phi1))))
(if (or (<= phi2 -0.0135) (not (<= phi2 940000.0)))
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos lambda1) t_0))))
(* R (acos (+ (* t_0 (cos (- lambda1 lambda2))) (* phi2 (sin phi1))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos(phi1);
double tmp;
if ((phi2 <= -0.0135) || !(phi2 <= 940000.0)) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(lambda1) * t_0)));
} else {
tmp = R * acos(((t_0 * cos((lambda1 - lambda2))) + (phi2 * sin(phi1))));
}
return tmp;
}
NOTE: 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(phi2) * cos(phi1)
if ((phi2 <= (-0.0135d0)) .or. (.not. (phi2 <= 940000.0d0))) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(lambda1) * t_0)))
else
tmp = r * acos(((t_0 * cos((lambda1 - lambda2))) + (phi2 * sin(phi1))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi2) * Math.cos(phi1);
double tmp;
if ((phi2 <= -0.0135) || !(phi2 <= 940000.0)) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(lambda1) * t_0)));
} else {
tmp = R * Math.acos(((t_0 * Math.cos((lambda1 - lambda2))) + (phi2 * Math.sin(phi1))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi2) * math.cos(phi1) tmp = 0 if (phi2 <= -0.0135) or not (phi2 <= 940000.0): tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(lambda1) * t_0))) else: tmp = R * math.acos(((t_0 * math.cos((lambda1 - lambda2))) + (phi2 * math.sin(phi1)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(phi1)) tmp = 0.0 if ((phi2 <= -0.0135) || !(phi2 <= 940000.0)) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(lambda1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(t_0 * cos(Float64(lambda1 - lambda2))) + Float64(phi2 * sin(phi1))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi2) * cos(phi1);
tmp = 0.0;
if ((phi2 <= -0.0135) || ~((phi2 <= 940000.0)))
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(lambda1) * t_0)));
else
tmp = R * acos(((t_0 * cos((lambda1 - lambda2))) + (phi2 * sin(phi1))));
end
tmp_2 = tmp;
end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[phi2, -0.0135], N[Not[LessEqual[phi2, 940000.0]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \phi_1\\
\mathbf{if}\;\phi_2 \leq -0.0135 \lor \neg \left(\phi_2 \leq 940000\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \lambda_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \phi_2 \cdot \sin \phi_1\right)\\
\end{array}
\end{array}
if phi2 < -0.0134999999999999998 or 9.4e5 < phi2 Initial program 79.9%
Taylor expanded in lambda2 around 0 54.9%
if -0.0134999999999999998 < phi2 < 9.4e5Initial program 66.6%
Taylor expanded in phi2 around 0 66.6%
Final simplification60.5%
NOTE: 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 phi2) (cos phi1))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= lambda2 1.2e-5)
(* R (acos (+ t_1 (* (cos lambda1) t_0))))
(* R (acos (+ t_1 (* (cos lambda2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos(phi1);
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (lambda2 <= 1.2e-5) {
tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
} else {
tmp = R * acos((t_1 + (cos(lambda2) * t_0)));
}
return tmp;
}
NOTE: 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) :: t_1
real(8) :: tmp
t_0 = cos(phi2) * cos(phi1)
t_1 = sin(phi1) * sin(phi2)
if (lambda2 <= 1.2d-5) then
tmp = r * acos((t_1 + (cos(lambda1) * t_0)))
else
tmp = r * acos((t_1 + (cos(lambda2) * t_0)))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi2) * Math.cos(phi1);
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda2 <= 1.2e-5) {
tmp = R * Math.acos((t_1 + (Math.cos(lambda1) * t_0)));
} else {
tmp = R * Math.acos((t_1 + (Math.cos(lambda2) * t_0)));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi2) * math.cos(phi1) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda2 <= 1.2e-5: tmp = R * math.acos((t_1 + (math.cos(lambda1) * t_0))) else: tmp = R * math.acos((t_1 + (math.cos(lambda2) * t_0))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(phi1)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda2 <= 1.2e-5) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(lambda1) * t_0)))); else tmp = Float64(R * acos(Float64(t_1 + Float64(cos(lambda2) * t_0)))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi2) * cos(phi1);
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda2 <= 1.2e-5)
tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
else
tmp = R * acos((t_1 + (cos(lambda2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 1.2e-5], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[lambda1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[lambda2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \phi_1\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 1.2 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \lambda_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \lambda_2 \cdot t_0\right)\\
\end{array}
\end{array}
if lambda2 < 1.2e-5Initial program 76.4%
Taylor expanded in lambda2 around 0 60.3%
if 1.2e-5 < lambda2 Initial program 65.4%
Taylor expanded in lambda1 around 0 65.3%
cos-neg29.1%
Simplified65.3%
Final simplification61.6%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi2) (cos phi1)) (cos (- lambda1 lambda2)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
}
NOTE: 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 = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi2) * Math.cos(phi1)) * Math.cos((lambda1 - lambda2)))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi2) * math.cos(phi1)) * math.cos((lambda1 - lambda2)))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2)))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))));
end
NOTE: 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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)
\end{array}
Initial program 73.4%
Final simplification73.4%
NOTE: 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 phi2) (cos phi1)))
(t_1 (* t_0 (cos (- lambda1 lambda2)))))
(if (<= phi1 -5e+22)
(* R (acos (+ t_1 (* phi2 (sin phi1)))))
(if (<= phi1 2.12e-57)
(* R (acos (+ t_1 (* phi1 (sin phi2)))))
(* R (acos (fma (sin phi1) (sin phi2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos(phi1);
double t_1 = t_0 * cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -5e+22) {
tmp = R * acos((t_1 + (phi2 * sin(phi1))));
} else if (phi1 <= 2.12e-57) {
tmp = R * acos((t_1 + (phi1 * sin(phi2))));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), t_0));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(phi1)) t_1 = Float64(t_0 * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi1 <= -5e+22) tmp = Float64(R * acos(Float64(t_1 + Float64(phi2 * sin(phi1))))); elseif (phi1 <= 2.12e-57) tmp = Float64(R * acos(Float64(t_1 + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), t_0))); end return tmp end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -5e+22], N[(R * N[ArcCos[N[(t$95$1 + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 2.12e-57], N[(R * N[ArcCos[N[(t$95$1 + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \phi_1\\
t_1 := t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -5 \cdot 10^{+22}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \phi_2 \cdot \sin \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq 2.12 \cdot 10^{-57}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, t_0\right)\right)\\
\end{array}
\end{array}
if phi1 < -4.9999999999999996e22Initial program 80.5%
Taylor expanded in phi2 around 0 46.6%
if -4.9999999999999996e22 < phi1 < 2.1200000000000001e-57Initial program 67.8%
Taylor expanded in phi1 around 0 66.6%
if 2.1200000000000001e-57 < phi1 Initial program 79.6%
fma-def79.6%
associate-*l*79.6%
Simplified79.6%
Taylor expanded in lambda2 around 0 57.2%
Taylor expanded in lambda1 around 0 37.7%
Final simplification55.0%
NOTE: 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 phi2) (cos phi1))))
(if (<= phi1 -15.0)
(*
R
(acos
(fma (sin phi1) (sin phi2) (* (cos phi1) (cos (- lambda2 lambda1))))))
(if (<= phi1 2.12e-57)
(* R (acos (+ (* t_0 (cos (- lambda1 lambda2))) (* phi1 (sin phi2)))))
(* R (acos (fma (sin phi1) (sin phi2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos(phi1);
double tmp;
if (phi1 <= -15.0) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * cos((lambda2 - lambda1)))));
} else if (phi1 <= 2.12e-57) {
tmp = R * acos(((t_0 * cos((lambda1 - lambda2))) + (phi1 * sin(phi2))));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), t_0));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(phi1)) tmp = 0.0 if (phi1 <= -15.0) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); elseif (phi1 <= 2.12e-57) tmp = Float64(R * acos(Float64(Float64(t_0 * cos(Float64(lambda1 - lambda2))) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), t_0))); end return tmp end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -15.0], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 2.12e-57], N[(R * N[ArcCos[N[(N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \phi_1\\
\mathbf{if}\;\phi_1 \leq -15:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 2.12 \cdot 10^{-57}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, t_0\right)\right)\\
\end{array}
\end{array}
if phi1 < -15Initial program 80.5%
fma-def80.5%
associate-*l*80.5%
Simplified80.5%
Taylor expanded in phi2 around 0 52.8%
sub-neg52.8%
+-commutative52.8%
neg-mul-152.8%
neg-mul-152.8%
remove-double-neg52.8%
mul-1-neg52.8%
distribute-neg-in52.8%
+-commutative52.8%
cos-neg52.8%
+-commutative52.8%
mul-1-neg52.8%
unsub-neg52.8%
Simplified52.8%
if -15 < phi1 < 2.1200000000000001e-57Initial program 67.8%
Taylor expanded in phi1 around 0 66.6%
if 2.1200000000000001e-57 < phi1 Initial program 79.6%
fma-def79.6%
associate-*l*79.6%
Simplified79.6%
Taylor expanded in lambda2 around 0 57.2%
Taylor expanded in lambda1 around 0 37.7%
Final simplification56.3%
NOTE: 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 (- lambda2 lambda1))))
(if (<= phi2 3.2e-11)
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi1) t_0))))
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 3.2e-11) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * t_0)));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi2) * t_0)));
}
return tmp;
}
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 3.2e-11) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi2) * t_0)))); end return tmp end
NOTE: 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[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 3.2e-11], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 3.2 \cdot 10^{-11}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot t_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_2 \cdot t_0\right)\right)\\
\end{array}
\end{array}
if phi2 < 3.19999999999999994e-11Initial program 71.7%
fma-def71.7%
associate-*l*71.7%
Simplified71.7%
Taylor expanded in phi2 around 0 48.7%
sub-neg48.7%
+-commutative48.7%
neg-mul-148.7%
neg-mul-148.7%
remove-double-neg48.7%
mul-1-neg48.7%
distribute-neg-in48.7%
+-commutative48.7%
cos-neg48.7%
+-commutative48.7%
mul-1-neg48.7%
unsub-neg48.7%
Simplified48.7%
if 3.19999999999999994e-11 < phi2 Initial program 78.0%
fma-def78.0%
associate-*l*78.0%
Simplified78.0%
Taylor expanded in phi1 around 0 50.1%
sub-neg50.1%
+-commutative50.1%
neg-mul-150.1%
neg-mul-150.1%
remove-double-neg50.1%
mul-1-neg50.1%
distribute-neg-in50.1%
+-commutative50.1%
cos-neg50.1%
+-commutative50.1%
mul-1-neg50.1%
unsub-neg50.1%
Simplified50.1%
Final simplification49.1%
NOTE: 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 phi2) (cos phi1))))
(if (<= phi1 -4e+84)
(* R (acos (+ (* phi2 (sin phi1)) (* (cos lambda2) t_0))))
(* R (acos (+ (* t_0 (cos (- lambda1 lambda2))) (* phi1 (sin phi2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos(phi1);
double tmp;
if (phi1 <= -4e+84) {
tmp = R * acos(((phi2 * sin(phi1)) + (cos(lambda2) * t_0)));
} else {
tmp = R * acos(((t_0 * cos((lambda1 - lambda2))) + (phi1 * sin(phi2))));
}
return tmp;
}
NOTE: 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(phi2) * cos(phi1)
if (phi1 <= (-4d+84)) then
tmp = r * acos(((phi2 * sin(phi1)) + (cos(lambda2) * t_0)))
else
tmp = r * acos(((t_0 * cos((lambda1 - lambda2))) + (phi1 * sin(phi2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi2) * Math.cos(phi1);
double tmp;
if (phi1 <= -4e+84) {
tmp = R * Math.acos(((phi2 * Math.sin(phi1)) + (Math.cos(lambda2) * t_0)));
} else {
tmp = R * Math.acos(((t_0 * Math.cos((lambda1 - lambda2))) + (phi1 * Math.sin(phi2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi2) * math.cos(phi1) tmp = 0 if phi1 <= -4e+84: tmp = R * math.acos(((phi2 * math.sin(phi1)) + (math.cos(lambda2) * t_0))) else: tmp = R * math.acos(((t_0 * math.cos((lambda1 - lambda2))) + (phi1 * math.sin(phi2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(phi1)) tmp = 0.0 if (phi1 <= -4e+84) tmp = Float64(R * acos(Float64(Float64(phi2 * sin(phi1)) + Float64(cos(lambda2) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(t_0 * cos(Float64(lambda1 - lambda2))) + Float64(phi1 * sin(phi2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi2) * cos(phi1);
tmp = 0.0;
if (phi1 <= -4e+84)
tmp = R * acos(((phi2 * sin(phi1)) + (cos(lambda2) * t_0)));
else
tmp = R * acos(((t_0 * cos((lambda1 - lambda2))) + (phi1 * sin(phi2))));
end
tmp_2 = tmp;
end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -4e+84], N[(R * N[ArcCos[N[(N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \phi_1\\
\mathbf{if}\;\phi_1 \leq -4 \cdot 10^{+84}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \sin \phi_1 + \cos \lambda_2 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -4.00000000000000023e84Initial program 78.8%
cos-diff99.1%
Applied egg-rr99.1%
cos-neg99.1%
*-commutative99.1%
fma-def99.1%
cos-neg99.1%
Simplified99.1%
Taylor expanded in phi2 around 0 53.3%
Taylor expanded in lambda1 around 0 34.0%
if -4.00000000000000023e84 < phi1 Initial program 72.4%
Taylor expanded in phi1 around 0 51.2%
Final simplification48.4%
NOTE: 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 phi2) (cos phi1)) (cos (- lambda1 lambda2)))))
(if (<= phi1 -2e+41)
(* R (acos (+ t_0 (* phi2 (sin phi1)))))
(* R (acos (+ t_0 (* phi1 (sin phi2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -2e+41) {
tmp = R * acos((t_0 + (phi2 * sin(phi1))));
} else {
tmp = R * acos((t_0 + (phi1 * sin(phi2))));
}
return tmp;
}
NOTE: 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(phi2) * cos(phi1)) * cos((lambda1 - lambda2))
if (phi1 <= (-2d+41)) then
tmp = r * acos((t_0 + (phi2 * sin(phi1))))
else
tmp = r * acos((t_0 + (phi1 * sin(phi2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (Math.cos(phi2) * Math.cos(phi1)) * Math.cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -2e+41) {
tmp = R * Math.acos((t_0 + (phi2 * Math.sin(phi1))));
} else {
tmp = R * Math.acos((t_0 + (phi1 * Math.sin(phi2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = (math.cos(phi2) * math.cos(phi1)) * math.cos((lambda1 - lambda2)) tmp = 0 if phi1 <= -2e+41: tmp = R * math.acos((t_0 + (phi2 * math.sin(phi1)))) else: tmp = R * math.acos((t_0 + (phi1 * math.sin(phi2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(cos(phi2) * cos(phi1)) * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi1 <= -2e+41) tmp = Float64(R * acos(Float64(t_0 + Float64(phi2 * sin(phi1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(phi1 * sin(phi2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = (cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2));
tmp = 0.0;
if (phi1 <= -2e+41)
tmp = R * acos((t_0 + (phi2 * sin(phi1))));
else
tmp = R * acos((t_0 + (phi1 * sin(phi2))));
end
tmp_2 = tmp;
end
NOTE: 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[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -2e+41], N[(R * N[ArcCos[N[(t$95$0 + N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -2 \cdot 10^{+41}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \phi_2 \cdot \sin \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \phi_1 \cdot \sin \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -2.00000000000000001e41Initial program 78.4%
Taylor expanded in phi2 around 0 42.9%
if -2.00000000000000001e41 < phi1 Initial program 72.4%
Taylor expanded in phi1 around 0 51.2%
Final simplification49.8%
NOTE: 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 phi2) (cos phi1))) (t_1 (* phi1 (sin phi2))))
(if (<= lambda2 1.35e-6)
(* R (acos (+ t_1 (* (cos lambda1) t_0))))
(* R (acos (+ t_1 (* (cos lambda2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos(phi1);
double t_1 = phi1 * sin(phi2);
double tmp;
if (lambda2 <= 1.35e-6) {
tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
} else {
tmp = R * acos((t_1 + (cos(lambda2) * t_0)));
}
return tmp;
}
NOTE: 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) :: t_1
real(8) :: tmp
t_0 = cos(phi2) * cos(phi1)
t_1 = phi1 * sin(phi2)
if (lambda2 <= 1.35d-6) then
tmp = r * acos((t_1 + (cos(lambda1) * t_0)))
else
tmp = r * acos((t_1 + (cos(lambda2) * t_0)))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi2) * Math.cos(phi1);
double t_1 = phi1 * Math.sin(phi2);
double tmp;
if (lambda2 <= 1.35e-6) {
tmp = R * Math.acos((t_1 + (Math.cos(lambda1) * t_0)));
} else {
tmp = R * Math.acos((t_1 + (Math.cos(lambda2) * t_0)));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi2) * math.cos(phi1) t_1 = phi1 * math.sin(phi2) tmp = 0 if lambda2 <= 1.35e-6: tmp = R * math.acos((t_1 + (math.cos(lambda1) * t_0))) else: tmp = R * math.acos((t_1 + (math.cos(lambda2) * t_0))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(phi1)) t_1 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda2 <= 1.35e-6) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(lambda1) * t_0)))); else tmp = Float64(R * acos(Float64(t_1 + Float64(cos(lambda2) * t_0)))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi2) * cos(phi1);
t_1 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda2 <= 1.35e-6)
tmp = R * acos((t_1 + (cos(lambda1) * t_0)));
else
tmp = R * acos((t_1 + (cos(lambda2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: 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[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 1.35e-6], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[lambda1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[lambda2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \phi_1\\
t_1 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 1.35 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \lambda_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \lambda_2 \cdot t_0\right)\\
\end{array}
\end{array}
if lambda2 < 1.34999999999999999e-6Initial program 76.4%
Taylor expanded in phi1 around 0 45.2%
Taylor expanded in lambda2 around 0 37.1%
if 1.34999999999999999e-6 < lambda2 Initial program 65.4%
Taylor expanded in phi1 around 0 44.5%
Taylor expanded in lambda1 around 0 44.3%
cos-neg29.1%
Simplified44.3%
Final simplification39.1%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -0.122)
(*
R
(acos (+ (* phi2 (sin phi1)) (* (cos lambda1) (* (cos phi2) (cos phi1))))))
(*
R
(acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos (- lambda1 lambda2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.122) {
tmp = R * acos(((phi2 * sin(phi1)) + (cos(lambda1) * (cos(phi2) * cos(phi1)))));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
}
return tmp;
}
NOTE: 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 (phi1 <= (-0.122d0)) then
tmp = r * acos(((phi2 * sin(phi1)) + (cos(lambda1) * (cos(phi2) * cos(phi1)))))
else
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.122) {
tmp = R * Math.acos(((phi2 * Math.sin(phi1)) + (Math.cos(lambda1) * (Math.cos(phi2) * Math.cos(phi1)))));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos((lambda1 - lambda2)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.122: tmp = R * math.acos(((phi2 * math.sin(phi1)) + (math.cos(lambda1) * (math.cos(phi2) * math.cos(phi1))))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos((lambda1 - lambda2))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.122) tmp = Float64(R * acos(Float64(Float64(phi2 * sin(phi1)) + Float64(cos(lambda1) * Float64(cos(phi2) * cos(phi1)))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(Float64(lambda1 - lambda2)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.122)
tmp = R * acos(((phi2 * sin(phi1)) + (cos(lambda1) * (cos(phi2) * cos(phi1)))));
else
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.122], N[(R * N[ArcCos[N[(N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.122:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \sin \phi_1 + \cos \lambda_1 \cdot \left(\cos \phi_2 \cdot \cos \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.122Initial program 80.8%
cos-diff98.7%
Applied egg-rr98.7%
cos-neg98.7%
*-commutative98.7%
fma-def98.7%
cos-neg98.7%
Simplified98.7%
Taylor expanded in phi2 around 0 56.4%
Taylor expanded in lambda2 around 0 36.6%
if -0.122 < phi1 Initial program 71.6%
Taylor expanded in phi1 around 0 50.8%
Taylor expanded in phi1 around 0 47.4%
Final simplification45.3%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -0.115)
(*
R
(acos (+ (* phi2 (sin phi1)) (* (cos lambda2) (* (cos phi2) (cos phi1))))))
(*
R
(acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos (- lambda1 lambda2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.115) {
tmp = R * acos(((phi2 * sin(phi1)) + (cos(lambda2) * (cos(phi2) * cos(phi1)))));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
}
return tmp;
}
NOTE: 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 (phi1 <= (-0.115d0)) then
tmp = r * acos(((phi2 * sin(phi1)) + (cos(lambda2) * (cos(phi2) * cos(phi1)))))
else
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.115) {
tmp = R * Math.acos(((phi2 * Math.sin(phi1)) + (Math.cos(lambda2) * (Math.cos(phi2) * Math.cos(phi1)))));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos((lambda1 - lambda2)))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.115: tmp = R * math.acos(((phi2 * math.sin(phi1)) + (math.cos(lambda2) * (math.cos(phi2) * math.cos(phi1))))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos((lambda1 - lambda2))))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.115) tmp = Float64(R * acos(Float64(Float64(phi2 * sin(phi1)) + Float64(cos(lambda2) * Float64(cos(phi2) * cos(phi1)))))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(Float64(lambda1 - lambda2)))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.115)
tmp = R * acos(((phi2 * sin(phi1)) + (cos(lambda2) * (cos(phi2) * cos(phi1)))));
else
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.115], N[(R * N[ArcCos[N[(N[(phi2 * N[Sin[phi1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.115:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \sin \phi_1 + \cos \lambda_2 \cdot \left(\cos \phi_2 \cdot \cos \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.115000000000000005Initial program 80.8%
cos-diff98.7%
Applied egg-rr98.7%
cos-neg98.7%
*-commutative98.7%
fma-def98.7%
cos-neg98.7%
Simplified98.7%
Taylor expanded in phi2 around 0 56.4%
Taylor expanded in lambda1 around 0 34.9%
if -0.115000000000000005 < phi1 Initial program 71.6%
Taylor expanded in phi1 around 0 50.8%
Taylor expanded in phi1 around 0 47.4%
Final simplification44.9%
NOTE: 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 -0.11)
(* R (acos (+ (* phi2 phi1) (* (cos phi1) t_0))))
(* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) t_0)))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -0.11) {
tmp = R * acos(((phi2 * phi1) + (cos(phi1) * t_0)));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: 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 <= (-0.11d0)) then
tmp = r * acos(((phi2 * phi1) + (cos(phi1) * t_0)))
else
tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)))
end if
code = tmp
end function
assert 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 <= -0.11) {
tmp = R * Math.acos(((phi2 * phi1) + (Math.cos(phi1) * t_0)));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * t_0)));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) tmp = 0 if phi1 <= -0.11: tmp = R * math.acos(((phi2 * phi1) + (math.cos(phi1) * t_0))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * t_0))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi1 <= -0.11) tmp = Float64(R * acos(Float64(Float64(phi2 * phi1) + Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * t_0)))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda1 - lambda2));
tmp = 0.0;
if (phi1 <= -0.11)
tmp = R * acos(((phi2 * phi1) + (cos(phi1) * t_0)));
else
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: 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, -0.11], N[(R * N[ArcCos[N[(N[(phi2 * phi1), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -0.11:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \phi_1 + \cos \phi_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
if phi1 < -0.110000000000000001Initial program 80.8%
Taylor expanded in phi1 around 0 21.9%
Taylor expanded in phi2 around 0 21.9%
Taylor expanded in phi2 around 0 21.9%
*-commutative21.9%
Simplified21.9%
if -0.110000000000000001 < phi1 Initial program 71.6%
Taylor expanded in phi1 around 0 50.8%
Taylor expanded in phi1 around 0 47.4%
Final simplification42.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= lambda2 2.5e-5)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi1) (cos lambda2))))))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (lambda2 <= 2.5e-5) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: 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 = phi1 * sin(phi2)
if (lambda2 <= 2.5d-5) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (lambda2 <= 2.5e-5) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda2 <= 2.5e-5: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda2 <= 2.5e-5) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda2 <= 2.5e-5)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 2.5e-5], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 2.5 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 2.50000000000000012e-5Initial program 76.4%
Taylor expanded in phi1 around 0 45.2%
Taylor expanded in phi2 around 0 25.6%
Taylor expanded in lambda2 around 0 20.2%
if 2.50000000000000012e-5 < lambda2 Initial program 65.4%
Taylor expanded in phi1 around 0 44.5%
Taylor expanded in phi2 around 0 29.4%
Taylor expanded in lambda1 around 0 29.1%
cos-neg29.1%
Simplified29.1%
Final simplification22.6%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi1) (cos (- lambda1 lambda2)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda1 - lambda2)))));
}
NOTE: 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 = r * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda1 - lambda2)))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos((lambda1 - lambda2)))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi1) * math.cos((lambda1 - lambda2)))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * cos(Float64(lambda1 - lambda2)))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda1 - lambda2)))));
end
NOTE: 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[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)
\end{array}
Initial program 73.4%
Taylor expanded in phi1 around 0 45.0%
Taylor expanded in phi2 around 0 26.6%
Final simplification26.6%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.11) (* R (acos (+ (* phi2 phi1) (* (cos phi1) (cos lambda2))))) (* R (acos (+ (cos (- lambda1 lambda2)) (* phi2 phi1))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.11) {
tmp = R * acos(((phi2 * phi1) + (cos(phi1) * cos(lambda2))));
} else {
tmp = R * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)));
}
return tmp;
}
NOTE: 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 (phi1 <= (-0.11d0)) then
tmp = r * acos(((phi2 * phi1) + (cos(phi1) * cos(lambda2))))
else
tmp = r * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.11) {
tmp = R * Math.acos(((phi2 * phi1) + (Math.cos(phi1) * Math.cos(lambda2))));
} else {
tmp = R * Math.acos((Math.cos((lambda1 - lambda2)) + (phi2 * phi1)));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.11: tmp = R * math.acos(((phi2 * phi1) + (math.cos(phi1) * math.cos(lambda2)))) else: tmp = R * math.acos((math.cos((lambda1 - lambda2)) + (phi2 * phi1))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.11) tmp = Float64(R * acos(Float64(Float64(phi2 * phi1) + Float64(cos(phi1) * cos(lambda2))))); else tmp = Float64(R * acos(Float64(cos(Float64(lambda1 - lambda2)) + Float64(phi2 * phi1)))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.11)
tmp = R * acos(((phi2 * phi1) + (cos(phi1) * cos(lambda2))));
else
tmp = R * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.11], N[(R * N[ArcCos[N[(N[(phi2 * phi1), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.11:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \phi_1 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) + \phi_2 \cdot \phi_1\right)\\
\end{array}
\end{array}
if phi1 < -0.110000000000000001Initial program 80.8%
Taylor expanded in phi1 around 0 21.9%
Taylor expanded in phi2 around 0 21.9%
Taylor expanded in phi2 around 0 21.9%
*-commutative21.9%
Simplified21.9%
Taylor expanded in lambda1 around 0 16.1%
cos-neg16.1%
*-commutative16.1%
Simplified16.1%
if -0.110000000000000001 < phi1 Initial program 71.6%
Taylor expanded in phi1 around 0 50.8%
Taylor expanded in phi2 around 0 27.8%
Taylor expanded in phi2 around 0 25.1%
*-commutative25.1%
Simplified25.1%
Taylor expanded in phi1 around 0 21.8%
Final simplification20.7%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 7e-6) (* R (acos (+ (* phi2 phi1) (* (cos phi1) (cos lambda1))))) (* R (acos (+ (* phi2 phi1) (* (cos phi1) (cos lambda2)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 7e-6) {
tmp = R * acos(((phi2 * phi1) + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos(((phi2 * phi1) + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: 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 <= 7d-6) then
tmp = r * acos(((phi2 * phi1) + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos(((phi2 * phi1) + (cos(phi1) * cos(lambda2))))
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 7e-6) {
tmp = R * Math.acos(((phi2 * phi1) + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos(((phi2 * phi1) + (Math.cos(phi1) * Math.cos(lambda2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 7e-6: tmp = R * math.acos(((phi2 * phi1) + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos(((phi2 * phi1) + (math.cos(phi1) * math.cos(lambda2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 7e-6) tmp = Float64(R * acos(Float64(Float64(phi2 * phi1) + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(Float64(phi2 * phi1) + Float64(cos(phi1) * cos(lambda2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 7e-6)
tmp = R * acos(((phi2 * phi1) + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos(((phi2 * phi1) + (cos(phi1) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 7e-6], N[(R * N[ArcCos[N[(N[(phi2 * phi1), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi2 * phi1), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 7 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \phi_1 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_2 \cdot \phi_1 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 6.99999999999999989e-6Initial program 76.4%
Taylor expanded in phi1 around 0 45.2%
Taylor expanded in phi2 around 0 25.6%
Taylor expanded in phi2 around 0 23.7%
*-commutative23.7%
Simplified23.7%
Taylor expanded in lambda2 around 0 18.5%
if 6.99999999999999989e-6 < lambda2 Initial program 65.4%
Taylor expanded in phi1 around 0 44.5%
Taylor expanded in phi2 around 0 29.4%
Taylor expanded in phi2 around 0 26.7%
*-commutative26.7%
Simplified26.7%
Taylor expanded in lambda1 around 0 26.3%
cos-neg26.3%
*-commutative26.3%
Simplified26.3%
Final simplification20.6%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* phi2 phi1) (* (cos phi1) (cos (- lambda1 lambda2)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi2 * phi1) + (cos(phi1) * cos((lambda1 - lambda2)))));
}
NOTE: 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 = r * acos(((phi2 * phi1) + (cos(phi1) * cos((lambda1 - lambda2)))))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi2 * phi1) + (Math.cos(phi1) * Math.cos((lambda1 - lambda2)))));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi2 * phi1) + (math.cos(phi1) * math.cos((lambda1 - lambda2)))))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi2 * phi1) + Float64(cos(phi1) * cos(Float64(lambda1 - lambda2)))))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi2 * phi1) + (cos(phi1) * cos((lambda1 - lambda2)))));
end
NOTE: 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[(phi2 * phi1), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\phi_2 \cdot \phi_1 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)
\end{array}
Initial program 73.4%
Taylor expanded in phi1 around 0 45.0%
Taylor expanded in phi2 around 0 26.6%
Taylor expanded in phi2 around 0 24.5%
*-commutative24.5%
Simplified24.5%
Final simplification24.5%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (cos (- lambda1 lambda2)) (* phi2 phi1)))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)));
}
NOTE: 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 = r * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)))
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos((Math.cos((lambda1 - lambda2)) + (phi2 * phi1)));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos((math.cos((lambda1 - lambda2)) + (phi2 * phi1)))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(cos(Float64(lambda1 - lambda2)) + Float64(phi2 * phi1)))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos((cos((lambda1 - lambda2)) + (phi2 * phi1)));
end
NOTE: 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[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + N[(phi2 * phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) + \phi_2 \cdot \phi_1\right)
\end{array}
Initial program 73.4%
Taylor expanded in phi1 around 0 45.0%
Taylor expanded in phi2 around 0 26.6%
Taylor expanded in phi2 around 0 24.5%
*-commutative24.5%
Simplified24.5%
Taylor expanded in phi1 around 0 18.3%
Final simplification18.3%
herbie shell --seed 2023178
(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))