
(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 30 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= (+ t_0 (* t_1 (cos (- lambda1 lambda2)))) 0.9999983)
(*
(acos
(+
t_0
(*
t_1
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))
R)
(* R (- lambda2 lambda1)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if ((t_0 + (t_1 * cos((lambda1 - lambda2)))) <= 0.9999983) {
tmp = acos((t_0 + (t_1 * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))))) * R;
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (Float64(t_0 + Float64(t_1 * cos(Float64(lambda1 - lambda2)))) <= 0.9999983) tmp = Float64(acos(Float64(t_0 + Float64(t_1 * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))) * R); else tmp = Float64(R * Float64(lambda2 - lambda1)); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 + N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.9999983], N[(N[ArcCos[N[(t$95$0 + 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] * R), $MachinePrecision], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;t\_0 + t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right) \leq 0.9999983:\\
\;\;\;\;\cos^{-1} \left(t\_0 + t\_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) < 0.999998300000000007Initial program 80.0%
cos-diff99.2%
distribute-lft-in99.2%
*-commutative99.2%
*-commutative99.2%
Applied egg-rr99.2%
distribute-lft-out99.2%
fma-define99.2%
Simplified99.2%
if 0.999998300000000007 < (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) Initial program 17.2%
*-commutative17.2%
*-commutative17.2%
*-commutative17.2%
*-commutative17.2%
*-commutative17.2%
cos-neg17.2%
sub-neg17.2%
+-commutative17.2%
distribute-neg-out17.2%
remove-double-neg17.2%
sub-neg17.2%
Simplified17.2%
Taylor expanded in phi2 around 0 17.2%
Taylor expanded in phi1 around 0 17.2%
Taylor expanded in R around 0 39.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= (+ t_0 (* t_1 (cos (- lambda1 lambda2)))) 0.9999983)
(*
R
(acos
(fma
t_1
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1)))
t_0)))
(* R (- lambda2 lambda1)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if ((t_0 + (t_1 * cos((lambda1 - lambda2)))) <= 0.9999983) {
tmp = R * acos(fma(t_1, ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))), t_0));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (Float64(t_0 + Float64(t_1 * cos(Float64(lambda1 - lambda2)))) <= 0.9999983) tmp = Float64(R * acos(fma(t_1, Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))), t_0))); else tmp = Float64(R * Float64(lambda2 - lambda1)); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 + N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.9999983], N[(R * N[ArcCos[N[(t$95$1 * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;t\_0 + t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right) \leq 0.9999983:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(t\_1, \sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1, t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) < 0.999998300000000007Initial program 80.0%
*-commutative80.0%
*-commutative80.0%
*-commutative80.0%
*-commutative80.0%
*-commutative80.0%
cos-neg80.0%
sub-neg80.0%
+-commutative80.0%
distribute-neg-out80.0%
remove-double-neg80.0%
sub-neg80.0%
Simplified80.0%
cos-diff99.2%
+-commutative99.2%
Applied egg-rr99.2%
if 0.999998300000000007 < (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) Initial program 17.2%
*-commutative17.2%
*-commutative17.2%
*-commutative17.2%
*-commutative17.2%
*-commutative17.2%
cos-neg17.2%
sub-neg17.2%
+-commutative17.2%
distribute-neg-out17.2%
remove-double-neg17.2%
sub-neg17.2%
Simplified17.2%
Taylor expanded in phi2 around 0 17.2%
Taylor expanded in phi1 around 0 17.2%
Taylor expanded in R around 0 39.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<=
(+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))
0.9999983)
(*
R
(acos
(+
t_0
(*
(cos phi1)
(*
(cos phi2)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1))))))))
(* R (- lambda2 lambda1)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if ((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))) <= 0.9999983) {
tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if ((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))) <= 0.9999983d0) then
tmp = r * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))))
else
tmp = r * (lambda2 - lambda1)
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if ((t_0 + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))) <= 0.9999983) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1)))))));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if (t_0 + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2)))) <= 0.9999983: tmp = R * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * ((math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1))))))) else: tmp = R * (lambda2 - lambda1) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))) <= 0.9999983) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))))))); else tmp = Float64(R * Float64(lambda2 - lambda1)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if ((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))) <= 0.9999983)
tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))));
else
tmp = R * (lambda2 - lambda1);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.9999983], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;t\_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right) \leq 0.9999983:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) < 0.999998300000000007Initial program 80.0%
cos-diff99.2%
distribute-lft-in99.2%
*-commutative99.2%
*-commutative99.2%
Applied egg-rr99.2%
distribute-lft-out99.2%
fma-define99.2%
Simplified99.2%
Taylor expanded in phi1 around inf 99.2%
if 0.999998300000000007 < (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) Initial program 17.2%
*-commutative17.2%
*-commutative17.2%
*-commutative17.2%
*-commutative17.2%
*-commutative17.2%
cos-neg17.2%
sub-neg17.2%
+-commutative17.2%
distribute-neg-out17.2%
remove-double-neg17.2%
sub-neg17.2%
Simplified17.2%
Taylor expanded in phi2 around 0 17.2%
Taylor expanded in phi1 around 0 17.2%
Taylor expanded in R around 0 39.7%
Final simplification94.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= phi1 -2.8e-6)
(* R (acos (fma t_1 (cos (- lambda2 lambda1)) t_0)))
(if (<= phi1 1.16e-6)
(*
R
(acos
(+
t_0
(*
(cos phi2)
(fma
(cos lambda2)
(cos lambda1)
(* (sin lambda2) (sin lambda1)))))))
(*
R
(acos (+ t_0 (* (cos (- lambda1 lambda2)) (log1p (expm1 t_1))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (phi1 <= -2.8e-6) {
tmp = R * acos(fma(t_1, cos((lambda2 - lambda1)), t_0));
} else if (phi1 <= 1.16e-6) {
tmp = R * acos((t_0 + (cos(phi2) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1))))));
} else {
tmp = R * acos((t_0 + (cos((lambda1 - lambda2)) * log1p(expm1(t_1)))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi1 <= -2.8e-6) tmp = Float64(R * acos(fma(t_1, cos(Float64(lambda2 - lambda1)), t_0))); elseif (phi1 <= 1.16e-6) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1))))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(Float64(lambda1 - lambda2)) * log1p(expm1(t_1)))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -2.8e-6], N[(R * N[ArcCos[N[(t$95$1 * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.16e-6], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $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[(t$95$0 + N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[Log[1 + N[(Exp[t$95$1] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_1 \leq -2.8 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(t\_1, \cos \left(\lambda_2 - \lambda_1\right), t\_0\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 1.16 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_2 \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(t\_0 + \cos \left(\lambda_1 - \lambda_2\right) \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(t\_1\right)\right)\right)\\
\end{array}
\end{array}
if phi1 < -2.79999999999999987e-6Initial program 81.1%
*-commutative81.1%
*-commutative81.1%
*-commutative81.1%
*-commutative81.1%
*-commutative81.1%
cos-neg81.1%
sub-neg81.1%
+-commutative81.1%
distribute-neg-out81.1%
remove-double-neg81.1%
sub-neg81.1%
Simplified81.2%
if -2.79999999999999987e-6 < phi1 < 1.1599999999999999e-6Initial program 71.8%
cos-diff87.9%
distribute-lft-in87.9%
*-commutative87.9%
*-commutative87.9%
Applied egg-rr87.9%
distribute-lft-out87.9%
fma-define87.9%
Simplified87.9%
Taylor expanded in phi1 around 0 87.8%
if 1.1599999999999999e-6 < phi1 Initial program 77.5%
log1p-expm1-u77.5%
Applied egg-rr77.5%
Final simplification83.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= phi1 -3.6e-6)
(* R (acos (fma t_1 (cos (- lambda2 lambda1)) t_0)))
(if (<= phi1 8.4e-7)
(*
R
(acos
(+
t_0
(*
(cos phi2)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))
(*
R
(acos (+ t_0 (* (cos (- lambda1 lambda2)) (log1p (expm1 t_1))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (phi1 <= -3.6e-6) {
tmp = R * acos(fma(t_1, cos((lambda2 - lambda1)), t_0));
} else if (phi1 <= 8.4e-7) {
tmp = R * acos((t_0 + (cos(phi2) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))));
} else {
tmp = R * acos((t_0 + (cos((lambda1 - lambda2)) * log1p(expm1(t_1)))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi1 <= -3.6e-6) tmp = Float64(R * acos(fma(t_1, cos(Float64(lambda2 - lambda1)), t_0))); elseif (phi1 <= 8.4e-7) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(Float64(lambda1 - lambda2)) * log1p(expm1(t_1)))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -3.6e-6], N[(R * N[ArcCos[N[(t$95$1 * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 8.4e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[Log[1 + N[(Exp[t$95$1] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_1 \leq -3.6 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(t\_1, \cos \left(\lambda_2 - \lambda_1\right), t\_0\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 8.4 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_2 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \left(\lambda_1 - \lambda_2\right) \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(t\_1\right)\right)\right)\\
\end{array}
\end{array}
if phi1 < -3.59999999999999984e-6Initial program 81.1%
*-commutative81.1%
*-commutative81.1%
*-commutative81.1%
*-commutative81.1%
*-commutative81.1%
cos-neg81.1%
sub-neg81.1%
+-commutative81.1%
distribute-neg-out81.1%
remove-double-neg81.1%
sub-neg81.1%
Simplified81.2%
if -3.59999999999999984e-6 < phi1 < 8.4e-7Initial program 71.8%
cos-diff87.9%
distribute-lft-in87.9%
*-commutative87.9%
*-commutative87.9%
Applied egg-rr87.9%
distribute-lft-out87.9%
fma-define87.9%
Simplified87.9%
Taylor expanded in phi1 around 0 87.7%
if 8.4e-7 < phi1 Initial program 77.5%
log1p-expm1-u77.5%
Applied egg-rr77.5%
Final simplification83.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= phi2 -240.0)
(* R (acos (fma t_1 (cos (- lambda2 lambda1)) t_0)))
(if (<= phi2 2.45e-7)
(*
R
(acos
(+
t_0
(*
(cos phi1)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))
(*
R
(acos
(+
(* t_1 (cos (- lambda1 lambda2)))
(* (sin phi2) (expm1 (log1p (sin phi1)))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (phi2 <= -240.0) {
tmp = R * acos(fma(t_1, cos((lambda2 - lambda1)), t_0));
} else if (phi2 <= 2.45e-7) {
tmp = R * acos((t_0 + (cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))));
} else {
tmp = R * acos(((t_1 * cos((lambda1 - lambda2))) + (sin(phi2) * expm1(log1p(sin(phi1))))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi2 <= -240.0) tmp = Float64(R * acos(fma(t_1, cos(Float64(lambda2 - lambda1)), t_0))); elseif (phi2 <= 2.45e-7) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))); else tmp = Float64(R * acos(Float64(Float64(t_1 * cos(Float64(lambda1 - lambda2))) + Float64(sin(phi2) * expm1(log1p(sin(phi1))))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -240.0], N[(R * N[ArcCos[N[(t$95$1 * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2.45e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi2], $MachinePrecision] * N[(Exp[N[Log[1 + N[Sin[phi1], $MachinePrecision]], $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_2 \leq -240:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(t\_1, \cos \left(\lambda_2 - \lambda_1\right), t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 2.45 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \sin \phi_2 \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\sin \phi_1\right)\right)\right)\\
\end{array}
\end{array}
if phi2 < -240Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
cos-neg85.4%
sub-neg85.4%
+-commutative85.4%
distribute-neg-out85.4%
remove-double-neg85.4%
sub-neg85.4%
Simplified85.4%
if -240 < phi2 < 2.4499999999999998e-7Initial program 69.4%
cos-diff86.5%
distribute-lft-in86.5%
*-commutative86.5%
*-commutative86.5%
Applied egg-rr86.5%
distribute-lft-out86.5%
fma-define86.5%
Simplified86.5%
Taylor expanded in phi2 around 0 86.5%
if 2.4499999999999998e-7 < phi2 Initial program 74.0%
expm1-log1p-u74.0%
expm1-undefine74.0%
Applied egg-rr74.0%
expm1-define74.0%
Simplified74.0%
Final simplification83.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))))
(if (<= phi2 -3.45e-12)
(* R (acos (fma t_0 (cos (- lambda2 lambda1)) (* (sin phi1) (sin phi2)))))
(if (<= phi2 3.45e-9)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))
(*
R
(acos
(+
(* t_0 (cos (- lambda1 lambda2)))
(* (sin phi2) (expm1 (log1p (sin phi1)))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double tmp;
if (phi2 <= -3.45e-12) {
tmp = R * acos(fma(t_0, cos((lambda2 - lambda1)), (sin(phi1) * sin(phi2))));
} else if (phi2 <= 3.45e-9) {
tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R * acos(((t_0 * cos((lambda1 - lambda2))) + (sin(phi2) * expm1(log1p(sin(phi1))))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi2 <= -3.45e-12) tmp = Float64(R * acos(fma(t_0, cos(Float64(lambda2 - lambda1)), Float64(sin(phi1) * sin(phi2))))); elseif (phi2 <= 3.45e-9) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(t_0 * cos(Float64(lambda1 - lambda2))) + Float64(sin(phi2) * expm1(log1p(sin(phi1))))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -3.45e-12], N[(R * N[ArcCos[N[(t$95$0 * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3.45e-9], N[(R * N[ArcCos[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], N[(R * N[ArcCos[N[(N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi2], $MachinePrecision] * N[(Exp[N[Log[1 + N[Sin[phi1], $MachinePrecision]], $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_2 \leq -3.45 \cdot 10^{-12}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(t\_0, \cos \left(\lambda_2 - \lambda_1\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 3.45 \cdot 10^{-9}:\\
\;\;\;\;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)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \sin \phi_2 \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\sin \phi_1\right)\right)\right)\\
\end{array}
\end{array}
if phi2 < -3.45e-12Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
cos-neg85.4%
sub-neg85.4%
+-commutative85.4%
distribute-neg-out85.4%
remove-double-neg85.4%
sub-neg85.4%
Simplified85.4%
if -3.45e-12 < phi2 < 3.44999999999999987e-9Initial program 69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
cos-neg69.4%
sub-neg69.4%
+-commutative69.4%
distribute-neg-out69.4%
remove-double-neg69.4%
sub-neg69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
cos-diff86.5%
Applied egg-rr86.5%
fma-define86.5%
Simplified86.5%
if 3.44999999999999987e-9 < phi2 Initial program 74.0%
expm1-log1p-u74.0%
expm1-undefine74.0%
Applied egg-rr74.0%
expm1-define74.0%
Simplified74.0%
Final simplification83.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi2 -7.5e-12)
(* R (acos (fma (* (cos phi1) (cos phi2)) t_0 t_1)))
(if (<= phi2 7e-9)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))
(*
R
(-
(/ PI 2.0)
(- (* PI 0.5) (acos (fma (cos phi1) (* (cos phi2) t_0) t_1)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -7.5e-12) {
tmp = R * acos(fma((cos(phi1) * cos(phi2)), t_0, t_1));
} else if (phi2 <= 7e-9) {
tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R * ((((double) M_PI) / 2.0) - ((((double) M_PI) * 0.5) - acos(fma(cos(phi1), (cos(phi2) * t_0), t_1))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -7.5e-12) tmp = Float64(R * acos(fma(Float64(cos(phi1) * cos(phi2)), t_0, t_1))); elseif (phi2 <= 7e-9) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R * Float64(Float64(pi / 2.0) - Float64(Float64(pi * 0.5) - acos(fma(cos(phi1), Float64(cos(phi2) * t_0), t_1))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -7.5e-12], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 7e-9], N[(R * N[ArcCos[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], N[(R * N[(N[(Pi / 2.0), $MachinePrecision] - N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -7.5 \cdot 10^{-12}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, t\_0, t\_1\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 7 \cdot 10^{-9}:\\
\;\;\;\;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)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\frac{\pi}{2} - \left(\pi \cdot 0.5 - \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot t\_0, t\_1\right)\right)\right)\right)\\
\end{array}
\end{array}
if phi2 < -7.5e-12Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
cos-neg85.4%
sub-neg85.4%
+-commutative85.4%
distribute-neg-out85.4%
remove-double-neg85.4%
sub-neg85.4%
Simplified85.4%
if -7.5e-12 < phi2 < 6.9999999999999998e-9Initial program 69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
cos-neg69.4%
sub-neg69.4%
+-commutative69.4%
distribute-neg-out69.4%
remove-double-neg69.4%
sub-neg69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
cos-diff86.5%
Applied egg-rr86.5%
fma-define86.5%
Simplified86.5%
if 6.9999999999999998e-9 < phi2 Initial program 74.0%
log1p-expm1-u73.9%
Applied egg-rr73.9%
acos-asin73.8%
+-commutative73.8%
log1p-expm1-u73.8%
fma-define73.9%
Applied egg-rr73.9%
fma-undefine73.8%
associate-*r*73.9%
fma-define73.9%
Simplified73.9%
asin-acos74.0%
div-inv74.0%
metadata-eval74.0%
cos-diff99.3%
*-commutative99.3%
*-commutative99.3%
cos-diff74.0%
Applied egg-rr74.0%
Final simplification83.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= phi2 -3e-9)
(* R (acos (fma t_1 (cos (- lambda2 lambda1)) t_0)))
(if (<= phi2 4.1e-9)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))
(* R (acos (+ t_0 (* t_1 (cos (- lambda1 lambda2))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (phi2 <= -3e-9) {
tmp = R * acos(fma(t_1, cos((lambda2 - lambda1)), t_0));
} else if (phi2 <= 4.1e-9) {
tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R * acos((t_0 + (t_1 * cos((lambda1 - lambda2)))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi2 <= -3e-9) tmp = Float64(R * acos(fma(t_1, cos(Float64(lambda2 - lambda1)), t_0))); elseif (phi2 <= 4.1e-9) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(t_1 * cos(Float64(lambda1 - lambda2)))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -3e-9], N[(R * N[ArcCos[N[(t$95$1 * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 4.1e-9], N[(R * N[ArcCos[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], N[(R * N[ArcCos[N[(t$95$0 + N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_2 \leq -3 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(t\_1, \cos \left(\lambda_2 - \lambda_1\right), t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 4.1 \cdot 10^{-9}:\\
\;\;\;\;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)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -2.99999999999999998e-9Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
cos-neg85.4%
sub-neg85.4%
+-commutative85.4%
distribute-neg-out85.4%
remove-double-neg85.4%
sub-neg85.4%
Simplified85.4%
if -2.99999999999999998e-9 < phi2 < 4.1000000000000003e-9Initial program 69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
cos-neg69.4%
sub-neg69.4%
+-commutative69.4%
distribute-neg-out69.4%
remove-double-neg69.4%
sub-neg69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
cos-diff86.5%
Applied egg-rr86.5%
fma-define86.5%
Simplified86.5%
if 4.1000000000000003e-9 < phi2 Initial program 74.0%
Final simplification83.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (cos (- lambda1 lambda2))))
(if (<= phi2 -9.2e-9)
(* R (- (/ PI 2.0) (asin (+ t_0 (* (cos phi1) (* (cos phi2) t_1))))))
(if (<= phi2 1.72e-9)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))
(* R (acos (+ t_0 (* (* (cos phi1) (cos phi2)) t_1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -9.2e-9) {
tmp = R * ((((double) M_PI) / 2.0) - asin((t_0 + (cos(phi1) * (cos(phi2) * t_1)))));
} else if (phi2 <= 1.72e-9) {
tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R * acos((t_0 + ((cos(phi1) * cos(phi2)) * t_1)));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -9.2e-9) tmp = Float64(R * Float64(Float64(pi / 2.0) - asin(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * t_1)))))); elseif (phi2 <= 1.72e-9) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * t_1)))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -9.2e-9], N[(R * N[(N[(Pi / 2.0), $MachinePrecision] - N[ArcSin[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.72e-9], N[(R * N[ArcCos[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], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -9.2 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \left(\frac{\pi}{2} - \sin^{-1} \left(t\_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t\_1\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.72 \cdot 10^{-9}:\\
\;\;\;\;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)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot t\_1\right)\\
\end{array}
\end{array}
if phi2 < -9.1999999999999997e-9Initial program 85.4%
log1p-expm1-u85.4%
Applied egg-rr85.4%
acos-asin85.2%
+-commutative85.2%
log1p-expm1-u85.2%
fma-define85.3%
Applied egg-rr85.3%
fma-undefine85.2%
associate-*r*85.2%
fma-define85.3%
Simplified85.3%
Taylor expanded in phi1 around 0 85.2%
if -9.1999999999999997e-9 < phi2 < 1.72000000000000006e-9Initial program 69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
cos-neg69.4%
sub-neg69.4%
+-commutative69.4%
distribute-neg-out69.4%
remove-double-neg69.4%
sub-neg69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
cos-diff86.5%
Applied egg-rr86.5%
fma-define86.5%
Simplified86.5%
if 1.72000000000000006e-9 < phi2 Initial program 74.0%
Final simplification83.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos lambda2)))))))
(if (<= phi2 -3.4e-7)
t_0
(if (<= phi2 1250.0)
(*
R
(acos
(*
(cos phi1)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1))))))
(if (<= phi2 4.7e+196)
(* R (acos (* (cos phi2) (cos (- lambda2 lambda1)))))
t_0)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
double tmp;
if (phi2 <= -3.4e-7) {
tmp = t_0;
} else if (phi2 <= 1250.0) {
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
} else if (phi2 <= 4.7e+196) {
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
} else {
tmp = t_0;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda2))))
if (phi2 <= (-3.4d-7)) then
tmp = t_0
else if (phi2 <= 1250.0d0) then
tmp = r * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))
else if (phi2 <= 4.7d+196) then
tmp = r * acos((cos(phi2) * cos((lambda2 - lambda1))))
else
tmp = t_0
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos(lambda2))));
double tmp;
if (phi2 <= -3.4e-7) {
tmp = t_0;
} else if (phi2 <= 1250.0) {
tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
} else if (phi2 <= 4.7e+196) {
tmp = R * Math.acos((Math.cos(phi2) * Math.cos((lambda2 - lambda1))));
} else {
tmp = t_0;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos(lambda2)))) tmp = 0 if phi2 <= -3.4e-7: tmp = t_0 elif phi2 <= 1250.0: tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1))))) elif phi2 <= 4.7e+196: tmp = R * math.acos((math.cos(phi2) * math.cos((lambda2 - lambda1)))) else: tmp = t_0 return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda2))))) tmp = 0.0 if (phi2 <= -3.4e-7) tmp = t_0; elseif (phi2 <= 1250.0) tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))))); elseif (phi2 <= 4.7e+196) tmp = Float64(R * acos(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))); else tmp = t_0; end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
tmp = 0.0;
if (phi2 <= -3.4e-7)
tmp = t_0;
elseif (phi2 <= 1250.0)
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
elseif (phi2 <= 4.7e+196)
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * 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[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -3.4e-7], t$95$0, If[LessEqual[phi2, 1250.0], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 4.7e+196], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -3.4 \cdot 10^{-7}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 1250:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 4.7 \cdot 10^{+196}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi2 < -3.39999999999999974e-7 or 4.7000000000000003e196 < phi2 Initial program 84.2%
*-commutative84.2%
*-commutative84.2%
*-commutative84.2%
*-commutative84.2%
*-commutative84.2%
cos-neg84.2%
sub-neg84.2%
+-commutative84.2%
distribute-neg-out84.2%
remove-double-neg84.2%
sub-neg84.2%
Simplified84.2%
Taylor expanded in lambda1 around 0 66.9%
if -3.39999999999999974e-7 < phi2 < 1250Initial program 69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
cos-neg69.4%
sub-neg69.4%
+-commutative69.4%
distribute-neg-out69.4%
remove-double-neg69.4%
sub-neg69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
cos-diff86.5%
+-commutative86.5%
Applied egg-rr86.5%
if 1250 < phi2 < 4.7000000000000003e196Initial program 71.5%
*-commutative71.5%
*-commutative71.5%
*-commutative71.5%
*-commutative71.5%
*-commutative71.5%
cos-neg71.5%
sub-neg71.5%
+-commutative71.5%
distribute-neg-out71.5%
remove-double-neg71.5%
sub-neg71.5%
Simplified71.5%
Taylor expanded in phi1 around 0 50.7%
Final simplification73.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -7.8e-12) (not (<= phi2 6.4e-9)))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))
(*
R
(acos
(*
(cos phi1)
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -7.8e-12) || !(phi2 <= 6.4e-9)) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
} else {
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if ((phi2 <= (-7.8d-12)) .or. (.not. (phi2 <= 6.4d-9))) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
else
tmp = r * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -7.8e-12) || !(phi2 <= 6.4e-9)) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))));
} else {
tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if (phi2 <= -7.8e-12) or not (phi2 <= 6.4e-9): tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) else: tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1))))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -7.8e-12) || !(phi2 <= 6.4e-9)) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))))); else tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if ((phi2 <= -7.8e-12) || ~((phi2 <= 6.4e-9)))
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
else
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -7.8e-12], N[Not[LessEqual[phi2, 6.4e-9]], $MachinePrecision]], N[(R * 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]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -7.8 \cdot 10^{-12} \lor \neg \left(\phi_2 \leq 6.4 \cdot 10^{-9}\right):\\
\;\;\;\;R \cdot \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)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -7.79999999999999988e-12 or 6.40000000000000023e-9 < phi2 Initial program 80.8%
if -7.79999999999999988e-12 < phi2 < 6.40000000000000023e-9Initial program 69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
cos-neg69.4%
sub-neg69.4%
+-commutative69.4%
distribute-neg-out69.4%
remove-double-neg69.4%
sub-neg69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
cos-diff86.5%
+-commutative86.5%
Applied egg-rr86.5%
Final simplification83.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (cos (- lambda1 lambda2))))
(if (<= phi2 -1.12e-7)
(* R (- (/ PI 2.0) (asin (+ t_0 (* (cos phi1) (* (cos phi2) t_1))))))
(if (<= phi2 9.4e-9)
(*
R
(acos
(*
(cos phi1)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1))))))
(* R (acos (+ t_0 (* (* (cos phi1) (cos phi2)) t_1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -1.12e-7) {
tmp = R * ((((double) M_PI) / 2.0) - asin((t_0 + (cos(phi1) * (cos(phi2) * t_1)))));
} else if (phi2 <= 9.4e-9) {
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
} else {
tmp = R * acos((t_0 + ((cos(phi1) * cos(phi2)) * t_1)));
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double t_1 = Math.cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -1.12e-7) {
tmp = R * ((Math.PI / 2.0) - Math.asin((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * t_1)))));
} else if (phi2 <= 9.4e-9) {
tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
} else {
tmp = R * Math.acos((t_0 + ((Math.cos(phi1) * Math.cos(phi2)) * t_1)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) t_1 = math.cos((lambda1 - lambda2)) tmp = 0 if phi2 <= -1.12e-7: tmp = R * ((math.pi / 2.0) - math.asin((t_0 + (math.cos(phi1) * (math.cos(phi2) * t_1))))) elif phi2 <= 9.4e-9: tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1))))) else: tmp = R * math.acos((t_0 + ((math.cos(phi1) * math.cos(phi2)) * t_1))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -1.12e-7) tmp = Float64(R * Float64(Float64(pi / 2.0) - asin(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * t_1)))))); elseif (phi2 <= 9.4e-9) tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * t_1)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
t_1 = cos((lambda1 - lambda2));
tmp = 0.0;
if (phi2 <= -1.12e-7)
tmp = R * ((pi / 2.0) - asin((t_0 + (cos(phi1) * (cos(phi2) * t_1)))));
elseif (phi2 <= 9.4e-9)
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
else
tmp = R * acos((t_0 + ((cos(phi1) * cos(phi2)) * t_1)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -1.12e-7], N[(R * N[(N[(Pi / 2.0), $MachinePrecision] - N[ArcSin[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 9.4e-9], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -1.12 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \left(\frac{\pi}{2} - \sin^{-1} \left(t\_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t\_1\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 9.4 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot t\_1\right)\\
\end{array}
\end{array}
if phi2 < -1.12e-7Initial program 85.4%
log1p-expm1-u85.4%
Applied egg-rr85.4%
acos-asin85.2%
+-commutative85.2%
log1p-expm1-u85.2%
fma-define85.3%
Applied egg-rr85.3%
fma-undefine85.2%
associate-*r*85.2%
fma-define85.3%
Simplified85.3%
Taylor expanded in phi1 around 0 85.2%
if -1.12e-7 < phi2 < 9.3999999999999998e-9Initial program 69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
cos-neg69.4%
sub-neg69.4%
+-commutative69.4%
distribute-neg-out69.4%
remove-double-neg69.4%
sub-neg69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
cos-diff86.5%
+-commutative86.5%
Applied egg-rr86.5%
if 9.3999999999999998e-9 < phi2 Initial program 74.0%
Final simplification83.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= lambda1 -2.8e-6)
(* R (acos (+ t_1 (* t_0 (cos lambda1)))))
(if (<= lambda1 1.08e-5)
(* R (acos (+ t_1 (* t_0 (cos lambda2)))))
(*
R
(acos
(*
(cos phi1)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (lambda1 <= -2.8e-6) {
tmp = R * acos((t_1 + (t_0 * cos(lambda1))));
} else if (lambda1 <= 1.08e-5) {
tmp = R * acos((t_1 + (t_0 * cos(lambda2))));
} else {
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos(phi1) * cos(phi2)
t_1 = sin(phi1) * sin(phi2)
if (lambda1 <= (-2.8d-6)) then
tmp = r * acos((t_1 + (t_0 * cos(lambda1))))
else if (lambda1 <= 1.08d-5) then
tmp = r * acos((t_1 + (t_0 * cos(lambda2))))
else
tmp = r * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi1) * Math.cos(phi2);
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda1 <= -2.8e-6) {
tmp = R * Math.acos((t_1 + (t_0 * Math.cos(lambda1))));
} else if (lambda1 <= 1.08e-5) {
tmp = R * Math.acos((t_1 + (t_0 * Math.cos(lambda2))));
} else {
tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi1) * math.cos(phi2) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda1 <= -2.8e-6: tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda1)))) elif lambda1 <= 1.08e-5: tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda2)))) else: tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1))))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda1 <= -2.8e-6) tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda1))))); elseif (lambda1 <= 1.08e-5) tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda2))))); else tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi1) * cos(phi2);
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda1 <= -2.8e-6)
tmp = R * acos((t_1 + (t_0 * cos(lambda1))));
elseif (lambda1 <= 1.08e-5)
tmp = R * acos((t_1 + (t_0 * cos(lambda2))));
else
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -2.8e-6], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, 1.08e-5], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -2.8 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_1 + t\_0 \cdot \cos \lambda_1\right)\\
\mathbf{elif}\;\lambda_1 \leq 1.08 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_1 + t\_0 \cdot \cos \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\end{array}
\end{array}
if lambda1 < -2.79999999999999987e-6Initial program 64.5%
Taylor expanded in lambda2 around 0 62.8%
if -2.79999999999999987e-6 < lambda1 < 1.07999999999999999e-5Initial program 87.4%
*-commutative87.4%
*-commutative87.4%
*-commutative87.4%
*-commutative87.4%
*-commutative87.4%
cos-neg87.4%
sub-neg87.4%
+-commutative87.4%
distribute-neg-out87.4%
remove-double-neg87.4%
sub-neg87.4%
Simplified87.4%
Taylor expanded in lambda1 around 0 87.4%
if 1.07999999999999999e-5 < lambda1 Initial program 60.8%
*-commutative60.8%
*-commutative60.8%
*-commutative60.8%
*-commutative60.8%
*-commutative60.8%
cos-neg60.8%
sub-neg60.8%
+-commutative60.8%
distribute-neg-out60.8%
remove-double-neg60.8%
sub-neg60.8%
Simplified60.8%
Taylor expanded in phi2 around 0 43.8%
cos-diff99.3%
+-commutative99.3%
Applied egg-rr61.3%
Final simplification75.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 -240.0)
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi1) (cos phi2)))))
(if (<= phi2 1250.0)
(*
R
(acos
(*
(cos phi1)
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1))))))
(* R (acos (* (cos phi2) (cos (- lambda2 lambda1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -240.0) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * cos(phi2))));
} else if (phi2 <= 1250.0) {
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
} else {
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -240.0) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * cos(phi2))))); elseif (phi2 <= 1250.0) tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))))); else tmp = Float64(R * acos(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -240.0], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1250.0], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -240:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \cos \phi_2\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1250:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -240Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
cos-neg85.4%
sub-neg85.4%
+-commutative85.4%
distribute-neg-out85.4%
remove-double-neg85.4%
sub-neg85.4%
Simplified85.4%
Taylor expanded in lambda2 around 0 67.1%
cos-neg67.1%
Simplified67.1%
Taylor expanded in lambda1 around 0 50.3%
+-commutative50.3%
fma-define50.3%
*-commutative50.3%
Simplified50.3%
if -240 < phi2 < 1250Initial program 69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
*-commutative69.4%
cos-neg69.4%
sub-neg69.4%
+-commutative69.4%
distribute-neg-out69.4%
remove-double-neg69.4%
sub-neg69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
cos-diff86.5%
+-commutative86.5%
Applied egg-rr86.5%
if 1250 < phi2 Initial program 74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
cos-neg74.0%
sub-neg74.0%
+-commutative74.0%
distribute-neg-out74.0%
remove-double-neg74.0%
sub-neg74.0%
Simplified74.0%
Taylor expanded in phi1 around 0 52.1%
Final simplification67.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))))
(if (<= phi2 -0.74)
(* R (acos (fma (sin phi1) (sin phi2) t_0)))
(if (<= phi2 0.82)
(* R (acos (+ (* t_0 (cos (- lambda1 lambda2))) (* (sin phi1) phi2))))
(* R (acos (* (cos phi2) (cos (- lambda2 lambda1)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double tmp;
if (phi2 <= -0.74) {
tmp = R * acos(fma(sin(phi1), sin(phi2), t_0));
} else if (phi2 <= 0.82) {
tmp = R * acos(((t_0 * cos((lambda1 - lambda2))) + (sin(phi1) * phi2)));
} else {
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi2 <= -0.74) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), t_0))); elseif (phi2 <= 0.82) tmp = Float64(R * acos(Float64(Float64(t_0 * cos(Float64(lambda1 - lambda2))) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.74], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 0.82], N[(R * N[ArcCos[N[(N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_2 \leq -0.74:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 0.82:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -0.73999999999999999Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
cos-neg85.4%
sub-neg85.4%
+-commutative85.4%
distribute-neg-out85.4%
remove-double-neg85.4%
sub-neg85.4%
Simplified85.4%
Taylor expanded in lambda2 around 0 67.1%
cos-neg67.1%
Simplified67.1%
Taylor expanded in lambda1 around 0 50.3%
+-commutative50.3%
fma-define50.3%
*-commutative50.3%
Simplified50.3%
if -0.73999999999999999 < phi2 < 0.819999999999999951Initial program 69.4%
Taylor expanded in phi2 around 0 69.4%
if 0.819999999999999951 < phi2 Initial program 74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
cos-neg74.0%
sub-neg74.0%
+-commutative74.0%
distribute-neg-out74.0%
remove-double-neg74.0%
sub-neg74.0%
Simplified74.0%
Taylor expanded in phi1 around 0 52.1%
Final simplification59.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))))
(if (<= phi2 -0.75)
(* R (acos (+ (* (sin phi1) (sin phi2)) t_0)))
(if (<= phi2 0.76)
(* R (acos (+ (* t_0 (cos (- lambda1 lambda2))) (* (sin phi1) phi2))))
(* R (acos (* (cos phi2) (cos (- lambda2 lambda1)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double tmp;
if (phi2 <= -0.75) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + t_0));
} else if (phi2 <= 0.76) {
tmp = R * acos(((t_0 * cos((lambda1 - lambda2))) + (sin(phi1) * phi2)));
} else {
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos(phi1) * cos(phi2)
if (phi2 <= (-0.75d0)) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + t_0))
else if (phi2 <= 0.76d0) then
tmp = r * acos(((t_0 * cos((lambda1 - lambda2))) + (sin(phi1) * phi2)))
else
tmp = r * acos((cos(phi2) * cos((lambda2 - lambda1))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi1) * Math.cos(phi2);
double tmp;
if (phi2 <= -0.75) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + t_0));
} else if (phi2 <= 0.76) {
tmp = R * Math.acos(((t_0 * Math.cos((lambda1 - lambda2))) + (Math.sin(phi1) * phi2)));
} else {
tmp = R * Math.acos((Math.cos(phi2) * Math.cos((lambda2 - lambda1))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi1) * math.cos(phi2) tmp = 0 if phi2 <= -0.75: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + t_0)) elif phi2 <= 0.76: tmp = R * math.acos(((t_0 * math.cos((lambda1 - lambda2))) + (math.sin(phi1) * phi2))) else: tmp = R * math.acos((math.cos(phi2) * math.cos((lambda2 - lambda1)))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi2 <= -0.75) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + t_0))); elseif (phi2 <= 0.76) tmp = Float64(R * acos(Float64(Float64(t_0 * cos(Float64(lambda1 - lambda2))) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi1) * cos(phi2);
tmp = 0.0;
if (phi2 <= -0.75)
tmp = R * acos(((sin(phi1) * sin(phi2)) + t_0));
elseif (phi2 <= 0.76)
tmp = R * acos(((t_0 * cos((lambda1 - lambda2))) + (sin(phi1) * phi2)));
else
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.75], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 0.76], N[(R * N[ArcCos[N[(N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_2 \leq -0.75:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + t\_0\right)\\
\mathbf{elif}\;\phi_2 \leq 0.76:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -0.75Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
cos-neg85.4%
sub-neg85.4%
+-commutative85.4%
distribute-neg-out85.4%
remove-double-neg85.4%
sub-neg85.4%
Simplified85.4%
Taylor expanded in lambda2 around 0 67.1%
cos-neg67.1%
Simplified67.1%
Taylor expanded in lambda1 around 0 50.3%
if -0.75 < phi2 < 0.76000000000000001Initial program 69.4%
Taylor expanded in phi2 around 0 69.4%
if 0.76000000000000001 < phi2 Initial program 74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
cos-neg74.0%
sub-neg74.0%
+-commutative74.0%
distribute-neg-out74.0%
remove-double-neg74.0%
sub-neg74.0%
Simplified74.0%
Taylor expanded in phi1 around 0 52.1%
Final simplification59.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 -0.00055)
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi1) (cos phi2)))))
(if (<= phi2 0.0026)
(*
R
(acos (+ (* (sin phi1) phi2) (* (cos phi1) (cos (- lambda1 lambda2))))))
(* R (acos (* (cos phi2) (cos (- lambda2 lambda1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -0.00055) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))));
} else if (phi2 <= 0.0026) {
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda1 - lambda2)))));
} else {
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= (-0.00055d0)) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))))
else if (phi2 <= 0.0026d0) then
tmp = r * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda1 - lambda2)))))
else
tmp = r * acos((cos(phi2) * cos((lambda2 - lambda1))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -0.00055) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos(phi2))));
} else if (phi2 <= 0.0026) {
tmp = R * Math.acos(((Math.sin(phi1) * phi2) + (Math.cos(phi1) * Math.cos((lambda1 - lambda2)))));
} else {
tmp = R * Math.acos((Math.cos(phi2) * Math.cos((lambda2 - lambda1))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -0.00055: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * math.cos(phi2)))) elif phi2 <= 0.0026: tmp = R * math.acos(((math.sin(phi1) * phi2) + (math.cos(phi1) * math.cos((lambda1 - lambda2))))) else: tmp = R * math.acos((math.cos(phi2) * math.cos((lambda2 - lambda1)))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -0.00055) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * cos(phi2))))); elseif (phi2 <= 0.0026) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * phi2) + Float64(cos(phi1) * cos(Float64(lambda1 - lambda2)))))); else tmp = Float64(R * acos(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= -0.00055)
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))));
elseif (phi2 <= 0.0026)
tmp = R * acos(((sin(phi1) * phi2) + (cos(phi1) * cos((lambda1 - lambda2)))));
else
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -0.00055], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 0.0026], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -0.00055:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \phi_2\right)\\
\mathbf{elif}\;\phi_2 \leq 0.0026:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -5.50000000000000033e-4Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
*-commutative85.4%
cos-neg85.4%
sub-neg85.4%
+-commutative85.4%
distribute-neg-out85.4%
remove-double-neg85.4%
sub-neg85.4%
Simplified85.4%
Taylor expanded in lambda2 around 0 67.1%
cos-neg67.1%
Simplified67.1%
Taylor expanded in lambda1 around 0 50.3%
if -5.50000000000000033e-4 < phi2 < 0.0025999999999999999Initial program 69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
if 0.0025999999999999999 < phi2 Initial program 74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
cos-neg74.0%
sub-neg74.0%
+-commutative74.0%
distribute-neg-out74.0%
remove-double-neg74.0%
sub-neg74.0%
Simplified74.0%
Taylor expanded in phi1 around 0 52.1%
Final simplification59.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi2 1.2e-6)
(* R (acos (* (cos phi1) t_0)))
(* R (acos (* (cos phi2) t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 1.2e-6) {
tmp = R * acos((cos(phi1) * t_0));
} else {
tmp = R * acos((cos(phi2) * t_0));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
if (phi2 <= 1.2d-6) then
tmp = r * acos((cos(phi1) * t_0))
else
tmp = r * acos((cos(phi2) * t_0))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 1.2e-6) {
tmp = R * Math.acos((Math.cos(phi1) * t_0));
} else {
tmp = R * Math.acos((Math.cos(phi2) * t_0));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi2 <= 1.2e-6: tmp = R * math.acos((math.cos(phi1) * t_0)) else: tmp = R * math.acos((math.cos(phi2) * t_0)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 1.2e-6) tmp = Float64(R * acos(Float64(cos(phi1) * t_0))); else tmp = Float64(R * acos(Float64(cos(phi2) * t_0))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi2 <= 1.2e-6)
tmp = R * acos((cos(phi1) * t_0));
else
tmp = R * acos((cos(phi2) * t_0));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 1.2e-6], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 1.2 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot t\_0\right)\\
\end{array}
\end{array}
if phi2 < 1.1999999999999999e-6Initial program 75.7%
*-commutative75.7%
*-commutative75.7%
*-commutative75.7%
*-commutative75.7%
*-commutative75.7%
cos-neg75.7%
sub-neg75.7%
+-commutative75.7%
distribute-neg-out75.7%
remove-double-neg75.7%
sub-neg75.7%
Simplified75.8%
Taylor expanded in phi2 around 0 48.7%
if 1.1999999999999999e-6 < phi2 Initial program 74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
cos-neg74.0%
sub-neg74.0%
+-commutative74.0%
distribute-neg-out74.0%
remove-double-neg74.0%
sub-neg74.0%
Simplified74.0%
Taylor expanded in phi1 around 0 52.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 0.08) (* R (acos (* (cos phi1) (cos (- lambda2 lambda1))))) (* R (acos (* (cos phi2) (cos lambda1))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.08) {
tmp = R * acos((cos(phi1) * cos((lambda2 - lambda1))));
} else {
tmp = R * acos((cos(phi2) * cos(lambda1)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 0.08d0) then
tmp = r * acos((cos(phi1) * cos((lambda2 - lambda1))))
else
tmp = r * acos((cos(phi2) * cos(lambda1)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.08) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos((lambda2 - lambda1))));
} else {
tmp = R * Math.acos((Math.cos(phi2) * Math.cos(lambda1)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.08: tmp = R * math.acos((math.cos(phi1) * math.cos((lambda2 - lambda1)))) else: tmp = R * math.acos((math.cos(phi2) * math.cos(lambda1))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.08) tmp = Float64(R * acos(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))); else tmp = Float64(R * acos(Float64(cos(phi2) * cos(lambda1)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 0.08)
tmp = R * acos((cos(phi1) * cos((lambda2 - lambda1))));
else
tmp = R * acos((cos(phi2) * cos(lambda1)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.08], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.08:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi2 < 0.0800000000000000017Initial program 75.7%
*-commutative75.7%
*-commutative75.7%
*-commutative75.7%
*-commutative75.7%
*-commutative75.7%
cos-neg75.7%
sub-neg75.7%
+-commutative75.7%
distribute-neg-out75.7%
remove-double-neg75.7%
sub-neg75.7%
Simplified75.8%
Taylor expanded in phi2 around 0 48.7%
if 0.0800000000000000017 < phi2 Initial program 74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
*-commutative74.0%
cos-neg74.0%
sub-neg74.0%
+-commutative74.0%
distribute-neg-out74.0%
remove-double-neg74.0%
sub-neg74.0%
Simplified74.0%
Taylor expanded in lambda2 around 0 53.7%
cos-neg53.7%
Simplified53.7%
Taylor expanded in phi1 around 0 42.4%
*-commutative42.4%
Simplified42.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 1.4e-7) (* R (acos (* (cos phi1) (cos lambda1)))) (* R (acos (* (cos phi1) (cos lambda2))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.4e-7) {
tmp = R * acos((cos(phi1) * cos(lambda1)));
} else {
tmp = R * acos((cos(phi1) * cos(lambda2)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 1.4d-7) then
tmp = r * acos((cos(phi1) * cos(lambda1)))
else
tmp = r * acos((cos(phi1) * cos(lambda2)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.4e-7) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 1.4e-7: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1))) else: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda2))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1.4e-7) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1)))); else tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda2)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 1.4e-7)
tmp = R * acos((cos(phi1) * cos(lambda1)));
else
tmp = R * acos((cos(phi1) * cos(lambda2)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1.4e-7], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.4 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 1.4000000000000001e-7Initial program 80.0%
*-commutative80.0%
*-commutative80.0%
*-commutative80.0%
*-commutative80.0%
*-commutative80.0%
cos-neg80.0%
sub-neg80.0%
+-commutative80.0%
distribute-neg-out80.0%
remove-double-neg80.0%
sub-neg80.0%
Simplified80.0%
Taylor expanded in phi2 around 0 42.6%
Taylor expanded in lambda2 around 0 34.2%
cos-neg66.2%
Simplified34.2%
if 1.4000000000000001e-7 < lambda2 Initial program 62.8%
*-commutative62.8%
*-commutative62.8%
*-commutative62.8%
*-commutative62.8%
*-commutative62.8%
cos-neg62.8%
sub-neg62.8%
+-commutative62.8%
distribute-neg-out62.8%
remove-double-neg62.8%
sub-neg62.8%
Simplified62.8%
Taylor expanded in phi2 around 0 41.2%
Taylor expanded in lambda1 around 0 41.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.008) (* R (acos (* (cos phi1) (cos lambda1)))) (* R (acos (cos (- lambda2 lambda1))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.008) {
tmp = R * acos((cos(phi1) * cos(lambda1)));
} else {
tmp = R * acos(cos((lambda2 - lambda1)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-0.008d0)) then
tmp = r * acos((cos(phi1) * cos(lambda1)))
else
tmp = r * acos(cos((lambda2 - lambda1)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.008) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else {
tmp = R * Math.acos(Math.cos((lambda2 - lambda1)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.008: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1))) else: tmp = R * math.acos(math.cos((lambda2 - lambda1))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.008) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1)))); else tmp = Float64(R * acos(cos(Float64(lambda2 - lambda1)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.008)
tmp = R * acos((cos(phi1) * cos(lambda1)));
else
tmp = R * acos(cos((lambda2 - lambda1)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.008], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.008:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -0.0080000000000000002Initial program 80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
cos-neg80.9%
sub-neg80.9%
+-commutative80.9%
distribute-neg-out80.9%
remove-double-neg80.9%
sub-neg80.9%
Simplified80.9%
Taylor expanded in phi2 around 0 53.3%
Taylor expanded in lambda2 around 0 37.7%
cos-neg57.4%
Simplified37.7%
if -0.0080000000000000002 < phi1 Initial program 73.5%
*-commutative73.5%
*-commutative73.5%
*-commutative73.5%
*-commutative73.5%
*-commutative73.5%
cos-neg73.5%
sub-neg73.5%
+-commutative73.5%
distribute-neg-out73.5%
remove-double-neg73.5%
sub-neg73.5%
Simplified73.5%
Taylor expanded in phi2 around 0 38.4%
Taylor expanded in phi1 around 0 29.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -0.0015)
(* R (acos (cos phi1)))
(if (<= phi1 -5.2e-120)
(* R (acos (cos lambda2)))
(if (<= phi1 1.9e-277)
(* R (acos (cos lambda1)))
(* R (acos (cos phi2)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.0015) {
tmp = R * acos(cos(phi1));
} else if (phi1 <= -5.2e-120) {
tmp = R * acos(cos(lambda2));
} else if (phi1 <= 1.9e-277) {
tmp = R * acos(cos(lambda1));
} else {
tmp = R * acos(cos(phi2));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-0.0015d0)) then
tmp = r * acos(cos(phi1))
else if (phi1 <= (-5.2d-120)) then
tmp = r * acos(cos(lambda2))
else if (phi1 <= 1.9d-277) then
tmp = r * acos(cos(lambda1))
else
tmp = r * acos(cos(phi2))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.0015) {
tmp = R * Math.acos(Math.cos(phi1));
} else if (phi1 <= -5.2e-120) {
tmp = R * Math.acos(Math.cos(lambda2));
} else if (phi1 <= 1.9e-277) {
tmp = R * Math.acos(Math.cos(lambda1));
} else {
tmp = R * Math.acos(Math.cos(phi2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.0015: tmp = R * math.acos(math.cos(phi1)) elif phi1 <= -5.2e-120: tmp = R * math.acos(math.cos(lambda2)) elif phi1 <= 1.9e-277: tmp = R * math.acos(math.cos(lambda1)) else: tmp = R * math.acos(math.cos(phi2)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.0015) tmp = Float64(R * acos(cos(phi1))); elseif (phi1 <= -5.2e-120) tmp = Float64(R * acos(cos(lambda2))); elseif (phi1 <= 1.9e-277) tmp = Float64(R * acos(cos(lambda1))); else tmp = Float64(R * acos(cos(phi2))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.0015)
tmp = R * acos(cos(phi1));
elseif (phi1 <= -5.2e-120)
tmp = R * acos(cos(lambda2));
elseif (phi1 <= 1.9e-277)
tmp = R * acos(cos(lambda1));
else
tmp = R * acos(cos(phi2));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.0015], N[(R * N[ArcCos[N[Cos[phi1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -5.2e-120], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.9e-277], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[phi2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.0015:\\
\;\;\;\;R \cdot \cos^{-1} \cos \phi_1\\
\mathbf{elif}\;\phi_1 \leq -5.2 \cdot 10^{-120}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\
\mathbf{elif}\;\phi_1 \leq 1.9 \cdot 10^{-277}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \phi_2\\
\end{array}
\end{array}
if phi1 < -0.0015Initial program 80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
cos-neg80.9%
sub-neg80.9%
+-commutative80.9%
distribute-neg-out80.9%
remove-double-neg80.9%
sub-neg80.9%
Simplified80.9%
Taylor expanded in lambda2 around 0 57.4%
cos-neg57.4%
Simplified57.4%
Taylor expanded in lambda1 around 0 42.8%
+-commutative42.8%
fma-define42.9%
*-commutative42.9%
Simplified42.9%
Taylor expanded in phi2 around 0 27.6%
if -0.0015 < phi1 < -5.2000000000000002e-120Initial program 75.8%
*-commutative75.8%
*-commutative75.8%
*-commutative75.8%
*-commutative75.8%
*-commutative75.8%
cos-neg75.8%
sub-neg75.8%
+-commutative75.8%
distribute-neg-out75.8%
remove-double-neg75.8%
sub-neg75.8%
Simplified75.8%
Taylor expanded in phi2 around 0 39.0%
Taylor expanded in phi1 around 0 37.5%
Taylor expanded in lambda1 around 0 16.9%
if -5.2000000000000002e-120 < phi1 < 1.89999999999999993e-277Initial program 71.3%
*-commutative71.3%
*-commutative71.3%
*-commutative71.3%
*-commutative71.3%
*-commutative71.3%
cos-neg71.3%
sub-neg71.3%
+-commutative71.3%
distribute-neg-out71.3%
remove-double-neg71.3%
sub-neg71.3%
Simplified71.3%
Taylor expanded in phi2 around 0 32.9%
Taylor expanded in phi1 around 0 32.9%
Taylor expanded in lambda2 around 0 21.3%
cos-neg51.3%
Simplified21.3%
if 1.89999999999999993e-277 < phi1 Initial program 73.8%
*-commutative73.8%
*-commutative73.8%
*-commutative73.8%
*-commutative73.8%
*-commutative73.8%
cos-neg73.8%
sub-neg73.8%
+-commutative73.8%
distribute-neg-out73.8%
remove-double-neg73.8%
sub-neg73.8%
Simplified73.8%
Taylor expanded in lambda2 around 0 51.8%
cos-neg51.8%
Simplified51.8%
Taylor expanded in lambda1 around 0 29.5%
+-commutative29.5%
fma-define29.5%
*-commutative29.5%
Simplified29.5%
Taylor expanded in phi1 around 0 19.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.0048) (* R (acos (cos phi1))) (* R (acos (cos (- lambda2 lambda1))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.0048) {
tmp = R * acos(cos(phi1));
} else {
tmp = R * acos(cos((lambda2 - lambda1)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-0.0048d0)) then
tmp = r * acos(cos(phi1))
else
tmp = r * acos(cos((lambda2 - lambda1)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.0048) {
tmp = R * Math.acos(Math.cos(phi1));
} else {
tmp = R * Math.acos(Math.cos((lambda2 - lambda1)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.0048: tmp = R * math.acos(math.cos(phi1)) else: tmp = R * math.acos(math.cos((lambda2 - lambda1))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.0048) tmp = Float64(R * acos(cos(phi1))); else tmp = Float64(R * acos(cos(Float64(lambda2 - lambda1)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.0048)
tmp = R * acos(cos(phi1));
else
tmp = R * acos(cos((lambda2 - lambda1)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.0048], N[(R * N[ArcCos[N[Cos[phi1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.0048:\\
\;\;\;\;R \cdot \cos^{-1} \cos \phi_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -0.00479999999999999958Initial program 80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
cos-neg80.9%
sub-neg80.9%
+-commutative80.9%
distribute-neg-out80.9%
remove-double-neg80.9%
sub-neg80.9%
Simplified80.9%
Taylor expanded in lambda2 around 0 57.4%
cos-neg57.4%
Simplified57.4%
Taylor expanded in lambda1 around 0 42.8%
+-commutative42.8%
fma-define42.9%
*-commutative42.9%
Simplified42.9%
Taylor expanded in phi2 around 0 27.6%
if -0.00479999999999999958 < phi1 Initial program 73.5%
*-commutative73.5%
*-commutative73.5%
*-commutative73.5%
*-commutative73.5%
*-commutative73.5%
cos-neg73.5%
sub-neg73.5%
+-commutative73.5%
distribute-neg-out73.5%
remove-double-neg73.5%
sub-neg73.5%
Simplified73.5%
Taylor expanded in phi2 around 0 38.4%
Taylor expanded in phi1 around 0 29.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.00245) (* R (acos (cos phi1))) (* R (acos (cos lambda2)))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.00245) {
tmp = R * acos(cos(phi1));
} else {
tmp = R * acos(cos(lambda2));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-0.00245d0)) then
tmp = r * acos(cos(phi1))
else
tmp = r * acos(cos(lambda2))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.00245) {
tmp = R * Math.acos(Math.cos(phi1));
} else {
tmp = R * Math.acos(Math.cos(lambda2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.00245: tmp = R * math.acos(math.cos(phi1)) else: tmp = R * math.acos(math.cos(lambda2)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.00245) tmp = Float64(R * acos(cos(phi1))); else tmp = Float64(R * acos(cos(lambda2))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.00245)
tmp = R * acos(cos(phi1));
else
tmp = R * acos(cos(lambda2));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.00245], N[(R * N[ArcCos[N[Cos[phi1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.00245:\\
\;\;\;\;R \cdot \cos^{-1} \cos \phi_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\
\end{array}
\end{array}
if phi1 < -0.0024499999999999999Initial program 80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
cos-neg80.9%
sub-neg80.9%
+-commutative80.9%
distribute-neg-out80.9%
remove-double-neg80.9%
sub-neg80.9%
Simplified80.9%
Taylor expanded in lambda2 around 0 57.4%
cos-neg57.4%
Simplified57.4%
Taylor expanded in lambda1 around 0 42.8%
+-commutative42.8%
fma-define42.9%
*-commutative42.9%
Simplified42.9%
Taylor expanded in phi2 around 0 27.6%
if -0.0024499999999999999 < phi1 Initial program 73.5%
*-commutative73.5%
*-commutative73.5%
*-commutative73.5%
*-commutative73.5%
*-commutative73.5%
cos-neg73.5%
sub-neg73.5%
+-commutative73.5%
distribute-neg-out73.5%
remove-double-neg73.5%
sub-neg73.5%
Simplified73.5%
Taylor expanded in phi2 around 0 38.4%
Taylor expanded in phi1 around 0 29.8%
Taylor expanded in lambda1 around 0 18.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 5.4e-8) (* R (acos (cos lambda1))) (* R (acos (cos lambda2)))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 5.4e-8) {
tmp = R * acos(cos(lambda1));
} else {
tmp = R * acos(cos(lambda2));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 5.4d-8) then
tmp = r * acos(cos(lambda1))
else
tmp = r * acos(cos(lambda2))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 5.4e-8) {
tmp = R * Math.acos(Math.cos(lambda1));
} else {
tmp = R * Math.acos(Math.cos(lambda2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 5.4e-8: tmp = R * math.acos(math.cos(lambda1)) else: tmp = R * math.acos(math.cos(lambda2)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 5.4e-8) tmp = Float64(R * acos(cos(lambda1))); else tmp = Float64(R * acos(cos(lambda2))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 5.4e-8)
tmp = R * acos(cos(lambda1));
else
tmp = R * acos(cos(lambda2));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 5.4e-8], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 5.4 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\
\end{array}
\end{array}
if lambda2 < 5.40000000000000005e-8Initial program 80.0%
*-commutative80.0%
*-commutative80.0%
*-commutative80.0%
*-commutative80.0%
*-commutative80.0%
cos-neg80.0%
sub-neg80.0%
+-commutative80.0%
distribute-neg-out80.0%
remove-double-neg80.0%
sub-neg80.0%
Simplified80.0%
Taylor expanded in phi2 around 0 42.6%
Taylor expanded in phi1 around 0 25.6%
Taylor expanded in lambda2 around 0 19.9%
cos-neg66.2%
Simplified19.9%
if 5.40000000000000005e-8 < lambda2 Initial program 62.8%
*-commutative62.8%
*-commutative62.8%
*-commutative62.8%
*-commutative62.8%
*-commutative62.8%
cos-neg62.8%
sub-neg62.8%
+-commutative62.8%
distribute-neg-out62.8%
remove-double-neg62.8%
sub-neg62.8%
Simplified62.8%
Taylor expanded in phi2 around 0 41.2%
Taylor expanded in phi1 around 0 27.7%
Taylor expanded in lambda1 around 0 27.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -0.00185) (* R (acos (cos lambda1))) (* R (- lambda2 lambda1))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -0.00185) {
tmp = R * acos(cos(lambda1));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-0.00185d0)) then
tmp = r * acos(cos(lambda1))
else
tmp = r * (lambda2 - lambda1)
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -0.00185) {
tmp = R * Math.acos(Math.cos(lambda1));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -0.00185: tmp = R * math.acos(math.cos(lambda1)) else: tmp = R * (lambda2 - lambda1) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -0.00185) tmp = Float64(R * acos(cos(lambda1))); else tmp = Float64(R * Float64(lambda2 - lambda1)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -0.00185)
tmp = R * acos(cos(lambda1));
else
tmp = R * (lambda2 - lambda1);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -0.00185], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -0.00185:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if lambda1 < -0.0018500000000000001Initial program 63.7%
*-commutative63.7%
*-commutative63.7%
*-commutative63.7%
*-commutative63.7%
*-commutative63.7%
cos-neg63.7%
sub-neg63.7%
+-commutative63.7%
distribute-neg-out63.7%
remove-double-neg63.7%
sub-neg63.7%
Simplified63.7%
Taylor expanded in phi2 around 0 39.8%
Taylor expanded in phi1 around 0 28.7%
Taylor expanded in lambda2 around 0 28.7%
cos-neg62.0%
Simplified28.7%
if -0.0018500000000000001 < lambda1 Initial program 78.6%
*-commutative78.6%
*-commutative78.6%
*-commutative78.6%
*-commutative78.6%
*-commutative78.6%
cos-neg78.6%
sub-neg78.6%
+-commutative78.6%
distribute-neg-out78.6%
remove-double-neg78.6%
sub-neg78.6%
Simplified78.6%
Taylor expanded in phi2 around 0 42.8%
Taylor expanded in phi1 around 0 25.5%
Taylor expanded in R around 0 7.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -3.4e-182) (* lambda1 (- R)) (* lambda2 R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -3.4e-182) {
tmp = lambda1 * -R;
} else {
tmp = lambda2 * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-3.4d-182)) then
tmp = lambda1 * -r
else
tmp = lambda2 * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -3.4e-182) {
tmp = lambda1 * -R;
} else {
tmp = lambda2 * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -3.4e-182: tmp = lambda1 * -R else: tmp = lambda2 * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -3.4e-182) tmp = Float64(lambda1 * Float64(-R)); else tmp = Float64(lambda2 * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -3.4e-182)
tmp = lambda1 * -R;
else
tmp = lambda2 * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -3.4e-182], N[(lambda1 * (-R)), $MachinePrecision], N[(lambda2 * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -3.4 \cdot 10^{-182}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{else}:\\
\;\;\;\;\lambda_2 \cdot R\\
\end{array}
\end{array}
if lambda1 < -3.39999999999999989e-182Initial program 73.4%
*-commutative73.4%
*-commutative73.4%
*-commutative73.4%
*-commutative73.4%
*-commutative73.4%
cos-neg73.4%
sub-neg73.4%
+-commutative73.4%
distribute-neg-out73.4%
remove-double-neg73.4%
sub-neg73.4%
Simplified73.4%
Taylor expanded in phi2 around 0 39.5%
Taylor expanded in phi1 around 0 25.5%
Taylor expanded in lambda2 around 0 9.7%
associate-*r*9.7%
mul-1-neg9.7%
Simplified9.7%
if -3.39999999999999989e-182 < lambda1 Initial program 76.5%
*-commutative76.5%
*-commutative76.5%
*-commutative76.5%
*-commutative76.5%
*-commutative76.5%
cos-neg76.5%
sub-neg76.5%
+-commutative76.5%
distribute-neg-out76.5%
remove-double-neg76.5%
sub-neg76.5%
Simplified76.5%
Taylor expanded in phi2 around 0 43.8%
Taylor expanded in phi1 around 0 26.6%
Taylor expanded in lambda2 around inf 6.3%
Final simplification7.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (- lambda2 lambda1)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * (lambda2 - lambda1);
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * (lambda2 - lambda1)
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * (lambda2 - lambda1);
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * (lambda2 - lambda1)
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * Float64(lambda2 - lambda1)) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * (lambda2 - lambda1);
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \left(\lambda_2 - \lambda_1\right)
\end{array}
Initial program 75.4%
*-commutative75.4%
*-commutative75.4%
*-commutative75.4%
*-commutative75.4%
*-commutative75.4%
cos-neg75.4%
sub-neg75.4%
+-commutative75.4%
distribute-neg-out75.4%
remove-double-neg75.4%
sub-neg75.4%
Simplified75.4%
Taylor expanded in phi2 around 0 42.2%
Taylor expanded in phi1 around 0 26.2%
Taylor expanded in R around 0 6.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* lambda2 R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return lambda2 * R;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = lambda2 * r
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return lambda2 * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return lambda2 * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(lambda2 * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = lambda2 * R;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(lambda2 * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\lambda_2 \cdot R
\end{array}
Initial program 75.4%
*-commutative75.4%
*-commutative75.4%
*-commutative75.4%
*-commutative75.4%
*-commutative75.4%
cos-neg75.4%
sub-neg75.4%
+-commutative75.4%
distribute-neg-out75.4%
remove-double-neg75.4%
sub-neg75.4%
Simplified75.4%
Taylor expanded in phi2 around 0 42.2%
Taylor expanded in phi1 around 0 26.2%
Taylor expanded in lambda2 around inf 5.8%
Final simplification5.8%
herbie shell --seed 2024180
(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))