
(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 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* -0.5 phi1))))
(if (<= phi2 2.8e-23)
(* R (hypot (* t_0 (- lambda1 lambda2)) phi1))
(*
R
(hypot
(fma
(* (cos (* phi2 0.5)) lambda2)
t_0
(* (* lambda2 (sin (* phi1 0.5))) (sin (* phi2 -0.5))))
(- phi1 phi2))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((-0.5 * phi1));
double tmp;
if (phi2 <= 2.8e-23) {
tmp = R * hypot((t_0 * (lambda1 - lambda2)), phi1);
} else {
tmp = R * hypot(fma((cos((phi2 * 0.5)) * lambda2), t_0, ((lambda2 * sin((phi1 * 0.5))) * sin((phi2 * -0.5)))), (phi1 - phi2));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(-0.5 * phi1)) tmp = 0.0 if (phi2 <= 2.8e-23) tmp = Float64(R * hypot(Float64(t_0 * Float64(lambda1 - lambda2)), phi1)); else tmp = Float64(R * hypot(fma(Float64(cos(Float64(phi2 * 0.5)) * lambda2), t_0, Float64(Float64(lambda2 * sin(Float64(phi1 * 0.5))) * sin(Float64(phi2 * -0.5)))), Float64(phi1 - phi2))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 2.8e-23], N[(R * N[Sqrt[N[(t$95$0 * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * lambda2), $MachinePrecision] * t$95$0 + N[(N[(lambda2 * N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sin[N[(phi2 * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(-0.5 \cdot \phi_1\right)\\
\mathbf{if}\;\phi_2 \leq 2.8 \cdot 10^{-23}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(t\_0 \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\mathsf{fma}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \lambda_2, t\_0, \left(\lambda_2 \cdot \sin \left(\phi_1 \cdot 0.5\right)\right) \cdot \sin \left(\phi_2 \cdot -0.5\right)\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 2.7999999999999997e-23Initial program 61.9%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6483.0
Applied rewrites83.0%
if 2.7999999999999997e-23 < phi2 Initial program 57.3%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6490.5
Applied rewrites90.5%
Applied rewrites91.7%
Applied rewrites91.7%
Applied rewrites91.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 2.8e-23)
(* R (hypot (* (cos (* -0.5 phi1)) (- lambda1 lambda2)) phi1))
(*
R
(hypot
(*
(fma
(cos (* -0.5 phi2))
(cos (* 0.5 phi1))
(* (sin (* -0.5 phi2)) (sin (* 0.5 phi1))))
lambda2)
(- phi1 phi2)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.8e-23) {
tmp = R * hypot((cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
} else {
tmp = R * hypot((fma(cos((-0.5 * phi2)), cos((0.5 * phi1)), (sin((-0.5 * phi2)) * sin((0.5 * phi1)))) * lambda2), (phi1 - phi2));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.8e-23) tmp = Float64(R * hypot(Float64(cos(Float64(-0.5 * phi1)) * Float64(lambda1 - lambda2)), phi1)); else tmp = Float64(R * hypot(Float64(fma(cos(Float64(-0.5 * phi2)), cos(Float64(0.5 * phi1)), Float64(sin(Float64(-0.5 * phi2)) * sin(Float64(0.5 * phi1)))) * lambda2), Float64(phi1 - phi2))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.8e-23], N[(R * N[Sqrt[N[(N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(N[Cos[N[(-0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(-0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.8 \cdot 10^{-23}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(-0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\mathsf{fma}\left(\cos \left(-0.5 \cdot \phi_2\right), \cos \left(0.5 \cdot \phi_1\right), \sin \left(-0.5 \cdot \phi_2\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\right) \cdot \lambda_2, \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 2.7999999999999997e-23Initial program 61.9%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6483.0
Applied rewrites83.0%
if 2.7999999999999997e-23 < phi2 Initial program 57.3%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6490.5
Applied rewrites90.5%
Applied rewrites91.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1000.0) (* R (hypot (* (cos (* -0.5 phi1)) (- lambda1 lambda2)) phi1)) (* R (hypot (* (cos (* -0.5 phi2)) (- lambda1 lambda2)) phi2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1000.0) {
tmp = R * hypot((cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
} else {
tmp = R * hypot((cos((-0.5 * phi2)) * (lambda1 - lambda2)), phi2);
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1000.0) {
tmp = R * Math.hypot((Math.cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
} else {
tmp = R * Math.hypot((Math.cos((-0.5 * phi2)) * (lambda1 - lambda2)), phi2);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1000.0: tmp = R * math.hypot((math.cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1) else: tmp = R * math.hypot((math.cos((-0.5 * phi2)) * (lambda1 - lambda2)), phi2) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1000.0) tmp = Float64(R * hypot(Float64(cos(Float64(-0.5 * phi1)) * Float64(lambda1 - lambda2)), phi1)); else tmp = Float64(R * hypot(Float64(cos(Float64(-0.5 * phi2)) * Float64(lambda1 - lambda2)), phi2)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -1000.0)
tmp = R * hypot((cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
else
tmp = R * hypot((cos((-0.5 * phi2)) * (lambda1 - lambda2)), phi2);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1000.0], N[(R * N[Sqrt[N[(N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[Cos[N[(-0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1000:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(-0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(-0.5 \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -1e3Initial program 58.7%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6484.7
Applied rewrites84.7%
if -1e3 < phi1 Initial program 61.7%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6484.2
Applied rewrites84.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.65e+30) (* R (hypot (* (cos (* -0.5 phi1)) (- lambda1 lambda2)) phi1)) (* R (hypot (* (cos (* -0.5 phi2)) lambda2) phi2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.65e+30) {
tmp = R * hypot((cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
} else {
tmp = R * hypot((cos((-0.5 * phi2)) * lambda2), phi2);
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.65e+30) {
tmp = R * Math.hypot((Math.cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
} else {
tmp = R * Math.hypot((Math.cos((-0.5 * phi2)) * lambda2), phi2);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.65e+30: tmp = R * math.hypot((math.cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1) else: tmp = R * math.hypot((math.cos((-0.5 * phi2)) * lambda2), phi2) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.65e+30) tmp = Float64(R * hypot(Float64(cos(Float64(-0.5 * phi1)) * Float64(lambda1 - lambda2)), phi1)); else tmp = Float64(R * hypot(Float64(cos(Float64(-0.5 * phi2)) * lambda2), phi2)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 1.65e+30)
tmp = R * hypot((cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
else
tmp = R * hypot((cos((-0.5 * phi2)) * lambda2), phi2);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.65e+30], N[(R * N[Sqrt[N[(N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[Cos[N[(-0.5 * phi2), $MachinePrecision]], $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.65 \cdot 10^{+30}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(-0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(-0.5 \cdot \phi_2\right) \cdot \lambda_2, \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.65000000000000013e30Initial program 61.7%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6481.6
Applied rewrites81.6%
if 1.65000000000000013e30 < phi2 Initial program 56.7%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6490.1
Applied rewrites90.1%
Taylor expanded in phi1 around 0
Applied rewrites74.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1e+77) (* R (hypot (* (cos (* 0.5 phi1)) lambda2) phi1)) (* R (hypot (* 1.0 (- lambda1 lambda2)) phi2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1e+77) {
tmp = R * hypot((cos((0.5 * phi1)) * lambda2), phi1);
} else {
tmp = R * hypot((1.0 * (lambda1 - lambda2)), phi2);
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1e+77) {
tmp = R * Math.hypot((Math.cos((0.5 * phi1)) * lambda2), phi1);
} else {
tmp = R * Math.hypot((1.0 * (lambda1 - lambda2)), phi2);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1e+77: tmp = R * math.hypot((math.cos((0.5 * phi1)) * lambda2), phi1) else: tmp = R * math.hypot((1.0 * (lambda1 - lambda2)), phi2) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1e+77) tmp = Float64(R * hypot(Float64(cos(Float64(0.5 * phi1)) * lambda2), phi1)); else tmp = Float64(R * hypot(Float64(1.0 * Float64(lambda1 - lambda2)), phi2)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -1e+77)
tmp = R * hypot((cos((0.5 * phi1)) * lambda2), phi1);
else
tmp = R * hypot((1.0 * (lambda1 - lambda2)), phi2);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1e+77], N[(R * N[Sqrt[N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(1.0 * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1 \cdot 10^{+77}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \lambda_2, \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(1 \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -9.99999999999999983e76Initial program 53.7%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6489.5
Applied rewrites89.5%
Taylor expanded in lambda1 around 0
Applied rewrites84.9%
if -9.99999999999999983e76 < phi1 Initial program 62.9%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6477.7
Applied rewrites77.7%
Applied rewrites79.3%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6482.3
Applied rewrites82.3%
Taylor expanded in phi2 around 0
Applied rewrites74.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -390000000000.0) (* R (hypot (* (cos (* 0.5 phi1)) lambda1) phi1)) (* R (hypot (* 1.0 (- lambda1 lambda2)) phi2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -390000000000.0) {
tmp = R * hypot((cos((0.5 * phi1)) * lambda1), phi1);
} else {
tmp = R * hypot((1.0 * (lambda1 - lambda2)), phi2);
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -390000000000.0) {
tmp = R * Math.hypot((Math.cos((0.5 * phi1)) * lambda1), phi1);
} else {
tmp = R * Math.hypot((1.0 * (lambda1 - lambda2)), phi2);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -390000000000.0: tmp = R * math.hypot((math.cos((0.5 * phi1)) * lambda1), phi1) else: tmp = R * math.hypot((1.0 * (lambda1 - lambda2)), phi2) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -390000000000.0) tmp = Float64(R * hypot(Float64(cos(Float64(0.5 * phi1)) * lambda1), phi1)); else tmp = Float64(R * hypot(Float64(1.0 * Float64(lambda1 - lambda2)), phi2)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -390000000000.0)
tmp = R * hypot((cos((0.5 * phi1)) * lambda1), phi1);
else
tmp = R * hypot((1.0 * (lambda1 - lambda2)), phi2);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -390000000000.0], N[(R * N[Sqrt[N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * lambda1), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(1.0 * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -390000000000:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \lambda_1, \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(1 \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -3.9e11Initial program 58.7%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6484.7
Applied rewrites84.7%
Taylor expanded in lambda2 around 0
Applied rewrites73.7%
if -3.9e11 < phi1 Initial program 61.7%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6478.5
Applied rewrites78.5%
Applied rewrites79.4%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6484.2
Applied rewrites84.2%
Taylor expanded in phi2 around 0
Applied rewrites76.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -7.4e+47) (* (- phi1) (- R (* R (/ phi2 phi1)))) (* R (hypot (* 1.0 (- lambda1 lambda2)) phi2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -7.4e+47) {
tmp = -phi1 * (R - (R * (phi2 / phi1)));
} else {
tmp = R * hypot((1.0 * (lambda1 - lambda2)), phi2);
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -7.4e+47) {
tmp = -phi1 * (R - (R * (phi2 / phi1)));
} else {
tmp = R * Math.hypot((1.0 * (lambda1 - lambda2)), phi2);
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -7.4e+47: tmp = -phi1 * (R - (R * (phi2 / phi1))) else: tmp = R * math.hypot((1.0 * (lambda1 - lambda2)), phi2) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -7.4e+47) tmp = Float64(Float64(-phi1) * Float64(R - Float64(R * Float64(phi2 / phi1)))); else tmp = Float64(R * hypot(Float64(1.0 * Float64(lambda1 - lambda2)), phi2)); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -7.4e+47)
tmp = -phi1 * (R - (R * (phi2 / phi1)));
else
tmp = R * hypot((1.0 * (lambda1 - lambda2)), phi2);
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -7.4e+47], N[((-phi1) * N[(R - N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(1.0 * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -7.4 \cdot 10^{+47}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \left(R - R \cdot \frac{\phi_2}{\phi_1}\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(1 \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -7.40000000000000081e47Initial program 55.2%
Taylor expanded in phi1 around -inf
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
fp-cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6476.8
Applied rewrites76.8%
if -7.40000000000000081e47 < phi1 Initial program 62.7%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6478.1
Applied rewrites78.1%
Applied rewrites79.4%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6483.7
Applied rewrites83.7%
Taylor expanded in phi2 around 0
Applied rewrites76.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.3e+152) (* (- phi1) (- R (* R (/ phi2 phi1)))) (* (- R (* R (/ phi1 phi2))) phi2)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.3e+152) {
tmp = -phi1 * (R - (R * (phi2 / phi1)));
} else {
tmp = (R - (R * (phi1 / phi2))) * phi2;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 1.3d+152) then
tmp = -phi1 * (r - (r * (phi2 / phi1)))
else
tmp = (r - (r * (phi1 / phi2))) * phi2
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.3e+152) {
tmp = -phi1 * (R - (R * (phi2 / phi1)));
} else {
tmp = (R - (R * (phi1 / phi2))) * phi2;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.3e+152: tmp = -phi1 * (R - (R * (phi2 / phi1))) else: tmp = (R - (R * (phi1 / phi2))) * phi2 return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.3e+152) tmp = Float64(Float64(-phi1) * Float64(R - Float64(R * Float64(phi2 / phi1)))); else tmp = Float64(Float64(R - Float64(R * Float64(phi1 / phi2))) * phi2); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 1.3e+152)
tmp = -phi1 * (R - (R * (phi2 / phi1)));
else
tmp = (R - (R * (phi1 / phi2))) * phi2;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.3e+152], N[((-phi1) * N[(R - N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(R - N[(R * N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * phi2), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.3 \cdot 10^{+152}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \left(R - R \cdot \frac{\phi_2}{\phi_1}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(R - R \cdot \frac{\phi_1}{\phi_2}\right) \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 1.3e152Initial program 61.5%
Taylor expanded in phi1 around -inf
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
fp-cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6428.1
Applied rewrites28.1%
if 1.3e152 < phi2 Initial program 54.3%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
fp-cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6486.7
Applied rewrites86.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -3.7e+108) (* R (- phi1)) (* (- R (* R (/ phi1 phi2))) phi2)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.7e+108) {
tmp = R * -phi1;
} else {
tmp = (R - (R * (phi1 / phi2))) * phi2;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-3.7d+108)) then
tmp = r * -phi1
else
tmp = (r - (r * (phi1 / phi2))) * phi2
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.7e+108) {
tmp = R * -phi1;
} else {
tmp = (R - (R * (phi1 / phi2))) * phi2;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -3.7e+108: tmp = R * -phi1 else: tmp = (R - (R * (phi1 / phi2))) * phi2 return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -3.7e+108) tmp = Float64(R * Float64(-phi1)); else tmp = Float64(Float64(R - Float64(R * Float64(phi1 / phi2))) * phi2); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -3.7e+108)
tmp = R * -phi1;
else
tmp = (R - (R * (phi1 / phi2))) * phi2;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -3.7e+108], N[(R * (-phi1)), $MachinePrecision], N[(N[(R - N[(R * N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * phi2), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -3.7 \cdot 10^{+108}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(R - R \cdot \frac{\phi_1}{\phi_2}\right) \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -3.6999999999999998e108Initial program 54.2%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6482.1
Applied rewrites82.1%
if -3.6999999999999998e108 < phi1 Initial program 62.5%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
fp-cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6417.7
Applied rewrites17.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -3.1e+55) (* R (- phi1)) (* R phi2)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.1e+55) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-3.1d+55)) then
tmp = r * -phi1
else
tmp = r * phi2
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.1e+55) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -3.1e+55: tmp = R * -phi1 else: tmp = R * phi2 return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -3.1e+55) tmp = Float64(R * Float64(-phi1)); else tmp = Float64(R * phi2); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -3.1e+55)
tmp = R * -phi1;
else
tmp = R * phi2;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -3.1e+55], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -3.1 \cdot 10^{+55}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -3.09999999999999994e55Initial program 53.8%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6469.3
Applied rewrites69.3%
if -3.09999999999999994e55 < phi1 Initial program 63.1%
Taylor expanded in phi2 around inf
lower-*.f6415.5
Applied rewrites15.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R phi2))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * phi2
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * phi2
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * phi2) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * phi2;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * phi2), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \phi_2
\end{array}
Initial program 60.8%
Taylor expanded in phi2 around inf
lower-*.f6415.3
Applied rewrites15.3%
herbie shell --seed 2024340
(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))))))