
(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 11 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
(*
(- lambda1 lambda2)
(cbrt
(pow
(fma
(cos (* 0.5 phi2))
(cos (* 0.5 phi1))
(* (sin (* 0.5 phi2)) (- (sin (* 0.5 phi1)))))
3.0)))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cbrt(pow(fma(cos((0.5 * phi2)), cos((0.5 * phi1)), (sin((0.5 * phi2)) * -sin((0.5 * phi1)))), 3.0))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cbrt((fma(cos(Float64(0.5 * phi2)), cos(Float64(0.5 * phi1)), Float64(sin(Float64(0.5 * phi2)) * Float64(-sin(Float64(0.5 * phi1))))) ^ 3.0))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Power[N[Power[N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * (-N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], 3.0], $MachinePrecision], 1/3], $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 \sqrt[3]{{\left(\mathsf{fma}\left(\cos \left(0.5 \cdot \phi_2\right), \cos \left(0.5 \cdot \phi_1\right), \sin \left(0.5 \cdot \phi_2\right) \cdot \left(-\sin \left(0.5 \cdot \phi_1\right)\right)\right)\right)}^{3}}, \phi_1 - \phi_2\right)
\end{array}
Initial program 60.3%
hypot-def96.6%
Simplified96.6%
add-cbrt-cube96.5%
pow396.5%
div-inv96.5%
metadata-eval96.5%
Applied egg-rr96.5%
*-commutative96.5%
+-commutative96.5%
distribute-lft-in96.5%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
fma-neg99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
distribute-rgt-neg-in99.8%
Simplified99.8%
Final simplification99.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(cbrt
(pow
(-
(* (cos (* 0.5 phi2)) (cos (* 0.5 phi1)))
(* (sin (* 0.5 phi2)) (sin (* 0.5 phi1))))
3.0)))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cbrt(pow(((cos((0.5 * phi2)) * cos((0.5 * phi1))) - (sin((0.5 * phi2)) * sin((0.5 * phi1)))), 3.0))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cbrt(Math.pow(((Math.cos((0.5 * phi2)) * Math.cos((0.5 * phi1))) - (Math.sin((0.5 * phi2)) * Math.sin((0.5 * phi1)))), 3.0))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cbrt((Float64(Float64(cos(Float64(0.5 * phi2)) * cos(Float64(0.5 * phi1))) - Float64(sin(Float64(0.5 * phi2)) * sin(Float64(0.5 * phi1)))) ^ 3.0))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Power[N[Power[N[(N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 3.0], $MachinePrecision], 1/3], $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 \sqrt[3]{{\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right) - \sin \left(0.5 \cdot \phi_2\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\right)}^{3}}, \phi_1 - \phi_2\right)
\end{array}
Initial program 60.3%
hypot-def96.6%
Simplified96.6%
add-cbrt-cube96.5%
pow396.5%
div-inv96.5%
metadata-eval96.5%
Applied egg-rr96.5%
*-commutative96.5%
+-commutative96.5%
distribute-lft-in96.5%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
Final simplification99.8%
(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 60.3%
hypot-def96.6%
Simplified96.6%
Final simplification96.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 6e+111) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (hypot phi2 (* lambda1 (cos (* 0.5 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 6e+111) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * hypot(phi2, (lambda1 * cos((0.5 * phi2))));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 6e+111) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * Math.hypot(phi2, (lambda1 * Math.cos((0.5 * phi2))));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 6e+111: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * math.hypot(phi2, (lambda1 * math.cos((0.5 * phi2)))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 6e+111) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 * cos(Float64(0.5 * phi2))))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 6e+111) tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = R * hypot(phi2, (lambda1 * cos((0.5 * phi2)))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 6e+111], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 6 \cdot 10^{+111}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right)\\
\end{array}
\end{array}
if phi2 < 6e111Initial program 62.6%
hypot-def97.5%
Simplified97.5%
Taylor expanded in phi2 around 0 54.3%
*-commutative54.3%
+-commutative54.3%
unpow254.3%
unpow254.3%
unpow254.3%
unswap-sqr54.3%
hypot-def76.3%
Simplified76.3%
if 6e111 < phi2 Initial program 49.8%
hypot-def92.7%
Simplified92.7%
Taylor expanded in phi1 around 0 49.6%
*-commutative49.6%
unpow249.6%
unpow249.6%
unpow249.6%
unswap-sqr49.6%
hypot-def83.0%
Simplified83.0%
flip--67.8%
associate-*r/67.8%
*-commutative67.8%
Applied egg-rr67.8%
associate-/l*67.8%
*-commutative67.8%
+-commutative67.8%
Simplified67.8%
Taylor expanded in lambda2 around 0 75.6%
Final simplification76.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.36) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (hypot phi2 (* (- lambda1 lambda2) (cos (* 0.5 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.36) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((0.5 * phi2))));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.36) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * Math.hypot(phi2, ((lambda1 - lambda2) * Math.cos((0.5 * phi2))));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.36: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * math.hypot(phi2, ((lambda1 - lambda2) * math.cos((0.5 * phi2)))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.36) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * hypot(phi2, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi2))))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -0.36) tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((0.5 * phi2)))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.36], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.36:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_2\right)\right)\\
\end{array}
\end{array}
if phi1 < -0.35999999999999999Initial program 59.3%
hypot-def92.9%
Simplified92.9%
Taylor expanded in phi2 around 0 56.1%
*-commutative56.1%
+-commutative56.1%
unpow256.1%
unpow256.1%
unpow256.1%
unswap-sqr56.1%
hypot-def78.6%
Simplified78.6%
if -0.35999999999999999 < phi1 Initial program 60.6%
hypot-def97.7%
Simplified97.7%
Taylor expanded in phi1 around 0 54.5%
*-commutative54.5%
unpow254.5%
unpow254.5%
unpow254.5%
unswap-sqr54.5%
hypot-def81.9%
Simplified81.9%
Final simplification81.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -35000000000000.0) (* R (- phi2 phi1)) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -35000000000000.0) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -35000000000000.0) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -35000000000000.0: tmp = R * (phi2 - phi1) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -35000000000000.0) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -35000000000000.0) tmp = R * (phi2 - phi1); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -35000000000000.0], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -35000000000000:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -3.5e13Initial program 56.5%
hypot-def92.0%
Simplified92.0%
Taylor expanded in phi1 around -inf 61.2%
*-commutative61.2%
associate-*r*61.2%
distribute-rgt-out61.2%
mul-1-neg61.2%
Simplified61.2%
if -3.5e13 < phi1 Initial program 61.2%
hypot-def97.7%
Simplified97.7%
Taylor expanded in phi1 around 0 54.1%
*-commutative54.1%
unpow254.1%
unpow254.1%
unpow254.1%
unswap-sqr54.1%
hypot-def81.2%
Simplified81.2%
Taylor expanded in phi2 around 0 74.6%
Final simplification71.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.405) (* R (- phi2 phi1)) (if (<= phi1 6e-212) (- (* R lambda2) (* R lambda1)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.405) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= 6e-212) {
tmp = (R * lambda2) - (R * 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 (phi1 <= (-0.405d0)) then
tmp = r * (phi2 - phi1)
else if (phi1 <= 6d-212) then
tmp = (r * lambda2) - (r * 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 (phi1 <= -0.405) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= 6e-212) {
tmp = (R * lambda2) - (R * lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.405: tmp = R * (phi2 - phi1) elif phi1 <= 6e-212: tmp = (R * lambda2) - (R * lambda1) else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.405) tmp = Float64(R * Float64(phi2 - phi1)); elseif (phi1 <= 6e-212) tmp = Float64(Float64(R * lambda2) - Float64(R * lambda1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -0.405) tmp = R * (phi2 - phi1); elseif (phi1 <= 6e-212) tmp = (R * lambda2) - (R * lambda1); else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.405], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 6e-212], N[(N[(R * lambda2), $MachinePrecision] - N[(R * lambda1), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.405:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq 6 \cdot 10^{-212}:\\
\;\;\;\;R \cdot \lambda_2 - R \cdot \lambda_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -0.40500000000000003Initial program 59.3%
hypot-def92.9%
Simplified92.9%
Taylor expanded in phi1 around -inf 58.7%
*-commutative58.7%
associate-*r*58.7%
distribute-rgt-out58.7%
mul-1-neg58.7%
Simplified58.7%
if -0.40500000000000003 < phi1 < 6.0000000000000005e-212Initial program 63.0%
hypot-def99.6%
Simplified99.6%
Taylor expanded in phi1 around 0 63.0%
*-commutative63.0%
unpow263.0%
unpow263.0%
unpow263.0%
unswap-sqr63.0%
hypot-def98.5%
Simplified98.5%
Taylor expanded in lambda1 around -inf 38.0%
mul-1-neg38.0%
unsub-neg38.0%
associate-*r*38.0%
Simplified38.0%
Taylor expanded in phi2 around 0 34.9%
if 6.0000000000000005e-212 < phi1 Initial program 58.7%
hypot-def96.2%
Simplified96.2%
Taylor expanded in phi2 around inf 20.9%
*-commutative20.9%
Simplified20.9%
Final simplification34.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.6e+38) (* phi1 (- R)) (if (<= phi1 6e-212) (* R (- lambda2 lambda1)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.6e+38) {
tmp = phi1 * -R;
} else if (phi1 <= 6e-212) {
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 (phi1 <= (-1.6d+38)) then
tmp = phi1 * -r
else if (phi1 <= 6d-212) 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 (phi1 <= -1.6e+38) {
tmp = phi1 * -R;
} else if (phi1 <= 6e-212) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.6e+38: tmp = phi1 * -R elif phi1 <= 6e-212: tmp = R * (lambda2 - lambda1) else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.6e+38) tmp = Float64(phi1 * Float64(-R)); elseif (phi1 <= 6e-212) 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 (phi1 <= -1.6e+38) tmp = phi1 * -R; elseif (phi1 <= 6e-212) tmp = R * (lambda2 - lambda1); else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.6e+38], N[(phi1 * (-R)), $MachinePrecision], If[LessEqual[phi1, 6e-212], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.6 \cdot 10^{+38}:\\
\;\;\;\;\phi_1 \cdot \left(-R\right)\\
\mathbf{elif}\;\phi_1 \leq 6 \cdot 10^{-212}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -1.59999999999999993e38Initial program 58.9%
hypot-def94.2%
Simplified94.2%
Taylor expanded in phi1 around -inf 68.3%
associate-*r*68.3%
mul-1-neg68.3%
Simplified68.3%
if -1.59999999999999993e38 < phi1 < 6.0000000000000005e-212Initial program 62.7%
hypot-def98.1%
Simplified98.1%
Taylor expanded in phi1 around 0 58.4%
*-commutative58.4%
unpow258.4%
unpow258.4%
unpow258.4%
unswap-sqr58.4%
hypot-def91.4%
Simplified91.4%
Taylor expanded in lambda1 around -inf 34.8%
mul-1-neg34.8%
unsub-neg34.8%
associate-*r*34.8%
Simplified34.8%
Taylor expanded in phi2 around 0 31.9%
*-commutative31.9%
distribute-lft-out--31.9%
Simplified31.9%
if 6.0000000000000005e-212 < phi1 Initial program 58.7%
hypot-def96.2%
Simplified96.2%
Taylor expanded in phi2 around inf 20.9%
*-commutative20.9%
Simplified20.9%
Final simplification33.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.5) (* R (- phi2 phi1)) (if (<= phi1 6e-212) (* R (- lambda2 lambda1)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.5) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= 6e-212) {
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 (phi1 <= (-0.5d0)) then
tmp = r * (phi2 - phi1)
else if (phi1 <= 6d-212) 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 (phi1 <= -0.5) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= 6e-212) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.5: tmp = R * (phi2 - phi1) elif phi1 <= 6e-212: tmp = R * (lambda2 - lambda1) else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.5) tmp = Float64(R * Float64(phi2 - phi1)); elseif (phi1 <= 6e-212) 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 (phi1 <= -0.5) tmp = R * (phi2 - phi1); elseif (phi1 <= 6e-212) tmp = R * (lambda2 - lambda1); else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.5], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 6e-212], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.5:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq 6 \cdot 10^{-212}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -0.5Initial program 59.3%
hypot-def92.9%
Simplified92.9%
Taylor expanded in phi1 around -inf 58.7%
*-commutative58.7%
associate-*r*58.7%
distribute-rgt-out58.7%
mul-1-neg58.7%
Simplified58.7%
if -0.5 < phi1 < 6.0000000000000005e-212Initial program 63.0%
hypot-def99.6%
Simplified99.6%
Taylor expanded in phi1 around 0 63.0%
*-commutative63.0%
unpow263.0%
unpow263.0%
unpow263.0%
unswap-sqr63.0%
hypot-def98.5%
Simplified98.5%
Taylor expanded in lambda1 around -inf 38.0%
mul-1-neg38.0%
unsub-neg38.0%
associate-*r*38.0%
Simplified38.0%
Taylor expanded in phi2 around 0 34.9%
*-commutative34.9%
distribute-lft-out--34.9%
Simplified34.9%
if 6.0000000000000005e-212 < phi1 Initial program 58.7%
hypot-def96.2%
Simplified96.2%
Taylor expanded in phi2 around inf 20.9%
*-commutative20.9%
Simplified20.9%
Final simplification34.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.72) (* phi1 (- R)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.72) {
tmp = phi1 * -R;
} 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 (phi1 <= (-0.72d0)) then
tmp = phi1 * -r
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 (phi1 <= -0.72) {
tmp = phi1 * -R;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.72: tmp = phi1 * -R else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.72) tmp = Float64(phi1 * Float64(-R)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -0.72) tmp = phi1 * -R; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.72], N[(phi1 * (-R)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.72:\\
\;\;\;\;\phi_1 \cdot \left(-R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -0.71999999999999997Initial program 59.3%
hypot-def92.9%
Simplified92.9%
Taylor expanded in phi1 around -inf 58.0%
associate-*r*58.0%
mul-1-neg58.0%
Simplified58.0%
if -0.71999999999999997 < phi1 Initial program 60.6%
hypot-def97.7%
Simplified97.7%
Taylor expanded in phi2 around inf 19.0%
*-commutative19.0%
Simplified19.0%
Final simplification27.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R phi2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * 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
code = r * phi2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * phi2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * phi2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * phi2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * phi2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \phi_2
\end{array}
Initial program 60.3%
hypot-def96.6%
Simplified96.6%
Taylor expanded in phi2 around inf 16.9%
*-commutative16.9%
Simplified16.9%
Final simplification16.9%
herbie shell --seed 2023174
(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))))))