
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t_0 \cdot t_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t_0 \cdot t_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(-
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))
(expm1 (log1p (* (sin (* 0.5 phi1)) (sin (* phi2 0.5))))))
(- lambda1 lambda2))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - expm1(log1p((sin((0.5 * phi1)) * sin((phi2 * 0.5)))))) * (lambda1 - lambda2)), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot((((Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5))) - Math.expm1(Math.log1p((Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5)))))) * (lambda1 - lambda2)), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))) - math.expm1(math.log1p((math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5)))))) * (lambda1 - lambda2)), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) - expm1(log1p(Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5)))))) * Float64(lambda1 - lambda2)), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(Exp[N[Log[1 + N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right) - \mathsf{expm1}\left(\mathsf{log1p}\left(\sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right)\right)\right)\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 58.8%
hypot-def95.2%
Simplified95.2%
add-cube-cbrt94.8%
pow394.8%
*-commutative94.8%
div-inv94.8%
metadata-eval94.8%
Applied egg-rr94.8%
*-commutative94.8%
+-commutative94.8%
distribute-rgt-in94.8%
*-commutative94.8%
cos-sum99.4%
*-commutative99.4%
*-commutative99.4%
Applied egg-rr99.4%
rem-cube-cbrt99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
expm1-log1p-u99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin (* 0.5 phi1)) (sin (* phi2 0.5))))
(t_1 (* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))))
(if (<= lambda1 -1.14e-57)
(* R (hypot (* lambda1 (- t_1 t_0)) (- phi1 phi2)))
(* R (hypot (* lambda2 (- t_0 t_1)) (- phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin((0.5 * phi1)) * sin((phi2 * 0.5));
double t_1 = cos((0.5 * phi1)) * cos((phi2 * 0.5));
double tmp;
if (lambda1 <= -1.14e-57) {
tmp = R * hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5));
double t_1 = Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5));
double tmp;
if (lambda1 <= -1.14e-57) {
tmp = R * Math.hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5)) t_1 = math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5)) tmp = 0 if lambda1 <= -1.14e-57: tmp = R * math.hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5))) t_1 = Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) tmp = 0.0 if (lambda1 <= -1.14e-57) tmp = Float64(R * hypot(Float64(lambda1 * Float64(t_1 - t_0)), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(t_0 - t_1)), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = sin((0.5 * phi1)) * sin((phi2 * 0.5)); t_1 = cos((0.5 * phi1)) * cos((phi2 * 0.5)); tmp = 0.0; if (lambda1 <= -1.14e-57) tmp = R * hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2)); else tmp = R * hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -1.14e-57], N[(R * N[Sqrt[N[(lambda1 * N[(t$95$1 - t$95$0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * N[(t$95$0 - t$95$1), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right)\\
t_1 := \cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)\\
\mathbf{if}\;\lambda_1 \leq -1.14 \cdot 10^{-57}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \left(t_1 - t_0\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(t_0 - t_1\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -1.14000000000000006e-57Initial program 54.8%
hypot-def94.7%
Simplified94.7%
add-cube-cbrt94.3%
pow394.4%
*-commutative94.4%
div-inv94.4%
metadata-eval94.4%
Applied egg-rr94.4%
*-commutative94.4%
+-commutative94.4%
distribute-rgt-in94.4%
*-commutative94.4%
cos-sum99.5%
*-commutative99.5%
*-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in lambda2 around 0 88.6%
pow-base-188.6%
*-lft-identity88.6%
*-commutative88.6%
*-commutative88.6%
Simplified88.6%
if -1.14000000000000006e-57 < lambda1 Initial program 60.4%
hypot-def95.4%
Simplified95.4%
add-cube-cbrt95.0%
pow395.0%
*-commutative95.0%
div-inv95.0%
metadata-eval95.0%
Applied egg-rr95.0%
*-commutative95.0%
+-commutative95.0%
distribute-rgt-in95.0%
*-commutative95.0%
cos-sum99.3%
*-commutative99.3%
*-commutative99.3%
Applied egg-rr99.3%
Taylor expanded in lambda1 around 0 86.5%
mul-1-neg86.5%
pow-base-186.5%
*-lft-identity86.5%
*-commutative86.5%
distribute-rgt-neg-in86.5%
*-commutative86.5%
Simplified86.5%
Final simplification87.1%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(-
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))
(* (sin (* 0.5 phi1)) (sin (* phi2 0.5)))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * ((Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5))) - (Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * ((math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))) - (math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * Float64(Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) - Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5))))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right) - \sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 58.8%
hypot-def95.2%
Simplified95.2%
add-cube-cbrt94.8%
pow394.8%
*-commutative94.8%
div-inv94.8%
metadata-eval94.8%
Applied egg-rr94.8%
*-commutative94.8%
+-commutative94.8%
distribute-rgt-in94.8%
*-commutative94.8%
cos-sum99.4%
*-commutative99.4%
*-commutative99.4%
Applied egg-rr99.4%
rem-cube-cbrt99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (cos (* 0.5 (+ phi2 phi1))))) (* R (hypot (- (* lambda1 t_0) (* lambda2 t_0)) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((0.5 * (phi2 + phi1)));
return R * hypot(((lambda1 * t_0) - (lambda2 * t_0)), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((0.5 * (phi2 + phi1)));
return R * Math.hypot(((lambda1 * t_0) - (lambda2 * t_0)), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((0.5 * (phi2 + phi1))) return R * math.hypot(((lambda1 * t_0) - (lambda2 * t_0)), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(0.5 * Float64(phi2 + phi1))) return Float64(R * hypot(Float64(Float64(lambda1 * t_0) - Float64(lambda2 * t_0)), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = cos((0.5 * (phi2 + phi1))); tmp = R * hypot(((lambda1 * t_0) - (lambda2 * t_0)), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(lambda1 * t$95$0), $MachinePrecision] - N[(lambda2 * t$95$0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\\
R \cdot \mathsf{hypot}\left(\lambda_1 \cdot t_0 - \lambda_2 \cdot t_0, \phi_1 - \phi_2\right)
\end{array}
\end{array}
Initial program 58.8%
hypot-def95.2%
Simplified95.2%
*-commutative95.2%
sub-neg95.2%
distribute-lft-in95.2%
div-inv95.2%
metadata-eval95.2%
div-inv95.2%
metadata-eval95.2%
Applied egg-rr95.2%
Final simplification95.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1e-142) (* R (hypot phi1 (* (cos (* 0.5 phi1)) (- lambda1 lambda2)))) (* R (hypot (* (- lambda1 lambda2) (cos (* phi2 0.5))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1e-142) {
tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1e-142) {
tmp = R * Math.hypot(phi1, (Math.cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1e-142: tmp = R * math.hypot(phi1, (math.cos((0.5 * phi1)) * (lambda1 - lambda2))) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi2 * 0.5))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1e-142) tmp = Float64(R * hypot(phi1, Float64(cos(Float64(0.5 * phi1)) * Float64(lambda1 - lambda2)))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1e-142) tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2))); else tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1e-142], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 10^{-142}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \cos \left(0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1e-142Initial program 61.9%
hypot-def95.5%
Simplified95.5%
Taylor expanded in phi2 around 0 52.7%
*-commutative52.7%
+-commutative52.7%
unpow252.7%
unpow252.7%
unpow252.7%
unswap-sqr52.7%
hypot-def76.0%
Simplified76.0%
if 1e-142 < phi2 Initial program 52.9%
hypot-def94.7%
Simplified94.7%
Taylor expanded in phi1 around 0 92.8%
Final simplification81.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_2 + \phi_1}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 58.8%
hypot-def95.2%
Simplified95.2%
Final simplification95.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.25e-142) (* R (hypot phi1 (* (cos (* 0.5 phi1)) (- lambda1 lambda2)))) (* R (hypot (- lambda1 lambda2) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.25e-142) {
tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.25e-142) {
tmp = R * Math.hypot(phi1, (Math.cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.25e-142: tmp = R * math.hypot(phi1, (math.cos((0.5 * phi1)) * (lambda1 - lambda2))) else: tmp = R * math.hypot((lambda1 - lambda2), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.25e-142) tmp = Float64(R * hypot(phi1, Float64(cos(Float64(0.5 * phi1)) * Float64(lambda1 - lambda2)))); else tmp = Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.25e-142) tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2))); else tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.25e-142], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.25 \cdot 10^{-142}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \cos \left(0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.2500000000000001e-142Initial program 61.9%
hypot-def95.5%
Simplified95.5%
Taylor expanded in phi2 around 0 52.7%
*-commutative52.7%
+-commutative52.7%
unpow252.7%
unpow252.7%
unpow252.7%
unswap-sqr52.7%
hypot-def76.0%
Simplified76.0%
if 1.2500000000000001e-142 < phi2 Initial program 52.9%
hypot-def94.7%
Simplified94.7%
Taylor expanded in phi1 around 0 92.8%
Taylor expanded in phi2 around 0 86.6%
Final simplification79.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 5.4e+14) (* R (hypot phi1 (* (cos (* 0.5 phi1)) (- lambda1 lambda2)))) (* R (hypot phi2 (* (- lambda1 lambda2) (cos (* phi2 0.5)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.4e+14) {
tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.4e+14) {
tmp = R * Math.hypot(phi1, (Math.cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * Math.hypot(phi2, ((lambda1 - lambda2) * Math.cos((phi2 * 0.5))));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 5.4e+14: tmp = R * math.hypot(phi1, (math.cos((0.5 * phi1)) * (lambda1 - lambda2))) else: tmp = R * math.hypot(phi2, ((lambda1 - lambda2) * math.cos((phi2 * 0.5)))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 5.4e+14) tmp = Float64(R * hypot(phi1, Float64(cos(Float64(0.5 * phi1)) * Float64(lambda1 - lambda2)))); else tmp = Float64(R * hypot(phi2, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 5.4e+14) tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2))); else tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5)))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5.4e+14], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 5.4 \cdot 10^{+14}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \cos \left(0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if phi2 < 5.4e14Initial program 62.8%
hypot-def95.5%
Simplified95.5%
Taylor expanded in phi2 around 0 53.9%
*-commutative53.9%
+-commutative53.9%
unpow253.9%
unpow253.9%
unpow253.9%
unswap-sqr53.9%
hypot-def77.3%
Simplified77.3%
if 5.4e14 < phi2 Initial program 48.5%
hypot-def94.5%
Simplified94.5%
Taylor expanded in phi1 around 0 46.0%
*-commutative46.0%
unpow246.0%
unpow246.0%
unpow246.0%
unswap-sqr46.0%
hypot-def78.3%
Simplified78.3%
Final simplification77.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 8.5e+167) (* R (hypot lambda1 (- phi1 phi2))) (* R (- lambda2 lambda1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 8.5e+167) {
tmp = R * hypot(lambda1, (phi1 - phi2));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 8.5e+167) {
tmp = R * Math.hypot(lambda1, (phi1 - phi2));
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 8.5e+167: tmp = R * math.hypot(lambda1, (phi1 - phi2)) else: tmp = R * (lambda2 - lambda1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 8.5e+167) tmp = Float64(R * hypot(lambda1, Float64(phi1 - phi2))); else tmp = Float64(R * Float64(lambda2 - lambda1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 8.5e+167) tmp = R * hypot(lambda1, (phi1 - phi2)); else tmp = R * (lambda2 - lambda1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 8.5e+167], N[(R * N[Sqrt[lambda1 ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 8.5 \cdot 10^{+167}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if lambda2 < 8.50000000000000007e167Initial program 61.6%
hypot-def97.0%
Simplified97.0%
Taylor expanded in phi1 around 0 91.5%
Taylor expanded in phi2 around 0 88.2%
Taylor expanded in lambda2 around 0 54.5%
*-commutative54.5%
unpow254.5%
unpow254.5%
hypot-def81.0%
Simplified81.0%
if 8.50000000000000007e167 < lambda2 Initial program 35.6%
hypot-def80.2%
Simplified80.2%
Taylor expanded in phi1 around 0 76.8%
Taylor expanded in phi2 around 0 73.2%
Taylor expanded in lambda1 around -inf 58.9%
*-commutative58.9%
neg-mul-158.9%
sub-neg58.9%
distribute-rgt-out--62.4%
Simplified62.4%
Final simplification79.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.16e+35) (* R (hypot phi1 (- lambda1 lambda2))) (* R (hypot lambda1 (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.16e+35) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * hypot(lambda1, (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.16e+35) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * Math.hypot(lambda1, (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.16e+35: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * math.hypot(lambda1, (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.16e+35) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * hypot(lambda1, Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.16e+35) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * hypot(lambda1, (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.16e+35], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[lambda1 ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.16 \cdot 10^{+35}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1, \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.1600000000000001e35Initial program 62.6%
hypot-def95.1%
Simplified95.1%
Taylor expanded in phi1 around 0 88.0%
Taylor expanded in phi2 around 0 52.6%
*-commutative52.6%
unpow252.6%
unpow252.6%
hypot-def69.9%
Simplified69.9%
if 1.1600000000000001e35 < phi2 Initial program 48.3%
hypot-def95.4%
Simplified95.4%
Taylor expanded in phi1 around 0 95.2%
Taylor expanded in phi2 around 0 88.0%
Taylor expanded in lambda2 around 0 45.8%
*-commutative45.8%
unpow245.8%
unpow245.8%
hypot-def86.1%
Simplified86.1%
Final simplification74.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (- lambda1 lambda2) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((lambda1 - lambda2), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((lambda1 - lambda2), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)
\end{array}
Initial program 58.8%
hypot-def95.2%
Simplified95.2%
Taylor expanded in phi1 around 0 89.9%
Taylor expanded in phi2 around 0 86.6%
Final simplification86.6%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* R (- phi1))))
(if (<= phi2 -8.6e-169)
t_0
(if (<= phi2 -1e-292)
(* R lambda2)
(if (<= phi2 1.55e-298)
t_0
(if (<= phi2 1.12e-234)
(* R (- lambda1))
(if (<= phi2 5e-225)
(* R lambda2)
(if (<= phi2 3e+31) t_0 (* R phi2)))))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * -phi1;
double tmp;
if (phi2 <= -8.6e-169) {
tmp = t_0;
} else if (phi2 <= -1e-292) {
tmp = R * lambda2;
} else if (phi2 <= 1.55e-298) {
tmp = t_0;
} else if (phi2 <= 1.12e-234) {
tmp = R * -lambda1;
} else if (phi2 <= 5e-225) {
tmp = R * lambda2;
} else if (phi2 <= 3e+31) {
tmp = t_0;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = r * -phi1
if (phi2 <= (-8.6d-169)) then
tmp = t_0
else if (phi2 <= (-1d-292)) then
tmp = r * lambda2
else if (phi2 <= 1.55d-298) then
tmp = t_0
else if (phi2 <= 1.12d-234) then
tmp = r * -lambda1
else if (phi2 <= 5d-225) then
tmp = r * lambda2
else if (phi2 <= 3d+31) then
tmp = t_0
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * -phi1;
double tmp;
if (phi2 <= -8.6e-169) {
tmp = t_0;
} else if (phi2 <= -1e-292) {
tmp = R * lambda2;
} else if (phi2 <= 1.55e-298) {
tmp = t_0;
} else if (phi2 <= 1.12e-234) {
tmp = R * -lambda1;
} else if (phi2 <= 5e-225) {
tmp = R * lambda2;
} else if (phi2 <= 3e+31) {
tmp = t_0;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = R * -phi1 tmp = 0 if phi2 <= -8.6e-169: tmp = t_0 elif phi2 <= -1e-292: tmp = R * lambda2 elif phi2 <= 1.55e-298: tmp = t_0 elif phi2 <= 1.12e-234: tmp = R * -lambda1 elif phi2 <= 5e-225: tmp = R * lambda2 elif phi2 <= 3e+31: tmp = t_0 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * Float64(-phi1)) tmp = 0.0 if (phi2 <= -8.6e-169) tmp = t_0; elseif (phi2 <= -1e-292) tmp = Float64(R * lambda2); elseif (phi2 <= 1.55e-298) tmp = t_0; elseif (phi2 <= 1.12e-234) tmp = Float64(R * Float64(-lambda1)); elseif (phi2 <= 5e-225) tmp = Float64(R * lambda2); elseif (phi2 <= 3e+31) tmp = t_0; else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = R * -phi1; tmp = 0.0; if (phi2 <= -8.6e-169) tmp = t_0; elseif (phi2 <= -1e-292) tmp = R * lambda2; elseif (phi2 <= 1.55e-298) tmp = t_0; elseif (phi2 <= 1.12e-234) tmp = R * -lambda1; elseif (phi2 <= 5e-225) tmp = R * lambda2; elseif (phi2 <= 3e+31) tmp = t_0; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * (-phi1)), $MachinePrecision]}, If[LessEqual[phi2, -8.6e-169], t$95$0, If[LessEqual[phi2, -1e-292], N[(R * lambda2), $MachinePrecision], If[LessEqual[phi2, 1.55e-298], t$95$0, If[LessEqual[phi2, 1.12e-234], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[phi2, 5e-225], N[(R * lambda2), $MachinePrecision], If[LessEqual[phi2, 3e+31], t$95$0, N[(R * phi2), $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := R \cdot \left(-\phi_1\right)\\
\mathbf{if}\;\phi_2 \leq -8.6 \cdot 10^{-169}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\phi_2 \leq -1 \cdot 10^{-292}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{elif}\;\phi_2 \leq 1.55 \cdot 10^{-298}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\phi_2 \leq 1.12 \cdot 10^{-234}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\phi_2 \leq 5 \cdot 10^{-225}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{elif}\;\phi_2 \leq 3 \cdot 10^{+31}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -8.59999999999999967e-169 or -1.0000000000000001e-292 < phi2 < 1.5500000000000001e-298 or 5.0000000000000001e-225 < phi2 < 2.99999999999999989e31Initial program 64.3%
hypot-def93.9%
Simplified93.9%
Taylor expanded in phi1 around -inf 19.5%
associate-*r*19.5%
mul-1-neg19.5%
Simplified19.5%
if -8.59999999999999967e-169 < phi2 < -1.0000000000000001e-292 or 1.11999999999999998e-234 < phi2 < 5.0000000000000001e-225Initial program 50.7%
hypot-def99.8%
Simplified99.8%
Taylor expanded in phi1 around 0 80.4%
Taylor expanded in phi2 around 0 80.4%
Taylor expanded in lambda2 around inf 21.0%
if 1.5500000000000001e-298 < phi2 < 1.11999999999999998e-234Initial program 68.1%
hypot-def99.7%
Simplified99.7%
Taylor expanded in phi1 around 0 80.4%
Taylor expanded in phi2 around 0 80.4%
Taylor expanded in lambda1 around -inf 27.0%
*-commutative27.0%
neg-mul-127.0%
Simplified27.0%
if 2.99999999999999989e31 < phi2 Initial program 48.3%
hypot-def95.4%
Simplified95.4%
Taylor expanded in phi2 around inf 65.4%
*-commutative65.4%
Simplified65.4%
Final simplification32.2%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 7.4e-162)
(* R lambda2)
(if (<= phi2 2.6e-47)
(* R (- lambda1))
(if (<= phi2 1.16e+35) (* R lambda2) (* R phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.4e-162) {
tmp = R * lambda2;
} else if (phi2 <= 2.6e-47) {
tmp = R * -lambda1;
} else if (phi2 <= 1.16e+35) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 7.4d-162) then
tmp = r * lambda2
else if (phi2 <= 2.6d-47) then
tmp = r * -lambda1
else if (phi2 <= 1.16d+35) then
tmp = r * lambda2
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.4e-162) {
tmp = R * lambda2;
} else if (phi2 <= 2.6e-47) {
tmp = R * -lambda1;
} else if (phi2 <= 1.16e+35) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 7.4e-162: tmp = R * lambda2 elif phi2 <= 2.6e-47: tmp = R * -lambda1 elif phi2 <= 1.16e+35: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 7.4e-162) tmp = Float64(R * lambda2); elseif (phi2 <= 2.6e-47) tmp = Float64(R * Float64(-lambda1)); elseif (phi2 <= 1.16e+35) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 7.4e-162) tmp = R * lambda2; elseif (phi2 <= 2.6e-47) tmp = R * -lambda1; elseif (phi2 <= 1.16e+35) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 7.4e-162], N[(R * lambda2), $MachinePrecision], If[LessEqual[phi2, 2.6e-47], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[phi2, 1.16e+35], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 7.4 \cdot 10^{-162}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{elif}\;\phi_2 \leq 2.6 \cdot 10^{-47}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\phi_2 \leq 1.16 \cdot 10^{+35}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 7.4000000000000003e-162 or 2.6e-47 < phi2 < 1.1600000000000001e35Initial program 61.3%
hypot-def94.7%
Simplified94.7%
Taylor expanded in phi1 around 0 87.3%
Taylor expanded in phi2 around 0 85.2%
Taylor expanded in lambda2 around inf 17.8%
if 7.4000000000000003e-162 < phi2 < 2.6e-47Initial program 75.9%
hypot-def99.9%
Simplified99.9%
Taylor expanded in phi1 around 0 95.6%
Taylor expanded in phi2 around 0 95.6%
Taylor expanded in lambda1 around -inf 18.1%
*-commutative18.1%
neg-mul-118.1%
Simplified18.1%
if 1.1600000000000001e35 < phi2 Initial program 48.3%
hypot-def95.4%
Simplified95.4%
Taylor expanded in phi2 around inf 65.4%
*-commutative65.4%
Simplified65.4%
Final simplification30.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -7.5e-152) (* R (- phi1)) (if (<= phi2 1.1e+37) (* R (- lambda2 lambda1)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -7.5e-152) {
tmp = R * -phi1;
} else if (phi2 <= 1.1e+37) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= (-7.5d-152)) then
tmp = r * -phi1
else if (phi2 <= 1.1d+37) then
tmp = r * (lambda2 - lambda1)
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -7.5e-152) {
tmp = R * -phi1;
} else if (phi2 <= 1.1e+37) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -7.5e-152: tmp = R * -phi1 elif phi2 <= 1.1e+37: tmp = R * (lambda2 - lambda1) else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -7.5e-152) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 1.1e+37) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= -7.5e-152) tmp = R * -phi1; elseif (phi2 <= 1.1e+37) tmp = R * (lambda2 - lambda1); else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -7.5e-152], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 1.1e+37], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -7.5 \cdot 10^{-152}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 1.1 \cdot 10^{+37}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -7.5e-152Initial program 63.3%
hypot-def92.7%
Simplified92.7%
Taylor expanded in phi1 around -inf 15.6%
associate-*r*15.6%
mul-1-neg15.6%
Simplified15.6%
if -7.5e-152 < phi2 < 1.1e37Initial program 61.8%
hypot-def98.0%
Simplified98.0%
Taylor expanded in phi1 around 0 84.8%
Taylor expanded in phi2 around 0 84.0%
Taylor expanded in lambda1 around -inf 33.2%
*-commutative33.2%
neg-mul-133.2%
sub-neg33.2%
distribute-rgt-out--33.2%
Simplified33.2%
if 1.1e37 < phi2 Initial program 48.3%
hypot-def95.4%
Simplified95.4%
Taylor expanded in phi2 around inf 65.4%
*-commutative65.4%
Simplified65.4%
Final simplification34.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -9e-157) (* R (- phi1)) (if (<= phi2 9.5e-38) (* R (- lambda2 lambda1)) (* R (- phi2 phi1)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -9e-157) {
tmp = R * -phi1;
} else if (phi2 <= 9.5e-38) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= (-9d-157)) then
tmp = r * -phi1
else if (phi2 <= 9.5d-38) then
tmp = r * (lambda2 - lambda1)
else
tmp = r * (phi2 - phi1)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -9e-157) {
tmp = R * -phi1;
} else if (phi2 <= 9.5e-38) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -9e-157: tmp = R * -phi1 elif phi2 <= 9.5e-38: tmp = R * (lambda2 - lambda1) else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -9e-157) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 9.5e-38) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= -9e-157) tmp = R * -phi1; elseif (phi2 <= 9.5e-38) tmp = R * (lambda2 - lambda1); else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -9e-157], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 9.5e-38], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -9 \cdot 10^{-157}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 9.5 \cdot 10^{-38}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < -8.99999999999999997e-157Initial program 62.7%
hypot-def92.7%
Simplified92.7%
Taylor expanded in phi1 around -inf 15.4%
associate-*r*15.4%
mul-1-neg15.4%
Simplified15.4%
if -8.99999999999999997e-157 < phi2 < 9.5000000000000009e-38Initial program 61.7%
hypot-def99.8%
Simplified99.8%
Taylor expanded in phi1 around 0 86.0%
Taylor expanded in phi2 around 0 86.0%
Taylor expanded in lambda1 around -inf 33.2%
*-commutative33.2%
neg-mul-133.2%
sub-neg33.2%
distribute-rgt-out--33.2%
Simplified33.2%
if 9.5000000000000009e-38 < phi2 Initial program 50.6%
hypot-def93.8%
Simplified93.8%
Taylor expanded in phi1 around 0 92.6%
Taylor expanded in phi2 around inf 61.5%
+-commutative61.5%
mul-1-neg61.5%
unsub-neg61.5%
Simplified61.5%
Final simplification34.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.16e+35) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.16e+35) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 1.16d+35) then
tmp = r * lambda2
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.16e+35) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.16e+35: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.16e+35) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.16e+35) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.16e+35], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.16 \cdot 10^{+35}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 1.1600000000000001e35Initial program 62.6%
hypot-def95.1%
Simplified95.1%
Taylor expanded in phi1 around 0 88.0%
Taylor expanded in phi2 around 0 86.0%
Taylor expanded in lambda2 around inf 17.6%
if 1.1600000000000001e35 < phi2 Initial program 48.3%
hypot-def95.4%
Simplified95.4%
Taylor expanded in phi2 around inf 65.4%
*-commutative65.4%
Simplified65.4%
Final simplification30.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * lambda2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * lambda2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * lambda2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \lambda_2
\end{array}
Initial program 58.8%
hypot-def95.2%
Simplified95.2%
Taylor expanded in phi1 around 0 89.9%
Taylor expanded in phi2 around 0 86.6%
Taylor expanded in lambda2 around inf 14.8%
Final simplification14.8%
herbie shell --seed 2023189
(FPCore (R lambda1 lambda2 phi1 phi2)
:name "Equirectangular approximation to distance on a great circle"
:precision binary64
(* R (sqrt (+ (* (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))) (* (- phi1 phi2) (- phi1 phi2))))))