
(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 30 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}
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<=
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
0.0)
(fabs (* R_m (- phi1 phi2)))
(*
R_m
(acos
(fma
(sin phi1)
(sin phi2)
(*
(cos phi1)
(*
(cos phi2)
(fma
(sin lambda1)
(sin lambda2)
(* (cos lambda2) (cos lambda1)))))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) <= 0.0) {
tmp = fabs((R_m * (phi1 - phi2)));
} else {
tmp = R_m * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * (cos(phi2) * fma(sin(lambda1), sin(lambda2), (cos(lambda2) * cos(lambda1)))))));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) <= 0.0) tmp = abs(Float64(R_m * Float64(phi1 - phi2))); else tmp = Float64(R_m * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(cos(phi2) * fma(sin(lambda1), sin(lambda2), Float64(cos(lambda2) * cos(lambda1)))))))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[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], 0.0], N[Abs[N[(R$95$m * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\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) \leq 0:\\
\;\;\;\;\left|R_m \cdot \left(\phi_1 - \phi_2\right)\right|\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\right)\right)\\
\end{array}
\end{array}
if (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) < 0.0Initial program 3.8%
Simplified3.8%
Taylor expanded in lambda2 around 0 3.8%
cos-neg3.8%
Simplified3.8%
Taylor expanded in lambda1 around 0 3.8%
add-sqr-sqrt3.8%
pow23.8%
cos-diff3.8%
Applied egg-rr3.8%
rem-square-sqrt3.8%
sqrt-unprod3.8%
pow23.8%
unpow23.8%
add-sqr-sqrt3.8%
acos-cos-s12.0%
Applied egg-rr12.0%
unpow212.0%
rem-sqrt-square20.4%
Simplified20.4%
if 0.0 < (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 75.3%
Simplified75.3%
cos-diff98.9%
distribute-lft-in98.9%
Applied egg-rr98.9%
distribute-lft-out98.9%
+-commutative98.9%
fma-def98.9%
*-commutative98.9%
Simplified98.9%
Final simplification95.5%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(*
R_s
(if (<=
(acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
0.0)
(fabs (* R_m (- phi1 phi2)))
(*
R_m
(acos
(+
t_0
(*
(cos phi2)
(*
(cos phi1)
(fma
(cos lambda2)
(cos lambda1)
(* (sin lambda1) (sin lambda2))))))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, 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))))) <= 0.0) {
tmp = fabs((R_m * (phi1 - phi2)));
} else {
tmp = R_m * acos((t_0 + (cos(phi2) * (cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2)))))));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, 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))))) <= 0.0) tmp = abs(Float64(R_m * Float64(phi1 - phi2))); else tmp = Float64(R_m * acos(Float64(t_0 + Float64(cos(phi2) * Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))))))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, N[(R$95$s * 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], 0.0], N[Abs[N[(R$95$m * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(R$95$m * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
R_s \cdot \begin{array}{l}
\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 0:\\
\;\;\;\;\left|R_m \cdot \left(\phi_1 - \phi_2\right)\right|\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(t_0 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\right)\\
\end{array}
\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))))) < 0.0Initial program 3.8%
Simplified3.8%
Taylor expanded in lambda2 around 0 3.8%
cos-neg3.8%
Simplified3.8%
Taylor expanded in lambda1 around 0 3.8%
add-sqr-sqrt3.8%
pow23.8%
cos-diff3.8%
Applied egg-rr3.8%
rem-square-sqrt3.8%
sqrt-unprod3.8%
pow23.8%
unpow23.8%
add-sqr-sqrt3.8%
acos-cos-s12.0%
Applied egg-rr12.0%
unpow212.0%
rem-sqrt-square20.4%
Simplified20.4%
if 0.0 < (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 75.3%
cos-diff98.9%
distribute-lft-in98.9%
Applied egg-rr98.9%
distribute-lft-out98.9%
*-commutative98.9%
associate-*l*98.9%
*-commutative98.9%
fma-udef98.9%
*-commutative98.9%
Simplified98.9%
Final simplification95.5%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
(*
R_s
(if (<= (acos (+ t_1 (* t_0 (cos (- lambda1 lambda2))))) 0.0)
(fabs (* R_m (- phi1 phi2)))
(*
R_m
(acos
(+
t_1
(*
t_0
(fma
(sin lambda1)
(sin lambda2)
(* (cos lambda2) (cos lambda1)))))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(phi1) * cos(phi2);
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (acos((t_1 + (t_0 * cos((lambda1 - lambda2))))) <= 0.0) {
tmp = fabs((R_m * (phi1 - phi2)));
} else {
tmp = R_m * acos((t_1 + (t_0 * fma(sin(lambda1), sin(lambda2), (cos(lambda2) * cos(lambda1))))));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(phi1) * cos(phi2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (acos(Float64(t_1 + Float64(t_0 * cos(Float64(lambda1 - lambda2))))) <= 0.0) tmp = abs(Float64(R_m * Float64(phi1 - phi2))); else tmp = Float64(R_m * acos(Float64(t_1 + Float64(t_0 * fma(sin(lambda1), sin(lambda2), Float64(cos(lambda2) * cos(lambda1))))))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, N[(R$95$s * If[LessEqual[N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], N[Abs[N[(R$95$m * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(R$95$m * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \phi_1 \cdot \cos \phi_2\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\cos^{-1} \left(t_1 + t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \leq 0:\\
\;\;\;\;\left|R_m \cdot \left(\phi_1 - \phi_2\right)\right|\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(t_1 + t_0 \cdot \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\end{array}
\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))))) < 0.0Initial program 3.8%
Simplified3.8%
Taylor expanded in lambda2 around 0 3.8%
cos-neg3.8%
Simplified3.8%
Taylor expanded in lambda1 around 0 3.8%
add-sqr-sqrt3.8%
pow23.8%
cos-diff3.8%
Applied egg-rr3.8%
rem-square-sqrt3.8%
sqrt-unprod3.8%
pow23.8%
unpow23.8%
add-sqr-sqrt3.8%
acos-cos-s12.0%
Applied egg-rr12.0%
unpow212.0%
rem-sqrt-square20.4%
Simplified20.4%
if 0.0 < (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 75.3%
cos-diff98.9%
distribute-lft-in98.9%
Applied egg-rr98.9%
distribute-lft-out98.9%
+-commutative98.9%
fma-def98.9%
*-commutative98.9%
Simplified98.9%
Final simplification95.5%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(*
R_s
(if (<= phi2 -0.33)
(*
R_m
(log
(exp
(acos
(fma (sin phi1) (sin phi2) (* (* (cos phi1) (cos phi2)) t_0))))))
(if (<= phi2 150000000000.0)
(*
R_m
(acos
(+
(*
(cos phi2)
(*
(cos phi1)
(fma
(cos lambda2)
(cos lambda1)
(* (sin lambda1) (sin lambda2)))))
(* (sin phi1) phi2))))
(*
R_m
(-
(* PI 0.5)
(asin
(fma
(cos phi1)
(* (cos phi2) t_0)
(* (sin phi1) (sin phi2)))))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= -0.33) {
tmp = R_m * log(exp(acos(fma(sin(phi1), sin(phi2), ((cos(phi1) * cos(phi2)) * t_0)))));
} else if (phi2 <= 150000000000.0) {
tmp = R_m * acos(((cos(phi2) * (cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))))) + (sin(phi1) * phi2)));
} else {
tmp = R_m * ((((double) M_PI) * 0.5) - asin(fma(cos(phi1), (cos(phi2) * t_0), (sin(phi1) * sin(phi2)))));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= -0.33) tmp = Float64(R_m * log(exp(acos(fma(sin(phi1), sin(phi2), Float64(Float64(cos(phi1) * cos(phi2)) * t_0)))))); elseif (phi2 <= 150000000000.0) tmp = Float64(R_m * acos(Float64(Float64(cos(phi2) * Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))))) + Float64(sin(phi1) * phi2)))); else tmp = Float64(R_m * Float64(Float64(pi * 0.5) - asin(fma(cos(phi1), Float64(cos(phi2) * t_0), Float64(sin(phi1) * sin(phi2)))))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, N[(R$95$s * If[LessEqual[phi2, -0.33], N[(R$95$m * N[Log[N[Exp[N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 150000000000.0], N[(R$95$m * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq -0.33:\\
\;\;\;\;R_m \cdot \log \left(e^{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot t_0\right)\right)}\right)\\
\mathbf{elif}\;\phi_2 \leq 150000000000:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right) + \sin \phi_1 \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot t_0, \sin \phi_1 \cdot \sin \phi_2\right)\right)\right)\\
\end{array}
\end{array}
\end{array}
if phi2 < -0.330000000000000016Initial program 75.3%
cos-diff98.5%
distribute-lft-in98.4%
Applied egg-rr98.4%
distribute-lft-out98.5%
*-commutative98.5%
associate-*l*98.4%
*-commutative98.4%
fma-udef98.4%
*-commutative98.4%
Simplified98.4%
add-log-exp98.4%
fma-def98.4%
associate-*r*98.4%
fma-udef98.5%
cos-diff75.3%
Applied egg-rr75.3%
if -0.330000000000000016 < phi2 < 1.5e11Initial program 66.6%
cos-diff90.5%
distribute-lft-in90.6%
Applied egg-rr90.6%
distribute-lft-out90.5%
*-commutative90.5%
associate-*l*90.6%
*-commutative90.6%
fma-udef90.6%
*-commutative90.6%
Simplified90.6%
Taylor expanded in phi2 around 0 89.1%
*-commutative89.1%
Simplified89.1%
if 1.5e11 < phi2 Initial program 79.9%
Simplified79.9%
cos-diff99.2%
*-commutative99.2%
*-commutative99.2%
cos-diff79.9%
fma-def79.9%
+-commutative79.9%
acos-asin80.0%
sub-neg80.0%
div-inv80.0%
metadata-eval80.0%
+-commutative80.0%
Applied egg-rr80.0%
sub-neg80.0%
Simplified80.0%
Final simplification83.3%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(*
R_s
(if (<= phi2 -1.45e-6)
(*
R_m
(log
(exp
(acos
(fma (sin phi1) (sin phi2) (* (* (cos phi1) (cos phi2)) t_0))))))
(if (<= phi2 0.00155)
(*
R_m
(acos
(fma
(sin phi1)
(sin phi2)
(*
(cos phi1)
(+
(* (cos lambda2) (cos lambda1))
(* (sin lambda1) (sin lambda2)))))))
(*
R_m
(-
(* PI 0.5)
(asin
(fma
(cos phi1)
(* (cos phi2) t_0)
(* (sin phi1) (sin phi2)))))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= -1.45e-6) {
tmp = R_m * log(exp(acos(fma(sin(phi1), sin(phi2), ((cos(phi1) * cos(phi2)) * t_0)))));
} else if (phi2 <= 0.00155) {
tmp = R_m * acos(fma(sin(phi1), sin(phi2), (cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2))))));
} else {
tmp = R_m * ((((double) M_PI) * 0.5) - asin(fma(cos(phi1), (cos(phi2) * t_0), (sin(phi1) * sin(phi2)))));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= -1.45e-6) tmp = Float64(R_m * log(exp(acos(fma(sin(phi1), sin(phi2), Float64(Float64(cos(phi1) * cos(phi2)) * t_0)))))); elseif (phi2 <= 0.00155) tmp = Float64(R_m * acos(fma(sin(phi1), sin(phi2), Float64(cos(phi1) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda1) * sin(lambda2))))))); else tmp = Float64(R_m * Float64(Float64(pi * 0.5) - asin(fma(cos(phi1), Float64(cos(phi2) * t_0), Float64(sin(phi1) * sin(phi2)))))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, N[(R$95$s * If[LessEqual[phi2, -1.45e-6], N[(R$95$m * N[Log[N[Exp[N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 0.00155], N[(R$95$m * N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.45 \cdot 10^{-6}:\\
\;\;\;\;R_m \cdot \log \left(e^{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot t_0\right)\right)}\right)\\
\mathbf{elif}\;\phi_2 \leq 0.00155:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot t_0, \sin \phi_1 \cdot \sin \phi_2\right)\right)\right)\\
\end{array}
\end{array}
\end{array}
if phi2 < -1.4500000000000001e-6Initial program 75.6%
cos-diff98.5%
distribute-lft-in98.4%
Applied egg-rr98.4%
distribute-lft-out98.5%
*-commutative98.5%
associate-*l*98.4%
*-commutative98.4%
fma-udef98.4%
*-commutative98.4%
Simplified98.4%
add-log-exp98.4%
fma-def98.4%
associate-*r*98.4%
fma-udef98.5%
cos-diff75.6%
Applied egg-rr75.6%
if -1.4500000000000001e-6 < phi2 < 0.00154999999999999995Initial program 66.8%
Simplified66.8%
cos-diff90.2%
distribute-lft-in90.2%
Applied egg-rr90.2%
distribute-lft-out90.2%
+-commutative90.2%
fma-def90.2%
*-commutative90.2%
Simplified90.2%
Taylor expanded in phi2 around 0 90.2%
if 0.00154999999999999995 < phi2 Initial program 78.3%
Simplified78.3%
cos-diff99.2%
*-commutative99.2%
*-commutative99.2%
cos-diff78.3%
fma-def78.3%
+-commutative78.3%
acos-asin78.4%
sub-neg78.4%
div-inv78.4%
metadata-eval78.4%
+-commutative78.4%
Applied egg-rr78.4%
sub-neg78.4%
Simplified78.4%
Final simplification83.2%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(*
R_s
(if (<= phi2 -2.3e-8)
(*
R_m
(log
(exp
(acos
(fma (sin phi1) (sin phi2) (* (* (cos phi1) (cos phi2)) t_0))))))
(if (<= phi2 0.00155)
(*
R_m
(acos
(*
(cos phi1)
(fma (sin lambda1) (sin lambda2) (* (cos lambda2) (cos lambda1))))))
(*
R_m
(-
(* PI 0.5)
(asin
(fma
(cos phi1)
(* (cos phi2) t_0)
(* (sin phi1) (sin phi2)))))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi2 <= -2.3e-8) {
tmp = R_m * log(exp(acos(fma(sin(phi1), sin(phi2), ((cos(phi1) * cos(phi2)) * t_0)))));
} else if (phi2 <= 0.00155) {
tmp = R_m * acos((cos(phi1) * fma(sin(lambda1), sin(lambda2), (cos(lambda2) * cos(lambda1)))));
} else {
tmp = R_m * ((((double) M_PI) * 0.5) - asin(fma(cos(phi1), (cos(phi2) * t_0), (sin(phi1) * sin(phi2)))));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi2 <= -2.3e-8) tmp = Float64(R_m * log(exp(acos(fma(sin(phi1), sin(phi2), Float64(Float64(cos(phi1) * cos(phi2)) * t_0)))))); elseif (phi2 <= 0.00155) tmp = Float64(R_m * acos(Float64(cos(phi1) * fma(sin(lambda1), sin(lambda2), Float64(cos(lambda2) * cos(lambda1)))))); else tmp = Float64(R_m * Float64(Float64(pi * 0.5) - asin(fma(cos(phi1), Float64(cos(phi2) * t_0), Float64(sin(phi1) * sin(phi2)))))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, N[(R$95$s * If[LessEqual[phi2, -2.3e-8], N[(R$95$m * N[Log[N[Exp[N[ArcCos[N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 0.00155], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq -2.3 \cdot 10^{-8}:\\
\;\;\;\;R_m \cdot \log \left(e^{\cos^{-1} \left(\mathsf{fma}\left(\sin \phi_1, \sin \phi_2, \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot t_0\right)\right)}\right)\\
\mathbf{elif}\;\phi_2 \leq 0.00155:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot t_0, \sin \phi_1 \cdot \sin \phi_2\right)\right)\right)\\
\end{array}
\end{array}
\end{array}
if phi2 < -2.3000000000000001e-8Initial program 75.6%
cos-diff98.5%
distribute-lft-in98.4%
Applied egg-rr98.4%
distribute-lft-out98.5%
*-commutative98.5%
associate-*l*98.4%
*-commutative98.4%
fma-udef98.4%
*-commutative98.4%
Simplified98.4%
add-log-exp98.4%
fma-def98.4%
associate-*r*98.4%
fma-udef98.5%
cos-diff75.6%
Applied egg-rr75.6%
if -2.3000000000000001e-8 < phi2 < 0.00154999999999999995Initial program 66.8%
Simplified66.8%
Taylor expanded in phi2 around 0 66.7%
cos-diff89.6%
*-commutative89.6%
*-commutative89.6%
Applied egg-rr89.6%
+-commutative89.6%
fma-def89.6%
*-commutative89.6%
Simplified89.6%
if 0.00154999999999999995 < phi2 Initial program 78.3%
Simplified78.3%
cos-diff99.2%
*-commutative99.2%
*-commutative99.2%
cos-diff78.3%
fma-def78.3%
+-commutative78.3%
acos-asin78.4%
sub-neg78.4%
div-inv78.4%
metadata-eval78.4%
+-commutative78.4%
Applied egg-rr78.4%
sub-neg78.4%
Simplified78.4%
Final simplification83.0%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(*
R_s
(if (<= phi2 -3.4e-8)
(*
(acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R_m)
(if (<= phi2 0.00155)
(*
R_m
(acos
(*
(cos phi1)
(fma (sin lambda1) (sin lambda2) (* (cos lambda2) (cos lambda1))))))
(*
R_m
(-
(* PI 0.5)
(asin
(fma
(cos phi1)
(* (cos phi2) (cos (- lambda2 lambda1)))
t_0)))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -3.4e-8) {
tmp = acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R_m;
} else if (phi2 <= 0.00155) {
tmp = R_m * acos((cos(phi1) * fma(sin(lambda1), sin(lambda2), (cos(lambda2) * cos(lambda1)))));
} else {
tmp = R_m * ((((double) M_PI) * 0.5) - asin(fma(cos(phi1), (cos(phi2) * cos((lambda2 - lambda1))), t_0)));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -3.4e-8) tmp = Float64(acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R_m); elseif (phi2 <= 0.00155) tmp = Float64(R_m * acos(Float64(cos(phi1) * fma(sin(lambda1), sin(lambda2), Float64(cos(lambda2) * cos(lambda1)))))); else tmp = Float64(R_m * Float64(Float64(pi * 0.5) - asin(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))), t_0)))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, N[(R$95$s * If[LessEqual[phi2, -3.4e-8], N[(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] * R$95$m), $MachinePrecision], If[LessEqual[phi2, 0.00155], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq -3.4 \cdot 10^{-8}:\\
\;\;\;\;\cos^{-1} \left(t_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R_m\\
\mathbf{elif}\;\phi_2 \leq 0.00155:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right), t_0\right)\right)\right)\\
\end{array}
\end{array}
\end{array}
if phi2 < -3.4e-8Initial program 75.6%
if -3.4e-8 < phi2 < 0.00154999999999999995Initial program 66.8%
Simplified66.8%
Taylor expanded in phi2 around 0 66.7%
cos-diff89.6%
*-commutative89.6%
*-commutative89.6%
Applied egg-rr89.6%
+-commutative89.6%
fma-def89.6%
*-commutative89.6%
Simplified89.6%
if 0.00154999999999999995 < phi2 Initial program 78.3%
Simplified78.3%
cos-diff99.2%
*-commutative99.2%
*-commutative99.2%
cos-diff78.3%
fma-def78.3%
+-commutative78.3%
acos-asin78.4%
sub-neg78.4%
div-inv78.4%
metadata-eval78.4%
+-commutative78.4%
Applied egg-rr78.4%
sub-neg78.4%
Simplified78.4%
Final simplification83.0%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
(*
R_s
(if (<= phi2 -5.2e-9)
(* (acos (+ t_1 (* (* (cos phi1) (cos phi2)) t_0))) R_m)
(if (<= phi2 0.00155)
(*
R_m
(acos
(*
(cos phi1)
(fma (sin lambda1) (sin lambda2) (* (cos lambda2) (cos lambda1))))))
(* R_m (acos (fma (cos phi1) (* (cos phi2) t_0) t_1))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda1 - lambda2));
double t_1 = sin(phi1) * sin(phi2);
double tmp;
if (phi2 <= -5.2e-9) {
tmp = acos((t_1 + ((cos(phi1) * cos(phi2)) * t_0))) * R_m;
} else if (phi2 <= 0.00155) {
tmp = R_m * acos((cos(phi1) * fma(sin(lambda1), sin(lambda2), (cos(lambda2) * cos(lambda1)))));
} else {
tmp = R_m * acos(fma(cos(phi1), (cos(phi2) * t_0), t_1));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda1 - lambda2)) t_1 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (phi2 <= -5.2e-9) tmp = Float64(acos(Float64(t_1 + Float64(Float64(cos(phi1) * cos(phi2)) * t_0))) * R_m); elseif (phi2 <= 0.00155) tmp = Float64(R_m * acos(Float64(cos(phi1) * fma(sin(lambda1), sin(lambda2), Float64(cos(lambda2) * cos(lambda1)))))); else tmp = Float64(R_m * acos(fma(cos(phi1), Float64(cos(phi2) * t_0), t_1))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, N[(R$95$s * If[LessEqual[phi2, -5.2e-9], N[(N[ArcCos[N[(t$95$1 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R$95$m), $MachinePrecision], If[LessEqual[phi2, 0.00155], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision] + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\
t_1 := \sin \phi_1 \cdot \sin \phi_2\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq -5.2 \cdot 10^{-9}:\\
\;\;\;\;\cos^{-1} \left(t_1 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot t_0\right) \cdot R_m\\
\mathbf{elif}\;\phi_2 \leq 0.00155:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot t_0, t_1\right)\right)\\
\end{array}
\end{array}
\end{array}
if phi2 < -5.2000000000000002e-9Initial program 75.6%
if -5.2000000000000002e-9 < phi2 < 0.00154999999999999995Initial program 66.8%
Simplified66.8%
Taylor expanded in phi2 around 0 66.7%
cos-diff89.6%
*-commutative89.6%
*-commutative89.6%
Applied egg-rr89.6%
+-commutative89.6%
fma-def89.6%
*-commutative89.6%
Simplified89.6%
if 0.00154999999999999995 < phi2 Initial program 78.3%
+-commutative78.3%
associate-*l*78.3%
fma-def78.4%
Simplified78.4%
Final simplification82.9%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (or (<= phi2 -1.2e-8) (not (<= phi2 0.00155)))
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R_m)
(*
R_m
(acos
(*
(cos phi1)
(fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2)))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.2e-8) || !(phi2 <= 0.00155)) {
tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R_m;
} else {
tmp = R_m * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2)))));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -1.2e-8) || !(phi2 <= 0.00155)) tmp = Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R_m); else tmp = Float64(R_m * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[Or[LessEqual[phi2, -1.2e-8], N[Not[LessEqual[phi2, 0.00155]], $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] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R$95$m), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.2 \cdot 10^{-8} \lor \neg \left(\phi_2 \leq 0.00155\right):\\
\;\;\;\;\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_m\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.19999999999999999e-8 or 0.00154999999999999995 < phi2 Initial program 77.0%
if -1.19999999999999999e-8 < phi2 < 0.00154999999999999995Initial program 66.8%
Simplified66.8%
Taylor expanded in phi2 around 0 66.7%
cos-diff89.6%
*-commutative89.6%
*-commutative89.6%
Applied egg-rr89.6%
*-commutative89.6%
fma-udef89.6%
*-commutative89.6%
Simplified89.6%
Final simplification82.9%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (or (<= phi2 -8e-9) (not (<= phi2 0.00155)))
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R_m)
(*
R_m
(acos
(*
(cos phi1)
(fma (sin lambda1) (sin lambda2) (* (cos lambda2) (cos lambda1)))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -8e-9) || !(phi2 <= 0.00155)) {
tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R_m;
} else {
tmp = R_m * acos((cos(phi1) * fma(sin(lambda1), sin(lambda2), (cos(lambda2) * cos(lambda1)))));
}
return R_s * tmp;
}
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -8e-9) || !(phi2 <= 0.00155)) tmp = Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R_m); else tmp = Float64(R_m * acos(Float64(cos(phi1) * fma(sin(lambda1), sin(lambda2), Float64(cos(lambda2) * cos(lambda1)))))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[Or[LessEqual[phi2, -8e-9], N[Not[LessEqual[phi2, 0.00155]], $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] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R$95$m), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq -8 \cdot 10^{-9} \lor \neg \left(\phi_2 \leq 0.00155\right):\\
\;\;\;\;\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_m\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\sin \lambda_1, \sin \lambda_2, \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < -8.0000000000000005e-9 or 0.00154999999999999995 < phi2 Initial program 77.0%
if -8.0000000000000005e-9 < phi2 < 0.00154999999999999995Initial program 66.8%
Simplified66.8%
Taylor expanded in phi2 around 0 66.7%
cos-diff89.6%
*-commutative89.6%
*-commutative89.6%
Applied egg-rr89.6%
+-commutative89.6%
fma-def89.6%
*-commutative89.6%
Simplified89.6%
Final simplification82.9%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (or (<= phi2 -1.55e-7) (not (<= phi2 0.00155)))
(*
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
R_m)
(*
R_m
(acos
(*
(cos phi1)
(+
(* (cos lambda2) (cos lambda1))
(* (sin lambda1) (sin lambda2)))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.55e-7) || !(phi2 <= 0.00155)) {
tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R_m;
} else {
tmp = R_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if ((phi2 <= (-1.55d-7)) .or. (.not. (phi2 <= 0.00155d0))) then
tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r_m
else
tmp = r_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.55e-7) || !(phi2 <= 0.00155)) {
tmp = Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R_m;
} else {
tmp = R_m * Math.acos((Math.cos(phi1) * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda1) * Math.sin(lambda2)))));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if (phi2 <= -1.55e-7) or not (phi2 <= 0.00155): tmp = math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R_m else: tmp = R_m * math.acos((math.cos(phi1) * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda1) * math.sin(lambda2))))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -1.55e-7) || !(phi2 <= 0.00155)) tmp = Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R_m); else tmp = Float64(R_m * acos(Float64(cos(phi1) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda1) * sin(lambda2)))))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if ((phi2 <= -1.55e-7) || ~((phi2 <= 0.00155)))
tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R_m;
else
tmp = R_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[Or[LessEqual[phi2, -1.55e-7], N[Not[LessEqual[phi2, 0.00155]], $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] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R$95$m), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.55 \cdot 10^{-7} \lor \neg \left(\phi_2 \leq 0.00155\right):\\
\;\;\;\;\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_m\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -1.55e-7 or 0.00154999999999999995 < phi2 Initial program 77.0%
if -1.55e-7 < phi2 < 0.00154999999999999995Initial program 66.8%
Simplified66.8%
Taylor expanded in phi2 around 0 66.7%
cos-diff89.6%
+-commutative89.6%
*-commutative89.6%
*-commutative89.6%
Applied egg-rr89.6%
Final simplification82.9%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (or (<= phi2 -0.00037) (not (<= phi2 0.00155)))
(*
R_m
(acos
(+
(* (sin phi1) (sin phi2))
(* (* (cos phi1) (cos phi2)) (cos lambda2)))))
(*
R_m
(acos
(*
(cos phi1)
(+
(* (cos lambda2) (cos lambda1))
(* (sin lambda1) (sin lambda2)))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -0.00037) || !(phi2 <= 0.00155)) {
tmp = R_m * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
} else {
tmp = R_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if ((phi2 <= (-0.00037d0)) .or. (.not. (phi2 <= 0.00155d0))) then
tmp = r_m * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda2))))
else
tmp = r_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -0.00037) || !(phi2 <= 0.00155)) {
tmp = R_m * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos(lambda2))));
} else {
tmp = R_m * Math.acos((Math.cos(phi1) * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda1) * Math.sin(lambda2)))));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if (phi2 <= -0.00037) or not (phi2 <= 0.00155): tmp = R_m * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos(lambda2)))) else: tmp = R_m * math.acos((math.cos(phi1) * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda1) * math.sin(lambda2))))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -0.00037) || !(phi2 <= 0.00155)) tmp = Float64(R_m * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda2))))); else tmp = Float64(R_m * acos(Float64(cos(phi1) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda1) * sin(lambda2)))))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if ((phi2 <= -0.00037) || ~((phi2 <= 0.00155)))
tmp = R_m * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
else
tmp = R_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[Or[LessEqual[phi2, -0.00037], N[Not[LessEqual[phi2, 0.00155]], $MachinePrecision]], N[(R$95$m * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq -0.00037 \lor \neg \left(\phi_2 \leq 0.00155\right):\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < -3.6999999999999999e-4 or 0.00154999999999999995 < phi2 Initial program 77.0%
Taylor expanded in lambda1 around 0 57.4%
cos-neg57.4%
associate-*r*57.4%
*-commutative57.4%
Simplified57.4%
if -3.6999999999999999e-4 < phi2 < 0.00154999999999999995Initial program 66.8%
Simplified66.8%
Taylor expanded in phi2 around 0 66.7%
cos-diff89.6%
+-commutative89.6%
*-commutative89.6%
*-commutative89.6%
Applied egg-rr89.6%
Final simplification72.5%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin phi1) (sin phi2))))
(*
R_s
(if (<= lambda1 -1.45e+156)
(*
R_m
(acos
(*
(cos phi1)
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda1) (sin lambda2))))))
(if (<= lambda1 -2.25e-5)
(* R_m (acos (+ t_0 (* (cos phi1) (* (cos phi2) (cos lambda1))))))
(* R_m (acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos lambda2))))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(phi1) * sin(phi2);
double tmp;
if (lambda1 <= -1.45e+156) {
tmp = R_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))));
} else if (lambda1 <= -2.25e-5) {
tmp = R_m * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))));
} else {
tmp = R_m * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = sin(phi1) * sin(phi2)
if (lambda1 <= (-1.45d+156)) then
tmp = r_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))))
else if (lambda1 <= (-2.25d-5)) then
tmp = r_m * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))))
else
tmp = r_m * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos(lambda2))))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin(phi1) * Math.sin(phi2);
double tmp;
if (lambda1 <= -1.45e+156) {
tmp = R_m * Math.acos((Math.cos(phi1) * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda1) * Math.sin(lambda2)))));
} else if (lambda1 <= -2.25e-5) {
tmp = R_m * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * Math.cos(lambda1)))));
} else {
tmp = R_m * Math.acos((t_0 + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos(lambda2))));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): t_0 = math.sin(phi1) * math.sin(phi2) tmp = 0 if lambda1 <= -1.45e+156: tmp = R_m * math.acos((math.cos(phi1) * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda1) * math.sin(lambda2))))) elif lambda1 <= -2.25e-5: tmp = R_m * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * math.cos(lambda1))))) else: tmp = R_m * math.acos((t_0 + ((math.cos(phi1) * math.cos(phi2)) * math.cos(lambda2)))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(phi1) * sin(phi2)) tmp = 0.0 if (lambda1 <= -1.45e+156) tmp = Float64(R_m * acos(Float64(cos(phi1) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda1) * sin(lambda2)))))); elseif (lambda1 <= -2.25e-5) tmp = Float64(R_m * acos(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * cos(lambda1)))))); else tmp = Float64(R_m * acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda2))))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
t_0 = sin(phi1) * sin(phi2);
tmp = 0.0;
if (lambda1 <= -1.45e+156)
tmp = R_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))));
elseif (lambda1 <= -2.25e-5)
tmp = R_m * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))));
else
tmp = R_m * acos((t_0 + ((cos(phi1) * cos(phi2)) * cos(lambda2))));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, N[(R$95$s * If[LessEqual[lambda1, -1.45e+156], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, -2.25e-5], N[(R$95$m * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \phi_1 \cdot \sin \phi_2\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.45 \cdot 10^{+156}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\
\mathbf{elif}\;\lambda_1 \leq -2.25 \cdot 10^{-5}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(t_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(t_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
\end{array}
if lambda1 < -1.45000000000000005e156Initial program 50.7%
Simplified50.8%
Taylor expanded in phi2 around 0 33.5%
cos-diff54.4%
+-commutative54.4%
*-commutative54.4%
*-commutative54.4%
Applied egg-rr54.4%
if -1.45000000000000005e156 < lambda1 < -2.25000000000000014e-5Initial program 68.1%
Taylor expanded in lambda2 around 0 64.9%
*-commutative64.9%
associate-*r*64.9%
Simplified64.9%
if -2.25000000000000014e-5 < lambda1 Initial program 75.9%
Taylor expanded in lambda1 around 0 59.2%
cos-neg59.2%
associate-*r*59.2%
*-commutative59.2%
Simplified59.2%
Final simplification59.4%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= phi2 0.00155)
(*
R_m
(acos
(*
(cos phi1)
(+ (* (cos lambda2) (cos lambda1)) (* (sin lambda1) (sin lambda2))))))
(* R_m (acos (* (cos phi2) (cos (- lambda2 lambda1))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.00155) {
tmp = R_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))));
} else {
tmp = R_m * acos((cos(phi2) * cos((lambda2 - lambda1))));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 0.00155d0) then
tmp = r_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))))
else
tmp = r_m * acos((cos(phi2) * cos((lambda2 - lambda1))))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.00155) {
tmp = R_m * Math.acos((Math.cos(phi1) * ((Math.cos(lambda2) * Math.cos(lambda1)) + (Math.sin(lambda1) * Math.sin(lambda2)))));
} else {
tmp = R_m * Math.acos((Math.cos(phi2) * Math.cos((lambda2 - lambda1))));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.00155: tmp = R_m * math.acos((math.cos(phi1) * ((math.cos(lambda2) * math.cos(lambda1)) + (math.sin(lambda1) * math.sin(lambda2))))) else: tmp = R_m * math.acos((math.cos(phi2) * math.cos((lambda2 - lambda1)))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.00155) tmp = Float64(R_m * acos(Float64(cos(phi1) * Float64(Float64(cos(lambda2) * cos(lambda1)) + Float64(sin(lambda1) * sin(lambda2)))))); else tmp = Float64(R_m * acos(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 0.00155)
tmp = R_m * acos((cos(phi1) * ((cos(lambda2) * cos(lambda1)) + (sin(lambda1) * sin(lambda2)))));
else
tmp = R_m * acos((cos(phi2) * cos((lambda2 - lambda1))));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi2, 0.00155], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.00155:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\end{array}
\end{array}
if phi2 < 0.00154999999999999995Initial program 69.9%
Simplified69.9%
Taylor expanded in phi2 around 0 49.8%
cos-diff64.7%
+-commutative64.7%
*-commutative64.7%
*-commutative64.7%
Applied egg-rr64.7%
if 0.00154999999999999995 < phi2 Initial program 78.3%
Simplified78.3%
Taylor expanded in phi1 around 0 47.0%
Final simplification59.8%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(*
R_s
(if (<= phi1 -1.3e+27)
(* R_m (acos (* (cos phi1) (log1p (expm1 t_0)))))
(* R_m (acos (* (cos phi2) t_0)))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -1.3e+27) {
tmp = R_m * acos((cos(phi1) * log1p(expm1(t_0))));
} else {
tmp = R_m * acos((cos(phi2) * t_0));
}
return R_s * tmp;
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -1.3e+27) {
tmp = R_m * Math.acos((Math.cos(phi1) * Math.log1p(Math.expm1(t_0))));
} else {
tmp = R_m * Math.acos((Math.cos(phi2) * t_0));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi1 <= -1.3e+27: tmp = R_m * math.acos((math.cos(phi1) * math.log1p(math.expm1(t_0)))) else: tmp = R_m * math.acos((math.cos(phi2) * t_0)) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi1 <= -1.3e+27) tmp = Float64(R_m * acos(Float64(cos(phi1) * log1p(expm1(t_0))))); else tmp = Float64(R_m * acos(Float64(cos(phi2) * t_0))); end return Float64(R_s * tmp) end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, N[(R$95$s * If[LessEqual[phi1, -1.3e+27], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Log[1 + N[(Exp[t$95$0] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.3 \cdot 10^{+27}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(t_0\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
\end{array}
if phi1 < -1.30000000000000004e27Initial program 72.2%
Simplified72.2%
Taylor expanded in phi2 around 0 44.1%
log1p-expm1-u44.2%
Applied egg-rr44.2%
if -1.30000000000000004e27 < phi1 Initial program 72.3%
Simplified72.3%
Taylor expanded in phi1 around 0 50.9%
Final simplification49.1%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(*
R_s
(if (<= phi1 -1.3e+27)
(* R_m (- (/ PI 2.0) (asin (* (cos phi1) t_0))))
(* R_m (acos (* (cos phi2) t_0)))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -1.3e+27) {
tmp = R_m * ((((double) M_PI) / 2.0) - asin((cos(phi1) * t_0)));
} else {
tmp = R_m * acos((cos(phi2) * t_0));
}
return R_s * tmp;
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -1.3e+27) {
tmp = R_m * ((Math.PI / 2.0) - Math.asin((Math.cos(phi1) * t_0)));
} else {
tmp = R_m * Math.acos((Math.cos(phi2) * t_0));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi1 <= -1.3e+27: tmp = R_m * ((math.pi / 2.0) - math.asin((math.cos(phi1) * t_0))) else: tmp = R_m * math.acos((math.cos(phi2) * t_0)) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi1 <= -1.3e+27) tmp = Float64(R_m * Float64(Float64(pi / 2.0) - asin(Float64(cos(phi1) * t_0)))); else tmp = Float64(R_m * acos(Float64(cos(phi2) * t_0))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi1 <= -1.3e+27)
tmp = R_m * ((pi / 2.0) - asin((cos(phi1) * t_0)));
else
tmp = R_m * acos((cos(phi2) * t_0));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, N[(R$95$s * If[LessEqual[phi1, -1.3e+27], N[(R$95$m * N[(N[(Pi / 2.0), $MachinePrecision] - N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.3 \cdot 10^{+27}:\\
\;\;\;\;R_m \cdot \left(\frac{\pi}{2} - \sin^{-1} \left(\cos \phi_1 \cdot t_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
\end{array}
if phi1 < -1.30000000000000004e27Initial program 72.2%
Simplified72.2%
Taylor expanded in phi2 around 0 44.1%
acos-asin44.1%
Applied egg-rr44.1%
if -1.30000000000000004e27 < phi1 Initial program 72.3%
Simplified72.3%
Taylor expanded in phi1 around 0 50.9%
Final simplification49.0%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= phi2 0.014)
(* R_m (acos (* (cos phi1) (cos (- lambda2 lambda1)))))
(* R_m (acos (cos (- phi1 phi2)))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.014) {
tmp = R_m * acos((cos(phi1) * cos((lambda2 - lambda1))));
} else {
tmp = R_m * acos(cos((phi1 - phi2)));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 0.014d0) then
tmp = r_m * acos((cos(phi1) * cos((lambda2 - lambda1))))
else
tmp = r_m * acos(cos((phi1 - phi2)))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.014) {
tmp = R_m * Math.acos((Math.cos(phi1) * Math.cos((lambda2 - lambda1))));
} else {
tmp = R_m * Math.acos(Math.cos((phi1 - phi2)));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.014: tmp = R_m * math.acos((math.cos(phi1) * math.cos((lambda2 - lambda1)))) else: tmp = R_m * math.acos(math.cos((phi1 - phi2))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.014) tmp = Float64(R_m * acos(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1))))); else tmp = Float64(R_m * acos(cos(Float64(phi1 - phi2)))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 0.014)
tmp = R_m * acos((cos(phi1) * cos((lambda2 - lambda1))));
else
tmp = R_m * acos(cos((phi1 - phi2)));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi2, 0.014], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[Cos[N[(phi1 - phi2), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.014:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \left(\phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 0.0140000000000000003Initial program 69.9%
Simplified69.9%
Taylor expanded in phi2 around 0 49.8%
if 0.0140000000000000003 < phi2 Initial program 78.3%
Simplified78.3%
Taylor expanded in lambda2 around 0 60.8%
cos-neg60.8%
Simplified60.8%
Taylor expanded in lambda1 around 0 39.7%
expm1-log1p-u39.6%
expm1-udef39.6%
cos-diff29.3%
Applied egg-rr29.3%
expm1-def29.3%
expm1-log1p29.4%
Simplified29.4%
Final simplification44.1%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (- lambda2 lambda1))))
(*
R_s
(if (<= phi1 -1.3e+27)
(* R_m (acos (* (cos phi1) t_0)))
(* R_m (acos (* (cos phi2) t_0)))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -1.3e+27) {
tmp = R_m * acos((cos(phi1) * t_0));
} else {
tmp = R_m * acos((cos(phi2) * t_0));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
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.3d+27)) then
tmp = r_m * acos((cos(phi1) * t_0))
else
tmp = r_m * acos((cos(phi2) * t_0))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((lambda2 - lambda1));
double tmp;
if (phi1 <= -1.3e+27) {
tmp = R_m * Math.acos((Math.cos(phi1) * t_0));
} else {
tmp = R_m * Math.acos((Math.cos(phi2) * t_0));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): t_0 = math.cos((lambda2 - lambda1)) tmp = 0 if phi1 <= -1.3e+27: tmp = R_m * math.acos((math.cos(phi1) * t_0)) else: tmp = R_m * math.acos((math.cos(phi2) * t_0)) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(lambda2 - lambda1)) tmp = 0.0 if (phi1 <= -1.3e+27) tmp = Float64(R_m * acos(Float64(cos(phi1) * t_0))); else tmp = Float64(R_m * acos(Float64(cos(phi2) * t_0))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
t_0 = cos((lambda2 - lambda1));
tmp = 0.0;
if (phi1 <= -1.3e+27)
tmp = R_m * acos((cos(phi1) * t_0));
else
tmp = R_m * acos((cos(phi2) * t_0));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, N[(R$95$s * If[LessEqual[phi1, -1.3e+27], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\lambda_2 - \lambda_1\right)\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.3 \cdot 10^{+27}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot t_0\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_2 \cdot t_0\right)\\
\end{array}
\end{array}
\end{array}
if phi1 < -1.30000000000000004e27Initial program 72.2%
Simplified72.2%
Taylor expanded in phi2 around 0 44.1%
if -1.30000000000000004e27 < phi1 Initial program 72.3%
Simplified72.3%
Taylor expanded in phi1 around 0 50.9%
Final simplification49.1%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= lambda2 0.07)
(* R_m (acos (* (cos phi1) (cos lambda1))))
(* R_m (acos (cos lambda2))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.07) {
tmp = R_m * acos((cos(phi1) * cos(lambda1)));
} else {
tmp = R_m * acos(cos(lambda2));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
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.07d0) then
tmp = r_m * acos((cos(phi1) * cos(lambda1)))
else
tmp = r_m * acos(cos(lambda2))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.07) {
tmp = R_m * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else {
tmp = R_m * Math.acos(Math.cos(lambda2));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 0.07: tmp = R_m * math.acos((math.cos(phi1) * math.cos(lambda1))) else: tmp = R_m * math.acos(math.cos(lambda2)) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 0.07) tmp = Float64(R_m * acos(Float64(cos(phi1) * cos(lambda1)))); else tmp = Float64(R_m * acos(cos(lambda2))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 0.07)
tmp = R_m * acos((cos(phi1) * cos(lambda1)));
else
tmp = R_m * acos(cos(lambda2));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[lambda2, 0.07], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 0.07:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \lambda_2\\
\end{array}
\end{array}
if lambda2 < 0.070000000000000007Initial program 77.0%
Simplified77.0%
Taylor expanded in phi2 around 0 42.1%
Taylor expanded in lambda2 around 0 34.4%
cos-neg34.4%
Simplified34.4%
if 0.070000000000000007 < lambda2 Initial program 57.4%
Simplified57.4%
Taylor expanded in phi2 around 0 37.6%
Taylor expanded in phi1 around 0 26.9%
Taylor expanded in lambda1 around 0 27.4%
Final simplification32.7%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= lambda1 -0.0036)
(* R_m (acos (* (cos phi1) (cos lambda1))))
(* R_m (acos (* (cos phi1) (cos lambda2)))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -0.0036) {
tmp = R_m * acos((cos(phi1) * cos(lambda1)));
} else {
tmp = R_m * acos((cos(phi1) * cos(lambda2)));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-0.0036d0)) then
tmp = r_m * acos((cos(phi1) * cos(lambda1)))
else
tmp = r_m * acos((cos(phi1) * cos(lambda2)))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -0.0036) {
tmp = R_m * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
} else {
tmp = R_m * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -0.0036: tmp = R_m * math.acos((math.cos(phi1) * math.cos(lambda1))) else: tmp = R_m * math.acos((math.cos(phi1) * math.cos(lambda2))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -0.0036) tmp = Float64(R_m * acos(Float64(cos(phi1) * cos(lambda1)))); else tmp = Float64(R_m * acos(Float64(cos(phi1) * cos(lambda2)))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -0.0036)
tmp = R_m * acos((cos(phi1) * cos(lambda1)));
else
tmp = R_m * acos((cos(phi1) * cos(lambda2)));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[lambda1, -0.0036], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -0.0036:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\
\end{array}
\end{array}
if lambda1 < -0.0035999999999999999Initial program 59.1%
Simplified59.1%
Taylor expanded in phi2 around 0 37.7%
Taylor expanded in lambda2 around 0 37.9%
cos-neg37.9%
Simplified37.9%
if -0.0035999999999999999 < lambda1 Initial program 76.0%
Simplified76.0%
Taylor expanded in phi2 around 0 41.9%
Taylor expanded in lambda1 around 0 32.3%
*-commutative32.3%
Simplified32.3%
Final simplification33.5%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= phi1 -0.00032)
(* R_m (- (/ PI 2.0) (asin (cos (- phi1 phi2)))))
(* R_m (acos (cos (- lambda2 lambda1)))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.00032) {
tmp = R_m * ((((double) M_PI) / 2.0) - asin(cos((phi1 - phi2))));
} else {
tmp = R_m * acos(cos((lambda2 - lambda1)));
}
return R_s * tmp;
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.00032) {
tmp = R_m * ((Math.PI / 2.0) - Math.asin(Math.cos((phi1 - phi2))));
} else {
tmp = R_m * Math.acos(Math.cos((lambda2 - lambda1)));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.00032: tmp = R_m * ((math.pi / 2.0) - math.asin(math.cos((phi1 - phi2)))) else: tmp = R_m * math.acos(math.cos((lambda2 - lambda1))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.00032) tmp = Float64(R_m * Float64(Float64(pi / 2.0) - asin(cos(Float64(phi1 - phi2))))); else tmp = Float64(R_m * acos(cos(Float64(lambda2 - lambda1)))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -0.00032)
tmp = R_m * ((pi / 2.0) - asin(cos((phi1 - phi2))));
else
tmp = R_m * acos(cos((lambda2 - lambda1)));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi1, -0.00032], N[(R$95$m * N[(N[(Pi / 2.0), $MachinePrecision] - N[ArcSin[N[Cos[N[(phi1 - phi2), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.00032:\\
\;\;\;\;R_m \cdot \left(\frac{\pi}{2} - \sin^{-1} \cos \left(\phi_1 - \phi_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -3.20000000000000026e-4Initial program 74.0%
Simplified73.9%
Taylor expanded in lambda2 around 0 55.0%
cos-neg55.0%
Simplified55.0%
Taylor expanded in lambda1 around 0 35.4%
acos-asin35.5%
cos-diff26.6%
Applied egg-rr26.6%
if -3.20000000000000026e-4 < phi1 Initial program 71.5%
Simplified71.5%
Taylor expanded in phi2 around 0 40.3%
Taylor expanded in phi1 around 0 30.5%
Final simplification29.3%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= lambda2 3.4e-227)
(* R_m (acos (cos lambda1)))
(if (<= lambda2 8.5e-8)
(* R_m (acos (cos phi1)))
(* R_m (acos (cos lambda2)))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 3.4e-227) {
tmp = R_m * acos(cos(lambda1));
} else if (lambda2 <= 8.5e-8) {
tmp = R_m * acos(cos(phi1));
} else {
tmp = R_m * acos(cos(lambda2));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
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 <= 3.4d-227) then
tmp = r_m * acos(cos(lambda1))
else if (lambda2 <= 8.5d-8) then
tmp = r_m * acos(cos(phi1))
else
tmp = r_m * acos(cos(lambda2))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 3.4e-227) {
tmp = R_m * Math.acos(Math.cos(lambda1));
} else if (lambda2 <= 8.5e-8) {
tmp = R_m * Math.acos(Math.cos(phi1));
} else {
tmp = R_m * Math.acos(Math.cos(lambda2));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 3.4e-227: tmp = R_m * math.acos(math.cos(lambda1)) elif lambda2 <= 8.5e-8: tmp = R_m * math.acos(math.cos(phi1)) else: tmp = R_m * math.acos(math.cos(lambda2)) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 3.4e-227) tmp = Float64(R_m * acos(cos(lambda1))); elseif (lambda2 <= 8.5e-8) tmp = Float64(R_m * acos(cos(phi1))); else tmp = Float64(R_m * acos(cos(lambda2))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 3.4e-227)
tmp = R_m * acos(cos(lambda1));
elseif (lambda2 <= 8.5e-8)
tmp = R_m * acos(cos(phi1));
else
tmp = R_m * acos(cos(lambda2));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[lambda2, 3.4e-227], N[(R$95$m * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 8.5e-8], N[(R$95$m * N[ArcCos[N[Cos[phi1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 3.4 \cdot 10^{-227}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{elif}\;\lambda_2 \leq 8.5 \cdot 10^{-8}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \phi_1\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \lambda_2\\
\end{array}
\end{array}
if lambda2 < 3.39999999999999979e-227Initial program 73.1%
Simplified73.2%
Taylor expanded in phi2 around 0 42.3%
Taylor expanded in phi1 around 0 29.0%
Taylor expanded in lambda2 around 0 21.0%
cos-neg54.9%
Simplified21.0%
if 3.39999999999999979e-227 < lambda2 < 8.49999999999999935e-8Initial program 90.5%
Simplified90.5%
Taylor expanded in lambda2 around 0 90.5%
cos-neg90.5%
Simplified90.5%
Taylor expanded in lambda1 around 0 51.1%
Taylor expanded in phi2 around 0 23.1%
if 8.49999999999999935e-8 < lambda2 Initial program 57.1%
Simplified57.0%
Taylor expanded in phi2 around 0 37.3%
Taylor expanded in phi1 around 0 26.7%
Taylor expanded in lambda1 around 0 26.9%
Final simplification22.9%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= phi1 -1020000.0)
(* R_m (acos (cos phi1)))
(* R_m (acos (cos (- lambda2 lambda1)))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1020000.0) {
tmp = R_m * acos(cos(phi1));
} else {
tmp = R_m * acos(cos((lambda2 - lambda1)));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
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 <= (-1020000.0d0)) then
tmp = r_m * acos(cos(phi1))
else
tmp = r_m * acos(cos((lambda2 - lambda1)))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1020000.0) {
tmp = R_m * Math.acos(Math.cos(phi1));
} else {
tmp = R_m * Math.acos(Math.cos((lambda2 - lambda1)));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1020000.0: tmp = R_m * math.acos(math.cos(phi1)) else: tmp = R_m * math.acos(math.cos((lambda2 - lambda1))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1020000.0) tmp = Float64(R_m * acos(cos(phi1))); else tmp = Float64(R_m * acos(cos(Float64(lambda2 - lambda1)))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -1020000.0)
tmp = R_m * acos(cos(phi1));
else
tmp = R_m * acos(cos((lambda2 - lambda1)));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi1, -1020000.0], N[(R$95$m * N[ArcCos[N[Cos[phi1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1020000:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \phi_1\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -1.02e6Initial program 74.0%
Simplified73.9%
Taylor expanded in lambda2 around 0 55.0%
cos-neg55.0%
Simplified55.0%
Taylor expanded in lambda1 around 0 35.4%
Taylor expanded in phi2 around 0 26.6%
if -1.02e6 < phi1 Initial program 71.5%
Simplified71.5%
Taylor expanded in phi2 around 0 40.3%
Taylor expanded in phi1 around 0 30.5%
Final simplification29.3%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= phi1 -2.3e-5)
(* R_m (acos (cos (- phi1 phi2))))
(* R_m (acos (cos (- lambda2 lambda1)))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.3e-5) {
tmp = R_m * acos(cos((phi1 - phi2)));
} else {
tmp = R_m * acos(cos((lambda2 - lambda1)));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
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 <= (-2.3d-5)) then
tmp = r_m * acos(cos((phi1 - phi2)))
else
tmp = r_m * acos(cos((lambda2 - lambda1)))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.3e-5) {
tmp = R_m * Math.acos(Math.cos((phi1 - phi2)));
} else {
tmp = R_m * Math.acos(Math.cos((lambda2 - lambda1)));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -2.3e-5: tmp = R_m * math.acos(math.cos((phi1 - phi2))) else: tmp = R_m * math.acos(math.cos((lambda2 - lambda1))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -2.3e-5) tmp = Float64(R_m * acos(cos(Float64(phi1 - phi2)))); else tmp = Float64(R_m * acos(cos(Float64(lambda2 - lambda1)))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -2.3e-5)
tmp = R_m * acos(cos((phi1 - phi2)));
else
tmp = R_m * acos(cos((lambda2 - lambda1)));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi1, -2.3e-5], N[(R$95$m * N[ArcCos[N[Cos[N[(phi1 - phi2), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_1 \leq -2.3 \cdot 10^{-5}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \left(\phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -2.3e-5Initial program 74.0%
Simplified73.9%
Taylor expanded in lambda2 around 0 55.0%
cos-neg55.0%
Simplified55.0%
Taylor expanded in lambda1 around 0 35.4%
expm1-log1p-u35.4%
expm1-udef35.4%
cos-diff26.5%
Applied egg-rr26.5%
expm1-def26.6%
expm1-log1p26.6%
Simplified26.6%
if -2.3e-5 < phi1 Initial program 71.5%
Simplified71.5%
Taylor expanded in phi2 around 0 40.3%
Taylor expanded in phi1 around 0 30.5%
Final simplification29.3%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= lambda1 -1.05e-8)
(* R_m (acos (cos lambda1)))
(fabs (* R_m (- phi1 phi2))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.05e-8) {
tmp = R_m * acos(cos(lambda1));
} else {
tmp = fabs((R_m * (phi1 - phi2)));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-1.05d-8)) then
tmp = r_m * acos(cos(lambda1))
else
tmp = abs((r_m * (phi1 - phi2)))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.05e-8) {
tmp = R_m * Math.acos(Math.cos(lambda1));
} else {
tmp = Math.abs((R_m * (phi1 - phi2)));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.05e-8: tmp = R_m * math.acos(math.cos(lambda1)) else: tmp = math.fabs((R_m * (phi1 - phi2))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.05e-8) tmp = Float64(R_m * acos(cos(lambda1))); else tmp = abs(Float64(R_m * Float64(phi1 - phi2))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -1.05e-8)
tmp = R_m * acos(cos(lambda1));
else
tmp = abs((R_m * (phi1 - phi2)));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[lambda1, -1.05e-8], N[(R$95$m * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Abs[N[(R$95$m * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.05 \cdot 10^{-8}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{else}:\\
\;\;\;\;\left|R_m \cdot \left(\phi_1 - \phi_2\right)\right|\\
\end{array}
\end{array}
if lambda1 < -1.04999999999999997e-8Initial program 59.7%
Simplified59.7%
Taylor expanded in phi2 around 0 38.7%
Taylor expanded in phi1 around 0 31.4%
Taylor expanded in lambda2 around 0 29.8%
cos-neg57.9%
Simplified29.8%
if -1.04999999999999997e-8 < lambda1 Initial program 75.9%
Simplified75.9%
Taylor expanded in lambda2 around 0 51.4%
cos-neg51.4%
Simplified51.4%
Taylor expanded in lambda1 around 0 34.0%
add-sqr-sqrt33.9%
pow233.9%
cos-diff27.5%
Applied egg-rr27.5%
rem-square-sqrt13.2%
sqrt-unprod9.0%
pow29.0%
unpow29.0%
add-sqr-sqrt9.0%
acos-cos-s4.1%
Applied egg-rr4.1%
unpow24.1%
rem-sqrt-square4.7%
Simplified4.7%
Final simplification10.4%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= lambda2 0.02)
(* R_m (acos (cos lambda1)))
(* R_m (acos (cos lambda2))))))R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.02) {
tmp = R_m * acos(cos(lambda1));
} else {
tmp = R_m * acos(cos(lambda2));
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
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.02d0) then
tmp = r_m * acos(cos(lambda1))
else
tmp = r_m * acos(cos(lambda2))
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 0.02) {
tmp = R_m * Math.acos(Math.cos(lambda1));
} else {
tmp = R_m * Math.acos(Math.cos(lambda2));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 0.02: tmp = R_m * math.acos(math.cos(lambda1)) else: tmp = R_m * math.acos(math.cos(lambda2)) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 0.02) tmp = Float64(R_m * acos(cos(lambda1))); else tmp = Float64(R_m * acos(cos(lambda2))); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 0.02)
tmp = R_m * acos(cos(lambda1));
else
tmp = R_m * acos(cos(lambda2));
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[lambda2, 0.02], N[(R$95$m * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 0.02:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \lambda_1\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \cos^{-1} \cos \lambda_2\\
\end{array}
\end{array}
if lambda2 < 0.0200000000000000004Initial program 77.0%
Simplified77.0%
Taylor expanded in phi2 around 0 42.1%
Taylor expanded in phi1 around 0 26.5%
Taylor expanded in lambda2 around 0 20.5%
cos-neg63.3%
Simplified20.5%
if 0.0200000000000000004 < lambda2 Initial program 57.4%
Simplified57.4%
Taylor expanded in phi2 around 0 37.6%
Taylor expanded in phi1 around 0 26.9%
Taylor expanded in lambda1 around 0 27.4%
Final simplification22.1%
R_m = (fabs.f64 R) R_s = (copysign.f64 1 R) NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R_s R_m lambda1 lambda2 phi1 phi2) :precision binary64 (* R_s (fabs (* R_m (- phi1 phi2)))))
R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * fabs((R_m * (phi1 - phi2)));
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r_s * abs((r_m * (phi1 - phi2)))
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * Math.abs((R_m * (phi1 - phi2)));
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): return R_s * math.fabs((R_m * (phi1 - phi2)))
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) return Float64(R_s * abs(Float64(R_m * Float64(phi1 - phi2)))) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = R_s * abs((R_m * (phi1 - phi2)));
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * N[Abs[N[(R$95$m * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \left|R_m \cdot \left(\phi_1 - \phi_2\right)\right|
\end{array}
Initial program 72.2%
Simplified72.2%
Taylor expanded in lambda2 around 0 52.8%
cos-neg52.8%
Simplified52.8%
Taylor expanded in lambda1 around 0 30.3%
add-sqr-sqrt30.3%
pow230.3%
cos-diff25.1%
Applied egg-rr25.1%
rem-square-sqrt12.3%
sqrt-unprod8.8%
pow28.8%
unpow28.8%
add-sqr-sqrt8.8%
acos-cos-s4.1%
Applied egg-rr4.1%
unpow24.1%
rem-sqrt-square4.6%
Simplified4.6%
Final simplification4.6%
R_m = (fabs.f64 R) R_s = (copysign.f64 1 R) NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R_s R_m lambda1 lambda2 phi1 phi2) :precision binary64 (* R_s (if (<= lambda2 2.8e-87) (* lambda1 (- R_m)) (* lambda2 R_m))))
R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.8e-87) {
tmp = lambda1 * -R_m;
} else {
tmp = lambda2 * R_m;
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 2.8d-87) then
tmp = lambda1 * -r_m
else
tmp = lambda2 * r_m
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.8e-87) {
tmp = lambda1 * -R_m;
} else {
tmp = lambda2 * R_m;
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 2.8e-87: tmp = lambda1 * -R_m else: tmp = lambda2 * R_m return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2.8e-87) tmp = Float64(lambda1 * Float64(-R_m)); else tmp = Float64(lambda2 * R_m); end return Float64(R_s * tmp) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda2 <= 2.8e-87)
tmp = lambda1 * -R_m;
else
tmp = lambda2 * R_m;
end
tmp_2 = R_s * tmp;
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[lambda2, 2.8e-87], N[(lambda1 * (-R$95$m)), $MachinePrecision], N[(lambda2 * R$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2.8 \cdot 10^{-87}:\\
\;\;\;\;\lambda_1 \cdot \left(-R_m\right)\\
\mathbf{else}:\\
\;\;\;\;\lambda_2 \cdot R_m\\
\end{array}
\end{array}
if lambda2 < 2.8000000000000001e-87Initial program 75.9%
Simplified75.9%
Taylor expanded in phi2 around 0 41.5%
Taylor expanded in phi1 around 0 26.6%
Taylor expanded in lambda2 around 0 4.5%
mul-1-neg4.5%
*-commutative4.5%
distribute-rgt-neg-in4.5%
Simplified4.5%
if 2.8000000000000001e-87 < lambda2 Initial program 64.7%
Simplified64.7%
Taylor expanded in phi2 around 0 39.9%
Taylor expanded in phi1 around 0 26.4%
Taylor expanded in lambda2 around inf 8.7%
*-commutative8.7%
Simplified8.7%
Final simplification5.9%
R_m = (fabs.f64 R) R_s = (copysign.f64 1 R) NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R_s R_m lambda1 lambda2 phi1 phi2) :precision binary64 (* R_s (* R_m (- lambda2 lambda1))))
R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (R_m * (lambda2 - lambda1));
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r_s * (r_m * (lambda2 - lambda1))
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (R_m * (lambda2 - lambda1));
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): return R_s * (R_m * (lambda2 - lambda1))
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) return Float64(R_s * Float64(R_m * Float64(lambda2 - lambda1))) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = R_s * (R_m * (lambda2 - lambda1));
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * N[(R$95$m * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \left(R_m \cdot \left(\lambda_2 - \lambda_1\right)\right)
\end{array}
Initial program 72.2%
Simplified72.2%
Taylor expanded in phi2 around 0 41.0%
Taylor expanded in phi1 around 0 26.6%
Taylor expanded in lambda2 around 0 4.8%
neg-mul-14.8%
sub-neg4.8%
Simplified4.8%
Final simplification4.8%
R_m = (fabs.f64 R) R_s = (copysign.f64 1 R) NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R_s R_m lambda1 lambda2 phi1 phi2) :precision binary64 (* R_s (* lambda2 R_m)))
R_m = fabs(R);
R_s = copysign(1.0, R);
assert(R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (lambda2 * R_m);
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r_s * (lambda2 * r_m)
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
assert R_m < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (lambda2 * R_m);
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) [R_m, lambda1, lambda2, phi1, phi2] = sort([R_m, lambda1, lambda2, phi1, phi2]) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): return R_s * (lambda2 * R_m)
R_m = abs(R) R_s = copysign(1.0, R) R_m, lambda1, lambda2, phi1, phi2 = sort([R_m, lambda1, lambda2, phi1, phi2]) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) return Float64(R_s * Float64(lambda2 * R_m)) end
R_m = abs(R);
R_s = sign(R) * abs(1.0);
R_m, lambda1, lambda2, phi1, phi2 = num2cell(sort([R_m, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R_s, R_m, lambda1, lambda2, phi1, phi2)
tmp = R_s * (lambda2 * R_m);
end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: R_m, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * N[(lambda2 * R$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
[R_m, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R_m, lambda1, lambda2, phi1, phi2])\\
\\
R_s \cdot \left(\lambda_2 \cdot R_m\right)
\end{array}
Initial program 72.2%
Simplified72.2%
Taylor expanded in phi2 around 0 41.0%
Taylor expanded in phi1 around 0 26.6%
Taylor expanded in lambda2 around inf 4.9%
*-commutative4.9%
Simplified4.9%
Final simplification4.9%
herbie shell --seed 2024017
(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))