
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 27 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}
def code(R, lambda1, lambda2, phi1, phi2): return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
function code(R, lambda1, lambda2, phi1, phi2) return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
\\
\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (cos phi1) (cos phi2))))
(if (<= (acos (+ t_0 (* t_1 (cos (- lambda1 lambda2))))) 2e-6)
(* (- lambda2 lambda1) R)
(*
R
(acos
(+
t_0
(*
t_1
(fma
(sin lambda2)
(sin lambda1)
(* (cos lambda1) (cos lambda2))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = cos(phi1) * cos(phi2);
double tmp;
if (acos((t_0 + (t_1 * cos((lambda1 - lambda2))))) <= 2e-6) {
tmp = (lambda2 - lambda1) * R;
} else {
tmp = R * acos((t_0 + (t_1 * fma(sin(lambda2), sin(lambda1), (cos(lambda1) * cos(lambda2))))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(cos(phi1) * cos(phi2)) tmp = 0.0 if (acos(Float64(t_0 + Float64(t_1 * cos(Float64(lambda1 - lambda2))))) <= 2e-6) tmp = Float64(Float64(lambda2 - lambda1) * R); else tmp = Float64(R * acos(Float64(t_0 + Float64(t_1 * fma(sin(lambda2), sin(lambda1), Float64(cos(lambda1) * cos(lambda2))))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[ArcCos[N[(t$95$0 + N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2e-6], N[(N[(lambda2 - lambda1), $MachinePrecision] * R), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(t$95$1 * N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \cos \phi_1 \cdot \cos \phi_2\\
\mathbf{if}\;\cos^{-1} \left(t\_0 + t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \leq 2 \cdot 10^{-6}:\\
\;\;\;\;\left(\lambda_2 - \lambda_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_0 + t\_1 \cdot \mathsf{fma}\left(\sin \lambda_2, \sin \lambda_1, \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\\
\end{array}
\end{array}
if (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) < 1.99999999999999991e-6Initial program 6.4%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f646.4
Simplified6.4%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f646.4
Simplified6.4%
cos-diffN/A
*-commutativeN/A
*-commutativeN/A
cos-diffN/A
acos-cos-sN/A
--lowering--.f6444.4
Applied egg-rr44.4%
if 1.99999999999999991e-6 < (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) Initial program 74.7%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6499.1
Applied egg-rr99.1%
Final simplification95.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(if (<=
(acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
2e-6)
(* (- lambda2 lambda1) R)
(*
R
(acos
(fma
(*
(cos phi2)
(fma (sin lambda1) (sin lambda2) (* (cos lambda1) (cos lambda2))))
(cos phi1)
t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) <= 2e-6) {
tmp = (lambda2 - lambda1) * R;
} else {
tmp = R * acos(fma((cos(phi2) * fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2)))), cos(phi1), t_0));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) <= 2e-6) tmp = Float64(Float64(lambda2 - lambda1) * R); else tmp = Float64(R * acos(fma(Float64(cos(phi2) * fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2)))), cos(phi1), t_0))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2e-6], N[(N[(lambda2 - lambda1), $MachinePrecision] * R), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[phi1], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\cos^{-1} \left(t\_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \leq 2 \cdot 10^{-6}:\\
\;\;\;\;\left(\lambda_2 - \lambda_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2 \cdot \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right), \cos \phi_1, t\_0\right)\right)\\
\end{array}
\end{array}
if (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) < 1.99999999999999991e-6Initial program 6.4%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f646.4
Simplified6.4%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f646.4
Simplified6.4%
cos-diffN/A
*-commutativeN/A
*-commutativeN/A
cos-diffN/A
acos-cos-sN/A
--lowering--.f6444.4
Applied egg-rr44.4%
if 1.99999999999999991e-6 < (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) Initial program 74.7%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6499.1
Applied egg-rr99.1%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6499.1
Simplified99.1%
Final simplification95.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 (cos (- lambda1 lambda2)))
(t_1 (cos (+ lambda1 lambda2)))
(t_2 (* (sin phi1) (sin phi2))))
(if (<= phi2 -9e-7)
(*
R
(acos (+ t_2 (* (* (cos phi1) (cos phi2)) (* (* t_0 t_1) (/ 1.0 t_1))))))
(if (<= phi2 1.36e-9)
(*
R
(acos
(fma
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda2) (sin lambda1)))
(* (sin phi1) phi2))))
(*
R
(fma
(cbrt (* PI PI))
(* (cbrt (* (sqrt PI) (sqrt PI))) 0.5)
(- (asin (fma (cos phi1) (* (cos phi2) t_0) t_2)))))))))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 t_1 = cos((lambda1 + lambda2));
double t_2 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -9e-7) {
tmp = R * acos((t_2 + ((cos(phi1) * cos(phi2)) * ((t_0 * t_1) * (1.0 / t_1)))));
} else if (phi2 <= 1.36e-9) {
tmp = R * acos(fma(cos(phi1), fma(cos(lambda1), cos(lambda2), (sin(lambda2) * sin(lambda1))), (sin(phi1) * phi2)));
} else {
tmp = R * fma(cbrt((((double) M_PI) * ((double) M_PI))), (cbrt((sqrt(((double) M_PI)) * sqrt(((double) M_PI)))) * 0.5), -asin(fma(cos(phi1), (cos(phi2) * t_0), t_2)));
}
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)) t_1 = cos(Float64(lambda1 + lambda2)) t_2 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -9e-7) tmp = Float64(R * acos(Float64(t_2 + Float64(Float64(cos(phi1) * cos(phi2)) * Float64(Float64(t_0 * t_1) * Float64(1.0 / t_1)))))); elseif (phi2 <= 1.36e-9) tmp = Float64(R * acos(fma(cos(phi1), fma(cos(lambda1), cos(lambda2), Float64(sin(lambda2) * sin(lambda1))), Float64(sin(phi1) * phi2)))); else tmp = Float64(R * fma(cbrt(Float64(pi * pi)), Float64(cbrt(Float64(sqrt(pi) * sqrt(pi))) * 0.5), Float64(-asin(fma(cos(phi1), Float64(cos(phi2) * t_0), t_2))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(lambda1 + lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -9e-7], N[(R * N[ArcCos[N[(t$95$2 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 * t$95$1), $MachinePrecision] * N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.36e-9], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(N[Power[N[(Pi * Pi), $MachinePrecision], 1/3], $MachinePrecision] * N[(N[Power[N[(N[Sqrt[Pi], $MachinePrecision] * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] * 0.5), $MachinePrecision] + (-N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] + t$95$2), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \cos \left(\lambda_1 + \lambda_2\right)\\
t_2 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -9 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \left(\left(t\_0 \cdot t\_1\right) \cdot \frac{1}{t\_1}\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.36 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_2 \cdot \sin \lambda_1\right), \sin \phi_1 \cdot \phi_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\sqrt[3]{\pi \cdot \pi}, \sqrt[3]{\sqrt{\pi} \cdot \sqrt{\pi}} \cdot 0.5, -\sin^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot t\_0, t\_2\right)\right)\right)\\
\end{array}
\end{array}
if phi2 < -8.99999999999999959e-7Initial program 76.3%
cos-diffN/A
flip-+N/A
cos-sumN/A
div-invN/A
*-lowering-*.f64N/A
Applied egg-rr76.3%
if -8.99999999999999959e-7 < phi2 < 1.36000000000000006e-9Initial program 62.5%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.7
Applied egg-rr86.7%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.7
Simplified86.7%
Taylor expanded in phi2 around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f6486.7
Simplified86.7%
if 1.36000000000000006e-9 < phi2 Initial program 78.9%
acos-asinN/A
sub-negN/A
div-invN/A
add-cube-cbrtN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr78.4%
add-sqr-sqrtN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
PI-lowering-PI.f6479.0
Applied egg-rr79.0%
Final simplification81.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2)))
(t_1 (cos (+ lambda1 lambda2)))
(t_2 (* (sin phi1) (sin phi2))))
(if (<= phi2 -2.8e-6)
(*
R
(acos (+ t_2 (* (* (cos phi1) (cos phi2)) (* (* t_0 t_1) (/ 1.0 t_1))))))
(if (<= phi2 3.6e-6)
(*
R
(acos
(fma
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda2) (sin lambda1)))
(* (sin phi1) phi2))))
(fma
(* PI 0.5)
R
(* (asin (fma (cos phi1) (* (cos phi2) t_0) t_2)) (- 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 t_1 = cos((lambda1 + lambda2));
double t_2 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -2.8e-6) {
tmp = R * acos((t_2 + ((cos(phi1) * cos(phi2)) * ((t_0 * t_1) * (1.0 / t_1)))));
} else if (phi2 <= 3.6e-6) {
tmp = R * acos(fma(cos(phi1), fma(cos(lambda1), cos(lambda2), (sin(lambda2) * sin(lambda1))), (sin(phi1) * phi2)));
} else {
tmp = fma((((double) M_PI) * 0.5), R, (asin(fma(cos(phi1), (cos(phi2) * t_0), t_2)) * -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)) t_1 = cos(Float64(lambda1 + lambda2)) t_2 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -2.8e-6) tmp = Float64(R * acos(Float64(t_2 + Float64(Float64(cos(phi1) * cos(phi2)) * Float64(Float64(t_0 * t_1) * Float64(1.0 / t_1)))))); elseif (phi2 <= 3.6e-6) tmp = Float64(R * acos(fma(cos(phi1), fma(cos(lambda1), cos(lambda2), Float64(sin(lambda2) * sin(lambda1))), Float64(sin(phi1) * phi2)))); else tmp = fma(Float64(pi * 0.5), R, Float64(asin(fma(cos(phi1), Float64(cos(phi2) * t_0), t_2)) * Float64(-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[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(lambda1 + lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -2.8e-6], N[(R * N[ArcCos[N[(t$95$2 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 * t$95$1), $MachinePrecision] * N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3.6e-6], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(Pi * 0.5), $MachinePrecision] * R + N[(N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] + t$95$2), $MachinePrecision]], $MachinePrecision] * (-R)), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \cos \left(\lambda_1 + \lambda_2\right)\\
t_2 := \sin \phi_1 \cdot \sin \phi_2\\
\mathbf{if}\;\phi_2 \leq -2.8 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(t\_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \left(\left(t\_0 \cdot t\_1\right) \cdot \frac{1}{t\_1}\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 3.6 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_2 \cdot \sin \lambda_1\right), \sin \phi_1 \cdot \phi_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\pi \cdot 0.5, R, \sin^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot t\_0, t\_2\right)\right) \cdot \left(-R\right)\right)\\
\end{array}
\end{array}
if phi2 < -2.79999999999999987e-6Initial program 76.3%
cos-diffN/A
flip-+N/A
cos-sumN/A
div-invN/A
*-lowering-*.f64N/A
Applied egg-rr76.3%
if -2.79999999999999987e-6 < phi2 < 3.59999999999999984e-6Initial program 62.8%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.8
Applied egg-rr86.8%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.8
Simplified86.8%
Taylor expanded in phi2 around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f6486.8
Simplified86.8%
if 3.59999999999999984e-6 < phi2 Initial program 78.6%
*-commutativeN/A
acos-asinN/A
sub-negN/A
distribute-rgt-inN/A
accelerator-lowering-fma.f64N/A
div-invN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr78.7%
Final simplification81.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi2) (cos (- lambda1 lambda2)))))
(if (<= phi2 -5.6e-7)
(* R (acos (fma (sin phi2) (sin phi1) (* (cos phi1) t_0))))
(if (<= phi2 5e-5)
(*
R
(acos
(fma
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda2) (sin lambda1)))
(* (sin phi1) phi2))))
(fma
(* PI 0.5)
R
(* (asin (fma (cos phi1) t_0 (* (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) {
double t_0 = cos(phi2) * cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -5.6e-7) {
tmp = R * acos(fma(sin(phi2), sin(phi1), (cos(phi1) * t_0)));
} else if (phi2 <= 5e-5) {
tmp = R * acos(fma(cos(phi1), fma(cos(lambda1), cos(lambda2), (sin(lambda2) * sin(lambda1))), (sin(phi1) * phi2)));
} else {
tmp = fma((((double) M_PI) * 0.5), R, (asin(fma(cos(phi1), t_0, (sin(phi1) * sin(phi2)))) * -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(phi2) * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi2 <= -5.6e-7) tmp = Float64(R * acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * t_0)))); elseif (phi2 <= 5e-5) tmp = Float64(R * acos(fma(cos(phi1), fma(cos(lambda1), cos(lambda2), Float64(sin(lambda2) * sin(lambda1))), Float64(sin(phi1) * phi2)))); else tmp = fma(Float64(pi * 0.5), R, Float64(asin(fma(cos(phi1), t_0, Float64(sin(phi1) * sin(phi2)))) * Float64(-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[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -5.6e-7], N[(R * N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 5e-5], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(Pi * 0.5), $MachinePrecision] * R + N[(N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * t$95$0 + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-R)), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -5.6 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 5 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_2 \cdot \sin \lambda_1\right), \sin \phi_1 \cdot \phi_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\pi \cdot 0.5, R, \sin^{-1} \left(\mathsf{fma}\left(\cos \phi_1, t\_0, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot \left(-R\right)\right)\\
\end{array}
\end{array}
if phi2 < -5.60000000000000038e-7Initial program 76.3%
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
--lowering--.f6476.3
Applied egg-rr76.3%
if -5.60000000000000038e-7 < phi2 < 5.00000000000000024e-5Initial program 62.8%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.8
Applied egg-rr86.8%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.8
Simplified86.8%
Taylor expanded in phi2 around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f6486.8
Simplified86.8%
if 5.00000000000000024e-5 < phi2 Initial program 78.6%
*-commutativeN/A
acos-asinN/A
sub-negN/A
distribute-rgt-inN/A
accelerator-lowering-fma.f64N/A
div-invN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr78.7%
Final simplification81.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi2) (cos (- lambda1 lambda2)))))
(if (<= phi2 -2.3e-6)
(* R (acos (fma (sin phi2) (sin phi1) (* (cos phi1) t_0))))
(if (<= phi2 2.5e-6)
(*
R
(acos
(fma
phi2
(sin phi1)
(*
(cos phi1)
(fma
(sin lambda1)
(sin lambda2)
(* (cos lambda1) (cos lambda2)))))))
(fma
(* PI 0.5)
R
(* (asin (fma (cos phi1) t_0 (* (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) {
double t_0 = cos(phi2) * cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -2.3e-6) {
tmp = R * acos(fma(sin(phi2), sin(phi1), (cos(phi1) * t_0)));
} else if (phi2 <= 2.5e-6) {
tmp = R * acos(fma(phi2, sin(phi1), (cos(phi1) * fma(sin(lambda1), sin(lambda2), (cos(lambda1) * cos(lambda2))))));
} else {
tmp = fma((((double) M_PI) * 0.5), R, (asin(fma(cos(phi1), t_0, (sin(phi1) * sin(phi2)))) * -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(phi2) * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi2 <= -2.3e-6) tmp = Float64(R * acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * t_0)))); elseif (phi2 <= 2.5e-6) tmp = Float64(R * acos(fma(phi2, sin(phi1), Float64(cos(phi1) * fma(sin(lambda1), sin(lambda2), Float64(cos(lambda1) * cos(lambda2))))))); else tmp = fma(Float64(pi * 0.5), R, Float64(asin(fma(cos(phi1), t_0, Float64(sin(phi1) * sin(phi2)))) * Float64(-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[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -2.3e-6], N[(R * N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2.5e-6], N[(R * N[ArcCos[N[(phi2 * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(Pi * 0.5), $MachinePrecision] * R + N[(N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * t$95$0 + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-R)), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -2.3 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 2.5 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\phi_2, \sin \phi_1, \cos \phi_1 \cdot \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_1 \cdot \cos \lambda_2\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\pi \cdot 0.5, R, \sin^{-1} \left(\mathsf{fma}\left(\cos \phi_1, t\_0, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot \left(-R\right)\right)\\
\end{array}
\end{array}
if phi2 < -2.3e-6Initial program 76.3%
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
--lowering--.f6476.3
Applied egg-rr76.3%
if -2.3e-6 < phi2 < 2.5000000000000002e-6Initial program 62.8%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.8
Applied egg-rr86.8%
Taylor expanded in phi2 around 0
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.8
Simplified86.8%
if 2.5000000000000002e-6 < phi2 Initial program 78.6%
*-commutativeN/A
acos-asinN/A
sub-negN/A
distribute-rgt-inN/A
accelerator-lowering-fma.f64N/A
div-invN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr78.7%
Final simplification81.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi2) (cos (- lambda1 lambda2)))))
(if (<= phi2 -7e-9)
(* R (acos (fma (sin phi2) (sin phi1) (* (cos phi1) t_0))))
(if (<= phi2 1.25e-8)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda2) (sin lambda1))))))
(fma
(* PI 0.5)
R
(* (asin (fma (cos phi1) t_0 (* (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) {
double t_0 = cos(phi2) * cos((lambda1 - lambda2));
double tmp;
if (phi2 <= -7e-9) {
tmp = R * acos(fma(sin(phi2), sin(phi1), (cos(phi1) * t_0)));
} else if (phi2 <= 1.25e-8) {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = fma((((double) M_PI) * 0.5), R, (asin(fma(cos(phi1), t_0, (sin(phi1) * sin(phi2)))) * -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(phi2) * cos(Float64(lambda1 - lambda2))) tmp = 0.0 if (phi2 <= -7e-9) tmp = Float64(R * acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * t_0)))); elseif (phi2 <= 1.25e-8) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = fma(Float64(pi * 0.5), R, Float64(asin(fma(cos(phi1), t_0, Float64(sin(phi1) * sin(phi2)))) * Float64(-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[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -7e-9], N[(R * N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.25e-8], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(Pi * 0.5), $MachinePrecision] * R + N[(N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * t$95$0 + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-R)), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq -7 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot t\_0\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.25 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\pi \cdot 0.5, R, \sin^{-1} \left(\mathsf{fma}\left(\cos \phi_1, t\_0, \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot \left(-R\right)\right)\\
\end{array}
\end{array}
if phi2 < -6.9999999999999998e-9Initial program 76.3%
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
--lowering--.f6476.3
Applied egg-rr76.3%
if -6.9999999999999998e-9 < phi2 < 1.2499999999999999e-8Initial program 62.8%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.8
Applied egg-rr86.8%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.8
Simplified86.8%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.7
Simplified86.7%
if 1.2499999999999999e-8 < phi2 Initial program 78.6%
*-commutativeN/A
acos-asinN/A
sub-negN/A
distribute-rgt-inN/A
accelerator-lowering-fma.f64N/A
div-invN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr78.7%
Final simplification81.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))) (t_1 (* (sin lambda2) (sin lambda1))))
(if (<= phi1 -9.8e+203)
(* R (acos (fma (cos phi2) (* (cos phi1) (cos lambda2)) t_0)))
(if (<= phi1 -2.35e-6)
(* R (acos (* (cos phi1) (fma (cos lambda1) (cos lambda2) t_1))))
(if (<= phi1 1.26e-5)
(* R (acos (* (cos phi2) (fma (cos lambda2) (cos lambda1) t_1))))
(* R (acos (fma (cos phi2) (* (cos phi1) (cos lambda1)) t_0))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double t_1 = sin(lambda2) * sin(lambda1);
double tmp;
if (phi1 <= -9.8e+203) {
tmp = R * acos(fma(cos(phi2), (cos(phi1) * cos(lambda2)), t_0));
} else if (phi1 <= -2.35e-6) {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), t_1)));
} else if (phi1 <= 1.26e-5) {
tmp = R * acos((cos(phi2) * fma(cos(lambda2), cos(lambda1), t_1)));
} else {
tmp = R * acos(fma(cos(phi2), (cos(phi1) * cos(lambda1)), t_0));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) t_1 = Float64(sin(lambda2) * sin(lambda1)) tmp = 0.0 if (phi1 <= -9.8e+203) tmp = Float64(R * acos(fma(cos(phi2), Float64(cos(phi1) * cos(lambda2)), t_0))); elseif (phi1 <= -2.35e-6) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), t_1)))); elseif (phi1 <= 1.26e-5) tmp = Float64(R * acos(Float64(cos(phi2) * fma(cos(lambda2), cos(lambda1), t_1)))); else tmp = Float64(R * acos(fma(cos(phi2), Float64(cos(phi1) * cos(lambda1)), t_0))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -9.8e+203], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -2.35e-6], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.26e-5], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
t_1 := \sin \lambda_2 \cdot \sin \lambda_1\\
\mathbf{if}\;\phi_1 \leq -9.8 \cdot 10^{+203}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1 \cdot \cos \lambda_2, t\_0\right)\right)\\
\mathbf{elif}\;\phi_1 \leq -2.35 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, t\_1\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 1.26 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, t\_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1 \cdot \cos \lambda_1, t\_0\right)\right)\\
\end{array}
\end{array}
if phi1 < -9.7999999999999995e203Initial program 75.4%
Taylor expanded in lambda1 around 0
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6456.5
Simplified56.5%
if -9.7999999999999995e203 < phi1 < -2.34999999999999995e-6Initial program 74.1%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6498.8
Applied egg-rr98.8%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6498.8
Simplified98.8%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6459.7
Simplified59.7%
if -2.34999999999999995e-6 < phi1 < 1.25999999999999996e-5Initial program 62.5%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6462.4
Simplified62.4%
cos-diffN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.9
Applied egg-rr86.9%
if 1.25999999999999996e-5 < phi1 Initial program 83.1%
Taylor expanded in lambda2 around 0
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6456.3
Simplified56.3%
Final simplification72.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= phi2 -2.6e-9)
(* R (acos (fma (sin phi2) (sin phi1) (* (cos phi1) (* (cos phi2) t_0)))))
(if (<= phi2 2.8e-10)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda2) (sin lambda1))))))
(*
(acos (+ (* (sin phi1) (sin phi2)) (* (* (cos phi1) (cos phi2)) 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((lambda1 - lambda2));
double tmp;
if (phi2 <= -2.6e-9) {
tmp = R * acos(fma(sin(phi2), sin(phi1), (cos(phi1) * (cos(phi2) * t_0))));
} else if (phi2 <= 2.8e-10) {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * 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 = cos(Float64(lambda1 - lambda2)) tmp = 0.0 if (phi2 <= -2.6e-9) tmp = Float64(R * acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * Float64(cos(phi2) * t_0))))); elseif (phi2 <= 2.8e-10) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * 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[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -2.6e-9], N[(R * N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2.8e-10], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 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] * t$95$0), $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 -2.6 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t\_0\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 2.8 \cdot 10^{-10}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot t\_0\right) \cdot R\\
\end{array}
\end{array}
if phi2 < -2.6000000000000001e-9Initial program 76.3%
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
--lowering--.f6476.3
Applied egg-rr76.3%
if -2.6000000000000001e-9 < phi2 < 2.80000000000000015e-10Initial program 62.5%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.7
Applied egg-rr86.7%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.7
Simplified86.7%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.6
Simplified86.6%
if 2.80000000000000015e-10 < phi2 Initial program 78.9%
Final simplification81.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 -6.3e-9)
(*
R
(acos
(fma
(sin phi2)
(sin phi1)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))
(if (<= phi2 9.1e-10)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda2) (sin lambda1))))))
(*
R
(acos
(fma
(sin phi2)
(sin phi1)
(* (cos phi2) (* (cos phi1) (cos (- lambda2 lambda1))))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -6.3e-9) {
tmp = R * acos(fma(sin(phi2), sin(phi1), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))));
} else if (phi2 <= 9.1e-10) {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R * acos(fma(sin(phi2), sin(phi1), (cos(phi2) * (cos(phi1) * cos((lambda2 - lambda1))))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -6.3e-9) tmp = Float64(R * acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))); elseif (phi2 <= 9.1e-10) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R * acos(fma(sin(phi2), sin(phi1), Float64(cos(phi2) * Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -6.3e-9], N[(R * N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $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, 9.1e-10], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -6.3 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 9.1 \cdot 10^{-10}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\right)\\
\end{array}
\end{array}
if phi2 < -6.3000000000000002e-9Initial program 76.3%
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
--lowering--.f6476.3
Applied egg-rr76.3%
if -6.3000000000000002e-9 < phi2 < 9.0999999999999996e-10Initial program 62.5%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.7
Applied egg-rr86.7%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.7
Simplified86.7%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.6
Simplified86.6%
if 9.0999999999999996e-10 < phi2 Initial program 78.9%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6499.1
Applied egg-rr99.1%
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
*-commutativeN/A
cos-diffN/A
cos-lowering-cos.f64N/A
--lowering--.f6478.9
Applied egg-rr78.9%
Final simplification81.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
(*
R
(acos
(fma
(sin phi2)
(sin phi1)
(* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2)))))))))
(if (<= phi2 -2.8e-11)
t_0
(if (<= phi2 1.28e-9)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda2) (sin lambda1))))))
t_0))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * acos(fma(sin(phi2), sin(phi1), (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))));
double tmp;
if (phi2 <= -2.8e-11) {
tmp = t_0;
} else if (phi2 <= 1.28e-9) {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = t_0;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * acos(fma(sin(phi2), sin(phi1), Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))))) tmp = 0.0 if (phi2 <= -2.8e-11) tmp = t_0; elseif (phi2 <= 1.28e-9) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), Float64(sin(lambda2) * sin(lambda1)))))); 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[(R * N[ArcCos[N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $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, -2.8e-11], t$95$0, If[LessEqual[phi2, 1.28e-9], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := R \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_2, \sin \phi_1, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\
\mathbf{if}\;\phi_2 \leq -2.8 \cdot 10^{-11}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 1.28 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi2 < -2.8e-11 or 1.27999999999999992e-9 < phi2 Initial program 77.5%
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
--lowering--.f6477.5
Applied egg-rr77.5%
if -2.8e-11 < phi2 < 1.27999999999999992e-9Initial program 62.5%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.7
Applied egg-rr86.7%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.7
Simplified86.7%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.6
Simplified86.6%
Final simplification81.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin lambda2) (sin lambda1))))
(if (<= phi1 -3e-6)
(* R (acos (* (cos phi1) (fma (cos lambda1) (cos lambda2) t_0))))
(if (<= phi1 1.3e-5)
(* R (acos (* (cos phi2) (fma (cos lambda2) (cos lambda1) t_0))))
(*
R
(acos
(fma
(cos phi2)
(* (cos phi1) (cos lambda1))
(* (sin phi1) (sin phi2)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(lambda2) * sin(lambda1);
double tmp;
if (phi1 <= -3e-6) {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), t_0)));
} else if (phi1 <= 1.3e-5) {
tmp = R * acos((cos(phi2) * fma(cos(lambda2), cos(lambda1), t_0)));
} else {
tmp = R * acos(fma(cos(phi2), (cos(phi1) * cos(lambda1)), (sin(phi1) * sin(phi2))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(lambda2) * sin(lambda1)) tmp = 0.0 if (phi1 <= -3e-6) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), t_0)))); elseif (phi1 <= 1.3e-5) tmp = Float64(R * acos(Float64(cos(phi2) * fma(cos(lambda2), cos(lambda1), t_0)))); else tmp = Float64(R * acos(fma(cos(phi2), Float64(cos(phi1) * cos(lambda1)), Float64(sin(phi1) * sin(phi2))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -3e-6], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.3e-5], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \lambda_2 \cdot \sin \lambda_1\\
\mathbf{if}\;\phi_1 \leq -3 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, t\_0\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 1.3 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1 \cdot \cos \lambda_1, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\end{array}
\end{array}
if phi1 < -3.0000000000000001e-6Initial program 74.5%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6499.0
Applied egg-rr99.0%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6499.0
Simplified99.0%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6456.2
Simplified56.2%
if -3.0000000000000001e-6 < phi1 < 1.29999999999999992e-5Initial program 62.5%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6462.4
Simplified62.4%
cos-diffN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.9
Applied egg-rr86.9%
if 1.29999999999999992e-5 < phi1 Initial program 83.1%
Taylor expanded in lambda2 around 0
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6456.3
Simplified56.3%
Final simplification71.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin lambda2) (sin lambda1))))
(if (<= phi2 -0.01)
(* R (acos (fma (cos phi2) (cos phi1) (* (sin phi1) (sin phi2)))))
(if (<= phi2 1.36e-9)
(* R (acos (* (cos phi1) (fma (cos lambda1) (cos lambda2) t_0))))
(* R (acos (* (cos phi2) (fma (cos lambda2) (cos lambda1) t_0))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(lambda2) * sin(lambda1);
double tmp;
if (phi2 <= -0.01) {
tmp = R * acos(fma(cos(phi2), cos(phi1), (sin(phi1) * sin(phi2))));
} else if (phi2 <= 1.36e-9) {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), t_0)));
} else {
tmp = R * acos((cos(phi2) * fma(cos(lambda2), cos(lambda1), t_0)));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(lambda2) * sin(lambda1)) tmp = 0.0 if (phi2 <= -0.01) tmp = Float64(R * acos(fma(cos(phi2), cos(phi1), Float64(sin(phi1) * sin(phi2))))); elseif (phi2 <= 1.36e-9) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), t_0)))); else tmp = Float64(R * acos(Float64(cos(phi2) * fma(cos(lambda2), cos(lambda1), t_0)))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.01], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.36e-9], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \lambda_2 \cdot \sin \lambda_1\\
\mathbf{if}\;\phi_2 \leq -0.01:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.36 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, t\_0\right)\right)\\
\end{array}
\end{array}
if phi2 < -0.0100000000000000002Initial program 76.8%
Taylor expanded in lambda2 around 0
cos-lowering-cos.f6463.1
Simplified63.1%
Taylor expanded in lambda1 around 0
*-commutativeN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6442.5
Simplified42.5%
if -0.0100000000000000002 < phi2 < 1.36000000000000006e-9Initial program 62.4%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.9
Applied egg-rr86.9%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.9
Simplified86.9%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.3
Simplified86.3%
if 1.36000000000000006e-9 < phi2 Initial program 78.9%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6445.8
Simplified45.8%
cos-diffN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6453.2
Applied egg-rr53.2%
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 (<= phi2 -0.058)
(* R (acos (fma (cos phi2) (cos phi1) (* (sin phi1) (sin phi2)))))
(if (<= phi2 1.36e-9)
(*
R
(acos
(*
(cos phi1)
(fma (cos lambda1) (cos lambda2) (* (sin lambda2) (sin lambda1))))))
(/ R (/ 1.0 (acos (* (cos phi2) (cos (- lambda2 lambda1)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -0.058) {
tmp = R * acos(fma(cos(phi2), cos(phi1), (sin(phi1) * sin(phi2))));
} else if (phi2 <= 1.36e-9) {
tmp = R * acos((cos(phi1) * fma(cos(lambda1), cos(lambda2), (sin(lambda2) * sin(lambda1)))));
} else {
tmp = R / (1.0 / acos((cos(phi2) * cos((lambda2 - lambda1)))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -0.058) tmp = Float64(R * acos(fma(cos(phi2), cos(phi1), Float64(sin(phi1) * sin(phi2))))); elseif (phi2 <= 1.36e-9) tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda1), cos(lambda2), Float64(sin(lambda2) * sin(lambda1)))))); else tmp = Float64(R / Float64(1.0 / acos(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1)))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -0.058], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.36e-9], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision] + N[(N[Sin[lambda2], $MachinePrecision] * N[Sin[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R / N[(1.0 / N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -0.058:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 1.36 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_1, \cos \lambda_2, \sin \lambda_2 \cdot \sin \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{R}{\frac{1}{\cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)}}\\
\end{array}
\end{array}
if phi2 < -0.0580000000000000029Initial program 76.8%
Taylor expanded in lambda2 around 0
cos-lowering-cos.f6463.1
Simplified63.1%
Taylor expanded in lambda1 around 0
*-commutativeN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6442.5
Simplified42.5%
if -0.0580000000000000029 < phi2 < 1.36000000000000006e-9Initial program 62.4%
cos-diffN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6486.9
Applied egg-rr86.9%
Taylor expanded in phi1 around inf
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.9
Simplified86.9%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6486.3
Simplified86.3%
if 1.36000000000000006e-9 < phi2 Initial program 78.9%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6445.8
Simplified45.8%
cos-diffN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6453.2
Applied egg-rr53.2%
*-commutativeN/A
acos-asinN/A
div-invN/A
metadata-evalN/A
cos-diffN/A
flip--N/A
unpow2N/A
Applied egg-rr45.8%
Final simplification64.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -0.9)
(* R (acos (* (cos phi1) (cos (- lambda2 lambda1)))))
(if (<= phi1 0.1)
(*
R
(acos
(fma
(* (cos phi2) (fma -0.5 (* phi1 phi1) 1.0))
(cos (- lambda1 lambda2))
(* (sin phi2) (* phi1 (fma phi1 (* phi1 -0.16666666666666666) 1.0))))))
(* R (acos (fma (cos phi2) (cos phi1) (* (sin phi1) (sin phi2))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.9) {
tmp = R * acos((cos(phi1) * cos((lambda2 - lambda1))));
} else if (phi1 <= 0.1) {
tmp = R * acos(fma((cos(phi2) * fma(-0.5, (phi1 * phi1), 1.0)), cos((lambda1 - lambda2)), (sin(phi2) * (phi1 * fma(phi1, (phi1 * -0.16666666666666666), 1.0)))));
} else {
tmp = R * acos(fma(cos(phi2), cos(phi1), (sin(phi1) * sin(phi2))));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.9) tmp = Float64(R * acos(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))); elseif (phi1 <= 0.1) tmp = Float64(R * acos(fma(Float64(cos(phi2) * fma(-0.5, Float64(phi1 * phi1), 1.0)), cos(Float64(lambda1 - lambda2)), Float64(sin(phi2) * Float64(phi1 * fma(phi1, Float64(phi1 * -0.16666666666666666), 1.0)))))); else tmp = Float64(R * acos(fma(cos(phi2), cos(phi1), Float64(sin(phi1) * sin(phi2))))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.9], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 0.1], N[(R * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[(-0.5 * N[(phi1 * phi1), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[phi2], $MachinePrecision] * N[(phi1 * N[(phi1 * N[(phi1 * -0.16666666666666666), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.9:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 0.1:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2 \cdot \mathsf{fma}\left(-0.5, \phi_1 \cdot \phi_1, 1\right), \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_2 \cdot \left(\phi_1 \cdot \mathsf{fma}\left(\phi_1, \phi_1 \cdot -0.16666666666666666, 1\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \phi_1, \sin \phi_1 \cdot \sin \phi_2\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.900000000000000022Initial program 74.1%
Taylor expanded in phi2 around 0
*-commutativeN/A
*-lowering-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
cos-lowering-cos.f6446.5
Simplified46.5%
if -0.900000000000000022 < phi1 < 0.10000000000000001Initial program 63.0%
Taylor expanded in phi1 around 0
Simplified63.0%
associate-*r*N/A
cos-diffN/A
*-commutativeN/A
*-commutativeN/A
cos-diffN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
--lowering--.f64N/A
associate-*r*N/A
Applied egg-rr63.0%
if 0.10000000000000001 < phi1 Initial program 82.8%
Taylor expanded in lambda2 around 0
cos-lowering-cos.f6456.9
Simplified56.9%
Taylor expanded in lambda1 around 0
*-commutativeN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6443.6
Simplified43.6%
Final simplification54.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi1 -1.5e-6)
(* R (acos (* (cos phi1) t_0)))
(/ R (/ 1.0 (acos (* (cos phi2) t_0)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -1.5e-6) {
tmp = R * acos((cos(phi1) * t_0));
} else {
tmp = R / (1.0 / acos((cos(phi2) * t_0)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
if (phi1 <= (-1.5d-6)) then
tmp = r * acos((cos(phi1) * t_0))
else
tmp = r / (1.0d0 / acos((cos(phi2) * t_0)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -1.5e-6) {
tmp = R * Math.acos((Math.cos(phi1) * t_0));
} else {
tmp = R / (1.0 / Math.acos((Math.cos(phi2) * t_0)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi1 <= -1.5e-6: tmp = R * math.acos((math.cos(phi1) * t_0)) else: tmp = R / (1.0 / math.acos((math.cos(phi2) * t_0))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi1 <= -1.5e-6) tmp = Float64(R * acos(Float64(cos(phi1) * t_0))); else tmp = Float64(R / Float64(1.0 / acos(Float64(cos(phi2) * t_0)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi1 <= -1.5e-6)
tmp = R * acos((cos(phi1) * t_0));
else
tmp = R / (1.0 / acos((cos(phi2) * t_0)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -1.5e-6], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R / N[(1.0 / N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_1 \leq -1.5 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{R}{\frac{1}{\cos^{-1} \left(\cos \phi_2 \cdot t\_0\right)}}\\
\end{array}
\end{array}
if phi1 < -1.5e-6Initial program 74.5%
Taylor expanded in phi2 around 0
*-commutativeN/A
*-lowering-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
cos-lowering-cos.f6447.3
Simplified47.3%
if -1.5e-6 < phi1 Initial program 69.0%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6448.9
Simplified48.9%
cos-diffN/A
accelerator-lowering-fma.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sin-lowering-sin.f64N/A
sin-lowering-sin.f6465.7
Applied egg-rr65.7%
*-commutativeN/A
acos-asinN/A
div-invN/A
metadata-evalN/A
cos-diffN/A
flip--N/A
unpow2N/A
Applied egg-rr48.9%
Final simplification48.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 (<= phi1 -8.8e-8)
(* R (acos (* (cos phi1) (cos lambda1))))
(if (<= phi1 -3.4e-173)
(* R (acos (cos (- lambda1 lambda2))))
(* R (acos (* (cos phi2) (cos lambda1)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -8.8e-8) {
tmp = R * acos((cos(phi1) * cos(lambda1)));
} else if (phi1 <= -3.4e-173) {
tmp = R * acos(cos((lambda1 - lambda2)));
} else {
tmp = R * acos((cos(phi2) * cos(lambda1)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-8.8d-8)) then
tmp = r * acos((cos(phi1) * cos(lambda1)))
else if (phi1 <= (-3.4d-173)) then
tmp = r * acos(cos((lambda1 - lambda2)))
else
tmp = r * acos((cos(phi2) * cos(lambda1)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -8.8e-8) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else if (phi1 <= -3.4e-173) {
tmp = R * Math.acos(Math.cos((lambda1 - lambda2)));
} else {
tmp = R * Math.acos((Math.cos(phi2) * Math.cos(lambda1)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -8.8e-8: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1))) elif phi1 <= -3.4e-173: tmp = R * math.acos(math.cos((lambda1 - lambda2))) else: tmp = R * math.acos((math.cos(phi2) * math.cos(lambda1))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -8.8e-8) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1)))); elseif (phi1 <= -3.4e-173) tmp = Float64(R * acos(cos(Float64(lambda1 - lambda2)))); else tmp = Float64(R * acos(Float64(cos(phi2) * cos(lambda1)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -8.8e-8)
tmp = R * acos((cos(phi1) * cos(lambda1)));
elseif (phi1 <= -3.4e-173)
tmp = R * acos(cos((lambda1 - lambda2)));
else
tmp = R * acos((cos(phi2) * cos(lambda1)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -8.8e-8], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -3.4e-173], N[(R * N[ArcCos[N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -8.8 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{elif}\;\phi_1 \leq -3.4 \cdot 10^{-173}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -8.7999999999999994e-8Initial program 74.5%
Taylor expanded in lambda2 around 0
cos-lowering-cos.f6453.8
Simplified53.8%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6434.0
Simplified34.0%
if -8.7999999999999994e-8 < phi1 < -3.3999999999999999e-173Initial program 56.2%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6455.9
Simplified55.9%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6436.4
Simplified36.4%
if -3.3999999999999999e-173 < phi1 Initial program 72.4%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6447.0
Simplified47.0%
Taylor expanded in lambda2 around 0
cos-negN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6433.0
Simplified33.0%
Final simplification33.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(if (<= phi1 -2.5e-6)
(* R (acos (* (cos phi1) t_0)))
(* R (acos (* (cos phi2) t_0))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -2.5e-6) {
tmp = R * acos((cos(phi1) * t_0));
} else {
tmp = R * acos((cos(phi2) * t_0));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((lambda2 - lambda1))
if (phi1 <= (-2.5d-6)) then
tmp = r * acos((cos(phi1) * t_0))
else
tmp = r * acos((cos(phi2) * t_0))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -2.5e-6) {
tmp = R * Math.acos((Math.cos(phi1) * t_0));
} else {
tmp = R * Math.acos((Math.cos(phi2) * t_0));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi1 <= -2.5e-6: tmp = R * math.acos((math.cos(phi1) * t_0)) else: tmp = R * math.acos((math.cos(phi2) * t_0)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi1 <= -2.5e-6) tmp = Float64(R * acos(Float64(cos(phi1) * t_0))); else tmp = Float64(R * acos(Float64(cos(phi2) * t_0))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi1 <= -2.5e-6)
tmp = R * acos((cos(phi1) * t_0));
else
tmp = R * acos((cos(phi2) * t_0));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -2.5e-6], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
\mathbf{if}\;\phi_1 \leq -2.5 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot t\_0\right)\\
\end{array}
\end{array}
if phi1 < -2.5000000000000002e-6Initial program 74.5%
Taylor expanded in phi2 around 0
*-commutativeN/A
*-lowering-*.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
cos-lowering-cos.f6447.3
Simplified47.3%
if -2.5000000000000002e-6 < phi1 Initial program 69.0%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6448.9
Simplified48.9%
Final simplification48.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 (<= phi1 -3.7e-6) (* R (acos (* (cos phi1) (cos lambda1)))) (* R (acos (* (cos phi2) (cos (- lambda2 lambda1)))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.7e-6) {
tmp = R * acos((cos(phi1) * cos(lambda1)));
} else {
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-3.7d-6)) then
tmp = r * acos((cos(phi1) * cos(lambda1)))
else
tmp = r * acos((cos(phi2) * cos((lambda2 - lambda1))))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.7e-6) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else {
tmp = R * Math.acos((Math.cos(phi2) * Math.cos((lambda2 - lambda1))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -3.7e-6: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1))) else: tmp = R * math.acos((math.cos(phi2) * math.cos((lambda2 - lambda1)))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -3.7e-6) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1)))); else tmp = Float64(R * acos(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -3.7e-6)
tmp = R * acos((cos(phi1) * cos(lambda1)));
else
tmp = R * acos((cos(phi2) * cos((lambda2 - lambda1))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -3.7e-6], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -3.7 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi1 < -3.7000000000000002e-6Initial program 74.5%
Taylor expanded in lambda2 around 0
cos-lowering-cos.f6453.8
Simplified53.8%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6434.0
Simplified34.0%
if -3.7000000000000002e-6 < phi1 Initial program 69.0%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6448.9
Simplified48.9%
Final simplification44.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))))
(if (<= t_0 0.995)
(* R (acos t_0))
(* R (fabs (remainder (- lambda1 lambda2) (* PI 2.0)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double tmp;
if (t_0 <= 0.995) {
tmp = R * acos(t_0);
} else {
tmp = R * fabs(remainder((lambda1 - lambda2), (((double) M_PI) * 2.0)));
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda1 - lambda2));
double tmp;
if (t_0 <= 0.995) {
tmp = R * Math.acos(t_0);
} else {
tmp = R * Math.abs(Math.IEEEremainder((lambda1 - lambda2), (Math.PI * 2.0)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda1 - lambda2)) tmp = 0 if t_0 <= 0.995: tmp = R * math.acos(t_0) else: tmp = R * math.fabs(math.remainder((lambda1 - lambda2), (math.pi * 2.0))) return tmp
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[t$95$0, 0.995], N[(R * N[ArcCos[t$95$0], $MachinePrecision]), $MachinePrecision], N[(R * N[Abs[N[With[{TMP1 = N[(lambda1 - lambda2), $MachinePrecision], TMP2 = N[(Pi * 2.0), $MachinePrecision]}, TMP1 - Round[TMP1 / TMP2] * TMP2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
\mathbf{if}\;t\_0 \leq 0.995:\\
\;\;\;\;R \cdot \cos^{-1} t\_0\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left|\left(\left(\lambda_1 - \lambda_2\right) \mathsf{rem} \left(\pi \cdot 2\right)\right)\right|\\
\end{array}
\end{array}
if (cos.f64 (-.f64 lambda1 lambda2)) < 0.994999999999999996Initial program 69.3%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6445.1
Simplified45.1%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6431.8
Simplified31.8%
if 0.994999999999999996 < (cos.f64 (-.f64 lambda1 lambda2)) Initial program 73.6%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6429.4
Simplified29.4%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f646.4
Simplified6.4%
acos-cosN/A
fabs-lowering-fabs.f64N/A
remainder-lowering-remainder.f64N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6420.7
Applied egg-rr20.7%
Final simplification28.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 (<= lambda2 0.105) (* R (acos (* (cos phi1) (cos lambda1)))) (* R (acos (* (cos phi2) (cos lambda2))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.105) {
tmp = R * acos((cos(phi1) * cos(lambda1)));
} else {
tmp = R * acos((cos(phi2) * cos(lambda2)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 0.105d0) then
tmp = r * acos((cos(phi1) * cos(lambda1)))
else
tmp = r * acos((cos(phi2) * cos(lambda2)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.105) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else {
tmp = R * Math.acos((Math.cos(phi2) * Math.cos(lambda2)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 0.105: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1))) else: tmp = R * math.acos((math.cos(phi2) * math.cos(lambda2))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 0.105) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1)))); else tmp = Float64(R * acos(Float64(cos(phi2) * cos(lambda2)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 0.105)
tmp = R * acos((cos(phi1) * cos(lambda1)));
else
tmp = R * acos((cos(phi2) * cos(lambda2)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 0.105], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 0.105:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 0.104999999999999996Initial program 74.0%
Taylor expanded in lambda2 around 0
cos-lowering-cos.f6459.1
Simplified59.1%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6431.5
Simplified31.5%
if 0.104999999999999996 < lambda2 Initial program 59.9%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6441.2
Simplified41.2%
Taylor expanded in lambda1 around 0
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6441.3
Simplified41.3%
Final simplification34.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 0.0115) (* R (acos (* (cos phi1) (cos lambda1)))) (* R (acos (cos (- lambda1 lambda2))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.0115) {
tmp = R * acos((cos(phi1) * cos(lambda1)));
} else {
tmp = R * acos(cos((lambda1 - lambda2)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 0.0115d0) then
tmp = r * acos((cos(phi1) * cos(lambda1)))
else
tmp = r * acos(cos((lambda1 - lambda2)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.0115) {
tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else {
tmp = R * Math.acos(Math.cos((lambda1 - lambda2)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 0.0115: tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1))) else: tmp = R * math.acos(math.cos((lambda1 - lambda2))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 0.0115) tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1)))); else tmp = Float64(R * acos(cos(Float64(lambda1 - lambda2)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 0.0115)
tmp = R * acos((cos(phi1) * cos(lambda1)));
else
tmp = R * acos(cos((lambda1 - lambda2)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 0.0115], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 0.0115:\\
\;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \left(\lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 0.0115Initial program 74.3%
Taylor expanded in lambda2 around 0
cos-lowering-cos.f6459.3
Simplified59.3%
Taylor expanded in phi2 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
cos-lowering-cos.f6431.5
Simplified31.5%
if 0.0115 < lambda2 Initial program 59.4%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6440.9
Simplified40.9%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6430.1
Simplified30.1%
Final simplification31.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 (<= lambda1 -0.00095)
(* R (acos (cos lambda1)))
(if (<= lambda1 -3.3e-77)
(* R (fabs (remainder (- lambda1 lambda2) (* PI 2.0))))
(* R (acos (cos lambda2))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -0.00095) {
tmp = R * acos(cos(lambda1));
} else if (lambda1 <= -3.3e-77) {
tmp = R * fabs(remainder((lambda1 - lambda2), (((double) M_PI) * 2.0)));
} else {
tmp = R * acos(cos(lambda2));
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -0.00095) {
tmp = R * Math.acos(Math.cos(lambda1));
} else if (lambda1 <= -3.3e-77) {
tmp = R * Math.abs(Math.IEEEremainder((lambda1 - lambda2), (Math.PI * 2.0)));
} else {
tmp = R * Math.acos(Math.cos(lambda2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -0.00095: tmp = R * math.acos(math.cos(lambda1)) elif lambda1 <= -3.3e-77: tmp = R * math.fabs(math.remainder((lambda1 - lambda2), (math.pi * 2.0))) else: tmp = R * math.acos(math.cos(lambda2)) return tmp
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -0.00095], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, -3.3e-77], N[(R * N[Abs[N[With[{TMP1 = N[(lambda1 - lambda2), $MachinePrecision], TMP2 = N[(Pi * 2.0), $MachinePrecision]}, TMP1 - Round[TMP1 / TMP2] * TMP2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -0.00095:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{elif}\;\lambda_1 \leq -3.3 \cdot 10^{-77}:\\
\;\;\;\;R \cdot \left|\left(\left(\lambda_1 - \lambda_2\right) \mathsf{rem} \left(\pi \cdot 2\right)\right)\right|\\
\mathbf{else}:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\
\end{array}
\end{array}
if lambda1 < -9.49999999999999998e-4Initial program 53.3%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6436.1
Simplified36.1%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6426.6
Simplified26.6%
Taylor expanded in lambda2 around 0
cos-lowering-cos.f6426.6
Simplified26.6%
if -9.49999999999999998e-4 < lambda1 < -3.29999999999999991e-77Initial program 66.6%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6428.4
Simplified28.4%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6417.9
Simplified17.9%
acos-cosN/A
fabs-lowering-fabs.f64N/A
remainder-lowering-remainder.f64N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6445.0
Applied egg-rr45.0%
if -3.29999999999999991e-77 < lambda1 Initial program 76.9%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6443.8
Simplified43.8%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6425.2
Simplified25.2%
Taylor expanded in lambda1 around 0
cos-negN/A
cos-lowering-cos.f6419.2
Simplified19.2%
Final simplification22.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 -0.00095) (* R (acos (cos lambda1))) (* R (fabs (remainder (- lambda1 lambda2) (* PI 2.0))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -0.00095) {
tmp = R * acos(cos(lambda1));
} else {
tmp = R * fabs(remainder((lambda1 - lambda2), (((double) M_PI) * 2.0)));
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -0.00095) {
tmp = R * Math.acos(Math.cos(lambda1));
} else {
tmp = R * Math.abs(Math.IEEEremainder((lambda1 - lambda2), (Math.PI * 2.0)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -0.00095: tmp = R * math.acos(math.cos(lambda1)) else: tmp = R * math.fabs(math.remainder((lambda1 - lambda2), (math.pi * 2.0))) return tmp
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -0.00095], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Abs[N[With[{TMP1 = N[(lambda1 - lambda2), $MachinePrecision], TMP2 = N[(Pi * 2.0), $MachinePrecision]}, TMP1 - Round[TMP1 / TMP2] * TMP2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -0.00095:\\
\;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left|\left(\left(\lambda_1 - \lambda_2\right) \mathsf{rem} \left(\pi \cdot 2\right)\right)\right|\\
\end{array}
\end{array}
if lambda1 < -9.49999999999999998e-4Initial program 53.3%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6436.1
Simplified36.1%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6426.6
Simplified26.6%
Taylor expanded in lambda2 around 0
cos-lowering-cos.f6426.6
Simplified26.6%
if -9.49999999999999998e-4 < lambda1 Initial program 76.1%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6442.6
Simplified42.6%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6424.7
Simplified24.7%
acos-cosN/A
fabs-lowering-fabs.f64N/A
remainder-lowering-remainder.f64N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6420.2
Applied egg-rr20.2%
Final simplification21.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 (* R (fabs (remainder (- lambda1 lambda2) (* PI 2.0)))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * fabs(remainder((lambda1 - lambda2), (((double) M_PI) * 2.0)));
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.abs(Math.IEEEremainder((lambda1 - lambda2), (Math.PI * 2.0)));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.fabs(math.remainder((lambda1 - lambda2), (math.pi * 2.0)))
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[Abs[N[With[{TMP1 = N[(lambda1 - lambda2), $MachinePrecision], TMP2 = N[(Pi * 2.0), $MachinePrecision]}, TMP1 - Round[TMP1 / TMP2] * TMP2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \left|\left(\left(\lambda_1 - \lambda_2\right) \mathsf{rem} \left(\pi \cdot 2\right)\right)\right|
\end{array}
Initial program 70.4%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6441.0
Simplified41.0%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6425.1
Simplified25.1%
acos-cosN/A
fabs-lowering-fabs.f64N/A
remainder-lowering-remainder.f64N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6420.2
Applied egg-rr20.2%
Final simplification20.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* (- lambda2 lambda1) R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return (lambda2 - 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 = (lambda2 - 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 (lambda2 - lambda1) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return (lambda2 - lambda1) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(Float64(lambda2 - lambda1) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = (lambda2 - 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[(lambda2 - lambda1), $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\left(\lambda_2 - \lambda_1\right) \cdot R
\end{array}
Initial program 70.4%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6441.0
Simplified41.0%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6425.1
Simplified25.1%
cos-diffN/A
*-commutativeN/A
*-commutativeN/A
cos-diffN/A
acos-cos-sN/A
--lowering--.f646.2
Applied egg-rr6.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 (* lambda1 R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return 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 = 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 lambda1 * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return lambda1 * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(lambda1 * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = 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[(lambda1 * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\lambda_1 \cdot R
\end{array}
Initial program 70.4%
Taylor expanded in phi1 around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6441.0
Simplified41.0%
Taylor expanded in phi2 around 0
sub-negN/A
remove-double-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
cos-negN/A
cos-lowering-cos.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f6425.1
Simplified25.1%
Taylor expanded in lambda1 around inf
Simplified4.2%
herbie shell --seed 2024205
(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))