
(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 29 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= (+ t_0 (* t_1 (cos (- lambda1 lambda2)))) 0.99999)
(*
(acos
(+
t_0
(*
t_1
(fma
(cos lambda2)
(cos lambda1)
(log1p (expm1 (* (sin lambda2) (sin lambda1))))))))
R)
(* R (- lambda2 lambda1)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if ((t_0 + (t_1 * cos((lambda1 - lambda2)))) <= 0.99999) {
tmp = acos((t_0 + (t_1 * fma(cos(lambda2), cos(lambda1), log1p(expm1((sin(lambda2) * sin(lambda1)))))))) * R;
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (Float64(t_0 + Float64(t_1 * cos(Float64(lambda1 - lambda2)))) <= 0.99999) tmp = Float64(acos(Float64(t_0 + Float64(t_1 * fma(cos(lambda2), cos(lambda1), log1p(expm1(Float64(sin(lambda2) * sin(lambda1)))))))) * R); else tmp = Float64(R * Float64(lambda2 - lambda1)); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 + N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.99999], N[(N[ArcCos[N[(t$95$0 + N[(t$95$1 * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[Log[1 + N[(Exp[N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;t\_0 + t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right) \leq 0.99999:\\
\;\;\;\;\cos^{-1} \left(t\_0 + t\_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \mathsf{log1p}\left(\mathsf{expm1}\left(\sin \lambda_2 \cdot \sin \lambda_1\right)\right)\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) < 0.999990000000000046Initial program 77.7%
cos-diff98.9%
distribute-lft-in98.9%
Applied egg-rr98.9%
distribute-lft-out98.9%
*-commutative98.9%
fma-undefine98.9%
*-commutative98.9%
Simplified98.9%
log1p-expm1-u99.0%
Applied egg-rr99.0%
if 0.999990000000000046 < (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) Initial program 7.5%
*-commutative7.5%
*-commutative7.5%
*-commutative7.5%
*-commutative7.5%
associate-*l*7.5%
associate-*l*7.5%
*-commutative7.5%
cos-neg7.5%
sub-neg7.5%
+-commutative7.5%
distribute-neg-out7.5%
remove-double-neg7.5%
sub-neg7.5%
Simplified7.5%
Taylor expanded in phi2 around 0 7.5%
Taylor expanded in phi1 around 0 7.5%
Taylor expanded in lambda2 around 0 61.1%
neg-mul-161.1%
sub-neg61.1%
Simplified61.1%
Final simplification97.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= (acos (+ t_0 (* t_1 (cos (- lambda1 lambda2))))) 1e-7)
(* R (- lambda2 lambda1))
(*
R
(acos
(fma
t_1
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1)))
t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (acos((t_0 + (t_1 * cos((lambda1 - lambda2))))) <= 1e-7) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * acos(fma(t_1, ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))), t_0));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (acos(Float64(t_0 + Float64(t_1 * cos(Float64(lambda1 - lambda2))))) <= 1e-7) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * acos(fma(t_1, Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))), t_0))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[ArcCos[N[(t$95$0 + N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 1e-7], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\cos^{-1} \left(t\_0 + t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \leq 10^{-7}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(t\_1, \sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1, t\_0\right)\right)\\
\end{array}
\end{array}
if (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) < 9.9999999999999995e-8Initial program 7.5%
*-commutative7.5%
*-commutative7.5%
*-commutative7.5%
*-commutative7.5%
associate-*l*7.5%
associate-*l*7.5%
*-commutative7.5%
cos-neg7.5%
sub-neg7.5%
+-commutative7.5%
distribute-neg-out7.5%
remove-double-neg7.5%
sub-neg7.5%
Simplified7.5%
Taylor expanded in phi2 around 0 7.5%
Taylor expanded in phi1 around 0 7.5%
Taylor expanded in lambda2 around 0 61.1%
neg-mul-161.1%
sub-neg61.1%
Simplified61.1%
if 9.9999999999999995e-8 < (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) Initial program 77.7%
*-commutative77.7%
*-commutative77.7%
*-commutative77.7%
*-commutative77.7%
associate-*l*77.7%
associate-*l*77.7%
*-commutative77.7%
cos-neg77.7%
sub-neg77.7%
+-commutative77.7%
distribute-neg-out77.7%
remove-double-neg77.7%
sub-neg77.7%
Simplified77.7%
cos-diff55.1%
+-commutative55.1%
*-commutative55.1%
*-commutative55.1%
Applied egg-rr98.9%
Final simplification97.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<=
(acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
1e-7)
(* R (- lambda2 lambda1))
(*
R
(acos
(+
t_0
(*
(cos phi1)
(*
(cos phi2)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) <= 1e-7) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) <= 1d-7) then
tmp = r * (lambda2 - lambda1)
else
tmp = r * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (Math.acos((t_0 + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) <= 1e-7) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1)))))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if math.acos((t_0 + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) <= 1e-7: tmp = R * (lambda2 - lambda1) else: tmp = R * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * ((math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1))))))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) <= 1e-7) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) <= 1e-7)
tmp = R * (lambda2 - lambda1);
else
tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 1e-7], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\cos^{-1} \left(t\_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \leq 10^{-7}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\right)\\
\end{array}
\end{array}
if (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) < 9.9999999999999995e-8Initial program 7.5%
*-commutative7.5%
*-commutative7.5%
*-commutative7.5%
*-commutative7.5%
associate-*l*7.5%
associate-*l*7.5%
*-commutative7.5%
cos-neg7.5%
sub-neg7.5%
+-commutative7.5%
distribute-neg-out7.5%
remove-double-neg7.5%
sub-neg7.5%
Simplified7.5%
Taylor expanded in phi2 around 0 7.5%
Taylor expanded in phi1 around 0 7.5%
Taylor expanded in lambda2 around 0 61.1%
neg-mul-161.1%
sub-neg61.1%
Simplified61.1%
if 9.9999999999999995e-8 < (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) Initial program 77.7%
cos-diff98.9%
distribute-lft-in98.9%
Applied egg-rr98.9%
distribute-lft-out98.9%
*-commutative98.9%
fma-undefine98.9%
*-commutative98.9%
Simplified98.9%
Taylor expanded in phi1 around inf 98.9%
Final simplification97.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= (+ t_0 (* t_1 (cos (- lambda1 lambda2)))) 0.99999)
(*
R
(acos
(+
t_0
(*
t_1
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1)))))))
(* R (- lambda2 lambda1)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if ((t_0 + (t_1 * cos((lambda1 - lambda2)))) <= 0.99999) {
tmp = R * acos((t_0 + (t_1 * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1))))));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (Float64(t_0 + Float64(t_1 * cos(Float64(lambda1 - lambda2)))) <= 0.99999) tmp = Float64(R * acos(Float64(t_0 + Float64(t_1 * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1))))))); else tmp = Float64(R * Float64(lambda2 - lambda1)); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 + N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.99999], N[(R * N[ArcCos[N[(t$95$0 + N[(t$95$1 * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;t\_0 + t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right) \leq 0.99999:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + t\_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) < 0.999990000000000046Initial program 77.7%
cos-diff98.9%
distribute-lft-in98.9%
Applied egg-rr98.9%
distribute-lft-out98.9%
*-commutative98.9%
fma-undefine98.9%
*-commutative98.9%
Simplified98.9%
if 0.999990000000000046 < (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))) Initial program 7.5%
*-commutative7.5%
*-commutative7.5%
*-commutative7.5%
*-commutative7.5%
associate-*l*7.5%
associate-*l*7.5%
*-commutative7.5%
cos-neg7.5%
sub-neg7.5%
+-commutative7.5%
distribute-neg-out7.5%
remove-double-neg7.5%
sub-neg7.5%
Simplified7.5%
Taylor expanded in phi2 around 0 7.5%
Taylor expanded in phi1 around 0 7.5%
Taylor expanded in lambda2 around 0 61.1%
neg-mul-161.1%
sub-neg61.1%
Simplified61.1%
Final simplification97.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= phi2 -2.4e-6)
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))
(if (<= phi2 4.6e-7)
(*
R
(acos
(+
t_0
(*
(cos phi1)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))
(*
R
(log
(exp
(acos
(fma
(cos phi1)
(* (cos phi2) (cos (- lambda2 lambda1)))
t_0)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -2.4e-6) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))));
} else if (phi2 <= 4.6e-7) {
tmp = R * acos((t_0 + (cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))));
} else {
tmp = R * log(exp(acos(fma(cos(phi1), (cos(phi2) * cos((lambda2 - lambda1))), t_0))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -2.4e-6) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))); elseif (phi2 <= 4.6e-7) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))); else tmp = Float64(R * log(exp(acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))), t_0))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -2.4e-6], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 4.6e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Log[N[Exp[N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -2.4 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 4.6 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \log \left(e^{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right), t\_0\right)\right)}\right)\\
\end{array}
\end{array}
if phi2 < -2.3999999999999999e-6Initial program 79.6%
Simplified79.7%
if -2.3999999999999999e-6 < phi2 < 4.5999999999999999e-7Initial program 68.9%
cos-diff90.8%
distribute-lft-in90.8%
Applied egg-rr90.8%
distribute-lft-out90.8%
*-commutative90.8%
fma-undefine90.8%
*-commutative90.8%
Simplified90.8%
Taylor expanded in phi2 around 0 90.8%
if 4.5999999999999999e-7 < phi2 Initial program 80.4%
*-commutative80.4%
*-commutative80.4%
*-commutative80.4%
*-commutative80.4%
associate-*l*80.4%
associate-*l*80.4%
*-commutative80.4%
cos-neg80.4%
sub-neg80.4%
+-commutative80.4%
distribute-neg-out80.4%
remove-double-neg80.4%
sub-neg80.4%
Simplified80.5%
add-log-exp80.6%
cos-diff99.4%
*-commutative99.4%
*-commutative99.4%
cos-diff80.6%
fma-define80.4%
associate-*r*80.5%
fma-undefine80.6%
Applied egg-rr80.6%
Final simplification85.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 -1.85e-5)
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))
(if (<= phi2 1.55e-6)
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(cos phi1)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))
(*
R
(log
(exp
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda2 lambda1))))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -1.85e-5) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))));
} else if (phi2 <= 1.55e-6) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))));
} else {
tmp = R * log(exp(acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda2 - lambda1))))))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -1.85e-5) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))); elseif (phi2 <= 1.55e-6) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))); else tmp = Float64(R * log(exp(acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -1.85e-5], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.55e-6], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Log[N[Exp[N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.85 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.55 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \log \left(e^{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\right)}\right)\\
\end{array}
\end{array}
if phi2 < -1.84999999999999991e-5Initial program 79.6%
Simplified79.7%
if -1.84999999999999991e-5 < phi2 < 1.55e-6Initial program 68.9%
cos-diff90.8%
distribute-lft-in90.8%
Applied egg-rr90.8%
distribute-lft-out90.8%
*-commutative90.8%
fma-undefine90.8%
*-commutative90.8%
Simplified90.8%
Taylor expanded in phi2 around 0 90.8%
if 1.55e-6 < phi2 Initial program 80.4%
cos-diff99.3%
distribute-lft-in99.3%
Applied egg-rr99.3%
distribute-lft-out99.3%
*-commutative99.3%
fma-undefine99.3%
*-commutative99.3%
Simplified99.3%
log1p-expm1-u99.3%
Applied egg-rr99.3%
add-log-exp99.3%
fma-define99.5%
fma-undefine99.5%
log1p-expm1-u99.5%
cos-diff80.6%
associate-*l*80.6%
Applied egg-rr80.6%
Final simplification85.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi2) (cos (- lambda1 lambda2))))
(t_1 (* (sin phi1) (sin phi2))))
(if (<= phi2 -1.95e-7)
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi1) t_0))))
(if (<= phi2 1.4e-10)
(*
R
(acos
(+
t_1
(*
(cos phi1)
(+
(* (sin lambda2) (sin lambda1))
(* (cos lambda2) (cos lambda1)))))))
(* R (acos (fma (cos phi1) t_0 t_1)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos((lambda1 - lambda2));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -1.95e-7) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * t_0)));
} else if (phi2 <= 1.4e-10) {
tmp = R * acos((t_1 + (cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))))));
} else {
tmp = R * acos(fma(cos(phi1), t_0, t_1));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -1.95e-7) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * t_0)))); elseif (phi2 <= 1.4e-10) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))))))); else tmp = Float64(R * acos(fma(cos(phi1), t_0, t_1))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -1.95e-7], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.4e-10], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -1.95 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.4 \cdot 10^{-10}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, t\_0, t\_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.95000000000000012e-7Initial program 79.6%
Simplified79.7%
if -1.95000000000000012e-7 < phi2 < 1.40000000000000008e-10Initial program 68.9%
cos-diff90.8%
distribute-lft-in90.8%
Applied egg-rr90.8%
distribute-lft-out90.8%
*-commutative90.8%
fma-undefine90.8%
*-commutative90.8%
Simplified90.8%
Taylor expanded in phi2 around 0 90.8%
if 1.40000000000000008e-10 < phi2 Initial program 80.4%
Simplified80.5%
Final simplification85.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi2) (cos (- lambda1 lambda2)))))
(if (<= phi2 -6.5e-6)
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi1) t_0))))
(if (<= phi2 1.4e-10)
(*
R
(acos
(+
(*
(cos phi1)
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1))))
(* (sin phi1) phi2))))
(* R (acos (fma (cos phi1) t_0 (* (sin phi1) (sin phi2)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -6.5e-6) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * t_0)));
} else if (phi2 <= 1.4e-10) {
tmp = R * acos(((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))) + (sin(phi1) * phi2)));
} else {
tmp = R * acos(fma(cos(phi1), t_0, (sin(phi1) * sin(phi2))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi2 <= -6.5e-6) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * t_0)))); elseif (phi2 <= 1.4e-10) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(fma(cos(phi1), t_0, Float64(sin(phi1) * sin(phi2))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -6.5e-6], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.4e-10], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0 + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -6.5 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.4 \cdot 10^{-10}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right) + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, t\_0, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -6.4999999999999996e-6Initial program 79.6%
Simplified79.7%
if -6.4999999999999996e-6 < phi2 < 1.40000000000000008e-10Initial program 68.9%
*-commutative68.9%
*-commutative68.9%
*-commutative68.9%
*-commutative68.9%
associate-*l*68.9%
associate-*l*68.9%
*-commutative68.9%
cos-neg68.9%
sub-neg68.9%
+-commutative68.9%
distribute-neg-out68.9%
remove-double-neg68.9%
sub-neg68.9%
Simplified68.9%
cos-diff90.3%
+-commutative90.3%
*-commutative90.3%
*-commutative90.3%
Applied egg-rr90.8%
Taylor expanded in phi2 around 0 90.8%
if 1.40000000000000008e-10 < phi2 Initial program 80.4%
Simplified80.5%
Final simplification85.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -1.55e-9) (not (<= phi2 9e-12)))
(*
R
(acos
(fma
(* (cos phi1) (cos phi2))
(cos (- lambda2 lambda1))
(* (sin phi1) (sin phi2)))))
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.55e-9) || !(phi2 <= 9e-12)) {
tmp = R * acos(fma((cos(phi1) * cos(phi2)), cos((lambda2 - lambda1)), (sin(phi1) * sin(phi2))));
} else {
tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -1.55e-9) || !(phi2 <= 9e-12)) tmp = Float64(R * acos(fma(Float64(cos(phi1) * cos(phi2)), cos(Float64(lambda2 - lambda1)), Float64(sin(phi1) * sin(phi2))))); else tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -1.55e-9], N[Not[LessEqual[phi2, 9e-12]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $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[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.55 \cdot 10^{-9} \lor \neg \left(\phi_2 \leq 9 \cdot 10^{-12}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \left(\lambda_2 - \lambda_1\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_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.55000000000000002e-9 or 8.99999999999999962e-12 < phi2 Initial program 79.7%
*-commutative79.7%
*-commutative79.7%
*-commutative79.7%
*-commutative79.7%
associate-*l*79.7%
associate-*l*79.7%
*-commutative79.7%
cos-neg79.7%
sub-neg79.7%
+-commutative79.7%
distribute-neg-out79.7%
remove-double-neg79.7%
sub-neg79.7%
Simplified79.7%
if -1.55000000000000002e-9 < phi2 < 8.99999999999999962e-12Initial program 69.1%
*-commutative69.1%
*-commutative69.1%
*-commutative69.1%
*-commutative69.1%
associate-*l*69.1%
associate-*l*69.1%
*-commutative69.1%
cos-neg69.1%
sub-neg69.1%
+-commutative69.1%
distribute-neg-out69.1%
remove-double-neg69.1%
sub-neg69.1%
Simplified69.1%
Taylor expanded in phi2 around 0 68.9%
cos-diff90.4%
*-commutative90.4%
*-commutative90.4%
Applied egg-rr90.4%
*-commutative90.4%
fma-undefine90.4%
*-commutative90.4%
Simplified90.4%
Final simplification84.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= phi2 -6.4e-9)
(* R (acos (fma (* (cos phi1) (cos phi2)) (cos (- lambda2 lambda1)) t_0)))
(if (<= phi2 8.2e-11)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))
(*
R
(acos
(fma (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2))) t_0)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -6.4e-9) {
tmp = R * acos(fma((cos(phi1) * cos(phi2)), cos((lambda2 - lambda1)), t_0));
} else if (phi2 <= 8.2e-11) {
tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda1 - lambda2))), t_0));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -6.4e-9) tmp = Float64(R * acos(fma(Float64(cos(phi1) * cos(phi2)), cos(Float64(lambda2 - lambda1)), t_0))); elseif (phi2 <= 8.2e-11) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))), t_0))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -6.4e-9], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 8.2e-11], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -6.4 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \left(\lambda_2 - \lambda_1\right), t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 8.2 \cdot 10^{-11}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), t\_0\right)\right)\\
\end{array}
\end{array}
if phi2 < -6.40000000000000023e-9Initial program 79.9%
*-commutative79.9%
*-commutative79.9%
*-commutative79.9%
*-commutative79.9%
associate-*l*79.9%
associate-*l*79.9%
*-commutative79.9%
cos-neg79.9%
sub-neg79.9%
+-commutative79.9%
distribute-neg-out79.9%
remove-double-neg79.9%
sub-neg79.9%
Simplified79.9%
if -6.40000000000000023e-9 < phi2 < 8.2000000000000001e-11Initial program 68.6%
*-commutative68.6%
*-commutative68.6%
*-commutative68.6%
*-commutative68.6%
associate-*l*68.6%
associate-*l*68.6%
*-commutative68.6%
cos-neg68.6%
sub-neg68.6%
+-commutative68.6%
distribute-neg-out68.6%
remove-double-neg68.6%
sub-neg68.6%
Simplified68.6%
Taylor expanded in phi2 around 0 68.5%
cos-diff90.2%
*-commutative90.2%
*-commutative90.2%
Applied egg-rr90.2%
*-commutative90.2%
fma-undefine90.3%
*-commutative90.3%
Simplified90.3%
if 8.2000000000000001e-11 < phi2 Initial program 80.4%
Simplified80.5%
Final simplification85.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi2) (cos (- lambda1 lambda2)))))
(if (<= phi2 -4.8e-8)
(* R (acos (fma (sin phi1) (sin phi2) (* (cos phi1) t_0))))
(if (<= phi2 3.4e-11)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))
(* R (acos (fma (cos phi1) t_0 (* (sin phi1) (sin phi2)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi2) * cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -4.8e-8) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * t_0)));
} else if (phi2 <= 3.4e-11) {
tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R * acos(fma(cos(phi1), t_0, (sin(phi1) * sin(phi2))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi2 <= -4.8e-8) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * t_0)))); elseif (phi2 <= 3.4e-11) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R * acos(fma(cos(phi1), t_0, Float64(sin(phi1) * sin(phi2))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -4.8e-8], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3.4e-11], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0 + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -4.8 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 3.4 \cdot 10^{-11}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, t\_0, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -4.79999999999999997e-8Initial program 79.6%
Simplified79.7%
if -4.79999999999999997e-8 < phi2 < 3.3999999999999999e-11Initial program 68.9%
*-commutative68.9%
*-commutative68.9%
*-commutative68.9%
*-commutative68.9%
associate-*l*68.9%
associate-*l*68.9%
*-commutative68.9%
cos-neg68.9%
sub-neg68.9%
+-commutative68.9%
distribute-neg-out68.9%
remove-double-neg68.9%
sub-neg68.9%
Simplified68.9%
Taylor expanded in phi2 around 0 68.8%
cos-diff90.3%
*-commutative90.3%
*-commutative90.3%
Applied egg-rr90.3%
*-commutative90.3%
fma-undefine90.4%
*-commutative90.4%
Simplified90.4%
if 3.3999999999999999e-11 < phi2 Initial program 80.4%
Simplified80.5%
Final simplification85.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -7e-10) (not (<= phi2 4.6e-11)))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda2) (sin lambda1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -7e-10) || !(phi2 <= 4.6e-11)) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
} else {
tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda2) * sin(lambda1)))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -7e-10) || !(phi2 <= 4.6e-11)) 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(lambda2), cos(lambda1), Float64(sin(lambda2) * sin(lambda1)))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -7e-10], N[Not[LessEqual[phi2, 4.6e-11]], $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[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -7 \cdot 10^{-10} \lor \neg \left(\phi_2 \leq 4.6 \cdot 10^{-11}\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_2, \cos \lambda_1, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -6.99999999999999961e-10 or 4.60000000000000027e-11 < phi2 Initial program 80.1%
if -6.99999999999999961e-10 < phi2 < 4.60000000000000027e-11Initial program 68.6%
*-commutative68.6%
*-commutative68.6%
*-commutative68.6%
*-commutative68.6%
associate-*l*68.6%
associate-*l*68.6%
*-commutative68.6%
cos-neg68.6%
sub-neg68.6%
+-commutative68.6%
distribute-neg-out68.6%
remove-double-neg68.6%
sub-neg68.6%
Simplified68.6%
Taylor expanded in phi2 around 0 68.5%
cos-diff90.2%
*-commutative90.2%
*-commutative90.2%
Applied egg-rr90.2%
*-commutative90.2%
fma-undefine90.3%
*-commutative90.3%
Simplified90.3%
Final simplification85.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos lambda2))))))
(t_1
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1)))))
(if (<= phi2 -2.3e-7)
t_0
(if (<= phi2 5.2)
(* R (acos (* (cos phi1) t_1)))
(if (or (<= phi2 2.6e+156) (not (<= phi2 1.95e+262)))
(* R (acos (* (cos phi2) t_1)))
t_0)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
double t_1 = (sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1));
double tmp;
if (phi2 <= -2.3e-7) {
tmp = t_0;
} else if (phi2 <= 5.2) {
tmp = R * acos((cos(phi1) * t_1));
} else if ((phi2 <= 2.6e+156) || !(phi2 <= 1.95e+262)) {
tmp = R * acos((cos(phi2) * t_1));
} else {
tmp = t_0;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda2))))
t_1 = (sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))
if (phi2 <= (-2.3d-7)) then
tmp = t_0
else if (phi2 <= 5.2d0) then
tmp = r * acos((cos(phi1) * t_1))
else if ((phi2 <= 2.6d+156) .or. (.not. (phi2 <= 1.95d+262))) then
tmp = r * acos((cos(phi2) * t_1))
else
tmp = t_0
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos(lambda2))));
double t_1 = (Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1));
double tmp;
if (phi2 <= -2.3e-7) {
tmp = t_0;
} else if (phi2 <= 5.2) {
tmp = R * Math.acos((Math.cos(phi1) * t_1));
} else if ((phi2 <= 2.6e+156) || !(phi2 <= 1.95e+262)) {
tmp = R * Math.acos((Math.cos(phi2) * t_1));
} else {
tmp = t_0;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos(lambda2)))) t_1 = (math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1)) tmp = 0 if phi2 <= -2.3e-7: tmp = t_0 elif phi2 <= 5.2: tmp = R * math.acos((math.cos(phi1) * t_1)) elif (phi2 <= 2.6e+156) or not (phi2 <= 1.95e+262): tmp = R * math.acos((math.cos(phi2) * t_1)) else: tmp = t_0 return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda2))))) t_1 = Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))) tmp = 0.0 if (phi2 <= -2.3e-7) tmp = t_0; elseif (phi2 <= 5.2) tmp = Float64(R * acos(Float64(cos(phi1) * t_1))); elseif ((phi2 <= 2.6e+156) || !(phi2 <= 1.95e+262)) tmp = Float64(R * acos(Float64(cos(phi2) * t_1))); else tmp = t_0; end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
t_1 = (sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1));
tmp = 0.0;
if (phi2 <= -2.3e-7)
tmp = t_0;
elseif (phi2 <= 5.2)
tmp = R * acos((cos(phi1) * t_1));
elseif ((phi2 <= 2.6e+156) || ~((phi2 <= 1.95e+262)))
tmp = R * acos((cos(phi2) * t_1));
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -2.3e-7], t$95$0, If[LessEqual[phi2, 5.2], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[phi2, 2.6e+156], N[Not[LessEqual[phi2, 1.95e+262]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_2\right)\\
t_1 := \sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\\
\mathbf{if}\;\phi_2 \leq -2.3 \cdot 10^{-7}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 5.2:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_1\right)\\
\mathbf{elif}\;\phi_2 \leq 2.6 \cdot 10^{+156} \lor \neg \left(\phi_2 \leq 1.95 \cdot 10^{+262}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi2 < -2.29999999999999995e-7 or 2.60000000000000019e156 < phi2 < 1.94999999999999993e262Initial program 82.8%
Taylor expanded in lambda1 around 0 54.0%
cos-neg54.0%
associate-*r*54.0%
*-commutative54.0%
Simplified54.0%
if -2.29999999999999995e-7 < phi2 < 5.20000000000000018Initial program 68.5%
*-commutative68.5%
*-commutative68.5%
*-commutative68.5%
*-commutative68.5%
associate-*l*68.5%
associate-*l*68.5%
*-commutative68.5%
cos-neg68.5%
sub-neg68.5%
+-commutative68.5%
distribute-neg-out68.5%
remove-double-neg68.5%
sub-neg68.5%
Simplified68.5%
Taylor expanded in phi2 around 0 68.4%
cos-diff89.8%
+-commutative89.8%
*-commutative89.8%
*-commutative89.8%
Applied egg-rr89.8%
if 5.20000000000000018 < phi2 < 2.60000000000000019e156 or 1.94999999999999993e262 < phi2 Initial program 74.2%
*-commutative74.2%
*-commutative74.2%
*-commutative74.2%
*-commutative74.2%
associate-*l*74.2%
associate-*l*74.2%
*-commutative74.2%
cos-neg74.2%
sub-neg74.2%
+-commutative74.2%
distribute-neg-out74.2%
remove-double-neg74.2%
sub-neg74.2%
Simplified74.3%
cos-diff19.9%
+-commutative19.9%
*-commutative19.9%
*-commutative19.9%
Applied egg-rr99.3%
Taylor expanded in phi1 around 0 59.5%
Final simplification72.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2)))
(t_1
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1)))))
(if (<= phi2 -3.2e-7)
(* R (acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos lambda2)))))
(if (<= phi2 5.2)
(* R (acos (* (cos phi1) t_1)))
(if (<= phi2 1.05e+102)
(* R (acos (* (cos phi2) t_1)))
(* R (acos (+ t_0 (* (cos phi1) (* (cos phi2) (cos lambda1)))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = (sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1));
double tmp;
if (phi2 <= -3.2e-7) {
tmp = R * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
} else if (phi2 <= 5.2) {
tmp = R * acos((cos(phi1) * t_1));
} else if (phi2 <= 1.05e+102) {
tmp = R * acos((cos(phi2) * t_1));
} else {
tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
t_1 = (sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))
if (phi2 <= (-3.2d-7)) then
tmp = r * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos(lambda2))))
else if (phi2 <= 5.2d0) then
tmp = r * acos((cos(phi1) * t_1))
else if (phi2 <= 1.05d+102) then
tmp = r * acos((cos(phi2) * t_1))
else
tmp = r * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double t_1 = (Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1));
double tmp;
if (phi2 <= -3.2e-7) {
tmp = R * Math.acos((t_0 + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos(lambda2))));
} else if (phi2 <= 5.2) {
tmp = R * Math.acos((Math.cos(phi1) * t_1));
} else if (phi2 <= 1.05e+102) {
tmp = R * Math.acos((Math.cos(phi2) * t_1));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * Math.cos(lambda1)))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) t_1 = (math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1)) tmp = 0 if phi2 <= -3.2e-7: tmp = R * math.acos((t_0 + ((math.cos(phi1) * math.cos(phi2)) * math.cos(lambda2)))) elif phi2 <= 5.2: tmp = R * math.acos((math.cos(phi1) * t_1)) elif phi2 <= 1.05e+102: tmp = R * math.acos((math.cos(phi2) * t_1)) else: tmp = R * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * math.cos(lambda1))))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))) tmp = 0.0 if (phi2 <= -3.2e-7) tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda2))))); elseif (phi2 <= 5.2) tmp = Float64(R * acos(Float64(cos(phi1) * t_1))); elseif (phi2 <= 1.05e+102) tmp = Float64(R * acos(Float64(cos(phi2) * t_1))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * cos(lambda1)))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
t_1 = (sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1));
tmp = 0.0;
if (phi2 <= -3.2e-7)
tmp = R * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
elseif (phi2 <= 5.2)
tmp = R * acos((cos(phi1) * t_1));
elseif (phi2 <= 1.05e+102)
tmp = R * acos((cos(phi2) * t_1));
else
tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -3.2e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 5.2], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.05e+102], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\\
\mathbf{if}\;\phi_2 \leq -3.2 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_2\right)\\
\mathbf{elif}\;\phi_2 \leq 5.2:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_1\right)\\
\mathbf{elif}\;\phi_2 \leq 1.05 \cdot 10^{+102}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -3.2000000000000001e-7Initial program 79.6%
Taylor expanded in lambda1 around 0 50.3%
cos-neg50.3%
associate-*r*50.3%
*-commutative50.3%
Simplified50.3%
if -3.2000000000000001e-7 < phi2 < 5.20000000000000018Initial program 68.5%
*-commutative68.5%
*-commutative68.5%
*-commutative68.5%
*-commutative68.5%
associate-*l*68.5%
associate-*l*68.5%
*-commutative68.5%
cos-neg68.5%
sub-neg68.5%
+-commutative68.5%
distribute-neg-out68.5%
remove-double-neg68.5%
sub-neg68.5%
Simplified68.5%
Taylor expanded in phi2 around 0 68.4%
cos-diff89.8%
+-commutative89.8%
*-commutative89.8%
*-commutative89.8%
Applied egg-rr89.8%
if 5.20000000000000018 < phi2 < 1.05000000000000001e102Initial program 71.3%
*-commutative71.3%
*-commutative71.3%
*-commutative71.3%
*-commutative71.3%
associate-*l*71.3%
associate-*l*71.3%
*-commutative71.3%
cos-neg71.3%
sub-neg71.3%
+-commutative71.3%
distribute-neg-out71.3%
remove-double-neg71.3%
sub-neg71.3%
Simplified71.3%
cos-diff20.8%
+-commutative20.8%
*-commutative20.8%
*-commutative20.8%
Applied egg-rr99.4%
Taylor expanded in phi1 around 0 63.5%
if 1.05000000000000001e102 < phi2 Initial program 86.1%
Taylor expanded in lambda2 around 0 65.3%
*-commutative65.3%
associate-*r*65.3%
Simplified65.3%
Final simplification72.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -1.4e-11) (not (<= phi2 6.4e-12)))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))
(*
R
(acos
(*
(cos phi1)
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.4e-11) || !(phi2 <= 6.4e-12)) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
} else {
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if ((phi2 <= (-1.4d-11)) .or. (.not. (phi2 <= 6.4d-12))) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
else
tmp = r * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.4e-11) || !(phi2 <= 6.4e-12)) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))));
} else {
tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if (phi2 <= -1.4e-11) or not (phi2 <= 6.4e-12): tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) else: tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1))))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -1.4e-11) || !(phi2 <= 6.4e-12)) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))))); else tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if ((phi2 <= -1.4e-11) || ~((phi2 <= 6.4e-12)))
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
else
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -1.4e-11], N[Not[LessEqual[phi2, 6.4e-12]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.4 \cdot 10^{-11} \lor \neg \left(\phi_2 \leq 6.4 \cdot 10^{-12}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.4e-11 or 6.4000000000000002e-12 < phi2 Initial program 79.7%
if -1.4e-11 < phi2 < 6.4000000000000002e-12Initial program 69.1%
*-commutative69.1%
*-commutative69.1%
*-commutative69.1%
*-commutative69.1%
associate-*l*69.1%
associate-*l*69.1%
*-commutative69.1%
cos-neg69.1%
sub-neg69.1%
+-commutative69.1%
distribute-neg-out69.1%
remove-double-neg69.1%
sub-neg69.1%
Simplified69.1%
Taylor expanded in phi2 around 0 68.9%
cos-diff90.4%
+-commutative90.4%
*-commutative90.4%
*-commutative90.4%
Applied egg-rr90.4%
Final simplification84.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 5.2)
(*
R
(acos
(*
(cos phi1)
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1))))))
(* R (acos (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.2) {
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
} else {
tmp = R * acos(((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 5.2d0) then
tmp = r * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))))
else
tmp = r * acos(((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.2) {
tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
} else {
tmp = R * Math.acos(((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 5.2: tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1))))) else: tmp = R * math.acos(((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2)))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 5.2) tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1)))))); else tmp = Float64(R * acos(Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 5.2)
tmp = R * acos((cos(phi1) * ((sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1)))));
else
tmp = R * acos(((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5.2], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 5.2:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < 5.20000000000000018Initial program 72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
associate-*l*72.6%
associate-*l*72.6%
*-commutative72.6%
cos-neg72.6%
sub-neg72.6%
+-commutative72.6%
distribute-neg-out72.6%
remove-double-neg72.6%
sub-neg72.6%
Simplified72.6%
Taylor expanded in phi2 around 0 49.6%
cos-diff63.4%
+-commutative63.4%
*-commutative63.4%
*-commutative63.4%
Applied egg-rr63.4%
if 5.20000000000000018 < phi2 Initial program 81.4%
*-commutative81.4%
sin-mult45.6%
+-commutative45.6%
Applied egg-rr45.6%
Taylor expanded in phi2 around 0 45.6%
cos-neg45.6%
+-inverses45.6%
Simplified45.6%
Final simplification59.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(+ (* (sin lambda2) (sin lambda1)) (* (cos lambda2) (cos lambda1)))))
(if (<= phi2 5.2)
(* R (acos (* (cos phi1) t_0)))
(* R (acos (* (cos phi2) t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1));
double tmp;
if (phi2 <= 5.2) {
tmp = R * acos((cos(phi1) * t_0));
} else {
tmp = R * acos((cos(phi2) * t_0));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = (sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1))
if (phi2 <= 5.2d0) then
tmp = r * acos((cos(phi1) * t_0))
else
tmp = r * acos((cos(phi2) * t_0))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda2) * Math.cos(lambda1));
double tmp;
if (phi2 <= 5.2) {
tmp = R * Math.acos((Math.cos(phi1) * t_0));
} else {
tmp = R * Math.acos((Math.cos(phi2) * t_0));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = (math.sin(lambda2) * math.sin(lambda1)) + (math.cos(lambda2) * math.cos(lambda1)) tmp = 0 if phi2 <= 5.2: tmp = R * math.acos((math.cos(phi1) * t_0)) else: tmp = R * math.acos((math.cos(phi2) * t_0)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(sin(lambda2) * sin(lambda1)) + Float64(cos(lambda2) * cos(lambda1))) tmp = 0.0 if (phi2 <= 5.2) tmp = Float64(R * acos(Float64(cos(phi1) * t_0))); else tmp = Float64(R * acos(Float64(cos(phi2) * t_0))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = (sin(lambda2) * sin(lambda1)) + (cos(lambda2) * cos(lambda1));
tmp = 0.0;
if (phi2 <= 5.2)
tmp = R * acos((cos(phi1) * t_0));
else
tmp = R * acos((cos(phi2) * t_0));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 5.2], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\\
\mathbf{if}\;\phi_2 \leq 5.2:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot t\_0\right)\\
\end{array}
\end{array}
if phi2 < 5.20000000000000018Initial program 72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
associate-*l*72.6%
associate-*l*72.6%
*-commutative72.6%
cos-neg72.6%
sub-neg72.6%
+-commutative72.6%
distribute-neg-out72.6%
remove-double-neg72.6%
sub-neg72.6%
Simplified72.6%
Taylor expanded in phi2 around 0 49.6%
cos-diff63.4%
+-commutative63.4%
*-commutative63.4%
*-commutative63.4%
Applied egg-rr63.4%
if 5.20000000000000018 < phi2 Initial program 81.4%
*-commutative81.4%
*-commutative81.4%
*-commutative81.4%
*-commutative81.4%
associate-*l*81.4%
associate-*l*81.4%
*-commutative81.4%
cos-neg81.4%
sub-neg81.4%
+-commutative81.4%
distribute-neg-out81.4%
remove-double-neg81.4%
sub-neg81.4%
Simplified81.5%
cos-diff19.3%
+-commutative19.3%
*-commutative19.3%
*-commutative19.3%
Applied egg-rr99.4%
Taylor expanded in phi1 around 0 53.2%
Final simplification61.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))))
(if (<= (- lambda1 lambda2) -1e-8)
(* R (acos (* t_0 (cos (- lambda1 lambda2)))))
(* R (acos (fma (sin phi1) (sin phi2) t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double tmp;
if ((lambda1 - lambda2) <= -1e-8) {
tmp = R * acos((t_0 * cos((lambda1 - lambda2))));
} else {
tmp = R * acos(fma(sin(phi1), sin(phi2), t_0));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (Float64(lambda1 - lambda2) <= -1e-8) tmp = Float64(R * acos(Float64(t_0 * cos(Float64(lambda1 - lambda2))))); else tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), t_0))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -1e-8], N[(R * N[ArcCos[N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\lambda_1 - \lambda_2 \leq -1 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, t\_0\right)\right)\\
\end{array}
\end{array}
if (-.f64 lambda1 lambda2) < -1e-8Initial program 77.1%
*-commutative77.1%
sin-mult57.4%
+-commutative57.4%
Applied egg-rr57.4%
Taylor expanded in phi2 around 0 57.4%
cos-neg57.4%
+-inverses57.4%
Simplified57.4%
if -1e-8 < (-.f64 lambda1 lambda2) Initial program 73.1%
Simplified73.1%
Taylor expanded in lambda2 around 0 55.2%
Taylor expanded in lambda1 around 0 40.8%
Final simplification47.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))));
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))));
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)
\end{array}
Initial program 74.7%
*-commutative74.7%
sin-mult59.2%
+-commutative59.2%
Applied egg-rr59.2%
Taylor expanded in phi2 around 0 59.2%
cos-neg59.2%
+-inverses59.2%
Simplified59.2%
Final simplification59.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi2 5.2)
(* R (acos (* (cos phi1) t_0)))
(* R (acos (* (cos phi2) t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 5.2) {
tmp = R * acos((cos(phi1) * t_0));
} else {
tmp = R * acos((cos(phi2) * t_0));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
if (phi2 <= 5.2d0) then
tmp = r * acos((cos(phi1) * t_0))
else
tmp = r * acos((cos(phi2) * t_0))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 5.2) {
tmp = R * Math.acos((Math.cos(phi1) * t_0));
} else {
tmp = R * Math.acos((Math.cos(phi2) * t_0));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi2 <= 5.2: tmp = R * math.acos((math.cos(phi1) * t_0)) else: tmp = R * math.acos((math.cos(phi2) * t_0)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 5.2) tmp = Float64(R * acos(Float64(cos(phi1) * t_0))); else tmp = Float64(R * acos(Float64(cos(phi2) * t_0))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi2 <= 5.2)
tmp = R * acos((cos(phi1) * t_0));
else
tmp = R * acos((cos(phi2) * t_0));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 5.2], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 5.2:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot t\_0\right)\\
\end{array}
\end{array}
if phi2 < 5.20000000000000018Initial program 72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
*-commutative72.6%
associate-*l*72.6%
associate-*l*72.6%
*-commutative72.6%
cos-neg72.6%
sub-neg72.6%
+-commutative72.6%
distribute-neg-out72.6%
remove-double-neg72.6%
sub-neg72.6%
Simplified72.6%
Taylor expanded in phi2 around 0 49.6%
if 5.20000000000000018 < phi2 Initial program 81.4%
*-commutative81.4%
*-commutative81.4%
*-commutative81.4%
*-commutative81.4%
associate-*l*81.4%
associate-*l*81.4%
*-commutative81.4%
cos-neg81.4%
sub-neg81.4%
+-commutative81.4%
distribute-neg-out81.4%
remove-double-neg81.4%
sub-neg81.4%
Simplified81.5%
Taylor expanded in phi1 around 0 45.2%
Final simplification48.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 1.35e-6) (* R (acos (* (cos phi1) (cos lambda1)))) (* R (acos (cos (- lambda2 lambda1))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.35e-6) {
tmp = R * acos((cos(phi1) * cos(lambda1)));
} else {
tmp = R * acos(cos((lambda2 - lambda1)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 1.35d-6) then
tmp = r * acos((cos(phi1) * cos(lambda1)))
else
tmp = r * acos(cos((lambda2 - lambda1)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.35e-6) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else {
tmp = R * Math.acos(Math.cos((lambda2 - lambda1)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 1.35e-6: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1))) else: tmp = R * math.acos(math.cos((lambda2 - lambda1))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1.35e-6) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1)))); else tmp = Float64(R * acos(cos(Float64(lambda2 - lambda1)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 1.35e-6)
tmp = R * acos((cos(phi1) * cos(lambda1)));
else
tmp = R * acos(cos((lambda2 - lambda1)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1.35e-6], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.35 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if lambda2 < 1.34999999999999999e-6Initial program 78.8%
*-commutative78.8%
*-commutative78.8%
*-commutative78.8%
*-commutative78.8%
associate-*l*78.8%
associate-*l*78.8%
*-commutative78.8%
cos-neg78.8%
sub-neg78.8%
+-commutative78.8%
distribute-neg-out78.8%
remove-double-neg78.8%
sub-neg78.8%
Simplified78.8%
Taylor expanded in phi2 around 0 43.1%
Taylor expanded in lambda2 around 0 37.4%
cos-neg37.4%
Simplified37.4%
if 1.34999999999999999e-6 < lambda2 Initial program 62.3%
*-commutative62.3%
*-commutative62.3%
*-commutative62.3%
*-commutative62.3%
associate-*l*62.3%
associate-*l*62.3%
*-commutative62.3%
cos-neg62.3%
sub-neg62.3%
+-commutative62.3%
distribute-neg-out62.3%
remove-double-neg62.3%
sub-neg62.3%
Simplified62.3%
Taylor expanded in phi2 around 0 40.3%
Taylor expanded in phi1 around 0 27.6%
Final simplification35.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 2.4e-5) (* R (acos (* (cos phi1) (cos lambda1)))) (* R (acos (* (cos phi1) (cos lambda2))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.4e-5) {
tmp = R * acos((cos(phi1) * cos(lambda1)));
} else {
tmp = R * acos((cos(phi1) * cos(lambda2)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 2.4d-5) then
tmp = r * acos((cos(phi1) * cos(lambda1)))
else
tmp = r * acos((cos(phi1) * cos(lambda2)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.4e-5) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 2.4e-5: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1))) else: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda2))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2.4e-5) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1)))); else tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda2)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 2.4e-5)
tmp = R * acos((cos(phi1) * cos(lambda1)));
else
tmp = R * acos((cos(phi1) * cos(lambda2)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2.4e-5], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2.4 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 2.4000000000000001e-5Initial program 78.4%
*-commutative78.4%
*-commutative78.4%
*-commutative78.4%
*-commutative78.4%
associate-*l*78.4%
associate-*l*78.4%
*-commutative78.4%
cos-neg78.4%
sub-neg78.4%
+-commutative78.4%
distribute-neg-out78.4%
remove-double-neg78.4%
sub-neg78.4%
Simplified78.5%
Taylor expanded in phi2 around 0 43.0%
Taylor expanded in lambda2 around 0 37.3%
cos-neg37.3%
Simplified37.3%
if 2.4000000000000001e-5 < lambda2 Initial program 62.9%
*-commutative62.9%
*-commutative62.9%
*-commutative62.9%
*-commutative62.9%
associate-*l*62.9%
associate-*l*62.9%
*-commutative62.9%
cos-neg62.9%
sub-neg62.9%
+-commutative62.9%
distribute-neg-out62.9%
remove-double-neg62.9%
sub-neg62.9%
Simplified62.8%
Taylor expanded in phi2 around 0 40.7%
Taylor expanded in lambda1 around 0 41.0%
*-commutative41.0%
Simplified41.0%
Final simplification38.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (* (cos phi1) (cos (- lambda2 lambda1))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos((cos(phi1) * cos((lambda2 - lambda1))));
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos((cos(phi1) * cos((lambda2 - lambda1))))
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos((Math.cos(phi1) * Math.cos((lambda2 - lambda1))));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos((math.cos(phi1) * math.cos((lambda2 - lambda1))))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos((cos(phi1) * cos((lambda2 - lambda1))));
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)
\end{array}
Initial program 74.7%
*-commutative74.7%
*-commutative74.7%
*-commutative74.7%
*-commutative74.7%
associate-*l*74.7%
associate-*l*74.7%
*-commutative74.7%
cos-neg74.7%
sub-neg74.7%
+-commutative74.7%
distribute-neg-out74.7%
remove-double-neg74.7%
sub-neg74.7%
Simplified74.7%
Taylor expanded in phi2 around 0 42.4%
Final simplification42.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 5.3e-95)
(* R (acos (cos lambda1)))
(if (<= lambda2 7.2e-6)
(* R (- lambda2 lambda1))
(* R (acos (cos lambda2))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 5.3e-95) {
tmp = R * acos(cos(lambda1));
} else if (lambda2 <= 7.2e-6) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * acos(cos(lambda2));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 5.3d-95) then
tmp = r * acos(cos(lambda1))
else if (lambda2 <= 7.2d-6) then
tmp = r * (lambda2 - lambda1)
else
tmp = r * acos(cos(lambda2))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 5.3e-95) {
tmp = R * Math.acos(Math.cos(lambda1));
} else if (lambda2 <= 7.2e-6) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * Math.acos(Math.cos(lambda2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 5.3e-95: tmp = R * math.acos(math.cos(lambda1)) elif lambda2 <= 7.2e-6: tmp = R * (lambda2 - lambda1) else: tmp = R * math.acos(math.cos(lambda2)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 5.3e-95) tmp = Float64(R * acos(cos(lambda1))); elseif (lambda2 <= 7.2e-6) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * acos(cos(lambda2))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 5.3e-95)
tmp = R * acos(cos(lambda1));
elseif (lambda2 <= 7.2e-6)
tmp = R * (lambda2 - lambda1);
else
tmp = R * acos(cos(lambda2));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 5.3e-95], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 7.2e-6], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 5.3 \cdot 10^{-95}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{elif}\;\lambda_2 \leq 7.2 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\
\end{array}
\end{array}
if lambda2 < 5.2999999999999998e-95Initial program 79.1%
*-commutative79.1%
*-commutative79.1%
*-commutative79.1%
*-commutative79.1%
associate-*l*79.1%
associate-*l*79.1%
*-commutative79.1%
cos-neg79.1%
sub-neg79.1%
+-commutative79.1%
distribute-neg-out79.1%
remove-double-neg79.1%
sub-neg79.1%
Simplified79.2%
Taylor expanded in phi2 around 0 42.8%
Taylor expanded in phi1 around 0 23.0%
Taylor expanded in lambda2 around 0 19.3%
cos-neg19.3%
Simplified19.3%
if 5.2999999999999998e-95 < lambda2 < 7.19999999999999967e-6Initial program 76.2%
*-commutative76.2%
*-commutative76.2%
*-commutative76.2%
*-commutative76.2%
associate-*l*76.2%
associate-*l*76.2%
*-commutative76.2%
cos-neg76.2%
sub-neg76.2%
+-commutative76.2%
distribute-neg-out76.2%
remove-double-neg76.2%
sub-neg76.2%
Simplified76.2%
Taylor expanded in phi2 around 0 45.1%
Taylor expanded in phi1 around 0 29.7%
Taylor expanded in lambda2 around 0 25.9%
neg-mul-125.9%
sub-neg25.9%
Simplified25.9%
if 7.19999999999999967e-6 < lambda2 Initial program 62.3%
*-commutative62.3%
*-commutative62.3%
*-commutative62.3%
*-commutative62.3%
associate-*l*62.3%
associate-*l*62.3%
*-commutative62.3%
cos-neg62.3%
sub-neg62.3%
+-commutative62.3%
distribute-neg-out62.3%
remove-double-neg62.3%
sub-neg62.3%
Simplified62.3%
Taylor expanded in phi2 around 0 40.3%
Taylor expanded in phi1 around 0 27.6%
Taylor expanded in lambda1 around 0 27.2%
Final simplification21.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.5e-7) (* R (acos (cos lambda1))) (* R (- lambda2 lambda1))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.5e-7) {
tmp = R * acos(cos(lambda1));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-1.5d-7)) then
tmp = r * acos(cos(lambda1))
else
tmp = r * (lambda2 - lambda1)
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.5e-7) {
tmp = R * Math.acos(Math.cos(lambda1));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.5e-7: tmp = R * math.acos(math.cos(lambda1)) else: tmp = R * (lambda2 - lambda1) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.5e-7) tmp = Float64(R * acos(cos(lambda1))); else tmp = Float64(R * Float64(lambda2 - lambda1)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -1.5e-7)
tmp = R * acos(cos(lambda1));
else
tmp = R * (lambda2 - lambda1);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.5e-7], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.5 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if lambda1 < -1.4999999999999999e-7Initial program 67.2%
*-commutative67.2%
*-commutative67.2%
*-commutative67.2%
*-commutative67.2%
associate-*l*67.2%
associate-*l*67.2%
*-commutative67.2%
cos-neg67.2%
sub-neg67.2%
+-commutative67.2%
distribute-neg-out67.2%
remove-double-neg67.2%
sub-neg67.2%
Simplified67.3%
Taylor expanded in phi2 around 0 34.3%
Taylor expanded in phi1 around 0 25.9%
Taylor expanded in lambda2 around 0 24.7%
cos-neg24.7%
Simplified24.7%
if -1.4999999999999999e-7 < lambda1 Initial program 77.3%
*-commutative77.3%
*-commutative77.3%
*-commutative77.3%
*-commutative77.3%
associate-*l*77.3%
associate-*l*77.3%
*-commutative77.3%
cos-neg77.3%
sub-neg77.3%
+-commutative77.3%
distribute-neg-out77.3%
remove-double-neg77.3%
sub-neg77.3%
Simplified77.3%
Taylor expanded in phi2 around 0 45.3%
Taylor expanded in phi1 around 0 24.4%
Taylor expanded in lambda2 around 0 6.6%
neg-mul-16.6%
sub-neg6.6%
Simplified6.6%
Final simplification11.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (cos (- lambda2 lambda1)))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(cos((lambda2 - lambda1)));
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(cos((lambda2 - lambda1)))
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(Math.cos((lambda2 - lambda1)));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(math.cos((lambda2 - lambda1)))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(cos(Float64(lambda2 - lambda1)))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(cos((lambda2 - lambda1)));
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)
\end{array}
Initial program 74.7%
*-commutative74.7%
*-commutative74.7%
*-commutative74.7%
*-commutative74.7%
associate-*l*74.7%
associate-*l*74.7%
*-commutative74.7%
cos-neg74.7%
sub-neg74.7%
+-commutative74.7%
distribute-neg-out74.7%
remove-double-neg74.7%
sub-neg74.7%
Simplified74.7%
Taylor expanded in phi2 around 0 42.4%
Taylor expanded in phi1 around 0 24.8%
Final simplification24.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -2.25e-85) (* lambda1 (- R)) (* lambda2 R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.25e-85) {
tmp = lambda1 * -R;
} else {
tmp = lambda2 * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-2.25d-85)) then
tmp = lambda1 * -r
else
tmp = lambda2 * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.25e-85) {
tmp = lambda1 * -R;
} else {
tmp = lambda2 * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -2.25e-85: tmp = lambda1 * -R else: tmp = lambda2 * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -2.25e-85) tmp = Float64(lambda1 * Float64(-R)); else tmp = Float64(lambda2 * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -2.25e-85)
tmp = lambda1 * -R;
else
tmp = lambda2 * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -2.25e-85], N[(lambda1 * (-R)), $MachinePrecision], N[(lambda2 * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -2.25 \cdot 10^{-85}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{else}:\\
\;\;\;\;\lambda_2 \cdot R\\
\end{array}
\end{array}
if lambda1 < -2.25000000000000002e-85Initial program 69.1%
*-commutative69.1%
*-commutative69.1%
*-commutative69.1%
*-commutative69.1%
associate-*l*69.1%
associate-*l*69.1%
*-commutative69.1%
cos-neg69.1%
sub-neg69.1%
+-commutative69.1%
distribute-neg-out69.1%
remove-double-neg69.1%
sub-neg69.1%
Simplified69.2%
Taylor expanded in phi2 around 0 37.8%
Taylor expanded in phi1 around 0 24.7%
Taylor expanded in lambda2 around 0 9.1%
mul-1-neg9.1%
*-commutative9.1%
distribute-rgt-neg-in9.1%
Simplified9.1%
if -2.25000000000000002e-85 < lambda1 Initial program 77.3%
*-commutative77.3%
*-commutative77.3%
*-commutative77.3%
*-commutative77.3%
associate-*l*77.3%
associate-*l*77.3%
*-commutative77.3%
cos-neg77.3%
sub-neg77.3%
+-commutative77.3%
distribute-neg-out77.3%
remove-double-neg77.3%
sub-neg77.3%
Simplified77.3%
Taylor expanded in phi2 around 0 44.6%
Taylor expanded in phi1 around 0 24.8%
Taylor expanded in lambda2 around inf 6.3%
*-commutative6.3%
Simplified6.3%
Final simplification7.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (- lambda2 lambda1)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * (lambda2 - lambda1);
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * (lambda2 - lambda1)
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * (lambda2 - lambda1);
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * (lambda2 - lambda1)
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * Float64(lambda2 - lambda1)) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * (lambda2 - lambda1);
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \left(\lambda_2 - \lambda_1\right)
\end{array}
Initial program 74.7%
*-commutative74.7%
*-commutative74.7%
*-commutative74.7%
*-commutative74.7%
associate-*l*74.7%
associate-*l*74.7%
*-commutative74.7%
cos-neg74.7%
sub-neg74.7%
+-commutative74.7%
distribute-neg-out74.7%
remove-double-neg74.7%
sub-neg74.7%
Simplified74.7%
Taylor expanded in phi2 around 0 42.4%
Taylor expanded in phi1 around 0 24.8%
Taylor expanded in lambda2 around 0 6.2%
neg-mul-16.2%
sub-neg6.2%
Simplified6.2%
Final simplification6.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* lambda2 R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return lambda2 * R;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = lambda2 * r
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return lambda2 * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return lambda2 * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(lambda2 * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = lambda2 * R;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(lambda2 * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\lambda_2 \cdot R
\end{array}
Initial program 74.7%
*-commutative74.7%
*-commutative74.7%
*-commutative74.7%
*-commutative74.7%
associate-*l*74.7%
associate-*l*74.7%
*-commutative74.7%
cos-neg74.7%
sub-neg74.7%
+-commutative74.7%
distribute-neg-out74.7%
remove-double-neg74.7%
sub-neg74.7%
Simplified74.7%
Taylor expanded in phi2 around 0 42.4%
Taylor expanded in phi1 around 0 24.8%
Taylor expanded in lambda2 around inf 5.5%
*-commutative5.5%
Simplified5.5%
Final simplification5.5%
herbie shell --seed 2024034
(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))