
(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 26 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(acos
(fma
(* (* (cos phi1) (cos phi2)) (cos lambda2))
(cos lambda1)
(fma
(* (* (sin lambda1) (sin lambda2)) (cos phi1))
(cos phi2)
(* (sin phi1) (sin phi2)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * acos(fma(((cos(phi1) * cos(phi2)) * cos(lambda2)), cos(lambda1), fma(((sin(lambda1) * sin(lambda2)) * cos(phi1)), cos(phi2), (sin(phi1) * sin(phi2)))));
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * acos(fma(Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda2)), cos(lambda1), fma(Float64(Float64(sin(lambda1) * sin(lambda2)) * cos(phi1)), cos(phi2), Float64(sin(phi1) * sin(phi2)))))) end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[(N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[phi2], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \cos^{-1} \left(\mathsf{fma}\left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_2, \cos \lambda_1, \mathsf{fma}\left(\left(\sin \lambda_1 \cdot \sin \lambda_2\right) \cdot \cos \phi_1, \cos \phi_2, \sin \phi_1 \cdot \sin \phi_2\right)\right)\right)
\end{array}
Initial program 74.0%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+l+N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
Applied rewrites92.7%
Final simplification92.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(*
(+ (* (cos lambda1) (cos lambda2)) (* (sin lambda1) (sin lambda2)))
(* (cos phi1) (cos phi2)))
(* (sin phi1) (sin phi2))))
R))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((((cos(lambda1) * cos(lambda2)) + (sin(lambda1) * sin(lambda2))) * (cos(phi1) * cos(phi2))) + (sin(phi1) * sin(phi2)))) * R;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((((cos(lambda1) * cos(lambda2)) + (sin(lambda1) * sin(lambda2))) * (cos(phi1) * cos(phi2))) + (sin(phi1) * sin(phi2)))) * r
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((((Math.cos(lambda1) * Math.cos(lambda2)) + (Math.sin(lambda1) * Math.sin(lambda2))) * (Math.cos(phi1) * Math.cos(phi2))) + (Math.sin(phi1) * Math.sin(phi2)))) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((((math.cos(lambda1) * math.cos(lambda2)) + (math.sin(lambda1) * math.sin(lambda2))) * (math.cos(phi1) * math.cos(phi2))) + (math.sin(phi1) * math.sin(phi2)))) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(Float64(Float64(cos(lambda1) * cos(lambda2)) + Float64(sin(lambda1) * sin(lambda2))) * Float64(cos(phi1) * cos(phi2))) + Float64(sin(phi1) * sin(phi2)))) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = acos(((((cos(lambda1) * cos(lambda2)) + (sin(lambda1) * sin(lambda2))) * (cos(phi1) * cos(phi2))) + (sin(phi1) * sin(phi2)))) * R;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[(N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\cos^{-1} \left(\left(\cos \lambda_1 \cdot \cos \lambda_2 + \sin \lambda_1 \cdot \sin \lambda_2\right) \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right) + \sin \phi_1 \cdot \sin \phi_2\right) \cdot R
\end{array}
Initial program 74.0%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6492.7
Applied rewrites92.7%
Final simplification92.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(*
(fma (sin lambda2) (sin lambda1) (* (cos lambda1) (cos lambda2)))
(* (cos phi1) (cos phi2)))
(* (sin phi1) (sin phi2))))
R))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((fma(sin(lambda2), sin(lambda1), (cos(lambda1) * cos(lambda2))) * (cos(phi1) * cos(phi2))) + (sin(phi1) * sin(phi2)))) * R;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(fma(sin(lambda2), sin(lambda1), Float64(cos(lambda1) * cos(lambda2))) * Float64(cos(phi1) * cos(phi2))) + Float64(sin(phi1) * sin(phi2)))) * R) end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_2, \sin \lambda_1, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right) + \sin \phi_1 \cdot \sin \phi_2\right) \cdot R
\end{array}
Initial program 74.0%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6492.7
Applied rewrites92.7%
Final simplification92.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(fma
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2))
(cos phi1)
(* (sin phi1) (sin phi2))))
R))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(fma((fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi2)), cos(phi1), (sin(phi1) * sin(phi2)))) * R;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(fma(Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi2)), cos(phi1), Float64(sin(phi1) * sin(phi2)))) * R) end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\cos^{-1} \left(\mathsf{fma}\left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2, \cos \phi_1, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R
\end{array}
Initial program 74.0%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6492.7
Applied rewrites92.7%
Taylor expanded in lambda1 around inf
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6492.7
Applied rewrites92.7%
Final simplification92.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(fma
(* (cos (- lambda2 lambda1)) (cos phi1))
(cos phi2)
(* (sin phi1) (sin phi2))))
(t_1 (sqrt (PI)))
(t_2 (* t_1 0.5)))
(if (<= phi1 -5.2e-14)
(fma (* (PI) 0.5) R (* (- R) (asin t_0)))
(if (<= phi1 3.1e-18)
(*
(acos
(fma
(* (* (sin lambda1) (sin lambda2)) (cos phi2))
(cos phi1)
(* (* (cos lambda1) (cos lambda2)) (cos phi2))))
R)
(* (fma t_1 t_2 (- (fma t_2 t_1 (- (acos t_0))))) R)))))\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_1, \cos \phi_2, \sin \phi_1 \cdot \sin \phi_2\right)\\
t_1 := \sqrt{\mathsf{PI}\left(\right)}\\
t_2 := t\_1 \cdot 0.5\\
\mathbf{if}\;\phi_1 \leq -5.2 \cdot 10^{-14}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{PI}\left(\right) \cdot 0.5, R, \left(-R\right) \cdot \sin^{-1} t\_0\right)\\
\mathbf{elif}\;\phi_1 \leq 3.1 \cdot 10^{-18}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\left(\sin \lambda_1 \cdot \sin \lambda_2\right) \cdot \cos \phi_2, \cos \phi_1, \left(\cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t\_1, t\_2, -\mathsf{fma}\left(t\_2, t\_1, -\cos^{-1} t\_0\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -5.19999999999999993e-14Initial program 79.2%
lift-*.f64N/A
*-commutativeN/A
lift-acos.f64N/A
acos-asinN/A
sub-negN/A
distribute-rgt-inN/A
lower-fma.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
lower-PI.f64N/A
lower-*.f64N/A
Applied rewrites79.1%
if -5.19999999999999993e-14 < phi1 < 3.10000000000000007e-18Initial program 67.1%
lift-+.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
lower-+.f64N/A
Applied rewrites85.6%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6485.6
Applied rewrites85.6%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6485.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.6
Applied rewrites85.6%
if 3.10000000000000007e-18 < phi1 Initial program 80.5%
lift-acos.f64N/A
acos-asinN/A
sub-negN/A
div-invN/A
add-sqr-sqrtN/A
associate-*l*N/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-PI.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-PI.f64N/A
metadata-evalN/A
lower-neg.f64N/A
Applied rewrites79.8%
lift-asin.f64N/A
asin-acosN/A
sub-negN/A
lift-PI.f64N/A
div-invN/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
metadata-evalN/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites80.5%
Final simplification82.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2)))
(t_1 (fma (* (cos (- lambda2 lambda1)) (cos phi1)) (cos phi2) t_0))
(t_2 (sqrt (PI)))
(t_3 (* t_2 0.5)))
(if (<= phi1 -1.3e-10)
(fma (* (PI) 0.5) R (* (- R) (asin t_1)))
(if (<= phi1 3.1e-18)
(*
(acos
(+
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2))
t_0))
R)
(* (fma t_2 t_3 (- (fma t_3 t_2 (- (acos t_1))))) R)))))\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_1, \cos \phi_2, t\_0\right)\\
t_2 := \sqrt{\mathsf{PI}\left(\right)}\\
t_3 := t\_2 \cdot 0.5\\
\mathbf{if}\;\phi_1 \leq -1.3 \cdot 10^{-10}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{PI}\left(\right) \cdot 0.5, R, \left(-R\right) \cdot \sin^{-1} t\_1\right)\\
\mathbf{elif}\;\phi_1 \leq 3.1 \cdot 10^{-18}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2 + t\_0\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t\_2, t\_3, -\mathsf{fma}\left(t\_3, t\_2, -\cos^{-1} t\_1\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -1.29999999999999991e-10Initial program 79.2%
lift-*.f64N/A
*-commutativeN/A
lift-acos.f64N/A
acos-asinN/A
sub-negN/A
distribute-rgt-inN/A
lower-fma.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
lower-PI.f64N/A
lower-*.f64N/A
Applied rewrites79.1%
if -1.29999999999999991e-10 < phi1 < 3.10000000000000007e-18Initial program 67.1%
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6485.6
Applied rewrites85.6%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6485.6
Applied rewrites85.6%
if 3.10000000000000007e-18 < phi1 Initial program 80.5%
lift-acos.f64N/A
acos-asinN/A
sub-negN/A
div-invN/A
add-sqr-sqrtN/A
associate-*l*N/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-PI.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-PI.f64N/A
metadata-evalN/A
lower-neg.f64N/A
Applied rewrites79.8%
lift-asin.f64N/A
asin-acosN/A
sub-negN/A
lift-PI.f64N/A
div-invN/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
metadata-evalN/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites80.5%
Final simplification82.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(fma
(* (cos (- lambda2 lambda1)) (cos phi1))
(cos phi2)
(* (sin phi1) (sin phi2))))
(t_1 (sqrt (PI)))
(t_2 (* t_1 0.5)))
(if (<= phi1 -5.2e-14)
(fma (* (PI) 0.5) R (* (- R) (asin t_0)))
(if (<= phi1 3.1e-18)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R)
(* (fma t_1 t_2 (- (fma t_2 t_1 (- (acos t_0))))) R)))))\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_1, \cos \phi_2, \sin \phi_1 \cdot \sin \phi_2\right)\\
t_1 := \sqrt{\mathsf{PI}\left(\right)}\\
t_2 := t\_1 \cdot 0.5\\
\mathbf{if}\;\phi_1 \leq -5.2 \cdot 10^{-14}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{PI}\left(\right) \cdot 0.5, R, \left(-R\right) \cdot \sin^{-1} t\_0\right)\\
\mathbf{elif}\;\phi_1 \leq 3.1 \cdot 10^{-18}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t\_1, t\_2, -\mathsf{fma}\left(t\_2, t\_1, -\cos^{-1} t\_0\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -5.19999999999999993e-14Initial program 79.2%
lift-*.f64N/A
*-commutativeN/A
lift-acos.f64N/A
acos-asinN/A
sub-negN/A
distribute-rgt-inN/A
lower-fma.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
lower-PI.f64N/A
lower-*.f64N/A
Applied rewrites79.1%
if -5.19999999999999993e-14 < phi1 < 3.10000000000000007e-18Initial program 67.1%
lift-+.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
lower-+.f64N/A
Applied rewrites85.6%
Taylor expanded in phi1 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6485.6
Applied rewrites85.6%
if 3.10000000000000007e-18 < phi1 Initial program 80.5%
lift-acos.f64N/A
acos-asinN/A
sub-negN/A
div-invN/A
add-sqr-sqrtN/A
associate-*l*N/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-PI.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-PI.f64N/A
metadata-evalN/A
lower-neg.f64N/A
Applied rewrites79.8%
lift-asin.f64N/A
asin-acosN/A
sub-negN/A
lift-PI.f64N/A
div-invN/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
metadata-evalN/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites80.5%
Final simplification82.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(asin
(fma
(* (cos (- lambda2 lambda1)) (cos phi1))
(cos phi2)
(* (sin phi1) (sin phi2)))))
(t_1 (* (PI) 0.5)))
(if (<= phi1 -5.2e-14)
(fma t_1 R (* (- R) t_0))
(if (<= phi1 3.1e-18)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R)
(fma (- t_0) R (* t_1 R))))))\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_1, \cos \phi_2, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
t_1 := \mathsf{PI}\left(\right) \cdot 0.5\\
\mathbf{if}\;\phi_1 \leq -5.2 \cdot 10^{-14}:\\
\;\;\;\;\mathsf{fma}\left(t\_1, R, \left(-R\right) \cdot t\_0\right)\\
\mathbf{elif}\;\phi_1 \leq 3.1 \cdot 10^{-18}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-t\_0, R, t\_1 \cdot R\right)\\
\end{array}
\end{array}
if phi1 < -5.19999999999999993e-14Initial program 79.2%
lift-*.f64N/A
*-commutativeN/A
lift-acos.f64N/A
acos-asinN/A
sub-negN/A
distribute-rgt-inN/A
lower-fma.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
metadata-evalN/A
lower-PI.f64N/A
lower-*.f64N/A
Applied rewrites79.1%
if -5.19999999999999993e-14 < phi1 < 3.10000000000000007e-18Initial program 67.1%
lift-+.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
lower-+.f64N/A
Applied rewrites85.6%
Taylor expanded in phi1 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6485.6
Applied rewrites85.6%
if 3.10000000000000007e-18 < phi1 Initial program 80.5%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+l+N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
Applied rewrites98.8%
Applied rewrites80.5%
Final simplification82.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(fma
(-
(asin
(fma
(* (cos (- lambda2 lambda1)) (cos phi1))
(cos phi2)
(* (sin phi1) (sin phi2)))))
R
(* (* (PI) 0.5) R))))
(if (<= phi1 -3e-14)
t_0
(if (<= phi1 3.1e-18)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R)
t_0))))\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-\sin^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_1, \cos \phi_2, \sin \phi_1 \cdot \sin \phi_2\right)\right), R, \left(\mathsf{PI}\left(\right) \cdot 0.5\right) \cdot R\right)\\
\mathbf{if}\;\phi_1 \leq -3 \cdot 10^{-14}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_1 \leq 3.1 \cdot 10^{-18}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi1 < -2.9999999999999998e-14 or 3.10000000000000007e-18 < phi1 Initial program 79.8%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+l+N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
Applied rewrites98.7%
Applied rewrites79.8%
if -2.9999999999999998e-14 < phi1 < 3.10000000000000007e-18Initial program 67.1%
lift-+.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
lower-+.f64N/A
Applied rewrites85.6%
Taylor expanded in phi1 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6485.6
Applied rewrites85.6%
Final simplification82.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<= phi1 -1.8e-46)
(*
(acos (+ (* (cos (- lambda1 lambda2)) (* (cos phi1) (cos phi2))) t_0))
R)
(if (<= phi1 2.4e-13)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R)
(*
(fma
(PI)
0.5
(-
(asin
(fma (* (cos (- lambda2 lambda1)) (cos phi1)) (cos phi2) t_0))))
R)))))\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_1 \leq -1.8 \cdot 10^{-46}:\\
\;\;\;\;\cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right) + t\_0\right) \cdot R\\
\mathbf{elif}\;\phi_1 \leq 2.4 \cdot 10^{-13}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{PI}\left(\right), 0.5, -\sin^{-1} \left(\mathsf{fma}\left(\cos \left(\lambda_2 - \lambda_1\right) \cdot \cos \phi_1, \cos \phi_2, t\_0\right)\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -1.8e-46Initial program 78.8%
if -1.8e-46 < phi1 < 2.3999999999999999e-13Initial program 66.8%
lift-+.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
lower-+.f64N/A
Applied rewrites86.0%
Taylor expanded in phi1 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6486.0
Applied rewrites86.0%
if 2.3999999999999999e-13 < phi1 Initial program 81.3%
lift-acos.f64N/A
acos-asinN/A
sub-negN/A
div-invN/A
lower-fma.f64N/A
lower-PI.f64N/A
metadata-evalN/A
lower-neg.f64N/A
lower-asin.f6481.2
lift-+.f64N/A
+-commutativeN/A
Applied rewrites81.2%
Final simplification82.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0
(*
(acos
(+
(* (cos (- lambda1 lambda2)) (* (cos phi1) (cos phi2)))
(* (sin phi1) (sin phi2))))
R)))
(if (<= phi1 -1.8e-46)
t_0
(if (<= phi1 3.9e-23)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R)
t_0))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = acos(((cos((lambda1 - lambda2)) * (cos(phi1) * cos(phi2))) + (sin(phi1) * sin(phi2)))) * R;
double tmp;
if (phi1 <= -1.8e-46) {
tmp = t_0;
} else if (phi1 <= 3.9e-23) {
tmp = acos((fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi2))) * R;
} else {
tmp = t_0;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(acos(Float64(Float64(cos(Float64(lambda1 - lambda2)) * Float64(cos(phi1) * cos(phi2))) + Float64(sin(phi1) * sin(phi2)))) * R) tmp = 0.0 if (phi1 <= -1.8e-46) tmp = t_0; elseif (phi1 <= 3.9e-23) tmp = Float64(acos(Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi2))) * R); else tmp = t_0; end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[ArcCos[N[(N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]}, If[LessEqual[phi1, -1.8e-46], t$95$0, If[LessEqual[phi1, 3.9e-23], N[(N[ArcCos[N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], t$95$0]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \phi_1 \cdot \cos \phi_2\right) + \sin \phi_1 \cdot \sin \phi_2\right) \cdot R\\
\mathbf{if}\;\phi_1 \leq -1.8 \cdot 10^{-46}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_1 \leq 3.9 \cdot 10^{-23}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi1 < -1.8e-46 or 3.9e-23 < phi1 Initial program 79.8%
if -1.8e-46 < phi1 < 3.9e-23Initial program 66.9%
lift-+.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
lower-+.f64N/A
Applied rewrites85.8%
Taylor expanded in phi1 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6485.7
Applied rewrites85.7%
Final simplification82.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -1.3e-7)
(*
(acos
(fma (* (cos phi1) (cos phi2)) (cos lambda1) (* (sin phi1) (sin phi2))))
R)
(if (<= lambda1 0.00082)
(*
(acos
(fma (sin phi2) (sin phi1) (* (* (cos lambda2) (cos phi2)) (cos phi1))))
R)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi2)))
R))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.3e-7) {
tmp = acos(fma((cos(phi1) * cos(phi2)), cos(lambda1), (sin(phi1) * sin(phi2)))) * R;
} else if (lambda1 <= 0.00082) {
tmp = acos(fma(sin(phi2), sin(phi1), ((cos(lambda2) * cos(phi2)) * cos(phi1)))) * R;
} else {
tmp = acos((fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi2))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.3e-7) tmp = Float64(acos(fma(Float64(cos(phi1) * cos(phi2)), cos(lambda1), Float64(sin(phi1) * sin(phi2)))) * R); elseif (lambda1 <= 0.00082) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(lambda2) * cos(phi2)) * cos(phi1)))) * R); else tmp = Float64(acos(Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi2))) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.3e-7], N[(N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda1, 0.00082], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.3 \cdot 10^{-7}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \lambda_1, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R\\
\mathbf{elif}\;\lambda_1 \leq 0.00082:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \lambda_2 \cdot \cos \phi_2\right) \cdot \cos \phi_1\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if lambda1 < -1.29999999999999999e-7Initial program 66.5%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6465.9
Applied rewrites65.9%
if -1.29999999999999999e-7 < lambda1 < 8.1999999999999998e-4Initial program 84.6%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6484.2
Applied rewrites84.2%
if 8.1999999999999998e-4 < lambda1 Initial program 63.2%
lift-+.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
lower-+.f64N/A
Applied rewrites99.1%
Taylor expanded in phi1 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6455.2
Applied rewrites55.2%
Final simplification71.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -0.008)
(*
(acos
(*
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2)))
(cos phi1)))
R)
(if (<= lambda2 2e-22)
(*
(acos
(fma (sin phi2) (sin phi1) (* (* (cos phi1) (cos phi2)) (cos lambda1))))
R)
(*
(acos
(fma (sin phi2) (sin phi1) (* (* (cos lambda2) (cos phi2)) (cos phi1))))
R))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -0.008) {
tmp = acos((fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))) * cos(phi1))) * R;
} else if (lambda2 <= 2e-22) {
tmp = acos(fma(sin(phi2), sin(phi1), ((cos(phi1) * cos(phi2)) * cos(lambda1)))) * R;
} else {
tmp = acos(fma(sin(phi2), sin(phi1), ((cos(lambda2) * cos(phi2)) * cos(phi1)))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -0.008) tmp = Float64(acos(Float64(fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))) * cos(phi1))) * R); elseif (lambda2 <= 2e-22) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda1)))) * R); else tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(lambda2) * cos(phi2)) * cos(phi1)))) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -0.008], N[(N[ArcCos[N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 2e-22], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -0.008:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 2 \cdot 10^{-22}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_1\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \lambda_2 \cdot \cos \phi_2\right) \cdot \cos \phi_1\right)\right) \cdot R\\
\end{array}
\end{array}
if lambda2 < -0.0080000000000000002Initial program 53.9%
lift-+.f64N/A
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
cos-diffN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
lower-+.f64N/A
Applied rewrites99.3%
Taylor expanded in phi2 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f6458.8
Applied rewrites58.8%
if -0.0080000000000000002 < lambda2 < 2.0000000000000001e-22Initial program 87.2%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6487.2
Applied rewrites87.2%
Applied rewrites87.2%
if 2.0000000000000001e-22 < lambda2 Initial program 61.8%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6461.8
Applied rewrites61.8%
Final simplification75.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 2e-22)
(*
(acos
(fma (sin phi2) (sin phi1) (* (* (cos phi1) (cos phi2)) (cos lambda1))))
R)
(*
(acos
(fma (sin phi2) (sin phi1) (* (* (cos lambda2) (cos phi2)) (cos phi1))))
R)))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2e-22) {
tmp = acos(fma(sin(phi2), sin(phi1), ((cos(phi1) * cos(phi2)) * cos(lambda1)))) * R;
} else {
tmp = acos(fma(sin(phi2), sin(phi1), ((cos(lambda2) * cos(phi2)) * cos(phi1)))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2e-22) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda1)))) * R); else tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(lambda2) * cos(phi2)) * cos(phi1)))) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2e-22], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2 \cdot 10^{-22}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_1\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \lambda_2 \cdot \cos \phi_2\right) \cdot \cos \phi_1\right)\right) \cdot R\\
\end{array}
\end{array}
if lambda2 < 2.0000000000000001e-22Initial program 77.5%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6467.5
Applied rewrites67.5%
Applied rewrites67.5%
if 2.0000000000000001e-22 < lambda2 Initial program 61.8%
Taylor expanded in lambda1 around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sin.f64N/A
lower-sin.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f6461.8
Applied rewrites61.8%
Final simplification66.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 8e-6)
(*
(acos
(fma (sin phi2) (sin phi1) (* (* (cos phi1) (cos phi2)) (cos lambda1))))
R)
(if (<= lambda2 4.5e+217)
(* (acos (* (cos (- lambda1 lambda2)) (cos phi2))) R)
(*
(acos (* (fma 0.0 0.5 (* (cos lambda1) (cos lambda2))) (cos phi1)))
R))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 8e-6) {
tmp = acos(fma(sin(phi2), sin(phi1), ((cos(phi1) * cos(phi2)) * cos(lambda1)))) * R;
} else if (lambda2 <= 4.5e+217) {
tmp = acos((cos((lambda1 - lambda2)) * cos(phi2))) * R;
} else {
tmp = acos((fma(0.0, 0.5, (cos(lambda1) * cos(lambda2))) * cos(phi1))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 8e-6) tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda1)))) * R); elseif (lambda2 <= 4.5e+217) tmp = Float64(acos(Float64(cos(Float64(lambda1 - lambda2)) * cos(phi2))) * R); else tmp = Float64(acos(Float64(fma(0.0, 0.5, Float64(cos(lambda1) * cos(lambda2))) * cos(phi1))) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 8e-6], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[lambda2, 4.5e+217], N[(N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[(0.0 * 0.5 + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 8 \cdot 10^{-6}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_1\right)\right) \cdot R\\
\mathbf{elif}\;\lambda_2 \leq 4.5 \cdot 10^{+217}:\\
\;\;\;\;\cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(0, 0.5, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\end{array}
\end{array}
if lambda2 < 7.99999999999999964e-6Initial program 77.9%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6468.1
Applied rewrites68.1%
Applied rewrites68.2%
if 7.99999999999999964e-6 < lambda2 < 4.49999999999999988e217Initial program 58.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6434.3
Applied rewrites34.3%
if 4.49999999999999988e217 < lambda2 Initial program 60.9%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6448.2
Applied rewrites48.2%
Applied rewrites49.0%
Taylor expanded in lambda2 around 0
Applied rewrites49.1%
Final simplification61.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))))
(if (<= phi1 -9500.0)
(* (acos (* (fma 0.0 0.5 (* (cos lambda1) (cos lambda2))) (cos phi1))) R)
(if (<= phi1 0.102)
(*
(acos
(+
(* (* (sin phi2) phi1) (fma (* -0.16666666666666666 phi1) phi1 1.0))
(* (cos (- lambda1 lambda2)) t_0)))
R)
(* (acos (fma (sin phi2) (sin phi1) t_0)) R)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double tmp;
if (phi1 <= -9500.0) {
tmp = acos((fma(0.0, 0.5, (cos(lambda1) * cos(lambda2))) * cos(phi1))) * R;
} else if (phi1 <= 0.102) {
tmp = acos((((sin(phi2) * phi1) * fma((-0.16666666666666666 * phi1), phi1, 1.0)) + (cos((lambda1 - lambda2)) * t_0))) * R;
} else {
tmp = acos(fma(sin(phi2), sin(phi1), t_0)) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (phi1 <= -9500.0) tmp = Float64(acos(Float64(fma(0.0, 0.5, Float64(cos(lambda1) * cos(lambda2))) * cos(phi1))) * R); elseif (phi1 <= 0.102) tmp = Float64(acos(Float64(Float64(Float64(sin(phi2) * phi1) * fma(Float64(-0.16666666666666666 * phi1), phi1, 1.0)) + Float64(cos(Float64(lambda1 - lambda2)) * t_0))) * R); else tmp = Float64(acos(fma(sin(phi2), sin(phi1), t_0)) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -9500.0], N[(N[ArcCos[N[(N[(0.0 * 0.5 + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi1, 0.102], N[(N[ArcCos[N[(N[(N[(N[Sin[phi2], $MachinePrecision] * phi1), $MachinePrecision] * N[(N[(-0.16666666666666666 * phi1), $MachinePrecision] * phi1 + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\phi_1 \leq -9500:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(0, 0.5, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{elif}\;\phi_1 \leq 0.102:\\
\;\;\;\;\cos^{-1} \left(\left(\sin \phi_2 \cdot \phi_1\right) \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot \phi_1, \phi_1, 1\right) + \cos \left(\lambda_1 - \lambda_2\right) \cdot t\_0\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, t\_0\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -9500Initial program 78.9%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6448.2
Applied rewrites48.2%
Applied rewrites48.5%
Taylor expanded in lambda2 around 0
Applied rewrites48.6%
if -9500 < phi1 < 0.101999999999999993Initial program 67.8%
Taylor expanded in phi1 around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft1-inN/A
lower-*.f64N/A
Applied rewrites67.0%
if 0.101999999999999993 < phi1 Initial program 80.7%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6462.1
Applied rewrites62.1%
Taylor expanded in lambda1 around 0
Applied rewrites38.9%
Final simplification54.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -0.015)
(* (acos (* (fma 0.0 0.5 (* (cos lambda1) (cos lambda2))) (cos phi1))) R)
(if (<= phi1 0.031)
(*
(acos
(fma
(fma (* -0.5 phi1) phi1 1.0)
(* (cos (- lambda1 lambda2)) (cos phi2))
(* (* (sin phi2) phi1) (fma (* -0.16666666666666666 phi1) phi1 1.0))))
R)
(* (acos (fma (sin phi2) (sin phi1) (* (cos phi1) (cos phi2)))) R))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.015) {
tmp = acos((fma(0.0, 0.5, (cos(lambda1) * cos(lambda2))) * cos(phi1))) * R;
} else if (phi1 <= 0.031) {
tmp = acos(fma(fma((-0.5 * phi1), phi1, 1.0), (cos((lambda1 - lambda2)) * cos(phi2)), ((sin(phi2) * phi1) * fma((-0.16666666666666666 * phi1), phi1, 1.0)))) * R;
} else {
tmp = acos(fma(sin(phi2), sin(phi1), (cos(phi1) * cos(phi2)))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.015) tmp = Float64(acos(Float64(fma(0.0, 0.5, Float64(cos(lambda1) * cos(lambda2))) * cos(phi1))) * R); elseif (phi1 <= 0.031) tmp = Float64(acos(fma(fma(Float64(-0.5 * phi1), phi1, 1.0), Float64(cos(Float64(lambda1 - lambda2)) * cos(phi2)), Float64(Float64(sin(phi2) * phi1) * fma(Float64(-0.16666666666666666 * phi1), phi1, 1.0)))) * R); else tmp = Float64(acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * cos(phi2)))) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.015], N[(N[ArcCos[N[(N[(0.0 * 0.5 + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi1, 0.031], N[(N[ArcCos[N[(N[(N[(-0.5 * phi1), $MachinePrecision] * phi1 + 1.0), $MachinePrecision] * N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Sin[phi2], $MachinePrecision] * phi1), $MachinePrecision] * N[(N[(-0.16666666666666666 * phi1), $MachinePrecision] * phi1 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.015:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(0, 0.5, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{elif}\;\phi_1 \leq 0.031:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\mathsf{fma}\left(-0.5 \cdot \phi_1, \phi_1, 1\right), \cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_2, \left(\sin \phi_2 \cdot \phi_1\right) \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot \phi_1, \phi_1, 1\right)\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot \cos \phi_2\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -0.014999999999999999Initial program 79.2%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6447.8
Applied rewrites47.8%
Applied rewrites48.1%
Taylor expanded in lambda2 around 0
Applied rewrites48.2%
if -0.014999999999999999 < phi1 < 0.031Initial program 67.5%
Taylor expanded in phi1 around 0
Applied rewrites67.5%
if 0.031 < phi1 Initial program 80.7%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6462.1
Applied rewrites62.1%
Taylor expanded in lambda1 around 0
Applied rewrites38.9%
Final simplification55.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 5.9e-12) (* (acos (* (fma 0.0 0.5 (* (cos lambda1) (cos lambda2))) (cos phi1))) R) (* (acos (* (cos (- lambda1 lambda2)) (cos phi2))) R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.9e-12) {
tmp = acos((fma(0.0, 0.5, (cos(lambda1) * cos(lambda2))) * cos(phi1))) * R;
} else {
tmp = acos((cos((lambda1 - lambda2)) * cos(phi2))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 5.9e-12) tmp = Float64(acos(Float64(fma(0.0, 0.5, Float64(cos(lambda1) * cos(lambda2))) * cos(phi1))) * R); else tmp = Float64(acos(Float64(cos(Float64(lambda1 - lambda2)) * cos(phi2))) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5.9e-12], N[(N[ArcCos[N[(N[(0.0 * 0.5 + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 5.9 \cdot 10^{-12}:\\
\;\;\;\;\cos^{-1} \left(\mathsf{fma}\left(0, 0.5, \cos \lambda_1 \cdot \cos \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 5.9e-12Initial program 73.5%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6450.6
Applied rewrites50.6%
Applied rewrites50.9%
Taylor expanded in lambda2 around 0
Applied rewrites50.9%
if 5.9e-12 < phi2 Initial program 75.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6450.1
Applied rewrites50.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi2 5.9e-12)
(* (acos (* t_0 (cos phi1))) R)
(* (acos (* t_0 (cos phi2))) R))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double tmp;
if (phi2 <= 5.9e-12) {
tmp = acos((t_0 * cos(phi1))) * R;
} else {
tmp = acos((t_0 * cos(phi2))) * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda1 - lambda2))
if (phi2 <= 5.9d-12) then
tmp = acos((t_0 * cos(phi1))) * r
else
tmp = acos((t_0 * cos(phi2))) * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda1 - lambda2));
double tmp;
if (phi2 <= 5.9e-12) {
tmp = Math.acos((t_0 * Math.cos(phi1))) * R;
} else {
tmp = Math.acos((t_0 * Math.cos(phi2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) tmp = 0 if phi2 <= 5.9e-12: tmp = math.acos((t_0 * math.cos(phi1))) * R else: tmp = math.acos((t_0 * math.cos(phi2))) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= 5.9e-12) tmp = Float64(acos(Float64(t_0 * cos(phi1))) * R); else tmp = Float64(acos(Float64(t_0 * cos(phi2))) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda1 - lambda2));
tmp = 0.0;
if (phi2 <= 5.9e-12)
tmp = acos((t_0 * cos(phi1))) * R;
else
tmp = acos((t_0 * cos(phi2))) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 5.9e-12], N[(N[ArcCos[N[(t$95$0 * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(t$95$0 * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq 5.9 \cdot 10^{-12}:\\
\;\;\;\;\cos^{-1} \left(t\_0 \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(t\_0 \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 5.9e-12Initial program 73.5%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6450.6
Applied rewrites50.6%
if 5.9e-12 < phi2 Initial program 75.5%
Taylor expanded in phi1 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6450.1
Applied rewrites50.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 0.0125) (* (acos (* (cos (- lambda1 lambda2)) (cos phi1))) R) (* (acos (* (cos lambda1) (cos phi2))) R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.0125) {
tmp = acos((cos((lambda1 - lambda2)) * cos(phi1))) * R;
} else {
tmp = acos((cos(lambda1) * cos(phi2))) * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 0.0125d0) then
tmp = acos((cos((lambda1 - lambda2)) * cos(phi1))) * r
else
tmp = acos((cos(lambda1) * cos(phi2))) * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.0125) {
tmp = Math.acos((Math.cos((lambda1 - lambda2)) * Math.cos(phi1))) * R;
} else {
tmp = Math.acos((Math.cos(lambda1) * Math.cos(phi2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.0125: tmp = math.acos((math.cos((lambda1 - lambda2)) * math.cos(phi1))) * R else: tmp = math.acos((math.cos(lambda1) * math.cos(phi2))) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.0125) tmp = Float64(acos(Float64(cos(Float64(lambda1 - lambda2)) * cos(phi1))) * R); else tmp = Float64(acos(Float64(cos(lambda1) * cos(phi2))) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 0.0125)
tmp = acos((cos((lambda1 - lambda2)) * cos(phi1))) * R;
else
tmp = acos((cos(lambda1) * cos(phi2))) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.0125], N[(N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.0125:\\
\;\;\;\;\cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\cos \lambda_1 \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 0.012500000000000001Initial program 73.5%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6450.6
Applied rewrites50.6%
if 0.012500000000000001 < phi2 Initial program 75.5%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6461.5
Applied rewrites61.5%
Taylor expanded in phi1 around 0
Applied rewrites41.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -9.2e-52) (* (acos (* (cos lambda2) (cos phi1))) R) (* (acos (* (cos lambda1) (cos phi2))) R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -9.2e-52) {
tmp = acos((cos(lambda2) * cos(phi1))) * R;
} else {
tmp = acos((cos(lambda1) * cos(phi2))) * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-9.2d-52)) then
tmp = acos((cos(lambda2) * cos(phi1))) * r
else
tmp = acos((cos(lambda1) * cos(phi2))) * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -9.2e-52) {
tmp = Math.acos((Math.cos(lambda2) * Math.cos(phi1))) * R;
} else {
tmp = Math.acos((Math.cos(lambda1) * Math.cos(phi2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -9.2e-52: tmp = math.acos((math.cos(lambda2) * math.cos(phi1))) * R else: tmp = math.acos((math.cos(lambda1) * math.cos(phi2))) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -9.2e-52) tmp = Float64(acos(Float64(cos(lambda2) * cos(phi1))) * R); else tmp = Float64(acos(Float64(cos(lambda1) * cos(phi2))) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -9.2e-52)
tmp = acos((cos(lambda2) * cos(phi1))) * R;
else
tmp = acos((cos(lambda1) * cos(phi2))) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -9.2e-52], N[(N[ArcCos[N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -9.2 \cdot 10^{-52}:\\
\;\;\;\;\cos^{-1} \left(\cos \lambda_2 \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\cos \lambda_1 \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -9.19999999999999977e-52Initial program 79.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6448.2
Applied rewrites48.2%
Taylor expanded in lambda1 around 0
Applied rewrites35.5%
if -9.19999999999999977e-52 < phi1 Initial program 72.2%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6456.7
Applied rewrites56.7%
Taylor expanded in phi1 around 0
Applied rewrites40.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 5.9e-12) (* (acos (* (cos lambda1) (cos phi1))) R) (* (acos (* (cos lambda1) (cos phi2))) R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.9e-12) {
tmp = acos((cos(lambda1) * cos(phi1))) * R;
} else {
tmp = acos((cos(lambda1) * cos(phi2))) * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 5.9d-12) then
tmp = acos((cos(lambda1) * cos(phi1))) * r
else
tmp = acos((cos(lambda1) * cos(phi2))) * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.9e-12) {
tmp = Math.acos((Math.cos(lambda1) * Math.cos(phi1))) * R;
} else {
tmp = Math.acos((Math.cos(lambda1) * Math.cos(phi2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 5.9e-12: tmp = math.acos((math.cos(lambda1) * math.cos(phi1))) * R else: tmp = math.acos((math.cos(lambda1) * math.cos(phi2))) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 5.9e-12) tmp = Float64(acos(Float64(cos(lambda1) * cos(phi1))) * R); else tmp = Float64(acos(Float64(cos(lambda1) * cos(phi2))) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 5.9e-12)
tmp = acos((cos(lambda1) * cos(phi1))) * R;
else
tmp = acos((cos(lambda1) * cos(phi2))) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5.9e-12], N[(N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 5.9 \cdot 10^{-12}:\\
\;\;\;\;\cos^{-1} \left(\cos \lambda_1 \cdot \cos \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\cos \lambda_1 \cdot \cos \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 5.9e-12Initial program 73.5%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6450.6
Applied rewrites50.6%
Taylor expanded in lambda2 around 0
Applied rewrites38.3%
if 5.9e-12 < phi2 Initial program 75.5%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6461.5
Applied rewrites61.5%
Taylor expanded in phi1 around 0
Applied rewrites41.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 6e-7) (* (acos (* (cos lambda1) (cos phi2))) R) (* (acos (cos (- lambda1 lambda2))) R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 6e-7) {
tmp = acos((cos(lambda1) * cos(phi2))) * R;
} else {
tmp = acos(cos((lambda1 - lambda2))) * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 6d-7) then
tmp = acos((cos(lambda1) * cos(phi2))) * r
else
tmp = acos(cos((lambda1 - lambda2))) * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 6e-7) {
tmp = Math.acos((Math.cos(lambda1) * Math.cos(phi2))) * R;
} else {
tmp = Math.acos(Math.cos((lambda1 - lambda2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 6e-7: tmp = math.acos((math.cos(lambda1) * math.cos(phi2))) * R else: tmp = math.acos(math.cos((lambda1 - lambda2))) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 6e-7) tmp = Float64(acos(Float64(cos(lambda1) * cos(phi2))) * R); else tmp = Float64(acos(cos(Float64(lambda1 - lambda2))) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 6e-7)
tmp = acos((cos(lambda1) * cos(phi2))) * R;
else
tmp = acos(cos((lambda1 - lambda2))) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 6e-7], N[(N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 6 \cdot 10^{-7}:\\
\;\;\;\;\cos^{-1} \left(\cos \lambda_1 \cdot \cos \phi_2\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \cos \left(\lambda_1 - \lambda_2\right) \cdot R\\
\end{array}
\end{array}
if lambda2 < 5.9999999999999997e-7Initial program 77.9%
Taylor expanded in lambda2 around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
lower-cos.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-sin.f6468.1
Applied rewrites68.1%
Taylor expanded in phi1 around 0
Applied rewrites39.2%
if 5.9999999999999997e-7 < lambda2 Initial program 59.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6441.5
Applied rewrites41.5%
Taylor expanded in phi1 around 0
Applied rewrites24.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 2.2e-10) (* (acos (cos lambda1)) R) (* (acos (cos lambda2)) R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.2e-10) {
tmp = acos(cos(lambda1)) * R;
} else {
tmp = acos(cos(lambda2)) * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 2.2d-10) then
tmp = acos(cos(lambda1)) * r
else
tmp = acos(cos(lambda2)) * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.2e-10) {
tmp = Math.acos(Math.cos(lambda1)) * R;
} else {
tmp = Math.acos(Math.cos(lambda2)) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 2.2e-10: tmp = math.acos(math.cos(lambda1)) * R else: tmp = math.acos(math.cos(lambda2)) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2.2e-10) tmp = Float64(acos(cos(lambda1)) * R); else tmp = Float64(acos(cos(lambda2)) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 2.2e-10)
tmp = acos(cos(lambda1)) * R;
else
tmp = acos(cos(lambda2)) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2.2e-10], N[(N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], N[(N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2.2 \cdot 10^{-10}:\\
\;\;\;\;\cos^{-1} \cos \lambda_1 \cdot R\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \cos \lambda_2 \cdot R\\
\end{array}
\end{array}
if lambda2 < 2.1999999999999999e-10Initial program 77.8%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6442.3
Applied rewrites42.3%
Taylor expanded in phi1 around 0
Applied rewrites24.5%
Taylor expanded in lambda2 around 0
Applied rewrites21.1%
if 2.1999999999999999e-10 < lambda2 Initial program 59.7%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6441.2
Applied rewrites41.2%
Taylor expanded in phi1 around 0
Applied rewrites24.2%
Taylor expanded in lambda1 around 0
Applied rewrites24.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* (acos (cos (- lambda1 lambda2))) R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(cos((lambda1 - lambda2))) * R;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(cos((lambda1 - lambda2))) * r
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(Math.cos((lambda1 - lambda2))) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return math.acos(math.cos((lambda1 - lambda2))) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(cos(Float64(lambda1 - lambda2))) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = acos(cos((lambda1 - lambda2))) * R;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\cos^{-1} \cos \left(\lambda_1 - \lambda_2\right) \cdot R
\end{array}
Initial program 74.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6442.1
Applied rewrites42.1%
Taylor expanded in phi1 around 0
Applied rewrites24.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* (acos (cos lambda1)) R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(cos(lambda1)) * R;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(cos(lambda1)) * r
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(Math.cos(lambda1)) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return math.acos(math.cos(lambda1)) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(cos(lambda1)) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = acos(cos(lambda1)) * R;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\cos^{-1} \cos \lambda_1 \cdot R
\end{array}
Initial program 74.0%
Taylor expanded in phi2 around 0
*-commutativeN/A
lower-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
lower-cos.f64N/A
+-commutativeN/A
distribute-neg-inN/A
mul-1-negN/A
remove-double-negN/A
sub-negN/A
lower--.f64N/A
lower-cos.f6442.1
Applied rewrites42.1%
Taylor expanded in phi1 around 0
Applied rewrites24.4%
Taylor expanded in lambda2 around 0
Applied rewrites19.1%
herbie shell --seed 2024255
(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))