
(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 16 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: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (sin (* phi2 0.5)))
(t_1 (sin (* 0.5 phi1)))
(t_2
(* (- lambda1 lambda2) (* (cos (* 0.5 phi1)) (cos (* phi2 0.5))))))
(if (<= lambda2 6e+89)
(* R (hypot (- t_2 (* t_0 (* lambda1 t_1))) (- phi1 phi2)))
(* R (hypot (+ t_2 (* t_0 (* lambda2 t_1))) (- phi1 phi2))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin((phi2 * 0.5));
double t_1 = sin((0.5 * phi1));
double t_2 = (lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((phi2 * 0.5)));
double tmp;
if (lambda2 <= 6e+89) {
tmp = R * hypot((t_2 - (t_0 * (lambda1 * t_1))), (phi1 - phi2));
} else {
tmp = R * hypot((t_2 + (t_0 * (lambda2 * t_1))), (phi1 - phi2));
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin((phi2 * 0.5));
double t_1 = Math.sin((0.5 * phi1));
double t_2 = (lambda1 - lambda2) * (Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5)));
double tmp;
if (lambda2 <= 6e+89) {
tmp = R * Math.hypot((t_2 - (t_0 * (lambda1 * t_1))), (phi1 - phi2));
} else {
tmp = R * Math.hypot((t_2 + (t_0 * (lambda2 * t_1))), (phi1 - phi2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin((phi2 * 0.5)) t_1 = math.sin((0.5 * phi1)) t_2 = (lambda1 - lambda2) * (math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))) tmp = 0 if lambda2 <= 6e+89: tmp = R * math.hypot((t_2 - (t_0 * (lambda1 * t_1))), (phi1 - phi2)) else: tmp = R * math.hypot((t_2 + (t_0 * (lambda2 * t_1))), (phi1 - phi2)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = sin(Float64(phi2 * 0.5)) t_1 = sin(Float64(0.5 * phi1)) t_2 = Float64(Float64(lambda1 - lambda2) * Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5)))) tmp = 0.0 if (lambda2 <= 6e+89) tmp = Float64(R * hypot(Float64(t_2 - Float64(t_0 * Float64(lambda1 * t_1))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(t_2 + Float64(t_0 * Float64(lambda2 * t_1))), Float64(phi1 - phi2))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = sin((phi2 * 0.5));
t_1 = sin((0.5 * phi1));
t_2 = (lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((phi2 * 0.5)));
tmp = 0.0;
if (lambda2 <= 6e+89)
tmp = R * hypot((t_2 - (t_0 * (lambda1 * t_1))), (phi1 - phi2));
else
tmp = R * hypot((t_2 + (t_0 * (lambda2 * t_1))), (phi1 - phi2));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 6e+89], N[(R * N[Sqrt[N[(t$95$2 - N[(t$95$0 * N[(lambda1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(t$95$2 + N[(t$95$0 * N[(lambda2 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \left(\phi_2 \cdot 0.5\right)\\
t_1 := \sin \left(0.5 \cdot \phi_1\right)\\
t_2 := \left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\mathbf{if}\;\lambda_2 \leq 6 \cdot 10^{+89}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(t\_2 - t\_0 \cdot \left(\lambda_1 \cdot t\_1\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(t\_2 + t\_0 \cdot \left(\lambda_2 \cdot t\_1\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda2 < 6.00000000000000025e89Initial program 65.1%
hypot-define96.7%
Simplified96.7%
expm1-log1p-u96.6%
div-inv96.6%
metadata-eval96.6%
Applied egg-rr96.6%
+-commutative96.6%
*-commutative96.6%
distribute-lft-in96.6%
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%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in lambda1 around inf 99.5%
mul-1-neg99.5%
*-commutative99.5%
*-commutative99.5%
*-commutative99.5%
associate-*l*99.6%
*-commutative99.6%
Simplified99.6%
if 6.00000000000000025e89 < lambda2 Initial program 43.6%
hypot-define89.8%
Simplified89.8%
expm1-log1p-u89.7%
div-inv89.7%
metadata-eval89.7%
Applied egg-rr89.7%
+-commutative89.7%
*-commutative89.7%
distribute-lft-in89.7%
cos-sum99.5%
*-commutative99.5%
*-commutative99.5%
*-commutative99.5%
*-commutative99.5%
Applied egg-rr99.5%
expm1-log1p-u99.6%
sub-neg99.6%
distribute-lft-in99.7%
*-commutative99.7%
distribute-rgt-neg-in99.7%
*-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in lambda1 around 0 99.7%
associate-*r*99.7%
Simplified99.7%
Final simplification99.6%
NOTE: R, lambda1, lambda2, 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 (* phi2 0.5))))
(* (* (sin (* 0.5 phi1)) (sin (* phi2 0.5))) (- lambda2 lambda1)))
(- phi1 phi2))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((phi2 * 0.5)))) + ((sin((0.5 * phi1)) * sin((phi2 * 0.5))) * (lambda2 - lambda1))), (phi1 - phi2));
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < 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)) * Math.cos((phi2 * 0.5)))) + ((Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5))) * (lambda2 - lambda1))), (phi1 - phi2));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((lambda1 - lambda2) * (math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5)))) + ((math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5))) * (lambda2 - lambda1))), (phi1 - phi2))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, 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(phi2 * 0.5)))) + Float64(Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5))) * Float64(lambda2 - lambda1))), Float64(phi1 - phi2))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((phi2 * 0.5)))) + ((sin((0.5 * phi1)) * sin((phi2 * 0.5))) * (lambda2 - lambda1))), (phi1 - phi2));
end
NOTE: R, lambda1, lambda2, 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[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, 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(\phi_2 \cdot 0.5\right)\right) + \left(\sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right)\right) \cdot \left(\lambda_2 - \lambda_1\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.7%
hypot-define95.6%
Simplified95.6%
expm1-log1p-u95.5%
div-inv95.5%
metadata-eval95.5%
Applied egg-rr95.5%
+-commutative95.5%
*-commutative95.5%
distribute-lft-in95.5%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
expm1-log1p-u99.9%
sub-neg99.9%
distribute-lft-in99.9%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))))
(if (<= lambda2 3.5e+158)
(*
R
(hypot
(+ (* (- lambda1 lambda2) t_0) (* (- lambda1 lambda2) 0.0))
(- phi1 phi2)))
(*
R
(hypot
(* lambda2 (- (* (sin (* 0.5 phi1)) (sin (* phi2 0.5))) t_0))
(- phi1 phi2))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((0.5 * phi1)) * cos((phi2 * 0.5));
double tmp;
if (lambda2 <= 3.5e+158) {
tmp = R * hypot((((lambda1 - lambda2) * t_0) + ((lambda1 - lambda2) * 0.0)), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * ((sin((0.5 * phi1)) * sin((phi2 * 0.5))) - t_0)), (phi1 - phi2));
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5));
double tmp;
if (lambda2 <= 3.5e+158) {
tmp = R * Math.hypot((((lambda1 - lambda2) * t_0) + ((lambda1 - lambda2) * 0.0)), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * ((Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5))) - t_0)), (phi1 - phi2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5)) tmp = 0 if lambda2 <= 3.5e+158: tmp = R * math.hypot((((lambda1 - lambda2) * t_0) + ((lambda1 - lambda2) * 0.0)), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * ((math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5))) - t_0)), (phi1 - phi2)) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) tmp = 0.0 if (lambda2 <= 3.5e+158) tmp = Float64(R * hypot(Float64(Float64(Float64(lambda1 - lambda2) * t_0) + Float64(Float64(lambda1 - lambda2) * 0.0)), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5))) - t_0)), Float64(phi1 - phi2))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((0.5 * phi1)) * cos((phi2 * 0.5));
tmp = 0.0;
if (lambda2 <= 3.5e+158)
tmp = R * hypot((((lambda1 - lambda2) * t_0) + ((lambda1 - lambda2) * 0.0)), (phi1 - phi2));
else
tmp = R * hypot((lambda2 * ((sin((0.5 * phi1)) * sin((phi2 * 0.5))) - t_0)), (phi1 - phi2));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 3.5e+158], N[(R * N[Sqrt[N[(N[(N[(lambda1 - lambda2), $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[(lambda1 - lambda2), $MachinePrecision] * 0.0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * N[(N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)\\
\mathbf{if}\;\lambda_2 \leq 3.5 \cdot 10^{+158}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot t\_0 + \left(\lambda_1 - \lambda_2\right) \cdot 0, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(\sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right) - t\_0\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda2 < 3.5000000000000001e158Initial program 64.1%
hypot-define96.7%
Simplified96.7%
expm1-log1p-u96.7%
div-inv96.7%
metadata-eval96.7%
Applied egg-rr96.7%
+-commutative96.7%
*-commutative96.7%
distribute-lft-in96.7%
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%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
add-sqr-sqrt51.3%
sqrt-unprod99.2%
sqr-neg99.2%
sqrt-unprod47.9%
add-sqr-sqrt96.7%
sin-mult96.7%
Applied egg-rr96.8%
+-inverses96.8%
metadata-eval96.8%
Simplified96.8%
if 3.5000000000000001e158 < lambda2 Initial program 42.1%
hypot-define86.5%
Simplified86.5%
expm1-log1p-u86.4%
div-inv86.4%
metadata-eval86.4%
Applied egg-rr86.4%
+-commutative86.4%
*-commutative86.4%
distribute-lft-in86.4%
cos-sum99.4%
*-commutative99.4%
*-commutative99.4%
*-commutative99.4%
*-commutative99.4%
Applied egg-rr99.4%
expm1-log1p-u99.6%
sub-neg99.6%
distribute-lft-in99.7%
*-commutative99.7%
distribute-rgt-neg-in99.7%
*-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in lambda1 around 0 96.6%
mul-1-neg96.6%
*-commutative96.6%
*-commutative96.6%
distribute-rgt-neg-in96.6%
*-commutative96.6%
*-commutative96.6%
mul-1-neg96.6%
distribute-lft-in96.5%
+-commutative96.5%
Simplified96.5%
Final simplification96.7%
NOTE: R, lambda1, lambda2, 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 (* phi2 0.5))))
(* (sin (* phi2 0.5)) (* lambda2 (sin (* 0.5 phi1)))))
(- phi1 phi2))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((phi2 * 0.5)))) + (sin((phi2 * 0.5)) * (lambda2 * sin((0.5 * phi1))))), (phi1 - phi2));
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < 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)) * Math.cos((phi2 * 0.5)))) + (Math.sin((phi2 * 0.5)) * (lambda2 * Math.sin((0.5 * phi1))))), (phi1 - phi2));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((lambda1 - lambda2) * (math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5)))) + (math.sin((phi2 * 0.5)) * (lambda2 * math.sin((0.5 * phi1))))), (phi1 - phi2))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, 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(phi2 * 0.5)))) + Float64(sin(Float64(phi2 * 0.5)) * Float64(lambda2 * sin(Float64(0.5 * phi1))))), Float64(phi1 - phi2))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((phi2 * 0.5)))) + (sin((phi2 * 0.5)) * (lambda2 * sin((0.5 * phi1))))), (phi1 - phi2));
end
NOTE: R, lambda1, lambda2, 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[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[(lambda2 * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, 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(\phi_2 \cdot 0.5\right)\right) + \sin \left(\phi_2 \cdot 0.5\right) \cdot \left(\lambda_2 \cdot \sin \left(0.5 \cdot \phi_1\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.7%
hypot-define95.6%
Simplified95.6%
expm1-log1p-u95.5%
div-inv95.5%
metadata-eval95.5%
Applied egg-rr95.5%
+-commutative95.5%
*-commutative95.5%
distribute-lft-in95.5%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
expm1-log1p-u99.9%
sub-neg99.9%
distribute-lft-in99.9%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in lambda1 around 0 97.5%
associate-*r*97.5%
Simplified97.5%
Final simplification97.5%
NOTE: R, lambda1, lambda2, 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 (* phi2 0.5))))
(* (- lambda1 lambda2) 0.0))
(- phi1 phi2))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((phi2 * 0.5)))) + ((lambda1 - lambda2) * 0.0)), (phi1 - phi2));
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < 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)) * Math.cos((phi2 * 0.5)))) + ((lambda1 - lambda2) * 0.0)), (phi1 - phi2));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((lambda1 - lambda2) * (math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5)))) + ((lambda1 - lambda2) * 0.0)), (phi1 - phi2))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, 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(phi2 * 0.5)))) + Float64(Float64(lambda1 - lambda2) * 0.0)), Float64(phi1 - phi2))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi1)) * cos((phi2 * 0.5)))) + ((lambda1 - lambda2) * 0.0)), (phi1 - phi2));
end
NOTE: R, lambda1, lambda2, 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[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(lambda1 - lambda2), $MachinePrecision] * 0.0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, 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(\phi_2 \cdot 0.5\right)\right) + \left(\lambda_1 - \lambda_2\right) \cdot 0, \phi_1 - \phi_2\right)
\end{array}
Initial program 61.7%
hypot-define95.6%
Simplified95.6%
expm1-log1p-u95.5%
div-inv95.5%
metadata-eval95.5%
Applied egg-rr95.5%
+-commutative95.5%
*-commutative95.5%
distribute-lft-in95.5%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
expm1-log1p-u99.9%
sub-neg99.9%
distribute-lft-in99.9%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
add-sqr-sqrt51.1%
sqrt-unprod98.6%
sqr-neg98.6%
sqrt-unprod47.5%
add-sqr-sqrt95.6%
sin-mult95.6%
Applied egg-rr95.6%
+-inverses95.6%
metadata-eval95.6%
Simplified95.6%
Final simplification95.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* 0.5 phi1))))
(if (<= phi2 -1.96e-103)
(* R (hypot phi1 (* lambda2 t_0)))
(if (<= phi2 -2e-255)
(* R (hypot phi1 (* lambda1 t_0)))
(if (<= phi2 5.2e+23)
(* R (hypot phi1 (- lambda1 lambda2)))
(* R (- phi2 phi1)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((0.5 * phi1));
double tmp;
if (phi2 <= -1.96e-103) {
tmp = R * hypot(phi1, (lambda2 * t_0));
} else if (phi2 <= -2e-255) {
tmp = R * hypot(phi1, (lambda1 * t_0));
} else if (phi2 <= 5.2e+23) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((0.5 * phi1));
double tmp;
if (phi2 <= -1.96e-103) {
tmp = R * Math.hypot(phi1, (lambda2 * t_0));
} else if (phi2 <= -2e-255) {
tmp = R * Math.hypot(phi1, (lambda1 * t_0));
} else if (phi2 <= 5.2e+23) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((0.5 * phi1)) tmp = 0 if phi2 <= -1.96e-103: tmp = R * math.hypot(phi1, (lambda2 * t_0)) elif phi2 <= -2e-255: tmp = R * math.hypot(phi1, (lambda1 * t_0)) elif phi2 <= 5.2e+23: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * (phi2 - phi1) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(0.5 * phi1)) tmp = 0.0 if (phi2 <= -1.96e-103) tmp = Float64(R * hypot(phi1, Float64(lambda2 * t_0))); elseif (phi2 <= -2e-255) tmp = Float64(R * hypot(phi1, Float64(lambda1 * t_0))); elseif (phi2 <= 5.2e+23) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = cos((0.5 * phi1));
tmp = 0.0;
if (phi2 <= -1.96e-103)
tmp = R * hypot(phi1, (lambda2 * t_0));
elseif (phi2 <= -2e-255)
tmp = R * hypot(phi1, (lambda1 * t_0));
elseif (phi2 <= 5.2e+23)
tmp = R * hypot(phi1, (lambda1 - lambda2));
else
tmp = R * (phi2 - phi1);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -1.96e-103], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda2 * t$95$0), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, -2e-255], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 * t$95$0), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 5.2e+23], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(0.5 \cdot \phi_1\right)\\
\mathbf{if}\;\phi_2 \leq -1.96 \cdot 10^{-103}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_2 \cdot t\_0\right)\\
\mathbf{elif}\;\phi_2 \leq -2 \cdot 10^{-255}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 \cdot t\_0\right)\\
\mathbf{elif}\;\phi_2 \leq 5.2 \cdot 10^{+23}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < -1.9600000000000001e-103Initial program 65.9%
hypot-define94.6%
Simplified94.6%
Taylor expanded in phi2 around 0 42.8%
+-commutative42.8%
unpow242.8%
unpow242.8%
unpow242.8%
unswap-sqr42.8%
hypot-define59.8%
Simplified59.8%
Taylor expanded in lambda1 around 0 33.3%
+-commutative33.3%
unpow233.3%
unpow233.3%
unpow233.3%
unswap-sqr33.3%
hypot-define48.3%
*-commutative48.3%
Simplified48.3%
if -1.9600000000000001e-103 < phi2 < -2e-255Initial program 67.7%
hypot-define99.9%
Simplified99.9%
Taylor expanded in phi2 around 0 67.6%
+-commutative67.6%
unpow267.6%
unpow267.6%
unpow267.6%
unswap-sqr67.7%
hypot-define99.9%
Simplified99.9%
Taylor expanded in lambda2 around 0 43.6%
+-commutative43.6%
unpow243.6%
unpow243.6%
unpow243.6%
unswap-sqr43.6%
hypot-define66.7%
*-commutative66.7%
Simplified66.7%
if -2e-255 < phi2 < 5.19999999999999983e23Initial program 63.3%
hypot-define99.9%
Simplified99.9%
Taylor expanded in phi2 around 0 59.6%
+-commutative59.6%
unpow259.6%
unpow259.6%
unpow259.6%
unswap-sqr59.7%
hypot-define93.4%
Simplified93.4%
Taylor expanded in phi1 around 0 79.7%
if 5.19999999999999983e23 < phi2 Initial program 50.4%
hypot-define88.0%
Simplified88.0%
Taylor expanded in phi1 around -inf 63.7%
+-commutative63.7%
mul-1-neg63.7%
unsub-neg63.7%
distribute-lft-out--65.3%
Simplified65.3%
Final simplification65.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.28e+25) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (- phi2 phi1))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.28e+25) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.28e+25) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.28e+25: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * (phi2 - phi1) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.28e+25) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 1.28e+25)
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
else
tmp = R * (phi2 - phi1);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.28e+25], 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[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.28 \cdot 10^{+25}:\\
\;\;\;\;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 \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < 1.2799999999999999e25Initial program 65.2%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi2 around 0 55.2%
+-commutative55.2%
unpow255.2%
unpow255.2%
unpow255.2%
unswap-sqr55.2%
hypot-define82.5%
Simplified82.5%
if 1.2799999999999999e25 < phi2 Initial program 50.4%
hypot-define88.0%
Simplified88.0%
Taylor expanded in phi1 around -inf 63.7%
+-commutative63.7%
mul-1-neg63.7%
unsub-neg63.7%
distribute-lft-out--65.3%
Simplified65.3%
Final simplification78.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.15e-19) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (hypot phi2 (* (- lambda1 lambda2) (cos (* phi2 0.5)))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.15e-19) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.15e-19) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * Math.hypot(phi2, ((lambda1 - lambda2) * Math.cos((phi2 * 0.5))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.15e-19: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * math.hypot(phi2, ((lambda1 - lambda2) * math.cos((phi2 * 0.5)))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.15e-19) 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(phi2 * 0.5))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -1.15e-19)
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
else
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.15e-19], 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[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.15 \cdot 10^{-19}:\\
\;\;\;\;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(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if phi1 < -1.1499999999999999e-19Initial program 56.2%
hypot-define87.6%
Simplified87.6%
Taylor expanded in phi2 around 0 50.3%
+-commutative50.3%
unpow250.3%
unpow250.3%
unpow250.3%
unswap-sqr50.3%
hypot-define78.2%
Simplified78.2%
if -1.1499999999999999e-19 < phi1 Initial program 63.7%
hypot-define98.6%
Simplified98.6%
Taylor expanded in phi1 around 0 54.0%
+-commutative54.0%
unpow254.0%
unpow254.0%
unpow254.0%
unswap-sqr54.0%
hypot-define74.1%
Simplified74.1%
Final simplification75.2%
NOTE: R, lambda1, lambda2, 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 (/ (+ phi2 phi1) 2.0))) (- phi1 phi2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && 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));
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < 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(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, 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
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
end
NOTE: R, lambda1, lambda2, 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[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_2 + \phi_1}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.7%
hypot-define95.6%
Simplified95.6%
Final simplification95.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.15e+99) (* R (- lambda1)) (if (<= lambda1 3e-15) (* R (- phi2 phi1)) (* R (hypot phi1 lambda2)))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.15e+99) {
tmp = R * -lambda1;
} else if (lambda1 <= 3e-15) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * hypot(phi1, lambda2);
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.15e+99) {
tmp = R * -lambda1;
} else if (lambda1 <= 3e-15) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * Math.hypot(phi1, lambda2);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.15e+99: tmp = R * -lambda1 elif lambda1 <= 3e-15: tmp = R * (phi2 - phi1) else: tmp = R * math.hypot(phi1, lambda2) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.15e+99) tmp = Float64(R * Float64(-lambda1)); elseif (lambda1 <= 3e-15) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * hypot(phi1, lambda2)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -1.15e+99)
tmp = R * -lambda1;
elseif (lambda1 <= 3e-15)
tmp = R * (phi2 - phi1);
else
tmp = R * hypot(phi1, lambda2);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.15e+99], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda1, 3e-15], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi1 ^ 2 + lambda2 ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.15 \cdot 10^{+99}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_1 \leq 3 \cdot 10^{-15}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_2\right)\\
\end{array}
\end{array}
if lambda1 < -1.1500000000000001e99Initial program 45.3%
hypot-define90.1%
Simplified90.1%
Taylor expanded in phi2 around 0 41.9%
+-commutative41.9%
unpow241.9%
unpow241.9%
unpow241.9%
unswap-sqr41.9%
hypot-define74.1%
Simplified74.1%
Taylor expanded in lambda1 around -inf 46.4%
mul-1-neg46.4%
*-commutative46.4%
distribute-rgt-neg-in46.4%
Simplified46.4%
Taylor expanded in phi1 around 0 42.9%
mul-1-neg42.9%
*-commutative42.9%
distribute-rgt-neg-in42.9%
Simplified42.9%
if -1.1500000000000001e99 < lambda1 < 3e-15Initial program 68.7%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi1 around -inf 32.6%
+-commutative32.6%
mul-1-neg32.6%
unsub-neg32.6%
distribute-lft-out--34.0%
Simplified34.0%
if 3e-15 < lambda1 Initial program 55.3%
hypot-define94.4%
Simplified94.4%
Taylor expanded in phi2 around 0 52.8%
+-commutative52.8%
unpow252.8%
unpow252.8%
unpow252.8%
unswap-sqr52.8%
hypot-define76.2%
Simplified76.2%
Taylor expanded in lambda1 around 0 31.9%
+-commutative31.9%
unpow231.9%
unpow231.9%
unpow231.9%
unswap-sqr31.9%
hypot-define45.9%
*-commutative45.9%
Simplified45.9%
Taylor expanded in phi1 around 0 43.8%
Final simplification37.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.2e+25) (* R (hypot phi1 (- lambda1 lambda2))) (* R (- phi2 phi1))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.2e+25) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.2e+25) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.2e+25: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * (phi2 - phi1) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.2e+25) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 1.2e+25)
tmp = R * hypot(phi1, (lambda1 - lambda2));
else
tmp = R * (phi2 - phi1);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.2e+25], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.2 \cdot 10^{+25}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < 1.19999999999999998e25Initial program 65.2%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi2 around 0 55.2%
+-commutative55.2%
unpow255.2%
unpow255.2%
unpow255.2%
unswap-sqr55.2%
hypot-define82.5%
Simplified82.5%
Taylor expanded in phi1 around 0 72.7%
if 1.19999999999999998e25 < phi2 Initial program 50.4%
hypot-define88.0%
Simplified88.0%
Taylor expanded in phi1 around -inf 63.7%
+-commutative63.7%
mul-1-neg63.7%
unsub-neg63.7%
distribute-lft-out--65.3%
Simplified65.3%
Final simplification70.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.15e+99) (* R (- lambda1)) (if (<= lambda1 3.2e-15) (* R (- phi2 phi1)) (* R lambda2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.15e+99) {
tmp = R * -lambda1;
} else if (lambda1 <= 3.2e-15) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * lambda2;
}
return tmp;
}
NOTE: R, lambda1, lambda2, 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 (lambda1 <= (-1.15d+99)) then
tmp = r * -lambda1
else if (lambda1 <= 3.2d-15) then
tmp = r * (phi2 - phi1)
else
tmp = r * lambda2
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.15e+99) {
tmp = R * -lambda1;
} else if (lambda1 <= 3.2e-15) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * lambda2;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.15e+99: tmp = R * -lambda1 elif lambda1 <= 3.2e-15: tmp = R * (phi2 - phi1) else: tmp = R * lambda2 return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.15e+99) tmp = Float64(R * Float64(-lambda1)); elseif (lambda1 <= 3.2e-15) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * lambda2); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -1.15e+99)
tmp = R * -lambda1;
elseif (lambda1 <= 3.2e-15)
tmp = R * (phi2 - phi1);
else
tmp = R * lambda2;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.15e+99], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda1, 3.2e-15], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.15 \cdot 10^{+99}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_1 \leq 3.2 \cdot 10^{-15}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda1 < -1.1500000000000001e99Initial program 45.3%
hypot-define90.1%
Simplified90.1%
Taylor expanded in phi2 around 0 41.9%
+-commutative41.9%
unpow241.9%
unpow241.9%
unpow241.9%
unswap-sqr41.9%
hypot-define74.1%
Simplified74.1%
Taylor expanded in lambda1 around -inf 46.4%
mul-1-neg46.4%
*-commutative46.4%
distribute-rgt-neg-in46.4%
Simplified46.4%
Taylor expanded in phi1 around 0 42.9%
mul-1-neg42.9%
*-commutative42.9%
distribute-rgt-neg-in42.9%
Simplified42.9%
if -1.1500000000000001e99 < lambda1 < 3.1999999999999999e-15Initial program 68.7%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi1 around -inf 32.6%
+-commutative32.6%
mul-1-neg32.6%
unsub-neg32.6%
distribute-lft-out--34.0%
Simplified34.0%
if 3.1999999999999999e-15 < lambda1 Initial program 55.3%
hypot-define94.4%
Simplified94.4%
Taylor expanded in phi2 around 0 52.8%
+-commutative52.8%
unpow252.8%
unpow252.8%
unpow252.8%
unswap-sqr52.8%
hypot-define76.2%
Simplified76.2%
Taylor expanded in lambda1 around 0 31.9%
+-commutative31.9%
unpow231.9%
unpow231.9%
unpow231.9%
unswap-sqr31.9%
hypot-define45.9%
*-commutative45.9%
Simplified45.9%
Taylor expanded in phi1 around 0 16.1%
*-commutative16.1%
Simplified16.1%
Final simplification30.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -9.5e+75) (* phi1 (- R)) (if (<= phi1 -2.35e-107) (* R (- lambda1)) (* R phi2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -9.5e+75) {
tmp = phi1 * -R;
} else if (phi1 <= -2.35e-107) {
tmp = R * -lambda1;
} else {
tmp = R * phi2;
}
return tmp;
}
NOTE: R, lambda1, lambda2, 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 <= (-9.5d+75)) then
tmp = phi1 * -r
else if (phi1 <= (-2.35d-107)) then
tmp = r * -lambda1
else
tmp = r * phi2
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -9.5e+75) {
tmp = phi1 * -R;
} else if (phi1 <= -2.35e-107) {
tmp = R * -lambda1;
} else {
tmp = R * phi2;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -9.5e+75: tmp = phi1 * -R elif phi1 <= -2.35e-107: tmp = R * -lambda1 else: tmp = R * phi2 return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -9.5e+75) tmp = Float64(phi1 * Float64(-R)); elseif (phi1 <= -2.35e-107) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * phi2); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -9.5e+75)
tmp = phi1 * -R;
elseif (phi1 <= -2.35e-107)
tmp = R * -lambda1;
else
tmp = R * phi2;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -9.5e+75], N[(phi1 * (-R)), $MachinePrecision], If[LessEqual[phi1, -2.35e-107], N[(R * (-lambda1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -9.5 \cdot 10^{+75}:\\
\;\;\;\;\phi_1 \cdot \left(-R\right)\\
\mathbf{elif}\;\phi_1 \leq -2.35 \cdot 10^{-107}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -9.50000000000000061e75Initial program 50.7%
hypot-define86.6%
Simplified86.6%
Taylor expanded in phi1 around -inf 69.1%
mul-1-neg69.1%
*-commutative69.1%
distribute-rgt-neg-in69.1%
Simplified69.1%
if -9.50000000000000061e75 < phi1 < -2.34999999999999999e-107Initial program 61.5%
hypot-define94.0%
Simplified94.0%
Taylor expanded in phi2 around 0 47.5%
+-commutative47.5%
unpow247.5%
unpow247.5%
unpow247.5%
unswap-sqr47.5%
hypot-define65.4%
Simplified65.4%
Taylor expanded in lambda1 around -inf 20.9%
mul-1-neg20.9%
*-commutative20.9%
distribute-rgt-neg-in20.9%
Simplified20.9%
Taylor expanded in phi1 around 0 15.8%
mul-1-neg15.8%
*-commutative15.8%
distribute-rgt-neg-in15.8%
Simplified15.8%
if -2.34999999999999999e-107 < phi1 Initial program 64.7%
hypot-define98.5%
Simplified98.5%
Taylor expanded in phi2 around inf 19.3%
*-commutative19.3%
Simplified19.3%
Final simplification27.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -2.7e+47) (* R (- lambda1)) (if (<= lambda1 2.3e-15) (* R phi2) (* R lambda2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.7e+47) {
tmp = R * -lambda1;
} else if (lambda1 <= 2.3e-15) {
tmp = R * phi2;
} else {
tmp = R * lambda2;
}
return tmp;
}
NOTE: R, lambda1, lambda2, 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 (lambda1 <= (-2.7d+47)) then
tmp = r * -lambda1
else if (lambda1 <= 2.3d-15) then
tmp = r * phi2
else
tmp = r * lambda2
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.7e+47) {
tmp = R * -lambda1;
} else if (lambda1 <= 2.3e-15) {
tmp = R * phi2;
} else {
tmp = R * lambda2;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -2.7e+47: tmp = R * -lambda1 elif lambda1 <= 2.3e-15: tmp = R * phi2 else: tmp = R * lambda2 return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -2.7e+47) tmp = Float64(R * Float64(-lambda1)); elseif (lambda1 <= 2.3e-15) tmp = Float64(R * phi2); else tmp = Float64(R * lambda2); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (lambda1 <= -2.7e+47)
tmp = R * -lambda1;
elseif (lambda1 <= 2.3e-15)
tmp = R * phi2;
else
tmp = R * lambda2;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -2.7e+47], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda1, 2.3e-15], N[(R * phi2), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -2.7 \cdot 10^{+47}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_1 \leq 2.3 \cdot 10^{-15}:\\
\;\;\;\;R \cdot \phi_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda1 < -2.69999999999999996e47Initial program 47.7%
hypot-define88.5%
Simplified88.5%
Taylor expanded in phi2 around 0 44.9%
+-commutative44.9%
unpow244.9%
unpow244.9%
unpow244.9%
unswap-sqr44.9%
hypot-define71.7%
Simplified71.7%
Taylor expanded in lambda1 around -inf 40.3%
mul-1-neg40.3%
*-commutative40.3%
distribute-rgt-neg-in40.3%
Simplified40.3%
Taylor expanded in phi1 around 0 39.6%
mul-1-neg39.6%
*-commutative39.6%
distribute-rgt-neg-in39.6%
Simplified39.6%
if -2.69999999999999996e47 < lambda1 < 2.2999999999999999e-15Initial program 69.4%
hypot-define98.5%
Simplified98.5%
Taylor expanded in phi2 around inf 20.3%
*-commutative20.3%
Simplified20.3%
if 2.2999999999999999e-15 < lambda1 Initial program 55.3%
hypot-define94.4%
Simplified94.4%
Taylor expanded in phi2 around 0 52.8%
+-commutative52.8%
unpow252.8%
unpow252.8%
unpow252.8%
unswap-sqr52.8%
hypot-define76.2%
Simplified76.2%
Taylor expanded in lambda1 around 0 31.9%
+-commutative31.9%
unpow231.9%
unpow231.9%
unpow231.9%
unswap-sqr31.9%
hypot-define45.9%
*-commutative45.9%
Simplified45.9%
Taylor expanded in phi1 around 0 16.1%
*-commutative16.1%
Simplified16.1%
Final simplification22.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 4e-71) (* R lambda2) (* R phi2)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4e-71) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
NOTE: R, lambda1, lambda2, 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 <= 4d-71) then
tmp = r * lambda2
else
tmp = r * phi2
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4e-71) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 4e-71: tmp = R * lambda2 else: tmp = R * phi2 return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 4e-71) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 4e-71)
tmp = R * lambda2;
else
tmp = R * phi2;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 4e-71], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 4 \cdot 10^{-71}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 3.9999999999999997e-71Initial program 66.5%
hypot-define97.8%
Simplified97.8%
Taylor expanded in phi2 around 0 57.4%
+-commutative57.4%
unpow257.4%
unpow257.4%
unpow257.4%
unswap-sqr57.4%
hypot-define84.1%
Simplified84.1%
Taylor expanded in lambda1 around 0 41.7%
+-commutative41.7%
unpow241.7%
unpow241.7%
unpow241.7%
unswap-sqr41.7%
hypot-define61.5%
*-commutative61.5%
Simplified61.5%
Taylor expanded in phi1 around 0 14.3%
*-commutative14.3%
Simplified14.3%
if 3.9999999999999997e-71 < phi2 Initial program 50.2%
hypot-define90.3%
Simplified90.3%
Taylor expanded in phi2 around inf 50.2%
*-commutative50.2%
Simplified50.2%
Final simplification25.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda2))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
NOTE: R, lambda1, lambda2, 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 * lambda2
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * lambda2
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda2) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * lambda2;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda2), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \lambda_2
\end{array}
Initial program 61.7%
hypot-define95.6%
Simplified95.6%
Taylor expanded in phi2 around 0 49.3%
+-commutative49.3%
unpow249.3%
unpow249.3%
unpow249.3%
unswap-sqr49.3%
hypot-define72.2%
Simplified72.2%
Taylor expanded in lambda1 around 0 37.9%
+-commutative37.9%
unpow237.9%
unpow237.9%
unpow237.9%
unswap-sqr37.9%
hypot-define55.1%
*-commutative55.1%
Simplified55.1%
Taylor expanded in phi1 around 0 12.2%
*-commutative12.2%
Simplified12.2%
Final simplification12.2%
herbie shell --seed 2024046
(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))))))