
(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 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(fma
(cos (* phi1 0.5))
(cos (* 0.5 phi2))
(* (sin (* phi1 0.5)) (- (sin (* 0.5 phi2))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * fma(cos((phi1 * 0.5)), cos((0.5 * phi2)), (sin((phi1 * 0.5)) * -sin((0.5 * phi2))))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * fma(cos(Float64(phi1 * 0.5)), cos(Float64(0.5 * phi2)), Float64(sin(Float64(phi1 * 0.5)) * Float64(-sin(Float64(0.5 * phi2)))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * (-N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{fma}\left(\cos \left(\phi_1 \cdot 0.5\right), \cos \left(0.5 \cdot \phi_2\right), \sin \left(\phi_1 \cdot 0.5\right) \cdot \left(-\sin \left(0.5 \cdot \phi_2\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 59.6%
hypot-define95.9%
Simplified95.9%
add-cube-cbrt95.7%
pow395.8%
div-inv95.8%
metadata-eval95.8%
Applied egg-rr95.8%
*-commutative95.8%
distribute-rgt-in95.8%
*-commutative95.8%
cos-sum99.7%
*-commutative99.7%
*-commutative99.7%
Applied egg-rr99.7%
rem-cube-cbrt99.9%
cancel-sign-sub-inv99.9%
fma-define99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(-
(* (cos (* 0.5 phi2)) (cos (* phi1 0.5)))
(* (sin (* phi1 0.5)) (sin (* 0.5 phi2)))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * ((cos((0.5 * phi2)) * cos((phi1 * 0.5))) - (sin((phi1 * 0.5)) * sin((0.5 * phi2))))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * ((Math.cos((0.5 * phi2)) * Math.cos((phi1 * 0.5))) - (Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * ((math.cos((0.5 * phi2)) * math.cos((phi1 * 0.5))) - (math.sin((phi1 * 0.5)) * math.sin((0.5 * phi2))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * Float64(Float64(cos(Float64(0.5 * phi2)) * cos(Float64(phi1 * 0.5))) - Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2))))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * ((cos((0.5 * phi2)) * cos((phi1 * 0.5))) - (sin((phi1 * 0.5)) * sin((0.5 * phi2))))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right) - \sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 59.6%
hypot-define95.9%
Simplified95.9%
add-cube-cbrt95.7%
pow395.8%
div-inv95.8%
metadata-eval95.8%
Applied egg-rr95.8%
*-commutative95.8%
distribute-rgt-in95.8%
*-commutative95.8%
cos-sum99.7%
*-commutative99.7%
*-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in lambda1 around 0 99.9%
+-commutative99.9%
mul-1-neg99.9%
distribute-lft-neg-in99.9%
distribute-rgt-in99.9%
*-commutative99.9%
*-commutative99.9%
sub-neg99.9%
Simplified99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.32e-5) (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi2))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.32e-5) {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.32e-5) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.32e-5: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.32e-5) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi2))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.32e-5) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.32e-5], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.32 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.32000000000000007e-5Initial program 62.2%
hypot-define97.3%
Simplified97.3%
Taylor expanded in phi2 around 0 92.2%
if 1.32000000000000007e-5 < phi2 Initial program 51.6%
hypot-define91.6%
Simplified91.6%
Taylor expanded in phi1 around 0 91.7%
Final simplification92.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 5.2e-189) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* phi1 0.5))))) (* R (hypot (- lambda1 lambda2) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.2e-189) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5))));
} else {
tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5.2e-189) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((phi1 * 0.5))));
} else {
tmp = R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 5.2e-189: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((phi1 * 0.5)))) else: tmp = R * math.hypot((lambda1 - lambda2), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 5.2e-189) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))))); else tmp = Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 5.2e-189) tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5)))); else tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5.2e-189], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 5.2 \cdot 10^{-189}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 5.1999999999999998e-189Initial program 59.6%
hypot-define96.7%
Simplified96.7%
Taylor expanded in phi2 around 0 85.3%
associate-*r*85.3%
Simplified85.3%
Taylor expanded in phi2 around 0 51.5%
+-commutative51.5%
unpow251.5%
*-commutative51.5%
unpow251.5%
*-commutative51.5%
unpow251.5%
swap-sqr51.5%
hypot-define75.7%
*-commutative75.7%
*-commutative75.7%
Simplified75.7%
if 5.1999999999999998e-189 < phi2 Initial program 59.5%
hypot-define94.7%
Simplified94.7%
Taylor expanded in phi2 around 0 75.0%
associate-*r*75.0%
Simplified75.0%
Taylor expanded in phi1 around 0 84.4%
Final simplification79.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 59.6%
hypot-define95.9%
Simplified95.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 59.6%
hypot-define95.9%
Simplified95.9%
Taylor expanded in phi2 around 0 88.7%
Final simplification88.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.042) (* phi1 (- (/ (* R phi2) phi1) R)) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.042) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -0.042) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -0.042: tmp = phi1 * (((R * phi2) / phi1) - R) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -0.042) tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R)); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -0.042) tmp = phi1 * (((R * phi2) / phi1) - R); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -0.042], N[(phi1 * N[(N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -0.042:\\
\;\;\;\;\phi_1 \cdot \left(\frac{R \cdot \phi_2}{\phi_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -0.0420000000000000026Initial program 56.6%
hypot-define91.3%
Simplified91.3%
Taylor expanded in phi2 around inf 48.4%
associate-*r/48.4%
mul-1-neg48.4%
*-commutative48.4%
Simplified48.4%
Taylor expanded in phi1 around inf 56.2%
+-commutative56.2%
mul-1-neg56.2%
unsub-neg56.2%
*-commutative56.2%
Simplified56.2%
if -0.0420000000000000026 < phi1 Initial program 60.3%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi2 around 0 81.2%
associate-*r*81.2%
Simplified81.2%
Taylor expanded in phi1 around 0 48.4%
unpow248.4%
unpow248.4%
hypot-define70.3%
Simplified70.3%
Final simplification67.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (- lambda1 lambda2) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((lambda1 - lambda2), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot((lambda1 - lambda2), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((lambda1 - lambda2), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(lambda1 - lambda2), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot((lambda1 - lambda2), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1 - \phi_2\right)
\end{array}
Initial program 59.6%
hypot-define95.9%
Simplified95.9%
Taylor expanded in phi2 around 0 81.3%
associate-*r*81.3%
Simplified81.3%
Taylor expanded in phi1 around 0 84.7%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (+ (* phi2 -0.25) (* phi1 -0.125))))
(t_1 (- -1.0 t_0))
(t_2
(* lambda2 (+ (/ (* R (* lambda1 t_1)) lambda2) (* R (+ 1.0 t_0))))))
(if (<= phi1 -0.0115)
(* phi1 (- (/ (* R phi2) phi1) R))
(if (<= phi1 -1.25e-184)
t_2
(if (<= phi1 -1.15e-282)
(* lambda1 (- (* R t_1) (/ (* R (* lambda2 t_1)) lambda1)))
(if (<= phi1 4e-136) t_2 (* (* R phi2) (- 1.0 (/ phi1 phi2)))))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * ((phi2 * -0.25) + (phi1 * -0.125));
double t_1 = -1.0 - t_0;
double t_2 = lambda2 * (((R * (lambda1 * t_1)) / lambda2) + (R * (1.0 + t_0)));
double tmp;
if (phi1 <= -0.0115) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} else if (phi1 <= -1.25e-184) {
tmp = t_2;
} else if (phi1 <= -1.15e-282) {
tmp = lambda1 * ((R * t_1) - ((R * (lambda2 * t_1)) / lambda1));
} else if (phi1 <= 4e-136) {
tmp = t_2;
} else {
tmp = (R * phi2) * (1.0 - (phi1 / phi2));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = phi1 * ((phi2 * (-0.25d0)) + (phi1 * (-0.125d0)))
t_1 = (-1.0d0) - t_0
t_2 = lambda2 * (((r * (lambda1 * t_1)) / lambda2) + (r * (1.0d0 + t_0)))
if (phi1 <= (-0.0115d0)) then
tmp = phi1 * (((r * phi2) / phi1) - r)
else if (phi1 <= (-1.25d-184)) then
tmp = t_2
else if (phi1 <= (-1.15d-282)) then
tmp = lambda1 * ((r * t_1) - ((r * (lambda2 * t_1)) / lambda1))
else if (phi1 <= 4d-136) then
tmp = t_2
else
tmp = (r * phi2) * (1.0d0 - (phi1 / phi2))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * ((phi2 * -0.25) + (phi1 * -0.125));
double t_1 = -1.0 - t_0;
double t_2 = lambda2 * (((R * (lambda1 * t_1)) / lambda2) + (R * (1.0 + t_0)));
double tmp;
if (phi1 <= -0.0115) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} else if (phi1 <= -1.25e-184) {
tmp = t_2;
} else if (phi1 <= -1.15e-282) {
tmp = lambda1 * ((R * t_1) - ((R * (lambda2 * t_1)) / lambda1));
} else if (phi1 <= 4e-136) {
tmp = t_2;
} else {
tmp = (R * phi2) * (1.0 - (phi1 / phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * ((phi2 * -0.25) + (phi1 * -0.125)) t_1 = -1.0 - t_0 t_2 = lambda2 * (((R * (lambda1 * t_1)) / lambda2) + (R * (1.0 + t_0))) tmp = 0 if phi1 <= -0.0115: tmp = phi1 * (((R * phi2) / phi1) - R) elif phi1 <= -1.25e-184: tmp = t_2 elif phi1 <= -1.15e-282: tmp = lambda1 * ((R * t_1) - ((R * (lambda2 * t_1)) / lambda1)) elif phi1 <= 4e-136: tmp = t_2 else: tmp = (R * phi2) * (1.0 - (phi1 / phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * Float64(Float64(phi2 * -0.25) + Float64(phi1 * -0.125))) t_1 = Float64(-1.0 - t_0) t_2 = Float64(lambda2 * Float64(Float64(Float64(R * Float64(lambda1 * t_1)) / lambda2) + Float64(R * Float64(1.0 + t_0)))) tmp = 0.0 if (phi1 <= -0.0115) tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R)); elseif (phi1 <= -1.25e-184) tmp = t_2; elseif (phi1 <= -1.15e-282) tmp = Float64(lambda1 * Float64(Float64(R * t_1) - Float64(Float64(R * Float64(lambda2 * t_1)) / lambda1))); elseif (phi1 <= 4e-136) tmp = t_2; else tmp = Float64(Float64(R * phi2) * Float64(1.0 - Float64(phi1 / phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = phi1 * ((phi2 * -0.25) + (phi1 * -0.125)); t_1 = -1.0 - t_0; t_2 = lambda2 * (((R * (lambda1 * t_1)) / lambda2) + (R * (1.0 + t_0))); tmp = 0.0; if (phi1 <= -0.0115) tmp = phi1 * (((R * phi2) / phi1) - R); elseif (phi1 <= -1.25e-184) tmp = t_2; elseif (phi1 <= -1.15e-282) tmp = lambda1 * ((R * t_1) - ((R * (lambda2 * t_1)) / lambda1)); elseif (phi1 <= 4e-136) tmp = t_2; else tmp = (R * phi2) * (1.0 - (phi1 / phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[(N[(phi2 * -0.25), $MachinePrecision] + N[(phi1 * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-1.0 - t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(lambda2 * N[(N[(N[(R * N[(lambda1 * t$95$1), $MachinePrecision]), $MachinePrecision] / lambda2), $MachinePrecision] + N[(R * N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.0115], N[(phi1 * N[(N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -1.25e-184], t$95$2, If[LessEqual[phi1, -1.15e-282], N[(lambda1 * N[(N[(R * t$95$1), $MachinePrecision] - N[(N[(R * N[(lambda2 * t$95$1), $MachinePrecision]), $MachinePrecision] / lambda1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 4e-136], t$95$2, N[(N[(R * phi2), $MachinePrecision] * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \left(\phi_2 \cdot -0.25 + \phi_1 \cdot -0.125\right)\\
t_1 := -1 - t\_0\\
t_2 := \lambda_2 \cdot \left(\frac{R \cdot \left(\lambda_1 \cdot t\_1\right)}{\lambda_2} + R \cdot \left(1 + t\_0\right)\right)\\
\mathbf{if}\;\phi_1 \leq -0.0115:\\
\;\;\;\;\phi_1 \cdot \left(\frac{R \cdot \phi_2}{\phi_1} - R\right)\\
\mathbf{elif}\;\phi_1 \leq -1.25 \cdot 10^{-184}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;\phi_1 \leq -1.15 \cdot 10^{-282}:\\
\;\;\;\;\lambda_1 \cdot \left(R \cdot t\_1 - \frac{R \cdot \left(\lambda_2 \cdot t\_1\right)}{\lambda_1}\right)\\
\mathbf{elif}\;\phi_1 \leq 4 \cdot 10^{-136}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(R \cdot \phi_2\right) \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\\
\end{array}
\end{array}
if phi1 < -0.0115Initial program 56.6%
hypot-define91.3%
Simplified91.3%
Taylor expanded in phi2 around inf 48.4%
associate-*r/48.4%
mul-1-neg48.4%
*-commutative48.4%
Simplified48.4%
Taylor expanded in phi1 around inf 56.2%
+-commutative56.2%
mul-1-neg56.2%
unsub-neg56.2%
*-commutative56.2%
Simplified56.2%
if -0.0115 < phi1 < -1.25000000000000001e-184 or -1.1499999999999999e-282 < phi1 < 4.00000000000000001e-136Initial program 64.1%
hypot-define99.6%
Simplified99.6%
Taylor expanded in phi2 around 0 81.2%
associate-*r*81.2%
Simplified81.2%
Taylor expanded in phi1 around 0 81.2%
Taylor expanded in lambda2 around inf 24.6%
if -1.25000000000000001e-184 < phi1 < -1.1499999999999999e-282Initial program 65.6%
hypot-define100.0%
Simplified100.0%
Taylor expanded in phi2 around 0 84.5%
associate-*r*84.5%
Simplified84.5%
Taylor expanded in phi1 around 0 84.5%
Taylor expanded in lambda1 around -inf 25.2%
if 4.00000000000000001e-136 < phi1 Initial program 55.6%
hypot-define94.1%
Simplified94.1%
Taylor expanded in phi2 around inf 14.8%
associate-*r/14.8%
mul-1-neg14.8%
*-commutative14.8%
Simplified14.8%
Taylor expanded in R around 0 16.9%
associate-*r*16.9%
*-commutative16.9%
mul-1-neg16.9%
unsub-neg16.9%
Simplified16.9%
Final simplification28.1%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (+ (* phi2 -0.25) (* phi1 -0.125))))
(t_1
(*
lambda2
(+ (/ (* R (* lambda1 (- -1.0 t_0))) lambda2) (* R (+ 1.0 t_0))))))
(if (<= phi1 -0.000285)
(* phi1 (- (/ (* R phi2) phi1) R))
(if (<= phi1 1.7e-250)
t_1
(if (<= phi1 1.7e-200)
(* R (- phi2 phi1))
(if (<= phi1 3.9e-140) t_1 (* (* R phi2) (- 1.0 (/ phi1 phi2)))))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * ((phi2 * -0.25) + (phi1 * -0.125));
double t_1 = lambda2 * (((R * (lambda1 * (-1.0 - t_0))) / lambda2) + (R * (1.0 + t_0)));
double tmp;
if (phi1 <= -0.000285) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} else if (phi1 <= 1.7e-250) {
tmp = t_1;
} else if (phi1 <= 1.7e-200) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= 3.9e-140) {
tmp = t_1;
} else {
tmp = (R * phi2) * (1.0 - (phi1 / phi2));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = phi1 * ((phi2 * (-0.25d0)) + (phi1 * (-0.125d0)))
t_1 = lambda2 * (((r * (lambda1 * ((-1.0d0) - t_0))) / lambda2) + (r * (1.0d0 + t_0)))
if (phi1 <= (-0.000285d0)) then
tmp = phi1 * (((r * phi2) / phi1) - r)
else if (phi1 <= 1.7d-250) then
tmp = t_1
else if (phi1 <= 1.7d-200) then
tmp = r * (phi2 - phi1)
else if (phi1 <= 3.9d-140) then
tmp = t_1
else
tmp = (r * phi2) * (1.0d0 - (phi1 / phi2))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * ((phi2 * -0.25) + (phi1 * -0.125));
double t_1 = lambda2 * (((R * (lambda1 * (-1.0 - t_0))) / lambda2) + (R * (1.0 + t_0)));
double tmp;
if (phi1 <= -0.000285) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} else if (phi1 <= 1.7e-250) {
tmp = t_1;
} else if (phi1 <= 1.7e-200) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= 3.9e-140) {
tmp = t_1;
} else {
tmp = (R * phi2) * (1.0 - (phi1 / phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * ((phi2 * -0.25) + (phi1 * -0.125)) t_1 = lambda2 * (((R * (lambda1 * (-1.0 - t_0))) / lambda2) + (R * (1.0 + t_0))) tmp = 0 if phi1 <= -0.000285: tmp = phi1 * (((R * phi2) / phi1) - R) elif phi1 <= 1.7e-250: tmp = t_1 elif phi1 <= 1.7e-200: tmp = R * (phi2 - phi1) elif phi1 <= 3.9e-140: tmp = t_1 else: tmp = (R * phi2) * (1.0 - (phi1 / phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * Float64(Float64(phi2 * -0.25) + Float64(phi1 * -0.125))) t_1 = Float64(lambda2 * Float64(Float64(Float64(R * Float64(lambda1 * Float64(-1.0 - t_0))) / lambda2) + Float64(R * Float64(1.0 + t_0)))) tmp = 0.0 if (phi1 <= -0.000285) tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R)); elseif (phi1 <= 1.7e-250) tmp = t_1; elseif (phi1 <= 1.7e-200) tmp = Float64(R * Float64(phi2 - phi1)); elseif (phi1 <= 3.9e-140) tmp = t_1; else tmp = Float64(Float64(R * phi2) * Float64(1.0 - Float64(phi1 / phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = phi1 * ((phi2 * -0.25) + (phi1 * -0.125)); t_1 = lambda2 * (((R * (lambda1 * (-1.0 - t_0))) / lambda2) + (R * (1.0 + t_0))); tmp = 0.0; if (phi1 <= -0.000285) tmp = phi1 * (((R * phi2) / phi1) - R); elseif (phi1 <= 1.7e-250) tmp = t_1; elseif (phi1 <= 1.7e-200) tmp = R * (phi2 - phi1); elseif (phi1 <= 3.9e-140) tmp = t_1; else tmp = (R * phi2) * (1.0 - (phi1 / phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[(N[(phi2 * -0.25), $MachinePrecision] + N[(phi1 * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(lambda2 * N[(N[(N[(R * N[(lambda1 * N[(-1.0 - t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / lambda2), $MachinePrecision] + N[(R * N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.000285], N[(phi1 * N[(N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.7e-250], t$95$1, If[LessEqual[phi1, 1.7e-200], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 3.9e-140], t$95$1, N[(N[(R * phi2), $MachinePrecision] * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \left(\phi_2 \cdot -0.25 + \phi_1 \cdot -0.125\right)\\
t_1 := \lambda_2 \cdot \left(\frac{R \cdot \left(\lambda_1 \cdot \left(-1 - t\_0\right)\right)}{\lambda_2} + R \cdot \left(1 + t\_0\right)\right)\\
\mathbf{if}\;\phi_1 \leq -0.000285:\\
\;\;\;\;\phi_1 \cdot \left(\frac{R \cdot \phi_2}{\phi_1} - R\right)\\
\mathbf{elif}\;\phi_1 \leq 1.7 \cdot 10^{-250}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;\phi_1 \leq 1.7 \cdot 10^{-200}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq 3.9 \cdot 10^{-140}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(R \cdot \phi_2\right) \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\\
\end{array}
\end{array}
if phi1 < -2.8499999999999999e-4Initial program 56.6%
hypot-define91.3%
Simplified91.3%
Taylor expanded in phi2 around inf 48.4%
associate-*r/48.4%
mul-1-neg48.4%
*-commutative48.4%
Simplified48.4%
Taylor expanded in phi1 around inf 56.2%
+-commutative56.2%
mul-1-neg56.2%
unsub-neg56.2%
*-commutative56.2%
Simplified56.2%
if -2.8499999999999999e-4 < phi1 < 1.69999999999999997e-250 or 1.7000000000000001e-200 < phi1 < 3.90000000000000019e-140Initial program 66.6%
hypot-define99.7%
Simplified99.7%
Taylor expanded in phi2 around 0 81.8%
associate-*r*81.8%
Simplified81.8%
Taylor expanded in phi1 around 0 81.8%
Taylor expanded in lambda2 around inf 24.8%
if 1.69999999999999997e-250 < phi1 < 1.7000000000000001e-200Initial program 42.7%
hypot-define100.0%
Simplified100.0%
Taylor expanded in phi2 around inf 31.2%
associate-*r/31.2%
mul-1-neg31.2%
*-commutative31.2%
Simplified31.2%
Taylor expanded in phi2 around 0 31.2%
+-commutative31.2%
mul-1-neg31.2%
*-commutative31.2%
unsub-neg31.2%
*-commutative31.2%
Simplified31.2%
Taylor expanded in phi2 around 0 31.2%
distribute-lft-out--31.2%
Simplified31.2%
if 3.90000000000000019e-140 < phi1 Initial program 55.6%
hypot-define94.1%
Simplified94.1%
Taylor expanded in phi2 around inf 14.8%
associate-*r/14.8%
mul-1-neg14.8%
*-commutative14.8%
Simplified14.8%
Taylor expanded in R around 0 16.9%
associate-*r*16.9%
*-commutative16.9%
mul-1-neg16.9%
unsub-neg16.9%
Simplified16.9%
Final simplification28.4%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* R (- lambda1))))
(if (<= lambda1 -4.1e+136)
t_0
(if (<= lambda1 -1.55e+108)
(* phi2 (* phi1 (- (/ R phi1) (/ R phi2))))
(if (<= lambda1 -1.96e+93)
t_0
(if (<= lambda1 2.8e-72)
(* R (- phi2 phi1))
(*
R
(*
lambda2
(+ 1.0 (* phi1 (+ (* phi2 -0.25) (* phi1 -0.125))))))))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * -lambda1;
double tmp;
if (lambda1 <= -4.1e+136) {
tmp = t_0;
} else if (lambda1 <= -1.55e+108) {
tmp = phi2 * (phi1 * ((R / phi1) - (R / phi2)));
} else if (lambda1 <= -1.96e+93) {
tmp = t_0;
} else if (lambda1 <= 2.8e-72) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * (1.0 + (phi1 * ((phi2 * -0.25) + (phi1 * -0.125)))));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: tmp
t_0 = r * -lambda1
if (lambda1 <= (-4.1d+136)) then
tmp = t_0
else if (lambda1 <= (-1.55d+108)) then
tmp = phi2 * (phi1 * ((r / phi1) - (r / phi2)))
else if (lambda1 <= (-1.96d+93)) then
tmp = t_0
else if (lambda1 <= 2.8d-72) then
tmp = r * (phi2 - phi1)
else
tmp = r * (lambda2 * (1.0d0 + (phi1 * ((phi2 * (-0.25d0)) + (phi1 * (-0.125d0))))))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * -lambda1;
double tmp;
if (lambda1 <= -4.1e+136) {
tmp = t_0;
} else if (lambda1 <= -1.55e+108) {
tmp = phi2 * (phi1 * ((R / phi1) - (R / phi2)));
} else if (lambda1 <= -1.96e+93) {
tmp = t_0;
} else if (lambda1 <= 2.8e-72) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * (lambda2 * (1.0 + (phi1 * ((phi2 * -0.25) + (phi1 * -0.125)))));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = R * -lambda1 tmp = 0 if lambda1 <= -4.1e+136: tmp = t_0 elif lambda1 <= -1.55e+108: tmp = phi2 * (phi1 * ((R / phi1) - (R / phi2))) elif lambda1 <= -1.96e+93: tmp = t_0 elif lambda1 <= 2.8e-72: tmp = R * (phi2 - phi1) else: tmp = R * (lambda2 * (1.0 + (phi1 * ((phi2 * -0.25) + (phi1 * -0.125))))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * Float64(-lambda1)) tmp = 0.0 if (lambda1 <= -4.1e+136) tmp = t_0; elseif (lambda1 <= -1.55e+108) tmp = Float64(phi2 * Float64(phi1 * Float64(Float64(R / phi1) - Float64(R / phi2)))); elseif (lambda1 <= -1.96e+93) tmp = t_0; elseif (lambda1 <= 2.8e-72) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * Float64(lambda2 * Float64(1.0 + Float64(phi1 * Float64(Float64(phi2 * -0.25) + Float64(phi1 * -0.125)))))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = R * -lambda1; tmp = 0.0; if (lambda1 <= -4.1e+136) tmp = t_0; elseif (lambda1 <= -1.55e+108) tmp = phi2 * (phi1 * ((R / phi1) - (R / phi2))); elseif (lambda1 <= -1.96e+93) tmp = t_0; elseif (lambda1 <= 2.8e-72) tmp = R * (phi2 - phi1); else tmp = R * (lambda2 * (1.0 + (phi1 * ((phi2 * -0.25) + (phi1 * -0.125))))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * (-lambda1)), $MachinePrecision]}, If[LessEqual[lambda1, -4.1e+136], t$95$0, If[LessEqual[lambda1, -1.55e+108], N[(phi2 * N[(phi1 * N[(N[(R / phi1), $MachinePrecision] - N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, -1.96e+93], t$95$0, If[LessEqual[lambda1, 2.8e-72], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * N[(lambda2 * N[(1.0 + N[(phi1 * N[(N[(phi2 * -0.25), $MachinePrecision] + N[(phi1 * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := R \cdot \left(-\lambda_1\right)\\
\mathbf{if}\;\lambda_1 \leq -4.1 \cdot 10^{+136}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\lambda_1 \leq -1.55 \cdot 10^{+108}:\\
\;\;\;\;\phi_2 \cdot \left(\phi_1 \cdot \left(\frac{R}{\phi_1} - \frac{R}{\phi_2}\right)\right)\\
\mathbf{elif}\;\lambda_1 \leq -1.96 \cdot 10^{+93}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\lambda_1 \leq 2.8 \cdot 10^{-72}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\lambda_2 \cdot \left(1 + \phi_1 \cdot \left(\phi_2 \cdot -0.25 + \phi_1 \cdot -0.125\right)\right)\right)\\
\end{array}
\end{array}
if lambda1 < -4.0999999999999998e136 or -1.5500000000000001e108 < lambda1 < -1.9600000000000001e93Initial program 45.5%
hypot-define91.2%
Simplified91.2%
Taylor expanded in phi2 around 0 69.4%
associate-*r*69.4%
Simplified69.4%
Taylor expanded in phi1 around 0 58.3%
Taylor expanded in lambda1 around -inf 37.1%
Taylor expanded in phi1 around 0 56.3%
*-commutative56.3%
Simplified56.3%
if -4.0999999999999998e136 < lambda1 < -1.5500000000000001e108Initial program 58.5%
hypot-define100.0%
Simplified100.0%
Taylor expanded in phi2 around inf 22.9%
associate-*r/22.9%
mul-1-neg22.9%
*-commutative22.9%
Simplified22.9%
Taylor expanded in phi1 around inf 22.9%
+-commutative22.9%
mul-1-neg22.9%
unsub-neg22.9%
Simplified22.9%
if -1.9600000000000001e93 < lambda1 < 2.7999999999999998e-72Initial program 62.1%
hypot-define96.6%
Simplified96.6%
Taylor expanded in phi2 around inf 26.6%
associate-*r/26.6%
mul-1-neg26.6%
*-commutative26.6%
Simplified26.6%
Taylor expanded in phi2 around 0 29.1%
+-commutative29.1%
mul-1-neg29.1%
*-commutative29.1%
unsub-neg29.1%
*-commutative29.1%
Simplified29.1%
Taylor expanded in phi2 around 0 29.1%
distribute-lft-out--29.1%
Simplified29.1%
if 2.7999999999999998e-72 < lambda1 Initial program 61.7%
hypot-define96.5%
Simplified96.5%
Taylor expanded in phi2 around 0 77.4%
associate-*r*77.4%
Simplified77.4%
Taylor expanded in phi1 around 0 63.2%
Taylor expanded in lambda2 around inf 14.9%
Final simplification27.5%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* R (- lambda1))) (t_1 (* R (- phi1))))
(if (<= phi2 -4.3e-209)
t_1
(if (<= phi2 -1.7e-289)
t_0
(if (<= phi2 1.22e-307) t_1 (if (<= phi2 2.15e+19) t_0 (* R phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * -lambda1;
double t_1 = R * -phi1;
double tmp;
if (phi2 <= -4.3e-209) {
tmp = t_1;
} else if (phi2 <= -1.7e-289) {
tmp = t_0;
} else if (phi2 <= 1.22e-307) {
tmp = t_1;
} else if (phi2 <= 2.15e+19) {
tmp = t_0;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = r * -lambda1
t_1 = r * -phi1
if (phi2 <= (-4.3d-209)) then
tmp = t_1
else if (phi2 <= (-1.7d-289)) then
tmp = t_0
else if (phi2 <= 1.22d-307) then
tmp = t_1
else if (phi2 <= 2.15d+19) then
tmp = t_0
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * -lambda1;
double t_1 = R * -phi1;
double tmp;
if (phi2 <= -4.3e-209) {
tmp = t_1;
} else if (phi2 <= -1.7e-289) {
tmp = t_0;
} else if (phi2 <= 1.22e-307) {
tmp = t_1;
} else if (phi2 <= 2.15e+19) {
tmp = t_0;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = R * -lambda1 t_1 = R * -phi1 tmp = 0 if phi2 <= -4.3e-209: tmp = t_1 elif phi2 <= -1.7e-289: tmp = t_0 elif phi2 <= 1.22e-307: tmp = t_1 elif phi2 <= 2.15e+19: tmp = t_0 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * Float64(-lambda1)) t_1 = Float64(R * Float64(-phi1)) tmp = 0.0 if (phi2 <= -4.3e-209) tmp = t_1; elseif (phi2 <= -1.7e-289) tmp = t_0; elseif (phi2 <= 1.22e-307) tmp = t_1; elseif (phi2 <= 2.15e+19) tmp = t_0; else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = R * -lambda1; t_1 = R * -phi1; tmp = 0.0; if (phi2 <= -4.3e-209) tmp = t_1; elseif (phi2 <= -1.7e-289) tmp = t_0; elseif (phi2 <= 1.22e-307) tmp = t_1; elseif (phi2 <= 2.15e+19) tmp = t_0; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * (-lambda1)), $MachinePrecision]}, Block[{t$95$1 = N[(R * (-phi1)), $MachinePrecision]}, If[LessEqual[phi2, -4.3e-209], t$95$1, If[LessEqual[phi2, -1.7e-289], t$95$0, If[LessEqual[phi2, 1.22e-307], t$95$1, If[LessEqual[phi2, 2.15e+19], t$95$0, N[(R * phi2), $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := R \cdot \left(-\lambda_1\right)\\
t_1 := R \cdot \left(-\phi_1\right)\\
\mathbf{if}\;\phi_2 \leq -4.3 \cdot 10^{-209}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;\phi_2 \leq -1.7 \cdot 10^{-289}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 1.22 \cdot 10^{-307}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;\phi_2 \leq 2.15 \cdot 10^{+19}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -4.30000000000000005e-209 or -1.70000000000000009e-289 < phi2 < 1.22e-307Initial program 58.7%
hypot-define95.5%
Simplified95.5%
Taylor expanded in phi1 around -inf 13.0%
mul-1-neg13.0%
*-commutative13.0%
distribute-rgt-neg-in13.0%
Simplified13.0%
if -4.30000000000000005e-209 < phi2 < -1.70000000000000009e-289 or 1.22e-307 < phi2 < 2.15e19Initial program 66.6%
hypot-define99.9%
Simplified99.9%
Taylor expanded in phi2 around 0 98.9%
associate-*r*98.9%
Simplified98.9%
Taylor expanded in phi1 around 0 80.2%
Taylor expanded in lambda1 around -inf 19.9%
Taylor expanded in phi1 around 0 15.5%
*-commutative15.5%
Simplified15.5%
if 2.15e19 < phi2 Initial program 52.3%
hypot-define91.5%
Simplified91.5%
Taylor expanded in phi2 around inf 53.6%
*-commutative53.6%
Simplified53.6%
Final simplification23.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -4.2e+136) (* R (- lambda1)) (* R (- phi2 phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4.2e+136) {
tmp = R * -lambda1;
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda1 <= (-4.2d+136)) then
tmp = r * -lambda1
else
tmp = r * (phi2 - phi1)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4.2e+136) {
tmp = R * -lambda1;
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -4.2e+136: tmp = R * -lambda1 else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -4.2e+136) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -4.2e+136) tmp = R * -lambda1; else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -4.2e+136], N[(R * (-lambda1)), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -4.2 \cdot 10^{+136}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -4.1999999999999998e136Initial program 45.1%
hypot-define90.6%
Simplified90.6%
Taylor expanded in phi2 around 0 67.5%
associate-*r*67.5%
Simplified67.5%
Taylor expanded in phi1 around 0 58.7%
Taylor expanded in lambda1 around -inf 36.3%
Taylor expanded in phi1 around 0 56.5%
*-commutative56.5%
Simplified56.5%
if -4.1999999999999998e136 < lambda1 Initial program 61.7%
hypot-define96.7%
Simplified96.7%
Taylor expanded in phi2 around inf 22.3%
associate-*r/22.3%
mul-1-neg22.3%
*-commutative22.3%
Simplified22.3%
Taylor expanded in phi2 around 0 24.1%
+-commutative24.1%
mul-1-neg24.1%
*-commutative24.1%
unsub-neg24.1%
*-commutative24.1%
Simplified24.1%
Taylor expanded in phi2 around 0 24.1%
distribute-lft-out--24.6%
Simplified24.6%
Final simplification28.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 4.3e-16) (* R (- phi1)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.3e-16) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 4.3d-16) then
tmp = r * -phi1
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.3e-16) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 4.3e-16: tmp = R * -phi1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 4.3e-16) tmp = Float64(R * Float64(-phi1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 4.3e-16) tmp = R * -phi1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 4.3e-16], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 4.3 \cdot 10^{-16}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 4.2999999999999999e-16Initial program 62.3%
hypot-define97.3%
Simplified97.3%
Taylor expanded in phi1 around -inf 13.5%
mul-1-neg13.5%
*-commutative13.5%
distribute-rgt-neg-in13.5%
Simplified13.5%
if 4.2999999999999999e-16 < phi2 Initial program 51.6%
hypot-define91.9%
Simplified91.9%
Taylor expanded in phi2 around inf 51.3%
*-commutative51.3%
Simplified51.3%
Final simplification23.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R phi2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * phi2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * phi2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * phi2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * phi2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * phi2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \phi_2
\end{array}
Initial program 59.6%
hypot-define95.9%
Simplified95.9%
Taylor expanded in phi2 around inf 15.4%
*-commutative15.4%
Simplified15.4%
Final simplification15.4%
herbie shell --seed 2024089
(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))))))