
(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 13 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 (* 0.5 phi2)))
(* (sin (* 0.5 phi2)) (sin (* 0.5 phi1))))
(- lambda1 lambda2))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((cos((0.5 * phi1)) * cos((0.5 * phi2))) - (sin((0.5 * phi2)) * sin((0.5 * phi1)))) * (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((0.5 * phi2))) - (Math.sin((0.5 * phi2)) * Math.sin((0.5 * phi1)))) * (lambda1 - lambda2)), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((math.cos((0.5 * phi1)) * math.cos((0.5 * phi2))) - (math.sin((0.5 * phi2)) * math.sin((0.5 * phi1)))) * (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(0.5 * phi2))) - Float64(sin(Float64(0.5 * phi2)) * sin(Float64(0.5 * phi1)))) * Float64(lambda1 - lambda2)), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot((((cos((0.5 * phi1)) * cos((0.5 * phi2))) - (sin((0.5 * phi2)) * sin((0.5 * phi1)))) * (lambda1 - lambda2)), (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[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $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(0.5 \cdot \phi_2\right) - \sin \left(0.5 \cdot \phi_2\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 55.1%
hypot-def97.1%
Simplified97.1%
add-log-exp97.0%
div-inv97.0%
metadata-eval97.0%
Applied egg-rr97.0%
*-commutative97.0%
+-commutative97.0%
distribute-rgt-in97.0%
cos-sum99.8%
Applied egg-rr99.8%
Taylor expanded in phi2 around inf 99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 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(((phi1 + phi2) / 2.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $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_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 55.1%
hypot-def97.1%
Simplified97.1%
Final simplification97.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.35e-5) (* R (hypot phi1 (* (cos (* 0.5 phi1)) (- lambda1 lambda2)))) (* R (hypot phi2 (* (cos (* 0.5 phi2)) lambda1)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.35e-5) {
tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * hypot(phi2, (cos((0.5 * phi2)) * lambda1));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.35e-5) {
tmp = R * Math.hypot(phi1, (Math.cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * Math.hypot(phi2, (Math.cos((0.5 * phi2)) * lambda1));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.35e-5: tmp = R * math.hypot(phi1, (math.cos((0.5 * phi1)) * (lambda1 - lambda2))) else: tmp = R * math.hypot(phi2, (math.cos((0.5 * phi2)) * lambda1)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.35e-5) tmp = Float64(R * hypot(phi1, Float64(cos(Float64(0.5 * phi1)) * Float64(lambda1 - lambda2)))); else tmp = Float64(R * hypot(phi2, Float64(cos(Float64(0.5 * phi2)) * lambda1))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.35e-5) tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2))); else tmp = R * hypot(phi2, (cos((0.5 * phi2)) * lambda1)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.35e-5], 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[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * lambda1), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.35 \cdot 10^{-5}:\\
\;\;\;\;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, \cos \left(0.5 \cdot \phi_2\right) \cdot \lambda_1\right)\\
\end{array}
\end{array}
if phi2 < 1.3499999999999999e-5Initial program 58.8%
hypot-def98.1%
Simplified98.1%
Taylor expanded in phi2 around 0 47.8%
*-commutative47.8%
+-commutative47.8%
unpow247.8%
unpow247.8%
unpow247.8%
unswap-sqr47.8%
hypot-def74.2%
Simplified74.2%
if 1.3499999999999999e-5 < phi2 Initial program 45.9%
hypot-def94.5%
Simplified94.5%
Taylor expanded in phi1 around 0 43.4%
*-commutative43.4%
unpow243.4%
unpow243.4%
unpow243.4%
unswap-sqr42.1%
hypot-def77.6%
Simplified77.6%
Taylor expanded in lambda1 around inf 69.2%
Final simplification72.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 5.7e-28) (* R (hypot phi1 (* (cos (* 0.5 phi1)) (- lambda1 lambda2)))) (* R (hypot phi2 (* (cos (* 0.5 phi2)) (- lambda1 lambda2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.7e-28) {
tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * hypot(phi2, (cos((0.5 * phi2)) * (lambda1 - lambda2)));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.7e-28) {
tmp = R * Math.hypot(phi1, (Math.cos((0.5 * phi1)) * (lambda1 - lambda2)));
} else {
tmp = R * Math.hypot(phi2, (Math.cos((0.5 * phi2)) * (lambda1 - lambda2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 5.7e-28: tmp = R * math.hypot(phi1, (math.cos((0.5 * phi1)) * (lambda1 - lambda2))) else: tmp = R * math.hypot(phi2, (math.cos((0.5 * phi2)) * (lambda1 - lambda2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 5.7e-28) tmp = Float64(R * hypot(phi1, Float64(cos(Float64(0.5 * phi1)) * Float64(lambda1 - lambda2)))); else tmp = Float64(R * hypot(phi2, Float64(cos(Float64(0.5 * phi2)) * Float64(lambda1 - lambda2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 5.7e-28) tmp = R * hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2))); else tmp = R * hypot(phi2, (cos((0.5 * phi2)) * (lambda1 - lambda2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5.7e-28], 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[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 5.7 \cdot 10^{-28}:\\
\;\;\;\;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, \cos \left(0.5 \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)\\
\end{array}
\end{array}
if phi2 < 5.7000000000000004e-28Initial program 58.8%
hypot-def98.1%
Simplified98.1%
Taylor expanded in phi2 around 0 48.3%
*-commutative48.3%
+-commutative48.3%
unpow248.3%
unpow248.3%
unpow248.3%
unswap-sqr48.3%
hypot-def74.4%
Simplified74.4%
if 5.7000000000000004e-28 < phi2 Initial program 46.1%
hypot-def94.6%
Simplified94.6%
Taylor expanded in phi1 around 0 43.6%
*-commutative43.6%
unpow243.6%
unpow243.6%
unpow243.6%
unswap-sqr42.4%
hypot-def77.3%
Simplified77.3%
Final simplification75.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.5e-27) (* R (- phi2 phi1)) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.5e-27) {
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 <= -1.5e-27) {
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 <= -1.5e-27: 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 <= -1.5e-27) 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 <= -1.5e-27) 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, -1.5e-27], 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 -1.5 \cdot 10^{-27}:\\
\;\;\;\;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 < -1.5000000000000001e-27Initial program 55.4%
hypot-def92.8%
Simplified92.8%
add-log-exp92.8%
div-inv92.8%
metadata-eval92.8%
Applied egg-rr92.8%
*-commutative92.8%
+-commutative92.8%
distribute-rgt-in92.8%
cos-sum99.6%
Applied egg-rr99.6%
Taylor expanded in phi2 around inf 99.8%
Taylor expanded in phi1 around -inf 59.8%
*-commutative59.8%
associate-*r*59.8%
distribute-rgt-out59.8%
mul-1-neg59.8%
sub-neg59.8%
Simplified59.8%
if -1.5000000000000001e-27 < phi1 Initial program 55.1%
hypot-def98.3%
Simplified98.3%
Taylor expanded in phi1 around 0 49.6%
*-commutative49.6%
unpow249.6%
unpow249.6%
unpow249.6%
unswap-sqr49.2%
hypot-def81.4%
Simplified81.4%
Taylor expanded in phi2 around 0 71.6%
Final simplification69.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.5e-27) (fma R phi2 (* R (- phi1))) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.5e-27) {
tmp = fma(R, phi2, (R * -phi1));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.5e-27) tmp = fma(R, phi2, Float64(R * Float64(-phi1))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.5e-27], N[(R * phi2 + N[(R * (-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 -1.5 \cdot 10^{-27}:\\
\;\;\;\;\mathsf{fma}\left(R, \phi_2, R \cdot \left(-\phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -1.5000000000000001e-27Initial program 55.4%
hypot-def92.8%
Simplified92.8%
Taylor expanded in phi1 around -inf 59.8%
fma-def61.6%
associate-*r*61.6%
mul-1-neg61.6%
Simplified61.6%
if -1.5000000000000001e-27 < phi1 Initial program 55.1%
hypot-def98.3%
Simplified98.3%
Taylor expanded in phi1 around 0 49.6%
*-commutative49.6%
unpow249.6%
unpow249.6%
unpow249.6%
unswap-sqr49.2%
hypot-def81.4%
Simplified81.4%
Taylor expanded in phi2 around 0 71.6%
Final simplification69.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -2.2e+173) (* lambda1 (- R)) (if (<= lambda1 5.8e+46) (* R (- phi2 phi1)) (fma lambda2 R -1.0))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.2e+173) {
tmp = lambda1 * -R;
} else if (lambda1 <= 5.8e+46) {
tmp = R * (phi2 - phi1);
} else {
tmp = fma(lambda2, R, -1.0);
}
return tmp;
}
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -2.2e+173) tmp = Float64(lambda1 * Float64(-R)); elseif (lambda1 <= 5.8e+46) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = fma(lambda2, R, -1.0); end return tmp end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -2.2e+173], N[(lambda1 * (-R)), $MachinePrecision], If[LessEqual[lambda1, 5.8e+46], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(lambda2 * R + -1.0), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -2.2 \cdot 10^{+173}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{elif}\;\lambda_1 \leq 5.8 \cdot 10^{+46}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\lambda_2, R, -1\right)\\
\end{array}
\end{array}
if lambda1 < -2.2e173Initial program 43.5%
hypot-def99.8%
Simplified99.8%
Taylor expanded in lambda1 around -inf 58.2%
mul-1-neg58.2%
*-commutative58.2%
distribute-rgt-neg-in58.2%
Simplified58.2%
Taylor expanded in phi1 around 0 62.2%
Taylor expanded in phi2 around 0 67.6%
if -2.2e173 < lambda1 < 5.8000000000000004e46Initial program 57.4%
hypot-def97.5%
Simplified97.5%
add-log-exp97.5%
div-inv97.5%
metadata-eval97.5%
Applied egg-rr97.5%
*-commutative97.5%
+-commutative97.5%
distribute-rgt-in97.5%
cos-sum99.8%
Applied egg-rr99.8%
Taylor expanded in phi2 around inf 99.9%
Taylor expanded in phi1 around -inf 33.0%
*-commutative33.0%
associate-*r*33.0%
distribute-rgt-out34.8%
mul-1-neg34.8%
sub-neg34.8%
Simplified34.8%
if 5.8000000000000004e46 < lambda1 Initial program 56.3%
hypot-def93.8%
Simplified93.8%
expm1-log1p-u54.3%
*-commutative54.3%
div-inv54.3%
metadata-eval54.3%
Applied egg-rr54.3%
Taylor expanded in lambda2 around inf 11.3%
Taylor expanded in phi1 around 0 11.3%
expm1-def11.3%
+-commutative11.3%
*-commutative11.3%
neg-mul-111.3%
log-rec11.3%
remove-double-neg11.3%
Simplified11.3%
Taylor expanded in phi2 around 0 12.9%
exp-sum12.9%
fma-neg12.9%
metadata-eval12.9%
rem-exp-log13.5%
rem-exp-log17.5%
Simplified17.5%
Final simplification36.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.5e-27) (* R (- phi2 phi1)) (* R (hypot phi2 lambda1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.5e-27) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * hypot(phi2, lambda1);
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.5e-27) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * Math.hypot(phi2, lambda1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.5e-27: tmp = R * (phi2 - phi1) else: tmp = R * math.hypot(phi2, lambda1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.5e-27) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * hypot(phi2, lambda1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -1.5e-27) tmp = R * (phi2 - phi1); else tmp = R * hypot(phi2, lambda1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.5e-27], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + lambda1 ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.5 \cdot 10^{-27}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -1.5000000000000001e-27Initial program 55.4%
hypot-def92.8%
Simplified92.8%
add-log-exp92.8%
div-inv92.8%
metadata-eval92.8%
Applied egg-rr92.8%
*-commutative92.8%
+-commutative92.8%
distribute-rgt-in92.8%
cos-sum99.6%
Applied egg-rr99.6%
Taylor expanded in phi2 around inf 99.8%
Taylor expanded in phi1 around -inf 59.8%
*-commutative59.8%
associate-*r*59.8%
distribute-rgt-out59.8%
mul-1-neg59.8%
sub-neg59.8%
Simplified59.8%
if -1.5000000000000001e-27 < phi1 Initial program 55.1%
hypot-def98.3%
Simplified98.3%
Taylor expanded in phi1 around 0 49.6%
*-commutative49.6%
unpow249.6%
unpow249.6%
unpow249.6%
unswap-sqr49.2%
hypot-def81.4%
Simplified81.4%
Taylor expanded in lambda1 around inf 62.9%
Taylor expanded in phi2 around 0 57.4%
Final simplification57.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -6.8e-242) (* R (- phi1)) (if (<= phi2 3.3e-29) (* lambda1 (- R)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -6.8e-242) {
tmp = R * -phi1;
} else if (phi2 <= 3.3e-29) {
tmp = lambda1 * -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 (phi2 <= (-6.8d-242)) then
tmp = r * -phi1
else if (phi2 <= 3.3d-29) then
tmp = lambda1 * -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 (phi2 <= -6.8e-242) {
tmp = R * -phi1;
} else if (phi2 <= 3.3e-29) {
tmp = lambda1 * -R;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -6.8e-242: tmp = R * -phi1 elif phi2 <= 3.3e-29: tmp = lambda1 * -R else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -6.8e-242) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 3.3e-29) tmp = Float64(lambda1 * Float64(-R)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= -6.8e-242) tmp = R * -phi1; elseif (phi2 <= 3.3e-29) tmp = lambda1 * -R; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -6.8e-242], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 3.3e-29], N[(lambda1 * (-R)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -6.8 \cdot 10^{-242}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 3.3 \cdot 10^{-29}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -6.8000000000000001e-242Initial program 55.1%
hypot-def97.1%
Simplified97.1%
Taylor expanded in phi1 around -inf 12.9%
associate-*r*12.9%
mul-1-neg12.9%
Simplified12.9%
if -6.8000000000000001e-242 < phi2 < 3.30000000000000028e-29Initial program 65.1%
hypot-def99.9%
Simplified99.9%
Taylor expanded in lambda1 around -inf 28.2%
mul-1-neg28.2%
*-commutative28.2%
distribute-rgt-neg-in28.2%
Simplified28.2%
Taylor expanded in phi1 around 0 24.1%
Taylor expanded in phi2 around 0 24.1%
if 3.30000000000000028e-29 < phi2 Initial program 46.8%
hypot-def94.7%
Simplified94.7%
Taylor expanded in phi2 around inf 57.1%
*-commutative57.1%
Simplified57.1%
Final simplification28.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -2.8e+175) (* lambda1 (- R)) (* R (- phi2 phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.8e+175) {
tmp = lambda1 * -R;
} 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 (lambda1 <= (-2.8d+175)) then
tmp = lambda1 * -r
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 (lambda1 <= -2.8e+175) {
tmp = lambda1 * -R;
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -2.8e+175: tmp = lambda1 * -R else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -2.8e+175) tmp = Float64(lambda1 * Float64(-R)); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -2.8e+175) tmp = lambda1 * -R; else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -2.8e+175], N[(lambda1 * (-R)), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -2.8 \cdot 10^{+175}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -2.8000000000000001e175Initial program 43.5%
hypot-def99.8%
Simplified99.8%
Taylor expanded in lambda1 around -inf 58.2%
mul-1-neg58.2%
*-commutative58.2%
distribute-rgt-neg-in58.2%
Simplified58.2%
Taylor expanded in phi1 around 0 62.2%
Taylor expanded in phi2 around 0 67.6%
if -2.8000000000000001e175 < lambda1 Initial program 57.1%
hypot-def96.6%
Simplified96.6%
add-log-exp96.6%
div-inv96.6%
metadata-eval96.6%
Applied egg-rr96.6%
*-commutative96.6%
+-commutative96.6%
distribute-rgt-in96.6%
cos-sum99.8%
Applied egg-rr99.8%
Taylor expanded in phi2 around inf 99.9%
Taylor expanded in phi1 around -inf 28.9%
*-commutative28.9%
associate-*r*28.9%
distribute-rgt-out30.3%
mul-1-neg30.3%
sub-neg30.3%
Simplified30.3%
Final simplification35.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 3.3e-29) (* lambda1 (- R)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.3e-29) {
tmp = lambda1 * -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 (phi2 <= 3.3d-29) then
tmp = lambda1 * -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 (phi2 <= 3.3e-29) {
tmp = lambda1 * -R;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 3.3e-29: tmp = lambda1 * -R else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 3.3e-29) tmp = Float64(lambda1 * Float64(-R)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 3.3e-29) tmp = lambda1 * -R; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 3.3e-29], N[(lambda1 * (-R)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.3 \cdot 10^{-29}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 3.30000000000000028e-29Initial program 58.6%
hypot-def98.1%
Simplified98.1%
Taylor expanded in lambda1 around -inf 18.6%
mul-1-neg18.6%
*-commutative18.6%
distribute-rgt-neg-in18.6%
Simplified18.6%
Taylor expanded in phi1 around 0 16.5%
Taylor expanded in phi2 around 0 16.2%
if 3.30000000000000028e-29 < phi2 Initial program 46.8%
hypot-def94.7%
Simplified94.7%
Taylor expanded in phi2 around inf 57.1%
*-commutative57.1%
Simplified57.1%
Final simplification28.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda1))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda1;
}
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 * lambda1
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda1;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * lambda1
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda1) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * lambda1; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda1), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \lambda_1
\end{array}
Initial program 55.1%
hypot-def97.1%
Simplified97.1%
Taylor expanded in phi1 around 0 46.1%
*-commutative46.1%
unpow246.1%
unpow246.1%
unpow246.1%
unswap-sqr45.7%
hypot-def73.4%
Simplified73.4%
Taylor expanded in lambda1 around inf 57.9%
Taylor expanded in phi2 around 0 12.4%
*-commutative12.4%
Simplified12.4%
Final simplification12.4%
(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 55.1%
hypot-def97.1%
Simplified97.1%
Taylor expanded in phi2 around inf 18.5%
*-commutative18.5%
Simplified18.5%
Final simplification18.5%
herbie shell --seed 2023240
(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))))))