
(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}
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.5e+35)
(*
R
(hypot
(- phi1 phi2)
(fma
(cos (* -0.5 phi1))
(- lambda1 lambda2)
(* (* 0.5 phi2) (* (sin (* -0.5 phi1)) (- lambda1 lambda2))))))
(* 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 <= 3.5e+35) {
tmp = R * hypot((phi1 - phi2), fma(cos((-0.5 * phi1)), (lambda1 - lambda2), ((0.5 * phi2) * (sin((-0.5 * phi1)) * (lambda1 - lambda2)))));
} else {
tmp = R * hypot((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 <= 3.5e+35) tmp = Float64(R * hypot(Float64(phi1 - phi2), fma(cos(Float64(-0.5 * phi1)), Float64(lambda1 - lambda2), Float64(Float64(0.5 * phi2) * Float64(sin(Float64(-0.5 * phi1)) * Float64(lambda1 - lambda2)))))); else tmp = Float64(R * hypot(Float64(cos(Float64(0.5 * phi2)) * 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[phi2, 3.5e+35], N[(R * N[Sqrt[N[(phi1 - phi2), $MachinePrecision] ^ 2 + N[(N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision] + N[(N[(0.5 * phi2), $MachinePrecision] * N[(N[Sin[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 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 3.5 \cdot 10^{+35}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1 - \phi_2, \mathsf{fma}\left(\cos \left(-0.5 \cdot \phi_1\right), \lambda_1 - \lambda_2, \left(0.5 \cdot \phi_2\right) \cdot \left(\sin \left(-0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)\right)\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 < 3.5000000000000001e35Initial program 52.0%
lift-sqrt.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
pow-to-expN/A
exp-lft-sqrN/A
lower-hypot.f64N/A
Applied rewrites50.0%
Taylor expanded in phi2 around 0
+-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower--.f6489.7
Applied rewrites89.7%
if 3.5000000000000001e35 < phi2 Initial program 47.7%
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.4
Applied rewrites82.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 (if (<= phi1 -1700000000.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 <= -1700000000.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 <= -1700000000.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 <= -1700000000.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 <= -1700000000.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 <= -1700000000.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, -1700000000.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 -1700000000:\\
\;\;\;\;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 < -1.7e9Initial program 45.8%
Taylor expanded in phi2 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.4
Applied rewrites84.4%
if -1.7e9 < phi1 Initial program 52.7%
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--.f6477.5
Applied rewrites77.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 (if (<= phi2 5e-112) (* R (hypot (* (cos (* 0.5 phi1)) (- lambda1 lambda2)) phi1)) (* R (hypot (- phi1 phi2) (- lambda1 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 <= 5e-112) {
tmp = R * hypot((cos((0.5 * phi1)) * (lambda1 - lambda2)), phi1);
} else {
tmp = R * hypot((phi1 - phi2), (lambda1 - lambda2));
}
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 <= 5e-112) {
tmp = R * Math.hypot((Math.cos((0.5 * phi1)) * (lambda1 - lambda2)), phi1);
} else {
tmp = R * Math.hypot((phi1 - phi2), (lambda1 - lambda2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 5e-112: tmp = R * math.hypot((math.cos((0.5 * phi1)) * (lambda1 - lambda2)), phi1) else: tmp = R * math.hypot((phi1 - phi2), (lambda1 - 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 <= 5e-112) tmp = Float64(R * hypot(Float64(cos(Float64(0.5 * phi1)) * Float64(lambda1 - lambda2)), phi1)); else tmp = Float64(R * hypot(Float64(phi1 - phi2), Float64(lambda1 - lambda2))); 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 <= 5e-112)
tmp = R * hypot((cos((0.5 * phi1)) * (lambda1 - lambda2)), phi1);
else
tmp = R * hypot((phi1 - phi2), (lambda1 - lambda2));
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, 5e-112], 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[(phi1 - phi2), $MachinePrecision] ^ 2 + N[(lambda1 - lambda2), $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 5 \cdot 10^{-112}:\\
\;\;\;\;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(\phi_1 - \phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi2 < 5.00000000000000044e-112Initial program 52.9%
Taylor expanded in phi2 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--.f6480.8
Applied rewrites80.8%
if 5.00000000000000044e-112 < phi2 Initial program 46.9%
lift-sqrt.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
pow-to-expN/A
exp-lft-sqrN/A
lower-hypot.f64N/A
Applied rewrites43.1%
Taylor expanded in phi2 around 0
+-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower--.f6471.5
Applied rewrites71.5%
Taylor expanded in phi1 around 0
Applied rewrites81.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 (<= lambda1 -9e+250) (* R (hypot (* lambda1 (cos (* 0.5 phi1))) phi1)) (* R (hypot (- phi1 phi2) (- lambda1 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 (lambda1 <= -9e+250) {
tmp = R * hypot((lambda1 * cos((0.5 * phi1))), phi1);
} else {
tmp = R * hypot((phi1 - phi2), (lambda1 - lambda2));
}
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 (lambda1 <= -9e+250) {
tmp = R * Math.hypot((lambda1 * Math.cos((0.5 * phi1))), phi1);
} else {
tmp = R * Math.hypot((phi1 - phi2), (lambda1 - lambda2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -9e+250: tmp = R * math.hypot((lambda1 * math.cos((0.5 * phi1))), phi1) else: tmp = R * math.hypot((phi1 - phi2), (lambda1 - 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 (lambda1 <= -9e+250) tmp = Float64(R * hypot(Float64(lambda1 * cos(Float64(0.5 * phi1))), phi1)); else tmp = Float64(R * hypot(Float64(phi1 - phi2), Float64(lambda1 - lambda2))); 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 (lambda1 <= -9e+250)
tmp = R * hypot((lambda1 * cos((0.5 * phi1))), phi1);
else
tmp = R * hypot((phi1 - phi2), (lambda1 - lambda2));
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[lambda1, -9e+250], N[(R * N[Sqrt[N[(lambda1 * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(phi1 - phi2), $MachinePrecision] ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -9 \cdot 10^{+250}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1 - \phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if lambda1 < -8.99999999999999993e250Initial program 49.0%
Taylor expanded in phi2 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--.f6493.8
Applied rewrites93.8%
Taylor expanded in lambda2 around 0
Applied rewrites93.8%
if -8.99999999999999993e250 < lambda1 Initial program 51.0%
lift-sqrt.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
pow-to-expN/A
exp-lft-sqrN/A
lower-hypot.f64N/A
Applied rewrites48.9%
Taylor expanded in phi2 around 0
+-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower--.f6483.3
Applied rewrites83.3%
Taylor expanded in phi1 around 0
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 (<= phi1 -6.2e-17) (* R (hypot (- phi1 phi2) (- lambda2))) (* R (hypot (- phi2) (- lambda1 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 (phi1 <= -6.2e-17) {
tmp = R * hypot((phi1 - phi2), -lambda2);
} else {
tmp = R * hypot(-phi2, (lambda1 - lambda2));
}
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 <= -6.2e-17) {
tmp = R * Math.hypot((phi1 - phi2), -lambda2);
} else {
tmp = R * Math.hypot(-phi2, (lambda1 - lambda2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -6.2e-17: tmp = R * math.hypot((phi1 - phi2), -lambda2) else: tmp = R * math.hypot(-phi2, (lambda1 - 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 (phi1 <= -6.2e-17) tmp = Float64(R * hypot(Float64(phi1 - phi2), Float64(-lambda2))); else tmp = Float64(R * hypot(Float64(-phi2), Float64(lambda1 - lambda2))); 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 <= -6.2e-17)
tmp = R * hypot((phi1 - phi2), -lambda2);
else
tmp = R * hypot(-phi2, (lambda1 - lambda2));
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, -6.2e-17], N[(R * N[Sqrt[N[(phi1 - phi2), $MachinePrecision] ^ 2 + (-lambda2) ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[(-phi2) ^ 2 + N[(lambda1 - lambda2), $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_1 \leq -6.2 \cdot 10^{-17}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1 - \phi_2, -\lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(-\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -6.1999999999999997e-17Initial program 48.1%
lift-sqrt.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
pow-to-expN/A
exp-lft-sqrN/A
lower-hypot.f64N/A
Applied rewrites54.8%
Taylor expanded in phi2 around 0
+-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower--.f6487.1
Applied rewrites87.1%
Taylor expanded in phi1 around 0
Applied rewrites83.6%
Taylor expanded in lambda1 around 0
Applied rewrites80.6%
if -6.1999999999999997e-17 < phi1 Initial program 51.9%
lift-sqrt.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
pow-to-expN/A
exp-lft-sqrN/A
lower-hypot.f64N/A
Applied rewrites46.3%
Taylor expanded in phi2 around 0
+-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower--.f6482.5
Applied rewrites82.5%
Taylor expanded in phi1 around 0
Applied rewrites83.4%
Taylor expanded in phi1 around 0
mul-1-negN/A
lower-neg.f6469.6
Applied rewrites69.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 (<= phi1 -1.1e+51) (* R (* phi1 (+ -1.0 (/ phi2 phi1)))) (* R (hypot (- phi2) (- lambda1 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 (phi1 <= -1.1e+51) {
tmp = R * (phi1 * (-1.0 + (phi2 / phi1)));
} else {
tmp = R * hypot(-phi2, (lambda1 - lambda2));
}
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 <= -1.1e+51) {
tmp = R * (phi1 * (-1.0 + (phi2 / phi1)));
} else {
tmp = R * Math.hypot(-phi2, (lambda1 - lambda2));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.1e+51: tmp = R * (phi1 * (-1.0 + (phi2 / phi1))) else: tmp = R * math.hypot(-phi2, (lambda1 - 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 (phi1 <= -1.1e+51) tmp = Float64(R * Float64(phi1 * Float64(-1.0 + Float64(phi2 / phi1)))); else tmp = Float64(R * hypot(Float64(-phi2), Float64(lambda1 - lambda2))); 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 <= -1.1e+51)
tmp = R * (phi1 * (-1.0 + (phi2 / phi1)));
else
tmp = R * hypot(-phi2, (lambda1 - lambda2));
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, -1.1e+51], N[(R * N[(phi1 * N[(-1.0 + N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[(-phi2) ^ 2 + N[(lambda1 - lambda2), $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_1 \leq -1.1 \cdot 10^{+51}:\\
\;\;\;\;R \cdot \left(\phi_1 \cdot \left(-1 + \frac{\phi_2}{\phi_1}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(-\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -1.09999999999999996e51Initial program 41.9%
Taylor expanded in phi1 around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6474.8
Applied rewrites74.8%
if -1.09999999999999996e51 < phi1 Initial program 53.6%
lift-sqrt.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
pow-to-expN/A
exp-lft-sqrN/A
lower-hypot.f64N/A
Applied rewrites46.1%
Taylor expanded in phi2 around 0
+-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower--.f6482.8
Applied rewrites82.8%
Taylor expanded in phi1 around 0
Applied rewrites82.5%
Taylor expanded in phi1 around 0
mul-1-negN/A
lower-neg.f6468.9
Applied rewrites68.9%
Final simplification70.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 (* R (hypot (- phi1 phi2) (- lambda1 lambda2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((phi1 - phi2), (lambda1 - lambda2));
}
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 * Math.hypot((phi1 - phi2), (lambda1 - lambda2));
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((phi1 - phi2), (lambda1 - lambda2))
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(phi1 - phi2), Float64(lambda1 - lambda2))) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * hypot((phi1 - phi2), (lambda1 - lambda2));
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 * N[Sqrt[N[(phi1 - phi2), $MachinePrecision] ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \mathsf{hypot}\left(\phi_1 - \phi_2, \lambda_1 - \lambda_2\right)
\end{array}
Initial program 50.9%
lift-sqrt.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
pow-to-expN/A
exp-lft-sqrN/A
lower-hypot.f64N/A
Applied rewrites48.6%
Taylor expanded in phi2 around 0
+-commutativeN/A
lower-fma.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-*.f64N/A
lower--.f6483.7
Applied rewrites83.7%
Taylor expanded in phi1 around 0
Applied rewrites83.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
(if (<= phi2 1.85e-250)
(* (- phi1) (- R (* R (/ phi2 phi1))))
(if (<= phi2 1.75e-153)
(*
R
(fma
(* phi1 phi1)
(fma 0.0026041666666666665 (* lambda2 (* phi1 phi1)) (* -0.125 lambda2))
lambda2))
(if (<= phi2 1e+16)
(* (- phi1) (- R (/ (* R phi2) phi1)))
(* R (* (- 1.0 (/ 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.85e-250) {
tmp = -phi1 * (R - (R * (phi2 / phi1)));
} else if (phi2 <= 1.75e-153) {
tmp = R * fma((phi1 * phi1), fma(0.0026041666666666665, (lambda2 * (phi1 * phi1)), (-0.125 * lambda2)), lambda2);
} else if (phi2 <= 1e+16) {
tmp = -phi1 * (R - ((R * phi2) / phi1));
} else {
tmp = R * ((1.0 - (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.85e-250) tmp = Float64(Float64(-phi1) * Float64(R - Float64(R * Float64(phi2 / phi1)))); elseif (phi2 <= 1.75e-153) tmp = Float64(R * fma(Float64(phi1 * phi1), fma(0.0026041666666666665, Float64(lambda2 * Float64(phi1 * phi1)), Float64(-0.125 * lambda2)), lambda2)); elseif (phi2 <= 1e+16) tmp = Float64(Float64(-phi1) * Float64(R - Float64(Float64(R * phi2) / phi1))); else tmp = Float64(R * Float64(Float64(1.0 - Float64(phi1 / phi2)) * 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, 1.85e-250], N[((-phi1) * N[(R - N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.75e-153], N[(R * N[(N[(phi1 * phi1), $MachinePrecision] * N[(0.0026041666666666665 * N[(lambda2 * N[(phi1 * phi1), $MachinePrecision]), $MachinePrecision] + N[(-0.125 * lambda2), $MachinePrecision]), $MachinePrecision] + lambda2), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1e+16], N[((-phi1) * N[(R - N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[(N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision] * phi2), $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.85 \cdot 10^{-250}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \left(R - R \cdot \frac{\phi_2}{\phi_1}\right)\\
\mathbf{elif}\;\phi_2 \leq 1.75 \cdot 10^{-153}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\phi_1 \cdot \phi_1, \mathsf{fma}\left(0.0026041666666666665, \lambda_2 \cdot \left(\phi_1 \cdot \phi_1\right), -0.125 \cdot \lambda_2\right), \lambda_2\right)\\
\mathbf{elif}\;\phi_2 \leq 10^{+16}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \left(R - \frac{R \cdot \phi_2}{\phi_1}\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\left(1 - \frac{\phi_1}{\phi_2}\right) \cdot \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.8499999999999999e-250Initial program 54.0%
Taylor expanded in phi1 around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6421.2
Applied rewrites21.2%
if 1.8499999999999999e-250 < phi2 < 1.7499999999999999e-153Initial program 47.0%
Taylor expanded in phi2 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--.f6499.8
Applied rewrites99.8%
Taylor expanded in lambda2 around inf
Applied rewrites29.4%
Taylor expanded in phi1 around 0
Applied rewrites29.6%
if 1.7499999999999999e-153 < phi2 < 1e16Initial program 44.4%
Taylor expanded in phi2 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--.f6492.8
Applied rewrites92.8%
Taylor expanded in phi1 around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
lower-*.f6441.0
Applied rewrites41.0%
if 1e16 < phi2 Initial program 48.6%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6465.7
Applied rewrites65.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 1.7e-248)
(* (- phi1) (- R (* R (/ phi2 phi1))))
(if (<= phi2 1.7e-153)
(* R (fma (* -0.125 lambda2) (* phi1 phi1) lambda2))
(if (<= phi2 33000000000000.0)
(* (- phi1) (- R (/ (* R phi2) phi1)))
(* (fma R (/ (- phi1) 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 (phi2 <= 1.7e-248) {
tmp = -phi1 * (R - (R * (phi2 / phi1)));
} else if (phi2 <= 1.7e-153) {
tmp = R * fma((-0.125 * lambda2), (phi1 * phi1), lambda2);
} else if (phi2 <= 33000000000000.0) {
tmp = -phi1 * (R - ((R * phi2) / phi1));
} else {
tmp = fma(R, (-phi1 / 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 (phi2 <= 1.7e-248) tmp = Float64(Float64(-phi1) * Float64(R - Float64(R * Float64(phi2 / phi1)))); elseif (phi2 <= 1.7e-153) tmp = Float64(R * fma(Float64(-0.125 * lambda2), Float64(phi1 * phi1), lambda2)); elseif (phi2 <= 33000000000000.0) tmp = Float64(Float64(-phi1) * Float64(R - Float64(Float64(R * phi2) / phi1))); else tmp = Float64(fma(R, Float64(Float64(-phi1) / 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[phi2, 1.7e-248], N[((-phi1) * N[(R - N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.7e-153], N[(R * N[(N[(-0.125 * lambda2), $MachinePrecision] * N[(phi1 * phi1), $MachinePrecision] + lambda2), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 33000000000000.0], N[((-phi1) * N[(R - N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(R * N[((-phi1) / 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}\;\phi_2 \leq 1.7 \cdot 10^{-248}:\\
\;\;\;\;\left(-\phi_1\right) \cdot \left(R - R \cdot \frac{\phi_2}{\phi_1}\right)\\
\mathbf{elif}\;\phi_2 \leq 1.7 \cdot 10^{-153}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(-0.125 \cdot \lambda_2, \phi_1 \cdot \phi_1, \lambda_2\right)\\
\mathbf{elif}\;\phi_2 \leq 33000000000000:\\
\;\;\;\;\left(-\phi_1\right) \cdot \left(R - \frac{R \cdot \phi_2}{\phi_1}\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(R, \frac{-\phi_1}{\phi_2}, R\right) \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 1.6999999999999999e-248Initial program 54.0%
Taylor expanded in phi1 around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6421.2
Applied rewrites21.2%
if 1.6999999999999999e-248 < phi2 < 1.6999999999999999e-153Initial program 47.0%
Taylor expanded in phi2 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--.f6499.8
Applied rewrites99.8%
Taylor expanded in lambda2 around inf
Applied rewrites29.4%
Taylor expanded in phi1 around 0
Applied rewrites33.5%
if 1.6999999999999999e-153 < phi2 < 3.3e13Initial program 44.4%
Taylor expanded in phi2 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--.f6492.8
Applied rewrites92.8%
Taylor expanded in phi1 around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
lower-*.f6441.0
Applied rewrites41.0%
if 3.3e13 < phi2 Initial program 48.6%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6465.7
Applied rewrites65.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
(let* ((t_0 (* (- phi1) (- R (* R (/ phi2 phi1))))))
(if (<= phi2 1.7e-248)
t_0
(if (<= phi2 1.7e-153)
(* R (fma (* -0.125 lambda2) (* phi1 phi1) lambda2))
(if (<= phi2 2e+24) t_0 (* R (* (- 1.0 (/ 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 t_0 = -phi1 * (R - (R * (phi2 / phi1)));
double tmp;
if (phi2 <= 1.7e-248) {
tmp = t_0;
} else if (phi2 <= 1.7e-153) {
tmp = R * fma((-0.125 * lambda2), (phi1 * phi1), lambda2);
} else if (phi2 <= 2e+24) {
tmp = t_0;
} else {
tmp = R * ((1.0 - (phi1 / phi2)) * phi2);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(-phi1) * Float64(R - Float64(R * Float64(phi2 / phi1)))) tmp = 0.0 if (phi2 <= 1.7e-248) tmp = t_0; elseif (phi2 <= 1.7e-153) tmp = Float64(R * fma(Float64(-0.125 * lambda2), Float64(phi1 * phi1), lambda2)); elseif (phi2 <= 2e+24) tmp = t_0; else tmp = Float64(R * Float64(Float64(1.0 - Float64(phi1 / phi2)) * 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[((-phi1) * N[(R - N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 1.7e-248], t$95$0, If[LessEqual[phi2, 1.7e-153], N[(R * N[(N[(-0.125 * lambda2), $MachinePrecision] * N[(phi1 * phi1), $MachinePrecision] + lambda2), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2e+24], t$95$0, N[(R * N[(N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \left(-\phi_1\right) \cdot \left(R - R \cdot \frac{\phi_2}{\phi_1}\right)\\
\mathbf{if}\;\phi_2 \leq 1.7 \cdot 10^{-248}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 1.7 \cdot 10^{-153}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(-0.125 \cdot \lambda_2, \phi_1 \cdot \phi_1, \lambda_2\right)\\
\mathbf{elif}\;\phi_2 \leq 2 \cdot 10^{+24}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\left(1 - \frac{\phi_1}{\phi_2}\right) \cdot \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.6999999999999999e-248 or 1.6999999999999999e-153 < phi2 < 2e24Initial program 52.4%
Taylor expanded in phi1 around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6424.1
Applied rewrites24.1%
if 1.6999999999999999e-248 < phi2 < 1.6999999999999999e-153Initial program 47.0%
Taylor expanded in phi2 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--.f6499.8
Applied rewrites99.8%
Taylor expanded in lambda2 around inf
Applied rewrites29.4%
Taylor expanded in phi1 around 0
Applied rewrites33.5%
if 2e24 < phi2 Initial program 48.6%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f6467.6
Applied rewrites67.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
(let* ((t_0 (* R (- phi1))))
(if (<= phi2 1.7e-248)
t_0
(if (<= phi2 2.2e-144)
(* R (fma (* -0.125 lambda2) (* phi1 phi1) lambda2))
(if (<= phi2 1.45e-45) t_0 (* (fma R (/ (- phi1) 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 t_0 = R * -phi1;
double tmp;
if (phi2 <= 1.7e-248) {
tmp = t_0;
} else if (phi2 <= 2.2e-144) {
tmp = R * fma((-0.125 * lambda2), (phi1 * phi1), lambda2);
} else if (phi2 <= 1.45e-45) {
tmp = t_0;
} else {
tmp = fma(R, (-phi1 / phi2), R) * phi2;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * Float64(-phi1)) tmp = 0.0 if (phi2 <= 1.7e-248) tmp = t_0; elseif (phi2 <= 2.2e-144) tmp = Float64(R * fma(Float64(-0.125 * lambda2), Float64(phi1 * phi1), lambda2)); elseif (phi2 <= 1.45e-45) tmp = t_0; else tmp = Float64(fma(R, Float64(Float64(-phi1) / 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_] := Block[{t$95$0 = N[(R * (-phi1)), $MachinePrecision]}, If[LessEqual[phi2, 1.7e-248], t$95$0, If[LessEqual[phi2, 2.2e-144], N[(R * N[(N[(-0.125 * lambda2), $MachinePrecision] * N[(phi1 * phi1), $MachinePrecision] + lambda2), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.45e-45], t$95$0, N[(N[(R * N[((-phi1) / phi2), $MachinePrecision] + R), $MachinePrecision] * phi2), $MachinePrecision]]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := R \cdot \left(-\phi_1\right)\\
\mathbf{if}\;\phi_2 \leq 1.7 \cdot 10^{-248}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 2.2 \cdot 10^{-144}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(-0.125 \cdot \lambda_2, \phi_1 \cdot \phi_1, \lambda_2\right)\\
\mathbf{elif}\;\phi_2 \leq 1.45 \cdot 10^{-45}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(R, \frac{-\phi_1}{\phi_2}, R\right) \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 1.6999999999999999e-248 or 2.20000000000000006e-144 < phi2 < 1.45e-45Initial program 54.5%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6426.1
Applied rewrites26.1%
if 1.6999999999999999e-248 < phi2 < 2.20000000000000006e-144Initial program 47.3%
Taylor expanded in phi2 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--.f6499.8
Applied rewrites99.8%
Taylor expanded in lambda2 around inf
Applied rewrites27.2%
Taylor expanded in phi1 around 0
Applied rewrites31.0%
if 1.45e-45 < phi2 Initial program 45.1%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6462.4
Applied rewrites62.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 (if (<= phi1 -1.7e+18) (* 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 <= -1.7e+18) {
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 <= (-1.7d+18)) 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 <= -1.7e+18) {
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 <= -1.7e+18: 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 <= -1.7e+18) 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 <= -1.7e+18)
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, -1.7e+18], 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 -1.7 \cdot 10^{+18}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -1.7e18Initial program 45.5%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6469.6
Applied rewrites69.6%
if -1.7e18 < phi1 Initial program 52.7%
Taylor expanded in phi2 around inf
lower-*.f6421.6
Applied rewrites21.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 (* 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 50.9%
Taylor expanded in phi2 around inf
lower-*.f6420.3
Applied rewrites20.3%
herbie shell --seed 2024313
(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))))))