
(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 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda2 lambda1)
(-
(* (sin (* 0.5 phi1)) (sin (* phi2 0.5)))
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda2 - lambda1) * ((sin((0.5 * phi1)) * sin((phi2 * 0.5))) - (cos((0.5 * phi1)) * cos((phi2 * 0.5))))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda2 - lambda1) * ((Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5))) - (Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda2 - lambda1) * ((math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5))) - (math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda2 - lambda1) * Float64(Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5))) - Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda2 - lambda1) * ((sin((0.5 * phi1)) * sin((phi2 * 0.5))) - (cos((0.5 * phi1)) * cos((phi2 * 0.5))))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda2 - lambda1), $MachinePrecision] * N[(N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_2 - \lambda_1\right) \cdot \left(\sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right) - \cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 58.7%
hypot-define94.2%
Simplified94.2%
add-log-exp94.2%
div-inv94.2%
metadata-eval94.2%
Applied egg-rr94.2%
*-commutative94.2%
+-commutative94.2%
distribute-rgt-in94.2%
cos-sum99.8%
Applied egg-rr99.8%
rem-log-exp99.9%
sub-neg99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
sub-neg99.9%
Simplified99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -7.5e+183)
(*
R
(hypot
(*
lambda1
(-
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))
(* (sin (* 0.5 phi1)) (sin (* phi2 0.5)))))
(- phi1 phi2)))
(*
R
(hypot
(* (- lambda1 lambda2) (log (exp (cos (* 0.5 (+ phi2 phi1))))))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -7.5e+183) {
tmp = R * hypot((lambda1 * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * log(exp(cos((0.5 * (phi2 + phi1)))))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -7.5e+183) {
tmp = R * Math.hypot((lambda1 * ((Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5))) - (Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5))))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.log(Math.exp(Math.cos((0.5 * (phi2 + phi1)))))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -7.5e+183: tmp = R * math.hypot((lambda1 * ((math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))) - (math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5))))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.log(math.exp(math.cos((0.5 * (phi2 + phi1)))))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -7.5e+183) tmp = Float64(R * hypot(Float64(lambda1 * Float64(Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) - Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5))))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * log(exp(cos(Float64(0.5 * Float64(phi2 + phi1)))))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -7.5e+183) tmp = R * hypot((lambda1 * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * log(exp(cos((0.5 * (phi2 + phi1)))))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -7.5e+183], N[(R * N[Sqrt[N[(lambda1 * N[(N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Log[N[Exp[N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -7.5 \cdot 10^{+183}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right) - \sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right)\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \log \left(e^{\cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)}\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -7.49999999999999966e183Initial program 44.1%
hypot-define86.7%
Simplified86.7%
add-log-exp86.6%
div-inv86.6%
metadata-eval86.6%
Applied egg-rr86.6%
*-commutative86.6%
+-commutative86.6%
distribute-rgt-in86.6%
cos-sum99.6%
Applied egg-rr99.6%
Taylor expanded in lambda1 around inf 82.6%
if -7.49999999999999966e183 < lambda1 Initial program 60.6%
hypot-define95.2%
Simplified95.2%
add-log-exp95.2%
div-inv95.2%
metadata-eval95.2%
Applied egg-rr95.2%
Final simplification93.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 2e-60) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))) (* R (hypot (* (- lambda1 lambda2) (cos (* phi2 0.5))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2e-60) {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2e-60) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2e-60: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi2 * 0.5))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2e-60) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 2e-60) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2e-60], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2 \cdot 10^{-60}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.9999999999999999e-60Initial program 59.9%
hypot-define95.6%
Simplified95.6%
Taylor expanded in phi2 around 0 91.8%
if 1.9999999999999999e-60 < phi2 Initial program 56.5%
hypot-define91.6%
Simplified91.6%
Taylor expanded in phi1 around 0 90.3%
Final simplification91.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_2 + \phi_1}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 58.7%
hypot-define94.2%
Simplified94.2%
Final simplification94.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 58.7%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi2 around 0 89.4%
Final simplification89.4%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -2.9e-31)
(* R (* (cos (* 0.5 phi1)) (- lambda1)))
(if (<= lambda2 8e+149)
(* R (- phi2 phi1))
(* R (* lambda2 (cos (* phi2 0.5)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.9e-31) {
tmp = R * (cos((0.5 * phi1)) * -lambda1);
} else if (lambda2 <= 8e+149) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * cos((phi2 * 0.5)));
}
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 (lambda2 <= (-2.9d-31)) then
tmp = r * (cos((0.5d0 * phi1)) * -lambda1)
else if (lambda2 <= 8d+149) then
tmp = r * (phi2 - phi1)
else
tmp = r * (lambda2 * cos((phi2 * 0.5d0)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.9e-31) {
tmp = R * (Math.cos((0.5 * phi1)) * -lambda1);
} else if (lambda2 <= 8e+149) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * Math.cos((phi2 * 0.5)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -2.9e-31: tmp = R * (math.cos((0.5 * phi1)) * -lambda1) elif lambda2 <= 8e+149: tmp = R * (phi2 - phi1) else: tmp = R * (lambda2 * math.cos((phi2 * 0.5))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -2.9e-31) tmp = Float64(R * Float64(cos(Float64(0.5 * phi1)) * Float64(-lambda1))); elseif (lambda2 <= 8e+149) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * Float64(lambda2 * cos(Float64(phi2 * 0.5)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= -2.9e-31) tmp = R * (cos((0.5 * phi1)) * -lambda1); elseif (lambda2 <= 8e+149) tmp = R * (phi2 - phi1); else tmp = R * (lambda2 * cos((phi2 * 0.5))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -2.9e-31], N[(R * N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * (-lambda1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 8e+149], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -2.9 \cdot 10^{-31}:\\
\;\;\;\;R \cdot \left(\cos \left(0.5 \cdot \phi_1\right) \cdot \left(-\lambda_1\right)\right)\\
\mathbf{elif}\;\lambda_2 \leq 8 \cdot 10^{+149}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if lambda2 < -2.9000000000000001e-31Initial program 52.8%
hypot-define91.3%
Simplified91.3%
Taylor expanded in lambda1 around -inf 14.7%
mul-1-neg14.7%
*-commutative14.7%
distribute-rgt-neg-in14.7%
*-commutative14.7%
*-commutative14.7%
+-commutative14.7%
*-lft-identity14.7%
metadata-eval14.7%
cancel-sign-sub-inv14.7%
*-commutative14.7%
sub-neg14.7%
mul-1-neg14.7%
remove-double-neg14.7%
Simplified14.7%
Taylor expanded in phi2 around 0 18.3%
if -2.9000000000000001e-31 < lambda2 < 8.00000000000000039e149Initial program 62.1%
hypot-define97.0%
Simplified97.0%
Taylor expanded in phi2 around inf 35.8%
mul-1-neg35.8%
unsub-neg35.8%
Simplified35.8%
Taylor expanded in phi2 around 0 41.3%
mul-1-neg41.3%
Simplified41.3%
if 8.00000000000000039e149 < lambda2 Initial program 59.8%
hypot-define90.7%
Simplified90.7%
Taylor expanded in lambda2 around inf 51.6%
*-commutative51.6%
*-commutative51.6%
+-commutative51.6%
*-lft-identity51.6%
metadata-eval51.6%
cancel-sign-sub-inv51.6%
*-commutative51.6%
sub-neg51.6%
mul-1-neg51.6%
remove-double-neg51.6%
Simplified51.6%
Taylor expanded in phi1 around 0 57.9%
Final simplification36.2%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* phi2 0.5))))
(if (<= lambda2 -3.2e-31)
(* R (* t_0 (- lambda1)))
(if (<= lambda2 2.2e+154) (* R (- phi2 phi1)) (* R (* lambda2 t_0))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((phi2 * 0.5));
double tmp;
if (lambda2 <= -3.2e-31) {
tmp = R * (t_0 * -lambda1);
} else if (lambda2 <= 2.2e+154) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * t_0);
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = cos((phi2 * 0.5d0))
if (lambda2 <= (-3.2d-31)) then
tmp = r * (t_0 * -lambda1)
else if (lambda2 <= 2.2d+154) then
tmp = r * (phi2 - phi1)
else
tmp = r * (lambda2 * t_0)
end if
code = tmp
end function
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 <= -3.2e-31) {
tmp = R * (t_0 * -lambda1);
} else if (lambda2 <= 2.2e+154) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * t_0);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((phi2 * 0.5)) tmp = 0 if lambda2 <= -3.2e-31: tmp = R * (t_0 * -lambda1) elif lambda2 <= 2.2e+154: tmp = R * (phi2 - phi1) else: tmp = R * (lambda2 * t_0) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(phi2 * 0.5)) tmp = 0.0 if (lambda2 <= -3.2e-31) tmp = Float64(R * Float64(t_0 * Float64(-lambda1))); elseif (lambda2 <= 2.2e+154) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * Float64(lambda2 * t_0)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = cos((phi2 * 0.5)); tmp = 0.0; if (lambda2 <= -3.2e-31) tmp = R * (t_0 * -lambda1); elseif (lambda2 <= 2.2e+154) tmp = R * (phi2 - phi1); else tmp = R * (lambda2 * t_0); 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, -3.2e-31], N[(R * N[(t$95$0 * (-lambda1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 2.2e+154], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 * t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(\phi_2 \cdot 0.5\right)\\
\mathbf{if}\;\lambda_2 \leq -3.2 \cdot 10^{-31}:\\
\;\;\;\;R \cdot \left(t\_0 \cdot \left(-\lambda_1\right)\right)\\
\mathbf{elif}\;\lambda_2 \leq 2.2 \cdot 10^{+154}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 \cdot t\_0\right)\\
\end{array}
\end{array}
if lambda2 < -3.20000000000000018e-31Initial program 52.8%
hypot-define91.3%
Simplified91.3%
Taylor expanded in lambda1 around -inf 14.7%
mul-1-neg14.7%
*-commutative14.7%
distribute-rgt-neg-in14.7%
*-commutative14.7%
*-commutative14.7%
+-commutative14.7%
*-lft-identity14.7%
metadata-eval14.7%
cancel-sign-sub-inv14.7%
*-commutative14.7%
sub-neg14.7%
mul-1-neg14.7%
remove-double-neg14.7%
Simplified14.7%
Taylor expanded in phi1 around 0 14.3%
if -3.20000000000000018e-31 < lambda2 < 2.2000000000000001e154Initial program 62.1%
hypot-define97.0%
Simplified97.0%
Taylor expanded in phi2 around inf 35.8%
mul-1-neg35.8%
unsub-neg35.8%
Simplified35.8%
Taylor expanded in phi2 around 0 41.3%
mul-1-neg41.3%
Simplified41.3%
if 2.2000000000000001e154 < lambda2 Initial program 59.8%
hypot-define90.7%
Simplified90.7%
Taylor expanded in lambda2 around inf 51.6%
*-commutative51.6%
*-commutative51.6%
+-commutative51.6%
*-lft-identity51.6%
metadata-eval51.6%
cancel-sign-sub-inv51.6%
*-commutative51.6%
sub-neg51.6%
mul-1-neg51.6%
remove-double-neg51.6%
Simplified51.6%
Taylor expanded in phi1 around 0 57.9%
Final simplification34.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -3.1e-31)
(* (* lambda1 (- R)) (cos (* 0.5 (+ phi2 phi1))))
(if (<= lambda2 2.3e+154)
(* R (- phi2 phi1))
(* R (* lambda2 (cos (* phi2 0.5)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -3.1e-31) {
tmp = (lambda1 * -R) * cos((0.5 * (phi2 + phi1)));
} else if (lambda2 <= 2.3e+154) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * cos((phi2 * 0.5)));
}
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 (lambda2 <= (-3.1d-31)) then
tmp = (lambda1 * -r) * cos((0.5d0 * (phi2 + phi1)))
else if (lambda2 <= 2.3d+154) then
tmp = r * (phi2 - phi1)
else
tmp = r * (lambda2 * cos((phi2 * 0.5d0)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -3.1e-31) {
tmp = (lambda1 * -R) * Math.cos((0.5 * (phi2 + phi1)));
} else if (lambda2 <= 2.3e+154) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * Math.cos((phi2 * 0.5)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -3.1e-31: tmp = (lambda1 * -R) * math.cos((0.5 * (phi2 + phi1))) elif lambda2 <= 2.3e+154: tmp = R * (phi2 - phi1) else: tmp = R * (lambda2 * math.cos((phi2 * 0.5))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -3.1e-31) tmp = Float64(Float64(lambda1 * Float64(-R)) * cos(Float64(0.5 * Float64(phi2 + phi1)))); elseif (lambda2 <= 2.3e+154) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * Float64(lambda2 * cos(Float64(phi2 * 0.5)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= -3.1e-31) tmp = (lambda1 * -R) * cos((0.5 * (phi2 + phi1))); elseif (lambda2 <= 2.3e+154) tmp = R * (phi2 - phi1); else tmp = R * (lambda2 * cos((phi2 * 0.5))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -3.1e-31], N[(N[(lambda1 * (-R)), $MachinePrecision] * N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 2.3e+154], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -3.1 \cdot 10^{-31}:\\
\;\;\;\;\left(\lambda_1 \cdot \left(-R\right)\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\\
\mathbf{elif}\;\lambda_2 \leq 2.3 \cdot 10^{+154}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if lambda2 < -3.1e-31Initial program 52.8%
hypot-define91.3%
Simplified91.3%
Taylor expanded in lambda1 around -inf 14.7%
mul-1-neg14.7%
*-commutative14.7%
distribute-rgt-neg-in14.7%
*-commutative14.7%
*-commutative14.7%
+-commutative14.7%
*-lft-identity14.7%
metadata-eval14.7%
cancel-sign-sub-inv14.7%
*-commutative14.7%
sub-neg14.7%
mul-1-neg14.7%
remove-double-neg14.7%
Simplified14.7%
distribute-rgt-neg-out14.7%
neg-sub014.7%
add-sqr-sqrt6.4%
sqrt-unprod15.6%
sqr-neg15.6%
sqrt-unprod5.9%
add-sqr-sqrt9.8%
associate-*l*9.8%
add-sqr-sqrt5.9%
sqrt-unprod15.6%
sqr-neg15.6%
sqrt-unprod6.4%
add-sqr-sqrt14.7%
Applied egg-rr14.7%
neg-sub014.7%
distribute-rgt-neg-in14.7%
Simplified14.7%
if -3.1e-31 < lambda2 < 2.3e154Initial program 62.1%
hypot-define97.0%
Simplified97.0%
Taylor expanded in phi2 around inf 35.8%
mul-1-neg35.8%
unsub-neg35.8%
Simplified35.8%
Taylor expanded in phi2 around 0 41.3%
mul-1-neg41.3%
Simplified41.3%
if 2.3e154 < lambda2 Initial program 59.8%
hypot-define90.7%
Simplified90.7%
Taylor expanded in lambda2 around inf 51.6%
*-commutative51.6%
*-commutative51.6%
+-commutative51.6%
*-lft-identity51.6%
metadata-eval51.6%
cancel-sign-sub-inv51.6%
*-commutative51.6%
sub-neg51.6%
mul-1-neg51.6%
remove-double-neg51.6%
Simplified51.6%
Taylor expanded in phi1 around 0 57.9%
Final simplification35.0%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -3.2e-31)
(* R (* (- lambda1) (cos (* 0.5 (+ phi2 phi1)))))
(if (<= lambda2 7.6e+152)
(* R (- phi2 phi1))
(* R (* lambda2 (cos (* phi2 0.5)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -3.2e-31) {
tmp = R * (-lambda1 * cos((0.5 * (phi2 + phi1))));
} else if (lambda2 <= 7.6e+152) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * cos((phi2 * 0.5)));
}
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 (lambda2 <= (-3.2d-31)) then
tmp = r * (-lambda1 * cos((0.5d0 * (phi2 + phi1))))
else if (lambda2 <= 7.6d+152) then
tmp = r * (phi2 - phi1)
else
tmp = r * (lambda2 * cos((phi2 * 0.5d0)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -3.2e-31) {
tmp = R * (-lambda1 * Math.cos((0.5 * (phi2 + phi1))));
} else if (lambda2 <= 7.6e+152) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * Math.cos((phi2 * 0.5)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -3.2e-31: tmp = R * (-lambda1 * math.cos((0.5 * (phi2 + phi1)))) elif lambda2 <= 7.6e+152: tmp = R * (phi2 - phi1) else: tmp = R * (lambda2 * math.cos((phi2 * 0.5))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -3.2e-31) tmp = Float64(R * Float64(Float64(-lambda1) * cos(Float64(0.5 * Float64(phi2 + phi1))))); elseif (lambda2 <= 7.6e+152) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * Float64(lambda2 * cos(Float64(phi2 * 0.5)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= -3.2e-31) tmp = R * (-lambda1 * cos((0.5 * (phi2 + phi1)))); elseif (lambda2 <= 7.6e+152) tmp = R * (phi2 - phi1); else tmp = R * (lambda2 * cos((phi2 * 0.5))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -3.2e-31], N[(R * N[((-lambda1) * N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 7.6e+152], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -3.2 \cdot 10^{-31}:\\
\;\;\;\;R \cdot \left(\left(-\lambda_1\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\right)\\
\mathbf{elif}\;\lambda_2 \leq 7.6 \cdot 10^{+152}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if lambda2 < -3.20000000000000018e-31Initial program 52.8%
hypot-define91.3%
Simplified91.3%
Taylor expanded in lambda1 around -inf 14.7%
mul-1-neg14.7%
*-commutative14.7%
distribute-rgt-neg-in14.7%
*-commutative14.7%
*-commutative14.7%
+-commutative14.7%
*-lft-identity14.7%
metadata-eval14.7%
cancel-sign-sub-inv14.7%
*-commutative14.7%
sub-neg14.7%
mul-1-neg14.7%
remove-double-neg14.7%
Simplified14.7%
if -3.20000000000000018e-31 < lambda2 < 7.6000000000000001e152Initial program 62.1%
hypot-define97.0%
Simplified97.0%
Taylor expanded in phi2 around inf 35.8%
mul-1-neg35.8%
unsub-neg35.8%
Simplified35.8%
Taylor expanded in phi2 around 0 41.3%
mul-1-neg41.3%
Simplified41.3%
if 7.6000000000000001e152 < lambda2 Initial program 59.8%
hypot-define90.7%
Simplified90.7%
Taylor expanded in lambda2 around inf 51.6%
*-commutative51.6%
*-commutative51.6%
+-commutative51.6%
*-lft-identity51.6%
metadata-eval51.6%
cancel-sign-sub-inv51.6%
*-commutative51.6%
sub-neg51.6%
mul-1-neg51.6%
remove-double-neg51.6%
Simplified51.6%
Taylor expanded in phi1 around 0 57.9%
Final simplification35.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 1.02e+212) (* R (- phi2 phi1)) (* R (* lambda2 (cos (* 0.5 phi1))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.02e+212) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * cos((0.5 * phi1)));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 1.02d+212) then
tmp = r * (phi2 - phi1)
else
tmp = r * (lambda2 * cos((0.5d0 * phi1)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.02e+212) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * Math.cos((0.5 * phi1)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 1.02e+212: tmp = R * (phi2 - phi1) else: tmp = R * (lambda2 * math.cos((0.5 * phi1))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1.02e+212) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * Float64(lambda2 * cos(Float64(0.5 * phi1)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 1.02e+212) tmp = R * (phi2 - phi1); else tmp = R * (lambda2 * cos((0.5 * phi1))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1.02e+212], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.02 \cdot 10^{+212}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 \cdot \cos \left(0.5 \cdot \phi_1\right)\right)\\
\end{array}
\end{array}
if lambda2 < 1.01999999999999992e212Initial program 57.9%
hypot-define94.7%
Simplified94.7%
Taylor expanded in phi2 around inf 28.5%
mul-1-neg28.5%
unsub-neg28.5%
Simplified28.5%
Taylor expanded in phi2 around 0 32.6%
mul-1-neg32.6%
Simplified32.6%
if 1.01999999999999992e212 < lambda2 Initial program 66.8%
hypot-define89.6%
Simplified89.6%
Taylor expanded in lambda2 around inf 53.7%
*-commutative53.7%
*-commutative53.7%
+-commutative53.7%
*-lft-identity53.7%
metadata-eval53.7%
cancel-sign-sub-inv53.7%
*-commutative53.7%
sub-neg53.7%
mul-1-neg53.7%
remove-double-neg53.7%
Simplified53.7%
Taylor expanded in phi2 around 0 64.7%
Final simplification35.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 9.2e+154) (* R (- phi2 phi1)) (* R (* lambda2 (cos (* phi2 0.5))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 9.2e+154) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * cos((phi2 * 0.5)));
}
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 (lambda2 <= 9.2d+154) then
tmp = r * (phi2 - phi1)
else
tmp = r * (lambda2 * cos((phi2 * 0.5d0)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 9.2e+154) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * Math.cos((phi2 * 0.5)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 9.2e+154: tmp = R * (phi2 - phi1) else: tmp = R * (lambda2 * math.cos((phi2 * 0.5))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 9.2e+154) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * Float64(lambda2 * cos(Float64(phi2 * 0.5)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 9.2e+154) tmp = R * (phi2 - phi1); else tmp = R * (lambda2 * cos((phi2 * 0.5))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 9.2e+154], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 9.2 \cdot 10^{+154}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if lambda2 < 9.1999999999999999e154Initial program 58.5%
hypot-define94.8%
Simplified94.8%
Taylor expanded in phi2 around inf 29.8%
mul-1-neg29.8%
unsub-neg29.8%
Simplified29.8%
Taylor expanded in phi2 around 0 34.2%
mul-1-neg34.2%
Simplified34.2%
if 9.1999999999999999e154 < lambda2 Initial program 59.8%
hypot-define90.7%
Simplified90.7%
Taylor expanded in lambda2 around inf 51.6%
*-commutative51.6%
*-commutative51.6%
+-commutative51.6%
*-lft-identity51.6%
metadata-eval51.6%
cancel-sign-sub-inv51.6%
*-commutative51.6%
sub-neg51.6%
mul-1-neg51.6%
remove-double-neg51.6%
Simplified51.6%
Taylor expanded in phi1 around 0 57.9%
Final simplification37.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.45e+170) (* phi1 (- (* R (/ phi2 phi1)) R)) (* R (- phi2 phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.45e+170) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-1.45d+170)) then
tmp = phi1 * ((r * (phi2 / phi1)) - r)
else
tmp = r * (phi2 - phi1)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.45e+170) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.45e+170: tmp = phi1 * ((R * (phi2 / phi1)) - R) else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.45e+170) tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -1.45e+170) tmp = phi1 * ((R * (phi2 / phi1)) - R); else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.45e+170], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.45 \cdot 10^{+170}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -1.45e170Initial program 46.3%
hypot-define85.5%
Simplified85.5%
Taylor expanded in phi1 around -inf 24.3%
associate-*r*24.3%
mul-1-neg24.3%
mul-1-neg24.3%
unsub-neg24.3%
associate-/l*24.4%
Simplified24.4%
if -1.45e170 < lambda1 Initial program 60.5%
hypot-define95.5%
Simplified95.5%
Taylor expanded in phi2 around inf 30.3%
mul-1-neg30.3%
unsub-neg30.3%
Simplified30.3%
Taylor expanded in phi2 around 0 34.6%
mul-1-neg34.6%
Simplified34.6%
Final simplification33.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 9000000000000.0) (* R (- phi1)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 9000000000000.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 <= 9000000000000.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 <= 9000000000000.0) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 9000000000000.0: tmp = R * -phi1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 9000000000000.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 <= 9000000000000.0) tmp = R * -phi1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 9000000000000.0], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 9000000000000:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 9e12Initial program 61.1%
hypot-define95.4%
Simplified95.4%
Taylor expanded in phi1 around -inf 20.3%
mul-1-neg20.3%
*-commutative20.3%
distribute-lft-neg-in20.3%
Simplified20.3%
if 9e12 < phi2 Initial program 52.3%
hypot-define90.9%
Simplified90.9%
Taylor expanded in phi2 around inf 62.5%
*-commutative62.5%
Simplified62.5%
Final simplification31.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (- phi2 phi1)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * (phi2 - phi1);
}
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 - phi1)
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * (phi2 - phi1);
}
def code(R, lambda1, lambda2, phi1, phi2): return R * (phi2 - phi1)
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * Float64(phi2 - phi1)) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * (phi2 - phi1); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \left(\phi_2 - \phi_1\right)
\end{array}
Initial program 58.7%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi2 around inf 28.5%
mul-1-neg28.5%
unsub-neg28.5%
Simplified28.5%
Taylor expanded in phi2 around 0 32.2%
mul-1-neg32.2%
Simplified32.2%
Final simplification32.2%
(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.7%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi2 around inf 19.7%
*-commutative19.7%
Simplified19.7%
Final simplification19.7%
herbie shell --seed 2024055
(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))))))