
(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 14 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)
(sqrt
(+
0.5
(*
0.5
(-
(* (cos phi2) (cos phi1))
(expm1 (log1p (* (sin phi2) (sin phi1)))))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * sqrt((0.5 + (0.5 * ((cos(phi2) * cos(phi1)) - expm1(log1p((sin(phi2) * sin(phi1))))))))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.sqrt((0.5 + (0.5 * ((Math.cos(phi2) * Math.cos(phi1)) - Math.expm1(Math.log1p((Math.sin(phi2) * Math.sin(phi1))))))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.sqrt((0.5 + (0.5 * ((math.cos(phi2) * math.cos(phi1)) - math.expm1(math.log1p((math.sin(phi2) * math.sin(phi1))))))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * sqrt(Float64(0.5 + Float64(0.5 * Float64(Float64(cos(phi2) * cos(phi1)) - expm1(log1p(Float64(sin(phi2) * sin(phi1))))))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Sqrt[N[(0.5 + N[(0.5 * N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] - N[(Exp[N[Log[1 + N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]] - 1), $MachinePrecision]), $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 \sqrt{0.5 + 0.5 \cdot \left(\cos \phi_2 \cdot \cos \phi_1 - \mathsf{expm1}\left(\mathsf{log1p}\left(\sin \phi_2 \cdot \sin \phi_1\right)\right)\right)}, \phi_1 - \phi_2\right)
\end{array}
Initial program 61.1%
hypot-def97.1%
Simplified97.1%
add-sqr-sqrt61.7%
sqrt-unprod97.1%
sqr-cos-a97.1%
cos-297.1%
cos-sum97.1%
add-log-exp26.6%
add-log-exp26.6%
sum-log26.2%
exp-sqrt26.2%
exp-sqrt26.2%
add-sqr-sqrt26.2%
add-log-exp97.1%
Applied egg-rr97.1%
+-commutative97.1%
Simplified97.1%
cos-sum99.8%
Applied egg-rr99.8%
expm1-log1p-u99.8%
Applied egg-rr99.8%
Final simplification99.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -4.4e+152)
(*
R
(hypot
(*
lambda1
(sqrt
(+
0.5
(* 0.5 (- (* (cos phi2) (cos phi1)) (* (sin phi2) (sin phi1)))))))
(- phi1 phi2)))
(*
R
(hypot
(* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0)))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4.4e+152) {
tmp = R * hypot((lambda1 * sqrt((0.5 + (0.5 * ((cos(phi2) * cos(phi1)) - (sin(phi2) * sin(phi1))))))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4.4e+152) {
tmp = R * Math.hypot((lambda1 * Math.sqrt((0.5 + (0.5 * ((Math.cos(phi2) * Math.cos(phi1)) - (Math.sin(phi2) * Math.sin(phi1))))))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -4.4e+152: tmp = R * math.hypot((lambda1 * math.sqrt((0.5 + (0.5 * ((math.cos(phi2) * math.cos(phi1)) - (math.sin(phi2) * math.sin(phi1))))))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -4.4e+152) tmp = Float64(R * hypot(Float64(lambda1 * sqrt(Float64(0.5 + Float64(0.5 * Float64(Float64(cos(phi2) * cos(phi1)) - Float64(sin(phi2) * sin(phi1))))))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -4.4e+152) tmp = R * hypot((lambda1 * sqrt((0.5 + (0.5 * ((cos(phi2) * cos(phi1)) - (sin(phi2) * sin(phi1))))))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -4.4e+152], N[(R * N[Sqrt[N[(lambda1 * N[Sqrt[N[(0.5 + N[(0.5 * N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], 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}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -4.4 \cdot 10^{+152}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \sqrt{0.5 + 0.5 \cdot \left(\cos \phi_2 \cdot \cos \phi_1 - \sin \phi_2 \cdot \sin \phi_1\right)}, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;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}
\end{array}
if lambda1 < -4.3999999999999996e152Initial program 43.3%
hypot-def92.8%
Simplified92.8%
add-sqr-sqrt64.7%
sqrt-unprod92.8%
sqr-cos-a92.7%
cos-292.7%
cos-sum92.7%
add-log-exp21.9%
add-log-exp21.9%
sum-log21.9%
exp-sqrt21.9%
exp-sqrt21.9%
add-sqr-sqrt21.9%
add-log-exp92.7%
Applied egg-rr92.7%
+-commutative92.7%
Simplified92.7%
cos-sum99.7%
Applied egg-rr99.7%
Taylor expanded in lambda1 around inf 88.3%
if -4.3999999999999996e152 < lambda1 Initial program 63.7%
hypot-def97.8%
Simplified97.8%
Final simplification96.6%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(sqrt
(+ 0.5 (* 0.5 (- (* (cos phi2) (cos phi1)) (* (sin phi2) (sin phi1)))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * sqrt((0.5 + (0.5 * ((cos(phi2) * cos(phi1)) - (sin(phi2) * sin(phi1))))))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.sqrt((0.5 + (0.5 * ((Math.cos(phi2) * Math.cos(phi1)) - (Math.sin(phi2) * Math.sin(phi1))))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.sqrt((0.5 + (0.5 * ((math.cos(phi2) * math.cos(phi1)) - (math.sin(phi2) * math.sin(phi1))))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * sqrt(Float64(0.5 + Float64(0.5 * Float64(Float64(cos(phi2) * cos(phi1)) - Float64(sin(phi2) * sin(phi1))))))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * sqrt((0.5 + (0.5 * ((cos(phi2) * cos(phi1)) - (sin(phi2) * sin(phi1))))))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Sqrt[N[(0.5 + N[(0.5 * N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[phi2], $MachinePrecision] * N[Sin[phi1], $MachinePrecision]), $MachinePrecision]), $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 \sqrt{0.5 + 0.5 \cdot \left(\cos \phi_2 \cdot \cos \phi_1 - \sin \phi_2 \cdot \sin \phi_1\right)}, \phi_1 - \phi_2\right)
\end{array}
Initial program 61.1%
hypot-def97.1%
Simplified97.1%
add-sqr-sqrt61.7%
sqrt-unprod97.1%
sqr-cos-a97.1%
cos-297.1%
cos-sum97.1%
add-log-exp26.6%
add-log-exp26.6%
sum-log26.2%
exp-sqrt26.2%
exp-sqrt26.2%
add-sqr-sqrt26.2%
add-log-exp97.1%
Applied egg-rr97.1%
+-commutative97.1%
Simplified97.1%
cos-sum99.8%
Applied egg-rr99.8%
Final simplification99.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.1) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi2))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.1) {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.1) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.1: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.1) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi2))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -0.1) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.1], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.1:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -0.10000000000000001Initial program 51.4%
hypot-def94.8%
Simplified94.8%
Taylor expanded in phi2 around 0 92.6%
if -0.10000000000000001 < phi1 Initial program 64.2%
hypot-def97.9%
Simplified97.9%
Taylor expanded in phi1 around 0 94.9%
Final simplification94.4%
(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 61.1%
hypot-def97.1%
Simplified97.1%
Final simplification97.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.22e+212) (* (sqrt (+ 0.5 (* 0.5 (cos phi1)))) (* R (- lambda1))) (* R (hypot (- lambda1 lambda2) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.22e+212) {
tmp = sqrt((0.5 + (0.5 * cos(phi1)))) * (R * -lambda1);
} 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 (lambda1 <= -1.22e+212) {
tmp = Math.sqrt((0.5 + (0.5 * Math.cos(phi1)))) * (R * -lambda1);
} else {
tmp = R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.22e+212: tmp = math.sqrt((0.5 + (0.5 * math.cos(phi1)))) * (R * -lambda1) else: tmp = R * math.hypot((lambda1 - lambda2), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.22e+212) tmp = Float64(sqrt(Float64(0.5 + Float64(0.5 * cos(phi1)))) * Float64(R * Float64(-lambda1))); 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 (lambda1 <= -1.22e+212) tmp = sqrt((0.5 + (0.5 * cos(phi1)))) * (R * -lambda1); else tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.22e+212], N[(N[Sqrt[N[(0.5 + N[(0.5 * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(R * (-lambda1)), $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}\;\lambda_1 \leq -1.22 \cdot 10^{+212}:\\
\;\;\;\;\sqrt{0.5 + 0.5 \cdot \cos \phi_1} \cdot \left(R \cdot \left(-\lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -1.22000000000000005e212Initial program 49.8%
hypot-def88.4%
Simplified88.4%
add-sqr-sqrt62.2%
sqrt-unprod88.4%
sqr-cos-a88.3%
cos-288.3%
cos-sum88.3%
add-log-exp21.1%
add-log-exp21.1%
sum-log21.1%
exp-sqrt21.1%
exp-sqrt21.1%
add-sqr-sqrt21.1%
add-log-exp88.3%
Applied egg-rr88.3%
+-commutative88.3%
Simplified88.3%
Taylor expanded in phi2 around 0 84.0%
*-commutative84.0%
Simplified84.0%
Taylor expanded in lambda1 around -inf 83.5%
associate-*r*83.5%
mul-1-neg83.5%
*-commutative83.5%
Simplified83.5%
if -1.22000000000000005e212 < lambda1 Initial program 62.0%
hypot-def97.8%
Simplified97.8%
add-sqr-sqrt61.7%
sqrt-unprod97.8%
sqr-cos-a97.8%
cos-297.8%
cos-sum97.8%
add-log-exp27.0%
add-log-exp27.0%
sum-log26.6%
exp-sqrt26.6%
exp-sqrt26.6%
add-sqr-sqrt26.6%
add-log-exp97.8%
Applied egg-rr97.8%
+-commutative97.8%
Simplified97.8%
Taylor expanded in phi2 around 0 92.5%
*-commutative92.5%
Simplified92.5%
Taylor expanded in phi1 around 0 86.9%
Final simplification86.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (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))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $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(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.1%
hypot-def97.1%
Simplified97.1%
Taylor expanded in phi2 around 0 91.9%
Final simplification91.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 2.55e+221) (* R (hypot (- lambda1 lambda2) (- phi1 phi2))) (* (sqrt (+ 0.5 (* 0.5 (cos phi1)))) (* R lambda2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.55e+221) {
tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2));
} else {
tmp = sqrt((0.5 + (0.5 * cos(phi1)))) * (R * lambda2);
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.55e+221) {
tmp = R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
} else {
tmp = Math.sqrt((0.5 + (0.5 * Math.cos(phi1)))) * (R * lambda2);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 2.55e+221: tmp = R * math.hypot((lambda1 - lambda2), (phi1 - phi2)) else: tmp = math.sqrt((0.5 + (0.5 * math.cos(phi1)))) * (R * lambda2) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2.55e+221) tmp = Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))); else tmp = Float64(sqrt(Float64(0.5 + Float64(0.5 * cos(phi1)))) * Float64(R * lambda2)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 2.55e+221) tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); else tmp = sqrt((0.5 + (0.5 * cos(phi1)))) * (R * lambda2); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2.55e+221], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(0.5 + N[(0.5 * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(R * lambda2), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2.55 \cdot 10^{+221}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 + 0.5 \cdot \cos \phi_1} \cdot \left(R \cdot \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 2.54999999999999988e221Initial program 63.1%
hypot-def97.6%
Simplified97.6%
add-sqr-sqrt62.7%
sqrt-unprod97.6%
sqr-cos-a97.6%
cos-297.6%
cos-sum97.6%
add-log-exp26.4%
add-log-exp26.4%
sum-log25.9%
exp-sqrt25.9%
exp-sqrt25.9%
add-sqr-sqrt25.9%
add-log-exp97.6%
Applied egg-rr97.6%
+-commutative97.6%
Simplified97.6%
Taylor expanded in phi2 around 0 92.6%
*-commutative92.6%
Simplified92.6%
Taylor expanded in phi1 around 0 86.9%
if 2.54999999999999988e221 < lambda2 Initial program 33.1%
hypot-def90.4%
Simplified90.4%
add-sqr-sqrt48.2%
sqrt-unprod90.4%
sqr-cos-a90.4%
cos-290.3%
cos-sum90.4%
add-log-exp29.4%
add-log-exp29.4%
sum-log29.4%
exp-sqrt29.4%
exp-sqrt29.4%
add-sqr-sqrt29.4%
add-log-exp90.4%
Applied egg-rr90.4%
+-commutative90.4%
Simplified90.4%
Taylor expanded in phi2 around 0 81.8%
*-commutative81.8%
Simplified81.8%
Taylor expanded in lambda2 around inf 81.9%
Final simplification86.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.45e+138) (* 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.45e+138) {
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.45e+138) {
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.45e+138: 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.45e+138) 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.45e+138) 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.45e+138], 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.45 \cdot 10^{+138}:\\
\;\;\;\;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.45000000000000005e138Initial program 49.1%
hypot-def94.8%
Simplified94.8%
Taylor expanded in phi1 around -inf 76.6%
mul-1-neg76.6%
unsub-neg76.6%
Simplified76.6%
if -1.45000000000000005e138 < phi1 Initial program 62.6%
hypot-def97.4%
Simplified97.4%
add-sqr-sqrt63.5%
sqrt-unprod97.4%
sqr-cos-a97.4%
cos-297.4%
cos-sum97.4%
add-log-exp29.8%
add-log-exp29.8%
sum-log29.4%
exp-sqrt29.4%
exp-sqrt29.4%
add-sqr-sqrt29.4%
add-log-exp97.4%
Applied egg-rr97.4%
+-commutative97.4%
Simplified97.4%
Taylor expanded in phi2 around 0 91.5%
*-commutative91.5%
Simplified91.5%
Taylor expanded in phi1 around 0 49.3%
unpow249.3%
unpow249.3%
hypot-def69.9%
Simplified69.9%
Final simplification70.6%
(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 61.1%
hypot-def97.1%
Simplified97.1%
add-sqr-sqrt61.7%
sqrt-unprod97.1%
sqr-cos-a97.1%
cos-297.1%
cos-sum97.1%
add-log-exp26.6%
add-log-exp26.6%
sum-log26.2%
exp-sqrt26.2%
exp-sqrt26.2%
add-sqr-sqrt26.2%
add-log-exp97.1%
Applied egg-rr97.1%
+-commutative97.1%
Simplified97.1%
Taylor expanded in phi2 around 0 91.9%
*-commutative91.9%
Simplified91.9%
Taylor expanded in phi1 around 0 85.4%
Final simplification85.4%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -2.05e+111)
(* R (- phi1))
(if (or (<= phi1 -1e-136)
(and (not (<= phi1 -1.75e-202)) (<= phi1 8.2e-282)))
(* R (- lambda1))
(* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.05e+111) {
tmp = R * -phi1;
} else if ((phi1 <= -1e-136) || (!(phi1 <= -1.75e-202) && (phi1 <= 8.2e-282))) {
tmp = 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 <= (-2.05d+111)) then
tmp = r * -phi1
else if ((phi1 <= (-1d-136)) .or. (.not. (phi1 <= (-1.75d-202))) .and. (phi1 <= 8.2d-282)) then
tmp = 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 <= -2.05e+111) {
tmp = R * -phi1;
} else if ((phi1 <= -1e-136) || (!(phi1 <= -1.75e-202) && (phi1 <= 8.2e-282))) {
tmp = R * -lambda1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -2.05e+111: tmp = R * -phi1 elif (phi1 <= -1e-136) or (not (phi1 <= -1.75e-202) and (phi1 <= 8.2e-282)): tmp = R * -lambda1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -2.05e+111) tmp = Float64(R * Float64(-phi1)); elseif ((phi1 <= -1e-136) || (!(phi1 <= -1.75e-202) && (phi1 <= 8.2e-282))) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -2.05e+111) tmp = R * -phi1; elseif ((phi1 <= -1e-136) || (~((phi1 <= -1.75e-202)) && (phi1 <= 8.2e-282))) tmp = R * -lambda1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -2.05e+111], N[(R * (-phi1)), $MachinePrecision], If[Or[LessEqual[phi1, -1e-136], And[N[Not[LessEqual[phi1, -1.75e-202]], $MachinePrecision], LessEqual[phi1, 8.2e-282]]], N[(R * (-lambda1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -2.05 \cdot 10^{+111}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -1 \cdot 10^{-136} \lor \neg \left(\phi_1 \leq -1.75 \cdot 10^{-202}\right) \land \phi_1 \leq 8.2 \cdot 10^{-282}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -2.04999999999999993e111Initial program 47.5%
hypot-def94.9%
Simplified94.9%
Taylor expanded in phi1 around -inf 76.5%
mul-1-neg76.5%
*-commutative76.5%
distribute-rgt-neg-in76.5%
Simplified76.5%
if -2.04999999999999993e111 < phi1 < -1e-136 or -1.75e-202 < phi1 < 8.19999999999999954e-282Initial program 65.3%
hypot-def97.3%
Simplified97.3%
Taylor expanded in lambda1 around -inf 14.3%
mul-1-neg14.3%
*-commutative14.3%
distribute-rgt-neg-in14.3%
Simplified14.3%
Taylor expanded in phi2 around 0 18.6%
*-commutative18.6%
*-commutative18.6%
Simplified18.6%
Taylor expanded in phi1 around 0 13.8%
if -1e-136 < phi1 < -1.75e-202 or 8.19999999999999954e-282 < phi1 Initial program 61.3%
hypot-def97.5%
Simplified97.5%
Taylor expanded in phi2 around inf 20.1%
*-commutative20.1%
Simplified20.1%
Final simplification24.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.3e+152) (* R (- lambda1)) (* R (- phi2 phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.3e+152) {
tmp = R * -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 (lambda1 <= (-1.3d+152)) then
tmp = r * -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 (lambda1 <= -1.3e+152) {
tmp = R * -lambda1;
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.3e+152: tmp = R * -lambda1 else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.3e+152) tmp = Float64(R * Float64(-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 (lambda1 <= -1.3e+152) tmp = R * -lambda1; else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.3e+152], N[(R * (-lambda1)), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.3 \cdot 10^{+152}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -1.3e152Initial program 43.3%
hypot-def92.8%
Simplified92.8%
Taylor expanded in lambda1 around -inf 53.1%
mul-1-neg53.1%
*-commutative53.1%
distribute-rgt-neg-in53.1%
Simplified53.1%
Taylor expanded in phi2 around 0 49.4%
*-commutative49.4%
*-commutative49.4%
Simplified49.4%
Taylor expanded in phi1 around 0 58.0%
if -1.3e152 < lambda1 Initial program 63.7%
hypot-def97.8%
Simplified97.8%
Taylor expanded in phi1 around -inf 28.7%
mul-1-neg28.7%
unsub-neg28.7%
Simplified28.7%
Final simplification32.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 2.2e-9) (* R (- lambda1)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.2e-9) {
tmp = 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 (phi2 <= 2.2d-9) then
tmp = 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 (phi2 <= 2.2e-9) {
tmp = R * -lambda1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.2e-9: tmp = R * -lambda1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.2e-9) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 2.2e-9) tmp = R * -lambda1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.2e-9], N[(R * (-lambda1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.2 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 2.1999999999999998e-9Initial program 62.7%
hypot-def97.8%
Simplified97.8%
Taylor expanded in lambda1 around -inf 17.3%
mul-1-neg17.3%
*-commutative17.3%
distribute-rgt-neg-in17.3%
Simplified17.3%
Taylor expanded in phi2 around 0 18.0%
*-commutative18.0%
*-commutative18.0%
Simplified18.0%
Taylor expanded in phi1 around 0 15.4%
if 2.1999999999999998e-9 < phi2 Initial program 56.4%
hypot-def95.1%
Simplified95.1%
Taylor expanded in phi2 around inf 63.3%
*-commutative63.3%
Simplified63.3%
Final simplification27.2%
(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 61.1%
hypot-def97.1%
Simplified97.1%
Taylor expanded in phi2 around inf 18.9%
*-commutative18.9%
Simplified18.9%
Final simplification18.9%
herbie shell --seed 2023279
(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))))))