
(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 13 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)
(fma
(cos (* phi2 0.5))
(cos (* 0.5 phi1))
(* (sin (* phi2 0.5)) (- (sin (* 0.5 phi1))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * fma(cos((phi2 * 0.5)), cos((0.5 * phi1)), (sin((phi2 * 0.5)) * -sin((0.5 * phi1))))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * fma(cos(Float64(phi2 * 0.5)), cos(Float64(0.5 * phi1)), Float64(sin(Float64(phi2 * 0.5)) * Float64(-sin(Float64(0.5 * phi1)))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * (-N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision])), $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{fma}\left(\cos \left(\phi_2 \cdot 0.5\right), \cos \left(0.5 \cdot \phi_1\right), \sin \left(\phi_2 \cdot 0.5\right) \cdot \left(-\sin \left(0.5 \cdot \phi_1\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 60.9%
hypot-define97.6%
Simplified97.6%
add-cbrt-cube97.5%
pow397.5%
div-inv97.5%
metadata-eval97.5%
Applied egg-rr97.5%
*-commutative97.5%
+-commutative97.5%
distribute-rgt-in97.5%
*-commutative97.5%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
rem-cbrt-cube99.9%
cancel-sign-sub-inv99.9%
*-commutative99.9%
fma-define99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.5e-144) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* 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 <= 1.5e-144) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} 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 <= 1.5e-144) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} 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 <= 1.5e-144: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) 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 <= 1.5e-144) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.5e-144) tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); 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, 1.5e-144], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(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 1.5 \cdot 10^{-144}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.4999999999999999e-144Initial program 61.0%
hypot-define98.1%
Simplified98.1%
Taylor expanded in phi2 around 0 86.2%
Taylor expanded in phi2 around 0 54.1%
+-commutative54.1%
unpow254.1%
*-commutative54.1%
unpow254.1%
unpow254.1%
swap-sqr54.1%
hypot-define79.4%
*-commutative79.4%
Simplified79.4%
if 1.4999999999999999e-144 < phi2 Initial program 60.7%
hypot-define96.7%
Simplified96.7%
Taylor expanded in phi1 around 0 94.4%
Final simplification85.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -7.5e-61) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -7.5e-61) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -7.5e-61) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -7.5e-61: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -7.5e-61) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -7.5e-61) tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -7.5e-61], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -7.5 \cdot 10^{-61}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -7.50000000000000047e-61Initial program 64.4%
hypot-define96.9%
Simplified96.9%
Taylor expanded in phi2 around 0 83.7%
Taylor expanded in phi2 around 0 57.5%
+-commutative57.5%
unpow257.5%
*-commutative57.5%
unpow257.5%
unpow257.5%
swap-sqr57.5%
hypot-define83.5%
*-commutative83.5%
Simplified83.5%
if -7.50000000000000047e-61 < phi1 Initial program 59.0%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi2 around 0 81.9%
Taylor expanded in phi1 around 0 50.1%
unpow250.1%
unpow250.1%
hypot-define72.8%
Simplified72.8%
Final simplification76.6%
(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 60.9%
hypot-define97.6%
Simplified97.6%
Final simplification97.6%
(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 60.9%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi2 around 0 90.2%
Final simplification90.2%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -5.6e+184)
(* phi1 (- (* R (/ phi2 phi1)) R))
(if (<= phi1 -6.2e+44)
(* phi2 (- R (/ (* R phi1) phi2)))
(if (<= phi1 -8e+20)
(* R (* phi2 (- 1.0 (/ phi1 phi2))))
(* R (hypot phi2 (- lambda1 lambda2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -5.6e+184) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= -6.2e+44) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} else if (phi1 <= -8e+20) {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -5.6e+184) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else if (phi1 <= -6.2e+44) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} else if (phi1 <= -8e+20) {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -5.6e+184: tmp = phi1 * ((R * (phi2 / phi1)) - R) elif phi1 <= -6.2e+44: tmp = phi2 * (R - ((R * phi1) / phi2)) elif phi1 <= -8e+20: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -5.6e+184) tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); elseif (phi1 <= -6.2e+44) tmp = Float64(phi2 * Float64(R - Float64(Float64(R * phi1) / phi2))); elseif (phi1 <= -8e+20) tmp = Float64(R * Float64(phi2 * Float64(1.0 - Float64(phi1 / phi2)))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -5.6e+184) tmp = phi1 * ((R * (phi2 / phi1)) - R); elseif (phi1 <= -6.2e+44) tmp = phi2 * (R - ((R * phi1) / phi2)); elseif (phi1 <= -8e+20) tmp = R * (phi2 * (1.0 - (phi1 / phi2))); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -5.6e+184], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -6.2e+44], N[(phi2 * N[(R - N[(N[(R * phi1), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -8e+20], N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -5.6 \cdot 10^{+184}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{elif}\;\phi_1 \leq -6.2 \cdot 10^{+44}:\\
\;\;\;\;\phi_2 \cdot \left(R - \frac{R \cdot \phi_1}{\phi_2}\right)\\
\mathbf{elif}\;\phi_1 \leq -8 \cdot 10^{+20}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -5.5999999999999998e184Initial program 52.6%
hypot-define100.0%
Simplified100.0%
Taylor expanded in phi2 around inf 80.3%
associate-*r/80.3%
mul-1-neg80.3%
*-commutative80.3%
Simplified80.3%
Taylor expanded in phi1 around inf 83.0%
neg-mul-183.0%
+-commutative83.0%
unsub-neg83.0%
associate-/l*86.0%
Simplified86.0%
if -5.5999999999999998e184 < phi1 < -6.19999999999999991e44Initial program 66.9%
hypot-define91.6%
Simplified91.6%
Taylor expanded in phi2 around inf 70.1%
associate-*r/70.1%
mul-1-neg70.1%
*-commutative70.1%
Simplified70.1%
if -6.19999999999999991e44 < phi1 < -8e20Initial program 84.4%
hypot-define100.0%
Simplified100.0%
Taylor expanded in phi2 around inf 68.5%
mul-1-neg68.5%
unsub-neg68.5%
Simplified68.5%
if -8e20 < phi1 Initial program 60.7%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi2 around 0 81.8%
Taylor expanded in phi1 around 0 51.4%
unpow251.4%
unpow251.4%
hypot-define73.4%
Simplified73.4%
Final simplification74.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 -2.65e-17) (* R (- lambda1)) (if (<= lambda2 2.05e+161) (* R (- phi2 phi1)) (* R (hypot phi2 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.65e-17) {
tmp = R * -lambda1;
} else if (lambda2 <= 2.05e+161) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * hypot(phi2, lambda2);
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.65e-17) {
tmp = R * -lambda1;
} else if (lambda2 <= 2.05e+161) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * Math.hypot(phi2, lambda2);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -2.65e-17: tmp = R * -lambda1 elif lambda2 <= 2.05e+161: tmp = R * (phi2 - phi1) else: tmp = R * math.hypot(phi2, lambda2) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -2.65e-17) tmp = Float64(R * Float64(-lambda1)); elseif (lambda2 <= 2.05e+161) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * hypot(phi2, lambda2)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= -2.65e-17) tmp = R * -lambda1; elseif (lambda2 <= 2.05e+161) tmp = R * (phi2 - phi1); else tmp = R * hypot(phi2, lambda2); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -2.65e-17], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda2, 2.05e+161], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + lambda2 ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -2.65 \cdot 10^{-17}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_2 \leq 2.05 \cdot 10^{+161}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < -2.6499999999999999e-17Initial program 52.2%
hypot-define96.0%
Simplified96.0%
Taylor expanded in phi2 around 0 71.7%
Taylor expanded in phi1 around 0 46.4%
unpow246.4%
unpow246.4%
hypot-define70.6%
Simplified70.6%
Taylor expanded in lambda1 around -inf 15.3%
associate-*r*15.3%
mul-1-neg15.3%
Simplified15.3%
if -2.6499999999999999e-17 < lambda2 < 2.0500000000000001e161Initial program 66.8%
hypot-define99.4%
Simplified99.4%
Taylor expanded in phi2 around inf 40.8%
associate-*r/40.8%
mul-1-neg40.8%
*-commutative40.8%
Simplified40.8%
Taylor expanded in phi1 around inf 37.6%
mul-1-neg37.6%
distribute-frac-neg37.6%
+-commutative37.6%
distribute-frac-neg37.6%
unsub-neg37.6%
Simplified37.6%
Taylor expanded in phi2 around 0 42.6%
+-commutative42.6%
mul-1-neg42.6%
sub-neg42.6%
distribute-lft-out--43.8%
Simplified43.8%
if 2.0500000000000001e161 < lambda2 Initial program 50.7%
hypot-define92.1%
Simplified92.1%
Taylor expanded in phi2 around 0 82.3%
Taylor expanded in phi1 around 0 50.7%
unpow250.7%
unpow250.7%
hypot-define73.8%
Simplified73.8%
Taylor expanded in lambda1 around 0 50.7%
+-commutative50.7%
unpow250.7%
unpow250.7%
hypot-define70.8%
Simplified70.8%
Final simplification39.3%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -1.35e-15)
(* R (- phi1))
(if (<= phi1 -2.4e-168)
(* R lambda2)
(if (or (<= phi1 1.55e-287) (not (<= phi1 3.2e-246)))
(* R phi2)
(* R (- lambda1))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.35e-15) {
tmp = R * -phi1;
} else if (phi1 <= -2.4e-168) {
tmp = R * lambda2;
} else if ((phi1 <= 1.55e-287) || !(phi1 <= 3.2e-246)) {
tmp = R * phi2;
} else {
tmp = R * -lambda1;
}
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.35d-15)) then
tmp = r * -phi1
else if (phi1 <= (-2.4d-168)) then
tmp = r * lambda2
else if ((phi1 <= 1.55d-287) .or. (.not. (phi1 <= 3.2d-246))) then
tmp = r * phi2
else
tmp = r * -lambda1
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.35e-15) {
tmp = R * -phi1;
} else if (phi1 <= -2.4e-168) {
tmp = R * lambda2;
} else if ((phi1 <= 1.55e-287) || !(phi1 <= 3.2e-246)) {
tmp = R * phi2;
} else {
tmp = R * -lambda1;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.35e-15: tmp = R * -phi1 elif phi1 <= -2.4e-168: tmp = R * lambda2 elif (phi1 <= 1.55e-287) or not (phi1 <= 3.2e-246): tmp = R * phi2 else: tmp = R * -lambda1 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.35e-15) tmp = Float64(R * Float64(-phi1)); elseif (phi1 <= -2.4e-168) tmp = Float64(R * lambda2); elseif ((phi1 <= 1.55e-287) || !(phi1 <= 3.2e-246)) tmp = Float64(R * phi2); else tmp = Float64(R * Float64(-lambda1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -1.35e-15) tmp = R * -phi1; elseif (phi1 <= -2.4e-168) tmp = R * lambda2; elseif ((phi1 <= 1.55e-287) || ~((phi1 <= 3.2e-246))) tmp = R * phi2; else tmp = R * -lambda1; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.35e-15], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi1, -2.4e-168], N[(R * lambda2), $MachinePrecision], If[Or[LessEqual[phi1, 1.55e-287], N[Not[LessEqual[phi1, 3.2e-246]], $MachinePrecision]], N[(R * phi2), $MachinePrecision], N[(R * (-lambda1)), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.35 \cdot 10^{-15}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -2.4 \cdot 10^{-168}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{elif}\;\phi_1 \leq 1.55 \cdot 10^{-287} \lor \neg \left(\phi_1 \leq 3.2 \cdot 10^{-246}\right):\\
\;\;\;\;R \cdot \phi_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\end{array}
\end{array}
if phi1 < -1.35000000000000005e-15Initial program 64.5%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi1 around -inf 68.5%
mul-1-neg68.5%
*-commutative68.5%
distribute-rgt-neg-in68.5%
Simplified68.5%
if -1.35000000000000005e-15 < phi1 < -2.3999999999999999e-168Initial program 60.4%
hypot-define99.8%
Simplified99.8%
Taylor expanded in phi2 around 0 82.7%
Taylor expanded in phi1 around 0 55.2%
unpow255.2%
unpow255.2%
hypot-define81.4%
Simplified81.4%
Taylor expanded in lambda2 around inf 29.5%
*-commutative29.5%
Simplified29.5%
if -2.3999999999999999e-168 < phi1 < 1.55e-287 or 3.2000000000000001e-246 < phi1 Initial program 58.2%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi2 around inf 26.0%
*-commutative26.0%
Simplified26.0%
if 1.55e-287 < phi1 < 3.2000000000000001e-246Initial program 71.0%
hypot-define100.0%
Simplified100.0%
Taylor expanded in phi2 around 0 83.8%
Taylor expanded in phi1 around 0 63.0%
unpow263.0%
unpow263.0%
hypot-define83.8%
Simplified83.8%
Taylor expanded in lambda1 around -inf 31.9%
associate-*r*31.9%
mul-1-neg31.9%
Simplified31.9%
Final simplification39.3%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -2.65e-17)
(* R (- lambda1))
(if (<= lambda2 1.65e+160)
(* R (- phi2 phi1))
(* lambda2 (- R (* lambda1 (/ R lambda2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.65e-17) {
tmp = R * -lambda1;
} else if (lambda2 <= 1.65e+160) {
tmp = R * (phi2 - phi1);
} else {
tmp = lambda2 * (R - (lambda1 * (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 <= (-2.65d-17)) then
tmp = r * -lambda1
else if (lambda2 <= 1.65d+160) then
tmp = r * (phi2 - phi1)
else
tmp = lambda2 * (r - (lambda1 * (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 <= -2.65e-17) {
tmp = R * -lambda1;
} else if (lambda2 <= 1.65e+160) {
tmp = R * (phi2 - phi1);
} else {
tmp = lambda2 * (R - (lambda1 * (R / lambda2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -2.65e-17: tmp = R * -lambda1 elif lambda2 <= 1.65e+160: tmp = R * (phi2 - phi1) else: tmp = lambda2 * (R - (lambda1 * (R / lambda2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -2.65e-17) tmp = Float64(R * Float64(-lambda1)); elseif (lambda2 <= 1.65e+160) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(lambda2 * Float64(R - Float64(lambda1 * Float64(R / lambda2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= -2.65e-17) tmp = R * -lambda1; elseif (lambda2 <= 1.65e+160) tmp = R * (phi2 - phi1); else tmp = lambda2 * (R - (lambda1 * (R / lambda2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -2.65e-17], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda2, 1.65e+160], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(lambda2 * N[(R - N[(lambda1 * N[(R / lambda2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -2.65 \cdot 10^{-17}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_2 \leq 1.65 \cdot 10^{+160}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;\lambda_2 \cdot \left(R - \lambda_1 \cdot \frac{R}{\lambda_2}\right)\\
\end{array}
\end{array}
if lambda2 < -2.6499999999999999e-17Initial program 52.2%
hypot-define96.0%
Simplified96.0%
Taylor expanded in phi2 around 0 71.7%
Taylor expanded in phi1 around 0 46.4%
unpow246.4%
unpow246.4%
hypot-define70.6%
Simplified70.6%
Taylor expanded in lambda1 around -inf 15.3%
associate-*r*15.3%
mul-1-neg15.3%
Simplified15.3%
if -2.6499999999999999e-17 < lambda2 < 1.6499999999999999e160Initial program 66.8%
hypot-define99.4%
Simplified99.4%
Taylor expanded in phi2 around inf 40.8%
associate-*r/40.8%
mul-1-neg40.8%
*-commutative40.8%
Simplified40.8%
Taylor expanded in phi1 around inf 37.6%
mul-1-neg37.6%
distribute-frac-neg37.6%
+-commutative37.6%
distribute-frac-neg37.6%
unsub-neg37.6%
Simplified37.6%
Taylor expanded in phi2 around 0 42.6%
+-commutative42.6%
mul-1-neg42.6%
sub-neg42.6%
distribute-lft-out--43.8%
Simplified43.8%
if 1.6499999999999999e160 < lambda2 Initial program 50.7%
hypot-define92.1%
Simplified92.1%
Taylor expanded in phi2 around 0 82.3%
Taylor expanded in phi1 around 0 50.7%
unpow250.7%
unpow250.7%
hypot-define73.8%
Simplified73.8%
Taylor expanded in lambda2 around inf 64.1%
mul-1-neg64.1%
unsub-neg64.1%
*-commutative64.1%
associate-/l*64.1%
Simplified64.1%
Final simplification38.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 -2.65e-17) (* R (- lambda1)) (if (<= lambda2 3.8e+160) (* R (- phi2 phi1)) (* R lambda2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.65e-17) {
tmp = R * -lambda1;
} else if (lambda2 <= 3.8e+160) {
tmp = R * (phi2 - 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 <= (-2.65d-17)) then
tmp = r * -lambda1
else if (lambda2 <= 3.8d+160) then
tmp = r * (phi2 - 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 <= -2.65e-17) {
tmp = R * -lambda1;
} else if (lambda2 <= 3.8e+160) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -2.65e-17: tmp = R * -lambda1 elif lambda2 <= 3.8e+160: tmp = R * (phi2 - phi1) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -2.65e-17) tmp = Float64(R * Float64(-lambda1)); elseif (lambda2 <= 3.8e+160) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= -2.65e-17) tmp = R * -lambda1; elseif (lambda2 <= 3.8e+160) tmp = R * (phi2 - phi1); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -2.65e-17], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda2, 3.8e+160], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -2.65 \cdot 10^{-17}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_2 \leq 3.8 \cdot 10^{+160}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < -2.6499999999999999e-17Initial program 52.2%
hypot-define96.0%
Simplified96.0%
Taylor expanded in phi2 around 0 71.7%
Taylor expanded in phi1 around 0 46.4%
unpow246.4%
unpow246.4%
hypot-define70.6%
Simplified70.6%
Taylor expanded in lambda1 around -inf 15.3%
associate-*r*15.3%
mul-1-neg15.3%
Simplified15.3%
if -2.6499999999999999e-17 < lambda2 < 3.80000000000000012e160Initial program 66.8%
hypot-define99.4%
Simplified99.4%
Taylor expanded in phi2 around inf 40.8%
associate-*r/40.8%
mul-1-neg40.8%
*-commutative40.8%
Simplified40.8%
Taylor expanded in phi1 around inf 37.6%
mul-1-neg37.6%
distribute-frac-neg37.6%
+-commutative37.6%
distribute-frac-neg37.6%
unsub-neg37.6%
Simplified37.6%
Taylor expanded in phi2 around 0 42.6%
+-commutative42.6%
mul-1-neg42.6%
sub-neg42.6%
distribute-lft-out--43.8%
Simplified43.8%
if 3.80000000000000012e160 < lambda2 Initial program 50.7%
hypot-define92.1%
Simplified92.1%
Taylor expanded in phi2 around 0 82.3%
Taylor expanded in phi1 around 0 50.7%
unpow250.7%
unpow250.7%
hypot-define73.8%
Simplified73.8%
Taylor expanded in lambda2 around inf 70.8%
*-commutative70.8%
Simplified70.8%
Final simplification39.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -9e-16) (* R (- phi1)) (if (<= phi1 -9e-168) (* R lambda2) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -9e-16) {
tmp = R * -phi1;
} else if (phi1 <= -9e-168) {
tmp = R * lambda2;
} 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 <= (-9d-16)) then
tmp = r * -phi1
else if (phi1 <= (-9d-168)) then
tmp = r * lambda2
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 <= -9e-16) {
tmp = R * -phi1;
} else if (phi1 <= -9e-168) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -9e-16: tmp = R * -phi1 elif phi1 <= -9e-168: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -9e-16) tmp = Float64(R * Float64(-phi1)); elseif (phi1 <= -9e-168) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -9e-16) tmp = R * -phi1; elseif (phi1 <= -9e-168) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -9e-16], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi1, -9e-168], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -9 \cdot 10^{-16}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -9 \cdot 10^{-168}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -9.0000000000000003e-16Initial program 64.5%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi1 around -inf 68.5%
mul-1-neg68.5%
*-commutative68.5%
distribute-rgt-neg-in68.5%
Simplified68.5%
if -9.0000000000000003e-16 < phi1 < -9.0000000000000002e-168Initial program 59.2%
hypot-define99.8%
Simplified99.8%
Taylor expanded in phi2 around 0 82.2%
Taylor expanded in phi1 around 0 53.9%
unpow253.9%
unpow253.9%
hypot-define80.8%
Simplified80.8%
Taylor expanded in lambda2 around inf 30.3%
*-commutative30.3%
Simplified30.3%
if -9.0000000000000002e-168 < phi1 Initial program 59.3%
hypot-define97.7%
Simplified97.7%
Taylor expanded in phi2 around inf 24.3%
*-commutative24.3%
Simplified24.3%
Final simplification38.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 5.2e-24) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.2e-24) {
tmp = R * lambda2;
} 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 <= 5.2d-24) then
tmp = r * lambda2
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 <= 5.2e-24) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 5.2e-24: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 5.2e-24) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 5.2e-24) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5.2e-24], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 5.2 \cdot 10^{-24}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 5.2e-24Initial program 62.5%
hypot-define98.4%
Simplified98.4%
Taylor expanded in phi2 around 0 88.1%
Taylor expanded in phi1 around 0 46.6%
unpow246.6%
unpow246.6%
hypot-define64.3%
Simplified64.3%
Taylor expanded in lambda2 around inf 18.2%
*-commutative18.2%
Simplified18.2%
if 5.2e-24 < phi2 Initial program 57.3%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi2 around inf 56.7%
*-commutative56.7%
Simplified56.7%
Final simplification30.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * lambda2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * lambda2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * lambda2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \lambda_2
\end{array}
Initial program 60.9%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi2 around 0 82.5%
Taylor expanded in phi1 around 0 47.2%
unpow247.2%
unpow247.2%
hypot-define64.8%
Simplified64.8%
Taylor expanded in lambda2 around inf 15.7%
*-commutative15.7%
Simplified15.7%
Final simplification15.7%
herbie shell --seed 2024100
(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))))))