
(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))));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -900000000000.0)
(*
(hypot (pow (- phi1 phi2) 1.0) (* (cos (/ phi1 2.0)) (- lambda1 lambda2)))
R)
(*
(hypot
(* phi2 (- (/ phi1 phi2) 1.0))
(* (cos (/ (+ phi2 phi1) 2.0)) (- lambda1 lambda2)))
R)))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -900000000000.0) {
tmp = hypot(pow((phi1 - phi2), 1.0), (cos((phi1 / 2.0)) * (lambda1 - lambda2))) * R;
} else {
tmp = hypot((phi2 * ((phi1 / phi2) - 1.0)), (cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -900000000000.0) {
tmp = Math.hypot(Math.pow((phi1 - phi2), 1.0), (Math.cos((phi1 / 2.0)) * (lambda1 - lambda2))) * R;
} else {
tmp = Math.hypot((phi2 * ((phi1 / phi2) - 1.0)), (Math.cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -900000000000.0: tmp = math.hypot(math.pow((phi1 - phi2), 1.0), (math.cos((phi1 / 2.0)) * (lambda1 - lambda2))) * R else: tmp = math.hypot((phi2 * ((phi1 / phi2) - 1.0)), (math.cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -900000000000.0) tmp = Float64(hypot((Float64(phi1 - phi2) ^ 1.0), Float64(cos(Float64(phi1 / 2.0)) * Float64(lambda1 - lambda2))) * R); else tmp = Float64(hypot(Float64(phi2 * Float64(Float64(phi1 / phi2) - 1.0)), Float64(cos(Float64(Float64(phi2 + phi1) / 2.0)) * Float64(lambda1 - lambda2))) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -900000000000.0)
tmp = hypot(((phi1 - phi2) ^ 1.0), (cos((phi1 / 2.0)) * (lambda1 - lambda2))) * R;
else
tmp = hypot((phi2 * ((phi1 / phi2) - 1.0)), (cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -900000000000.0], N[(N[Sqrt[N[Power[N[(phi1 - phi2), $MachinePrecision], 1.0], $MachinePrecision] ^ 2 + N[(N[Cos[N[(phi1 / 2.0), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(phi2 * N[(N[(phi1 / phi2), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -900000000000:\\
\;\;\;\;\mathsf{hypot}\left({\left(\phi_1 - \phi_2\right)}^{1}, \cos \left(\frac{\phi_1}{2}\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\phi_2 \cdot \left(\frac{\phi_1}{\phi_2} - 1\right), \cos \left(\frac{\phi_2 + \phi_1}{2}\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -9e11Initial program 57.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites91.5%
Taylor expanded in phi1 around inf
Applied rewrites91.4%
if -9e11 < phi1 Initial program 57.8%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites97.4%
Taylor expanded in phi2 around inf
unpow1N/A
lower-*.f64N/A
lower--.f64N/A
lower-/.f6489.3
Applied rewrites89.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* (hypot (pow (- phi1 phi2) 1.0) (* (cos (/ (+ phi2 phi1) 2.0)) (- lambda1 lambda2))) R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return hypot(pow((phi1 - phi2), 1.0), (cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.hypot(Math.pow((phi1 - phi2), 1.0), (Math.cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return math.hypot(math.pow((phi1 - phi2), 1.0), (math.cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(hypot((Float64(phi1 - phi2) ^ 1.0), Float64(cos(Float64(Float64(phi2 + phi1) / 2.0)) * Float64(lambda1 - lambda2))) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = hypot(((phi1 - phi2) ^ 1.0), (cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[Sqrt[N[Power[N[(phi1 - phi2), $MachinePrecision], 1.0], $MachinePrecision] ^ 2 + N[(N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\mathsf{hypot}\left({\left(\phi_1 - \phi_2\right)}^{1}, \cos \left(\frac{\phi_2 + \phi_1}{2}\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R
\end{array}
Initial program 57.7%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites96.0%
lift-cos.f64N/A
lift-+.f64N/A
lift-/.f64N/A
sin-+PI/2-revN/A
lower-sin.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lower-+.f64N/A
lift-/.f64N/A
lift-+.f6483.6
Applied rewrites83.6%
lift-sin.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
sin-+PI/2-revN/A
lower-cos.f64N/A
lift-/.f64N/A
lift-+.f6496.0
Applied rewrites96.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -4.5e+163)
(*
(hypot
(pow (- phi1 phi2) 1.0)
(* (sin (fma 0.5 phi2 (/ PI 2.0))) (- lambda1 lambda2)))
R)
(*
(hypot
(* phi2 (- (/ phi1 phi2) 1.0))
(* (cos (/ (+ phi2 phi1) 2.0)) (- lambda1 lambda2)))
R)))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -4.5e+163) {
tmp = hypot(pow((phi1 - phi2), 1.0), (sin(fma(0.5, phi2, (((double) M_PI) / 2.0))) * (lambda1 - lambda2))) * R;
} else {
tmp = hypot((phi2 * ((phi1 / phi2) - 1.0)), (cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -4.5e+163) tmp = Float64(hypot((Float64(phi1 - phi2) ^ 1.0), Float64(sin(fma(0.5, phi2, Float64(pi / 2.0))) * Float64(lambda1 - lambda2))) * R); else tmp = Float64(hypot(Float64(phi2 * Float64(Float64(phi1 / phi2) - 1.0)), Float64(cos(Float64(Float64(phi2 + phi1) / 2.0)) * Float64(lambda1 - lambda2))) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -4.5e+163], N[(N[Sqrt[N[Power[N[(phi1 - phi2), $MachinePrecision], 1.0], $MachinePrecision] ^ 2 + N[(N[Sin[N[(0.5 * phi2 + N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(phi2 * N[(N[(phi1 / phi2), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -4.5 \cdot 10^{+163}:\\
\;\;\;\;\mathsf{hypot}\left({\left(\phi_1 - \phi_2\right)}^{1}, \sin \left(\mathsf{fma}\left(0.5, \phi_2, \frac{\pi}{2}\right)\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\phi_2 \cdot \left(\frac{\phi_1}{\phi_2} - 1\right), \cos \left(\frac{\phi_2 + \phi_1}{2}\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -4.49999999999999988e163Initial program 45.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites94.5%
Taylor expanded in phi1 around 0
sin-+PI/2-revN/A
lower-sin.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lower-fma.f6483.7
Applied rewrites83.7%
if -4.49999999999999988e163 < phi1 Initial program 59.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites96.2%
Taylor expanded in phi2 around inf
unpow1N/A
lower-*.f64N/A
lower--.f64N/A
lower-/.f6488.7
Applied rewrites88.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -4.5e+163)
(*
(hypot (pow (- phi1 phi2) 1.0) (* (sin (* 0.5 PI)) (- lambda1 lambda2)))
R)
(*
(hypot
(* phi2 (- (/ phi1 phi2) 1.0))
(* (cos (/ (+ phi2 phi1) 2.0)) (- lambda1 lambda2)))
R)))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -4.5e+163) {
tmp = hypot(pow((phi1 - phi2), 1.0), (sin((0.5 * ((double) M_PI))) * (lambda1 - lambda2))) * R;
} else {
tmp = hypot((phi2 * ((phi1 / phi2) - 1.0)), (cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -4.5e+163) {
tmp = Math.hypot(Math.pow((phi1 - phi2), 1.0), (Math.sin((0.5 * Math.PI)) * (lambda1 - lambda2))) * R;
} else {
tmp = Math.hypot((phi2 * ((phi1 / phi2) - 1.0)), (Math.cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -4.5e+163: tmp = math.hypot(math.pow((phi1 - phi2), 1.0), (math.sin((0.5 * math.pi)) * (lambda1 - lambda2))) * R else: tmp = math.hypot((phi2 * ((phi1 / phi2) - 1.0)), (math.cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -4.5e+163) tmp = Float64(hypot((Float64(phi1 - phi2) ^ 1.0), Float64(sin(Float64(0.5 * pi)) * Float64(lambda1 - lambda2))) * R); else tmp = Float64(hypot(Float64(phi2 * Float64(Float64(phi1 / phi2) - 1.0)), Float64(cos(Float64(Float64(phi2 + phi1) / 2.0)) * Float64(lambda1 - lambda2))) * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi1 <= -4.5e+163)
tmp = hypot(((phi1 - phi2) ^ 1.0), (sin((0.5 * pi)) * (lambda1 - lambda2))) * R;
else
tmp = hypot((phi2 * ((phi1 / phi2) - 1.0)), (cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -4.5e+163], N[(N[Sqrt[N[Power[N[(phi1 - phi2), $MachinePrecision], 1.0], $MachinePrecision] ^ 2 + N[(N[Sin[N[(0.5 * Pi), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(phi2 * N[(N[(phi1 / phi2), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -4.5 \cdot 10^{+163}:\\
\;\;\;\;\mathsf{hypot}\left({\left(\phi_1 - \phi_2\right)}^{1}, \sin \left(0.5 \cdot \pi\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\phi_2 \cdot \left(\frac{\phi_1}{\phi_2} - 1\right), \cos \left(\frac{\phi_2 + \phi_1}{2}\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\end{array}
\end{array}
if phi1 < -4.49999999999999988e163Initial program 45.9%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites94.5%
Taylor expanded in phi2 around 0
sin-+PI/2-revN/A
lower-sin.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lower-fma.f6483.9
Applied rewrites83.9%
Taylor expanded in phi1 around 0
lower-*.f64N/A
lift-PI.f6483.6
Applied rewrites83.6%
if -4.49999999999999988e163 < phi1 Initial program 59.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites96.2%
Taylor expanded in phi2 around inf
unpow1N/A
lower-*.f64N/A
lower--.f64N/A
lower-/.f6488.7
Applied rewrites88.7%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 3.75e-121)
(* (hypot phi1 (* (sin (fma 0.5 phi1 (/ PI 2.0))) (- lambda1 lambda2))) R)
(*
(hypot
(* phi2 (- (/ phi1 phi2) 1.0))
(* (cos (/ (+ phi2 phi1) 2.0)) (- lambda1 lambda2)))
R)))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.75e-121) {
tmp = hypot(phi1, (sin(fma(0.5, phi1, (((double) M_PI) / 2.0))) * (lambda1 - lambda2))) * R;
} else {
tmp = hypot((phi2 * ((phi1 / phi2) - 1.0)), (cos(((phi2 + phi1) / 2.0)) * (lambda1 - lambda2))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 3.75e-121) tmp = Float64(hypot(phi1, Float64(sin(fma(0.5, phi1, Float64(pi / 2.0))) * Float64(lambda1 - lambda2))) * R); else tmp = Float64(hypot(Float64(phi2 * Float64(Float64(phi1 / phi2) - 1.0)), Float64(cos(Float64(Float64(phi2 + phi1) / 2.0)) * Float64(lambda1 - lambda2))) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 3.75e-121], N[(N[Sqrt[phi1 ^ 2 + N[(N[Sin[N[(0.5 * phi1 + N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(phi2 * N[(N[(phi1 / phi2), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.75 \cdot 10^{-121}:\\
\;\;\;\;\mathsf{hypot}\left(\phi_1, \sin \left(\mathsf{fma}\left(0.5, \phi_1, \frac{\pi}{2}\right)\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\phi_2 \cdot \left(\frac{\phi_1}{\phi_2} - 1\right), \cos \left(\frac{\phi_2 + \phi_1}{2}\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 3.75000000000000013e-121Initial program 61.2%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites97.5%
Taylor expanded in phi2 around 0
sin-+PI/2-revN/A
lower-sin.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lower-fma.f6483.0
Applied rewrites83.0%
Taylor expanded in phi1 around inf
unpow170.2
Applied rewrites70.2%
if 3.75000000000000013e-121 < phi2 Initial program 50.7%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites93.1%
Taylor expanded in phi2 around inf
unpow1N/A
lower-*.f64N/A
lower--.f64N/A
lower-/.f6488.6
Applied rewrites88.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))
(t_1 (cos (/ (+ phi2 phi1) 2.0))))
(if (<= (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))) 2e+153)
(*
R
(sqrt
(fma
(pow (- lambda1 lambda2) 2.0)
(* t_1 t_1)
(pow (- phi1 phi2) 2.0))))
(*
(hypot phi1 (* (sin (fma 0.5 phi1 (/ PI 2.0))) (- lambda1 lambda2)))
R))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
double t_1 = cos(((phi2 + phi1) / 2.0));
double tmp;
if (sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))) <= 2e+153) {
tmp = R * sqrt(fma(pow((lambda1 - lambda2), 2.0), (t_1 * t_1), pow((phi1 - phi2), 2.0)));
} else {
tmp = hypot(phi1, (sin(fma(0.5, phi1, (((double) M_PI) / 2.0))) * (lambda1 - lambda2))) * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) t_1 = cos(Float64(Float64(phi2 + phi1) / 2.0)) tmp = 0.0 if (sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2)))) <= 2e+153) tmp = Float64(R * sqrt(fma((Float64(lambda1 - lambda2) ^ 2.0), Float64(t_1 * t_1), (Float64(phi1 - phi2) ^ 2.0)))); else tmp = Float64(hypot(phi1, Float64(sin(fma(0.5, phi1, Float64(pi / 2.0))) * Float64(lambda1 - lambda2))) * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2e+153], N[(R * N[Sqrt[N[(N[Power[N[(lambda1 - lambda2), $MachinePrecision], 2.0], $MachinePrecision] * N[(t$95$1 * t$95$1), $MachinePrecision] + N[Power[N[(phi1 - phi2), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[phi1 ^ 2 + N[(N[Sin[N[(0.5 * phi1 + N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
t_1 := \cos \left(\frac{\phi_2 + \phi_1}{2}\right)\\
\mathbf{if}\;\sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \leq 2 \cdot 10^{+153}:\\
\;\;\;\;R \cdot \sqrt{\mathsf{fma}\left({\left(\lambda_1 - \lambda_2\right)}^{2}, t\_1 \cdot t\_1, {\left(\phi_1 - \phi_2\right)}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\phi_1, \sin \left(\mathsf{fma}\left(0.5, \phi_1, \frac{\pi}{2}\right)\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\
\end{array}
\end{array}
if (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2)))) < 2e153Initial program 98.9%
lift-+.f64N/A
Applied rewrites98.9%
if 2e153 < (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2)))) Initial program 40.7%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
Applied rewrites94.9%
Taylor expanded in phi2 around 0
sin-+PI/2-revN/A
lower-sin.f64N/A
lift-/.f64N/A
lift-PI.f64N/A
lower-fma.f6480.5
Applied rewrites80.5%
Taylor expanded in phi1 around inf
unpow164.9
Applied rewrites64.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (/ (+ phi2 phi1) 2.0))))
(if (<= lambda2 3.2e+155)
(*
R
(sqrt
(fma
(pow (- lambda1 lambda2) 2.0)
(* t_0 t_0)
(pow (- phi1 phi2) 2.0))))
(* (* R lambda2) (cos (* 0.5 (+ phi2 phi1)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos(((phi2 + phi1) / 2.0));
double tmp;
if (lambda2 <= 3.2e+155) {
tmp = R * sqrt(fma(pow((lambda1 - lambda2), 2.0), (t_0 * t_0), pow((phi1 - phi2), 2.0)));
} else {
tmp = (R * lambda2) * cos((0.5 * (phi2 + phi1)));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(Float64(phi2 + phi1) / 2.0)) tmp = 0.0 if (lambda2 <= 3.2e+155) tmp = Float64(R * sqrt(fma((Float64(lambda1 - lambda2) ^ 2.0), Float64(t_0 * t_0), (Float64(phi1 - phi2) ^ 2.0)))); else tmp = Float64(Float64(R * lambda2) * cos(Float64(0.5 * Float64(phi2 + phi1)))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda2, 3.2e+155], N[(R * N[Sqrt[N[(N[Power[N[(lambda1 - lambda2), $MachinePrecision], 2.0], $MachinePrecision] * N[(t$95$0 * t$95$0), $MachinePrecision] + N[Power[N[(phi1 - phi2), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(R * lambda2), $MachinePrecision] * N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \cos \left(\frac{\phi_2 + \phi_1}{2}\right)\\
\mathbf{if}\;\lambda_2 \leq 3.2 \cdot 10^{+155}:\\
\;\;\;\;R \cdot \sqrt{\mathsf{fma}\left({\left(\lambda_1 - \lambda_2\right)}^{2}, t\_0 \cdot t\_0, {\left(\phi_1 - \phi_2\right)}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(R \cdot \lambda_2\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\\
\end{array}
\end{array}
if lambda2 < 3.20000000000000012e155Initial program 61.4%
lift-+.f64N/A
Applied rewrites61.5%
if 3.20000000000000012e155 < lambda2 Initial program 33.3%
Taylor expanded in lambda2 around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
sin-+PI/2-revN/A
lower-sin.f64N/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-PI.f6433.5
Applied rewrites33.5%
lift-sin.f64N/A
lift-+.f64N/A
lift-fma.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
sin-+PI/2N/A
lower-cos.f64N/A
lower-*.f64N/A
lift-+.f6454.6
Applied rewrites54.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))))
(if (<= lambda2 3.2e+155)
(* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))
(* (* R lambda2) (cos (* 0.5 (+ phi2 phi1)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
double tmp;
if (lambda2 <= 3.2e+155) {
tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
} else {
tmp = (R * lambda2) * cos((0.5 * (phi2 + phi1)));
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
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 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
if (lambda2 <= 3.2d+155) then
tmp = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
else
tmp = (r * lambda2) * cos((0.5d0 * (phi2 + phi1)))
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
double tmp;
if (lambda2 <= 3.2e+155) {
tmp = R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
} else {
tmp = (R * lambda2) * Math.cos((0.5 * (phi2 + phi1)));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) tmp = 0 if lambda2 <= 3.2e+155: tmp = R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))) else: tmp = (R * lambda2) * math.cos((0.5 * (phi2 + phi1))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) tmp = 0.0 if (lambda2 <= 3.2e+155) tmp = Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))); else tmp = Float64(Float64(R * lambda2) * cos(Float64(0.5 * Float64(phi2 + phi1)))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
tmp = 0.0;
if (lambda2 <= 3.2e+155)
tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
else
tmp = (R * lambda2) * cos((0.5 * (phi2 + phi1)));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 3.2e+155], 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], N[(N[(R * lambda2), $MachinePrecision] * N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
\mathbf{if}\;\lambda_2 \leq 3.2 \cdot 10^{+155}:\\
\;\;\;\;R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(R \cdot \lambda_2\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\\
\end{array}
\end{array}
if lambda2 < 3.20000000000000012e155Initial program 61.4%
if 3.20000000000000012e155 < lambda2 Initial program 33.3%
Taylor expanded in lambda2 around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
sin-+PI/2-revN/A
lower-sin.f64N/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-PI.f6433.5
Applied rewrites33.5%
lift-sin.f64N/A
lift-+.f64N/A
lift-fma.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
sin-+PI/2N/A
lower-cos.f64N/A
lower-*.f64N/A
lift-+.f6454.6
Applied rewrites54.6%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (sin (fma 0.5 (+ phi2 phi1) (/ PI 2.0)))))
(if (<= lambda1 -2.7e-144)
(*
(* -1.0 lambda1)
(fma
(/
(fma
(* R lambda2)
t_0
(*
(/
(/ (* (pow (- phi1 phi2) 2.0) R) lambda1)
(sin (fma 0.5 phi1 (/ PI 2.0))))
-0.5))
lambda1)
-1.0
(* t_0 R)))
(* (* R lambda2) (cos (* 0.5 (+ phi2 phi1)))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(fma(0.5, (phi2 + phi1), (((double) M_PI) / 2.0)));
double tmp;
if (lambda1 <= -2.7e-144) {
tmp = (-1.0 * lambda1) * fma((fma((R * lambda2), t_0, ((((pow((phi1 - phi2), 2.0) * R) / lambda1) / sin(fma(0.5, phi1, (((double) M_PI) / 2.0)))) * -0.5)) / lambda1), -1.0, (t_0 * R));
} else {
tmp = (R * lambda2) * cos((0.5 * (phi2 + phi1)));
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = sin(fma(0.5, Float64(phi2 + phi1), Float64(pi / 2.0))) tmp = 0.0 if (lambda1 <= -2.7e-144) tmp = Float64(Float64(-1.0 * lambda1) * fma(Float64(fma(Float64(R * lambda2), t_0, Float64(Float64(Float64(Float64((Float64(phi1 - phi2) ^ 2.0) * R) / lambda1) / sin(fma(0.5, phi1, Float64(pi / 2.0)))) * -0.5)) / lambda1), -1.0, Float64(t_0 * R))); else tmp = Float64(Float64(R * lambda2) * cos(Float64(0.5 * Float64(phi2 + phi1)))); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(0.5 * N[(phi2 + phi1), $MachinePrecision] + N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda1, -2.7e-144], N[(N[(-1.0 * lambda1), $MachinePrecision] * N[(N[(N[(N[(R * lambda2), $MachinePrecision] * t$95$0 + N[(N[(N[(N[(N[Power[N[(phi1 - phi2), $MachinePrecision], 2.0], $MachinePrecision] * R), $MachinePrecision] / lambda1), $MachinePrecision] / N[Sin[N[(0.5 * phi1 + N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision] / lambda1), $MachinePrecision] * -1.0 + N[(t$95$0 * R), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(R * lambda2), $MachinePrecision] * N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \left(\mathsf{fma}\left(0.5, \phi_2 + \phi_1, \frac{\pi}{2}\right)\right)\\
\mathbf{if}\;\lambda_1 \leq -2.7 \cdot 10^{-144}:\\
\;\;\;\;\left(-1 \cdot \lambda_1\right) \cdot \mathsf{fma}\left(\frac{\mathsf{fma}\left(R \cdot \lambda_2, t\_0, \frac{\frac{{\left(\phi_1 - \phi_2\right)}^{2} \cdot R}{\lambda_1}}{\sin \left(\mathsf{fma}\left(0.5, \phi_1, \frac{\pi}{2}\right)\right)} \cdot -0.5\right)}{\lambda_1}, -1, t\_0 \cdot R\right)\\
\mathbf{else}:\\
\;\;\;\;\left(R \cdot \lambda_2\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\\
\end{array}
\end{array}
if lambda1 < -2.69999999999999975e-144Initial program 57.9%
Taylor expanded in lambda1 around -inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites37.5%
Taylor expanded in phi1 around inf
Applied rewrites43.8%
if -2.69999999999999975e-144 < lambda1 Initial program 57.6%
Taylor expanded in lambda2 around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
sin-+PI/2-revN/A
lower-sin.f64N/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-PI.f6412.8
Applied rewrites12.8%
lift-sin.f64N/A
lift-+.f64N/A
lift-fma.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
sin-+PI/2N/A
lower-cos.f64N/A
lower-*.f64N/A
lift-+.f6417.5
Applied rewrites17.5%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (sin (fma 0.5 (+ phi2 phi1) (/ PI 2.0)))) (t_1 (* t_0 R)))
(if (<= lambda2 3.6e+262)
(*
(* -1.0 lambda1)
(fma
(/
(fma
(* R lambda2)
t_0
(*
(/
(/ (* (pow (- phi1 phi2) 2.0) R) lambda1)
(sin (fma 0.5 phi1 (/ PI 2.0))))
-0.5))
lambda1)
-1.0
t_1))
(* (* -1.0 lambda2) (fma (/ (* (* R lambda1) t_0) lambda2) -1.0 t_1)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(fma(0.5, (phi2 + phi1), (((double) M_PI) / 2.0)));
double t_1 = t_0 * R;
double tmp;
if (lambda2 <= 3.6e+262) {
tmp = (-1.0 * lambda1) * fma((fma((R * lambda2), t_0, ((((pow((phi1 - phi2), 2.0) * R) / lambda1) / sin(fma(0.5, phi1, (((double) M_PI) / 2.0)))) * -0.5)) / lambda1), -1.0, t_1);
} else {
tmp = (-1.0 * lambda2) * fma((((R * lambda1) * t_0) / lambda2), -1.0, t_1);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = sin(fma(0.5, Float64(phi2 + phi1), Float64(pi / 2.0))) t_1 = Float64(t_0 * R) tmp = 0.0 if (lambda2 <= 3.6e+262) tmp = Float64(Float64(-1.0 * lambda1) * fma(Float64(fma(Float64(R * lambda2), t_0, Float64(Float64(Float64(Float64((Float64(phi1 - phi2) ^ 2.0) * R) / lambda1) / sin(fma(0.5, phi1, Float64(pi / 2.0)))) * -0.5)) / lambda1), -1.0, t_1)); else tmp = Float64(Float64(-1.0 * lambda2) * fma(Float64(Float64(Float64(R * lambda1) * t_0) / lambda2), -1.0, t_1)); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(0.5 * N[(phi2 + phi1), $MachinePrecision] + N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * R), $MachinePrecision]}, If[LessEqual[lambda2, 3.6e+262], N[(N[(-1.0 * lambda1), $MachinePrecision] * N[(N[(N[(N[(R * lambda2), $MachinePrecision] * t$95$0 + N[(N[(N[(N[(N[Power[N[(phi1 - phi2), $MachinePrecision], 2.0], $MachinePrecision] * R), $MachinePrecision] / lambda1), $MachinePrecision] / N[Sin[N[(0.5 * phi1 + N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision] / lambda1), $MachinePrecision] * -1.0 + t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 * lambda2), $MachinePrecision] * N[(N[(N[(N[(R * lambda1), $MachinePrecision] * t$95$0), $MachinePrecision] / lambda2), $MachinePrecision] * -1.0 + t$95$1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \left(\mathsf{fma}\left(0.5, \phi_2 + \phi_1, \frac{\pi}{2}\right)\right)\\
t_1 := t\_0 \cdot R\\
\mathbf{if}\;\lambda_2 \leq 3.6 \cdot 10^{+262}:\\
\;\;\;\;\left(-1 \cdot \lambda_1\right) \cdot \mathsf{fma}\left(\frac{\mathsf{fma}\left(R \cdot \lambda_2, t\_0, \frac{\frac{{\left(\phi_1 - \phi_2\right)}^{2} \cdot R}{\lambda_1}}{\sin \left(\mathsf{fma}\left(0.5, \phi_1, \frac{\pi}{2}\right)\right)} \cdot -0.5\right)}{\lambda_1}, -1, t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-1 \cdot \lambda_2\right) \cdot \mathsf{fma}\left(\frac{\left(R \cdot \lambda_1\right) \cdot t\_0}{\lambda_2}, -1, t\_1\right)\\
\end{array}
\end{array}
if lambda2 < 3.59999999999999992e262Initial program 59.1%
Taylor expanded in lambda1 around -inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites25.2%
Taylor expanded in phi1 around inf
Applied rewrites25.9%
if 3.59999999999999992e262 < lambda2 Initial program 29.4%
Taylor expanded in lambda2 around -inf
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
Applied rewrites34.1%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (sin (fma 0.5 (+ phi2 phi1) (/ PI 2.0)))))
(*
(* -1.0 lambda1)
(fma
(/
(fma
(* R lambda2)
t_0
(*
(/
(/ (* (pow (- phi1 phi2) 2.0) R) lambda1)
(sin (fma 0.5 phi1 (/ PI 2.0))))
-0.5))
lambda1)
-1.0
(* t_0 R)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin(fma(0.5, (phi2 + phi1), (((double) M_PI) / 2.0)));
return (-1.0 * lambda1) * fma((fma((R * lambda2), t_0, ((((pow((phi1 - phi2), 2.0) * R) / lambda1) / sin(fma(0.5, phi1, (((double) M_PI) / 2.0)))) * -0.5)) / lambda1), -1.0, (t_0 * R));
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) t_0 = sin(fma(0.5, Float64(phi2 + phi1), Float64(pi / 2.0))) return Float64(Float64(-1.0 * lambda1) * fma(Float64(fma(Float64(R * lambda2), t_0, Float64(Float64(Float64(Float64((Float64(phi1 - phi2) ^ 2.0) * R) / lambda1) / sin(fma(0.5, phi1, Float64(pi / 2.0)))) * -0.5)) / lambda1), -1.0, Float64(t_0 * R))) end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(0.5 * N[(phi2 + phi1), $MachinePrecision] + N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, N[(N[(-1.0 * lambda1), $MachinePrecision] * N[(N[(N[(N[(R * lambda2), $MachinePrecision] * t$95$0 + N[(N[(N[(N[(N[Power[N[(phi1 - phi2), $MachinePrecision], 2.0], $MachinePrecision] * R), $MachinePrecision] / lambda1), $MachinePrecision] / N[Sin[N[(0.5 * phi1 + N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision] / lambda1), $MachinePrecision] * -1.0 + N[(t$95$0 * R), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
t_0 := \sin \left(\mathsf{fma}\left(0.5, \phi_2 + \phi_1, \frac{\pi}{2}\right)\right)\\
\left(-1 \cdot \lambda_1\right) \cdot \mathsf{fma}\left(\frac{\mathsf{fma}\left(R \cdot \lambda_2, t\_0, \frac{\frac{{\left(\phi_1 - \phi_2\right)}^{2} \cdot R}{\lambda_1}}{\sin \left(\mathsf{fma}\left(0.5, \phi_1, \frac{\pi}{2}\right)\right)} \cdot -0.5\right)}{\lambda_1}, -1, t\_0 \cdot R\right)
\end{array}
\end{array}
Initial program 57.7%
Taylor expanded in lambda1 around -inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
Applied rewrites24.2%
Taylor expanded in phi1 around inf
Applied rewrites24.8%
herbie shell --seed 2025065
(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))))))