
(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 18 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)
(expm1
(log1p
(-
(* (cos (* phi2 0.5)) (cos (* 0.5 phi1)))
(log1p (expm1 (* (sin (* phi2 0.5)) (sin (* 0.5 phi1)))))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * expm1(log1p(((cos((phi2 * 0.5)) * cos((0.5 * phi1))) - log1p(expm1((sin((phi2 * 0.5)) * sin((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.expm1(Math.log1p(((Math.cos((phi2 * 0.5)) * Math.cos((0.5 * phi1))) - Math.log1p(Math.expm1((Math.sin((phi2 * 0.5)) * Math.sin((0.5 * phi1))))))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.expm1(math.log1p(((math.cos((phi2 * 0.5)) * math.cos((0.5 * phi1))) - math.log1p(math.expm1((math.sin((phi2 * 0.5)) * math.sin((0.5 * phi1))))))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * expm1(log1p(Float64(Float64(cos(Float64(phi2 * 0.5)) * cos(Float64(0.5 * phi1))) - log1p(expm1(Float64(sin(Float64(phi2 * 0.5)) * sin(Float64(0.5 * phi1))))))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(Exp[N[Log[1 + N[(N[(N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[Log[1 + N[(Exp[N[(N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]] - 1), $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{expm1}\left(\mathsf{log1p}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_1\right) - \mathsf{log1p}\left(\mathsf{expm1}\left(\sin \left(\phi_2 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\right)\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 63.8%
hypot-def97.1%
Simplified97.1%
expm1-log1p-u97.1%
div-inv97.1%
metadata-eval97.1%
Applied egg-rr97.1%
*-commutative97.1%
+-commutative97.1%
distribute-lft-in97.1%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
log1p-expm1-u99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(expm1
(log1p
(-
(* (cos (* phi2 0.5)) (cos (* 0.5 phi1)))
(* (sin (* phi2 0.5)) (sin (* 0.5 phi1)))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * expm1(log1p(((cos((phi2 * 0.5)) * cos((0.5 * phi1))) - (sin((phi2 * 0.5)) * sin((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.expm1(Math.log1p(((Math.cos((phi2 * 0.5)) * Math.cos((0.5 * phi1))) - (Math.sin((phi2 * 0.5)) * Math.sin((0.5 * phi1))))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.expm1(math.log1p(((math.cos((phi2 * 0.5)) * math.cos((0.5 * phi1))) - (math.sin((phi2 * 0.5)) * math.sin((0.5 * phi1))))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * expm1(log1p(Float64(Float64(cos(Float64(phi2 * 0.5)) * cos(Float64(0.5 * phi1))) - Float64(sin(Float64(phi2 * 0.5)) * sin(Float64(0.5 * phi1))))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(Exp[N[Log[1 + N[(N[(N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]] - 1), $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{expm1}\left(\mathsf{log1p}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_1\right) - \sin \left(\phi_2 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 63.8%
hypot-def97.1%
Simplified97.1%
expm1-log1p-u97.1%
div-inv97.1%
metadata-eval97.1%
Applied egg-rr97.1%
*-commutative97.1%
+-commutative97.1%
distribute-lft-in97.1%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(-
(* (* (cos (* phi2 0.5)) (cos (* 0.5 phi1))) (+ lambda1 lambda2))
(* (* (sin (* phi2 0.5)) (sin (* 0.5 phi1))) (+ lambda1 lambda2)))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((cos((phi2 * 0.5)) * cos((0.5 * phi1))) * (lambda1 + lambda2)) - ((sin((phi2 * 0.5)) * sin((0.5 * phi1))) * (lambda1 + lambda2))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot((((Math.cos((phi2 * 0.5)) * Math.cos((0.5 * phi1))) * (lambda1 + lambda2)) - ((Math.sin((phi2 * 0.5)) * Math.sin((0.5 * phi1))) * (lambda1 + lambda2))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((math.cos((phi2 * 0.5)) * math.cos((0.5 * phi1))) * (lambda1 + lambda2)) - ((math.sin((phi2 * 0.5)) * math.sin((0.5 * phi1))) * (lambda1 + lambda2))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(Float64(cos(Float64(phi2 * 0.5)) * cos(Float64(0.5 * phi1))) * Float64(lambda1 + lambda2)) - Float64(Float64(sin(Float64(phi2 * 0.5)) * sin(Float64(0.5 * phi1))) * Float64(lambda1 + lambda2))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot((((cos((phi2 * 0.5)) * cos((0.5 * phi1))) * (lambda1 + lambda2)) - ((sin((phi2 * 0.5)) * sin((0.5 * phi1))) * (lambda1 + lambda2))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(N[(N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(lambda1 + lambda2), $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(lambda1 + lambda2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right) \cdot \left(\lambda_1 + \lambda_2\right) - \left(\sin \left(\phi_2 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\right) \cdot \left(\lambda_1 + \lambda_2\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 63.8%
hypot-def97.1%
Simplified97.1%
expm1-log1p-u97.1%
div-inv97.1%
metadata-eval97.1%
Applied egg-rr97.1%
*-commutative97.1%
+-commutative97.1%
distribute-lft-in97.1%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
expm1-log1p-u99.9%
sub-neg99.9%
distribute-lft-in99.9%
sub-neg99.9%
add-sqr-sqrt51.5%
sqrt-unprod85.7%
sqr-neg85.7%
sqrt-unprod46.5%
add-sqr-sqrt97.4%
*-commutative97.4%
Applied egg-rr99.4%
Final simplification99.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 0.00092) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))) (* R (hypot (* (- lambda1 lambda2) (cos (* phi2 0.5))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.00092) {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.00092) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.00092: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi2 * 0.5))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.00092) 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(phi2 * 0.5))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 0.00092) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.00092], 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[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.00092:\\
\;\;\;\;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(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 9.2000000000000003e-4Initial program 65.1%
hypot-def97.9%
Simplified97.9%
Taylor expanded in phi2 around 0 91.8%
if 9.2000000000000003e-4 < phi2 Initial program 60.1%
hypot-def95.0%
Simplified95.0%
Taylor expanded in phi1 around 0 95.1%
Final simplification92.7%
(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 63.8%
hypot-def97.1%
Simplified97.1%
Final simplification97.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -5e-61) (* R (hypot (- lambda1 lambda2) (- phi1 phi2))) (* R (hypot (* lambda2 (cos (* phi2 0.5))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -5e-61) {
tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -5e-61) {
tmp = R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * Math.cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -5e-61: tmp = R * math.hypot((lambda1 - lambda2), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * math.cos((phi2 * 0.5))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -5e-61) tmp = Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -5e-61) tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); else tmp = R * hypot((lambda2 * cos((phi2 * 0.5))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -5e-61], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -5 \cdot 10^{-61}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -4.9999999999999999e-61Initial program 58.3%
hypot-def96.0%
Simplified96.0%
Taylor expanded in phi1 around 0 85.3%
Taylor expanded in phi2 around 0 75.3%
if -4.9999999999999999e-61 < lambda1 Initial program 65.9%
hypot-def97.6%
Simplified97.6%
Taylor expanded in phi1 around 0 93.7%
Taylor expanded in lambda1 around 0 80.6%
mul-1-neg80.6%
*-commutative80.6%
distribute-rgt-neg-in80.6%
Simplified80.6%
expm1-log1p-u61.7%
expm1-udef61.0%
*-commutative61.0%
add-sqr-sqrt33.1%
sqrt-unprod61.6%
sqr-neg61.6%
sqrt-unprod32.6%
add-sqr-sqrt58.6%
Applied egg-rr58.6%
expm1-def59.4%
expm1-log1p80.6%
*-commutative80.6%
Simplified80.6%
Final simplification79.1%
(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 63.8%
hypot-def97.1%
Simplified97.1%
Taylor expanded in phi2 around 0 90.0%
Final simplification90.0%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* R (hypot phi1 lambda2))))
(if (<= phi2 1.5e-155)
t_0
(if (<= phi2 7e-69)
(* R (- lambda2 lambda1))
(if (<= phi2 2.3e+19) t_0 (* R (- phi2 phi1)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * hypot(phi1, lambda2);
double tmp;
if (phi2 <= 1.5e-155) {
tmp = t_0;
} else if (phi2 <= 7e-69) {
tmp = R * (lambda2 - lambda1);
} else if (phi2 <= 2.3e+19) {
tmp = t_0;
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * Math.hypot(phi1, lambda2);
double tmp;
if (phi2 <= 1.5e-155) {
tmp = t_0;
} else if (phi2 <= 7e-69) {
tmp = R * (lambda2 - lambda1);
} else if (phi2 <= 2.3e+19) {
tmp = t_0;
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = R * math.hypot(phi1, lambda2) tmp = 0 if phi2 <= 1.5e-155: tmp = t_0 elif phi2 <= 7e-69: tmp = R * (lambda2 - lambda1) elif phi2 <= 2.3e+19: tmp = t_0 else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * hypot(phi1, lambda2)) tmp = 0.0 if (phi2 <= 1.5e-155) tmp = t_0; elseif (phi2 <= 7e-69) tmp = Float64(R * Float64(lambda2 - lambda1)); elseif (phi2 <= 2.3e+19) tmp = t_0; else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = R * hypot(phi1, lambda2); tmp = 0.0; if (phi2 <= 1.5e-155) tmp = t_0; elseif (phi2 <= 7e-69) tmp = R * (lambda2 - lambda1); elseif (phi2 <= 2.3e+19) tmp = t_0; else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * N[Sqrt[phi1 ^ 2 + lambda2 ^ 2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 1.5e-155], t$95$0, If[LessEqual[phi2, 7e-69], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2.3e+19], t$95$0, N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := R \cdot \mathsf{hypot}\left(\phi_1, \lambda_2\right)\\
\mathbf{if}\;\phi_2 \leq 1.5 \cdot 10^{-155}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\phi_2 \leq 7 \cdot 10^{-69}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{elif}\;\phi_2 \leq 2.3 \cdot 10^{+19}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < 1.49999999999999992e-155 or 7.0000000000000003e-69 < phi2 < 2.3e19Initial program 65.9%
hypot-def97.7%
Simplified97.7%
Taylor expanded in phi1 around 0 90.3%
Taylor expanded in lambda1 around 0 72.1%
mul-1-neg72.1%
*-commutative72.1%
distribute-rgt-neg-in72.1%
Simplified72.1%
Taylor expanded in phi2 around 0 40.9%
+-commutative40.9%
unpow240.9%
unpow240.9%
hypot-def50.6%
Simplified50.6%
if 1.49999999999999992e-155 < phi2 < 7.0000000000000003e-69Initial program 60.2%
hypot-def99.8%
Simplified99.8%
Taylor expanded in phi1 around 0 88.3%
Taylor expanded in phi2 around 0 88.3%
Taylor expanded in lambda1 around -inf 34.1%
mul-1-neg34.1%
unsub-neg34.1%
Simplified34.1%
if 2.3e19 < phi2 Initial program 59.4%
hypot-def95.0%
Simplified95.0%
Taylor expanded in phi1 around -inf 68.6%
mul-1-neg68.6%
unsub-neg68.6%
Simplified68.6%
Final simplification53.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -2.8e-26) (* R (hypot (- lambda2) (- phi1 phi2))) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.8e-26) {
tmp = R * hypot(-lambda2, (phi1 - phi2));
} 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 <= -2.8e-26) {
tmp = R * Math.hypot(-lambda2, (phi1 - phi2));
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -2.8e-26: tmp = R * math.hypot(-lambda2, (phi1 - phi2)) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -2.8e-26) tmp = Float64(R * hypot(Float64(-lambda2), Float64(phi1 - phi2))); 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 <= -2.8e-26) tmp = R * hypot(-lambda2, (phi1 - phi2)); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -2.8e-26], N[(R * N[Sqrt[(-lambda2) ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 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 -2.8 \cdot 10^{-26}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(-\lambda_2, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -2.8000000000000001e-26Initial program 56.5%
hypot-def97.7%
Simplified97.7%
Taylor expanded in phi1 around 0 87.0%
Taylor expanded in lambda1 around 0 82.4%
mul-1-neg82.4%
*-commutative82.4%
distribute-rgt-neg-in82.4%
Simplified82.4%
Taylor expanded in phi2 around 0 80.0%
mul-1-neg80.0%
Simplified80.0%
if -2.8000000000000001e-26 < phi1 Initial program 66.3%
hypot-def96.9%
Simplified96.9%
Taylor expanded in phi1 around 0 92.9%
Taylor expanded in phi2 around 0 84.6%
Taylor expanded in phi1 around 0 55.9%
unpow255.9%
unpow255.9%
hypot-def73.8%
Simplified73.8%
Final simplification75.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 3.3e+19) (* R (hypot phi1 (- lambda1 lambda2))) (* R (- phi2 phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.3e+19) {
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 <= 3.3e+19) {
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 <= 3.3e+19: 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 <= 3.3e+19) 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 <= 3.3e+19) 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, 3.3e+19], 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 3.3 \cdot 10^{+19}:\\
\;\;\;\;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 < 3.3e19Initial program 65.3%
hypot-def97.9%
Simplified97.9%
Taylor expanded in phi1 around 0 90.1%
Taylor expanded in phi2 around 0 54.1%
unpow254.1%
unpow254.1%
hypot-def71.3%
Simplified71.3%
if 3.3e19 < phi2 Initial program 59.4%
hypot-def95.0%
Simplified95.0%
Taylor expanded in phi1 around -inf 68.6%
mul-1-neg68.6%
unsub-neg68.6%
Simplified68.6%
Final simplification70.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.5e-64) (* R (hypot phi1 (- lambda1 lambda2))) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.5e-64) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.5e-64) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.5e-64: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.5e-64) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -1.5e-64) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.5e-64], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 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.5 \cdot 10^{-64}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -1.5e-64Initial program 59.5%
hypot-def98.1%
Simplified98.1%
Taylor expanded in phi1 around 0 89.3%
Taylor expanded in phi2 around 0 50.4%
unpow250.4%
unpow250.4%
hypot-def69.0%
Simplified69.0%
if -1.5e-64 < phi1 Initial program 65.7%
hypot-def96.7%
Simplified96.7%
Taylor expanded in phi1 around 0 92.3%
Taylor expanded in phi2 around 0 84.8%
Taylor expanded in phi1 around 0 56.0%
unpow256.0%
unpow256.0%
hypot-def74.1%
Simplified74.1%
Final simplification72.5%
(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 63.8%
hypot-def97.1%
Simplified97.1%
Taylor expanded in phi1 around 0 91.4%
Taylor expanded in phi2 around 0 84.6%
Final simplification84.6%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -4e-30)
(- (* R phi1))
(if (<= phi1 -8.2e-63)
(* lambda1 (- R))
(if (or (<= phi1 -4.8e-96)
(and (not (<= phi1 -9.2e-281)) (<= phi1 5.2e-244)))
(* R lambda2)
(* R phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -4e-30) {
tmp = -(R * phi1);
} else if (phi1 <= -8.2e-63) {
tmp = lambda1 * -R;
} else if ((phi1 <= -4.8e-96) || (!(phi1 <= -9.2e-281) && (phi1 <= 5.2e-244))) {
tmp = R * lambda2;
} 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 <= (-4d-30)) then
tmp = -(r * phi1)
else if (phi1 <= (-8.2d-63)) then
tmp = lambda1 * -r
else if ((phi1 <= (-4.8d-96)) .or. (.not. (phi1 <= (-9.2d-281))) .and. (phi1 <= 5.2d-244)) then
tmp = r * lambda2
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 <= -4e-30) {
tmp = -(R * phi1);
} else if (phi1 <= -8.2e-63) {
tmp = lambda1 * -R;
} else if ((phi1 <= -4.8e-96) || (!(phi1 <= -9.2e-281) && (phi1 <= 5.2e-244))) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -4e-30: tmp = -(R * phi1) elif phi1 <= -8.2e-63: tmp = lambda1 * -R elif (phi1 <= -4.8e-96) or (not (phi1 <= -9.2e-281) and (phi1 <= 5.2e-244)): tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -4e-30) tmp = Float64(-Float64(R * phi1)); elseif (phi1 <= -8.2e-63) tmp = Float64(lambda1 * Float64(-R)); elseif ((phi1 <= -4.8e-96) || (!(phi1 <= -9.2e-281) && (phi1 <= 5.2e-244))) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -4e-30) tmp = -(R * phi1); elseif (phi1 <= -8.2e-63) tmp = lambda1 * -R; elseif ((phi1 <= -4.8e-96) || (~((phi1 <= -9.2e-281)) && (phi1 <= 5.2e-244))) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -4e-30], (-N[(R * phi1), $MachinePrecision]), If[LessEqual[phi1, -8.2e-63], N[(lambda1 * (-R)), $MachinePrecision], If[Or[LessEqual[phi1, -4.8e-96], And[N[Not[LessEqual[phi1, -9.2e-281]], $MachinePrecision], LessEqual[phi1, 5.2e-244]]], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -4 \cdot 10^{-30}:\\
\;\;\;\;-R \cdot \phi_1\\
\mathbf{elif}\;\phi_1 \leq -8.2 \cdot 10^{-63}:\\
\;\;\;\;\lambda_1 \cdot \left(-R\right)\\
\mathbf{elif}\;\phi_1 \leq -4.8 \cdot 10^{-96} \lor \neg \left(\phi_1 \leq -9.2 \cdot 10^{-281}\right) \land \phi_1 \leq 5.2 \cdot 10^{-244}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -4e-30Initial program 55.8%
hypot-def97.8%
Simplified97.8%
Taylor expanded in phi1 around -inf 59.1%
mul-1-neg59.1%
*-commutative59.1%
distribute-rgt-neg-in59.1%
Simplified59.1%
if -4e-30 < phi1 < -8.1999999999999995e-63Initial program 76.3%
hypot-def99.7%
Simplified99.7%
Taylor expanded in phi1 around 0 99.7%
Taylor expanded in phi2 around 0 81.2%
Taylor expanded in lambda1 around -inf 27.7%
mul-1-neg27.7%
*-commutative27.7%
distribute-rgt-neg-in27.7%
Simplified27.7%
if -8.1999999999999995e-63 < phi1 < -4.80000000000000038e-96 or -9.19999999999999956e-281 < phi1 < 5.2000000000000003e-244Initial program 76.2%
hypot-def100.0%
Simplified100.0%
Taylor expanded in phi1 around 0 100.0%
Taylor expanded in phi2 around 0 94.0%
Taylor expanded in lambda2 around inf 27.7%
*-commutative27.7%
Simplified27.7%
if -4.80000000000000038e-96 < phi1 < -9.19999999999999956e-281 or 5.2000000000000003e-244 < phi1 Initial program 63.7%
hypot-def96.0%
Simplified96.0%
Taylor expanded in phi2 around inf 19.6%
*-commutative19.6%
Simplified19.6%
Final simplification31.2%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* lambda1 (- R))))
(if (<= phi2 -2.1e-240)
(* R lambda2)
(if (<= phi2 1.22e-304)
t_0
(if (<= phi2 6.1e-148)
(* R lambda2)
(if (<= phi2 3.4e-44)
t_0
(if (<= phi2 2.7e+19) (* R lambda2) (* R phi2))))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = lambda1 * -R;
double tmp;
if (phi2 <= -2.1e-240) {
tmp = R * lambda2;
} else if (phi2 <= 1.22e-304) {
tmp = t_0;
} else if (phi2 <= 6.1e-148) {
tmp = R * lambda2;
} else if (phi2 <= 3.4e-44) {
tmp = t_0;
} else if (phi2 <= 2.7e+19) {
tmp = R * lambda2;
} 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) :: t_0
real(8) :: tmp
t_0 = lambda1 * -r
if (phi2 <= (-2.1d-240)) then
tmp = r * lambda2
else if (phi2 <= 1.22d-304) then
tmp = t_0
else if (phi2 <= 6.1d-148) then
tmp = r * lambda2
else if (phi2 <= 3.4d-44) then
tmp = t_0
else if (phi2 <= 2.7d+19) then
tmp = r * lambda2
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 t_0 = lambda1 * -R;
double tmp;
if (phi2 <= -2.1e-240) {
tmp = R * lambda2;
} else if (phi2 <= 1.22e-304) {
tmp = t_0;
} else if (phi2 <= 6.1e-148) {
tmp = R * lambda2;
} else if (phi2 <= 3.4e-44) {
tmp = t_0;
} else if (phi2 <= 2.7e+19) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = lambda1 * -R tmp = 0 if phi2 <= -2.1e-240: tmp = R * lambda2 elif phi2 <= 1.22e-304: tmp = t_0 elif phi2 <= 6.1e-148: tmp = R * lambda2 elif phi2 <= 3.4e-44: tmp = t_0 elif phi2 <= 2.7e+19: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(lambda1 * Float64(-R)) tmp = 0.0 if (phi2 <= -2.1e-240) tmp = Float64(R * lambda2); elseif (phi2 <= 1.22e-304) tmp = t_0; elseif (phi2 <= 6.1e-148) tmp = Float64(R * lambda2); elseif (phi2 <= 3.4e-44) tmp = t_0; elseif (phi2 <= 2.7e+19) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = lambda1 * -R; tmp = 0.0; if (phi2 <= -2.1e-240) tmp = R * lambda2; elseif (phi2 <= 1.22e-304) tmp = t_0; elseif (phi2 <= 6.1e-148) tmp = R * lambda2; elseif (phi2 <= 3.4e-44) tmp = t_0; elseif (phi2 <= 2.7e+19) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(lambda1 * (-R)), $MachinePrecision]}, If[LessEqual[phi2, -2.1e-240], N[(R * lambda2), $MachinePrecision], If[LessEqual[phi2, 1.22e-304], t$95$0, If[LessEqual[phi2, 6.1e-148], N[(R * lambda2), $MachinePrecision], If[LessEqual[phi2, 3.4e-44], t$95$0, If[LessEqual[phi2, 2.7e+19], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \lambda_1 \cdot \left(-R\right)\\
\mathbf{if}\;\phi_2 \leq -2.1 \cdot 10^{-240}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{elif}\;\phi_2 \leq 1.22 \cdot 10^{-304}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\phi_2 \leq 6.1 \cdot 10^{-148}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{elif}\;\phi_2 \leq 3.4 \cdot 10^{-44}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\phi_2 \leq 2.7 \cdot 10^{+19}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -2.09999999999999994e-240 or 1.22e-304 < phi2 < 6.09999999999999976e-148 or 3.40000000000000016e-44 < phi2 < 2.7e19Initial program 63.0%
hypot-def97.2%
Simplified97.2%
Taylor expanded in phi1 around 0 90.8%
Taylor expanded in phi2 around 0 83.6%
Taylor expanded in lambda2 around inf 12.9%
*-commutative12.9%
Simplified12.9%
if -2.09999999999999994e-240 < phi2 < 1.22e-304 or 6.09999999999999976e-148 < phi2 < 3.40000000000000016e-44Initial program 72.8%
hypot-def99.9%
Simplified99.9%
Taylor expanded in phi1 around 0 87.9%
Taylor expanded in phi2 around 0 87.9%
Taylor expanded in lambda1 around -inf 19.4%
mul-1-neg19.4%
*-commutative19.4%
distribute-rgt-neg-in19.4%
Simplified19.4%
if 2.7e19 < phi2 Initial program 59.4%
hypot-def95.0%
Simplified95.0%
Taylor expanded in phi2 around inf 60.3%
*-commutative60.3%
Simplified60.3%
Final simplification26.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (or (<= phi2 -1.45e-128) (not (<= phi2 2.55e+19))) (* R (- phi2 phi1)) (* R (- lambda2 lambda1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.45e-128) || !(phi2 <= 2.55e+19)) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 - lambda1);
}
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 <= (-1.45d-128)) .or. (.not. (phi2 <= 2.55d+19))) then
tmp = r * (phi2 - phi1)
else
tmp = r * (lambda2 - lambda1)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((phi2 <= -1.45e-128) || !(phi2 <= 2.55e+19)) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 - lambda1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if (phi2 <= -1.45e-128) or not (phi2 <= 2.55e+19): tmp = R * (phi2 - phi1) else: tmp = R * (lambda2 - lambda1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((phi2 <= -1.45e-128) || !(phi2 <= 2.55e+19)) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * Float64(lambda2 - lambda1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if ((phi2 <= -1.45e-128) || ~((phi2 <= 2.55e+19))) tmp = R * (phi2 - phi1); else tmp = R * (lambda2 - lambda1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[phi2, -1.45e-128], N[Not[LessEqual[phi2, 2.55e+19]], $MachinePrecision]], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -1.45 \cdot 10^{-128} \lor \neg \left(\phi_2 \leq 2.55 \cdot 10^{+19}\right):\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\end{array}
\end{array}
if phi2 < -1.45e-128 or 2.55e19 < phi2 Initial program 61.8%
hypot-def95.5%
Simplified95.5%
Taylor expanded in phi1 around -inf 36.6%
mul-1-neg36.6%
unsub-neg36.6%
Simplified36.6%
if -1.45e-128 < phi2 < 2.55e19Initial program 67.1%
hypot-def99.7%
Simplified99.7%
Taylor expanded in phi1 around 0 87.4%
Taylor expanded in phi2 around 0 87.4%
Taylor expanded in lambda1 around -inf 27.1%
mul-1-neg27.1%
unsub-neg27.1%
Simplified27.1%
Final simplification32.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -7.6e-128) (- (* R phi1)) (if (<= phi2 2.3e+19) (* R (- lambda2 lambda1)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -7.6e-128) {
tmp = -(R * phi1);
} else if (phi2 <= 2.3e+19) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= (-7.6d-128)) then
tmp = -(r * phi1)
else if (phi2 <= 2.3d+19) then
tmp = r * (lambda2 - lambda1)
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -7.6e-128) {
tmp = -(R * phi1);
} else if (phi2 <= 2.3e+19) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -7.6e-128: tmp = -(R * phi1) elif phi2 <= 2.3e+19: tmp = R * (lambda2 - lambda1) else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -7.6e-128) tmp = Float64(-Float64(R * phi1)); elseif (phi2 <= 2.3e+19) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= -7.6e-128) tmp = -(R * phi1); elseif (phi2 <= 2.3e+19) tmp = R * (lambda2 - lambda1); else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -7.6e-128], (-N[(R * phi1), $MachinePrecision]), If[LessEqual[phi2, 2.3e+19], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -7.6 \cdot 10^{-128}:\\
\;\;\;\;-R \cdot \phi_1\\
\mathbf{elif}\;\phi_2 \leq 2.3 \cdot 10^{+19}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -7.6000000000000005e-128Initial program 63.4%
hypot-def95.9%
Simplified95.9%
Taylor expanded in phi1 around -inf 16.1%
mul-1-neg16.1%
*-commutative16.1%
distribute-rgt-neg-in16.1%
Simplified16.1%
if -7.6000000000000005e-128 < phi2 < 2.3e19Initial program 67.1%
hypot-def99.7%
Simplified99.7%
Taylor expanded in phi1 around 0 87.4%
Taylor expanded in phi2 around 0 87.4%
Taylor expanded in lambda1 around -inf 27.1%
mul-1-neg27.1%
unsub-neg27.1%
Simplified27.1%
if 2.3e19 < phi2 Initial program 59.4%
hypot-def95.0%
Simplified95.0%
Taylor expanded in phi2 around inf 60.3%
*-commutative60.3%
Simplified60.3%
Final simplification31.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 2.25e+19) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.25e+19) {
tmp = R * lambda2;
} 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.25d+19) then
tmp = r * lambda2
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.25e+19) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.25e+19: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.25e+19) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 2.25e+19) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.25e+19], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.25 \cdot 10^{+19}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 2.25e19Initial program 65.3%
hypot-def97.9%
Simplified97.9%
Taylor expanded in phi1 around 0 90.1%
Taylor expanded in phi2 around 0 84.6%
Taylor expanded in lambda2 around inf 13.7%
*-commutative13.7%
Simplified13.7%
if 2.25e19 < phi2 Initial program 59.4%
hypot-def95.0%
Simplified95.0%
Taylor expanded in phi2 around inf 60.3%
*-commutative60.3%
Simplified60.3%
Final simplification25.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
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 * lambda2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * lambda2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * lambda2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \lambda_2
\end{array}
Initial program 63.8%
hypot-def97.1%
Simplified97.1%
Taylor expanded in phi1 around 0 91.4%
Taylor expanded in phi2 around 0 84.6%
Taylor expanded in lambda2 around inf 11.5%
*-commutative11.5%
Simplified11.5%
Final simplification11.5%
herbie shell --seed 2023312
(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))))))