
(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 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(log1p
(expm1
(-
(* (cos (* phi1 0.5)) (cos (* 0.5 phi2)))
(* (sin (* phi1 0.5)) (sin (* 0.5 phi2)))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * log1p(expm1(((cos((phi1 * 0.5)) * cos((0.5 * phi2))) - (sin((phi1 * 0.5)) * sin((0.5 * phi2))))))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.log1p(Math.expm1(((Math.cos((phi1 * 0.5)) * Math.cos((0.5 * phi2))) - (Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2))))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.log1p(math.expm1(((math.cos((phi1 * 0.5)) * math.cos((0.5 * phi2))) - (math.sin((phi1 * 0.5)) * math.sin((0.5 * phi2))))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * log1p(expm1(Float64(Float64(cos(Float64(phi1 * 0.5)) * cos(Float64(0.5 * phi2))) - Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2))))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Log[1 + N[(Exp[N[(N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]] - 1), $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 \mathsf{log1p}\left(\mathsf{expm1}\left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_2\right) - \sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.0%
hypot-define96.5%
Simplified96.5%
log1p-expm1-u96.5%
div-inv96.5%
metadata-eval96.5%
Applied egg-rr96.5%
*-commutative96.5%
distribute-rgt-in96.5%
cos-sum99.8%
Applied egg-rr99.8%
Final simplification99.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 2.2e+80)
(*
R
(hypot (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (- phi1 phi2)))
(*
R
(hypot
(*
lambda2
(-
(* (sin (* phi1 0.5)) (sin (* 0.5 phi2)))
(* (cos (* phi1 0.5)) (cos (* 0.5 phi2)))))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.2e+80) {
tmp = R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * ((sin((phi1 * 0.5)) * sin((0.5 * phi2))) - (cos((phi1 * 0.5)) * cos((0.5 * phi2))))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.2e+80) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * ((Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2))) - (Math.cos((phi1 * 0.5)) * Math.cos((0.5 * phi2))))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 2.2e+80: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * ((math.sin((phi1 * 0.5)) * math.sin((0.5 * phi2))) - (math.cos((phi1 * 0.5)) * math.cos((0.5 * phi2))))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2.2e+80) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2))) - Float64(cos(Float64(phi1 * 0.5)) * cos(Float64(0.5 * phi2))))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 2.2e+80) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2)); else tmp = R * hypot((lambda2 * ((sin((phi1 * 0.5)) * sin((0.5 * phi2))) - (cos((phi1 * 0.5)) * cos((0.5 * phi2))))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2.2e+80], 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], N[(R * N[Sqrt[N[(lambda2 * N[(N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 2.2 \cdot 10^{+80}:\\
\;\;\;\;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)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(\sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right) - \cos \left(\phi_1 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_2\right)\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda2 < 2.20000000000000003e80Initial program 62.3%
hypot-define96.9%
Simplified96.9%
if 2.20000000000000003e80 < lambda2 Initial program 55.4%
hypot-define95.0%
Simplified95.0%
log1p-expm1-u95.0%
div-inv95.0%
metadata-eval95.0%
Applied egg-rr95.0%
*-commutative95.0%
distribute-rgt-in95.0%
cos-sum99.8%
Applied egg-rr99.8%
Taylor expanded in lambda1 around 0 96.0%
mul-1-neg96.0%
Simplified96.0%
Final simplification96.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 7.2e+25) (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi2))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.2e+25) {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.2e+25) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 7.2e+25: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 7.2e+25) 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(0.5 * phi2))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 7.2e+25) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 7.2e+25], 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[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 7.2 \cdot 10^{+25}:\\
\;\;\;\;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(0.5 \cdot \phi_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 7.20000000000000031e25Initial program 65.1%
hypot-define97.7%
Simplified97.7%
Taylor expanded in phi2 around 0 93.9%
if 7.20000000000000031e25 < phi2 Initial program 49.0%
hypot-define93.2%
Simplified93.2%
Taylor expanded in phi1 around 0 93.1%
Final simplification93.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 2.1e+40) (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))) (* R (hypot (* lambda1 (cos (* 0.5 phi2))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.1e+40) {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * hypot((lambda1 * cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.1e+40) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda1 * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.1e+40: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2)) else: tmp = R * math.hypot((lambda1 * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.1e+40) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda1 * cos(Float64(0.5 * phi2))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 2.1e+40) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); else tmp = R * hypot((lambda1 * cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.1e+40], 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[(lambda1 * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.1 \cdot 10^{+40}:\\
\;\;\;\;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(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 2.1000000000000001e40Initial program 64.9%
hypot-define97.7%
Simplified97.7%
Taylor expanded in phi2 around 0 93.9%
if 2.1000000000000001e40 < phi2 Initial program 48.9%
hypot-define93.0%
Simplified93.0%
Taylor expanded in phi1 around 0 92.9%
Taylor expanded in lambda1 around inf 89.4%
Final simplification92.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 4e-37) (* R (hypot phi1 (- lambda1 lambda2))) (* R (hypot (* lambda1 (cos (* 0.5 phi2))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4e-37) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * hypot((lambda1 * cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4e-37) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * Math.hypot((lambda1 * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 4e-37: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * math.hypot((lambda1 * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 4e-37) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * hypot(Float64(lambda1 * cos(Float64(0.5 * phi2))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 4e-37) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * hypot((lambda1 * cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 4e-37], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda1 * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 4 \cdot 10^{-37}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 4.00000000000000027e-37Initial program 65.9%
hypot-define98.4%
Simplified98.4%
Taylor expanded in phi1 around 0 89.9%
Taylor expanded in phi2 around 0 56.4%
unpow256.4%
unpow256.4%
hypot-define73.0%
Simplified73.0%
if 4.00000000000000027e-37 < phi2 Initial program 49.0%
hypot-define91.9%
Simplified91.9%
Taylor expanded in phi1 around 0 90.9%
Taylor expanded in lambda1 around inf 86.3%
(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 61.0%
hypot-define96.5%
Simplified96.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 3.2e+27) (* 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 <= 3.2e+27) {
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 <= 3.2e+27) {
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 <= 3.2e+27: 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 <= 3.2e+27) 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 <= 3.2e+27) 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, 3.2e+27], 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 3.2 \cdot 10^{+27}:\\
\;\;\;\;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.20000000000000015e27Initial program 65.1%
hypot-define97.7%
Simplified97.7%
Taylor expanded in phi1 around 0 89.2%
Taylor expanded in phi2 around 0 56.0%
unpow256.0%
unpow256.0%
hypot-define73.1%
Simplified73.1%
if 3.20000000000000015e27 < phi2 Initial program 49.0%
Taylor expanded in phi2 around inf 70.0%
mul-1-neg70.0%
unsub-neg70.0%
Simplified70.0%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -6e+152)
(* phi1 (- (* R (/ phi2 phi1)) R))
(if (<= phi1 -1.55e-49)
(* phi2 (- R (/ (* R phi1) phi2)))
(if (<= phi1 2.2e-266)
(* lambda1 (- (/ (* R lambda2) lambda1) R))
(* phi2 (+ R (* phi1 (/ R phi2))))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -6e+152) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= -1.55e-49) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} else if (phi1 <= 2.2e-266) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = phi2 * (R + (phi1 * (R / phi2)));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-6d+152)) then
tmp = phi1 * ((r * (phi2 / phi1)) - r)
else if (phi1 <= (-1.55d-49)) then
tmp = phi2 * (r - ((r * phi1) / phi2))
else if (phi1 <= 2.2d-266) then
tmp = lambda1 * (((r * lambda2) / lambda1) - r)
else
tmp = phi2 * (r + (phi1 * (r / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -6e+152) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= -1.55e-49) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} else if (phi1 <= 2.2e-266) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = phi2 * (R + (phi1 * (R / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -6e+152: tmp = phi1 * ((R * (phi2 / phi1)) - R) elif phi1 <= -1.55e-49: tmp = phi2 * (R - ((R * phi1) / phi2)) elif phi1 <= 2.2e-266: tmp = lambda1 * (((R * lambda2) / lambda1) - R) else: tmp = phi2 * (R + (phi1 * (R / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -6e+152) tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); elseif (phi1 <= -1.55e-49) tmp = Float64(phi2 * Float64(R - Float64(Float64(R * phi1) / phi2))); elseif (phi1 <= 2.2e-266) tmp = Float64(lambda1 * Float64(Float64(Float64(R * lambda2) / lambda1) - R)); else tmp = Float64(phi2 * Float64(R + Float64(phi1 * Float64(R / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -6e+152) tmp = phi1 * ((R * (phi2 / phi1)) - R); elseif (phi1 <= -1.55e-49) tmp = phi2 * (R - ((R * phi1) / phi2)); elseif (phi1 <= 2.2e-266) tmp = lambda1 * (((R * lambda2) / lambda1) - R); else tmp = phi2 * (R + (phi1 * (R / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -6e+152], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -1.55e-49], N[(phi2 * N[(R - N[(N[(R * phi1), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 2.2e-266], N[(lambda1 * N[(N[(N[(R * lambda2), $MachinePrecision] / lambda1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R + N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -6 \cdot 10^{+152}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{elif}\;\phi_1 \leq -1.55 \cdot 10^{-49}:\\
\;\;\;\;\phi_2 \cdot \left(R - \frac{R \cdot \phi_1}{\phi_2}\right)\\
\mathbf{elif}\;\phi_1 \leq 2.2 \cdot 10^{-266}:\\
\;\;\;\;\lambda_1 \cdot \left(\frac{R \cdot \lambda_2}{\lambda_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R + \phi_1 \cdot \frac{R}{\phi_2}\right)\\
\end{array}
\end{array}
if phi1 < -5.99999999999999981e152Initial program 41.7%
hypot-define91.4%
Simplified91.4%
Taylor expanded in phi2 around inf 73.7%
associate-*r/73.7%
mul-1-neg73.7%
*-commutative73.7%
Simplified73.7%
Taylor expanded in phi1 around inf 84.9%
+-commutative84.9%
mul-1-neg84.9%
unsub-neg84.9%
associate-/l*84.9%
Simplified84.9%
if -5.99999999999999981e152 < phi1 < -1.55e-49Initial program 67.0%
hypot-define98.1%
Simplified98.1%
Taylor expanded in phi2 around inf 60.6%
associate-*r/60.6%
mul-1-neg60.6%
*-commutative60.6%
Simplified60.6%
*-un-lft-identity60.6%
fma-define60.6%
distribute-frac-neg60.6%
add-sqr-sqrt38.2%
times-frac38.1%
add-sqr-sqrt24.9%
sqrt-unprod25.1%
sqr-neg25.1%
sqrt-unprod2.5%
add-sqr-sqrt20.3%
times-frac15.9%
distribute-rgt-neg-in15.9%
add-sqr-sqrt16.4%
fmm-def16.4%
*-un-lft-identity16.4%
distribute-rgt-neg-in16.4%
add-sqr-sqrt15.9%
times-frac20.3%
Applied egg-rr60.6%
if -1.55e-49 < phi1 < 2.2e-266Initial program 63.8%
hypot-define99.9%
Simplified99.9%
Taylor expanded in lambda1 around -inf 31.2%
mul-1-neg31.2%
distribute-rgt-neg-in31.2%
+-commutative31.2%
mul-1-neg31.2%
unsub-neg31.2%
*-commutative31.2%
associate-*r*31.2%
Simplified31.2%
Taylor expanded in phi1 around 0 31.2%
Taylor expanded in phi2 around 0 34.6%
if 2.2e-266 < phi1 Initial program 62.8%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi2 around inf 13.3%
associate-*r/13.3%
mul-1-neg13.3%
*-commutative13.3%
Simplified13.3%
distribute-lft-in13.3%
distribute-rgt-neg-in13.3%
add-sqr-sqrt12.8%
times-frac12.8%
add-sqr-sqrt9.1%
sqrt-unprod20.5%
sqr-neg20.5%
sqrt-unprod13.1%
add-sqr-sqrt29.2%
times-frac31.6%
add-sqr-sqrt43.4%
Applied egg-rr43.4%
distribute-lft-in45.9%
associate-*r/42.6%
Simplified42.6%
Final simplification49.7%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (/ R phi2))))
(if (<= phi1 -4.1e+151)
(* phi1 (- (* R (/ phi2 phi1)) R))
(if (<= phi1 -9.5e-14)
(* phi2 (- R t_0))
(if (<= phi1 2.2e-268)
(* lambda1 (- (/ (* R lambda2) lambda1) R))
(* phi2 (+ R t_0)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * (R / phi2);
double tmp;
if (phi1 <= -4.1e+151) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= -9.5e-14) {
tmp = phi2 * (R - t_0);
} else if (phi1 <= 2.2e-268) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = phi2 * (R + 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 = phi1 * (r / phi2)
if (phi1 <= (-4.1d+151)) then
tmp = phi1 * ((r * (phi2 / phi1)) - r)
else if (phi1 <= (-9.5d-14)) then
tmp = phi2 * (r - t_0)
else if (phi1 <= 2.2d-268) then
tmp = lambda1 * (((r * lambda2) / lambda1) - r)
else
tmp = phi2 * (r + 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 = phi1 * (R / phi2);
double tmp;
if (phi1 <= -4.1e+151) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= -9.5e-14) {
tmp = phi2 * (R - t_0);
} else if (phi1 <= 2.2e-268) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = phi2 * (R + t_0);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * (R / phi2) tmp = 0 if phi1 <= -4.1e+151: tmp = phi1 * ((R * (phi2 / phi1)) - R) elif phi1 <= -9.5e-14: tmp = phi2 * (R - t_0) elif phi1 <= 2.2e-268: tmp = lambda1 * (((R * lambda2) / lambda1) - R) else: tmp = phi2 * (R + t_0) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * Float64(R / phi2)) tmp = 0.0 if (phi1 <= -4.1e+151) tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); elseif (phi1 <= -9.5e-14) tmp = Float64(phi2 * Float64(R - t_0)); elseif (phi1 <= 2.2e-268) tmp = Float64(lambda1 * Float64(Float64(Float64(R * lambda2) / lambda1) - R)); else tmp = Float64(phi2 * Float64(R + t_0)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = phi1 * (R / phi2); tmp = 0.0; if (phi1 <= -4.1e+151) tmp = phi1 * ((R * (phi2 / phi1)) - R); elseif (phi1 <= -9.5e-14) tmp = phi2 * (R - t_0); elseif (phi1 <= 2.2e-268) tmp = lambda1 * (((R * lambda2) / lambda1) - R); else tmp = phi2 * (R + t_0); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -4.1e+151], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -9.5e-14], N[(phi2 * N[(R - t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 2.2e-268], N[(lambda1 * N[(N[(N[(R * lambda2), $MachinePrecision] / lambda1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R + t$95$0), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \frac{R}{\phi_2}\\
\mathbf{if}\;\phi_1 \leq -4.1 \cdot 10^{+151}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{elif}\;\phi_1 \leq -9.5 \cdot 10^{-14}:\\
\;\;\;\;\phi_2 \cdot \left(R - t\_0\right)\\
\mathbf{elif}\;\phi_1 \leq 2.2 \cdot 10^{-268}:\\
\;\;\;\;\lambda_1 \cdot \left(\frac{R \cdot \lambda_2}{\lambda_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R + t\_0\right)\\
\end{array}
\end{array}
if phi1 < -4.0999999999999998e151Initial program 41.7%
hypot-define91.4%
Simplified91.4%
Taylor expanded in phi2 around inf 73.7%
associate-*r/73.7%
mul-1-neg73.7%
*-commutative73.7%
Simplified73.7%
Taylor expanded in phi1 around inf 84.9%
+-commutative84.9%
mul-1-neg84.9%
unsub-neg84.9%
associate-/l*84.9%
Simplified84.9%
if -4.0999999999999998e151 < phi1 < -9.4999999999999999e-14Initial program 69.9%
hypot-define97.7%
Simplified97.7%
Taylor expanded in phi2 around inf 65.1%
associate-*r/65.1%
mul-1-neg65.1%
*-commutative65.1%
Simplified65.1%
Taylor expanded in phi2 around inf 65.1%
mul-1-neg65.1%
*-commutative65.1%
sub-neg65.1%
associate-*r/62.2%
Simplified62.2%
if -9.4999999999999999e-14 < phi1 < 2.20000000000000004e-268Initial program 61.9%
hypot-define99.9%
Simplified99.9%
Taylor expanded in lambda1 around -inf 31.2%
mul-1-neg31.2%
distribute-rgt-neg-in31.2%
+-commutative31.2%
mul-1-neg31.2%
unsub-neg31.2%
*-commutative31.2%
associate-*r*31.2%
Simplified31.2%
Taylor expanded in phi1 around 0 31.2%
Taylor expanded in phi2 around 0 34.2%
if 2.20000000000000004e-268 < phi1 Initial program 63.1%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi2 around inf 13.2%
associate-*r/13.2%
mul-1-neg13.2%
*-commutative13.2%
Simplified13.2%
distribute-lft-in13.2%
distribute-rgt-neg-in13.2%
add-sqr-sqrt12.7%
times-frac12.7%
add-sqr-sqrt9.0%
sqrt-unprod21.2%
sqr-neg21.2%
sqrt-unprod13.9%
add-sqr-sqrt29.8%
times-frac31.4%
add-sqr-sqrt43.1%
Applied egg-rr43.1%
distribute-lft-in45.6%
associate-*r/43.1%
Simplified43.1%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -1.25e+152)
(* phi1 (- (* R (/ phi2 phi1)) R))
(if (<= phi1 -6.4e-52)
(* phi2 (- R (* R (/ phi1 phi2))))
(if (<= phi1 4.5e-265)
(* lambda1 (- (/ (* R lambda2) lambda1) R))
(* phi2 (+ R (* phi1 (/ R phi2))))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.25e+152) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= -6.4e-52) {
tmp = phi2 * (R - (R * (phi1 / phi2)));
} else if (phi1 <= 4.5e-265) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = phi2 * (R + (phi1 * (R / phi2)));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-1.25d+152)) then
tmp = phi1 * ((r * (phi2 / phi1)) - r)
else if (phi1 <= (-6.4d-52)) then
tmp = phi2 * (r - (r * (phi1 / phi2)))
else if (phi1 <= 4.5d-265) then
tmp = lambda1 * (((r * lambda2) / lambda1) - r)
else
tmp = phi2 * (r + (phi1 * (r / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.25e+152) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= -6.4e-52) {
tmp = phi2 * (R - (R * (phi1 / phi2)));
} else if (phi1 <= 4.5e-265) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = phi2 * (R + (phi1 * (R / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.25e+152: tmp = phi1 * ((R * (phi2 / phi1)) - R) elif phi1 <= -6.4e-52: tmp = phi2 * (R - (R * (phi1 / phi2))) elif phi1 <= 4.5e-265: tmp = lambda1 * (((R * lambda2) / lambda1) - R) else: tmp = phi2 * (R + (phi1 * (R / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.25e+152) tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); elseif (phi1 <= -6.4e-52) tmp = Float64(phi2 * Float64(R - Float64(R * Float64(phi1 / phi2)))); elseif (phi1 <= 4.5e-265) tmp = Float64(lambda1 * Float64(Float64(Float64(R * lambda2) / lambda1) - R)); else tmp = Float64(phi2 * Float64(R + Float64(phi1 * Float64(R / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -1.25e+152) tmp = phi1 * ((R * (phi2 / phi1)) - R); elseif (phi1 <= -6.4e-52) tmp = phi2 * (R - (R * (phi1 / phi2))); elseif (phi1 <= 4.5e-265) tmp = lambda1 * (((R * lambda2) / lambda1) - R); else tmp = phi2 * (R + (phi1 * (R / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.25e+152], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -6.4e-52], N[(phi2 * N[(R - N[(R * N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 4.5e-265], N[(lambda1 * N[(N[(N[(R * lambda2), $MachinePrecision] / lambda1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R + N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.25 \cdot 10^{+152}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{elif}\;\phi_1 \leq -6.4 \cdot 10^{-52}:\\
\;\;\;\;\phi_2 \cdot \left(R - R \cdot \frac{\phi_1}{\phi_2}\right)\\
\mathbf{elif}\;\phi_1 \leq 4.5 \cdot 10^{-265}:\\
\;\;\;\;\lambda_1 \cdot \left(\frac{R \cdot \lambda_2}{\lambda_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R + \phi_1 \cdot \frac{R}{\phi_2}\right)\\
\end{array}
\end{array}
if phi1 < -1.25e152Initial program 41.7%
hypot-define91.4%
Simplified91.4%
Taylor expanded in phi2 around inf 73.7%
associate-*r/73.7%
mul-1-neg73.7%
*-commutative73.7%
Simplified73.7%
Taylor expanded in phi1 around inf 84.9%
+-commutative84.9%
mul-1-neg84.9%
unsub-neg84.9%
associate-/l*84.9%
Simplified84.9%
if -1.25e152 < phi1 < -6.4000000000000002e-52Initial program 67.7%
hypot-define98.1%
Simplified98.1%
Taylor expanded in phi2 around inf 59.3%
mul-1-neg59.3%
unsub-neg59.3%
associate-/l*54.9%
Simplified54.9%
if -6.4000000000000002e-52 < phi1 < 4.5000000000000003e-265Initial program 63.1%
hypot-define99.9%
Simplified99.9%
Taylor expanded in lambda1 around -inf 31.8%
mul-1-neg31.8%
distribute-rgt-neg-in31.8%
+-commutative31.8%
mul-1-neg31.8%
unsub-neg31.8%
*-commutative31.8%
associate-*r*31.8%
Simplified31.8%
Taylor expanded in phi1 around 0 31.8%
Taylor expanded in phi2 around 0 33.5%
if 4.5000000000000003e-265 < phi1 Initial program 62.8%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi2 around inf 13.3%
associate-*r/13.3%
mul-1-neg13.3%
*-commutative13.3%
Simplified13.3%
distribute-lft-in13.3%
distribute-rgt-neg-in13.3%
add-sqr-sqrt12.8%
times-frac12.8%
add-sqr-sqrt9.1%
sqrt-unprod20.5%
sqr-neg20.5%
sqrt-unprod13.1%
add-sqr-sqrt29.2%
times-frac31.6%
add-sqr-sqrt43.4%
Applied egg-rr43.4%
distribute-lft-in45.9%
associate-*r/42.6%
Simplified42.6%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -5.1e-12)
(* phi1 (- (* R (/ phi2 phi1)) R))
(if (<= phi1 1.3e-266)
(* lambda1 (- (/ (* R lambda2) lambda1) R))
(* phi2 (+ R (* phi1 (/ R phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -5.1e-12) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= 1.3e-266) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = phi2 * (R + (phi1 * (R / phi2)));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-5.1d-12)) then
tmp = phi1 * ((r * (phi2 / phi1)) - r)
else if (phi1 <= 1.3d-266) then
tmp = lambda1 * (((r * lambda2) / lambda1) - r)
else
tmp = phi2 * (r + (phi1 * (r / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -5.1e-12) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= 1.3e-266) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = phi2 * (R + (phi1 * (R / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -5.1e-12: tmp = phi1 * ((R * (phi2 / phi1)) - R) elif phi1 <= 1.3e-266: tmp = lambda1 * (((R * lambda2) / lambda1) - R) else: tmp = phi2 * (R + (phi1 * (R / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -5.1e-12) tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); elseif (phi1 <= 1.3e-266) tmp = Float64(lambda1 * Float64(Float64(Float64(R * lambda2) / lambda1) - R)); else tmp = Float64(phi2 * Float64(R + Float64(phi1 * Float64(R / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -5.1e-12) tmp = phi1 * ((R * (phi2 / phi1)) - R); elseif (phi1 <= 1.3e-266) tmp = lambda1 * (((R * lambda2) / lambda1) - R); else tmp = phi2 * (R + (phi1 * (R / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -5.1e-12], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.3e-266], N[(lambda1 * N[(N[(N[(R * lambda2), $MachinePrecision] / lambda1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R + N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -5.1 \cdot 10^{-12}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{elif}\;\phi_1 \leq 1.3 \cdot 10^{-266}:\\
\;\;\;\;\lambda_1 \cdot \left(\frac{R \cdot \lambda_2}{\lambda_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R + \phi_1 \cdot \frac{R}{\phi_2}\right)\\
\end{array}
\end{array}
if phi1 < -5.09999999999999968e-12Initial program 56.6%
hypot-define94.7%
Simplified94.7%
Taylor expanded in phi2 around inf 69.2%
associate-*r/69.2%
mul-1-neg69.2%
*-commutative69.2%
Simplified69.2%
Taylor expanded in phi1 around inf 69.1%
+-commutative69.1%
mul-1-neg69.1%
unsub-neg69.1%
associate-/l*69.1%
Simplified69.1%
if -5.09999999999999968e-12 < phi1 < 1.3e-266Initial program 62.5%
hypot-define99.9%
Simplified99.9%
Taylor expanded in lambda1 around -inf 32.2%
mul-1-neg32.2%
distribute-rgt-neg-in32.2%
+-commutative32.2%
mul-1-neg32.2%
unsub-neg32.2%
*-commutative32.2%
associate-*r*32.2%
Simplified32.2%
Taylor expanded in phi1 around 0 32.2%
Taylor expanded in phi2 around 0 35.2%
if 1.3e-266 < phi1 Initial program 62.8%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi2 around inf 13.3%
associate-*r/13.3%
mul-1-neg13.3%
*-commutative13.3%
Simplified13.3%
distribute-lft-in13.3%
distribute-rgt-neg-in13.3%
add-sqr-sqrt12.8%
times-frac12.8%
add-sqr-sqrt9.1%
sqrt-unprod20.5%
sqr-neg20.5%
sqrt-unprod13.1%
add-sqr-sqrt29.2%
times-frac31.6%
add-sqr-sqrt43.4%
Applied egg-rr43.4%
distribute-lft-in45.9%
associate-*r/42.6%
Simplified42.6%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 -1.45e-116)
(* phi1 (- (* R (/ phi2 phi1)) R))
(if (<= phi2 1.35e-31)
(* lambda1 (- (/ (* R lambda2) lambda1) R))
(* R (* phi2 (- 1.0 (/ phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -1.45e-116) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi2 <= 1.35e-31) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} 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 (phi2 <= (-1.45d-116)) then
tmp = phi1 * ((r * (phi2 / phi1)) - r)
else if (phi2 <= 1.35d-31) then
tmp = lambda1 * (((r * lambda2) / lambda1) - r)
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 (phi2 <= -1.45e-116) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi2 <= 1.35e-31) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -1.45e-116: tmp = phi1 * ((R * (phi2 / phi1)) - R) elif phi2 <= 1.35e-31: tmp = lambda1 * (((R * lambda2) / lambda1) - R) else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -1.45e-116) tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); elseif (phi2 <= 1.35e-31) tmp = Float64(lambda1 * Float64(Float64(Float64(R * lambda2) / lambda1) - R)); 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 <= -1.45e-116) tmp = phi1 * ((R * (phi2 / phi1)) - R); elseif (phi2 <= 1.35e-31) tmp = lambda1 * (((R * lambda2) / lambda1) - R); else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -1.45e-116], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.35e-31], N[(lambda1 * N[(N[(N[(R * lambda2), $MachinePrecision] / lambda1), $MachinePrecision] - R), $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 -1.45 \cdot 10^{-116}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{elif}\;\phi_2 \leq 1.35 \cdot 10^{-31}:\\
\;\;\;\;\lambda_1 \cdot \left(\frac{R \cdot \lambda_2}{\lambda_1} - R\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.4499999999999999e-116Initial program 66.4%
hypot-define96.8%
Simplified96.8%
Taylor expanded in phi2 around inf 17.3%
associate-*r/17.3%
mul-1-neg17.3%
*-commutative17.3%
Simplified17.3%
Taylor expanded in phi1 around inf 16.2%
+-commutative16.2%
mul-1-neg16.2%
unsub-neg16.2%
associate-/l*16.1%
Simplified16.1%
if -1.4499999999999999e-116 < phi2 < 1.35000000000000007e-31Initial program 65.2%
hypot-define99.9%
Simplified99.9%
Taylor expanded in lambda1 around -inf 36.4%
mul-1-neg36.4%
distribute-rgt-neg-in36.4%
+-commutative36.4%
mul-1-neg36.4%
unsub-neg36.4%
*-commutative36.4%
associate-*r*36.4%
Simplified36.4%
Taylor expanded in phi1 around 0 34.8%
Taylor expanded in phi2 around 0 34.8%
if 1.35000000000000007e-31 < phi2 Initial program 48.8%
Taylor expanded in phi2 around inf 67.5%
mul-1-neg67.5%
unsub-neg67.5%
Simplified67.5%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 -8.5e-115)
(* R (- phi1))
(if (<= phi2 7.5e-32)
(* lambda1 (- (/ (* R lambda2) lambda1) R))
(* R (* phi2 (- 1.0 (/ phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -8.5e-115) {
tmp = R * -phi1;
} else if (phi2 <= 7.5e-32) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} 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 (phi2 <= (-8.5d-115)) then
tmp = r * -phi1
else if (phi2 <= 7.5d-32) then
tmp = lambda1 * (((r * lambda2) / lambda1) - r)
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 (phi2 <= -8.5e-115) {
tmp = R * -phi1;
} else if (phi2 <= 7.5e-32) {
tmp = lambda1 * (((R * lambda2) / lambda1) - R);
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -8.5e-115: tmp = R * -phi1 elif phi2 <= 7.5e-32: tmp = lambda1 * (((R * lambda2) / lambda1) - R) else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -8.5e-115) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 7.5e-32) tmp = Float64(lambda1 * Float64(Float64(Float64(R * lambda2) / lambda1) - R)); 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 <= -8.5e-115) tmp = R * -phi1; elseif (phi2 <= 7.5e-32) tmp = lambda1 * (((R * lambda2) / lambda1) - R); else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -8.5e-115], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 7.5e-32], N[(lambda1 * N[(N[(N[(R * lambda2), $MachinePrecision] / lambda1), $MachinePrecision] - R), $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 -8.5 \cdot 10^{-115}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 7.5 \cdot 10^{-32}:\\
\;\;\;\;\lambda_1 \cdot \left(\frac{R \cdot \lambda_2}{\lambda_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if phi2 < -8.49999999999999953e-115Initial program 66.4%
hypot-define96.8%
Simplified96.8%
Taylor expanded in phi1 around -inf 18.3%
mul-1-neg18.3%
*-commutative18.3%
distribute-rgt-neg-in18.3%
Simplified18.3%
if -8.49999999999999953e-115 < phi2 < 7.49999999999999953e-32Initial program 65.2%
hypot-define99.9%
Simplified99.9%
Taylor expanded in lambda1 around -inf 36.4%
mul-1-neg36.4%
distribute-rgt-neg-in36.4%
+-commutative36.4%
mul-1-neg36.4%
unsub-neg36.4%
*-commutative36.4%
associate-*r*36.4%
Simplified36.4%
Taylor expanded in phi1 around 0 34.8%
Taylor expanded in phi2 around 0 34.8%
if 7.49999999999999953e-32 < phi2 Initial program 48.8%
Taylor expanded in phi2 around inf 67.5%
mul-1-neg67.5%
unsub-neg67.5%
Simplified67.5%
Final simplification38.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 3e+120) (- (* R phi2) (* R phi1)) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 3e+120) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = R * lambda2;
}
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 <= 3d+120) then
tmp = (r * phi2) - (r * phi1)
else
tmp = r * lambda2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 3e+120) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 3e+120: tmp = (R * phi2) - (R * phi1) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 3e+120) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 3e+120) tmp = (R * phi2) - (R * phi1); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 3e+120], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 3 \cdot 10^{+120}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 3e120Initial program 61.6%
hypot-define97.0%
Simplified97.0%
Taylor expanded in phi2 around inf 33.4%
associate-*r/33.4%
mul-1-neg33.4%
*-commutative33.4%
Simplified33.4%
Taylor expanded in phi2 around 0 33.4%
+-commutative33.4%
*-commutative33.4%
mul-1-neg33.4%
*-commutative33.4%
unsub-neg33.4%
Simplified33.4%
if 3e120 < lambda2 Initial program 58.0%
hypot-define94.3%
Simplified94.3%
Taylor expanded in lambda2 around -inf 40.3%
mul-1-neg40.3%
*-commutative40.3%
distribute-rgt-neg-in40.3%
Simplified40.3%
Taylor expanded in phi2 around 0 25.8%
*-commutative25.8%
Simplified25.8%
Taylor expanded in phi1 around 0 0.5%
associate-*r*0.5%
neg-mul-10.5%
Simplified0.5%
add-sqr-sqrt0.3%
sqrt-unprod34.4%
sqr-neg34.4%
sqrt-unprod35.2%
add-sqr-sqrt62.6%
*-un-lft-identity62.6%
Applied egg-rr62.6%
Final simplification38.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -3.7e-46) (* R (- phi1)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.7e-46) {
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 (phi1 <= (-3.7d-46)) 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 (phi1 <= -3.7e-46) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -3.7e-46: tmp = R * -phi1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -3.7e-46) 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 (phi1 <= -3.7e-46) tmp = R * -phi1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -3.7e-46], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -3.7 \cdot 10^{-46}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -3.69999999999999983e-46Initial program 56.3%
hypot-define95.1%
Simplified95.1%
Taylor expanded in phi1 around -inf 58.2%
mul-1-neg58.2%
*-commutative58.2%
distribute-rgt-neg-in58.2%
Simplified58.2%
if -3.69999999999999983e-46 < phi1 Initial program 63.0%
hypot-define97.2%
Simplified97.2%
Taylor expanded in phi2 around inf 18.6%
*-commutative18.6%
Simplified18.6%
Final simplification30.7%
(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 61.0%
hypot-define96.5%
Simplified96.5%
Taylor expanded in phi2 around inf 17.2%
*-commutative17.2%
Simplified17.2%
Final simplification17.2%
(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 61.0%
hypot-define96.5%
Simplified96.5%
Taylor expanded in phi1 around 0 90.2%
Taylor expanded in lambda1 around inf 13.8%
Taylor expanded in phi2 around 0 11.7%
*-commutative11.7%
Simplified11.7%
Final simplification11.7%
herbie shell --seed 2024131
(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))))))