
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t_0 \cdot t_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t_0 \cdot t_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(+
(* (- lambda1 lambda2) (* (cos (* 0.5 phi1)) (cos (* 0.5 phi2))))
(* (sin (* 0.5 phi1)) (* (sin (* 0.5 phi2)) (- lambda2 lambda1))))
(- phi1 phi2))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((0.5 * phi2)))) + (sin((0.5 * phi1)) * (sin((0.5 * phi2)) * (lambda2 - lambda1)))), (phi1 - phi2));
}
assert 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)) * Math.cos((0.5 * phi2)))) + (Math.sin((0.5 * phi1)) * (Math.sin((0.5 * phi2)) * (lambda2 - lambda1)))), (phi1 - phi2));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((lambda1 - lambda2) * (math.cos((0.5 * phi1)) * math.cos((0.5 * phi2)))) + (math.sin((0.5 * phi1)) * (math.sin((0.5 * phi2)) * (lambda2 - lambda1)))), (phi1 - phi2))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(Float64(lambda1 - lambda2) * Float64(cos(Float64(0.5 * phi1)) * cos(Float64(0.5 * phi2)))) + Float64(sin(Float64(0.5 * phi1)) * Float64(sin(Float64(0.5 * phi2)) * Float64(lambda2 - lambda1)))), Float64(phi1 - phi2))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((0.5 * phi2)))) + (sin((0.5 * phi1)) * (sin((0.5 * phi2)) * (lambda2 - lambda1)))), (phi1 - phi2));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(0.5 \cdot \phi_2\right)\right) + \sin \left(0.5 \cdot \phi_1\right) \cdot \left(\sin \left(0.5 \cdot \phi_2\right) \cdot \left(\lambda_2 - \lambda_1\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.7%
hypot-def96.8%
Simplified96.8%
log1p-expm1-u96.8%
div-inv96.8%
metadata-eval96.8%
Applied egg-rr96.8%
*-commutative96.8%
+-commutative96.8%
distribute-lft-in96.8%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
log1p-expm1-u99.9%
sub-neg99.9%
distribute-lft-in99.9%
*-commutative99.9%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
associate-*r*99.9%
distribute-rgt-neg-out99.9%
add-sqr-sqrt49.9%
sqrt-unprod98.0%
sqr-neg98.0%
sqrt-unprod48.1%
add-sqr-sqrt96.8%
associate-*r*96.8%
sub-neg96.8%
Applied egg-rr99.9%
Final simplification99.9%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(+
(* (- lambda1 lambda2) (* (cos (* 0.5 phi1)) (cos (* 0.5 phi2))))
(* lambda2 (* (sin (* 0.5 phi2)) (sin (* 0.5 phi1)))))
(- phi1 phi2))))assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((0.5 * phi2)))) + (lambda2 * (sin((0.5 * phi2)) * sin((0.5 * phi1))))), (phi1 - phi2));
}
assert 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)) * Math.cos((0.5 * phi2)))) + (lambda2 * (Math.sin((0.5 * phi2)) * Math.sin((0.5 * phi1))))), (phi1 - phi2));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((lambda1 - lambda2) * (math.cos((0.5 * phi1)) * math.cos((0.5 * phi2)))) + (lambda2 * (math.sin((0.5 * phi2)) * math.sin((0.5 * phi1))))), (phi1 - phi2))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(Float64(lambda1 - lambda2) * Float64(cos(Float64(0.5 * phi1)) * cos(Float64(0.5 * phi2)))) + Float64(lambda2 * Float64(sin(Float64(0.5 * phi2)) * sin(Float64(0.5 * phi1))))), Float64(phi1 - phi2))) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((0.5 * phi2)))) + (lambda2 * (sin((0.5 * phi2)) * sin((0.5 * phi1))))), (phi1 - phi2));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(lambda2 * N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(0.5 \cdot \phi_2\right)\right) + \lambda_2 \cdot \left(\sin \left(0.5 \cdot \phi_2\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.7%
hypot-def96.8%
Simplified96.8%
log1p-expm1-u96.8%
div-inv96.8%
metadata-eval96.8%
Applied egg-rr96.8%
*-commutative96.8%
+-commutative96.8%
distribute-lft-in96.8%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
log1p-expm1-u99.9%
sub-neg99.9%
distribute-lft-in99.9%
*-commutative99.9%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in lambda1 around 0 98.0%
Final simplification98.0%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (log1p (expm1 (cos (* 0.5 (+ phi1 phi2)))))) (- phi1 phi2))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * log1p(expm1(cos((0.5 * (phi1 + phi2)))))), (phi1 - phi2));
}
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.log1p(Math.expm1(Math.cos((0.5 * (phi1 + phi2)))))), (phi1 - phi2));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.log1p(math.expm1(math.cos((0.5 * (phi1 + phi2)))))), (phi1 - phi2))
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * log1p(expm1(cos(Float64(0.5 * Float64(phi1 + phi2)))))), Float64(phi1 - phi2))) end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Log[1 + N[(Exp[N[Cos[N[(0.5 * N[(phi1 + phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(\cos \left(0.5 \cdot \left(\phi_1 + \phi_2\right)\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.7%
hypot-def96.8%
Simplified96.8%
log1p-expm1-u96.8%
div-inv96.8%
metadata-eval96.8%
Applied egg-rr96.8%
Final simplification96.8%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1e-35) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi2))) (- phi1 phi2)))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1e-35) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1e-35) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1e-35: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1e-35) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi2))), Float64(phi1 - phi2))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 1e-35)
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
else
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1e-35], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $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}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 10^{-35}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\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 phi2 < 1.00000000000000001e-35Initial program 63.8%
hypot-def97.9%
Simplified97.9%
Taylor expanded in phi2 around 0 56.3%
+-commutative56.3%
unpow256.3%
unpow256.3%
unpow256.3%
unswap-sqr56.3%
hypot-def82.8%
Simplified82.8%
if 1.00000000000000001e-35 < phi2 Initial program 53.4%
hypot-def92.3%
Simplified92.3%
Taylor expanded in phi1 around 0 92.3%
Final simplification84.7%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (- phi1 phi2))))
assert(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));
}
assert 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));
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2))
phi1, phi2 = sort([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
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. 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}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
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 61.7%
hypot-def96.8%
Simplified96.8%
Final simplification96.8%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 0.00182) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (hypot phi2 (* lambda1 (cos (* 0.5 phi2)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.00182) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * hypot(phi2, (lambda1 * cos((0.5 * phi2))));
}
return tmp;
}
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.00182) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * Math.hypot(phi2, (lambda1 * Math.cos((0.5 * phi2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.00182: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * math.hypot(phi2, (lambda1 * math.cos((0.5 * phi2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.00182) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 * cos(Float64(0.5 * phi2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 0.00182)
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
else
tmp = R * hypot(phi2, (lambda1 * cos((0.5 * phi2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.00182], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.00182:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right)\\
\end{array}
\end{array}
if phi2 < 0.00182Initial program 63.4%
hypot-def98.0%
Simplified98.0%
Taylor expanded in phi2 around 0 55.7%
+-commutative55.7%
unpow255.7%
unpow255.7%
unpow255.7%
unswap-sqr55.7%
hypot-def83.0%
Simplified83.0%
if 0.00182 < phi2 Initial program 53.6%
hypot-def90.9%
Simplified90.9%
Taylor expanded in phi1 around 0 53.8%
+-commutative53.8%
unpow253.8%
unpow253.8%
unpow253.8%
unswap-sqr53.8%
hypot-def84.6%
Simplified84.6%
Taylor expanded in lambda1 around inf 73.6%
*-commutative73.6%
Simplified73.6%
Final simplification81.3%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 5e-17) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (hypot phi2 (* (- lambda1 lambda2) (cos (* 0.5 phi2)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5e-17) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((0.5 * phi2))));
}
return tmp;
}
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5e-17) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * Math.hypot(phi2, ((lambda1 - lambda2) * Math.cos((0.5 * phi2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 5e-17: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * math.hypot(phi2, ((lambda1 - lambda2) * math.cos((0.5 * phi2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 5e-17) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * hypot(phi2, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 5e-17)
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
else
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((0.5 * phi2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5e-17], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 5 \cdot 10^{-17}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_2\right)\right)\\
\end{array}
\end{array}
if phi2 < 4.9999999999999999e-17Initial program 63.1%
hypot-def98.0%
Simplified98.0%
Taylor expanded in phi2 around 0 55.7%
+-commutative55.7%
unpow255.7%
unpow255.7%
unpow255.7%
unswap-sqr55.7%
hypot-def83.3%
Simplified83.3%
if 4.9999999999999999e-17 < phi2 Initial program 55.6%
hypot-def91.3%
Simplified91.3%
Taylor expanded in phi1 around 0 55.7%
+-commutative55.7%
unpow255.7%
unpow255.7%
unpow255.7%
unswap-sqr55.7%
hypot-def85.2%
Simplified85.2%
Final simplification83.6%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 0.00152) (* R (hypot phi1 (- lambda1 lambda2))) (* R (hypot phi2 (* lambda1 (cos (* 0.5 phi2)))))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.00152) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * hypot(phi2, (lambda1 * cos((0.5 * phi2))));
}
return tmp;
}
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.00152) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * Math.hypot(phi2, (lambda1 * Math.cos((0.5 * phi2))));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.00152: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * math.hypot(phi2, (lambda1 * math.cos((0.5 * phi2)))) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.00152) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 * cos(Float64(0.5 * phi2))))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 0.00152)
tmp = R * hypot(phi1, (lambda1 - lambda2));
else
tmp = R * hypot(phi2, (lambda1 * cos((0.5 * phi2))));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.00152], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.00152:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right)\\
\end{array}
\end{array}
if phi2 < 0.0015200000000000001Initial program 63.4%
hypot-def98.0%
Simplified98.0%
Taylor expanded in phi2 around 0 55.7%
+-commutative55.7%
unpow255.7%
unpow255.7%
unpow255.7%
unswap-sqr55.7%
hypot-def83.0%
Simplified83.0%
Taylor expanded in phi1 around 0 77.0%
if 0.0015200000000000001 < phi2 Initial program 53.6%
hypot-def90.9%
Simplified90.9%
Taylor expanded in phi1 around 0 53.8%
+-commutative53.8%
unpow253.8%
unpow253.8%
unpow253.8%
unswap-sqr53.8%
hypot-def84.6%
Simplified84.6%
Taylor expanded in lambda1 around inf 73.6%
*-commutative73.6%
Simplified73.6%
Final simplification76.4%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 7.4e+59) (* R (hypot phi1 (- lambda1 lambda2))) (- (* R phi2) (* R phi1))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.4e+59) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = (R * phi2) - (R * phi1);
}
return tmp;
}
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.4e+59) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = (R * phi2) - (R * phi1);
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 7.4e+59: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = (R * phi2) - (R * phi1) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 7.4e+59) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 7.4e+59)
tmp = R * hypot(phi1, (lambda1 - lambda2));
else
tmp = (R * phi2) - (R * phi1);
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 7.4e+59], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 7.4 \cdot 10^{+59}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\end{array}
\end{array}
if phi2 < 7.39999999999999995e59Initial program 62.8%
hypot-def97.3%
Simplified97.3%
Taylor expanded in phi2 around 0 54.8%
+-commutative54.8%
unpow254.8%
unpow254.8%
unpow254.8%
unswap-sqr54.8%
hypot-def82.1%
Simplified82.1%
Taylor expanded in phi1 around 0 76.2%
if 7.39999999999999995e59 < phi2 Initial program 55.9%
hypot-def93.9%
Simplified93.9%
Taylor expanded in phi1 around -inf 72.5%
+-commutative72.5%
mul-1-neg72.5%
unsub-neg72.5%
*-commutative72.5%
*-commutative72.5%
Simplified72.5%
Final simplification75.6%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 3.9e-17) (* R (hypot phi1 (- lambda1 lambda2))) (* R (hypot phi2 (- lambda1 lambda2)))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.9e-17) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.9e-17) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 3.9e-17: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 3.9e-17) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 3.9e-17)
tmp = R * hypot(phi1, (lambda1 - lambda2));
else
tmp = R * hypot(phi2, (lambda1 - lambda2));
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 3.9e-17], 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}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.9 \cdot 10^{-17}:\\
\;\;\;\;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 phi2 < 3.89999999999999989e-17Initial program 63.1%
hypot-def98.0%
Simplified98.0%
Taylor expanded in phi2 around 0 55.7%
+-commutative55.7%
unpow255.7%
unpow255.7%
unpow255.7%
unswap-sqr55.7%
hypot-def83.3%
Simplified83.3%
Taylor expanded in phi1 around 0 77.2%
if 3.89999999999999989e-17 < phi2 Initial program 55.6%
hypot-def91.3%
Simplified91.3%
Taylor expanded in phi1 around 0 55.7%
+-commutative55.7%
unpow255.7%
unpow255.7%
unpow255.7%
unswap-sqr55.7%
hypot-def85.2%
Simplified85.2%
Taylor expanded in phi2 around 0 77.0%
Final simplification77.2%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -6.5e+54) (* R (- phi1)) (if (<= phi1 8.2e-221) (* R (- lambda2 lambda1)) (* R phi2))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -6.5e+54) {
tmp = R * -phi1;
} else if (phi1 <= 8.2e-221) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
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 <= (-6.5d+54)) then
tmp = r * -phi1
else if (phi1 <= 8.2d-221) then
tmp = r * (lambda2 - lambda1)
else
tmp = r * phi2
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -6.5e+54) {
tmp = R * -phi1;
} else if (phi1 <= 8.2e-221) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -6.5e+54: tmp = R * -phi1 elif phi1 <= 8.2e-221: tmp = R * (lambda2 - lambda1) else: tmp = R * phi2 return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -6.5e+54) tmp = Float64(R * Float64(-phi1)); elseif (phi1 <= 8.2e-221) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * phi2); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -6.5e+54)
tmp = R * -phi1;
elseif (phi1 <= 8.2e-221)
tmp = R * (lambda2 - lambda1);
else
tmp = R * phi2;
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -6.5e+54], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi1, 8.2e-221], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -6.5 \cdot 10^{+54}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq 8.2 \cdot 10^{-221}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -6.5e54Initial program 42.1%
hypot-def93.2%
Simplified93.2%
Taylor expanded in phi1 around -inf 69.5%
mul-1-neg69.5%
*-commutative69.5%
distribute-rgt-neg-in69.5%
Simplified69.5%
if -6.5e54 < phi1 < 8.19999999999999962e-221Initial program 72.6%
hypot-def99.0%
Simplified99.0%
Taylor expanded in phi1 around 0 67.4%
+-commutative67.4%
unpow267.4%
unpow267.4%
unpow267.4%
unswap-sqr67.4%
hypot-def91.0%
Simplified91.0%
Taylor expanded in lambda1 around -inf 33.9%
+-commutative33.9%
mul-1-neg33.9%
unsub-neg33.9%
*-commutative33.9%
*-commutative33.9%
*-commutative33.9%
Simplified33.9%
Taylor expanded in phi2 around 0 27.4%
distribute-lft-out--28.6%
Simplified28.6%
if 8.19999999999999962e-221 < phi1 Initial program 61.8%
hypot-def96.6%
Simplified96.6%
Taylor expanded in phi2 around inf 16.8%
*-commutative16.8%
Simplified16.8%
Final simplification30.9%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -29000000.0) (- (* R phi2) (* R phi1)) (if (<= phi1 2.2e-220) (* R (- lambda2 lambda1)) (* R phi2))))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -29000000.0) {
tmp = (R * phi2) - (R * phi1);
} else if (phi1 <= 2.2e-220) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
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 <= (-29000000.0d0)) then
tmp = (r * phi2) - (r * phi1)
else if (phi1 <= 2.2d-220) then
tmp = r * (lambda2 - lambda1)
else
tmp = r * phi2
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -29000000.0) {
tmp = (R * phi2) - (R * phi1);
} else if (phi1 <= 2.2e-220) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -29000000.0: tmp = (R * phi2) - (R * phi1) elif phi1 <= 2.2e-220: tmp = R * (lambda2 - lambda1) else: tmp = R * phi2 return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -29000000.0) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); elseif (phi1 <= 2.2e-220) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * phi2); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -29000000.0)
tmp = (R * phi2) - (R * phi1);
elseif (phi1 <= 2.2e-220)
tmp = R * (lambda2 - lambda1);
else
tmp = R * phi2;
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -29000000.0], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 2.2e-220], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -29000000:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{elif}\;\phi_1 \leq 2.2 \cdot 10^{-220}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -2.9e7Initial program 41.6%
hypot-def92.5%
Simplified92.5%
Taylor expanded in phi1 around -inf 65.1%
+-commutative65.1%
mul-1-neg65.1%
unsub-neg65.1%
*-commutative65.1%
*-commutative65.1%
Simplified65.1%
if -2.9e7 < phi1 < 2.19999999999999987e-220Initial program 75.2%
hypot-def99.9%
Simplified99.9%
Taylor expanded in phi1 around 0 70.7%
+-commutative70.7%
unpow270.7%
unpow270.7%
unpow270.7%
unswap-sqr70.7%
hypot-def94.4%
Simplified94.4%
Taylor expanded in lambda1 around -inf 34.9%
+-commutative34.9%
mul-1-neg34.9%
unsub-neg34.9%
*-commutative34.9%
*-commutative34.9%
*-commutative34.9%
Simplified34.9%
Taylor expanded in phi2 around 0 27.9%
distribute-lft-out--29.1%
Simplified29.1%
if 2.19999999999999987e-220 < phi1 Initial program 61.8%
hypot-def96.6%
Simplified96.6%
Taylor expanded in phi2 around inf 16.8%
*-commutative16.8%
Simplified16.8%
Final simplification31.1%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 3.9e-17) (* R (- phi1)) (* R phi2)))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.9e-17) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 3.9d-17) then
tmp = r * -phi1
else
tmp = r * phi2
end if
code = tmp
end function
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.9e-17) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 3.9e-17: tmp = R * -phi1 else: tmp = R * phi2 return tmp
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 3.9e-17) tmp = Float64(R * Float64(-phi1)); else tmp = Float64(R * phi2); end return tmp end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 3.9e-17)
tmp = R * -phi1;
else
tmp = R * phi2;
end
tmp_2 = tmp;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 3.9e-17], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.9 \cdot 10^{-17}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 3.89999999999999989e-17Initial program 63.1%
hypot-def98.0%
Simplified98.0%
Taylor expanded in phi1 around -inf 19.4%
mul-1-neg19.4%
*-commutative19.4%
distribute-rgt-neg-in19.4%
Simplified19.4%
if 3.89999999999999989e-17 < phi2 Initial program 55.6%
hypot-def91.3%
Simplified91.3%
Taylor expanded in phi2 around inf 68.0%
*-commutative68.0%
Simplified68.0%
Final simplification28.3%
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R phi2))
assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
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
assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
[phi1, phi2] = sort([phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * phi2
phi1, phi2 = sort([phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * phi2) end
phi1, phi2 = num2cell(sort([phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * phi2;
end
NOTE: phi1 and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * phi2), $MachinePrecision]
\begin{array}{l}
[phi1, phi2] = \mathsf{sort}([phi1, phi2])\\
\\
R \cdot \phi_2
\end{array}
Initial program 61.7%
hypot-def96.8%
Simplified96.8%
Taylor expanded in phi2 around inf 15.7%
*-commutative15.7%
Simplified15.7%
Final simplification15.7%
herbie shell --seed 2023314
(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))))))