
(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 19 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
(pow
(sqrt
(hypot
(*
(-
(* (cos (* phi1 0.5)) (cos (* 0.5 phi2)))
(expm1 (log1p (* (sin (* phi1 0.5)) (sin (* 0.5 phi2))))))
(- lambda1 lambda2))
(- phi1 phi2)))
2.0)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * pow(sqrt(hypot((((cos((phi1 * 0.5)) * cos((0.5 * phi2))) - expm1(log1p((sin((phi1 * 0.5)) * sin((0.5 * phi2)))))) * (lambda1 - lambda2)), (phi1 - phi2))), 2.0);
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.pow(Math.sqrt(Math.hypot((((Math.cos((phi1 * 0.5)) * Math.cos((0.5 * phi2))) - Math.expm1(Math.log1p((Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2)))))) * (lambda1 - lambda2)), (phi1 - phi2))), 2.0);
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.pow(math.sqrt(math.hypot((((math.cos((phi1 * 0.5)) * math.cos((0.5 * phi2))) - math.expm1(math.log1p((math.sin((phi1 * 0.5)) * math.sin((0.5 * phi2)))))) * (lambda1 - lambda2)), (phi1 - phi2))), 2.0)
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * (sqrt(hypot(Float64(Float64(Float64(cos(Float64(phi1 * 0.5)) * cos(Float64(0.5 * phi2))) - expm1(log1p(Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2)))))) * Float64(lambda1 - lambda2)), Float64(phi1 - phi2))) ^ 2.0)) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Power[N[Sqrt[N[Sqrt[N[(N[(N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(Exp[N[Log[1 + N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot {\left(\sqrt{\mathsf{hypot}\left(\left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_2\right) - \mathsf{expm1}\left(\mathsf{log1p}\left(\sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right)\right)\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1 - \phi_2\right)}\right)}^{2}
\end{array}
Initial program 62.7%
hypot-define93.9%
Simplified93.9%
add-sqr-sqrt93.5%
pow293.5%
*-commutative93.5%
div-inv93.5%
metadata-eval93.5%
Applied egg-rr93.5%
*-commutative93.5%
distribute-rgt-in93.5%
*-commutative93.5%
cos-sum99.4%
*-commutative99.4%
*-commutative99.4%
Applied egg-rr99.4%
expm1-log1p-u99.5%
*-commutative99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(pow
(sqrt
(hypot
(+
(* (* (cos (* phi1 0.5)) (cos (* 0.5 phi2))) (- lambda1 lambda2))
(* (* (sin (* phi1 0.5)) (sin (* 0.5 phi2))) (- lambda2 lambda1)))
(- phi1 phi2)))
2.0)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * pow(sqrt(hypot((((cos((phi1 * 0.5)) * cos((0.5 * phi2))) * (lambda1 - lambda2)) + ((sin((phi1 * 0.5)) * sin((0.5 * phi2))) * (lambda2 - lambda1))), (phi1 - phi2))), 2.0);
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.pow(Math.sqrt(Math.hypot((((Math.cos((phi1 * 0.5)) * Math.cos((0.5 * phi2))) * (lambda1 - lambda2)) + ((Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2))) * (lambda2 - lambda1))), (phi1 - phi2))), 2.0);
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.pow(math.sqrt(math.hypot((((math.cos((phi1 * 0.5)) * math.cos((0.5 * phi2))) * (lambda1 - lambda2)) + ((math.sin((phi1 * 0.5)) * math.sin((0.5 * phi2))) * (lambda2 - lambda1))), (phi1 - phi2))), 2.0)
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * (sqrt(hypot(Float64(Float64(Float64(cos(Float64(phi1 * 0.5)) * cos(Float64(0.5 * phi2))) * Float64(lambda1 - lambda2)) + Float64(Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2))) * Float64(lambda2 - lambda1))), Float64(phi1 - phi2))) ^ 2.0)) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * (sqrt(hypot((((cos((phi1 * 0.5)) * cos((0.5 * phi2))) * (lambda1 - lambda2)) + ((sin((phi1 * 0.5)) * sin((0.5 * phi2))) * (lambda2 - lambda1))), (phi1 - phi2))) ^ 2.0); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Power[N[Sqrt[N[Sqrt[N[(N[(N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] + N[(N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot {\left(\sqrt{\mathsf{hypot}\left(\left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_2\right)\right) \cdot \left(\lambda_1 - \lambda_2\right) + \left(\sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right) \cdot \left(\lambda_2 - \lambda_1\right), \phi_1 - \phi_2\right)}\right)}^{2}
\end{array}
Initial program 62.7%
hypot-define93.9%
Simplified93.9%
add-sqr-sqrt93.5%
pow293.5%
*-commutative93.5%
div-inv93.5%
metadata-eval93.5%
Applied egg-rr93.5%
*-commutative93.5%
distribute-rgt-in93.5%
*-commutative93.5%
cos-sum99.4%
*-commutative99.4%
*-commutative99.4%
Applied egg-rr99.4%
expm1-log1p-u99.5%
*-commutative99.5%
Applied egg-rr99.5%
*-commutative99.5%
sub-neg99.5%
distribute-lft-in99.5%
*-commutative99.5%
expm1-log1p-u99.5%
distribute-rgt-neg-in99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(pow
(sqrt
(hypot
(*
(- lambda1 lambda2)
(-
(* (cos (* phi1 0.5)) (cos (* 0.5 phi2)))
(* (sin (* phi1 0.5)) (sin (* 0.5 phi2)))))
(- phi1 phi2)))
2.0)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * pow(sqrt(hypot(((lambda1 - lambda2) * ((cos((phi1 * 0.5)) * cos((0.5 * phi2))) - (sin((phi1 * 0.5)) * sin((0.5 * phi2))))), (phi1 - phi2))), 2.0);
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.pow(Math.sqrt(Math.hypot(((lambda1 - lambda2) * ((Math.cos((phi1 * 0.5)) * Math.cos((0.5 * phi2))) - (Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2))))), (phi1 - phi2))), 2.0);
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.pow(math.sqrt(math.hypot(((lambda1 - lambda2) * ((math.cos((phi1 * 0.5)) * math.cos((0.5 * phi2))) - (math.sin((phi1 * 0.5)) * math.sin((0.5 * phi2))))), (phi1 - phi2))), 2.0)
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * (sqrt(hypot(Float64(Float64(lambda1 - lambda2) * Float64(Float64(cos(Float64(phi1 * 0.5)) * cos(Float64(0.5 * phi2))) - Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2))))), Float64(phi1 - phi2))) ^ 2.0)) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * (sqrt(hypot(((lambda1 - lambda2) * ((cos((phi1 * 0.5)) * cos((0.5 * phi2))) - (sin((phi1 * 0.5)) * sin((0.5 * phi2))))), (phi1 - phi2))) ^ 2.0); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Power[N[Sqrt[N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot {\left(\sqrt{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_2\right) - \sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right), \phi_1 - \phi_2\right)}\right)}^{2}
\end{array}
Initial program 62.7%
hypot-define93.9%
Simplified93.9%
add-sqr-sqrt93.5%
pow293.5%
*-commutative93.5%
div-inv93.5%
metadata-eval93.5%
Applied egg-rr93.5%
*-commutative93.5%
distribute-rgt-in93.5%
*-commutative93.5%
cos-sum99.4%
*-commutative99.4%
*-commutative99.4%
Applied egg-rr99.4%
Final simplification99.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -60000000.0) (* R (hypot (* (cos (* phi1 0.5)) (- lambda1 lambda2)) (- 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 <= -60000000.0) {
tmp = R * hypot((cos((phi1 * 0.5)) * (lambda1 - lambda2)), (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 <= -60000000.0) {
tmp = R * Math.hypot((Math.cos((phi1 * 0.5)) * (lambda1 - lambda2)), (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 <= -60000000.0: tmp = R * math.hypot((math.cos((phi1 * 0.5)) * (lambda1 - lambda2)), (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 <= -60000000.0) tmp = Float64(R * hypot(Float64(cos(Float64(phi1 * 0.5)) * Float64(lambda1 - lambda2)), 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 <= -60000000.0) tmp = R * hypot((cos((phi1 * 0.5)) * (lambda1 - lambda2)), (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, -60000000.0], N[(R * N[Sqrt[N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $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 -60000000:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \left(\lambda_1 - \lambda_2\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 < -6e7Initial program 49.0%
hypot-define85.2%
Simplified85.2%
Taylor expanded in phi2 around 0 85.2%
if -6e7 < phi1 Initial program 68.6%
hypot-define97.7%
Simplified97.7%
Taylor expanded in phi1 around 0 95.0%
Final simplification92.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 4e-107) (* R (hypot (* (cos (* phi1 0.5)) lambda1) (- phi1 phi2))) (* R (hypot (- lambda1 lambda2) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 4e-107) {
tmp = R * hypot((cos((phi1 * 0.5)) * lambda1), (phi1 - phi2));
} 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 (lambda2 <= 4e-107) {
tmp = R * Math.hypot((Math.cos((phi1 * 0.5)) * lambda1), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 4e-107: tmp = R * math.hypot((math.cos((phi1 * 0.5)) * lambda1), (phi1 - phi2)) else: tmp = R * math.hypot((lambda1 - lambda2), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 4e-107) tmp = Float64(R * hypot(Float64(cos(Float64(phi1 * 0.5)) * lambda1), Float64(phi1 - phi2))); 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 (lambda2 <= 4e-107) tmp = R * hypot((cos((phi1 * 0.5)) * lambda1), (phi1 - phi2)); else tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 4e-107], N[(R * N[Sqrt[N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * lambda1), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 4 \cdot 10^{-107}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \lambda_1, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda2 < 4e-107Initial program 66.2%
hypot-define95.7%
Simplified95.7%
Taylor expanded in phi2 around 0 91.4%
Taylor expanded in lambda1 around inf 79.4%
*-commutative79.4%
Simplified79.4%
if 4e-107 < lambda2 Initial program 55.4%
hypot-define90.3%
Simplified90.3%
Taylor expanded in phi2 around 0 85.6%
Taylor expanded in phi1 around 0 82.3%
Final simplification80.4%
(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 62.7%
hypot-define93.9%
Simplified93.9%
Final simplification93.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (cos (* phi1 0.5)) (- lambda1 lambda2)) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((cos((phi1 * 0.5)) * (lambda1 - lambda2)), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot((Math.cos((phi1 * 0.5)) * (lambda1 - lambda2)), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((math.cos((phi1 * 0.5)) * (lambda1 - lambda2)), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(cos(Float64(phi1 * 0.5)) * Float64(lambda1 - lambda2)), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot((cos((phi1 * 0.5)) * (lambda1 - lambda2)), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 62.7%
hypot-define93.9%
Simplified93.9%
Taylor expanded in phi2 around 0 89.5%
Final simplification89.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -7e-19) (* R (* phi1 (+ (/ phi2 phi1) -1.0))) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -7e-19) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} 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 <= -7e-19) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -7e-19: tmp = R * (phi1 * ((phi2 / phi1) + -1.0)) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -7e-19) tmp = Float64(R * Float64(phi1 * Float64(Float64(phi2 / phi1) + -1.0))); 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 <= -7e-19) tmp = R * (phi1 * ((phi2 / phi1) + -1.0)); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -7e-19], N[(R * N[(phi1 * N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision]), $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 -7 \cdot 10^{-19}:\\
\;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -7.00000000000000031e-19Initial program 51.5%
hypot-define86.0%
Simplified86.0%
Taylor expanded in phi1 around -inf 56.4%
mul-1-neg56.4%
distribute-rgt-neg-in56.4%
mul-1-neg56.4%
unsub-neg56.4%
Simplified56.4%
if -7.00000000000000031e-19 < phi1 Initial program 67.9%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi2 around 0 91.2%
Taylor expanded in phi1 around 0 56.3%
unpow256.3%
unpow256.3%
hypot-define76.4%
Simplified76.4%
Final simplification70.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.3e-39) (* R (hypot (- lambda1 lambda2) phi1)) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.3e-39) {
tmp = R * hypot((lambda1 - lambda2), 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.3e-39) {
tmp = R * Math.hypot((lambda1 - lambda2), phi1);
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.3e-39: tmp = R * math.hypot((lambda1 - lambda2), phi1) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.3e-39) tmp = Float64(R * hypot(Float64(lambda1 - lambda2), 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.3e-39) tmp = R * hypot((lambda1 - lambda2), phi1); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.3e-39], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + phi1 ^ 2], $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.3 \cdot 10^{-39}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_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.3e-39Initial program 52.7%
hypot-define86.9%
Simplified86.9%
Taylor expanded in phi1 around 0 78.5%
Taylor expanded in phi2 around 0 45.2%
+-commutative45.2%
unpow245.2%
unpow245.2%
hypot-define62.5%
Simplified62.5%
if -1.3e-39 < phi1 Initial program 67.8%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi2 around 0 91.7%
Taylor expanded in phi1 around 0 55.9%
unpow255.9%
unpow255.9%
hypot-define76.4%
Simplified76.4%
Final simplification71.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -7e-19) (* R (* phi1 (+ (/ phi2 phi1) -1.0))) (* R (hypot phi2 lambda1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -7e-19) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} 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 <= -7e-19) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else {
tmp = R * Math.hypot(phi2, lambda1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -7e-19: tmp = R * (phi1 * ((phi2 / phi1) + -1.0)) else: tmp = R * math.hypot(phi2, lambda1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -7e-19) tmp = Float64(R * Float64(phi1 * Float64(Float64(phi2 / phi1) + -1.0))); 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 <= -7e-19) tmp = R * (phi1 * ((phi2 / phi1) + -1.0)); else tmp = R * hypot(phi2, lambda1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -7e-19], N[(R * N[(phi1 * N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + lambda1 ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -7 \cdot 10^{-19}:\\
\;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -7.00000000000000031e-19Initial program 51.5%
hypot-define86.0%
Simplified86.0%
Taylor expanded in phi1 around -inf 56.4%
mul-1-neg56.4%
distribute-rgt-neg-in56.4%
mul-1-neg56.4%
unsub-neg56.4%
Simplified56.4%
if -7.00000000000000031e-19 < phi1 Initial program 67.9%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi2 around 0 91.2%
Taylor expanded in lambda1 around inf 72.6%
*-commutative72.6%
Simplified72.6%
Taylor expanded in phi1 around 0 42.6%
+-commutative42.6%
unpow242.6%
unpow242.6%
hypot-define57.2%
Simplified57.2%
Final simplification57.0%
(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 62.7%
hypot-define93.9%
Simplified93.9%
Taylor expanded in phi2 around 0 89.5%
Taylor expanded in phi1 around 0 85.0%
Final simplification85.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 5.2e+118) (- (* R phi2) (* R phi1)) (* phi2 (* phi1 (- (/ R phi1) (/ R phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 5.2e+118) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi2 * (phi1 * ((R / phi1) - (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 (r <= 5.2d+118) then
tmp = (r * phi2) - (r * phi1)
else
tmp = phi2 * (phi1 * ((r / phi1) - (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 (R <= 5.2e+118) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi2 * (phi1 * ((R / phi1) - (R / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 5.2e+118: tmp = (R * phi2) - (R * phi1) else: tmp = phi2 * (phi1 * ((R / phi1) - (R / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 5.2e+118) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); else tmp = Float64(phi2 * Float64(phi1 * Float64(Float64(R / phi1) - Float64(R / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 5.2e+118) tmp = (R * phi2) - (R * phi1); else tmp = phi2 * (phi1 * ((R / phi1) - (R / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 5.2e+118], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(phi1 * N[(N[(R / phi1), $MachinePrecision] - N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 5.2 \cdot 10^{+118}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(\phi_1 \cdot \left(\frac{R}{\phi_1} - \frac{R}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if R < 5.20000000000000032e118Initial program 58.3%
hypot-define93.5%
Simplified93.5%
Taylor expanded in phi2 around inf 26.1%
associate-*r/26.1%
mul-1-neg26.1%
*-commutative26.1%
Simplified26.1%
Taylor expanded in phi2 around 0 28.1%
+-commutative28.1%
mul-1-neg28.1%
unsub-neg28.1%
*-commutative28.1%
*-commutative28.1%
Simplified28.1%
if 5.20000000000000032e118 < R Initial program 97.3%
hypot-define97.3%
Simplified97.3%
Taylor expanded in phi2 around inf 45.8%
associate-*r/45.8%
mul-1-neg45.8%
*-commutative45.8%
Simplified45.8%
Taylor expanded in phi1 around inf 45.5%
mul-1-neg45.5%
distribute-frac-neg45.5%
+-commutative45.5%
distribute-frac-neg45.5%
unsub-neg45.5%
Simplified45.5%
Final simplification30.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 3.5e+114) (- (* R phi2) (* R phi1)) (* R (* phi2 (- 1.0 (/ phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 3.5e+114) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = R * (phi2 * (1.0 - (phi1 / 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 (r <= 3.5d+114) then
tmp = (r * phi2) - (r * phi1)
else
tmp = r * (phi2 * (1.0d0 - (phi1 / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 3.5e+114) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 3.5e+114: tmp = (R * phi2) - (R * phi1) else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 3.5e+114) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); else tmp = Float64(R * Float64(phi2 * Float64(1.0 - Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 3.5e+114) tmp = (R * phi2) - (R * phi1); else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 3.5e+114], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 3.5 \cdot 10^{+114}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if R < 3.5000000000000001e114Initial program 58.1%
hypot-define93.5%
Simplified93.5%
Taylor expanded in phi2 around inf 26.2%
associate-*r/26.2%
mul-1-neg26.2%
*-commutative26.2%
Simplified26.2%
Taylor expanded in phi2 around 0 28.2%
+-commutative28.2%
mul-1-neg28.2%
unsub-neg28.2%
*-commutative28.2%
*-commutative28.2%
Simplified28.2%
if 3.5000000000000001e114 < R Initial program 97.4%
hypot-define97.4%
Simplified97.4%
Taylor expanded in phi2 around inf 38.2%
mul-1-neg38.2%
unsub-neg38.2%
Simplified38.2%
Final simplification29.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 2e+101) (- (* R phi2) (* R phi1)) (* phi1 (- (* R (/ phi2 phi1)) R))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 2e+101) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
}
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 (r <= 2d+101) then
tmp = (r * phi2) - (r * phi1)
else
tmp = phi1 * ((r * (phi2 / phi1)) - r)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 2e+101) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 2e+101: tmp = (R * phi2) - (R * phi1) else: tmp = phi1 * ((R * (phi2 / phi1)) - R) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 2e+101) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); else tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 2e+101) tmp = (R * phi2) - (R * phi1); else tmp = phi1 * ((R * (phi2 / phi1)) - R); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 2e+101], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 2 \cdot 10^{+101}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\end{array}
\end{array}
if R < 2e101Initial program 57.7%
hypot-define93.4%
Simplified93.4%
Taylor expanded in phi2 around inf 25.9%
associate-*r/25.9%
mul-1-neg25.9%
*-commutative25.9%
Simplified25.9%
Taylor expanded in phi2 around 0 27.5%
+-commutative27.5%
mul-1-neg27.5%
unsub-neg27.5%
*-commutative27.5%
*-commutative27.5%
Simplified27.5%
if 2e101 < R Initial program 97.6%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi2 around inf 45.0%
associate-*r/45.0%
mul-1-neg45.0%
*-commutative45.0%
Simplified45.0%
Taylor expanded in phi1 around inf 29.8%
neg-mul-129.8%
+-commutative29.8%
unsub-neg29.8%
associate-/l*39.1%
Simplified39.1%
Final simplification29.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 4.25e+114) (- (* R phi2) (* R phi1)) (* phi2 (- R (* phi1 (/ R phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 4.25e+114) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi2 * (R - (phi1 * (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 (r <= 4.25d+114) then
tmp = (r * phi2) - (r * phi1)
else
tmp = phi2 * (r - (phi1 * (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 (R <= 4.25e+114) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi2 * (R - (phi1 * (R / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 4.25e+114: tmp = (R * phi2) - (R * phi1) else: tmp = phi2 * (R - (phi1 * (R / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 4.25e+114) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); else tmp = Float64(phi2 * Float64(R - Float64(phi1 * Float64(R / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 4.25e+114) tmp = (R * phi2) - (R * phi1); else tmp = phi2 * (R - (phi1 * (R / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 4.25e+114], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 4.25 \cdot 10^{+114}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - \phi_1 \cdot \frac{R}{\phi_2}\right)\\
\end{array}
\end{array}
if R < 4.2500000000000001e114Initial program 58.1%
hypot-define93.5%
Simplified93.5%
Taylor expanded in phi2 around inf 26.2%
associate-*r/26.2%
mul-1-neg26.2%
*-commutative26.2%
Simplified26.2%
Taylor expanded in phi2 around 0 28.2%
+-commutative28.2%
mul-1-neg28.2%
unsub-neg28.2%
*-commutative28.2%
*-commutative28.2%
Simplified28.2%
if 4.2500000000000001e114 < R Initial program 97.4%
hypot-define97.4%
Simplified97.4%
Taylor expanded in phi2 around inf 44.5%
mul-1-neg44.5%
unsub-neg44.5%
*-commutative44.5%
associate-/l*44.3%
Simplified44.3%
Final simplification30.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -5.8e+34) (* R (- phi1)) (- (* R phi2) (* R phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -5.8e+34) {
tmp = R * -phi1;
} else {
tmp = (R * phi2) - (R * phi1);
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= (-5.8d+34)) then
tmp = r * -phi1
else
tmp = (r * phi2) - (r * phi1)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -5.8e+34) {
tmp = R * -phi1;
} else {
tmp = (R * phi2) - (R * phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -5.8e+34: tmp = R * -phi1 else: tmp = (R * phi2) - (R * phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -5.8e+34) tmp = Float64(R * Float64(-phi1)); else tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= -5.8e+34) tmp = R * -phi1; else tmp = (R * phi2) - (R * phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -5.8e+34], N[(R * (-phi1)), $MachinePrecision], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -5.8 \cdot 10^{+34}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\end{array}
\end{array}
if phi2 < -5.8000000000000003e34Initial program 56.8%
hypot-define92.5%
Simplified92.5%
Taylor expanded in phi1 around -inf 17.6%
mul-1-neg17.6%
*-commutative17.6%
distribute-rgt-neg-in17.6%
Simplified17.6%
if -5.8000000000000003e34 < phi2 Initial program 64.7%
hypot-define94.4%
Simplified94.4%
Taylor expanded in phi2 around inf 32.6%
associate-*r/32.6%
mul-1-neg32.6%
*-commutative32.6%
Simplified32.6%
Taylor expanded in phi2 around 0 35.6%
+-commutative35.6%
mul-1-neg35.6%
unsub-neg35.6%
*-commutative35.6%
*-commutative35.6%
Simplified35.6%
Final simplification31.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -3.2e-40) (* R (- phi1)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.2e-40) {
tmp = R * -phi1;
} 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 <= (-3.2d-40)) then
tmp = r * -phi1
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 <= -3.2e-40) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -3.2e-40: tmp = R * -phi1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -3.2e-40) tmp = Float64(R * Float64(-phi1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -3.2e-40) tmp = R * -phi1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -3.2e-40], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -3.2 \cdot 10^{-40}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -3.20000000000000002e-40Initial program 52.7%
hypot-define86.9%
Simplified86.9%
Taylor expanded in phi1 around -inf 50.3%
mul-1-neg50.3%
*-commutative50.3%
distribute-rgt-neg-in50.3%
Simplified50.3%
if -3.20000000000000002e-40 < phi1 Initial program 67.8%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi2 around inf 20.2%
*-commutative20.2%
Simplified20.2%
Final simplification30.4%
(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 62.7%
hypot-define93.9%
Simplified93.9%
Taylor expanded in phi2 around 0 89.5%
Taylor expanded in lambda1 around inf 14.6%
Taylor expanded in phi1 around 0 13.1%
*-commutative13.1%
Simplified13.1%
Final simplification13.1%
(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 62.7%
hypot-define93.9%
Simplified93.9%
Taylor expanded in phi2 around inf 16.6%
*-commutative16.6%
Simplified16.6%
Final simplification16.6%
herbie shell --seed 2024071
(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))))))