
(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 12 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 (if (<= phi2 0.042) (* 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 (phi2 <= 0.042) {
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 (phi2 <= 0.042) {
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 phi2 <= 0.042: 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 (phi2 <= 0.042) 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 (phi2 <= 0.042)
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[phi2, 0.042], 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_2 \leq 0.042:\\
\;\;\;\;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 phi2 < 0.0420000000000000026Initial program 63.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--.f6479.4
Applied rewrites79.4%
if 0.0420000000000000026 < phi2 Initial program 49.6%
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--.f6478.7
Applied rewrites78.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 0.95) (* R (hypot (* (cos (* -0.5 phi1)) (- lambda1 lambda2)) phi1)) (* R (hypot (* lambda1 (cos (* -0.5 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 <= 0.95) {
tmp = R * hypot((cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
} else {
tmp = R * hypot((lambda1 * cos((-0.5 * phi2))), 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 <= 0.95) {
tmp = R * Math.hypot((Math.cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
} else {
tmp = R * Math.hypot((lambda1 * Math.cos((-0.5 * 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 <= 0.95: tmp = R * math.hypot((math.cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1) else: tmp = R * math.hypot((lambda1 * math.cos((-0.5 * 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 <= 0.95) tmp = Float64(R * hypot(Float64(cos(Float64(-0.5 * phi1)) * Float64(lambda1 - lambda2)), phi1)); else tmp = Float64(R * hypot(Float64(lambda1 * cos(Float64(-0.5 * 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 <= 0.95)
tmp = R * hypot((cos((-0.5 * phi1)) * (lambda1 - lambda2)), phi1);
else
tmp = R * hypot((lambda1 * cos((-0.5 * 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, 0.95], 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[(lambda1 * N[Cos[N[(-0.5 * phi2), $MachinePrecision]], $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_2 \leq 0.95:\\
\;\;\;\;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(\lambda_1 \cdot \cos \left(-0.5 \cdot \phi_2\right), \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 0.94999999999999996Initial program 63.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--.f6479.4
Applied rewrites79.4%
if 0.94999999999999996 < phi2 Initial program 49.6%
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--.f6478.7
Applied rewrites78.7%
Taylor expanded in lambda2 around 0
Applied rewrites68.1%
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 -3e+193)
(* R (hypot (* lambda1 (cos (* -0.5 phi1))) phi1))
(if (<= phi1 -56000000000000.0)
(* phi2 (fma -1.0 (/ (* R phi1) phi2) R))
(* R (hypot (- 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 <= -3e+193) {
tmp = R * hypot((lambda1 * cos((-0.5 * phi1))), phi1);
} else if (phi1 <= -56000000000000.0) {
tmp = phi2 * fma(-1.0, ((R * phi1) / phi2), R);
} else {
tmp = R * hypot((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 <= -3e+193) tmp = Float64(R * hypot(Float64(lambda1 * cos(Float64(-0.5 * phi1))), phi1)); elseif (phi1 <= -56000000000000.0) tmp = Float64(phi2 * fma(-1.0, Float64(Float64(R * phi1) / phi2), R)); else tmp = Float64(R * hypot(Float64(lambda1 - lambda2), 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[phi1, -3e+193], N[(R * N[Sqrt[N[(lambda1 * N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -56000000000000.0], N[(phi2 * N[(-1.0 * N[(N[(R * phi1), $MachinePrecision] / phi2), $MachinePrecision] + R), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda1 - 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_1 \leq -3 \cdot 10^{+193}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \cos \left(-0.5 \cdot \phi_1\right), \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -56000000000000:\\
\;\;\;\;\phi_2 \cdot \mathsf{fma}\left(-1, \frac{R \cdot \phi_1}{\phi_2}, R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -3e193Initial program 44.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--.f6494.9
Applied rewrites94.9%
Taylor expanded in lambda2 around 0
Applied rewrites90.7%
if -3e193 < phi1 < -5.6e13Initial program 71.6%
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--.f6454.5
Applied rewrites54.5%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6458.2
Applied rewrites58.2%
if -5.6e13 < phi1 Initial program 59.1%
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--.f6477.0
Applied rewrites77.0%
Applied rewrites38.6%
Taylor expanded in phi2 around 0
Applied rewrites71.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 -56000000000000.0) (* (- phi2 phi1) R) (* R (hypot (- 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 <= -56000000000000.0) {
tmp = (phi2 - phi1) * R;
} else {
tmp = R * hypot((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 <= -56000000000000.0) {
tmp = (phi2 - phi1) * R;
} else {
tmp = R * Math.hypot((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 <= -56000000000000.0: tmp = (phi2 - phi1) * R else: tmp = R * math.hypot((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 <= -56000000000000.0) tmp = Float64(Float64(phi2 - phi1) * R); else tmp = Float64(R * hypot(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 <= -56000000000000.0)
tmp = (phi2 - phi1) * R;
else
tmp = R * hypot((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, -56000000000000.0], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision], N[(R * N[Sqrt[N[(lambda1 - 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_1 \leq -56000000000000:\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -5.6e13Initial program 62.2%
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--.f6453.0
Applied rewrites53.0%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6463.3
Applied rewrites63.3%
Taylor expanded in phi1 around 0
Applied rewrites42.5%
Taylor expanded in R around 0
Applied rewrites56.8%
if -5.6e13 < phi1 Initial program 59.1%
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--.f6477.0
Applied rewrites77.0%
Applied rewrites38.6%
Taylor expanded in phi2 around 0
Applied rewrites71.3%
Final simplification68.6%
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 (<= lambda2 6.2e+136)
(* phi2 (/ (* (- phi2 phi1) R) phi2))
(*
R
(fma
(* phi2 phi2)
(fma 0.0026041666666666665 (* lambda2 (* phi2 phi2)) (* -0.125 lambda2))
lambda2))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 6.2e+136) {
tmp = phi2 * (((phi2 - phi1) * R) / phi2);
} else {
tmp = R * fma((phi2 * phi2), fma(0.0026041666666666665, (lambda2 * (phi2 * phi2)), (-0.125 * lambda2)), lambda2);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 6.2e+136) tmp = Float64(phi2 * Float64(Float64(Float64(phi2 - phi1) * R) / phi2)); else tmp = Float64(R * fma(Float64(phi2 * phi2), fma(0.0026041666666666665, Float64(lambda2 * Float64(phi2 * phi2)), Float64(-0.125 * lambda2)), lambda2)); 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[lambda2, 6.2e+136], N[(phi2 * N[(N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision], N[(R * N[(N[(phi2 * phi2), $MachinePrecision] * N[(0.0026041666666666665 * N[(lambda2 * N[(phi2 * phi2), $MachinePrecision]), $MachinePrecision] + N[(-0.125 * lambda2), $MachinePrecision]), $MachinePrecision] + lambda2), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 6.2 \cdot 10^{+136}:\\
\;\;\;\;\phi_2 \cdot \frac{\left(\phi_2 - \phi_1\right) \cdot R}{\phi_2}\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\phi_2 \cdot \phi_2, \mathsf{fma}\left(0.0026041666666666665, \lambda_2 \cdot \left(\phi_2 \cdot \phi_2\right), -0.125 \cdot \lambda_2\right), \lambda_2\right)\\
\end{array}
\end{array}
if lambda2 < 6.19999999999999967e136Initial program 61.8%
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--.f6468.9
Applied rewrites68.9%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6430.4
Applied rewrites30.4%
Applied rewrites31.7%
Taylor expanded in phi2 around 0
Applied rewrites30.8%
if 6.19999999999999967e136 < lambda2 Initial program 48.2%
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--.f6491.5
Applied rewrites91.5%
Taylor expanded in lambda2 around inf
Applied rewrites57.1%
Taylor expanded in phi2 around 0
Applied rewrites53.4%
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 (* (- phi2 phi1) R)))
(if (<= phi2 1.45e-254)
t_0
(if (<= phi2 5.8e-86)
(* R (fma (* -0.125 lambda2) (* phi2 phi2) lambda2))
(if (<= phi2 5e+72) (* phi1 (fma R (/ phi2 phi1) (- R))) t_0)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (phi2 - phi1) * R;
double tmp;
if (phi2 <= 1.45e-254) {
tmp = t_0;
} else if (phi2 <= 5.8e-86) {
tmp = R * fma((-0.125 * lambda2), (phi2 * phi2), lambda2);
} else if (phi2 <= 5e+72) {
tmp = phi1 * fma(R, (phi2 / phi1), -R);
} else {
tmp = t_0;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(phi2 - phi1) * R) tmp = 0.0 if (phi2 <= 1.45e-254) tmp = t_0; elseif (phi2 <= 5.8e-86) tmp = Float64(R * fma(Float64(-0.125 * lambda2), Float64(phi2 * phi2), lambda2)); elseif (phi2 <= 5e+72) tmp = Float64(phi1 * fma(R, Float64(phi2 / phi1), Float64(-R))); else tmp = t_0; 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[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision]}, If[LessEqual[phi2, 1.45e-254], t$95$0, If[LessEqual[phi2, 5.8e-86], N[(R * N[(N[(-0.125 * lambda2), $MachinePrecision] * N[(phi2 * phi2), $MachinePrecision] + lambda2), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 5e+72], N[(phi1 * N[(R * N[(phi2 / phi1), $MachinePrecision] + (-R)), $MachinePrecision]), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \left(\phi_2 - \phi_1\right) \cdot R\\
\mathbf{if}\;\phi_2 \leq 1.45 \cdot 10^{-254}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 5.8 \cdot 10^{-86}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(-0.125 \cdot \lambda_2, \phi_2 \cdot \phi_2, \lambda_2\right)\\
\mathbf{elif}\;\phi_2 \leq 5 \cdot 10^{+72}:\\
\;\;\;\;\phi_1 \cdot \mathsf{fma}\left(R, \frac{\phi_2}{\phi_1}, -R\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi2 < 1.45e-254 or 4.99999999999999992e72 < phi2 Initial program 57.1%
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--.f6475.3
Applied rewrites75.3%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6435.2
Applied rewrites35.2%
Taylor expanded in phi1 around 0
Applied rewrites29.5%
Taylor expanded in R around 0
Applied rewrites33.1%
if 1.45e-254 < phi2 < 5.7999999999999998e-86Initial program 77.4%
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--.f6471.1
Applied rewrites71.1%
Taylor expanded in lambda2 around inf
Applied rewrites39.0%
Taylor expanded in phi2 around 0
Applied rewrites39.0%
if 5.7999999999999998e-86 < phi2 < 4.99999999999999992e72Initial program 59.0%
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--.f6455.1
Applied rewrites55.1%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6423.2
Applied rewrites23.2%
Taylor expanded in phi1 around inf
Applied rewrites35.5%
Final simplification34.1%
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 (or (<= phi2 1.45e-254) (not (<= phi2 5.8e-86))) (* (- phi2 phi1) R) (* R (fma (* -0.125 lambda2) (* phi2 phi2) lambda2))))
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.45e-254) || !(phi2 <= 5.8e-86)) {
tmp = (phi2 - phi1) * R;
} else {
tmp = R * fma((-0.125 * lambda2), (phi2 * phi2), lambda2);
}
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.45e-254) || !(phi2 <= 5.8e-86)) tmp = Float64(Float64(phi2 - phi1) * R); else tmp = Float64(R * fma(Float64(-0.125 * lambda2), Float64(phi2 * phi2), lambda2)); 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[Or[LessEqual[phi2, 1.45e-254], N[Not[LessEqual[phi2, 5.8e-86]], $MachinePrecision]], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision], N[(R * N[(N[(-0.125 * lambda2), $MachinePrecision] * N[(phi2 * phi2), $MachinePrecision] + lambda2), $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.45 \cdot 10^{-254} \lor \neg \left(\phi_2 \leq 5.8 \cdot 10^{-86}\right):\\
\;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(-0.125 \cdot \lambda_2, \phi_2 \cdot \phi_2, \lambda_2\right)\\
\end{array}
\end{array}
if phi2 < 1.45e-254 or 5.7999999999999998e-86 < phi2 Initial program 57.4%
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--.f6472.6
Applied rewrites72.6%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6433.6
Applied rewrites33.6%
Taylor expanded in phi1 around 0
Applied rewrites28.7%
Taylor expanded in R around 0
Applied rewrites31.8%
if 1.45e-254 < phi2 < 5.7999999999999998e-86Initial program 77.4%
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--.f6471.1
Applied rewrites71.1%
Taylor expanded in lambda2 around inf
Applied rewrites39.0%
Taylor expanded in phi2 around 0
Applied rewrites39.0%
Final simplification32.6%
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 (<= R 3.7e+88) (fma (- R) phi1 (* R phi2)) (* (fma (- phi1) (/ R phi2) 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 (R <= 3.7e+88) {
tmp = fma(-R, phi1, (R * phi2));
} else {
tmp = fma(-phi1, (R / phi2), 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 (R <= 3.7e+88) tmp = fma(Float64(-R), phi1, Float64(R * phi2)); else tmp = Float64(fma(Float64(-phi1), Float64(R / phi2), R) * 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[R, 3.7e+88], N[((-R) * phi1 + N[(R * phi2), $MachinePrecision]), $MachinePrecision], N[(N[((-phi1) * N[(R / phi2), $MachinePrecision] + R), $MachinePrecision] * phi2), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;R \leq 3.7 \cdot 10^{+88}:\\
\;\;\;\;\mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-\phi_1, \frac{R}{\phi_2}, R\right) \cdot \phi_2\\
\end{array}
\end{array}
if R < 3.69999999999999994e88Initial program 51.0%
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--.f6470.3
Applied rewrites70.3%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6429.4
Applied rewrites29.4%
Taylor expanded in phi1 around 0
Applied rewrites25.5%
if 3.69999999999999994e88 < R Initial program 96.5%
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--.f6481.3
Applied rewrites81.3%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6439.5
Applied rewrites39.5%
Applied rewrites49.4%
Applied rewrites49.4%
Final simplification30.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 (<= R 2.1e+111) (fma (- R) phi1 (* R phi2)) (* phi2 (/ (* (- phi2 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 (R <= 2.1e+111) {
tmp = fma(-R, phi1, (R * phi2));
} else {
tmp = phi2 * (((phi2 - phi1) * 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 (R <= 2.1e+111) tmp = fma(Float64(-R), phi1, Float64(R * phi2)); else tmp = Float64(phi2 * Float64(Float64(Float64(phi2 - phi1) * R) / 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[R, 2.1e+111], N[((-R) * phi1 + N[(R * phi2), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;R \leq 2.1 \cdot 10^{+111}:\\
\;\;\;\;\mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \frac{\left(\phi_2 - \phi_1\right) \cdot R}{\phi_2}\\
\end{array}
\end{array}
if R < 2.09999999999999995e111Initial program 51.5%
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--.f6470.4
Applied rewrites70.4%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6428.9
Applied rewrites28.9%
Taylor expanded in phi1 around 0
Applied rewrites25.0%
if 2.09999999999999995e111 < R Initial program 98.2%
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--.f6481.7
Applied rewrites81.7%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6442.9
Applied rewrites42.9%
Applied rewrites53.6%
Taylor expanded in phi2 around 0
Applied rewrites47.4%
Final simplification28.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 (<= phi2 3.6e+15) (* 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 (phi2 <= 3.6e+15) {
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 (phi2 <= 3.6d+15) 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 (phi2 <= 3.6e+15) {
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 phi2 <= 3.6e+15: 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 (phi2 <= 3.6e+15) 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 (phi2 <= 3.6e+15)
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[phi2, 3.6e+15], 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_2 \leq 3.6 \cdot 10^{+15}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 3.6e15Initial program 64.3%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6416.3
Applied rewrites16.3%
if 3.6e15 < phi2 Initial program 47.5%
Taylor expanded in phi2 around inf
lower-*.f6461.5
Applied rewrites61.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 (* (- phi2 phi1) R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return (phi2 - phi1) * R;
}
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 = (phi2 - phi1) * r
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 (phi2 - phi1) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return (phi2 - phi1) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(Float64(phi2 - phi1) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = (phi2 - phi1) * R;
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[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\left(\phi_2 - \phi_1\right) \cdot R
\end{array}
Initial program 59.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--.f6472.4
Applied rewrites72.4%
Taylor expanded in phi2 around inf
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6431.3
Applied rewrites31.3%
Taylor expanded in phi1 around 0
Applied rewrites26.7%
Taylor expanded in R around 0
Applied rewrites29.4%
Final simplification29.4%
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 59.7%
Taylor expanded in phi2 around inf
lower-*.f6419.9
Applied rewrites19.9%
herbie shell --seed 2024326
(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))))))