
(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 25 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(+
(* (* (cos phi1) (cos phi2)) (* (cos lambda1) (cos lambda2)))
(* (cos phi2) (* (sin lambda2) (* (cos phi1) (sin lambda1)))))))
R))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + (((cos(phi1) * cos(phi2)) * (cos(lambda1) * cos(lambda2))) + (cos(phi2) * (sin(lambda2) * (cos(phi1) * sin(lambda1))))))) * R;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + (((cos(phi1) * cos(phi2)) * (cos(lambda1) * cos(lambda2))) + (cos(phi2) * (sin(lambda2) * (cos(phi1) * sin(lambda1))))))) * r
end function
assert lambda1 < lambda2;
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) * Math.cos(lambda2))) + (Math.cos(phi2) * (Math.sin(lambda2) * (Math.cos(phi1) * Math.sin(lambda1))))))) * R;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) 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) * math.cos(lambda2))) + (math.cos(phi2) * (math.sin(lambda2) * (math.cos(phi1) * math.sin(lambda1))))))) * R
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(Float64(cos(phi1) * cos(phi2)) * Float64(cos(lambda1) * cos(lambda2))) + Float64(cos(phi2) * Float64(sin(lambda2) * Float64(cos(phi1) * sin(lambda1))))))) * R) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = acos(((sin(phi1) * sin(phi2)) + (((cos(phi1) * cos(phi2)) * (cos(lambda1) * cos(lambda2))) + (cos(phi2) * (sin(lambda2) * (cos(phi1) * sin(lambda1))))))) * R;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Sin[lambda2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \left(\cos \lambda_1 \cdot \cos \lambda_2\right) + \cos \phi_2 \cdot \left(\sin \lambda_2 \cdot \left(\cos \phi_1 \cdot \sin \lambda_1\right)\right)\right)\right) \cdot R
\end{array}
Initial program 73.9%
cos-diff95.4%
distribute-lft-in95.5%
Applied egg-rr95.5%
Taylor expanded in phi2 around inf 95.5%
Final simplification95.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(*
(cos phi1)
(*
(cos phi2)
(+ (* (cos lambda1) (cos lambda2)) (* (sin lambda2) (sin lambda1)))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * ((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1)))))));
}
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * Float64(Float64(cos(lambda1) * cos(lambda2)) + Float64(sin(lambda2) * sin(lambda1)))))))) end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\right)\right)
\end{array}
Initial program 73.9%
fma-def73.9%
associate-*l*73.9%
Simplified73.9%
cos-diff95.4%
+-commutative95.4%
Applied egg-rr95.5%
Final simplification95.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(*
(* (cos phi1) (cos phi2))
(+ (* (cos lambda1) (cos lambda2)) (* (sin lambda2) (sin lambda1))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * ((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * ((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))))))
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * ((Math.cos(lambda1) * Math.cos(lambda2)) + (Math.sin(lambda2) * Math.sin(lambda1))))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * ((math.cos(lambda1) * math.cos(lambda2)) + (math.sin(lambda2) * math.sin(lambda1))))))
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * Float64(Float64(cos(lambda1) * cos(lambda2)) + Float64(sin(lambda2) * sin(lambda1))))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * ((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_2 \cdot \sin \lambda_1\right)\right)
\end{array}
Initial program 73.9%
cos-diff95.4%
+-commutative95.4%
Applied egg-rr95.4%
Final simplification95.4%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi2 -2.6e-22)
(*
R
(acos (+ t_1 (log (+ 1.0 (expm1 (* t_0 (cos (- lambda1 lambda2)))))))))
(if (<= phi2 1.85e-5)
(*
R
(acos
(+
t_1
(*
(cos phi1)
(+
(* (cos lambda1) (cos lambda2))
(* (sin lambda2) (sin lambda1)))))))
(* R (acos (fma (cos (- lambda2 lambda1)) t_0 t_1)))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -2.6e-22) {
tmp = R * acos((t_1 + log((1.0 + expm1((t_0 * cos((lambda1 - lambda2))))))));
} else if (phi2 <= 1.85e-5) {
tmp = R * acos((t_1 + (cos(phi1) * ((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))))));
} else {
tmp = R * acos(fma(cos((lambda2 - lambda1)), t_0, t_1));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -2.6e-22) tmp = Float64(R * acos(Float64(t_1 + log(Float64(1.0 + expm1(Float64(t_0 * cos(Float64(lambda1 - lambda2))))))))); elseif (phi2 <= 1.85e-5) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * Float64(Float64(cos(lambda1) * cos(lambda2)) + Float64(sin(lambda2) * sin(lambda1))))))); else tmp = Float64(R * acos(fma(cos(Float64(lambda2 - lambda1)), t_0, t_1))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -2.6e-22], N[(R * N[ArcCos[N[(t$95$1 + N[Log[N[(1.0 + N[(Exp[N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.85e-5], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -2.6 \cdot 10^{-22}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \log \left(1 + \mathsf{expm1}\left(t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.85 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \phi_1 \cdot \left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right), t_0, t_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -2.6e-22Initial program 80.5%
log1p-expm1-u80.4%
log1p-udef80.5%
*-commutative80.5%
Applied egg-rr80.5%
if -2.6e-22 < phi2 < 1.84999999999999991e-5Initial program 67.7%
Taylor expanded in phi2 around 0 67.7%
sub-neg67.7%
+-commutative67.7%
neg-mul-167.7%
neg-mul-167.7%
remove-double-neg67.7%
mul-1-neg67.7%
distribute-neg-in67.7%
+-commutative67.7%
cos-neg67.7%
+-commutative67.7%
mul-1-neg67.7%
unsub-neg67.7%
Simplified67.7%
cos-diff42.1%
*-commutative42.1%
*-commutative42.1%
Applied egg-rr90.9%
if 1.84999999999999991e-5 < phi2 Initial program 77.3%
Taylor expanded in phi1 around 0 77.3%
fma-def77.3%
sub-neg77.3%
+-commutative77.3%
neg-mul-177.3%
neg-mul-177.3%
remove-double-neg77.3%
mul-1-neg77.3%
distribute-neg-in77.3%
+-commutative77.3%
fma-def77.3%
fma-def77.3%
Simplified77.3%
Final simplification84.3%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi2 -1.35e-192)
(*
R
(acos (+ t_1 (log (+ 1.0 (expm1 (* t_0 (cos (- lambda1 lambda2)))))))))
(if (<= phi2 3.3e-184)
(*
R
(acos
(+
(*
(cos phi1)
(+ (* (cos lambda1) (cos lambda2)) (* (sin lambda2) (sin lambda1))))
(* phi1 (sin phi2)))))
(* R (acos (fma (cos (- lambda2 lambda1)) t_0 t_1)))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -1.35e-192) {
tmp = R * acos((t_1 + log((1.0 + expm1((t_0 * cos((lambda1 - lambda2))))))));
} else if (phi2 <= 3.3e-184) {
tmp = R * acos(((cos(phi1) * ((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1)))) + (phi1 * sin(phi2))));
} else {
tmp = R * acos(fma(cos((lambda2 - lambda1)), t_0, t_1));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -1.35e-192) tmp = Float64(R * acos(Float64(t_1 + log(Float64(1.0 + expm1(Float64(t_0 * cos(Float64(lambda1 - lambda2))))))))); elseif (phi2 <= 3.3e-184) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * Float64(Float64(cos(lambda1) * cos(lambda2)) + Float64(sin(lambda2) * sin(lambda1)))) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * acos(fma(cos(Float64(lambda2 - lambda1)), t_0, t_1))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -1.35e-192], N[(R * N[ArcCos[N[(t$95$1 + N[Log[N[(1.0 + N[(Exp[N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3.3e-184], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -1.35 \cdot 10^{-192}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \log \left(1 + \mathsf{expm1}\left(t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 3.3 \cdot 10^{-184}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right), t_0, t_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.34999999999999996e-192Initial program 76.2%
log1p-expm1-u76.2%
log1p-udef76.2%
*-commutative76.2%
Applied egg-rr76.2%
if -1.34999999999999996e-192 < phi2 < 3.2999999999999997e-184Initial program 65.0%
Taylor expanded in phi2 around 0 65.0%
sub-neg65.0%
+-commutative65.0%
neg-mul-165.0%
neg-mul-165.0%
remove-double-neg65.0%
mul-1-neg65.0%
distribute-neg-in65.0%
+-commutative65.0%
cos-neg65.0%
+-commutative65.0%
mul-1-neg65.0%
unsub-neg65.0%
Simplified65.0%
Taylor expanded in phi1 around 0 60.5%
cos-diff42.9%
*-commutative42.9%
*-commutative42.9%
Applied egg-rr83.6%
if 3.2999999999999997e-184 < phi2 Initial program 75.7%
Taylor expanded in phi1 around 0 75.7%
fma-def75.8%
sub-neg75.8%
+-commutative75.8%
neg-mul-175.8%
neg-mul-175.8%
remove-double-neg75.8%
mul-1-neg75.8%
distribute-neg-in75.8%
+-commutative75.8%
fma-def75.7%
fma-def75.8%
Simplified75.8%
Final simplification77.4%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 -4.7e-195)
(*
R
(acos
(fma
(sin phi1)
(sin phi2)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))
(if (<= phi2 1.65e-184)
(*
R
(acos
(+
(*
(cos phi1)
(+ (* (cos lambda1) (cos lambda2)) (* (sin lambda2) (sin lambda1))))
(* phi1 (sin phi2)))))
(*
R
(acos
(fma
(cos (- lambda2 lambda1))
(* (cos phi1) (cos phi2))
(* (sin phi1) (sin phi2))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -4.7e-195) {
tmp = R * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))));
} else if (phi2 <= 1.65e-184) {
tmp = R * acos(((cos(phi1) * ((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1)))) + (phi1 * sin(phi2))));
} else {
tmp = R * acos(fma(cos((lambda2 - lambda1)), (cos(phi1) * cos(phi2)), (sin(phi1) * sin(phi2))));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -4.7e-195) tmp = Float64(R * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))); elseif (phi2 <= 1.65e-184) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * Float64(Float64(cos(lambda1) * cos(lambda2)) + Float64(sin(lambda2) * sin(lambda1)))) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * acos(fma(cos(Float64(lambda2 - lambda1)), Float64(cos(phi1) * cos(phi2)), Float64(sin(phi1) * sin(phi2))))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -4.7e-195], 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.65e-184], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -4.7 \cdot 10^{-195}:\\
\;\;\;\;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.65 \cdot 10^{-184}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right), \cos \phi_1 \cdot \cos \phi_2, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -4.7000000000000001e-195Initial program 75.7%
fma-def75.7%
associate-*l*75.7%
Simplified75.7%
if -4.7000000000000001e-195 < phi2 < 1.6499999999999999e-184Initial program 65.2%
Taylor expanded in phi2 around 0 65.2%
sub-neg65.2%
+-commutative65.2%
neg-mul-165.2%
neg-mul-165.2%
remove-double-neg65.2%
mul-1-neg65.2%
distribute-neg-in65.2%
+-commutative65.2%
cos-neg65.2%
+-commutative65.2%
mul-1-neg65.2%
unsub-neg65.2%
Simplified65.2%
Taylor expanded in phi1 around 0 60.5%
cos-diff40.5%
*-commutative40.5%
*-commutative40.5%
Applied egg-rr82.9%
if 1.6499999999999999e-184 < phi2 Initial program 76.0%
Taylor expanded in phi1 around 0 76.0%
fma-def76.0%
sub-neg76.0%
+-commutative76.0%
neg-mul-176.0%
neg-mul-176.0%
remove-double-neg76.0%
mul-1-neg76.0%
distribute-neg-in76.0%
+-commutative76.0%
fma-def76.0%
fma-def76.0%
Simplified76.0%
Final simplification77.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -0.18)
(*
R
(acos
(+
(+ (* (cos lambda1) (cos lambda2)) (* (sin lambda2) (sin lambda1)))
(* phi1 (sin phi2)))))
(*
R
(acos
(fma
(cos (- lambda2 lambda1))
(* (cos phi1) (cos phi2))
(* (sin phi1) (sin phi2)))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -0.18) {
tmp = R * acos((((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))) + (phi1 * sin(phi2))));
} else {
tmp = R * acos(fma(cos((lambda2 - lambda1)), (cos(phi1) * cos(phi2)), (sin(phi1) * sin(phi2))));
}
return tmp;
}
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -0.18) tmp = Float64(R * acos(Float64(Float64(Float64(cos(lambda1) * cos(lambda2)) + Float64(sin(lambda2) * sin(lambda1))) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * acos(fma(cos(Float64(lambda2 - lambda1)), Float64(cos(phi1) * cos(phi2)), Float64(sin(phi1) * sin(phi2))))); end return tmp end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -0.18], N[(R * N[ArcCos[N[(N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -0.18:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right), \cos \phi_1 \cdot \cos \phi_2, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\end{array}
\end{array}
if lambda2 < -0.17999999999999999Initial program 60.1%
Taylor expanded in phi2 around 0 38.4%
sub-neg38.4%
+-commutative38.4%
neg-mul-138.4%
neg-mul-138.4%
remove-double-neg38.4%
mul-1-neg38.4%
distribute-neg-in38.4%
+-commutative38.4%
cos-neg38.4%
+-commutative38.4%
mul-1-neg38.4%
unsub-neg38.4%
Simplified38.4%
Taylor expanded in phi1 around 0 23.8%
Taylor expanded in phi1 around 0 17.6%
cos-diff27.2%
*-commutative27.2%
*-commutative27.2%
Applied egg-rr27.2%
if -0.17999999999999999 < lambda2 Initial program 79.3%
Taylor expanded in phi1 around 0 79.3%
fma-def79.4%
sub-neg79.4%
+-commutative79.4%
neg-mul-179.4%
neg-mul-179.4%
remove-double-neg79.4%
mul-1-neg79.4%
distribute-neg-in79.4%
+-commutative79.4%
fma-def79.3%
fma-def79.4%
Simplified79.4%
Final simplification64.7%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= lambda2 -0.0047)
(*
R
(acos
(+
(+ (* (cos lambda1) (cos lambda2)) (* (sin lambda2) (sin lambda1)))
(* phi1 (sin phi2)))))
(if (<= lambda2 1.4e-20)
(* R (acos (+ t_1 (* t_0 (cos lambda1)))))
(* R (acos (+ t_1 (* t_0 (cos lambda2)))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (lambda2 <= -0.0047) {
tmp = R * acos((((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))) + (phi1 * sin(phi2))));
} else if (lambda2 <= 1.4e-20) {
tmp = R * acos((t_1 + (t_0 * cos(lambda1))));
} else {
tmp = R * acos((t_1 + (t_0 * cos(lambda2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos(phi1) * cos(phi2)
t_1 = sin(phi1) * sin(phi2)
if (lambda2 <= (-0.0047d0)) then
tmp = r * acos((((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))) + (phi1 * sin(phi2))))
else if (lambda2 <= 1.4d-20) then
tmp = r * acos((t_1 + (t_0 * cos(lambda1))))
else
tmp = r * acos((t_1 + (t_0 * cos(lambda2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi1) * Math.cos(phi2);
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda2 <= -0.0047) {
tmp = R * Math.acos((((Math.cos(lambda1) * Math.cos(lambda2)) + (Math.sin(lambda2) * Math.sin(lambda1))) + (phi1 * Math.sin(phi2))));
} else if (lambda2 <= 1.4e-20) {
tmp = R * Math.acos((t_1 + (t_0 * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_1 + (t_0 * Math.cos(lambda2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi1) * math.cos(phi2) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda2 <= -0.0047: tmp = R * math.acos((((math.cos(lambda1) * math.cos(lambda2)) + (math.sin(lambda2) * math.sin(lambda1))) + (phi1 * math.sin(phi2)))) elif lambda2 <= 1.4e-20: tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda1)))) else: tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda2 <= -0.0047) tmp = Float64(R * acos(Float64(Float64(Float64(cos(lambda1) * cos(lambda2)) + Float64(sin(lambda2) * sin(lambda1))) + Float64(phi1 * sin(phi2))))); elseif (lambda2 <= 1.4e-20) tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi1) * cos(phi2);
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda2 <= -0.0047)
tmp = R * acos((((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))) + (phi1 * sin(phi2))));
elseif (lambda2 <= 1.4e-20)
tmp = R * acos((t_1 + (t_0 * cos(lambda1))));
else
tmp = R * acos((t_1 + (t_0 * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, -0.0047], N[(R * N[ArcCos[N[(N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 1.4e-20], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq -0.0047:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{elif}\;\lambda_2 \leq 1.4 \cdot 10^{-20}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + t_0 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + t_0 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < -0.00470000000000000018Initial program 60.1%
Taylor expanded in phi2 around 0 38.4%
sub-neg38.4%
+-commutative38.4%
neg-mul-138.4%
neg-mul-138.4%
remove-double-neg38.4%
mul-1-neg38.4%
distribute-neg-in38.4%
+-commutative38.4%
cos-neg38.4%
+-commutative38.4%
mul-1-neg38.4%
unsub-neg38.4%
Simplified38.4%
Taylor expanded in phi1 around 0 23.8%
Taylor expanded in phi1 around 0 17.6%
cos-diff27.2%
*-commutative27.2%
*-commutative27.2%
Applied egg-rr27.2%
if -0.00470000000000000018 < lambda2 < 1.4000000000000001e-20Initial program 90.2%
Taylor expanded in lambda2 around 0 90.2%
if 1.4000000000000001e-20 < lambda2 Initial program 66.4%
Taylor expanded in lambda1 around 0 64.9%
cos-neg64.9%
Simplified64.9%
Final simplification64.2%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -0.18)
(*
R
(acos
(+
(+ (* (cos lambda1) (cos lambda2)) (* (sin lambda2) (sin lambda1)))
(* phi1 (sin phi2)))))
(*
R
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -0.18) {
tmp = R * acos((((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))) + (phi1 * sin(phi2))));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= (-0.18d0)) then
tmp = r * acos((((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))) + (phi1 * sin(phi2))))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -0.18) {
tmp = R * Math.acos((((Math.cos(lambda1) * Math.cos(lambda2)) + (Math.sin(lambda2) * Math.sin(lambda1))) + (phi1 * Math.sin(phi2))));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -0.18: tmp = R * math.acos((((math.cos(lambda1) * math.cos(lambda2)) + (math.sin(lambda2) * math.sin(lambda1))) + (phi1 * math.sin(phi2)))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -0.18) tmp = Float64(R * acos(Float64(Float64(Float64(cos(lambda1) * cos(lambda2)) + Float64(sin(lambda2) * sin(lambda1))) + Float64(phi1 * sin(phi2))))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= -0.18)
tmp = R * acos((((cos(lambda1) * cos(lambda2)) + (sin(lambda2) * sin(lambda1))) + (phi1 * sin(phi2))));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -0.18], N[(R * N[ArcCos[N[(N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $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]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -0.18:\\
\;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_2 \cdot \sin \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;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)\\
\end{array}
\end{array}
if lambda2 < -0.17999999999999999Initial program 60.1%
Taylor expanded in phi2 around 0 38.4%
sub-neg38.4%
+-commutative38.4%
neg-mul-138.4%
neg-mul-138.4%
remove-double-neg38.4%
mul-1-neg38.4%
distribute-neg-in38.4%
+-commutative38.4%
cos-neg38.4%
+-commutative38.4%
mul-1-neg38.4%
unsub-neg38.4%
Simplified38.4%
Taylor expanded in phi1 around 0 23.8%
Taylor expanded in phi1 around 0 17.6%
cos-diff27.2%
*-commutative27.2%
*-commutative27.2%
Applied egg-rr27.2%
if -0.17999999999999999 < lambda2 Initial program 79.3%
Final simplification64.7%
NOTE: lambda1 and lambda2 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 (<= lambda2 0.045)
(* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda1))))))
(* R (acos (+ t_0 (* (cos phi2) (cos (- lambda2 lambda1)))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (lambda2 <= 0.045) {
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 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 (lambda2 <= 0.045d0) then
tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))))
else
tmp = r * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
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 (lambda2 <= 0.045) {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda1)))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos((lambda2 - lambda1)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda2 <= 0.045: tmp = R * math.acos((t_0 + (math.cos(phi2) * (math.cos(phi1) * math.cos(lambda1))))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos((lambda2 - lambda1))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda2 <= 0.045) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * Float64(cos(phi1) * cos(lambda1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(Float64(lambda2 - lambda1)))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda2 <= 0.045)
tmp = R * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda1)))));
else
tmp = R * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 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[lambda2, 0.045], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 0.045:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if lambda2 < 0.044999999999999998Initial program 78.2%
Taylor expanded in lambda2 around 0 61.4%
if 0.044999999999999998 < lambda2 Initial program 63.3%
Taylor expanded in phi1 around 0 42.7%
sub-neg42.7%
+-commutative42.7%
neg-mul-142.7%
neg-mul-142.7%
remove-double-neg42.7%
mul-1-neg42.7%
distribute-neg-in42.7%
+-commutative42.7%
cos-neg42.7%
+-commutative42.7%
mul-1-neg42.7%
unsub-neg42.7%
Simplified42.7%
Final simplification56.0%
NOTE: lambda1 and lambda2 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 (<= lambda2 0.045)
(* R (acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi2) (cos (- lambda2 lambda1)))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (lambda2 <= 0.045) {
tmp = R * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))));
}
return tmp;
}
NOTE: lambda1 and lambda2 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 (lambda2 <= 0.045d0) then
tmp = r * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))))
end if
code = tmp
end function
assert lambda1 < lambda2;
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 (lambda2 <= 0.045) {
tmp = R * Math.acos((t_0 + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos((lambda2 - lambda1)))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda2 <= 0.045: tmp = R * math.acos((t_0 + ((math.cos(phi1) * math.cos(phi2)) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos((lambda2 - lambda1))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda2 <= 0.045) tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(Float64(lambda2 - lambda1)))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda2 <= 0.045)
tmp = R * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos(phi2) * cos((lambda2 - lambda1)))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 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[lambda2, 0.045], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 0.045:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if lambda2 < 0.044999999999999998Initial program 78.2%
Taylor expanded in lambda2 around 0 61.4%
if 0.044999999999999998 < lambda2 Initial program 63.3%
Taylor expanded in phi1 around 0 42.7%
sub-neg42.7%
+-commutative42.7%
neg-mul-142.7%
neg-mul-142.7%
remove-double-neg42.7%
mul-1-neg42.7%
distribute-neg-in42.7%
+-commutative42.7%
cos-neg42.7%
+-commutative42.7%
mul-1-neg42.7%
unsub-neg42.7%
Simplified42.7%
Final simplification56.0%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= lambda2 1.4e-20)
(* R (acos (+ t_1 (* t_0 (cos lambda1)))))
(* R (acos (+ t_1 (* t_0 (cos lambda2))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (lambda2 <= 1.4e-20) {
tmp = R * acos((t_1 + (t_0 * cos(lambda1))));
} else {
tmp = R * acos((t_1 + (t_0 * cos(lambda2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos(phi1) * cos(phi2)
t_1 = sin(phi1) * sin(phi2)
if (lambda2 <= 1.4d-20) then
tmp = r * acos((t_1 + (t_0 * cos(lambda1))))
else
tmp = r * acos((t_1 + (t_0 * cos(lambda2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(phi1) * Math.cos(phi2);
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda2 <= 1.4e-20) {
tmp = R * Math.acos((t_1 + (t_0 * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_1 + (t_0 * Math.cos(lambda2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(phi1) * math.cos(phi2) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda2 <= 1.4e-20: tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda1)))) else: tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda2 <= 1.4e-20) tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos(phi1) * cos(phi2);
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda2 <= 1.4e-20)
tmp = R * acos((t_1 + (t_0 * cos(lambda1))));
else
tmp = R * acos((t_1 + (t_0 * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 1.4e-20], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 1.4 \cdot 10^{-20}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + t_0 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + t_0 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 1.4000000000000001e-20Initial program 77.6%
Taylor expanded in lambda2 around 0 60.9%
if 1.4000000000000001e-20 < lambda2 Initial program 66.4%
Taylor expanded in lambda1 around 0 64.9%
cos-neg64.9%
Simplified64.9%
Final simplification62.2%
NOTE: lambda1 and lambda2 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 4.3e-5)
(*
R
(acos
(+
(/ (- (cos (- phi1 phi2)) (cos (+ phi1 phi2))) 2.0)
(* (cos phi1) t_0))))
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi2) t_0)))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 4.3e-5) {
tmp = R * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0) + (cos(phi1) * t_0)));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: lambda1 and lambda2 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 <= 4.3d-5) then
tmp = r * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0d0) + (cos(phi1) * t_0)))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * t_0)))
end if
code = tmp
end function
assert lambda1 < lambda2;
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 <= 4.3e-5) {
tmp = R * Math.acos((((Math.cos((phi1 - phi2)) - Math.cos((phi1 + phi2))) / 2.0) + (Math.cos(phi1) * t_0)));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi2) * t_0)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi2 <= 4.3e-5: tmp = R * math.acos((((math.cos((phi1 - phi2)) - math.cos((phi1 + phi2))) / 2.0) + (math.cos(phi1) * t_0))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi2) * t_0))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 4.3e-5) tmp = Float64(R * acos(Float64(Float64(Float64(cos(Float64(phi1 - phi2)) - cos(Float64(phi1 + phi2))) / 2.0) + Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * t_0)))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi2 <= 4.3e-5)
tmp = R * acos((((cos((phi1 - phi2)) - cos((phi1 + phi2))) / 2.0) + (cos(phi1) * t_0)));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 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, 4.3e-5], N[(R * N[ArcCos[N[(N[(N[(N[Cos[N[(phi1 - phi2), $MachinePrecision]], $MachinePrecision] - N[Cos[N[(phi1 + phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 4.3 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\frac{\cos \left(\phi_1 - \phi_2\right) - \cos \left(\phi_1 + \phi_2\right)}{2} + \cos \phi_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
if phi2 < 4.3000000000000002e-5Initial program 72.7%
Taylor expanded in phi2 around 0 49.8%
sub-neg49.8%
+-commutative49.8%
neg-mul-149.8%
neg-mul-149.8%
remove-double-neg49.8%
mul-1-neg49.8%
distribute-neg-in49.8%
+-commutative49.8%
cos-neg49.8%
+-commutative49.8%
mul-1-neg49.8%
unsub-neg49.8%
Simplified49.8%
sin-mult50.2%
Applied egg-rr50.2%
+-commutative50.2%
Simplified50.2%
if 4.3000000000000002e-5 < phi2 Initial program 77.3%
Taylor expanded in phi1 around 0 47.5%
sub-neg47.5%
+-commutative47.5%
neg-mul-147.5%
neg-mul-147.5%
remove-double-neg47.5%
mul-1-neg47.5%
distribute-neg-in47.5%
+-commutative47.5%
cos-neg47.5%
+-commutative47.5%
mul-1-neg47.5%
unsub-neg47.5%
Simplified47.5%
Final simplification49.5%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= phi2 -0.0004) (not (<= phi2 1.38e-5)))
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi1) (cos phi2)))))
(*
R
(acos (+ (* (cos phi1) (cos (- lambda2 lambda1))) (* (sin phi1) phi2))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -0.0004) || !(phi2 <= 1.38e-5)) {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))));
} else {
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if ((phi2 <= (-0.0004d0)) .or. (.not. (phi2 <= 1.38d-5))) then
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))))
else
tmp = r * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -0.0004) || !(phi2 <= 1.38e-5)) {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos(phi2))));
} else {
tmp = R * Math.acos(((Math.cos(phi1) * Math.cos((lambda2 - lambda1))) + (Math.sin(phi1) * phi2)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if (phi2 <= -0.0004) or not (phi2 <= 1.38e-5): tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * math.cos(phi2)))) else: tmp = R * math.acos(((math.cos(phi1) * math.cos((lambda2 - lambda1))) + (math.sin(phi1) * phi2))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -0.0004) || !(phi2 <= 1.38e-5)) tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * cos(phi2))))); else tmp = Float64(R * acos(Float64(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))) + Float64(sin(phi1) * phi2)))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if ((phi2 <= -0.0004) || ~((phi2 <= 1.38e-5)))
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(phi2))));
else
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -0.0004], N[Not[LessEqual[phi2, 1.38e-5]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -0.0004 \lor \neg \left(\phi_2 \leq 1.38 \cdot 10^{-5}\right):\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right) + \sin \phi_1 \cdot \phi_2\right)\\
\end{array}
\end{array}
if phi2 < -4.00000000000000019e-4 or 1.38e-5 < phi2 Initial program 78.9%
Taylor expanded in lambda1 around 0 55.6%
mul-1-neg55.6%
unsub-neg55.6%
cos-neg55.6%
*-commutative55.6%
sin-neg55.6%
distribute-rgt-neg-out55.6%
Simplified55.6%
Taylor expanded in lambda2 around 0 39.3%
if -4.00000000000000019e-4 < phi2 < 1.38e-5Initial program 68.2%
Taylor expanded in phi2 around 0 68.2%
sub-neg68.2%
+-commutative68.2%
neg-mul-168.2%
neg-mul-168.2%
remove-double-neg68.2%
mul-1-neg68.2%
distribute-neg-in68.2%
+-commutative68.2%
cos-neg68.2%
+-commutative68.2%
mul-1-neg68.2%
unsub-neg68.2%
Simplified68.2%
Taylor expanded in phi2 around 0 68.2%
Final simplification52.7%
NOTE: lambda1 and lambda2 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 5.3e-7)
(* R (acos (+ t_0 (* (cos phi1) (cos (- lambda2 lambda1))))))
(* R (acos (+ t_0 (* (cos phi1) (cos phi2))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= 5.3e-7) {
tmp = R * acos((t_0 + (cos(phi1) * cos((lambda2 - lambda1)))));
} else {
tmp = R * acos((t_0 + (cos(phi1) * cos(phi2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 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 (phi2 <= 5.3d-7) then
tmp = r * acos((t_0 + (cos(phi1) * cos((lambda2 - lambda1)))))
else
tmp = r * acos((t_0 + (cos(phi1) * cos(phi2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
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 (phi2 <= 5.3e-7) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(phi2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if phi2 <= 5.3e-7: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos((lambda2 - lambda1))))) else: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(phi2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= 5.3e-7) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(phi2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (phi2 <= 5.3e-7)
tmp = R * acos((t_0 + (cos(phi1) * cos((lambda2 - lambda1)))));
else
tmp = R * acos((t_0 + (cos(phi1) * cos(phi2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 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, 5.3e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq 5.3 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 5.3e-7Initial program 73.0%
Taylor expanded in phi2 around 0 49.9%
sub-neg49.9%
+-commutative49.9%
neg-mul-149.9%
neg-mul-149.9%
remove-double-neg49.9%
mul-1-neg49.9%
distribute-neg-in49.9%
+-commutative49.9%
cos-neg49.9%
+-commutative49.9%
mul-1-neg49.9%
unsub-neg49.9%
Simplified49.9%
if 5.3e-7 < phi2 Initial program 76.4%
Taylor expanded in lambda1 around 0 56.8%
mul-1-neg56.8%
unsub-neg56.8%
cos-neg56.8%
*-commutative56.8%
sin-neg56.8%
distribute-rgt-neg-out56.8%
Simplified56.8%
Taylor expanded in lambda2 around 0 43.6%
Final simplification48.3%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))) (t_1 (* (sin phi1) (sin phi2))))
(if (<= phi2 4.6e-5)
(* R (acos (+ t_1 (* (cos phi1) t_0))))
(* R (acos (+ t_1 (* (cos phi2) t_0)))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= 4.6e-5) {
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
} else {
tmp = R * acos((t_1 + (cos(phi2) * t_0)));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
t_1 = sin(phi1) * sin(phi2)
if (phi2 <= 4.6d-5) then
tmp = r * acos((t_1 + (cos(phi1) * t_0)))
else
tmp = r * acos((t_1 + (cos(phi2) * t_0)))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double t_1 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (phi2 <= 4.6e-5) {
tmp = R * Math.acos((t_1 + (Math.cos(phi1) * t_0)));
} else {
tmp = R * Math.acos((t_1 + (Math.cos(phi2) * t_0)));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) t_1 = math.sin(phi1) * math.sin(phi2) tmp = 0 if phi2 <= 4.6e-5: tmp = R * math.acos((t_1 + (math.cos(phi1) * t_0))) else: tmp = R * math.acos((t_1 + (math.cos(phi2) * t_0))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= 4.6e-5) tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * t_0)))); else tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi2) * t_0)))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
t_1 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (phi2 <= 4.6e-5)
tmp = R * acos((t_1 + (cos(phi1) * t_0)));
else
tmp = R * acos((t_1 + (cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 4.6e-5], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq 4.6 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \phi_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_1 + \cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
if phi2 < 4.6e-5Initial program 72.7%
Taylor expanded in phi2 around 0 49.8%
sub-neg49.8%
+-commutative49.8%
neg-mul-149.8%
neg-mul-149.8%
remove-double-neg49.8%
mul-1-neg49.8%
distribute-neg-in49.8%
+-commutative49.8%
cos-neg49.8%
+-commutative49.8%
mul-1-neg49.8%
unsub-neg49.8%
Simplified49.8%
if 4.6e-5 < phi2 Initial program 77.3%
Taylor expanded in phi1 around 0 47.5%
sub-neg47.5%
+-commutative47.5%
neg-mul-147.5%
neg-mul-147.5%
remove-double-neg47.5%
mul-1-neg47.5%
distribute-neg-in47.5%
+-commutative47.5%
cos-neg47.5%
+-commutative47.5%
mul-1-neg47.5%
unsub-neg47.5%
Simplified47.5%
Final simplification49.2%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 2.5e+34)
(*
R
(acos (+ (* (cos phi1) (cos (- lambda2 lambda1))) (* (sin phi1) phi2))))
(* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi1) (cos lambda1)))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.5e+34) {
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)));
} else {
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(lambda1))));
}
return tmp;
}
NOTE: lambda1 and lambda2 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 <= 2.5d+34) then
tmp = r * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)))
else
tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(lambda1))))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.5e+34) {
tmp = R * Math.acos(((Math.cos(phi1) * Math.cos((lambda2 - lambda1))) + (Math.sin(phi1) * phi2)));
} else {
tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos(lambda1))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.5e+34: tmp = R * math.acos(((math.cos(phi1) * math.cos((lambda2 - lambda1))) + (math.sin(phi1) * phi2))) else: tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * math.cos(lambda1)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.5e+34) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * cos(lambda1))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 2.5e+34)
tmp = R * acos(((cos(phi1) * cos((lambda2 - lambda1))) + (sin(phi1) * phi2)));
else
tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * cos(lambda1))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.5e+34], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.5 \cdot 10^{+34}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right) + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi2 < 2.4999999999999999e34Initial program 72.6%
Taylor expanded in phi2 around 0 48.4%
sub-neg48.4%
+-commutative48.4%
neg-mul-148.4%
neg-mul-148.4%
remove-double-neg48.4%
mul-1-neg48.4%
distribute-neg-in48.4%
+-commutative48.4%
cos-neg48.4%
+-commutative48.4%
mul-1-neg48.4%
unsub-neg48.4%
Simplified48.4%
Taylor expanded in phi2 around 0 44.2%
if 2.4999999999999999e34 < phi2 Initial program 78.3%
Taylor expanded in phi2 around 0 14.9%
sub-neg14.9%
+-commutative14.9%
neg-mul-114.9%
neg-mul-114.9%
remove-double-neg14.9%
mul-1-neg14.9%
distribute-neg-in14.9%
+-commutative14.9%
cos-neg14.9%
+-commutative14.9%
mul-1-neg14.9%
unsub-neg14.9%
Simplified14.9%
Taylor expanded in lambda2 around 0 12.5%
cos-neg5.4%
Simplified12.5%
Final simplification36.9%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= lambda1 -0.00019)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi1) (cos lambda2))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (lambda1 <= -0.00019) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (lambda1 <= (-0.00019d0)) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda1 <= -0.00019) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda1 <= -0.00019: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda1 <= -0.00019) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda1 <= -0.00019)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -0.00019], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_1 \leq -0.00019:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda1 < -1.9000000000000001e-4Initial program 59.1%
Taylor expanded in phi2 around 0 37.6%
sub-neg37.6%
+-commutative37.6%
neg-mul-137.6%
neg-mul-137.6%
remove-double-neg37.6%
mul-1-neg37.6%
distribute-neg-in37.6%
+-commutative37.6%
cos-neg37.6%
+-commutative37.6%
mul-1-neg37.6%
unsub-neg37.6%
Simplified37.6%
Taylor expanded in lambda2 around 0 37.7%
cos-neg21.4%
Simplified37.7%
if -1.9000000000000001e-4 < lambda1 Initial program 78.9%
Taylor expanded in phi2 around 0 41.7%
sub-neg41.7%
+-commutative41.7%
neg-mul-141.7%
neg-mul-141.7%
remove-double-neg41.7%
mul-1-neg41.7%
distribute-neg-in41.7%
+-commutative41.7%
cos-neg41.7%
+-commutative41.7%
mul-1-neg41.7%
unsub-neg41.7%
Simplified41.7%
Taylor expanded in lambda1 around 0 37.3%
Final simplification37.4%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi2 1.75e+53)
(* R (acos (+ (* (cos phi1) t_0) (* (sin phi1) phi2))))
(*
R
(acos (+ (* phi1 (sin phi2)) (* t_0 (+ 1.0 (* phi1 (* phi1 -0.5))))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 1.75e+53) {
tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
} else {
tmp = R * acos(((phi1 * sin(phi2)) + (t_0 * (1.0 + (phi1 * (phi1 * -0.5))))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
if (phi2 <= 1.75d+53) then
tmp = r * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)))
else
tmp = r * acos(((phi1 * sin(phi2)) + (t_0 * (1.0d0 + (phi1 * (phi1 * (-0.5d0)))))))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi2 <= 1.75e+53) {
tmp = R * Math.acos(((Math.cos(phi1) * t_0) + (Math.sin(phi1) * phi2)));
} else {
tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (t_0 * (1.0 + (phi1 * (phi1 * -0.5))))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi2 <= 1.75e+53: tmp = R * math.acos(((math.cos(phi1) * t_0) + (math.sin(phi1) * phi2))) else: tmp = R * math.acos(((phi1 * math.sin(phi2)) + (t_0 * (1.0 + (phi1 * (phi1 * -0.5)))))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= 1.75e+53) tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_0) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(t_0 * Float64(1.0 + Float64(phi1 * Float64(phi1 * -0.5))))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi2 <= 1.75e+53)
tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
else
tmp = R * acos(((phi1 * sin(phi2)) + (t_0 * (1.0 + (phi1 * (phi1 * -0.5))))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 1.75e+53], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(t$95$0 * N[(1.0 + N[(phi1 * N[(phi1 * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_2 \leq 1.75 \cdot 10^{+53}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t_0 + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + t_0 \cdot \left(1 + \phi_1 \cdot \left(\phi_1 \cdot -0.5\right)\right)\right)\\
\end{array}
\end{array}
if phi2 < 1.75000000000000009e53Initial program 72.9%
Taylor expanded in phi2 around 0 47.4%
sub-neg47.4%
+-commutative47.4%
neg-mul-147.4%
neg-mul-147.4%
remove-double-neg47.4%
mul-1-neg47.4%
distribute-neg-in47.4%
+-commutative47.4%
cos-neg47.4%
+-commutative47.4%
mul-1-neg47.4%
unsub-neg47.4%
Simplified47.4%
Taylor expanded in phi2 around 0 43.2%
if 1.75000000000000009e53 < phi2 Initial program 77.7%
Taylor expanded in phi2 around 0 15.3%
sub-neg15.3%
+-commutative15.3%
neg-mul-115.3%
neg-mul-115.3%
remove-double-neg15.3%
mul-1-neg15.3%
distribute-neg-in15.3%
+-commutative15.3%
cos-neg15.3%
+-commutative15.3%
mul-1-neg15.3%
unsub-neg15.3%
Simplified15.3%
Taylor expanded in phi1 around 0 7.3%
Taylor expanded in phi1 around 0 7.3%
+-commutative7.3%
*-lft-identity7.3%
associate-*r*7.3%
distribute-rgt-out7.3%
unpow27.3%
associate-*r*7.3%
Simplified7.3%
Final simplification35.6%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= lambda2 1.95e-13)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ (cos lambda2) t_0))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (lambda2 <= 1.95e-13) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((cos(lambda2) + t_0));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (lambda2 <= 1.95d-13) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((cos(lambda2) + t_0))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (lambda2 <= 1.95e-13) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((Math.cos(lambda2) + t_0));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda2 <= 1.95e-13: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((math.cos(lambda2) + t_0)) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda2 <= 1.95e-13) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(cos(lambda2) + t_0))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda2 <= 1.95e-13)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((cos(lambda2) + t_0));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 1.95e-13], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[lambda2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 1.95 \cdot 10^{-13}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_2 + t_0\right)\\
\end{array}
\end{array}
if lambda2 < 1.95000000000000002e-13Initial program 78.0%
Taylor expanded in phi2 around 0 41.0%
sub-neg41.0%
+-commutative41.0%
neg-mul-141.0%
neg-mul-141.0%
remove-double-neg41.0%
mul-1-neg41.0%
distribute-neg-in41.0%
+-commutative41.0%
cos-neg41.0%
+-commutative41.0%
mul-1-neg41.0%
unsub-neg41.0%
Simplified41.0%
Taylor expanded in phi1 around 0 27.3%
Taylor expanded in lambda2 around 0 20.8%
cos-neg20.8%
Simplified20.8%
if 1.95000000000000002e-13 < lambda2 Initial program 65.2%
Taylor expanded in phi2 around 0 39.8%
sub-neg39.8%
+-commutative39.8%
neg-mul-139.8%
neg-mul-139.8%
remove-double-neg39.8%
mul-1-neg39.8%
distribute-neg-in39.8%
+-commutative39.8%
cos-neg39.8%
+-commutative39.8%
mul-1-neg39.8%
unsub-neg39.8%
Simplified39.8%
Taylor expanded in phi1 around 0 30.2%
Taylor expanded in phi1 around 0 20.5%
Taylor expanded in lambda1 around 0 20.8%
Final simplification20.8%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= lambda2 9.5e-50)
(* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
(* R (acos (+ t_0 (* (cos phi1) (cos lambda2))))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (lambda2 <= 9.5e-50) {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
} else {
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (lambda2 <= 9.5d-50) then
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
else
tmp = r * acos((t_0 + (cos(phi1) * cos(lambda2))))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (lambda2 <= 9.5e-50) {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
} else {
tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda2))));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda2 <= 9.5e-50: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda1)))) else: tmp = R * math.acos((t_0 + (math.cos(phi1) * math.cos(lambda2)))) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda2 <= 9.5e-50) tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda1))))); else tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * cos(lambda2))))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda2 <= 9.5e-50)
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda1))));
else
tmp = R * acos((t_0 + (cos(phi1) * cos(lambda2))));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 9.5e-50], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 9.5 \cdot 10^{-50}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 9.4999999999999993e-50Initial program 77.6%
Taylor expanded in phi2 around 0 42.3%
sub-neg42.3%
+-commutative42.3%
neg-mul-142.3%
neg-mul-142.3%
remove-double-neg42.3%
mul-1-neg42.3%
distribute-neg-in42.3%
+-commutative42.3%
cos-neg42.3%
+-commutative42.3%
mul-1-neg42.3%
unsub-neg42.3%
Simplified42.3%
Taylor expanded in phi1 around 0 28.3%
Taylor expanded in lambda2 around 0 21.6%
cos-neg21.6%
Simplified21.6%
if 9.4999999999999993e-50 < lambda2 Initial program 66.8%
Taylor expanded in phi2 around 0 37.5%
sub-neg37.5%
+-commutative37.5%
neg-mul-137.5%
neg-mul-137.5%
remove-double-neg37.5%
mul-1-neg37.5%
distribute-neg-in37.5%
+-commutative37.5%
cos-neg37.5%
+-commutative37.5%
mul-1-neg37.5%
unsub-neg37.5%
Simplified37.5%
Taylor expanded in phi1 around 0 28.0%
Taylor expanded in lambda1 around 0 28.2%
Final simplification23.8%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi1) (cos (- lambda2 lambda1)))))))
assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))));
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))))
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi1) * Math.cos((lambda2 - lambda1)))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi1) * math.cos((lambda2 - lambda1)))))
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi1) * cos((lambda2 - lambda1)))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)
\end{array}
Initial program 73.9%
Taylor expanded in phi2 around 0 40.7%
sub-neg40.7%
+-commutative40.7%
neg-mul-140.7%
neg-mul-140.7%
remove-double-neg40.7%
mul-1-neg40.7%
distribute-neg-in40.7%
+-commutative40.7%
cos-neg40.7%
+-commutative40.7%
mul-1-neg40.7%
unsub-neg40.7%
Simplified40.7%
Taylor expanded in phi1 around 0 28.2%
Final simplification28.2%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (sin phi2))))
(if (<= lambda2 9.5e-50)
(* R (acos (+ (cos lambda1) t_0)))
(* R (acos (+ (cos lambda2) t_0))))))assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * sin(phi2);
double tmp;
if (lambda2 <= 9.5e-50) {
tmp = R * acos((cos(lambda1) + t_0));
} else {
tmp = R * acos((cos(lambda2) + t_0));
}
return tmp;
}
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = phi1 * sin(phi2)
if (lambda2 <= 9.5d-50) then
tmp = r * acos((cos(lambda1) + t_0))
else
tmp = r * acos((cos(lambda2) + t_0))
end if
code = tmp
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * Math.sin(phi2);
double tmp;
if (lambda2 <= 9.5e-50) {
tmp = R * Math.acos((Math.cos(lambda1) + t_0));
} else {
tmp = R * Math.acos((Math.cos(lambda2) + t_0));
}
return tmp;
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * math.sin(phi2) tmp = 0 if lambda2 <= 9.5e-50: tmp = R * math.acos((math.cos(lambda1) + t_0)) else: tmp = R * math.acos((math.cos(lambda2) + t_0)) return tmp
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * sin(phi2)) tmp = 0.0 if (lambda2 <= 9.5e-50) tmp = Float64(R * acos(Float64(cos(lambda1) + t_0))); else tmp = Float64(R * acos(Float64(cos(lambda2) + t_0))); end return tmp end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = phi1 * sin(phi2);
tmp = 0.0;
if (lambda2 <= 9.5e-50)
tmp = R * acos((cos(lambda1) + t_0));
else
tmp = R * acos((cos(lambda2) + t_0));
end
tmp_2 = tmp;
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 9.5e-50], N[(R * N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[lambda2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\lambda_2 \leq 9.5 \cdot 10^{-50}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_1 + t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \lambda_2 + t_0\right)\\
\end{array}
\end{array}
if lambda2 < 9.4999999999999993e-50Initial program 77.6%
Taylor expanded in phi2 around 0 42.3%
sub-neg42.3%
+-commutative42.3%
neg-mul-142.3%
neg-mul-142.3%
remove-double-neg42.3%
mul-1-neg42.3%
distribute-neg-in42.3%
+-commutative42.3%
cos-neg42.3%
+-commutative42.3%
mul-1-neg42.3%
unsub-neg42.3%
Simplified42.3%
Taylor expanded in phi1 around 0 28.3%
Taylor expanded in phi1 around 0 19.1%
Taylor expanded in lambda2 around 0 14.5%
cos-neg14.5%
Simplified14.5%
if 9.4999999999999993e-50 < lambda2 Initial program 66.8%
Taylor expanded in phi2 around 0 37.5%
sub-neg37.5%
+-commutative37.5%
neg-mul-137.5%
neg-mul-137.5%
remove-double-neg37.5%
mul-1-neg37.5%
distribute-neg-in37.5%
+-commutative37.5%
cos-neg37.5%
+-commutative37.5%
mul-1-neg37.5%
unsub-neg37.5%
Simplified37.5%
Taylor expanded in phi1 around 0 28.0%
Taylor expanded in phi1 around 0 19.1%
Taylor expanded in lambda1 around 0 19.3%
Final simplification16.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (cos (- lambda2 lambda1)) (* phi1 (sin phi2))))))
assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos((cos((lambda2 - lambda1)) + (phi1 * sin(phi2))));
}
NOTE: lambda1 and lambda2 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)) + (phi1 * sin(phi2))))
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos((Math.cos((lambda2 - lambda1)) + (phi1 * Math.sin(phi2))));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos((math.cos((lambda2 - lambda1)) + (phi1 * math.sin(phi2))))
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(cos(Float64(lambda2 - lambda1)) + Float64(phi1 * sin(phi2))))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos((cos((lambda2 - lambda1)) + (phi1 * sin(phi2))));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
R \cdot \cos^{-1} \left(\cos \left(\lambda_2 - \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)
\end{array}
Initial program 73.9%
Taylor expanded in phi2 around 0 40.7%
sub-neg40.7%
+-commutative40.7%
neg-mul-140.7%
neg-mul-140.7%
remove-double-neg40.7%
mul-1-neg40.7%
distribute-neg-in40.7%
+-commutative40.7%
cos-neg40.7%
+-commutative40.7%
mul-1-neg40.7%
unsub-neg40.7%
Simplified40.7%
Taylor expanded in phi1 around 0 28.2%
Taylor expanded in phi1 around 0 19.1%
Final simplification19.1%
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (acos (+ (cos (- lambda2 lambda1)) (* phi1 phi2)))))
assert(lambda1 < lambda2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)));
}
NOTE: lambda1 and lambda2 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)) + (phi1 * phi2)))
end function
assert lambda1 < lambda2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.acos((Math.cos((lambda2 - lambda1)) + (phi1 * phi2)));
}
[lambda1, lambda2] = sort([lambda1, lambda2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.acos((math.cos((lambda2 - lambda1)) + (phi1 * phi2)))
lambda1, lambda2 = sort([lambda1, lambda2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(Float64(cos(Float64(lambda2 - lambda1)) + Float64(phi1 * phi2)))) end
lambda1, lambda2 = num2cell(sort([lambda1, lambda2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * acos((cos((lambda2 - lambda1)) + (phi1 * phi2)));
end
NOTE: lambda1 and lambda2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[lambda1, lambda2] = \mathsf{sort}([lambda1, lambda2])\\
\\
R \cdot \cos^{-1} \left(\cos \left(\lambda_2 - \lambda_1\right) + \phi_1 \cdot \phi_2\right)
\end{array}
Initial program 73.9%
Taylor expanded in phi2 around 0 40.7%
sub-neg40.7%
+-commutative40.7%
neg-mul-140.7%
neg-mul-140.7%
remove-double-neg40.7%
mul-1-neg40.7%
distribute-neg-in40.7%
+-commutative40.7%
cos-neg40.7%
+-commutative40.7%
mul-1-neg40.7%
unsub-neg40.7%
Simplified40.7%
Taylor expanded in phi1 around 0 28.2%
Taylor expanded in phi1 around 0 19.1%
Taylor expanded in phi2 around 0 17.0%
Final simplification17.0%
herbie shell --seed 2023172
(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))