
(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 24 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
(let* ((t_0 (sin (* 0.5 phi1))) (t_1 (sin (* 0.5 phi2))) (t_2 (- t_1)))
(*
R
(hypot
(*
(- lambda1 lambda2)
(+
(fma (cos (* 0.5 phi2)) (cos (* 0.5 phi1)) (* t_0 t_2))
(fma t_2 t_0 (* t_0 t_1))))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin((0.5 * phi1));
double t_1 = sin((0.5 * phi2));
double t_2 = -t_1;
return R * hypot(((lambda1 - lambda2) * (fma(cos((0.5 * phi2)), cos((0.5 * phi1)), (t_0 * t_2)) + fma(t_2, t_0, (t_0 * t_1)))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) t_0 = sin(Float64(0.5 * phi1)) t_1 = sin(Float64(0.5 * phi2)) t_2 = Float64(-t_1) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * Float64(fma(cos(Float64(0.5 * phi2)), cos(Float64(0.5 * phi1)), Float64(t_0 * t_2)) + fma(t_2, t_0, Float64(t_0 * t_1)))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 * t$95$0 + N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sin \left(0.5 \cdot \phi_1\right)\\
t_1 := \sin \left(0.5 \cdot \phi_2\right)\\
t_2 := -t\_1\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\mathsf{fma}\left(\cos \left(0.5 \cdot \phi_2\right), \cos \left(0.5 \cdot \phi_1\right), t\_0 \cdot t\_2\right) + \mathsf{fma}\left(t\_2, t\_0, t\_0 \cdot t\_1\right)\right), \phi_1 - \phi_2\right)
\end{array}
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
log1p-expm1-u94.5%
div-inv94.5%
metadata-eval94.5%
Applied egg-rr94.5%
*-commutative94.5%
+-commutative94.5%
distribute-rgt-in94.5%
*-commutative94.5%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
log1p-expm1-u99.8%
*-un-lft-identity99.8%
prod-diff99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
fma-undefine99.8%
distribute-lft-neg-in99.8%
cancel-sign-sub-inv99.8%
*-rgt-identity99.8%
sub-neg99.8%
Simplified99.8%
cancel-sign-sub-inv99.8%
*-commutative99.8%
fma-define99.8%
Applied egg-rr99.8%
Final simplification99.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (sin (* 0.5 phi1))) (t_1 (sin (* 0.5 phi2))) (t_2 (* t_0 t_1)))
(*
R
(hypot
(*
(- lambda1 lambda2)
(+
(fma (- t_1) t_0 t_2)
(- (* (cos (* 0.5 phi2)) (cos (* 0.5 phi1))) t_2)))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin((0.5 * phi1));
double t_1 = sin((0.5 * phi2));
double t_2 = t_0 * t_1;
return R * hypot(((lambda1 - lambda2) * (fma(-t_1, t_0, t_2) + ((cos((0.5 * phi2)) * cos((0.5 * phi1))) - t_2))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) t_0 = sin(Float64(0.5 * phi1)) t_1 = sin(Float64(0.5 * phi2)) t_2 = Float64(t_0 * t_1) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * Float64(fma(Float64(-t_1), t_0, t_2) + Float64(Float64(cos(Float64(0.5 * phi2)) * cos(Float64(0.5 * phi1))) - t_2))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 * t$95$1), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[((-t$95$1) * t$95$0 + t$95$2), $MachinePrecision] + N[(N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sin \left(0.5 \cdot \phi_1\right)\\
t_1 := \sin \left(0.5 \cdot \phi_2\right)\\
t_2 := t\_0 \cdot t\_1\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\mathsf{fma}\left(-t\_1, t\_0, t\_2\right) + \left(\cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right) - t\_2\right)\right), \phi_1 - \phi_2\right)
\end{array}
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
log1p-expm1-u94.5%
div-inv94.5%
metadata-eval94.5%
Applied egg-rr94.5%
*-commutative94.5%
+-commutative94.5%
distribute-rgt-in94.5%
*-commutative94.5%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
log1p-expm1-u99.8%
*-un-lft-identity99.8%
prod-diff99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
fma-undefine99.8%
distribute-lft-neg-in99.8%
cancel-sign-sub-inv99.8%
*-rgt-identity99.8%
sub-neg99.8%
Simplified99.8%
Final simplification99.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(fma
(cos (* 0.5 phi2))
(cos (* 0.5 phi1))
(* (sin (* 0.5 phi1)) (- (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((0.5 * phi2)), cos((0.5 * phi1)), (sin((0.5 * phi1)) * -sin((0.5 * phi2))))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * fma(cos(Float64(0.5 * phi2)), cos(Float64(0.5 * phi1)), Float64(sin(Float64(0.5 * phi1)) * 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[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(0.5 * phi1), $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(0.5 \cdot \phi_2\right), \cos \left(0.5 \cdot \phi_1\right), \sin \left(0.5 \cdot \phi_1\right) \cdot \left(-\sin \left(0.5 \cdot \phi_2\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
log1p-expm1-u94.5%
div-inv94.5%
metadata-eval94.5%
Applied egg-rr94.5%
*-commutative94.5%
+-commutative94.5%
distribute-rgt-in94.5%
*-commutative94.5%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
log1p-expm1-u99.8%
cancel-sign-sub-inv99.8%
fma-define99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
Final simplification99.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -1e-160)
(*
R
(hypot (* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0))) (- phi1 phi2)))
(*
R
(hypot
(*
lambda2
(-
(* (sin (* 0.5 phi1)) (sin (* 0.5 phi2)))
(* (cos (* 0.5 phi2)) (cos (* 0.5 phi1)))))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1e-160) {
tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * ((sin((0.5 * phi1)) * sin((0.5 * phi2))) - (cos((0.5 * phi2)) * cos((0.5 * phi1))))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1e-160) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * ((Math.sin((0.5 * phi1)) * Math.sin((0.5 * phi2))) - (Math.cos((0.5 * phi2)) * Math.cos((0.5 * phi1))))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1e-160: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * ((math.sin((0.5 * phi1)) * math.sin((0.5 * phi2))) - (math.cos((0.5 * phi2)) * math.cos((0.5 * phi1))))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1e-160) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(Float64(sin(Float64(0.5 * phi1)) * sin(Float64(0.5 * phi2))) - Float64(cos(Float64(0.5 * phi2)) * cos(Float64(0.5 * phi1))))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -1e-160) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)); else tmp = R * hypot((lambda2 * ((sin((0.5 * phi1)) * sin((0.5 * phi2))) - (cos((0.5 * phi2)) * cos((0.5 * phi1))))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1e-160], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * N[(N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1 \cdot 10^{-160}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_2 + \phi_1}{2}\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(\sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(0.5 \cdot \phi_2\right) - \cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -9.9999999999999999e-161Initial program 50.3%
hypot-define96.9%
Simplified96.9%
if -9.9999999999999999e-161 < lambda1 Initial program 63.9%
hypot-define93.4%
Simplified93.4%
log1p-expm1-u93.4%
div-inv93.4%
metadata-eval93.4%
Applied egg-rr93.4%
*-commutative93.4%
+-commutative93.4%
distribute-rgt-in93.4%
*-commutative93.4%
cos-sum99.7%
*-commutative99.7%
*-commutative99.7%
Applied egg-rr99.7%
log1p-expm1-u99.8%
*-un-lft-identity99.8%
prod-diff99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
fma-undefine99.8%
distribute-lft-neg-in99.8%
cancel-sign-sub-inv99.8%
*-rgt-identity99.8%
sub-neg99.8%
Simplified99.7%
Taylor expanded in lambda1 around 0 84.1%
mul-1-neg84.1%
*-commutative84.1%
distribute-rgt-neg-in84.1%
mul-1-neg84.1%
distribute-lft-neg-out84.1%
+-commutative84.1%
cancel-sign-sub-inv84.1%
*-commutative84.1%
*-commutative84.1%
Simplified84.1%
Final simplification88.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -3.2e-8) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- 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 (phi1 <= -3.2e-8) {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (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 (phi1 <= -3.2e-8) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), (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 phi1 <= -3.2e-8: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (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 (phi1 <= -3.2e-8) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), 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 (phi1 <= -3.2e-8) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (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[phi1, -3.2e-8], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], 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_1 \leq -3.2 \cdot 10^{-8}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)\\
\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 phi1 < -3.2000000000000002e-8Initial program 52.8%
hypot-define89.4%
Simplified89.4%
Taylor expanded in phi2 around 0 89.4%
if -3.2000000000000002e-8 < phi1 Initial program 62.0%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi1 around 0 92.6%
Final simplification91.7%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* 0.5 phi1))))
(if (<= lambda1 -80.0)
(* R (hypot (* lambda1 t_0) (- phi1 phi2)))
(* R (hypot (* lambda2 (- t_0)) (- phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((0.5 * phi1));
double tmp;
if (lambda1 <= -80.0) {
tmp = R * hypot((lambda1 * t_0), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * -t_0), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((0.5 * phi1));
double tmp;
if (lambda1 <= -80.0) {
tmp = R * Math.hypot((lambda1 * t_0), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * -t_0), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((0.5 * phi1)) tmp = 0 if lambda1 <= -80.0: tmp = R * math.hypot((lambda1 * t_0), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * -t_0), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(0.5 * phi1)) tmp = 0.0 if (lambda1 <= -80.0) tmp = Float64(R * hypot(Float64(lambda1 * t_0), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(-t_0)), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = cos((0.5 * phi1)); tmp = 0.0; if (lambda1 <= -80.0) tmp = R * hypot((lambda1 * t_0), (phi1 - phi2)); else tmp = R * hypot((lambda2 * -t_0), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda1, -80.0], N[(R * N[Sqrt[N[(lambda1 * t$95$0), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * (-t$95$0)), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(0.5 \cdot \phi_1\right)\\
\mathbf{if}\;\lambda_1 \leq -80:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot t\_0, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(-t\_0\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -80Initial program 49.7%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi2 around 0 89.1%
Taylor expanded in lambda1 around inf 74.9%
*-commutative74.9%
Simplified74.9%
if -80 < lambda1 Initial program 62.5%
hypot-define94.1%
Simplified94.1%
Taylor expanded in phi2 around 0 89.9%
Taylor expanded in lambda1 around 0 79.0%
associate-*r*79.0%
neg-mul-179.0%
Simplified79.0%
Final simplification78.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_2 + \phi_1}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
Final simplification94.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
Taylor expanded in phi2 around 0 89.7%
Final simplification89.7%
(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.5%
hypot-define94.5%
Simplified94.5%
Taylor expanded in phi2 around 0 89.7%
Taylor expanded in phi1 around 0 83.6%
Final simplification83.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot phi1 (- lambda1 lambda2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(phi1, (lambda1 - lambda2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(phi1, (lambda1 - lambda2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(phi1, (lambda1 - lambda2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(phi1, Float64(lambda1 - lambda2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(phi1, (lambda1 - lambda2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
Taylor expanded in phi2 around 0 89.7%
Taylor expanded in phi1 around 0 83.6%
Taylor expanded in phi2 around 0 46.0%
unpow246.0%
unpow246.0%
hypot-define67.8%
Simplified67.8%
Final simplification67.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 5e+155) (- (* R phi2) (* R phi1)) (* phi2 (- R (* R (/ phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 5e+155) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi2 * (R - (R * (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) :: tmp
if (r <= 5d+155) then
tmp = (r * phi2) - (r * phi1)
else
tmp = phi2 * (r - (r * (phi1 / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 5e+155) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi2 * (R - (R * (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 5e+155: tmp = (R * phi2) - (R * phi1) else: tmp = phi2 * (R - (R * (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 5e+155) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); else tmp = Float64(phi2 * Float64(R - Float64(R * Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 5e+155) tmp = (R * phi2) - (R * phi1); else tmp = phi2 * (R - (R * (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 5e+155], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(R * N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 5 \cdot 10^{+155}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - R \cdot \frac{\phi_1}{\phi_2}\right)\\
\end{array}
\end{array}
if R < 4.9999999999999999e155Initial program 53.7%
hypot-define93.7%
Simplified93.7%
Taylor expanded in phi1 around -inf 26.9%
associate-*r*26.9%
mul-1-neg26.9%
associate-*r/26.9%
mul-1-neg26.9%
*-commutative26.9%
Simplified26.9%
Taylor expanded in phi1 around 0 27.4%
+-commutative27.4%
mul-1-neg27.4%
unsub-neg27.4%
*-commutative27.4%
*-commutative27.4%
Simplified27.4%
if 4.9999999999999999e155 < R Initial program 100.0%
hypot-define100.0%
Simplified100.0%
Taylor expanded in phi1 around -inf 32.3%
associate-*r*32.3%
mul-1-neg32.3%
associate-*r/32.3%
mul-1-neg32.3%
*-commutative32.3%
Simplified32.3%
Taylor expanded in phi2 around inf 35.3%
mul-1-neg35.3%
unsub-neg35.3%
associate-/l*35.3%
Simplified35.3%
Final simplification28.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 1.75e+156) (- (* R phi2) (* R phi1)) (* phi2 (- R (* phi1 (/ R phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 1.75e+156) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi2 * (R - (phi1 * (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 (r <= 1.75d+156) then
tmp = (r * phi2) - (r * phi1)
else
tmp = phi2 * (r - (phi1 * (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 (R <= 1.75e+156) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = phi2 * (R - (phi1 * (R / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 1.75e+156: tmp = (R * phi2) - (R * phi1) else: tmp = phi2 * (R - (phi1 * (R / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 1.75e+156) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); else tmp = Float64(phi2 * Float64(R - Float64(phi1 * Float64(R / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 1.75e+156) tmp = (R * phi2) - (R * phi1); else tmp = phi2 * (R - (phi1 * (R / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 1.75e+156], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 1.75 \cdot 10^{+156}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - \phi_1 \cdot \frac{R}{\phi_2}\right)\\
\end{array}
\end{array}
if R < 1.7500000000000002e156Initial program 53.7%
hypot-define93.7%
Simplified93.7%
Taylor expanded in phi1 around -inf 26.9%
associate-*r*26.9%
mul-1-neg26.9%
associate-*r/26.9%
mul-1-neg26.9%
*-commutative26.9%
Simplified26.9%
Taylor expanded in phi1 around 0 27.4%
+-commutative27.4%
mul-1-neg27.4%
unsub-neg27.4%
*-commutative27.4%
*-commutative27.4%
Simplified27.4%
if 1.7500000000000002e156 < R Initial program 100.0%
hypot-define100.0%
Simplified100.0%
Taylor expanded in phi2 around inf 35.3%
mul-1-neg35.3%
unsub-neg35.3%
*-commutative35.3%
associate-/l*44.3%
Simplified44.3%
Final simplification29.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 8.5e+75) (- (* R phi2) (* R phi1)) (* (* R lambda2) (- 1.0 (/ lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 8.5e+75) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = (R * lambda2) * (1.0 - (lambda1 / lambda2));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (r <= 8.5d+75) then
tmp = (r * phi2) - (r * phi1)
else
tmp = (r * lambda2) * (1.0d0 - (lambda1 / lambda2))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 8.5e+75) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = (R * lambda2) * (1.0 - (lambda1 / lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 8.5e+75: tmp = (R * phi2) - (R * phi1) else: tmp = (R * lambda2) * (1.0 - (lambda1 / lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 8.5e+75) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); else tmp = Float64(Float64(R * lambda2) * Float64(1.0 - Float64(lambda1 / lambda2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 8.5e+75) tmp = (R * phi2) - (R * phi1); else tmp = (R * lambda2) * (1.0 - (lambda1 / lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 8.5e+75], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], N[(N[(R * lambda2), $MachinePrecision] * N[(1.0 - N[(lambda1 / lambda2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 8.5 \cdot 10^{+75}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;\left(R \cdot \lambda_2\right) \cdot \left(1 - \frac{\lambda_1}{\lambda_2}\right)\\
\end{array}
\end{array}
if R < 8.4999999999999993e75Initial program 51.8%
hypot-define93.6%
Simplified93.6%
Taylor expanded in phi1 around -inf 28.1%
associate-*r*28.1%
mul-1-neg28.1%
associate-*r/28.1%
mul-1-neg28.1%
*-commutative28.1%
Simplified28.1%
Taylor expanded in phi1 around 0 28.1%
+-commutative28.1%
mul-1-neg28.1%
unsub-neg28.1%
*-commutative28.1%
*-commutative28.1%
Simplified28.1%
if 8.4999999999999993e75 < R Initial program 91.0%
hypot-define98.3%
Simplified98.3%
Taylor expanded in lambda2 around inf 98.3%
+-commutative98.3%
mul-1-neg98.3%
unsub-neg98.3%
*-commutative98.3%
associate-/l*98.3%
+-commutative98.3%
+-commutative98.3%
Simplified98.3%
Taylor expanded in lambda2 around inf 35.2%
+-commutative35.2%
mul-1-neg35.2%
unsub-neg35.2%
*-commutative35.2%
*-commutative35.2%
*-commutative35.2%
+-commutative35.2%
associate-/l*37.2%
*-commutative37.2%
*-commutative37.2%
associate-*r/37.2%
Simplified37.2%
Taylor expanded in phi1 around 0 25.3%
associate-/l*27.2%
distribute-lft-out--27.2%
*-commutative27.2%
associate-/l*27.2%
Simplified27.2%
Taylor expanded in phi2 around 0 23.5%
associate-*r*23.5%
*-commutative23.5%
Simplified23.5%
Final simplification27.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.95e+46) (* R (- lambda1)) (* (+ (/ phi2 phi1) -1.0) (* R phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.95e+46) {
tmp = R * -lambda1;
} else {
tmp = ((phi2 / phi1) + -1.0) * (R * 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 <= (-1.95d+46)) then
tmp = r * -lambda1
else
tmp = ((phi2 / phi1) + (-1.0d0)) * (r * 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 <= -1.95e+46) {
tmp = R * -lambda1;
} else {
tmp = ((phi2 / phi1) + -1.0) * (R * phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.95e+46: tmp = R * -lambda1 else: tmp = ((phi2 / phi1) + -1.0) * (R * phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.95e+46) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(Float64(Float64(phi2 / phi1) + -1.0) * Float64(R * phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -1.95e+46) tmp = R * -lambda1; else tmp = ((phi2 / phi1) + -1.0) * (R * phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.95e+46], N[(R * (-lambda1)), $MachinePrecision], N[(N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision] * N[(R * phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.95 \cdot 10^{+46}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\phi_2}{\phi_1} + -1\right) \cdot \left(R \cdot \phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -1.94999999999999997e46Initial program 51.1%
hypot-define95.5%
Simplified95.5%
Taylor expanded in phi2 around 0 88.4%
Taylor expanded in phi1 around 0 81.1%
Taylor expanded in lambda1 around -inf 46.6%
mul-1-neg46.6%
*-commutative46.6%
distribute-rgt-neg-in46.6%
Simplified46.6%
if -1.94999999999999997e46 < lambda1 Initial program 61.8%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi1 around -inf 29.8%
associate-*r*29.8%
mul-1-neg29.8%
associate-*r/29.8%
mul-1-neg29.8%
*-commutative29.8%
Simplified29.8%
Taylor expanded in R around -inf 30.3%
associate-*r*28.8%
*-commutative28.8%
sub-neg28.8%
metadata-eval28.8%
Simplified28.8%
Final simplification32.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -2.15e+46) (* R (- lambda1)) (* R (* phi1 (+ (/ phi2 phi1) -1.0)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.15e+46) {
tmp = R * -lambda1;
} else {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
}
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 <= (-2.15d+46)) then
tmp = r * -lambda1
else
tmp = r * (phi1 * ((phi2 / phi1) + (-1.0d0)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.15e+46) {
tmp = R * -lambda1;
} else {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -2.15e+46: tmp = R * -lambda1 else: tmp = R * (phi1 * ((phi2 / phi1) + -1.0)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -2.15e+46) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * Float64(phi1 * Float64(Float64(phi2 / phi1) + -1.0))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -2.15e+46) tmp = R * -lambda1; else tmp = R * (phi1 * ((phi2 / phi1) + -1.0)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -2.15e+46], N[(R * (-lambda1)), $MachinePrecision], N[(R * N[(phi1 * N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -2.15 \cdot 10^{+46}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\
\end{array}
\end{array}
if lambda1 < -2.15000000000000002e46Initial program 51.1%
hypot-define95.5%
Simplified95.5%
Taylor expanded in phi2 around 0 88.4%
Taylor expanded in phi1 around 0 81.1%
Taylor expanded in lambda1 around -inf 46.6%
mul-1-neg46.6%
*-commutative46.6%
distribute-rgt-neg-in46.6%
Simplified46.6%
if -2.15000000000000002e46 < lambda1 Initial program 61.8%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi1 around -inf 30.3%
mul-1-neg30.3%
distribute-rgt-neg-in30.3%
mul-1-neg30.3%
unsub-neg30.3%
Simplified30.3%
Final simplification33.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -4.2e+74) (* lambda1 (- (* R (/ lambda2 lambda1)) R)) (* phi1 (- (/ (* R phi2) phi1) R))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4.2e+74) {
tmp = lambda1 * ((R * (lambda2 / lambda1)) - R);
} else {
tmp = phi1 * (((R * phi2) / phi1) - R);
}
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+74)) then
tmp = lambda1 * ((r * (lambda2 / lambda1)) - r)
else
tmp = phi1 * (((r * phi2) / phi1) - r)
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+74) {
tmp = lambda1 * ((R * (lambda2 / lambda1)) - R);
} else {
tmp = phi1 * (((R * phi2) / phi1) - R);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -4.2e+74: tmp = lambda1 * ((R * (lambda2 / lambda1)) - R) else: tmp = phi1 * (((R * phi2) / phi1) - R) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -4.2e+74) tmp = Float64(lambda1 * Float64(Float64(R * Float64(lambda2 / lambda1)) - R)); else tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -4.2e+74) tmp = lambda1 * ((R * (lambda2 / lambda1)) - R); else tmp = phi1 * (((R * phi2) / phi1) - R); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -4.2e+74], N[(lambda1 * N[(N[(R * N[(lambda2 / lambda1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(phi1 * N[(N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -4.2 \cdot 10^{+74}:\\
\;\;\;\;\lambda_1 \cdot \left(R \cdot \frac{\lambda_2}{\lambda_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_1 \cdot \left(\frac{R \cdot \phi_2}{\phi_1} - R\right)\\
\end{array}
\end{array}
if lambda1 < -4.1999999999999998e74Initial program 50.7%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi2 around 0 89.4%
Taylor expanded in phi1 around 0 82.0%
Taylor expanded in lambda1 around -inf 53.0%
mul-1-neg53.0%
*-commutative53.0%
distribute-rgt-neg-in53.0%
mul-1-neg53.0%
unsub-neg53.0%
associate-/l*52.9%
Simplified52.9%
if -4.1999999999999998e74 < lambda1 Initial program 61.4%
hypot-define93.8%
Simplified93.8%
Taylor expanded in phi1 around -inf 29.0%
associate-*r*29.0%
mul-1-neg29.0%
associate-*r/29.0%
mul-1-neg29.0%
*-commutative29.0%
Simplified29.0%
Final simplification33.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 3.15e-100) (* R phi2) (* R (- lambda1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 3.15e-100) {
tmp = R * phi2;
} else {
tmp = R * -lambda1;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (r <= 3.15d-100) then
tmp = r * phi2
else
tmp = r * -lambda1
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 3.15e-100) {
tmp = R * phi2;
} else {
tmp = R * -lambda1;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 3.15e-100: tmp = R * phi2 else: tmp = R * -lambda1 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 3.15e-100) tmp = Float64(R * phi2); else tmp = Float64(R * Float64(-lambda1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 3.15e-100) tmp = R * phi2; else tmp = R * -lambda1; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 3.15e-100], N[(R * phi2), $MachinePrecision], N[(R * (-lambda1)), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 3.15 \cdot 10^{-100}:\\
\;\;\;\;R \cdot \phi_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\end{array}
\end{array}
if R < 3.1499999999999998e-100Initial program 54.0%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi2 around inf 15.3%
*-commutative15.3%
Simplified15.3%
if 3.1499999999999998e-100 < R Initial program 70.4%
hypot-define95.2%
Simplified95.2%
Taylor expanded in phi2 around 0 93.4%
Taylor expanded in phi1 around 0 88.0%
Taylor expanded in lambda1 around -inf 13.7%
mul-1-neg13.7%
*-commutative13.7%
distribute-rgt-neg-in13.7%
Simplified13.7%
Final simplification14.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.85e+25) (* R (- lambda1)) (* R (- phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.85e+25) {
tmp = R * -lambda1;
} else {
tmp = R * -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 <= (-1.85d+25)) then
tmp = r * -lambda1
else
tmp = r * -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 <= -1.85e+25) {
tmp = R * -lambda1;
} else {
tmp = R * -phi1;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.85e+25: tmp = R * -lambda1 else: tmp = R * -phi1 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.85e+25) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * Float64(-phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -1.85e+25) tmp = R * -lambda1; else tmp = R * -phi1; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.85e+25], N[(R * (-lambda1)), $MachinePrecision], N[(R * (-phi1)), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.85 \cdot 10^{+25}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -1.8499999999999999e25Initial program 50.4%
hypot-define95.6%
Simplified95.6%
Taylor expanded in phi2 around 0 88.6%
Taylor expanded in phi1 around 0 81.4%
Taylor expanded in lambda1 around -inf 45.9%
mul-1-neg45.9%
*-commutative45.9%
distribute-rgt-neg-in45.9%
Simplified45.9%
if -1.8499999999999999e25 < lambda1 Initial program 62.1%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi1 around -inf 22.0%
mul-1-neg22.0%
*-commutative22.0%
distribute-rgt-neg-in22.0%
Simplified22.0%
Final simplification27.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.6e+25) (* R (- lambda1)) (* R (- phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.6e+25) {
tmp = R * -lambda1;
} else {
tmp = R * -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 <= (-1.6d+25)) then
tmp = r * -lambda1
else
tmp = r * -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 <= -1.6e+25) {
tmp = R * -lambda1;
} else {
tmp = R * -phi1;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.6e+25: tmp = R * -lambda1 else: tmp = R * -phi1 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.6e+25) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * Float64(-phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -1.6e+25) tmp = R * -lambda1; else tmp = R * -phi1; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.6e+25], N[(R * (-lambda1)), $MachinePrecision], N[(R * (-phi1)), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.6 \cdot 10^{+25}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -1.6e25Initial program 50.4%
hypot-define95.6%
Simplified95.6%
Taylor expanded in phi2 around 0 88.6%
Taylor expanded in phi1 around 0 81.4%
Taylor expanded in lambda1 around -inf 45.9%
mul-1-neg45.9%
*-commutative45.9%
distribute-rgt-neg-in45.9%
Simplified45.9%
if -1.6e25 < lambda1 Initial program 62.1%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi1 around -inf 30.0%
associate-*r*30.0%
mul-1-neg30.0%
associate-*r/30.0%
mul-1-neg30.0%
*-commutative30.0%
Simplified30.0%
Taylor expanded in phi1 around inf 22.0%
associate-*r*22.0%
neg-mul-122.0%
Simplified22.0%
Final simplification27.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* phi1 (- (* phi2 (/ R phi1)) R)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return phi1 * ((phi2 * (R / phi1)) - R);
}
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 = phi1 * ((phi2 * (r / phi1)) - r)
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return phi1 * ((phi2 * (R / phi1)) - R);
}
def code(R, lambda1, lambda2, phi1, phi2): return phi1 * ((phi2 * (R / phi1)) - R)
function code(R, lambda1, lambda2, phi1, phi2) return Float64(phi1 * Float64(Float64(phi2 * Float64(R / phi1)) - R)) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = phi1 * ((phi2 * (R / phi1)) - R); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(phi1 * N[(N[(phi2 * N[(R / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\phi_1 \cdot \left(\phi_2 \cdot \frac{R}{\phi_1} - R\right)
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
Taylor expanded in phi1 around -inf 27.6%
mul-1-neg27.6%
distribute-rgt-neg-in27.6%
mul-1-neg27.6%
unsub-neg27.6%
*-commutative27.6%
associate-/l*28.0%
Simplified28.0%
Final simplification28.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -4.2e-257) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -4.2e-257) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-4.2d-257)) then
tmp = r * lambda2
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -4.2e-257) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -4.2e-257: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -4.2e-257) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -4.2e-257) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -4.2e-257], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -4.2 \cdot 10^{-257}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -4.2000000000000002e-257Initial program 56.8%
hypot-define94.1%
Simplified94.1%
Taylor expanded in phi2 around 0 88.6%
Taylor expanded in phi1 around 0 81.7%
Taylor expanded in lambda2 around inf 13.8%
*-commutative13.8%
Simplified13.8%
if -4.2000000000000002e-257 < phi1 Initial program 62.0%
hypot-define95.0%
Simplified95.0%
Taylor expanded in phi2 around inf 13.3%
*-commutative13.3%
Simplified13.3%
Final simplification13.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (- (* R phi2) (* R phi1)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return (R * phi2) - (R * phi1);
}
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) - (r * phi1)
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return (R * phi2) - (R * phi1);
}
def code(R, lambda1, lambda2, phi1, phi2): return (R * phi2) - (R * phi1)
function code(R, lambda1, lambda2, phi1, phi2) return Float64(Float64(R * phi2) - Float64(R * phi1)) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = (R * phi2) - (R * phi1); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \phi_2 - R \cdot \phi_1
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
Taylor expanded in phi1 around -inf 27.6%
associate-*r*27.6%
mul-1-neg27.6%
associate-*r/27.6%
mul-1-neg27.6%
*-commutative27.6%
Simplified27.6%
Taylor expanded in phi1 around 0 27.3%
+-commutative27.3%
mul-1-neg27.3%
unsub-neg27.3%
*-commutative27.3%
*-commutative27.3%
Simplified27.3%
Final simplification27.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda1))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda1;
}
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 * lambda1
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda1;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * lambda1
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda1) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * lambda1; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda1), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \lambda_1
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
Taylor expanded in phi2 around 0 89.7%
Taylor expanded in lambda1 around inf 15.7%
*-commutative15.7%
Simplified15.7%
Taylor expanded in phi1 around 0 16.2%
*-commutative16.2%
Simplified16.2%
Final simplification16.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * lambda2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * lambda2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * lambda2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \lambda_2
\end{array}
Initial program 59.5%
hypot-define94.5%
Simplified94.5%
Taylor expanded in phi2 around 0 89.7%
Taylor expanded in phi1 around 0 83.6%
Taylor expanded in lambda2 around inf 12.5%
*-commutative12.5%
Simplified12.5%
Final simplification12.5%
herbie shell --seed 2024066
(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))))))