
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (cos (* (+ phi1 phi2) 0.5)))) (* R (hypot (- (* t_0 lambda1) (* t_0 lambda2)) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(((phi1 + phi2) * 0.5));
return R * hypot(((t_0 * lambda1) - (t_0 * lambda2)), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos(((phi1 + phi2) * 0.5));
return R * Math.hypot(((t_0 * lambda1) - (t_0 * lambda2)), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos(((phi1 + phi2) * 0.5)) return R * math.hypot(((t_0 * lambda1) - (t_0 * lambda2)), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(Float64(phi1 + phi2) * 0.5)) return Float64(R * hypot(Float64(Float64(t_0 * lambda1) - Float64(t_0 * lambda2)), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(((phi1 + phi2) * 0.5)); tmp = R * hypot(((t_0 * lambda1) - (t_0 * lambda2)), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * lambda1), $MachinePrecision] - N[(t$95$0 * lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(\left(\phi_1 + \phi_2\right) \cdot 0.5\right)\\
R \cdot \mathsf{hypot}\left(t\_0 \cdot \lambda_1 - t\_0 \cdot \lambda_2, \phi_1 - \phi_2\right)
\end{array}
\end{array}
Initial program 58.9%
hypot-define95.8%
Simplified95.8%
*-commutative95.8%
sub-neg95.8%
distribute-lft-in95.8%
div-inv95.8%
metadata-eval95.8%
div-inv95.8%
metadata-eval95.8%
Applied egg-rr95.8%
Final simplification95.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 8.8e-67)
(* R (hypot (* lambda1 (cos (* phi2 0.5))) (- phi1 phi2)))
(if (<= lambda2 1.5e+187)
(* R (hypot (- lambda1 lambda2) (- phi1 phi2)))
(* R (hypot (* (- lambda2) (cos (* phi1 0.5))) (- phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 8.8e-67) {
tmp = R * hypot((lambda1 * cos((phi2 * 0.5))), (phi1 - phi2));
} else if (lambda2 <= 1.5e+187) {
tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2));
} else {
tmp = R * hypot((-lambda2 * cos((phi1 * 0.5))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 8.8e-67) {
tmp = R * Math.hypot((lambda1 * Math.cos((phi2 * 0.5))), (phi1 - phi2));
} else if (lambda2 <= 1.5e+187) {
tmp = R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
} else {
tmp = R * Math.hypot((-lambda2 * Math.cos((phi1 * 0.5))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 8.8e-67: tmp = R * math.hypot((lambda1 * math.cos((phi2 * 0.5))), (phi1 - phi2)) elif lambda2 <= 1.5e+187: tmp = R * math.hypot((lambda1 - lambda2), (phi1 - phi2)) else: tmp = R * math.hypot((-lambda2 * math.cos((phi1 * 0.5))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 8.8e-67) tmp = Float64(R * hypot(Float64(lambda1 * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2))); elseif (lambda2 <= 1.5e+187) tmp = Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(-lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 8.8e-67) tmp = R * hypot((lambda1 * cos((phi2 * 0.5))), (phi1 - phi2)); elseif (lambda2 <= 1.5e+187) tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); else tmp = R * hypot((-lambda2 * cos((phi1 * 0.5))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 8.8e-67], N[(R * N[Sqrt[N[(lambda1 * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 1.5e+187], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[((-lambda2) * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 8.8 \cdot 10^{-67}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\mathbf{elif}\;\lambda_2 \leq 1.5 \cdot 10^{+187}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(-\lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda2 < 8.8000000000000004e-67Initial program 60.7%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi1 around 0 90.4%
*-commutative90.4%
Simplified90.4%
Taylor expanded in lambda1 around inf 79.3%
if 8.8000000000000004e-67 < lambda2 < 1.5e187Initial program 62.8%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi1 around 0 93.4%
*-commutative93.4%
Simplified93.4%
Taylor expanded in phi2 around 0 87.4%
if 1.5e187 < lambda2 Initial program 35.2%
hypot-define86.6%
Simplified86.6%
Taylor expanded in phi2 around 0 76.1%
*-commutative76.1%
Simplified76.1%
Taylor expanded in lambda1 around 0 75.6%
neg-mul-175.6%
Simplified75.6%
Final simplification80.5%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* phi2 0.5))))
(if (<= lambda2 1e-68)
(* R (hypot (* lambda1 t_0) (- phi1 phi2)))
(if (<= lambda2 1.15e+144)
(* R (hypot (- lambda1 lambda2) (- phi1 phi2)))
(* R (hypot (* lambda2 t_0) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((phi2 * 0.5));
double tmp;
if (lambda2 <= 1e-68) {
tmp = R * hypot((lambda1 * t_0), (phi1 - phi2));
} else if (lambda2 <= 1.15e+144) {
tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * t_0), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((phi2 * 0.5));
double tmp;
if (lambda2 <= 1e-68) {
tmp = R * Math.hypot((lambda1 * t_0), (phi1 - phi2));
} else if (lambda2 <= 1.15e+144) {
tmp = R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * t_0), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((phi2 * 0.5)) tmp = 0 if lambda2 <= 1e-68: tmp = R * math.hypot((lambda1 * t_0), (phi1 - phi2)) elif lambda2 <= 1.15e+144: tmp = R * math.hypot((lambda1 - lambda2), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * t_0), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(phi2 * 0.5)) tmp = 0.0 if (lambda2 <= 1e-68) tmp = Float64(R * hypot(Float64(lambda1 * t_0), Float64(phi1 - phi2))); elseif (lambda2 <= 1.15e+144) tmp = Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * t_0), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = cos((phi2 * 0.5)); tmp = 0.0; if (lambda2 <= 1e-68) tmp = R * hypot((lambda1 * t_0), (phi1 - phi2)); elseif (lambda2 <= 1.15e+144) tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); else tmp = R * hypot((lambda2 * t_0), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda2, 1e-68], N[(R * N[Sqrt[N[(lambda1 * t$95$0), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 1.15e+144], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * t$95$0), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(\phi_2 \cdot 0.5\right)\\
\mathbf{if}\;\lambda_2 \leq 10^{-68}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot t\_0, \phi_1 - \phi_2\right)\\
\mathbf{elif}\;\lambda_2 \leq 1.15 \cdot 10^{+144}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot t\_0, \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda2 < 1.00000000000000007e-68Initial program 60.7%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi1 around 0 90.4%
*-commutative90.4%
Simplified90.4%
Taylor expanded in lambda1 around inf 79.3%
if 1.00000000000000007e-68 < lambda2 < 1.1500000000000001e144Initial program 67.5%
hypot-define96.8%
Simplified96.8%
Taylor expanded in phi1 around 0 93.3%
*-commutative93.3%
Simplified93.3%
Taylor expanded in phi2 around 0 87.3%
if 1.1500000000000001e144 < lambda2 Initial program 40.7%
hypot-define91.5%
Simplified91.5%
Taylor expanded in phi1 around 0 82.4%
*-commutative82.4%
Simplified82.4%
Taylor expanded in lambda1 around 0 77.1%
neg-mul-179.5%
Simplified77.1%
pow177.1%
*-commutative77.1%
add-sqr-sqrt0.0%
*-commutative0.0%
sqrt-unprod43.4%
sqr-neg43.4%
sqrt-unprod77.0%
add-sqr-sqrt77.1%
Applied egg-rr77.1%
unpow177.1%
Simplified77.1%
Final simplification80.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -4.7e-6) (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))) (* R (hypot (* (- lambda1 lambda2) (cos (* phi2 0.5))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -4.7e-6) {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -4.7e-6) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -4.7e-6: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi2 * 0.5))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -4.7e-6) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -4.7e-6) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -4.7e-6], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -4.7 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -4.69999999999999989e-6Initial program 50.1%
hypot-define88.7%
Simplified88.7%
Taylor expanded in phi2 around 0 88.8%
*-commutative88.8%
Simplified88.8%
if -4.69999999999999989e-6 < phi1 Initial program 62.2%
hypot-define98.5%
Simplified98.5%
Taylor expanded in phi1 around 0 94.3%
*-commutative94.3%
Simplified94.3%
Final simplification92.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 5e-70) (* R (hypot (* lambda1 (cos (* phi2 0.5))) (- phi1 phi2))) (* R (hypot (- lambda1 lambda2) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 5e-70) {
tmp = R * hypot((lambda1 * cos((phi2 * 0.5))), (phi1 - phi2));
} else {
tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 5e-70) {
tmp = R * Math.hypot((lambda1 * Math.cos((phi2 * 0.5))), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 5e-70: tmp = R * math.hypot((lambda1 * math.cos((phi2 * 0.5))), (phi1 - phi2)) else: tmp = R * math.hypot((lambda1 - lambda2), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 5e-70) tmp = Float64(R * hypot(Float64(lambda1 * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 5e-70) tmp = R * hypot((lambda1 * cos((phi2 * 0.5))), (phi1 - phi2)); else tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 5e-70], N[(R * N[Sqrt[N[(lambda1 * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 5 \cdot 10^{-70}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda2 < 4.9999999999999998e-70Initial program 61.0%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi1 around 0 90.3%
*-commutative90.3%
Simplified90.3%
Taylor expanded in lambda1 around inf 79.2%
if 4.9999999999999998e-70 < lambda2 Initial program 53.4%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi1 around 0 88.0%
*-commutative88.0%
Simplified88.0%
Taylor expanded in phi2 around 0 80.8%
Final simplification79.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 58.9%
hypot-define95.8%
Simplified95.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (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 * 0.5))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 58.9%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi2 around 0 91.4%
*-commutative91.4%
Simplified91.4%
Final simplification91.4%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -6.7e+133)
(* R (- lambda1))
(if (<= lambda1 1.55e-254)
(* phi2 (- R (/ (* R phi1) phi2)))
(* R (hypot phi1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -6.7e+133) {
tmp = R * -lambda1;
} else if (lambda1 <= 1.55e-254) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} else {
tmp = R * hypot(phi1, lambda2);
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -6.7e+133) {
tmp = R * -lambda1;
} else if (lambda1 <= 1.55e-254) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} else {
tmp = R * Math.hypot(phi1, lambda2);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -6.7e+133: tmp = R * -lambda1 elif lambda1 <= 1.55e-254: tmp = phi2 * (R - ((R * phi1) / phi2)) else: tmp = R * math.hypot(phi1, lambda2) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -6.7e+133) tmp = Float64(R * Float64(-lambda1)); elseif (lambda1 <= 1.55e-254) tmp = Float64(phi2 * Float64(R - Float64(Float64(R * phi1) / phi2))); else tmp = Float64(R * hypot(phi1, lambda2)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -6.7e+133) tmp = R * -lambda1; elseif (lambda1 <= 1.55e-254) tmp = phi2 * (R - ((R * phi1) / phi2)); else tmp = R * hypot(phi1, lambda2); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -6.7e+133], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda1, 1.55e-254], N[(phi2 * N[(R - N[(N[(R * phi1), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi1 ^ 2 + lambda2 ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -6.7 \cdot 10^{+133}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_1 \leq 1.55 \cdot 10^{-254}:\\
\;\;\;\;\phi_2 \cdot \left(R - \frac{R \cdot \phi_1}{\phi_2}\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_2\right)\\
\end{array}
\end{array}
if lambda1 < -6.7000000000000003e133Initial program 49.6%
hypot-define88.0%
Simplified88.0%
Taylor expanded in phi1 around 0 76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in lambda1 around -inf 55.4%
associate-*r*55.4%
mul-1-neg55.4%
Simplified55.4%
Taylor expanded in phi2 around 0 65.1%
associate-*r*65.1%
mul-1-neg65.1%
Simplified65.1%
if -6.7000000000000003e133 < lambda1 < 1.54999999999999994e-254Initial program 64.3%
hypot-define98.4%
Simplified98.4%
Taylor expanded in phi2 around inf 36.9%
associate-*r/36.9%
mul-1-neg36.9%
Simplified36.9%
if 1.54999999999999994e-254 < lambda1 Initial program 57.4%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi1 around 0 90.4%
*-commutative90.4%
Simplified90.4%
Taylor expanded in lambda1 around 0 72.0%
neg-mul-172.7%
Simplified72.0%
Taylor expanded in phi2 around 0 32.6%
+-commutative32.6%
unpow232.6%
unpow232.6%
hypot-define45.0%
Simplified45.0%
Final simplification45.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.1e-7) (* R (hypot phi1 (- lambda1 lambda2))) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.1e-7) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.1e-7) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.1e-7: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.1e-7) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.1e-7) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.1e-7], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.1 \cdot 10^{-7}:\\
\;\;\;\;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 < 1.1000000000000001e-7Initial program 59.0%
hypot-define96.1%
Simplified96.1%
Taylor expanded in phi1 around 0 88.1%
*-commutative88.1%
Simplified88.1%
Taylor expanded in phi2 around 0 49.7%
unpow249.7%
unpow249.7%
hypot-define71.3%
Simplified71.3%
if 1.1000000000000001e-7 < phi2 Initial program 58.6%
hypot-define94.7%
Simplified94.7%
Taylor expanded in phi2 around 0 84.7%
*-commutative84.7%
Simplified84.7%
Taylor expanded in phi1 around 0 53.3%
unpow253.3%
unpow253.3%
hypot-define77.4%
Simplified77.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1700000.0) (* R (hypot phi1 (- lambda1 lambda2))) (* R (* phi2 (- 1.0 (/ phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1700000.0) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1700000.0) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1700000.0: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1700000.0) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * Float64(phi2 * Float64(1.0 - Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1700000.0) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1700000.0], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1700000:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if phi2 < 1.7e6Initial program 58.9%
hypot-define96.2%
Simplified96.2%
Taylor expanded in phi1 around 0 88.3%
*-commutative88.3%
Simplified88.3%
Taylor expanded in phi2 around 0 49.7%
unpow249.7%
unpow249.7%
hypot-define71.3%
Simplified71.3%
if 1.7e6 < phi2 Initial program 58.7%
hypot-define94.6%
Simplified94.6%
Taylor expanded in phi2 around inf 69.7%
mul-1-neg69.7%
unsub-neg69.7%
Simplified69.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 390000.0) (* R (hypot phi1 (+ lambda1 lambda2))) (* R (* phi2 (- 1.0 (/ phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 390000.0) {
tmp = R * hypot(phi1, (lambda1 + lambda2));
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 390000.0) {
tmp = R * Math.hypot(phi1, (lambda1 + lambda2));
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 390000.0: tmp = R * math.hypot(phi1, (lambda1 + lambda2)) else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 390000.0) tmp = Float64(R * hypot(phi1, Float64(lambda1 + lambda2))); else tmp = Float64(R * Float64(phi2 * Float64(1.0 - Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 390000.0) tmp = R * hypot(phi1, (lambda1 + lambda2)); else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 390000.0], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 + lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 390000:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 + \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if phi2 < 3.9e5Initial program 58.9%
hypot-define96.2%
Simplified96.2%
Taylor expanded in phi1 around 0 88.3%
*-commutative88.3%
Simplified88.3%
flip--68.3%
associate-*l/68.3%
difference-of-squares71.0%
add-sqr-sqrt34.7%
sqrt-unprod70.3%
sqr-neg70.3%
sqrt-unprod35.5%
add-sqr-sqrt70.3%
sub-neg70.3%
pow270.3%
sub-neg70.3%
add-sqr-sqrt35.5%
sqrt-unprod70.3%
sqr-neg70.3%
sqrt-unprod34.7%
add-sqr-sqrt70.3%
*-commutative70.3%
Applied egg-rr70.3%
associate-/l*70.3%
+-commutative70.3%
+-commutative70.3%
Simplified70.3%
Taylor expanded in phi2 around 0 49.0%
unpow249.0%
unpow249.0%
hypot-define70.2%
Simplified70.2%
if 3.9e5 < phi2 Initial program 58.7%
hypot-define94.6%
Simplified94.6%
Taylor expanded in phi2 around inf 69.7%
mul-1-neg69.7%
unsub-neg69.7%
Simplified69.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (- lambda1 lambda2) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((lambda1 - lambda2), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((lambda1 - lambda2), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)
\end{array}
Initial program 58.9%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi1 around 0 89.7%
*-commutative89.7%
Simplified89.7%
Taylor expanded in phi2 around 0 85.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 8e-261) (* R (- phi1)) (if (<= phi2 1600000.0) (* R (- lambda1)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 8e-261) {
tmp = R * -phi1;
} else if (phi2 <= 1600000.0) {
tmp = R * -lambda1;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 8d-261) then
tmp = r * -phi1
else if (phi2 <= 1600000.0d0) then
tmp = r * -lambda1
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 8e-261) {
tmp = R * -phi1;
} else if (phi2 <= 1600000.0) {
tmp = R * -lambda1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 8e-261: tmp = R * -phi1 elif phi2 <= 1600000.0: tmp = R * -lambda1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 8e-261) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 1600000.0) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 8e-261) tmp = R * -phi1; elseif (phi2 <= 1600000.0) tmp = R * -lambda1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 8e-261], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 1600000.0], N[(R * (-lambda1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 8 \cdot 10^{-261}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 1600000:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 7.99999999999999987e-261Initial program 58.7%
hypot-define94.9%
Simplified94.9%
Taylor expanded in phi1 around -inf 17.3%
mul-1-neg17.3%
distribute-rgt-neg-in17.3%
Simplified17.3%
if 7.99999999999999987e-261 < phi2 < 1.6e6Initial program 59.6%
hypot-define99.8%
Simplified99.8%
Taylor expanded in phi1 around 0 84.6%
*-commutative84.6%
Simplified84.6%
Taylor expanded in lambda1 around -inf 19.6%
associate-*r*19.6%
mul-1-neg19.6%
Simplified19.6%
Taylor expanded in phi2 around 0 19.6%
associate-*r*19.6%
mul-1-neg19.6%
Simplified19.6%
if 1.6e6 < phi2 Initial program 58.7%
hypot-define94.6%
Simplified94.6%
Taylor expanded in phi2 around inf 65.6%
Final simplification29.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -6.1e+133) (* R (- lambda1)) (* phi2 (- R (/ (* R phi1) phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -6.1e+133) {
tmp = R * -lambda1;
} else {
tmp = phi2 * (R - ((R * phi1) / phi2));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-6.1d+133)) then
tmp = r * -lambda1
else
tmp = phi2 * (r - ((r * phi1) / phi2))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -6.1e+133) {
tmp = R * -lambda1;
} else {
tmp = phi2 * (R - ((R * phi1) / phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -6.1e+133: tmp = R * -lambda1 else: tmp = phi2 * (R - ((R * phi1) / phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -6.1e+133) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(phi2 * Float64(R - Float64(Float64(R * phi1) / phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -6.1e+133) tmp = R * -lambda1; else tmp = phi2 * (R - ((R * phi1) / phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -6.1e+133], N[(R * (-lambda1)), $MachinePrecision], N[(phi2 * N[(R - N[(N[(R * phi1), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -6.1 \cdot 10^{+133}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - \frac{R \cdot \phi_1}{\phi_2}\right)\\
\end{array}
\end{array}
if lambda1 < -6.09999999999999958e133Initial program 49.6%
hypot-define88.0%
Simplified88.0%
Taylor expanded in phi1 around 0 76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in lambda1 around -inf 55.4%
associate-*r*55.4%
mul-1-neg55.4%
Simplified55.4%
Taylor expanded in phi2 around 0 65.1%
associate-*r*65.1%
mul-1-neg65.1%
Simplified65.1%
if -6.09999999999999958e133 < lambda1 Initial program 60.7%
hypot-define97.4%
Simplified97.4%
Taylor expanded in phi2 around inf 31.6%
associate-*r/31.6%
mul-1-neg31.6%
Simplified31.6%
Final simplification37.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -2.4e+133) (* R (- lambda1)) (* phi2 (- R (* R (/ phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.4e+133) {
tmp = R * -lambda1;
} else {
tmp = phi2 * (R - (R * (phi1 / phi2)));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-2.4d+133)) then
tmp = r * -lambda1
else
tmp = phi2 * (r - (r * (phi1 / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.4e+133) {
tmp = R * -lambda1;
} else {
tmp = phi2 * (R - (R * (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -2.4e+133: tmp = R * -lambda1 else: tmp = phi2 * (R - (R * (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -2.4e+133) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(phi2 * Float64(R - Float64(R * Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -2.4e+133) tmp = R * -lambda1; else tmp = phi2 * (R - (R * (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -2.4e+133], N[(R * (-lambda1)), $MachinePrecision], N[(phi2 * N[(R - N[(R * N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -2.4 \cdot 10^{+133}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - R \cdot \frac{\phi_1}{\phi_2}\right)\\
\end{array}
\end{array}
if lambda1 < -2.3999999999999999e133Initial program 48.6%
hypot-define88.3%
Simplified88.3%
Taylor expanded in phi1 around 0 76.6%
*-commutative76.6%
Simplified76.6%
Taylor expanded in lambda1 around -inf 54.3%
associate-*r*54.3%
mul-1-neg54.3%
Simplified54.3%
Taylor expanded in phi2 around 0 63.8%
associate-*r*63.8%
mul-1-neg63.8%
Simplified63.8%
if -2.3999999999999999e133 < lambda1 Initial program 61.0%
hypot-define97.3%
Simplified97.3%
Taylor expanded in phi2 around inf 31.8%
mul-1-neg31.8%
unsub-neg31.8%
associate-/l*31.3%
Simplified31.3%
Final simplification36.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -4.4e+112) (* R (- lambda1)) (* R (* phi2 (- 1.0 (/ phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4.4e+112) {
tmp = R * -lambda1;
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-4.4d+112)) then
tmp = r * -lambda1
else
tmp = r * (phi2 * (1.0d0 - (phi1 / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4.4e+112) {
tmp = R * -lambda1;
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -4.4e+112: tmp = R * -lambda1 else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -4.4e+112) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * Float64(phi2 * Float64(1.0 - Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -4.4e+112) tmp = R * -lambda1; else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -4.4e+112], N[(R * (-lambda1)), $MachinePrecision], N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -4.4 \cdot 10^{+112}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if lambda1 < -4.3999999999999999e112Initial program 47.8%
hypot-define89.0%
Simplified89.0%
Taylor expanded in phi1 around 0 78.1%
*-commutative78.1%
Simplified78.1%
Taylor expanded in lambda1 around -inf 53.1%
associate-*r*53.1%
mul-1-neg53.1%
Simplified53.1%
Taylor expanded in phi2 around 0 62.1%
associate-*r*62.1%
mul-1-neg62.1%
Simplified62.1%
if -4.3999999999999999e112 < lambda1 Initial program 61.4%
hypot-define97.3%
Simplified97.3%
Taylor expanded in phi2 around inf 31.2%
mul-1-neg31.2%
unsub-neg31.2%
Simplified31.2%
Final simplification36.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 15600.0) (* R (- phi1)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 15600.0) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 15600.0d0) then
tmp = r * -phi1
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 15600.0) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 15600.0: tmp = R * -phi1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 15600.0) tmp = Float64(R * Float64(-phi1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 15600.0) tmp = R * -phi1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 15600.0], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 15600:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 15600Initial program 59.2%
hypot-define96.1%
Simplified96.1%
Taylor expanded in phi1 around -inf 17.6%
mul-1-neg17.6%
distribute-rgt-neg-in17.6%
Simplified17.6%
if 15600 < phi2 Initial program 57.9%
hypot-define94.6%
Simplified94.6%
Taylor expanded in phi2 around inf 64.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R phi2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * phi2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * phi2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * phi2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * phi2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * phi2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \phi_2
\end{array}
Initial program 58.9%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi2 around inf 17.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda1))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda1;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * lambda1
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda1;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * lambda1
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda1) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * lambda1; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda1), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \lambda_1
\end{array}
Initial program 58.9%
hypot-define95.8%
Simplified95.8%
Taylor expanded in lambda1 around inf 17.8%
*-commutative17.8%
Simplified17.8%
Taylor expanded in phi1 around 0 16.0%
associate-*r*16.0%
Simplified16.0%
Taylor expanded in phi2 around 0 13.7%
herbie shell --seed 2024182
(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))))))