
(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
(*
(- lambda1 lambda2)
(fma
(cos (* 0.5 phi2))
(cos (* 0.5 phi1))
(* (sin (* 0.5 phi1)) (- (sin (* 0.5 phi2))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * fma(cos((0.5 * phi2)), cos((0.5 * phi1)), (sin((0.5 * phi1)) * -sin((0.5 * phi2))))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * fma(cos(Float64(0.5 * phi2)), cos(Float64(0.5 * phi1)), Float64(sin(Float64(0.5 * phi1)) * Float64(-sin(Float64(0.5 * phi2)))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * (-N[Sin[N[(0.5 * phi2), $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 \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_1\right) \cdot \left(-\sin \left(0.5 \cdot \phi_2\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 55.5%
hypot-def95.7%
Simplified95.7%
add-log-exp95.7%
div-inv95.7%
metadata-eval95.7%
Applied egg-rr95.7%
*-commutative95.7%
+-commutative95.7%
distribute-lft-in95.7%
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%
Simplified99.8%
add-cbrt-cube99.8%
add-cbrt-cube99.8%
cbrt-unprod99.9%
pow399.9%
pow399.9%
Applied egg-rr99.9%
add-log-exp99.9%
cbrt-prod99.8%
unpow399.9%
add-cbrt-cube99.9%
unpow399.9%
add-cbrt-cube99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -1.7e+185)
(*
R
(hypot
(*
lambda1
(-
(* (cos (* 0.5 phi2)) (cos (* 0.5 phi1)))
(* (sin (* 0.5 phi2)) (sin (* 0.5 phi1)))))
(- phi1 phi2)))
(*
R
(hypot
(* (- lambda1 lambda2) (log (exp (cos (* 0.5 (+ phi2 phi1))))))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.7e+185) {
tmp = R * hypot((lambda1 * ((cos((0.5 * phi2)) * cos((0.5 * phi1))) - (sin((0.5 * phi2)) * sin((0.5 * phi1))))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * log(exp(cos((0.5 * (phi2 + phi1)))))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.7e+185) {
tmp = R * Math.hypot((lambda1 * ((Math.cos((0.5 * phi2)) * Math.cos((0.5 * phi1))) - (Math.sin((0.5 * phi2)) * Math.sin((0.5 * phi1))))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.log(Math.exp(Math.cos((0.5 * (phi2 + phi1)))))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.7e+185: tmp = R * math.hypot((lambda1 * ((math.cos((0.5 * phi2)) * math.cos((0.5 * phi1))) - (math.sin((0.5 * phi2)) * math.sin((0.5 * phi1))))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.log(math.exp(math.cos((0.5 * (phi2 + phi1)))))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.7e+185) tmp = Float64(R * hypot(Float64(lambda1 * Float64(Float64(cos(Float64(0.5 * phi2)) * cos(Float64(0.5 * phi1))) - Float64(sin(Float64(0.5 * phi2)) * sin(Float64(0.5 * phi1))))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * log(exp(cos(Float64(0.5 * Float64(phi2 + phi1)))))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -1.7e+185) tmp = R * hypot((lambda1 * ((cos((0.5 * phi2)) * cos((0.5 * phi1))) - (sin((0.5 * phi2)) * sin((0.5 * phi1))))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * log(exp(cos((0.5 * (phi2 + phi1)))))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.7e+185], N[(R * N[Sqrt[N[(lambda1 * 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]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Log[N[Exp[N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.7 \cdot 10^{+185}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \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), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \log \left(e^{\cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)}\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -1.70000000000000009e185Initial program 48.2%
hypot-def88.3%
Simplified88.3%
add-log-exp88.2%
div-inv88.2%
metadata-eval88.2%
Applied egg-rr88.2%
*-commutative88.2%
+-commutative88.2%
distribute-lft-in88.2%
cos-sum99.7%
*-commutative99.7%
*-commutative99.7%
*-commutative99.7%
*-commutative99.7%
Applied egg-rr99.7%
fma-neg99.7%
*-commutative99.7%
*-commutative99.7%
*-commutative99.7%
*-commutative99.7%
Simplified99.7%
Taylor expanded in lambda1 around inf 95.5%
if -1.70000000000000009e185 < lambda1 Initial program 56.6%
hypot-def96.8%
Simplified96.8%
add-log-exp96.8%
div-inv96.8%
metadata-eval96.8%
Applied egg-rr96.8%
Final simplification96.7%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin (* 0.5 phi2)) (sin (* 0.5 phi1))))
(t_1 (* (cos (* 0.5 phi2)) (cos (* 0.5 phi1)))))
(if (<= lambda1 -1.65e+51)
(* R (hypot (* lambda1 (- t_1 t_0)) (- phi1 phi2)))
(* R (hypot (* lambda2 (- t_0 t_1)) (- phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin((0.5 * phi2)) * sin((0.5 * phi1));
double t_1 = cos((0.5 * phi2)) * cos((0.5 * phi1));
double tmp;
if (lambda1 <= -1.65e+51) {
tmp = R * hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin((0.5 * phi2)) * Math.sin((0.5 * phi1));
double t_1 = Math.cos((0.5 * phi2)) * Math.cos((0.5 * phi1));
double tmp;
if (lambda1 <= -1.65e+51) {
tmp = R * Math.hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin((0.5 * phi2)) * math.sin((0.5 * phi1)) t_1 = math.cos((0.5 * phi2)) * math.cos((0.5 * phi1)) tmp = 0 if lambda1 <= -1.65e+51: tmp = R * math.hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(Float64(0.5 * phi2)) * sin(Float64(0.5 * phi1))) t_1 = Float64(cos(Float64(0.5 * phi2)) * cos(Float64(0.5 * phi1))) tmp = 0.0 if (lambda1 <= -1.65e+51) tmp = Float64(R * hypot(Float64(lambda1 * Float64(t_1 - t_0)), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(t_0 - t_1)), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = sin((0.5 * phi2)) * sin((0.5 * phi1)); t_1 = cos((0.5 * phi2)) * cos((0.5 * phi1)); tmp = 0.0; if (lambda1 <= -1.65e+51) tmp = R * hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2)); else tmp = R * hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -1.65e+51], N[(R * N[Sqrt[N[(lambda1 * N[(t$95$1 - t$95$0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * N[(t$95$0 - t$95$1), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sin \left(0.5 \cdot \phi_2\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\\
t_1 := \cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\\
\mathbf{if}\;\lambda_1 \leq -1.65 \cdot 10^{+51}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \left(t_1 - t_0\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(t_0 - t_1\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -1.6499999999999999e51Initial program 45.7%
hypot-def93.6%
Simplified93.6%
add-log-exp93.6%
div-inv93.6%
metadata-eval93.6%
Applied egg-rr93.6%
*-commutative93.6%
+-commutative93.6%
distribute-lft-in93.6%
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%
Simplified99.8%
Taylor expanded in lambda1 around inf 92.8%
if -1.6499999999999999e51 < lambda1 Initial program 58.8%
hypot-def96.4%
Simplified96.4%
add-log-exp96.4%
div-inv96.4%
metadata-eval96.4%
Applied egg-rr96.4%
*-commutative96.4%
+-commutative96.4%
distribute-lft-in96.4%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
fma-neg99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
Simplified99.9%
Taylor expanded in lambda1 around 0 88.3%
mul-1-neg88.3%
*-commutative88.3%
distribute-rgt-neg-in88.3%
*-commutative88.3%
Simplified88.3%
Final simplification89.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.05e-7) (* 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 <= -1.05e-7) {
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 <= -1.05e-7) {
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 <= -1.05e-7: 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 <= -1.05e-7) 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 <= -1.05e-7) 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, -1.05e-7], 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 -1.05 \cdot 10^{-7}:\\
\;\;\;\;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 < -1.05e-7Initial program 40.2%
hypot-def88.0%
Simplified88.0%
Taylor expanded in phi2 around 0 88.1%
if -1.05e-7 < phi1 Initial program 60.3%
hypot-def98.1%
Simplified98.1%
Taylor expanded in phi1 around 0 93.8%
Final simplification92.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 55.5%
hypot-def95.7%
Simplified95.7%
Final simplification95.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -5.2e+89) (* R (hypot phi1 (- lambda1 lambda2))) (* R (hypot (* (cos (* 0.5 phi1)) (- lambda2)) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -5.2e+89) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * hypot((cos((0.5 * phi1)) * -lambda2), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -5.2e+89) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * Math.hypot((Math.cos((0.5 * phi1)) * -lambda2), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -5.2e+89: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * math.hypot((math.cos((0.5 * phi1)) * -lambda2), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -5.2e+89) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * hypot(Float64(cos(Float64(0.5 * phi1)) * Float64(-lambda2)), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -5.2e+89) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * hypot((cos((0.5 * phi1)) * -lambda2), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -5.2e+89], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * (-lambda2)), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -5.2 \cdot 10^{+89}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \left(-\lambda_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -5.2000000000000001e89Initial program 45.3%
hypot-def92.4%
Simplified92.4%
Taylor expanded in phi1 around 0 83.8%
Taylor expanded in phi2 around 0 45.4%
*-commutative45.4%
unpow245.4%
unpow245.4%
hypot-def70.0%
Simplified70.0%
if -5.2000000000000001e89 < lambda1 Initial program 58.2%
hypot-def96.5%
Simplified96.5%
Taylor expanded in phi2 around 0 91.4%
Taylor expanded in lambda1 around 0 82.5%
mul-1-neg82.5%
distribute-lft-neg-out82.5%
*-commutative82.5%
Simplified82.5%
Final simplification79.8%
(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 55.5%
hypot-def95.7%
Simplified95.7%
Taylor expanded in phi2 around 0 90.8%
Final simplification90.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.45e+52) (* R (hypot phi1 (- lambda1 lambda2))) (* R (- phi2 phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.45e+52) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.45e+52) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.45e+52: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.45e+52) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.45e+52) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.45e+52], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.45 \cdot 10^{+52}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < 1.45e52Initial program 57.6%
hypot-def96.5%
Simplified96.5%
Taylor expanded in phi1 around 0 90.4%
Taylor expanded in phi2 around 0 50.4%
*-commutative50.4%
unpow250.4%
unpow250.4%
hypot-def71.0%
Simplified71.0%
if 1.45e52 < phi2 Initial program 48.0%
hypot-def92.9%
Simplified92.9%
Taylor expanded in phi1 around -inf 62.3%
*-commutative62.3%
associate-*r*62.3%
distribute-rgt-out67.5%
mul-1-neg67.5%
unsub-neg67.5%
Simplified67.5%
Final simplification70.2%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -5.5e+19)
(* R (- phi1))
(if (or (<= phi1 -2.4e-74)
(and (not (<= phi1 -2.06e-165)) (<= phi1 -1.05e-279)))
(* lambda1 (- R))
(* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -5.5e+19) {
tmp = R * -phi1;
} else if ((phi1 <= -2.4e-74) || (!(phi1 <= -2.06e-165) && (phi1 <= -1.05e-279))) {
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 (phi1 <= (-5.5d+19)) then
tmp = r * -phi1
else if ((phi1 <= (-2.4d-74)) .or. (.not. (phi1 <= (-2.06d-165))) .and. (phi1 <= (-1.05d-279))) 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 (phi1 <= -5.5e+19) {
tmp = R * -phi1;
} else if ((phi1 <= -2.4e-74) || (!(phi1 <= -2.06e-165) && (phi1 <= -1.05e-279))) {
tmp = lambda1 * -R;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -5.5e+19: tmp = R * -phi1 elif (phi1 <= -2.4e-74) or (not (phi1 <= -2.06e-165) and (phi1 <= -1.05e-279)): tmp = lambda1 * -R else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -5.5e+19) tmp = Float64(R * Float64(-phi1)); elseif ((phi1 <= -2.4e-74) || (!(phi1 <= -2.06e-165) && (phi1 <= -1.05e-279))) 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 (phi1 <= -5.5e+19) tmp = R * -phi1; elseif ((phi1 <= -2.4e-74) || (~((phi1 <= -2.06e-165)) && (phi1 <= -1.05e-279))) tmp = lambda1 * -R; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -5.5e+19], N[(R * (-phi1)), $MachinePrecision], If[Or[LessEqual[phi1, -2.4e-74], And[N[Not[LessEqual[phi1, -2.06e-165]], $MachinePrecision], LessEqual[phi1, -1.05e-279]]], N[(lambda1 * (-R)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -5.5 \cdot 10^{+19}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -2.4 \cdot 10^{-74} \lor \neg \left(\phi_1 \leq -2.06 \cdot 10^{-165}\right) \land \phi_1 \leq -1.05 \cdot 10^{-279}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -5.5e19Initial program 38.8%
hypot-def88.8%
Simplified88.8%
Taylor expanded in phi1 around -inf 68.4%
associate-*r*68.4%
mul-1-neg68.4%
Simplified68.4%
if -5.5e19 < phi1 < -2.3999999999999999e-74 or -2.05999999999999988e-165 < phi1 < -1.05000000000000003e-279Initial program 64.0%
hypot-def97.0%
Simplified97.0%
Taylor expanded in phi1 around 0 96.7%
Taylor expanded in lambda1 around -inf 20.9%
mul-1-neg20.9%
distribute-rgt-neg-in20.9%
distribute-rgt-neg-in20.9%
Simplified20.9%
Taylor expanded in phi2 around 0 20.9%
mul-1-neg20.9%
*-commutative20.9%
distribute-rgt-neg-in20.9%
Simplified20.9%
if -2.3999999999999999e-74 < phi1 < -2.05999999999999988e-165 or -1.05000000000000003e-279 < phi1 Initial program 59.6%
hypot-def97.9%
Simplified97.9%
Taylor expanded in phi2 around inf 20.0%
*-commutative20.0%
Simplified20.0%
Final simplification31.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.65e+146) (* lambda1 (- R)) (* R (- phi2 phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.65e+146) {
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 <= (-1.65d+146)) 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 <= -1.65e+146) {
tmp = lambda1 * -R;
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.65e+146: tmp = lambda1 * -R else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.65e+146) 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 <= -1.65e+146) tmp = lambda1 * -R; else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.65e+146], N[(lambda1 * (-R)), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.65 \cdot 10^{+146}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -1.65000000000000008e146Initial program 45.7%
hypot-def90.7%
Simplified90.7%
Taylor expanded in phi1 around 0 80.1%
Taylor expanded in lambda1 around -inf 49.8%
mul-1-neg49.8%
distribute-rgt-neg-in49.8%
distribute-rgt-neg-in49.8%
Simplified49.8%
Taylor expanded in phi2 around 0 62.8%
mul-1-neg62.8%
*-commutative62.8%
distribute-rgt-neg-in62.8%
Simplified62.8%
if -1.65000000000000008e146 < lambda1 Initial program 57.5%
hypot-def96.7%
Simplified96.7%
Taylor expanded in phi1 around -inf 33.4%
*-commutative33.4%
associate-*r*33.4%
distribute-rgt-out34.4%
mul-1-neg34.4%
unsub-neg34.4%
Simplified34.4%
Final simplification39.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 3.4e+36) (* lambda1 (- R)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.4e+36) {
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.4d+36) 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.4e+36) {
tmp = lambda1 * -R;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 3.4e+36: tmp = lambda1 * -R else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 3.4e+36) 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.4e+36) tmp = lambda1 * -R; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 3.4e+36], N[(lambda1 * (-R)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.4 \cdot 10^{+36}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 3.3999999999999998e36Initial program 57.9%
hypot-def96.5%
Simplified96.5%
Taylor expanded in phi1 around 0 90.3%
Taylor expanded in lambda1 around -inf 17.1%
mul-1-neg17.1%
distribute-rgt-neg-in17.1%
distribute-rgt-neg-in17.1%
Simplified17.1%
Taylor expanded in phi2 around 0 18.4%
mul-1-neg18.4%
*-commutative18.4%
distribute-rgt-neg-in18.4%
Simplified18.4%
if 3.3999999999999998e36 < phi2 Initial program 47.3%
hypot-def93.0%
Simplified93.0%
Taylor expanded in phi2 around inf 60.5%
*-commutative60.5%
Simplified60.5%
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.5%
hypot-def95.7%
Simplified95.7%
Taylor expanded in phi1 around 0 90.9%
expm1-log1p-u57.3%
*-commutative57.3%
Applied egg-rr57.3%
Taylor expanded in lambda1 around inf 13.7%
*-commutative13.7%
associate-*l*13.7%
Simplified13.7%
Taylor expanded in phi2 around 0 11.5%
Final simplification11.5%
(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.5%
hypot-def95.7%
Simplified95.7%
Taylor expanded in phi2 around inf 16.2%
*-commutative16.2%
Simplified16.2%
Final simplification16.2%
herbie shell --seed 2023200
(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))))))