
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 5e+302) (/ (/ (/ 1.0 x) y) (+ 1.0 (* z z))) (/ (/ (/ 1.0 z) y) (* x z))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e+302) {
tmp = ((1.0 / x) / y) / (1.0 + (z * z));
} else {
tmp = ((1.0 / z) / y) / (x * z);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 5d+302) then
tmp = ((1.0d0 / x) / y) / (1.0d0 + (z * z))
else
tmp = ((1.0d0 / z) / y) / (x * z)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e+302) {
tmp = ((1.0 / x) / y) / (1.0 + (z * z));
} else {
tmp = ((1.0 / z) / y) / (x * z);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 5e+302: tmp = ((1.0 / x) / y) / (1.0 + (z * z)) else: tmp = ((1.0 / z) / y) / (x * z) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 5e+302) tmp = Float64(Float64(Float64(1.0 / x) / y) / Float64(1.0 + Float64(z * z))); else tmp = Float64(Float64(Float64(1.0 / z) / y) / Float64(x * z)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 5e+302)
tmp = ((1.0 / x) / y) / (1.0 + (z * z));
else
tmp = ((1.0 / z) / y) / (x * z);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 5e+302], N[(N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision] / N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / z), $MachinePrecision] / y), $MachinePrecision] / N[(x * z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+302}:\\
\;\;\;\;\frac{\frac{\frac{1}{x}}{y}}{1 + z \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{z}}{y}}{x \cdot z}\\
\end{array}
\end{array}
if (*.f64 z z) < 5e302Initial program 97.2%
associate-/r*97.7%
Simplified97.7%
if 5e302 < (*.f64 z z) Initial program 78.9%
associate-/r*78.9%
+-commutative78.9%
fma-def78.9%
Simplified78.9%
Taylor expanded in z around inf 78.9%
unpow278.9%
*-commutative78.9%
associate-*l*78.6%
*-commutative78.6%
associate-*l*90.7%
Simplified90.7%
associate-/r*90.7%
div-inv90.7%
*-commutative90.7%
*-commutative90.7%
associate-*l*96.7%
Applied egg-rr96.7%
un-div-inv98.1%
*-commutative98.1%
associate-*r*98.1%
associate-/r*99.9%
Applied egg-rr99.9%
Final simplification98.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* (/ (/ 1.0 x) (hypot 1.0 z)) (/ (/ 1.0 y) (hypot 1.0 z))))
assert(x < y);
double code(double x, double y, double z) {
return ((1.0 / x) / hypot(1.0, z)) * ((1.0 / y) / hypot(1.0, z));
}
assert x < y;
public static double code(double x, double y, double z) {
return ((1.0 / x) / Math.hypot(1.0, z)) * ((1.0 / y) / Math.hypot(1.0, z));
}
[x, y] = sort([x, y]) def code(x, y, z): return ((1.0 / x) / math.hypot(1.0, z)) * ((1.0 / y) / math.hypot(1.0, z))
x, y = sort([x, y]) function code(x, y, z) return Float64(Float64(Float64(1.0 / x) / hypot(1.0, z)) * Float64(Float64(1.0 / y) / hypot(1.0, z))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
tmp = ((1.0 / x) / hypot(1.0, z)) * ((1.0 / y) / hypot(1.0, z));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(N[(N[(1.0 / x), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / y), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{1}{x}}{\mathsf{hypot}\left(1, z\right)} \cdot \frac{\frac{1}{y}}{\mathsf{hypot}\left(1, z\right)}
\end{array}
Initial program 92.7%
associate-/r*92.4%
+-commutative92.4%
fma-def92.4%
Simplified92.4%
fma-udef92.4%
+-commutative92.4%
associate-/r*92.7%
associate-/r*93.0%
div-inv92.9%
add-sqr-sqrt92.9%
times-frac92.5%
hypot-1-def92.5%
hypot-1-def97.7%
Applied egg-rr97.7%
Final simplification97.7%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (/ (/ (/ 1.0 y) (* x (hypot 1.0 z))) (hypot 1.0 z)))
assert(x < y);
double code(double x, double y, double z) {
return ((1.0 / y) / (x * hypot(1.0, z))) / hypot(1.0, z);
}
assert x < y;
public static double code(double x, double y, double z) {
return ((1.0 / y) / (x * Math.hypot(1.0, z))) / Math.hypot(1.0, z);
}
[x, y] = sort([x, y]) def code(x, y, z): return ((1.0 / y) / (x * math.hypot(1.0, z))) / math.hypot(1.0, z)
x, y = sort([x, y]) function code(x, y, z) return Float64(Float64(Float64(1.0 / y) / Float64(x * hypot(1.0, z))) / hypot(1.0, z)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
tmp = ((1.0 / y) / (x * hypot(1.0, z))) / hypot(1.0, z);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(N[(N[(1.0 / y), $MachinePrecision] / N[(x * N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{\frac{1}{y}}{x \cdot \mathsf{hypot}\left(1, z\right)}}{\mathsf{hypot}\left(1, z\right)}
\end{array}
Initial program 92.7%
associate-/r*92.4%
+-commutative92.4%
fma-def92.4%
Simplified92.4%
fma-udef92.4%
+-commutative92.4%
associate-/r*92.7%
associate-/r*93.0%
add-sqr-sqrt93.0%
*-un-lft-identity93.0%
times-frac92.9%
hypot-1-def93.0%
associate-/l/93.0%
hypot-1-def95.9%
Applied egg-rr95.9%
associate-*l/95.9%
*-lft-identity95.9%
associate-/r*95.9%
associate-/l/96.7%
*-commutative96.7%
Simplified96.7%
Final simplification96.7%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 20000000000000.0) (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))) (/ (/ 1.0 z) (* x (* z y)))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 20000000000000.0) {
tmp = (1.0 / x) / (y * (1.0 + (z * z)));
} else {
tmp = (1.0 / z) / (x * (z * y));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 20000000000000.0d0) then
tmp = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
else
tmp = (1.0d0 / z) / (x * (z * y))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 20000000000000.0) {
tmp = (1.0 / x) / (y * (1.0 + (z * z)));
} else {
tmp = (1.0 / z) / (x * (z * y));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 20000000000000.0: tmp = (1.0 / x) / (y * (1.0 + (z * z))) else: tmp = (1.0 / z) / (x * (z * y)) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 20000000000000.0) tmp = Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))); else tmp = Float64(Float64(1.0 / z) / Float64(x * Float64(z * y))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 20000000000000.0)
tmp = (1.0 / x) / (y * (1.0 + (z * z)));
else
tmp = (1.0 / z) / (x * (z * y));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 20000000000000.0], N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] / N[(x * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 20000000000000:\\
\;\;\;\;\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z}}{x \cdot \left(z \cdot y\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 2e13Initial program 99.7%
if 2e13 < (*.f64 z z) Initial program 85.2%
associate-/r*84.5%
+-commutative84.5%
fma-def84.5%
Simplified84.5%
Taylor expanded in z around inf 83.9%
unpow283.9%
*-commutative83.9%
associate-*l*85.5%
*-commutative85.5%
associate-*l*91.8%
Simplified91.8%
*-un-lft-identity91.8%
associate-/r*92.4%
*-commutative92.4%
*-commutative92.4%
associate-*l*97.1%
Applied egg-rr97.1%
Final simplification98.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (or (<= z -1.0) (not (<= z 1.0))) (/ 1.0 (* x (* z (* z y)))) (/ (/ 1.0 x) y)))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z <= -1.0) || !(z <= 1.0)) {
tmp = 1.0 / (x * (z * (z * y)));
} else {
tmp = (1.0 / x) / y;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z <= (-1.0d0)) .or. (.not. (z <= 1.0d0))) then
tmp = 1.0d0 / (x * (z * (z * y)))
else
tmp = (1.0d0 / x) / y
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z <= -1.0) || !(z <= 1.0)) {
tmp = 1.0 / (x * (z * (z * y)));
} else {
tmp = (1.0 / x) / y;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z <= -1.0) or not (z <= 1.0): tmp = 1.0 / (x * (z * (z * y))) else: tmp = (1.0 / x) / y return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if ((z <= -1.0) || !(z <= 1.0)) tmp = Float64(1.0 / Float64(x * Float64(z * Float64(z * y)))); else tmp = Float64(Float64(1.0 / x) / y); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z <= -1.0) || ~((z <= 1.0)))
tmp = 1.0 / (x * (z * (z * y)));
else
tmp = (1.0 / x) / y;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[Or[LessEqual[z, -1.0], N[Not[LessEqual[z, 1.0]], $MachinePrecision]], N[(1.0 / N[(x * N[(z * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1 \lor \neg \left(z \leq 1\right):\\
\;\;\;\;\frac{1}{x \cdot \left(z \cdot \left(z \cdot y\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\end{array}
\end{array}
if z < -1 or 1 < z Initial program 85.8%
associate-/r*85.2%
+-commutative85.2%
fma-def85.2%
Simplified85.2%
Taylor expanded in z around inf 83.7%
unpow283.7%
associate-*r*91.1%
*-commutative91.1%
Simplified91.1%
if -1 < z < 1Initial program 99.7%
associate-/r*99.7%
+-commutative99.7%
fma-def99.7%
Simplified99.7%
fma-udef99.7%
+-commutative99.7%
associate-/r*99.7%
associate-/r*99.6%
div-inv99.5%
add-sqr-sqrt99.5%
times-frac99.5%
hypot-1-def99.5%
hypot-1-def99.5%
Applied egg-rr99.5%
Taylor expanded in z around 0 99.4%
associate-/l/99.4%
Simplified99.4%
Final simplification95.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 5e-10) (/ (/ 1.0 x) y) (/ 1.0 (* z (* y (* x z))))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e-10) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (z * (y * (x * z)));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 5d-10) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (z * (y * (x * z)))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e-10) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (z * (y * (x * z)));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 5e-10: tmp = (1.0 / x) / y else: tmp = 1.0 / (z * (y * (x * z))) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 5e-10) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(z * Float64(y * Float64(x * z)))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 5e-10)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (z * (y * (x * z)));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 5e-10], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(z * N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{-10}:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \left(y \cdot \left(x \cdot z\right)\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 5.00000000000000031e-10Initial program 99.7%
associate-/r*99.7%
+-commutative99.7%
fma-def99.7%
Simplified99.7%
fma-udef99.7%
+-commutative99.7%
associate-/r*99.7%
associate-/r*99.6%
div-inv99.5%
add-sqr-sqrt99.5%
times-frac99.5%
hypot-1-def99.5%
hypot-1-def99.5%
Applied egg-rr99.5%
Taylor expanded in z around 0 99.4%
associate-/l/99.4%
Simplified99.4%
if 5.00000000000000031e-10 < (*.f64 z z) Initial program 85.8%
associate-/r*85.2%
+-commutative85.2%
fma-def85.2%
Simplified85.2%
Taylor expanded in z around inf 83.1%
unpow283.1%
*-commutative83.1%
associate-*l*84.7%
*-commutative84.7%
associate-*l*90.7%
Simplified90.7%
Taylor expanded in z around 0 93.0%
Final simplification96.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 5e-10) (/ (/ 1.0 x) y) (/ (/ (/ 1.0 z) y) (* x z))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e-10) {
tmp = (1.0 / x) / y;
} else {
tmp = ((1.0 / z) / y) / (x * z);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 5d-10) then
tmp = (1.0d0 / x) / y
else
tmp = ((1.0d0 / z) / y) / (x * z)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e-10) {
tmp = (1.0 / x) / y;
} else {
tmp = ((1.0 / z) / y) / (x * z);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 5e-10: tmp = (1.0 / x) / y else: tmp = ((1.0 / z) / y) / (x * z) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 5e-10) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(Float64(Float64(1.0 / z) / y) / Float64(x * z)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 5e-10)
tmp = (1.0 / x) / y;
else
tmp = ((1.0 / z) / y) / (x * z);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 5e-10], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(N[(N[(1.0 / z), $MachinePrecision] / y), $MachinePrecision] / N[(x * z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{-10}:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{z}}{y}}{x \cdot z}\\
\end{array}
\end{array}
if (*.f64 z z) < 5.00000000000000031e-10Initial program 99.7%
associate-/r*99.7%
+-commutative99.7%
fma-def99.7%
Simplified99.7%
fma-udef99.7%
+-commutative99.7%
associate-/r*99.7%
associate-/r*99.6%
div-inv99.5%
add-sqr-sqrt99.5%
times-frac99.5%
hypot-1-def99.5%
hypot-1-def99.5%
Applied egg-rr99.5%
Taylor expanded in z around 0 99.4%
associate-/l/99.4%
Simplified99.4%
if 5.00000000000000031e-10 < (*.f64 z z) Initial program 85.8%
associate-/r*85.2%
+-commutative85.2%
fma-def85.2%
Simplified85.2%
Taylor expanded in z around inf 83.1%
unpow283.1%
*-commutative83.1%
associate-*l*84.7%
*-commutative84.7%
associate-*l*90.7%
Simplified90.7%
associate-/r*91.2%
div-inv91.2%
*-commutative91.2%
*-commutative91.2%
associate-*l*94.6%
Applied egg-rr94.6%
un-div-inv95.7%
*-commutative95.7%
associate-*r*93.6%
associate-/r*93.2%
Applied egg-rr93.2%
Final simplification96.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 5e-10) (/ (/ 1.0 x) y) (/ (/ 1.0 z) (* x (* z y)))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e-10) {
tmp = (1.0 / x) / y;
} else {
tmp = (1.0 / z) / (x * (z * y));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 5d-10) then
tmp = (1.0d0 / x) / y
else
tmp = (1.0d0 / z) / (x * (z * y))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e-10) {
tmp = (1.0 / x) / y;
} else {
tmp = (1.0 / z) / (x * (z * y));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 5e-10: tmp = (1.0 / x) / y else: tmp = (1.0 / z) / (x * (z * y)) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 5e-10) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(Float64(1.0 / z) / Float64(x * Float64(z * y))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 5e-10)
tmp = (1.0 / x) / y;
else
tmp = (1.0 / z) / (x * (z * y));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 5e-10], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] / N[(x * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{-10}:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z}}{x \cdot \left(z \cdot y\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 5.00000000000000031e-10Initial program 99.7%
associate-/r*99.7%
+-commutative99.7%
fma-def99.7%
Simplified99.7%
fma-udef99.7%
+-commutative99.7%
associate-/r*99.7%
associate-/r*99.6%
div-inv99.5%
add-sqr-sqrt99.5%
times-frac99.5%
hypot-1-def99.5%
hypot-1-def99.5%
Applied egg-rr99.5%
Taylor expanded in z around 0 99.4%
associate-/l/99.4%
Simplified99.4%
if 5.00000000000000031e-10 < (*.f64 z z) Initial program 85.8%
associate-/r*85.2%
+-commutative85.2%
fma-def85.2%
Simplified85.2%
Taylor expanded in z around inf 83.1%
unpow283.1%
*-commutative83.1%
associate-*l*84.7%
*-commutative84.7%
associate-*l*90.7%
Simplified90.7%
*-un-lft-identity90.7%
associate-/r*91.2%
*-commutative91.2%
*-commutative91.2%
associate-*l*95.7%
Applied egg-rr95.7%
Final simplification97.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (/ 1.0 (* x y)))
assert(x < y);
double code(double x, double y, double z) {
return 1.0 / (x * y);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 1.0d0 / (x * y)
end function
assert x < y;
public static double code(double x, double y, double z) {
return 1.0 / (x * y);
}
[x, y] = sort([x, y]) def code(x, y, z): return 1.0 / (x * y)
x, y = sort([x, y]) function code(x, y, z) return Float64(1.0 / Float64(x * y)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
tmp = 1.0 / (x * y);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(1.0 / N[(x * y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{1}{x \cdot y}
\end{array}
Initial program 92.7%
associate-/r*92.4%
+-commutative92.4%
fma-def92.4%
Simplified92.4%
Taylor expanded in z around 0 57.1%
Final simplification57.1%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (+ 1.0 (* z z))) (t_1 (* y t_0)) (t_2 (/ (/ 1.0 y) (* t_0 x))))
(if (< t_1 (- INFINITY))
t_2
(if (< t_1 8.680743250567252e+305) (/ (/ 1.0 x) (* t_0 y)) t_2))))
double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -((double) INFINITY)) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
public static double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -Double.POSITIVE_INFINITY) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z): t_0 = 1.0 + (z * z) t_1 = y * t_0 t_2 = (1.0 / y) / (t_0 * x) tmp = 0 if t_1 < -math.inf: tmp = t_2 elif t_1 < 8.680743250567252e+305: tmp = (1.0 / x) / (t_0 * y) else: tmp = t_2 return tmp
function code(x, y, z) t_0 = Float64(1.0 + Float64(z * z)) t_1 = Float64(y * t_0) t_2 = Float64(Float64(1.0 / y) / Float64(t_0 * x)) tmp = 0.0 if (t_1 < Float64(-Inf)) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = Float64(Float64(1.0 / x) / Float64(t_0 * y)); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z) t_0 = 1.0 + (z * z); t_1 = y * t_0; t_2 = (1.0 / y) / (t_0 * x); tmp = 0.0; if (t_1 < -Inf) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = (1.0 / x) / (t_0 * y); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(y * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(1.0 / y), $MachinePrecision] / N[(t$95$0 * x), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$1, (-Infinity)], t$95$2, If[Less[t$95$1, 8.680743250567252e+305], N[(N[(1.0 / x), $MachinePrecision] / N[(t$95$0 * y), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 1 + z \cdot z\\
t_1 := y \cdot t_0\\
t_2 := \frac{\frac{1}{y}}{t_0 \cdot x}\\
\mathbf{if}\;t_1 < -\infty:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t_1 < 8.680743250567252 \cdot 10^{+305}:\\
\;\;\;\;\frac{\frac{1}{x}}{t_0 \cdot y}\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
herbie shell --seed 2023185
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:herbie-target
(if (< (* y (+ 1.0 (* z z))) (- INFINITY)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x)) (if (< (* y (+ 1.0 (* z z))) 8.680743250567252e+305) (/ (/ 1.0 x) (* (+ 1.0 (* z z)) y)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))