
(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 27 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: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<=
(+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))
0.99999999998)
(*
(acos
(+
t_0
(*
(cos phi1)
(*
(cos phi2)
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2)))))))
R)
(* R (fabs (remainder lambda2 (* 2.0 PI)))))))assert(lambda1 < lambda2);
assert(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.99999999998) {
tmp = acos((t_0 + (cos(phi1) * (cos(phi2) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))))))) * R;
} else {
tmp = R * fabs(remainder(lambda2, (2.0 * ((double) M_PI))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, 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.99999999998], N[(N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(R * N[Abs[N[With[{TMP1 = lambda2, TMP2 = N[(2.0 * Pi), $MachinePrecision]}, TMP1 - Round[TMP1 / TMP2] * TMP2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([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.99999999998:\\
\;\;\;\;\cos^{-1} \left(t_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left|\left(\lambda_2 \mathsf{rem} \left(2 \cdot \pi\right)\right)\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.99999999998Initial program 78.1%
cos-diff98.7%
distribute-lft-in98.7%
Applied egg-rr98.7%
distribute-lft-out98.7%
associate-*l*98.7%
cos-neg98.7%
*-commutative98.7%
fma-def98.8%
cos-neg98.8%
Simplified98.8%
if 0.99999999998 < (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) Initial program 9.1%
*-commutative9.1%
*-commutative9.1%
+-commutative9.1%
*-commutative9.1%
*-commutative9.1%
fma-def9.1%
Simplified9.1%
Taylor expanded in lambda1 around 0 9.1%
fma-def9.1%
*-commutative9.1%
cos-neg9.1%
Simplified9.1%
Taylor expanded in phi2 around 0 9.1%
*-commutative9.1%
Simplified9.1%
Taylor expanded in phi1 around 0 9.1%
acos-cos35.2%
Applied egg-rr35.2%
Final simplification95.3%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<=
(+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))
0.99999999998)
(*
R
(acos
(+
t_0
(*
(cos phi1)
(*
(cos phi2)
(+
(* (sin lambda1) (sin lambda2))
(* (cos lambda2) (cos lambda1))))))))
(* R (fabs (remainder lambda2 (* 2.0 PI)))))))assert(lambda1 < lambda2);
assert(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.99999999998) {
tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))))));
} else {
tmp = R * fabs(remainder(lambda2, (2.0 * ((double) M_PI))));
}
return tmp;
}
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if ((t_0 + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))) <= 0.99999999998) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))))));
} else {
tmp = R * Math.abs(Math.IEEEremainder(lambda2, (2.0 * Math.PI)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([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.99999999998: tmp = R * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1))))))) else: tmp = R * math.fabs(math.remainder(lambda2, (2.0 * math.pi))) return tmp
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, 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.99999999998], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Abs[N[With[{TMP1 = lambda2, TMP2 = N[(2.0 * Pi), $MachinePrecision]}, TMP1 - Round[TMP1 / TMP2] * TMP2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([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.99999999998:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left|\left(\lambda_2 \mathsf{rem} \left(2 \cdot \pi\right)\right)\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.99999999998Initial program 78.1%
cos-diff98.7%
distribute-lft-in98.7%
Applied egg-rr98.7%
distribute-lft-out98.7%
associate-*l*98.7%
cos-neg98.7%
*-commutative98.7%
fma-def98.8%
cos-neg98.8%
Simplified98.8%
Taylor expanded in phi2 around inf 98.7%
if 0.99999999998 < (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) Initial program 9.1%
*-commutative9.1%
*-commutative9.1%
+-commutative9.1%
*-commutative9.1%
*-commutative9.1%
fma-def9.1%
Simplified9.1%
Taylor expanded in lambda1 around 0 9.1%
fma-def9.1%
*-commutative9.1%
cos-neg9.1%
Simplified9.1%
Taylor expanded in phi2 around 0 9.1%
*-commutative9.1%
Simplified9.1%
Taylor expanded in phi1 around 0 9.1%
acos-cos35.2%
Applied egg-rr35.2%
Final simplification95.3%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2)))
(t_1 (* (cos phi1) (cos phi2)))
(t_2 (* (sin phi1) (sin phi2))))
(if (<= phi2 -8.5e-8)
(* R (- (* PI 0.5) (asin (fma t_0 t_1 t_2))))
(if (<= phi2 1.7e-5)
(*
R
(acos
(+
t_2
(*
(cos phi1)
(fma
(cos lambda2)
(cos lambda1)
(* (sin lambda1) (sin lambda2)))))))
(* R (acos (fma t_1 t_0 t_2)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double t_1 = cos(phi1) * cos(phi2);
double t_2 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -8.5e-8) {
tmp = R * ((((double) M_PI) * 0.5) - asin(fma(t_0, t_1, t_2)));
} else if (phi2 <= 1.7e-5) {
tmp = R * acos((t_2 + (cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))))));
} else {
tmp = R * acos(fma(t_1, t_0, t_2));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) t_1 = Float64(cos(phi1) * cos(phi2)) t_2 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -8.5e-8) tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(fma(t_0, t_1, t_2)))); elseif (phi2 <= 1.7e-5) tmp = Float64(R * acos(Float64(t_2 + Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))))))); else tmp = Float64(R * acos(fma(t_1, t_0, t_2))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -8.5e-8], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 * t$95$1 + t$95$2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.7e-5], N[(R * N[ArcCos[N[(t$95$2 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 * t$95$0 + t$95$2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
t_2 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -8.5 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(\mathsf{fma}\left(t_0, t_1, t_2\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.7 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_2 + \cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(t_1, t_0, t_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -8.49999999999999935e-8Initial program 78.9%
acos-asin78.8%
div-inv78.8%
metadata-eval78.8%
+-commutative78.8%
*-commutative78.8%
fma-def78.9%
Applied egg-rr78.9%
if -8.49999999999999935e-8 < phi2 < 1.7e-5Initial program 66.9%
cos-diff88.4%
distribute-lft-in88.4%
Applied egg-rr88.4%
distribute-lft-out88.4%
associate-*l*88.4%
cos-neg88.4%
*-commutative88.4%
fma-def88.5%
cos-neg88.5%
Simplified88.5%
Taylor expanded in phi2 around 0 88.4%
*-commutative88.4%
fma-udef88.5%
Simplified88.5%
if 1.7e-5 < phi2 Initial program 84.2%
*-commutative84.2%
*-commutative84.2%
+-commutative84.2%
*-commutative84.2%
*-commutative84.2%
fma-def84.3%
Simplified84.3%
Final simplification85.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2)))
(t_1 (* (cos phi1) (cos phi2)))
(t_2 (* (sin phi1) (sin phi2))))
(if (<= phi2 -7.5e-12)
(* R (- (* PI 0.5) (asin (fma t_0 t_1 t_2))))
(if (<= phi2 1.7e-5)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda1) (sin lambda2))))))
(* R (acos (fma t_1 t_0 t_2)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double t_1 = cos(phi1) * cos(phi2);
double t_2 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -7.5e-12) {
tmp = R * ((((double) M_PI) * 0.5) - asin(fma(t_0, t_1, t_2)));
} else if (phi2 <= 1.7e-5) {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), (sin(lambda1) * sin(lambda2)))));
} else {
tmp = R * acos(fma(t_1, t_0, t_2));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) t_1 = Float64(cos(phi1) * cos(phi2)) t_2 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -7.5e-12) tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(fma(t_0, t_1, t_2)))); elseif (phi2 <= 1.7e-5) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), Float64(sin(lambda1) * sin(lambda2)))))); else tmp = Float64(R * acos(fma(t_1, t_0, t_2))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -7.5e-12], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 * t$95$1 + t$95$2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.7e-5], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 * t$95$0 + t$95$2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
t_2 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -7.5 \cdot 10^{-12}:\\
\;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(\mathsf{fma}\left(t_0, t_1, t_2\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.7 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(t_1, t_0, t_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -7.5e-12Initial program 78.9%
acos-asin78.8%
div-inv78.8%
metadata-eval78.8%
+-commutative78.8%
*-commutative78.8%
fma-def78.9%
Applied egg-rr78.9%
if -7.5e-12 < phi2 < 1.7e-5Initial program 66.9%
*-commutative66.9%
*-commutative66.9%
+-commutative66.9%
*-commutative66.9%
*-commutative66.9%
fma-def66.9%
Simplified66.9%
cos-diff88.4%
+-commutative88.4%
Applied egg-rr88.4%
Taylor expanded in phi2 around 0 88.3%
fma-def88.4%
Simplified88.4%
if 1.7e-5 < phi2 Initial program 84.2%
*-commutative84.2%
*-commutative84.2%
+-commutative84.2%
*-commutative84.2%
*-commutative84.2%
fma-def84.3%
Simplified84.3%
Final simplification85.0%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -1.3e-8) (not (<= phi2 1.7e-5)))
(*
R
(acos
(fma
(* (cos phi1) (cos phi2))
(cos (- lambda1 lambda2))
(* (sin phi1) (sin phi2)))))
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda1) (sin lambda2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.3e-8) || !(phi2 <= 1.7e-5)) {
tmp = R * acos(fma((cos(phi1) * cos(phi2)), cos((lambda1 - lambda2)), (sin(phi1) * sin(phi2))));
} else {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), (sin(lambda1) * sin(lambda2)))));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -1.3e-8) || !(phi2 <= 1.7e-5)) tmp = Float64(R * acos(fma(Float64(cos(phi1) * cos(phi2)), cos(Float64(lambda1 - lambda2)), Float64(sin(phi1) * sin(phi2))))); else tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), Float64(sin(lambda1) * sin(lambda2)))))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -1.3e-8], N[Not[LessEqual[phi2, 1.7e-5]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.3 \cdot 10^{-8} \lor \neg \left(\phi_2 \leq 1.7 \cdot 10^{-5}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.3000000000000001e-8 or 1.7e-5 < phi2 Initial program 81.7%
*-commutative81.7%
*-commutative81.7%
+-commutative81.7%
*-commutative81.7%
*-commutative81.7%
fma-def81.8%
Simplified81.8%
if -1.3000000000000001e-8 < phi2 < 1.7e-5Initial program 66.9%
*-commutative66.9%
*-commutative66.9%
+-commutative66.9%
*-commutative66.9%
*-commutative66.9%
fma-def66.9%
Simplified66.9%
cos-diff88.4%
+-commutative88.4%
Applied egg-rr88.4%
Taylor expanded in phi2 around 0 88.3%
fma-def88.4%
Simplified88.4%
Final simplification85.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -4.3e-10) (not (<= phi2 1.7e-5)))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda1) (sin lambda2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -4.3e-10) || !(phi2 <= 1.7e-5)) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
} else {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), (sin(lambda1) * sin(lambda2)))));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -4.3e-10) || !(phi2 <= 1.7e-5)) 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) * fma(cos(lambda1), cos(lambda2), Float64(sin(lambda1) * sin(lambda2)))))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -4.3e-10], N[Not[LessEqual[phi2, 1.7e-5]], $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[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -4.3 \cdot 10^{-10} \lor \neg \left(\phi_2 \leq 1.7 \cdot 10^{-5}\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 \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -4.30000000000000014e-10 or 1.7e-5 < phi2 Initial program 81.7%
if -4.30000000000000014e-10 < phi2 < 1.7e-5Initial program 66.9%
*-commutative66.9%
*-commutative66.9%
+-commutative66.9%
*-commutative66.9%
*-commutative66.9%
fma-def66.9%
Simplified66.9%
cos-diff88.4%
+-commutative88.4%
Applied egg-rr88.4%
Taylor expanded in phi2 around 0 88.3%
fma-def88.4%
Simplified88.4%
Final simplification85.0%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: 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.5e-12) (not (<= phi2 1.7e-5)))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))
(*
R
(acos
(*
(cos phi1)
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -7.5e-12) || !(phi2 <= 1.7e-5)) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
} else {
tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if ((phi2 <= (-7.5d-12)) .or. (.not. (phi2 <= 1.7d-5))) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
else
tmp = r * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -7.5e-12) || !(phi2 <= 1.7e-5)) {
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(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if (phi2 <= -7.5e-12) or not (phi2 <= 1.7e-5): 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(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -7.5e-12) || !(phi2 <= 1.7e-5)) 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(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1)))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if ((phi2 <= -7.5e-12) || ~((phi2 <= 1.7e-5)))
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
else
tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -7.5e-12], N[Not[LessEqual[phi2, 1.7e-5]], $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[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -7.5 \cdot 10^{-12} \lor \neg \left(\phi_2 \leq 1.7 \cdot 10^{-5}\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_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -7.5e-12 or 1.7e-5 < phi2 Initial program 81.7%
if -7.5e-12 < phi2 < 1.7e-5Initial program 66.9%
*-commutative66.9%
*-commutative66.9%
+-commutative66.9%
*-commutative66.9%
*-commutative66.9%
fma-def66.9%
Simplified66.9%
cos-diff88.4%
+-commutative88.4%
Applied egg-rr88.4%
Taylor expanded in phi2 around 0 88.3%
Final simplification85.0%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1)))))
(if (<= phi1 -1.1e-5)
(* R (acos (* (cos phi1) t_0)))
(if (<= phi1 4.2e-7)
(* R (acos (* (cos phi2) t_0)))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (cos phi1) (* (cos phi2) (cos lambda2))))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1));
double tmp;
if (phi1 <= -1.1e-5) {
tmp = R * acos((cos(phi1) * t_0));
} else if (phi1 <= 4.2e-7) {
tmp = R * acos((cos(phi2) * t_0));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * (cos(phi2) * cos(lambda2)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = (sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1))
if (phi1 <= (-1.1d-5)) then
tmp = r * acos((cos(phi1) * t_0))
else if (phi1 <= 4.2d-7) then
tmp = r * acos((cos(phi2) * t_0))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * (cos(phi2) * cos(lambda2)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1));
double tmp;
if (phi1 <= -1.1e-5) {
tmp = R * Math.acos((Math.cos(phi1) * t_0));
} else if (phi1 <= 4.2e-7) {
tmp = R * Math.acos((Math.cos(phi2) * t_0));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * (Math.cos(phi2) * Math.cos(lambda2)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = (math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1)) tmp = 0 if phi1 <= -1.1e-5: tmp = R * math.acos((math.cos(phi1) * t_0)) elif phi1 <= 4.2e-7: tmp = R * math.acos((math.cos(phi2) * t_0)) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * (math.cos(phi2) * math.cos(lambda2))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1))) tmp = 0.0 if (phi1 <= -1.1e-5) tmp = Float64(R * acos(Float64(cos(phi1) * t_0))); elseif (phi1 <= 4.2e-7) tmp = Float64(R * acos(Float64(cos(phi2) * t_0))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * Float64(cos(phi2) * cos(lambda2)))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = (sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1));
tmp = 0.0;
if (phi1 <= -1.1e-5)
tmp = R * acos((cos(phi1) * t_0));
elseif (phi1 <= 4.2e-7)
tmp = R * acos((cos(phi2) * t_0));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * (cos(phi2) * cos(lambda2)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -1.1e-5], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 4.2e-7], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\\
\mathbf{if}\;\phi_1 \leq -1.1 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t_0\right)\\
\mathbf{elif}\;\phi_1 \leq 4.2 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi1 < -1.1e-5Initial program 71.9%
*-commutative71.9%
*-commutative71.9%
+-commutative71.9%
*-commutative71.9%
*-commutative71.9%
fma-def72.0%
Simplified72.0%
cos-diff99.1%
+-commutative99.1%
Applied egg-rr99.1%
Taylor expanded in phi2 around 0 57.6%
if -1.1e-5 < phi1 < 4.2e-7Initial program 73.5%
*-commutative73.5%
*-commutative73.5%
+-commutative73.5%
*-commutative73.5%
*-commutative73.5%
fma-def73.5%
Simplified73.5%
cos-diff87.9%
+-commutative87.9%
Applied egg-rr87.9%
Taylor expanded in phi1 around 0 87.7%
if 4.2e-7 < phi1 Initial program 78.6%
Taylor expanded in lambda1 around 0 56.5%
*-commutative56.5%
cos-neg56.5%
Simplified56.5%
Final simplification71.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= lambda1 -1.18e-24)
(* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda1))))))
(if (<= lambda1 2.15e+21)
(* R (acos (+ t_0 (* (cos phi1) (* (cos phi2) (cos lambda2))))))
(*
R
(acos
(*
(cos phi1)
(+
(* (sin lambda1) (sin lambda2))
(* (cos lambda2) (cos lambda1))))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (lambda1 <= -1.18e-24) {
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
} else if (lambda1 <= 2.15e+21) {
tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda2)))));
} else {
tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (lambda1 <= (-1.18d-24)) then
tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))))
else if (lambda1 <= 2.15d+21) then
tmp = r * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda2)))))
else
tmp = r * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda1 <= -1.18e-24) {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda1)))));
} else if (lambda1 <= 2.15e+21) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * Math.cos(lambda2)))));
} else {
tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda1 <= -1.18e-24: tmp = R * math.acos((t_0 + (math.cos(phi2) * (math.cos(phi1) * math.cos(lambda1))))) elif lambda1 <= 2.15e+21: tmp = R * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * math.cos(lambda2))))) else: tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda1 <= -1.18e-24) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * Float64(cos(phi1) * cos(lambda1)))))); elseif (lambda1 <= 2.15e+21) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * cos(lambda2)))))); else tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1)))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda1 <= -1.18e-24)
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
elseif (lambda1 <= 2.15e+21)
tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda2)))));
else
tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -1.18e-24], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, 2.15e+21], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -1.18 \cdot 10^{-24}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \lambda_1\right)\right)\\
\mathbf{elif}\;\lambda_1 \leq 2.15 \cdot 10^{+21}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\end{array}
\end{array}
if lambda1 < -1.18e-24Initial program 64.8%
Taylor expanded in lambda2 around 0 63.6%
associate-*r*63.6%
Simplified63.6%
if -1.18e-24 < lambda1 < 2.15e21Initial program 88.7%
Taylor expanded in lambda1 around 0 87.3%
*-commutative87.3%
cos-neg87.3%
Simplified87.3%
if 2.15e21 < lambda1 Initial program 57.9%
*-commutative57.9%
*-commutative57.9%
+-commutative57.9%
*-commutative57.9%
*-commutative57.9%
fma-def57.9%
Simplified57.9%
cos-diff99.1%
+-commutative99.1%
Applied egg-rr99.1%
Taylor expanded in phi2 around 0 59.8%
Final simplification73.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 21.5)
(*
R
(acos
(*
(cos phi1)
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1))))))
(*
R
(acos
(+ (* (sin phi1) (sin phi2)) (* (cos phi2) (cos (- lambda1 lambda2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 21.5) {
tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 21.5d0) then
tmp = r * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 21.5) {
tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos((lambda1 - lambda2)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 21.5: tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1))))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi2) * math.cos((lambda1 - lambda2))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 21.5) tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * cos(Float64(lambda1 - lambda2)))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 21.5)
tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 21.5], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 21.5:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < 21.5Initial program 70.8%
*-commutative70.8%
*-commutative70.8%
+-commutative70.8%
*-commutative70.8%
*-commutative70.8%
fma-def70.8%
Simplified70.8%
cos-diff91.9%
+-commutative91.9%
Applied egg-rr91.9%
Taylor expanded in phi2 around 0 66.1%
if 21.5 < phi2 Initial program 84.2%
Taylor expanded in phi1 around 0 44.9%
Final simplification60.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1)))))
(if (<= phi1 -2.4e-6)
(* R (acos (* (cos phi1) t_0)))
(* R (acos (* (cos phi2) t_0))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1));
double tmp;
if (phi1 <= -2.4e-6) {
tmp = R * acos((cos(phi1) * t_0));
} else {
tmp = R * acos((cos(phi2) * t_0));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = (sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1))
if (phi1 <= (-2.4d-6)) then
tmp = r * acos((cos(phi1) * t_0))
else
tmp = r * acos((cos(phi2) * t_0))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1));
double tmp;
if (phi1 <= -2.4e-6) {
tmp = R * Math.acos((Math.cos(phi1) * t_0));
} else {
tmp = R * Math.acos((Math.cos(phi2) * t_0));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = (math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1)) tmp = 0 if phi1 <= -2.4e-6: tmp = R * math.acos((math.cos(phi1) * t_0)) else: tmp = R * math.acos((math.cos(phi2) * t_0)) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1))) tmp = 0.0 if (phi1 <= -2.4e-6) tmp = Float64(R * acos(Float64(cos(phi1) * t_0))); else tmp = Float64(R * acos(Float64(cos(phi2) * t_0))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = (sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1));
tmp = 0.0;
if (phi1 <= -2.4e-6)
tmp = R * acos((cos(phi1) * t_0));
else
tmp = R * acos((cos(phi2) * t_0));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -2.4e-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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\\
\mathbf{if}\;\phi_1 \leq -2.4 \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 phi1 < -2.3999999999999999e-6Initial program 71.9%
*-commutative71.9%
*-commutative71.9%
+-commutative71.9%
*-commutative71.9%
*-commutative71.9%
fma-def72.0%
Simplified72.0%
cos-diff99.1%
+-commutative99.1%
Applied egg-rr99.1%
Taylor expanded in phi2 around 0 57.6%
if -2.3999999999999999e-6 < phi1 Initial program 75.3%
*-commutative75.3%
*-commutative75.3%
+-commutative75.3%
*-commutative75.3%
*-commutative75.3%
fma-def75.3%
Simplified75.3%
cos-diff91.8%
+-commutative91.8%
Applied egg-rr91.8%
Taylor expanded in phi1 around 0 64.2%
Final simplification62.3%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi1) (cos phi2))))))
(t_1 (cos (- lambda1 lambda2))))
(if (<= phi1 -1.45e+185)
t_0
(if (<= phi1 -0.00062)
(* R (acos (+ (* (cos phi1) t_1) (* (sin phi1) phi2))))
(if (<= phi1 0.52)
(*
R
(acos
(+
(* (* (cos phi2) t_1) (+ (* -0.5 (* phi1 phi1)) 1.0))
(* phi1 (sin phi2)))))
t_0)))))assert(lambda1 < lambda2);
assert(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))));
double t_1 = cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -1.45e+185) {
tmp = t_0;
} else if (phi1 <= -0.00062) {
tmp = R * acos(((cos(phi1) * t_1) + (sin(phi1) * phi2)));
} else if (phi1 <= 0.52) {
tmp = R * acos((((cos(phi2) * t_1) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * sin(phi2))));
} else {
tmp = t_0;
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))))
t_1 = cos((lambda1 - lambda2))
if (phi1 <= (-1.45d+185)) then
tmp = t_0
else if (phi1 <= (-0.00062d0)) then
tmp = r * acos(((cos(phi1) * t_1) + (sin(phi1) * phi2)))
else if (phi1 <= 0.52d0) then
tmp = r * acos((((cos(phi2) * t_1) * (((-0.5d0) * (phi1 * phi1)) + 1.0d0)) + (phi1 * sin(phi2))))
else
tmp = t_0
end if
code = tmp
end function
assert lambda1 < lambda2;
assert 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))));
double t_1 = Math.cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -1.45e+185) {
tmp = t_0;
} else if (phi1 <= -0.00062) {
tmp = R * Math.acos(((Math.cos(phi1) * t_1) + (Math.sin(phi1) * phi2)));
} else if (phi1 <= 0.52) {
tmp = R * Math.acos((((Math.cos(phi2) * t_1) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * Math.sin(phi2))));
} else {
tmp = t_0;
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([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)))) t_1 = math.cos((lambda1 - lambda2)) tmp = 0 if phi1 <= -1.45e+185: tmp = t_0 elif phi1 <= -0.00062: tmp = R * math.acos(((math.cos(phi1) * t_1) + (math.sin(phi1) * phi2))) elif phi1 <= 0.52: tmp = R * math.acos((((math.cos(phi2) * t_1) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * math.sin(phi2)))) else: tmp = t_0 return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * cos(phi2))))) t_1 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi1 <= -1.45e+185) tmp = t_0; elseif (phi1 <= -0.00062) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_1) + Float64(sin(phi1) * phi2)))); elseif (phi1 <= 0.52) tmp = Float64(R * acos(Float64(Float64(Float64(cos(phi2) * t_1) * Float64(Float64(-0.5 * Float64(phi1 * phi1)) + 1.0)) + Float64(phi1 * sin(phi2))))); else tmp = t_0; end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))));
t_1 = cos((lambda1 - lambda2));
tmp = 0.0;
if (phi1 <= -1.45e+185)
tmp = t_0;
elseif (phi1 <= -0.00062)
tmp = R * acos(((cos(phi1) * t_1) + (sin(phi1) * phi2)));
elseif (phi1 <= 0.52)
tmp = R * acos((((cos(phi2) * t_1) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * sin(phi2))));
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(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]}, Block[{t$95$1 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -1.45e+185], t$95$0, If[LessEqual[phi1, -0.00062], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 0.52], N[(R * N[ArcCos[N[(N[(N[(N[Cos[phi2], $MachinePrecision] * t$95$1), $MachinePrecision] * N[(N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \phi_2\right)\\
t_1 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -1.45 \cdot 10^{+185}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\phi_1 \leq -0.00062:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t_1 + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{elif}\;\phi_1 \leq 0.52:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_2 \cdot t_1\right) \cdot \left(-0.5 \cdot \left(\phi_1 \cdot \phi_1\right) + 1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;t_0\\
\end{array}
\end{array}
if phi1 < -1.44999999999999994e185 or 0.52000000000000002 < phi1 Initial program 76.3%
*-commutative76.3%
*-commutative76.3%
+-commutative76.3%
*-commutative76.3%
*-commutative76.3%
fma-def76.4%
Simplified76.4%
Taylor expanded in lambda1 around 0 58.5%
fma-def58.5%
*-commutative58.5%
cos-neg58.5%
Simplified58.5%
Taylor expanded in lambda2 around 0 37.9%
if -1.44999999999999994e185 < phi1 < -6.2e-4Initial program 72.1%
*-commutative72.1%
*-commutative72.1%
+-commutative72.1%
*-commutative72.1%
*-commutative72.1%
fma-def72.1%
Simplified72.1%
Taylor expanded in phi2 around 0 42.2%
if -6.2e-4 < phi1 < 0.52000000000000002Initial program 73.7%
*-commutative73.7%
*-commutative73.7%
+-commutative73.7%
*-commutative73.7%
*-commutative73.7%
fma-def73.7%
Simplified73.7%
Taylor expanded in phi1 around 0 72.9%
+-commutative72.9%
associate-+r+72.9%
associate-*r*72.9%
distribute-lft1-in72.9%
unpow272.9%
Simplified72.9%
Final simplification55.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi1 -0.00062)
(* R (acos (+ t_1 (* (cos phi1) t_0))))
(if (<= phi1 0.58)
(*
R
(acos
(+
(* (* (cos phi2) t_0) (+ (* -0.5 (* phi1 phi1)) 1.0))
(* phi1 (sin phi2)))))
(* R (acos (+ t_1 (* (cos phi1) (cos phi2)))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi1 <= -0.00062) {
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
} else if (phi1 <= 0.58) {
tmp = R * acos((((cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * sin(phi2))));
} else {
tmp = R * acos((t_1 + (cos(phi1) * cos(phi2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((lambda1 - lambda2))
t_1 = sin(phi1) * sin(phi2)
if (phi1 <= (-0.00062d0)) then
tmp = r * acos((t_1 + (cos(phi1) * t_0)))
else if (phi1 <= 0.58d0) then
tmp = r * acos((((cos(phi2) * t_0) * (((-0.5d0) * (phi1 * phi1)) + 1.0d0)) + (phi1 * sin(phi2))))
else
tmp = r * acos((t_1 + (cos(phi1) * cos(phi2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda1 - lambda2));
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (phi1 <= -0.00062) {
tmp = R * Math.acos((t_1 + (Math.cos(phi1) * t_0)));
} else if (phi1 <= 0.58) {
tmp = R * Math.acos((((Math.cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * Math.sin(phi2))));
} else {
tmp = R * Math.acos((t_1 + (Math.cos(phi1) * Math.cos(phi2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if phi1 <= -0.00062: tmp = R * math.acos((t_1 + (math.cos(phi1) * t_0))) elif phi1 <= 0.58: tmp = R * math.acos((((math.cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * math.sin(phi2)))) else: tmp = R * math.acos((t_1 + (math.cos(phi1) * math.cos(phi2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi1 <= -0.00062) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * t_0)))); elseif (phi1 <= 0.58) tmp = Float64(R * acos(Float64(Float64(Float64(cos(phi2) * t_0) * Float64(Float64(-0.5 * Float64(phi1 * phi1)) + 1.0)) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * cos(phi2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda1 - lambda2));
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (phi1 <= -0.00062)
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
elseif (phi1 <= 0.58)
tmp = R * acos((((cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * sin(phi2))));
else
tmp = R * acos((t_1 + (cos(phi1) * cos(phi2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.00062], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 0.58], N[(R * N[ArcCos[N[(N[(N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.00062:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \phi_1 \cdot t_0\right)\\
\mathbf{elif}\;\phi_1 \leq 0.58:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_2 \cdot t_0\right) \cdot \left(-0.5 \cdot \left(\phi_1 \cdot \phi_1\right) + 1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \phi_1 \cdot \cos \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -6.2e-4Initial program 71.9%
Taylor expanded in phi2 around 0 40.7%
if -6.2e-4 < phi1 < 0.57999999999999996Initial program 73.7%
*-commutative73.7%
*-commutative73.7%
+-commutative73.7%
*-commutative73.7%
*-commutative73.7%
fma-def73.7%
Simplified73.7%
Taylor expanded in phi1 around 0 72.9%
+-commutative72.9%
associate-+r+72.9%
associate-*r*72.9%
distribute-lft1-in72.9%
unpow272.9%
Simplified72.9%
if 0.57999999999999996 < phi1 Initial program 78.7%
*-commutative78.7%
*-commutative78.7%
+-commutative78.7%
*-commutative78.7%
*-commutative78.7%
fma-def78.7%
Simplified78.7%
Taylor expanded in lambda1 around 0 57.8%
fma-def57.9%
*-commutative57.9%
cos-neg57.9%
Simplified57.9%
Taylor expanded in lambda2 around 0 38.7%
Final simplification55.8%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi2 3e-19)
(* R (acos (+ t_1 (* (cos phi1) t_0))))
(* R (acos (+ t_1 (* (cos phi2) t_0)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= 3e-19) {
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
} else {
tmp = R * acos((t_1 + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((lambda1 - lambda2))
t_1 = sin(phi1) * sin(phi2)
if (phi2 <= 3d-19) then
tmp = r * acos((t_1 + (cos(phi1) * t_0)))
else
tmp = r * acos((t_1 + (cos(phi2) * t_0)))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda1 - lambda2));
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (phi2 <= 3e-19) {
tmp = R * Math.acos((t_1 + (Math.cos(phi1) * t_0)));
} else {
tmp = R * Math.acos((t_1 + (Math.cos(phi2) * t_0)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if phi2 <= 3e-19: tmp = R * math.acos((t_1 + (math.cos(phi1) * t_0))) else: tmp = R * math.acos((t_1 + (math.cos(phi2) * t_0))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= 3e-19) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi2) * t_0)))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda1 - lambda2));
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (phi2 <= 3e-19)
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
else
tmp = R * acos((t_1 + (cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 3e-19], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq 3 \cdot 10^{-19}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \phi_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
if phi2 < 2.99999999999999993e-19Initial program 71.0%
Taylor expanded in phi2 around 0 51.1%
if 2.99999999999999993e-19 < phi2 Initial program 82.8%
Taylor expanded in phi1 around 0 44.5%
Final simplification49.2%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi1 -0.00062)
(* R (acos (+ (* (cos phi1) t_0) (* (sin phi1) phi2))))
(*
R
(acos
(+
(* (* (cos phi2) t_0) (+ (* -0.5 (* phi1 phi1)) 1.0))
(* phi1 (sin phi2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -0.00062) {
tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
} else {
tmp = R * acos((((cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * sin(phi2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda1 - lambda2))
if (phi1 <= (-0.00062d0)) then
tmp = r * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)))
else
tmp = r * acos((((cos(phi2) * t_0) * (((-0.5d0) * (phi1 * phi1)) + 1.0d0)) + (phi1 * sin(phi2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -0.00062) {
tmp = R * Math.acos(((Math.cos(phi1) * t_0) + (Math.sin(phi1) * phi2)));
} else {
tmp = R * Math.acos((((Math.cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * Math.sin(phi2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) tmp = 0 if phi1 <= -0.00062: tmp = R * math.acos(((math.cos(phi1) * t_0) + (math.sin(phi1) * phi2))) else: tmp = R * math.acos((((math.cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * math.sin(phi2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi1 <= -0.00062) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_0) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(Float64(Float64(cos(phi2) * t_0) * Float64(Float64(-0.5 * Float64(phi1 * phi1)) + 1.0)) + Float64(phi1 * sin(phi2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda1 - lambda2));
tmp = 0.0;
if (phi1 <= -0.00062)
tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
else
tmp = R * acos((((cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * sin(phi2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -0.00062], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -0.00062:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t_0 + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_2 \cdot t_0\right) \cdot \left(-0.5 \cdot \left(\phi_1 \cdot \phi_1\right) + 1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -6.2e-4Initial program 71.9%
*-commutative71.9%
*-commutative71.9%
+-commutative71.9%
*-commutative71.9%
*-commutative71.9%
fma-def72.0%
Simplified72.0%
Taylor expanded in phi2 around 0 32.5%
if -6.2e-4 < phi1 Initial program 75.3%
*-commutative75.3%
*-commutative75.3%
+-commutative75.3%
*-commutative75.3%
*-commutative75.3%
fma-def75.3%
Simplified75.3%
Taylor expanded in phi1 around 0 49.1%
+-commutative49.1%
associate-+r+49.1%
associate-*r*49.1%
distribute-lft1-in49.1%
unpow249.1%
Simplified49.1%
Final simplification44.4%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi1 -0.00062)
(*
R
(acos
(+
(* (sin phi1) phi2)
(* (* (cos phi1) t_0) (+ 1.0 (* -0.5 (* phi2 phi2)))))))
(*
R
(acos
(+
(* (* (cos phi2) t_0) (+ (* -0.5 (* phi1 phi1)) 1.0))
(* phi1 (sin phi2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -0.00062) {
tmp = R * acos(((sin(phi1) * phi2) + ((cos(phi1) * t_0) * (1.0 + (-0.5 * (phi2 * phi2))))));
} else {
tmp = R * acos((((cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * sin(phi2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda1 - lambda2))
if (phi1 <= (-0.00062d0)) then
tmp = r * acos(((sin(phi1) * phi2) + ((cos(phi1) * t_0) * (1.0d0 + ((-0.5d0) * (phi2 * phi2))))))
else
tmp = r * acos((((cos(phi2) * t_0) * (((-0.5d0) * (phi1 * phi1)) + 1.0d0)) + (phi1 * sin(phi2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -0.00062) {
tmp = R * Math.acos(((Math.sin(phi1) * phi2) + ((Math.cos(phi1) * t_0) * (1.0 + (-0.5 * (phi2 * phi2))))));
} else {
tmp = R * Math.acos((((Math.cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * Math.sin(phi2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) tmp = 0 if phi1 <= -0.00062: tmp = R * math.acos(((math.sin(phi1) * phi2) + ((math.cos(phi1) * t_0) * (1.0 + (-0.5 * (phi2 * phi2)))))) else: tmp = R * math.acos((((math.cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * math.sin(phi2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi1 <= -0.00062) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * phi2) + Float64(Float64(cos(phi1) * t_0) * Float64(1.0 + Float64(-0.5 * Float64(phi2 * phi2))))))); else tmp = Float64(R * acos(Float64(Float64(Float64(cos(phi2) * t_0) * Float64(Float64(-0.5 * Float64(phi1 * phi1)) + 1.0)) + Float64(phi1 * sin(phi2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda1 - lambda2));
tmp = 0.0;
if (phi1 <= -0.00062)
tmp = R * acos(((sin(phi1) * phi2) + ((cos(phi1) * t_0) * (1.0 + (-0.5 * (phi2 * phi2))))));
else
tmp = R * acos((((cos(phi2) * t_0) * ((-0.5 * (phi1 * phi1)) + 1.0)) + (phi1 * sin(phi2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -0.00062], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(phi2 * phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(-0.5 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -0.00062:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \phi_2 + \left(\cos \phi_1 \cdot t_0\right) \cdot \left(1 + -0.5 \cdot \left(\phi_2 \cdot \phi_2\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_2 \cdot t_0\right) \cdot \left(-0.5 \cdot \left(\phi_1 \cdot \phi_1\right) + 1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -6.2e-4Initial program 71.9%
*-commutative71.9%
*-commutative71.9%
+-commutative71.9%
*-commutative71.9%
*-commutative71.9%
fma-def72.0%
Simplified72.0%
Taylor expanded in phi2 around 0 32.7%
+-commutative32.7%
associate-+r+32.7%
associate-*r*32.7%
distribute-lft1-in32.7%
unpow232.7%
Simplified32.7%
if -6.2e-4 < phi1 Initial program 75.3%
*-commutative75.3%
*-commutative75.3%
+-commutative75.3%
*-commutative75.3%
*-commutative75.3%
fma-def75.3%
Simplified75.3%
Taylor expanded in phi1 around 0 49.1%
+-commutative49.1%
associate-+r+49.1%
associate-*r*49.1%
distribute-lft1-in49.1%
unpow249.1%
Simplified49.1%
Final simplification44.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= phi1 -0.029)
(* R (acos (* (cos phi1) (cos lambda2))))
(if (<= phi1 -2.3e-185)
(* R (acos (+ t_0 (cos (- lambda2 lambda1)))))
(* R (acos (+ t_0 (* (cos phi2) (cos lambda1)))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (phi1 <= -0.029) {
tmp = R * acos((cos(phi1) * cos(lambda2)));
} else if (phi1 <= -2.3e-185) {
tmp = R * acos((t_0 + cos((lambda2 - lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (phi1 <= (-0.029d0)) then
tmp = r * acos((cos(phi1) * cos(lambda2)))
else if (phi1 <= (-2.3d-185)) then
tmp = r * acos((t_0 + cos((lambda2 - lambda1))))
else
tmp = r * acos((t_0 + (cos(phi2) * cos(lambda1))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (phi1 <= -0.029) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
} else if (phi1 <= -2.3e-185) {
tmp = R * Math.acos((t_0 + Math.cos((lambda2 - lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda1))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if phi1 <= -0.029: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda2))) elif phi1 <= -2.3e-185: tmp = R * math.acos((t_0 + math.cos((lambda2 - lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda1)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (phi1 <= -0.029) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda2)))); elseif (phi1 <= -2.3e-185) tmp = Float64(R * acos(Float64(t_0 + cos(Float64(lambda2 - lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda1))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (phi1 <= -0.029)
tmp = R * acos((cos(phi1) * cos(lambda2)));
elseif (phi1 <= -2.3e-185)
tmp = R * acos((t_0 + cos((lambda2 - lambda1))));
else
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.029], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -2.3e-185], N[(R * N[ArcCos[N[(t$95$0 + N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -0.029:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\
\mathbf{elif}\;\phi_1 \leq -2.3 \cdot 10^{-185}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -0.0290000000000000015Initial program 71.9%
*-commutative71.9%
*-commutative71.9%
+-commutative71.9%
*-commutative71.9%
*-commutative71.9%
fma-def72.0%
Simplified72.0%
Taylor expanded in lambda1 around 0 54.2%
fma-def54.2%
*-commutative54.2%
cos-neg54.2%
Simplified54.2%
Taylor expanded in phi2 around 0 33.4%
*-commutative33.4%
Simplified33.4%
if -0.0290000000000000015 < phi1 < -2.3000000000000001e-185Initial program 72.9%
*-commutative72.9%
*-commutative72.9%
+-commutative72.9%
*-commutative72.9%
*-commutative72.9%
fma-def72.9%
Simplified72.9%
Taylor expanded in phi1 around 0 72.9%
Taylor expanded in phi2 around 0 47.9%
sub-neg47.9%
remove-double-neg47.9%
mul-1-neg47.9%
distribute-neg-in47.9%
+-commutative47.9%
cos-neg47.9%
mul-1-neg47.9%
unsub-neg47.9%
Simplified47.9%
if -2.3000000000000001e-185 < phi1 Initial program 75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
*-commutative75.8%
*-commutative75.8%
fma-def75.8%
Simplified75.8%
Taylor expanded in phi1 around 0 45.2%
Taylor expanded in lambda2 around 0 30.6%
Final simplification33.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= phi1 -1.45e-5)
(* R (acos (* (cos phi1) (cos lambda2))))
(if (<= phi1 -1.9e-191)
(* R (acos (+ t_0 (* (cos phi2) (cos lambda2)))))
(* R (acos (+ t_0 (* (cos phi2) (cos lambda1)))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (phi1 <= -1.45e-5) {
tmp = R * acos((cos(phi1) * cos(lambda2)));
} else if (phi1 <= -1.9e-191) {
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda2))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (phi1 <= (-1.45d-5)) then
tmp = r * acos((cos(phi1) * cos(lambda2)))
else if (phi1 <= (-1.9d-191)) then
tmp = r * acos((t_0 + (cos(phi2) * cos(lambda2))))
else
tmp = r * acos((t_0 + (cos(phi2) * cos(lambda1))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (phi1 <= -1.45e-5) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
} else if (phi1 <= -1.9e-191) {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda2))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda1))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if phi1 <= -1.45e-5: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda2))) elif phi1 <= -1.9e-191: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda2)))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda1)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (phi1 <= -1.45e-5) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda2)))); elseif (phi1 <= -1.9e-191) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda2))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda1))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (phi1 <= -1.45e-5)
tmp = R * acos((cos(phi1) * cos(lambda2)));
elseif (phi1 <= -1.9e-191)
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda2))));
else
tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -1.45e-5], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -1.9e-191], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -1.45 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\
\mathbf{elif}\;\phi_1 \leq -1.9 \cdot 10^{-191}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -1.45e-5Initial program 71.9%
*-commutative71.9%
*-commutative71.9%
+-commutative71.9%
*-commutative71.9%
*-commutative71.9%
fma-def72.0%
Simplified72.0%
Taylor expanded in lambda1 around 0 54.2%
fma-def54.2%
*-commutative54.2%
cos-neg54.2%
Simplified54.2%
Taylor expanded in phi2 around 0 33.4%
*-commutative33.4%
Simplified33.4%
if -1.45e-5 < phi1 < -1.8999999999999999e-191Initial program 72.9%
*-commutative72.9%
*-commutative72.9%
+-commutative72.9%
*-commutative72.9%
*-commutative72.9%
fma-def72.9%
Simplified72.9%
Taylor expanded in phi1 around 0 72.9%
Taylor expanded in lambda1 around 0 41.2%
cos-neg41.2%
Simplified41.2%
if -1.8999999999999999e-191 < phi1 Initial program 75.8%
*-commutative75.8%
*-commutative75.8%
+-commutative75.8%
*-commutative75.8%
*-commutative75.8%
fma-def75.8%
Simplified75.8%
Taylor expanded in phi1 around 0 45.2%
Taylor expanded in lambda2 around 0 30.6%
Final simplification32.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -0.034)
(* R (acos (* (cos phi1) (cos lambda2))))
(*
R
(acos (+ (* (cos phi2) (cos (- lambda1 lambda2))) (* phi1 (sin phi2)))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.034) {
tmp = R * acos((cos(phi1) * cos(lambda2)));
} else {
tmp = R * acos(((cos(phi2) * cos((lambda1 - lambda2))) + (phi1 * sin(phi2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-0.034d0)) then
tmp = r * acos((cos(phi1) * cos(lambda2)))
else
tmp = r * acos(((cos(phi2) * cos((lambda1 - lambda2))) + (phi1 * sin(phi2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.034) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
} else {
tmp = R * Math.acos(((Math.cos(phi2) * Math.cos((lambda1 - lambda2))) + (phi1 * Math.sin(phi2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.034: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda2))) else: tmp = R * math.acos(((math.cos(phi2) * math.cos((lambda1 - lambda2))) + (phi1 * math.sin(phi2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.034) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda2)))); else tmp = Float64(R * acos(Float64(Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))) + Float64(phi1 * sin(phi2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.034)
tmp = R * acos((cos(phi1) * cos(lambda2)));
else
tmp = R * acos(((cos(phi2) * cos((lambda1 - lambda2))) + (phi1 * sin(phi2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.034], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.034:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -0.034000000000000002Initial program 71.9%
*-commutative71.9%
*-commutative71.9%
+-commutative71.9%
*-commutative71.9%
*-commutative71.9%
fma-def72.0%
Simplified72.0%
Taylor expanded in lambda1 around 0 54.2%
fma-def54.2%
*-commutative54.2%
cos-neg54.2%
Simplified54.2%
Taylor expanded in phi2 around 0 33.4%
*-commutative33.4%
Simplified33.4%
if -0.034000000000000002 < phi1 Initial program 75.3%
*-commutative75.3%
*-commutative75.3%
+-commutative75.3%
*-commutative75.3%
*-commutative75.3%
fma-def75.3%
Simplified75.3%
Taylor expanded in phi1 around 0 50.0%
Final simplification45.4%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi1 -0.00021)
(* R (acos (+ (* (cos phi1) t_0) (* (sin phi1) phi2))))
(* R (acos (+ (* (cos phi2) t_0) (* phi1 (sin phi2))))))))assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -0.00021) {
tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
} else {
tmp = R * acos(((cos(phi2) * t_0) + (phi1 * sin(phi2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda1 - lambda2))
if (phi1 <= (-0.00021d0)) then
tmp = r * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)))
else
tmp = r * acos(((cos(phi2) * t_0) + (phi1 * sin(phi2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda1 - lambda2));
double tmp;
if (phi1 <= -0.00021) {
tmp = R * Math.acos(((Math.cos(phi1) * t_0) + (Math.sin(phi1) * phi2)));
} else {
tmp = R * Math.acos(((Math.cos(phi2) * t_0) + (phi1 * Math.sin(phi2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) tmp = 0 if phi1 <= -0.00021: tmp = R * math.acos(((math.cos(phi1) * t_0) + (math.sin(phi1) * phi2))) else: tmp = R * math.acos(((math.cos(phi2) * t_0) + (phi1 * math.sin(phi2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi1 <= -0.00021) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_0) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(Float64(cos(phi2) * t_0) + Float64(phi1 * sin(phi2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda1 - lambda2));
tmp = 0.0;
if (phi1 <= -0.00021)
tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
else
tmp = R * acos(((cos(phi2) * t_0) + (phi1 * sin(phi2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -0.00021], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_1 \leq -0.00021:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t_0 + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot t_0 + \phi_1 \cdot \sin \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -2.1000000000000001e-4Initial program 71.9%
*-commutative71.9%
*-commutative71.9%
+-commutative71.9%
*-commutative71.9%
*-commutative71.9%
fma-def72.0%
Simplified72.0%
Taylor expanded in phi2 around 0 32.5%
if -2.1000000000000001e-4 < phi1 Initial program 75.3%
*-commutative75.3%
*-commutative75.3%
+-commutative75.3%
*-commutative75.3%
*-commutative75.3%
fma-def75.3%
Simplified75.3%
Taylor expanded in phi1 around 0 50.0%
Final simplification45.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -7.5e-6) (* R (acos (+ (* (sin phi1) (sin phi2)) (cos lambda1)))) (* R (acos (* (cos phi1) (cos lambda2))))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -7.5e-6) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + cos(lambda1)));
} else {
tmp = R * acos((cos(phi1) * cos(lambda2)));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-7.5d-6)) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + cos(lambda1)))
else
tmp = r * acos((cos(phi1) * cos(lambda2)))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -7.5e-6) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + Math.cos(lambda1)));
} else {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -7.5e-6: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + math.cos(lambda1))) else: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda2))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -7.5e-6) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + cos(lambda1)))); else tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda2)))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -7.5e-6)
tmp = R * acos(((sin(phi1) * sin(phi2)) + cos(lambda1)));
else
tmp = R * acos((cos(phi1) * cos(lambda2)));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -7.5e-6], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -7.5 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda1 < -7.50000000000000019e-6Initial program 64.7%
Taylor expanded in lambda2 around 0 64.7%
associate-*r*64.7%
Simplified64.7%
Taylor expanded in phi1 around 0 36.5%
Taylor expanded in phi2 around 0 25.3%
if -7.50000000000000019e-6 < lambda1 Initial program 77.5%
*-commutative77.5%
*-commutative77.5%
+-commutative77.5%
*-commutative77.5%
*-commutative77.5%
fma-def77.5%
Simplified77.5%
Taylor expanded in lambda1 around 0 62.4%
fma-def62.4%
*-commutative62.4%
cos-neg62.4%
Simplified62.4%
Taylor expanded in phi2 around 0 31.3%
*-commutative31.3%
Simplified31.3%
Final simplification29.8%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 21.5) (* R (acos (* (cos phi1) (cos lambda2)))) (* R (acos (+ (* (sin phi1) (sin phi2)) (cos phi2))))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 21.5) {
tmp = R * acos((cos(phi1) * cos(lambda2)));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + cos(phi2)));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 21.5d0) then
tmp = r * acos((cos(phi1) * cos(lambda2)))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + cos(phi2)))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 21.5) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + Math.cos(phi2)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 21.5: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda2))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + math.cos(phi2))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 21.5) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda2)))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + cos(phi2)))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 21.5)
tmp = R * acos((cos(phi1) * cos(lambda2)));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + cos(phi2)));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 21.5], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 21.5:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 21.5Initial program 70.8%
*-commutative70.8%
*-commutative70.8%
+-commutative70.8%
*-commutative70.8%
*-commutative70.8%
fma-def70.8%
Simplified70.8%
Taylor expanded in lambda1 around 0 46.3%
fma-def46.2%
*-commutative46.2%
cos-neg46.2%
Simplified46.2%
Taylor expanded in phi2 around 0 32.2%
*-commutative32.2%
Simplified32.2%
if 21.5 < phi2 Initial program 84.2%
Taylor expanded in lambda2 around 0 60.0%
associate-*r*60.0%
Simplified60.0%
Taylor expanded in phi1 around 0 36.0%
Taylor expanded in lambda1 around 0 26.5%
Final simplification30.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.029) (* R (acos (* (cos phi1) (cos lambda2)))) (* R (acos (+ (* phi1 (sin phi2)) (cos (- lambda2 lambda1)))))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.029) {
tmp = R * acos((cos(phi1) * cos(lambda2)));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + cos((lambda2 - lambda1))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-0.029d0)) then
tmp = r * acos((cos(phi1) * cos(lambda2)))
else
tmp = r * acos(((phi1 * sin(phi2)) + cos((lambda2 - lambda1))))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.029) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + Math.cos((lambda2 - lambda1))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.029: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda2))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + math.cos((lambda2 - lambda1)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.029) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda2)))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + cos(Float64(lambda2 - lambda1))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.029)
tmp = R * acos((cos(phi1) * cos(lambda2)));
else
tmp = R * acos(((phi1 * sin(phi2)) + cos((lambda2 - lambda1))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.029], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.029:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.0290000000000000015Initial program 71.9%
*-commutative71.9%
*-commutative71.9%
+-commutative71.9%
*-commutative71.9%
*-commutative71.9%
fma-def72.0%
Simplified72.0%
Taylor expanded in lambda1 around 0 54.2%
fma-def54.2%
*-commutative54.2%
cos-neg54.2%
Simplified54.2%
Taylor expanded in phi2 around 0 33.4%
*-commutative33.4%
Simplified33.4%
if -0.0290000000000000015 < phi1 Initial program 75.3%
*-commutative75.3%
*-commutative75.3%
+-commutative75.3%
*-commutative75.3%
*-commutative75.3%
fma-def75.3%
Simplified75.3%
Taylor expanded in phi1 around 0 50.0%
Taylor expanded in phi2 around 0 28.4%
sub-neg28.4%
remove-double-neg28.4%
mul-1-neg28.4%
distribute-neg-in28.4%
+-commutative28.4%
cos-neg28.4%
mul-1-neg28.4%
unsub-neg28.4%
Simplified28.4%
Final simplification29.8%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (* (cos phi1) (cos lambda2)))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos((cos(phi1) * cos(lambda2)));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos((cos(phi1) * cos(lambda2)))
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos((math.cos(phi1) * math.cos(lambda2)))
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(cos(phi1) * cos(lambda2)))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos((cos(phi1) * cos(lambda2)));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)
\end{array}
Initial program 74.4%
*-commutative74.4%
*-commutative74.4%
+-commutative74.4%
*-commutative74.4%
*-commutative74.4%
fma-def74.4%
Simplified74.4%
Taylor expanded in lambda1 around 0 51.8%
fma-def51.8%
*-commutative51.8%
cos-neg51.8%
Simplified51.8%
Taylor expanded in phi2 around 0 27.7%
*-commutative27.7%
Simplified27.7%
Final simplification27.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 0.0021) (* lambda2 R) (* R (acos (cos lambda2)))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.0021) {
tmp = lambda2 * R;
} else {
tmp = R * acos(cos(lambda2));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 0.0021d0) then
tmp = lambda2 * r
else
tmp = r * acos(cos(lambda2))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.0021) {
tmp = lambda2 * R;
} else {
tmp = R * Math.acos(Math.cos(lambda2));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 0.0021: tmp = lambda2 * R else: tmp = R * math.acos(math.cos(lambda2)) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 0.0021) tmp = Float64(lambda2 * R); else tmp = Float64(R * acos(cos(lambda2))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 0.0021)
tmp = lambda2 * R;
else
tmp = R * acos(cos(lambda2));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 0.0021], N[(lambda2 * R), $MachinePrecision], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 0.0021:\\
\;\;\;\;\lambda_2 \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\
\end{array}
\end{array}
if lambda2 < 0.00209999999999999987Initial program 81.1%
*-commutative81.1%
*-commutative81.1%
+-commutative81.1%
*-commutative81.1%
*-commutative81.1%
fma-def81.2%
Simplified81.2%
Taylor expanded in lambda1 around 0 51.4%
fma-def51.4%
*-commutative51.4%
cos-neg51.4%
Simplified51.4%
Taylor expanded in phi2 around 0 26.2%
*-commutative26.2%
Simplified26.2%
Taylor expanded in phi1 around 0 12.7%
Taylor expanded in lambda2 around 0 6.2%
if 0.00209999999999999987 < lambda2 Initial program 53.5%
*-commutative53.5%
*-commutative53.5%
+-commutative53.5%
*-commutative53.5%
*-commutative53.5%
fma-def53.5%
Simplified53.5%
Taylor expanded in lambda1 around 0 53.1%
fma-def53.1%
*-commutative53.1%
cos-neg53.1%
Simplified53.1%
Taylor expanded in phi2 around 0 32.4%
*-commutative32.4%
Simplified32.4%
Taylor expanded in phi1 around 0 28.4%
Final simplification11.6%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 2.15e-8) (* R (acos (cos phi1))) (* R (acos (cos lambda2)))))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.15e-8) {
tmp = R * acos(cos(phi1));
} else {
tmp = R * acos(cos(lambda2));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 2.15d-8) then
tmp = r * acos(cos(phi1))
else
tmp = r * acos(cos(lambda2))
end if
code = tmp
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.15e-8) {
tmp = R * Math.acos(Math.cos(phi1));
} else {
tmp = R * Math.acos(Math.cos(lambda2));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 2.15e-8: tmp = R * math.acos(math.cos(phi1)) else: tmp = R * math.acos(math.cos(lambda2)) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2.15e-8) tmp = Float64(R * acos(cos(phi1))); else tmp = Float64(R * acos(cos(lambda2))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 2.15e-8)
tmp = R * acos(cos(phi1));
else
tmp = R * acos(cos(lambda2));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2.15e-8], N[(R * N[ArcCos[N[Cos[phi1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2.15 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \phi_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\
\end{array}
\end{array}
if lambda2 < 2.1500000000000001e-8Initial program 81.5%
*-commutative81.5%
*-commutative81.5%
+-commutative81.5%
*-commutative81.5%
*-commutative81.5%
fma-def81.6%
Simplified81.6%
Taylor expanded in lambda1 around 0 51.5%
fma-def51.5%
*-commutative51.5%
cos-neg51.5%
Simplified51.5%
Taylor expanded in phi2 around 0 26.0%
*-commutative26.0%
Simplified26.0%
Taylor expanded in lambda2 around 0 19.0%
if 2.1500000000000001e-8 < lambda2 Initial program 53.2%
*-commutative53.2%
*-commutative53.2%
+-commutative53.2%
*-commutative53.2%
*-commutative53.2%
fma-def53.2%
Simplified53.2%
Taylor expanded in lambda1 around 0 52.8%
fma-def52.8%
*-commutative52.8%
cos-neg52.8%
Simplified52.8%
Taylor expanded in phi2 around 0 32.7%
*-commutative32.7%
Simplified32.7%
Taylor expanded in phi1 around 0 28.8%
Final simplification21.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* lambda2 R))
assert(lambda1 < lambda2);
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return lambda2 * R;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = lambda2 * r
end function
assert lambda1 < lambda2;
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return lambda2 * R;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) [phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return lambda2 * R
lambda1, lambda2 = sort([lambda1, lambda2]) phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(lambda2 * R) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = lambda2 * R;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. NOTE: 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}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\lambda_2 \cdot R
\end{array}
Initial program 74.4%
*-commutative74.4%
*-commutative74.4%
+-commutative74.4%
*-commutative74.4%
*-commutative74.4%
fma-def74.4%
Simplified74.4%
Taylor expanded in lambda1 around 0 51.8%
fma-def51.8%
*-commutative51.8%
cos-neg51.8%
Simplified51.8%
Taylor expanded in phi2 around 0 27.7%
*-commutative27.7%
Simplified27.7%
Taylor expanded in phi1 around 0 16.6%
Taylor expanded in lambda2 around 0 6.1%
Final simplification6.1%
herbie shell --seed 2023293
(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))