
(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 11 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+119) (/ (/ 1.0 y) (+ x (* x (* z z)))) (* (/ 1.0 (* x z)) (/ (/ 1.0 y) z))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e+119) {
tmp = (1.0 / y) / (x + (x * (z * z)));
} else {
tmp = (1.0 / (x * z)) * ((1.0 / y) / 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+119) then
tmp = (1.0d0 / y) / (x + (x * (z * z)))
else
tmp = (1.0d0 / (x * z)) * ((1.0d0 / y) / 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+119) {
tmp = (1.0 / y) / (x + (x * (z * z)));
} else {
tmp = (1.0 / (x * z)) * ((1.0 / y) / z);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 5e+119: tmp = (1.0 / y) / (x + (x * (z * z))) else: tmp = (1.0 / (x * z)) * ((1.0 / y) / z) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 5e+119) tmp = Float64(Float64(1.0 / y) / Float64(x + Float64(x * Float64(z * z)))); else tmp = Float64(Float64(1.0 / Float64(x * z)) * Float64(Float64(1.0 / y) / 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+119)
tmp = (1.0 / y) / (x + (x * (z * z)));
else
tmp = (1.0 / (x * z)) * ((1.0 / y) / 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+119], N[(N[(1.0 / y), $MachinePrecision] / N[(x + N[(x * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(x * z), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+119}:\\
\;\;\;\;\frac{\frac{1}{y}}{x + x \cdot \left(z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x \cdot z} \cdot \frac{\frac{1}{y}}{z}\\
\end{array}
\end{array}
if (*.f64 z z) < 4.9999999999999999e119Initial program 98.4%
associate-/r*97.3%
+-commutative97.3%
fma-def97.3%
Simplified97.3%
fma-udef97.3%
+-commutative97.3%
associate-/r*98.4%
associate-/r*98.4%
div-inv98.4%
add-sqr-sqrt98.4%
times-frac99.0%
hypot-1-def99.0%
hypot-1-def99.0%
Applied egg-rr99.0%
frac-times98.4%
*-commutative98.4%
hypot-1-def98.4%
hypot-1-def98.4%
add-sqr-sqrt98.4%
associate-/l*99.6%
div-inv99.6%
+-commutative99.6%
fma-def99.6%
clear-num99.7%
/-rgt-identity99.7%
Applied egg-rr99.7%
fma-udef99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
distribute-rgt-in99.7%
*-un-lft-identity99.7%
Applied egg-rr99.7%
if 4.9999999999999999e119 < (*.f64 z z) Initial program 75.9%
associate-/r*75.9%
+-commutative75.9%
fma-def75.9%
Simplified75.9%
fma-udef75.9%
+-commutative75.9%
associate-/r*75.9%
associate-/r*73.4%
div-inv73.4%
add-sqr-sqrt73.4%
times-frac79.4%
hypot-1-def79.4%
hypot-1-def97.1%
Applied egg-rr97.1%
Taylor expanded in z around inf 76.5%
Taylor expanded in z around inf 95.3%
associate-/r*95.7%
Simplified95.7%
Final simplification98.1%
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 89.4%
associate-/r*88.8%
+-commutative88.8%
fma-def88.8%
Simplified88.8%
fma-udef88.8%
+-commutative88.8%
associate-/r*89.4%
associate-/r*88.5%
div-inv88.4%
add-sqr-sqrt88.4%
times-frac91.2%
hypot-1-def91.2%
hypot-1-def98.3%
Applied egg-rr98.3%
Final simplification98.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 0.001) (/ (/ 1.0 x) y) (* (/ 1.0 (* x z)) (/ (/ 1.0 y) z))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.001) {
tmp = (1.0 / x) / y;
} else {
tmp = (1.0 / (x * z)) * ((1.0 / y) / 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) <= 0.001d0) then
tmp = (1.0d0 / x) / y
else
tmp = (1.0d0 / (x * z)) * ((1.0d0 / y) / 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) <= 0.001) {
tmp = (1.0 / x) / y;
} else {
tmp = (1.0 / (x * z)) * ((1.0 / y) / z);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 0.001: tmp = (1.0 / x) / y else: tmp = (1.0 / (x * z)) * ((1.0 / y) / z) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 0.001) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(Float64(1.0 / Float64(x * z)) * Float64(Float64(1.0 / y) / z)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 0.001)
tmp = (1.0 / x) / y;
else
tmp = (1.0 / (x * z)) * ((1.0 / y) / 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], 0.001], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(N[(1.0 / N[(x * z), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 0.001:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x \cdot z} \cdot \frac{\frac{1}{y}}{z}\\
\end{array}
\end{array}
if (*.f64 z z) < 1e-3Initial program 99.7%
associate-/r*98.2%
+-commutative98.2%
fma-def98.2%
Simplified98.2%
fma-udef98.2%
+-commutative98.2%
associate-/r*99.7%
associate-/r*99.7%
div-inv99.6%
add-sqr-sqrt99.6%
times-frac99.6%
hypot-1-def99.6%
hypot-1-def99.6%
Applied egg-rr99.6%
Taylor expanded in z around 0 97.4%
associate-/l/98.9%
Simplified98.9%
if 1e-3 < (*.f64 z z) Initial program 80.8%
associate-/r*80.8%
+-commutative80.8%
fma-def80.8%
Simplified80.8%
fma-udef80.8%
+-commutative80.8%
associate-/r*80.8%
associate-/r*79.0%
div-inv79.0%
add-sqr-sqrt79.0%
times-frac84.1%
hypot-1-def84.1%
hypot-1-def97.1%
Applied egg-rr97.1%
Taylor expanded in z around inf 70.3%
Taylor expanded in z around inf 94.8%
associate-/r*95.1%
Simplified95.1%
Final simplification96.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 5e+36) (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))) (* (/ 1.0 (* x z)) (/ (/ 1.0 y) z))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e+36) {
tmp = (1.0 / x) / (y * (1.0 + (z * z)));
} else {
tmp = (1.0 / (x * z)) * ((1.0 / y) / 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+36) then
tmp = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
else
tmp = (1.0d0 / (x * z)) * ((1.0d0 / y) / 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+36) {
tmp = (1.0 / x) / (y * (1.0 + (z * z)));
} else {
tmp = (1.0 / (x * z)) * ((1.0 / y) / z);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 5e+36: tmp = (1.0 / x) / (y * (1.0 + (z * z))) else: tmp = (1.0 / (x * z)) * ((1.0 / y) / z) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 5e+36) tmp = Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))); else tmp = Float64(Float64(1.0 / Float64(x * z)) * Float64(Float64(1.0 / y) / 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+36)
tmp = (1.0 / x) / (y * (1.0 + (z * z)));
else
tmp = (1.0 / (x * z)) * ((1.0 / y) / 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+36], N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(x * z), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+36}:\\
\;\;\;\;\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x \cdot z} \cdot \frac{\frac{1}{y}}{z}\\
\end{array}
\end{array}
if (*.f64 z z) < 4.99999999999999977e36Initial program 99.7%
if 4.99999999999999977e36 < (*.f64 z z) Initial program 78.7%
associate-/r*78.7%
+-commutative78.7%
fma-def78.7%
Simplified78.7%
fma-udef78.7%
+-commutative78.7%
associate-/r*78.7%
associate-/r*76.7%
div-inv76.7%
add-sqr-sqrt76.7%
times-frac82.4%
hypot-1-def82.4%
hypot-1-def96.9%
Applied egg-rr96.9%
Taylor expanded in z around inf 70.6%
Taylor expanded in z around inf 95.3%
associate-/r*95.6%
Simplified95.6%
Final simplification97.7%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 0.001) (/ (/ 1.0 x) y) (/ 1.0 (* x (* z (* z y))))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.001) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (z * (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) <= 0.001d0) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (x * (z * (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) <= 0.001) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (z * (z * y)));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 0.001: tmp = (1.0 / x) / y else: tmp = 1.0 / (x * (z * (z * y))) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 0.001) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(x * Float64(z * 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) <= 0.001)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (x * (z * (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], 0.001], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(x * N[(z * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 0.001:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x \cdot \left(z \cdot \left(z \cdot y\right)\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 1e-3Initial program 99.7%
associate-/r*98.2%
+-commutative98.2%
fma-def98.2%
Simplified98.2%
fma-udef98.2%
+-commutative98.2%
associate-/r*99.7%
associate-/r*99.7%
div-inv99.6%
add-sqr-sqrt99.6%
times-frac99.6%
hypot-1-def99.6%
hypot-1-def99.6%
Applied egg-rr99.6%
Taylor expanded in z around 0 97.4%
associate-/l/98.9%
Simplified98.9%
if 1e-3 < (*.f64 z z) Initial program 80.8%
associate-/r*80.8%
+-commutative80.8%
fma-def80.8%
Simplified80.8%
Taylor expanded in z around inf 79.9%
unpow279.9%
*-commutative79.9%
associate-*r*89.4%
Simplified89.4%
Final simplification93.7%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 0.001) (/ (/ 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) <= 0.001) {
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) <= 0.001d0) 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) <= 0.001) {
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) <= 0.001: 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) <= 0.001) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(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) <= 0.001)
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], 0.001], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(z * N[(x * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 0.001:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \left(x \cdot \left(z \cdot y\right)\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 1e-3Initial program 99.7%
associate-/r*98.2%
+-commutative98.2%
fma-def98.2%
Simplified98.2%
fma-udef98.2%
+-commutative98.2%
associate-/r*99.7%
associate-/r*99.7%
div-inv99.6%
add-sqr-sqrt99.6%
times-frac99.6%
hypot-1-def99.6%
hypot-1-def99.6%
Applied egg-rr99.6%
Taylor expanded in z around 0 97.4%
associate-/l/98.9%
Simplified98.9%
if 1e-3 < (*.f64 z z) Initial program 80.8%
associate-/r*80.8%
+-commutative80.8%
fma-def80.8%
Simplified80.8%
fma-udef80.8%
+-commutative80.8%
associate-/r*80.8%
associate-/r*79.0%
div-inv79.0%
add-sqr-sqrt79.0%
times-frac84.1%
hypot-1-def84.1%
hypot-1-def97.1%
Applied egg-rr97.1%
frac-times79.0%
*-commutative79.0%
hypot-1-def79.0%
hypot-1-def79.0%
add-sqr-sqrt79.0%
associate-/l*80.1%
div-inv80.1%
+-commutative80.1%
fma-def80.1%
clear-num80.2%
/-rgt-identity80.2%
Applied egg-rr80.2%
fma-udef80.2%
+-commutative80.2%
*-commutative80.2%
+-commutative80.2%
distribute-rgt-in80.2%
*-un-lft-identity80.2%
Applied egg-rr80.2%
Taylor expanded in z around inf 79.1%
*-commutative79.1%
unpow279.1%
associate-*r*85.3%
*-commutative85.3%
associate-*r*94.7%
associate-*l*94.8%
Simplified94.8%
Final simplification96.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 0.001) (/ (/ 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) <= 0.001) {
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) <= 0.001d0) 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) <= 0.001) {
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) <= 0.001: 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) <= 0.001) 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) <= 0.001)
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], 0.001], 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 0.001:\\
\;\;\;\;\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) < 1e-3Initial program 99.7%
associate-/r*98.2%
+-commutative98.2%
fma-def98.2%
Simplified98.2%
fma-udef98.2%
+-commutative98.2%
associate-/r*99.7%
associate-/r*99.7%
div-inv99.6%
add-sqr-sqrt99.6%
times-frac99.6%
hypot-1-def99.6%
hypot-1-def99.6%
Applied egg-rr99.6%
Taylor expanded in z around 0 97.4%
associate-/l/98.9%
Simplified98.9%
if 1e-3 < (*.f64 z z) Initial program 80.8%
associate-/r*80.8%
+-commutative80.8%
fma-def80.8%
Simplified80.8%
Taylor expanded in z around inf 79.1%
unpow279.1%
*-commutative79.1%
associate-*l*78.8%
*-commutative78.8%
associate-*l*85.4%
Simplified85.4%
Taylor expanded in z around 0 94.8%
Final simplification96.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= z 1.0) (/ (/ 1.0 x) y) (/ 1.0 (* x (* y (* z z))))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if (z <= 1.0) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (y * (z * 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 <= 1.0d0) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (x * (y * (z * z)))
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) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (y * (z * z)));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if z <= 1.0: tmp = (1.0 / x) / y else: tmp = 1.0 / (x * (y * (z * z))) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (z <= 1.0) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(x * Float64(y * Float64(z * z)))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (z <= 1.0)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (x * (y * (z * 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[z, 1.0], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(x * N[(y * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 1:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x \cdot \left(y \cdot \left(z \cdot z\right)\right)}\\
\end{array}
\end{array}
if z < 1Initial program 93.9%
associate-/r*93.0%
+-commutative93.0%
fma-def93.0%
Simplified93.0%
fma-udef93.0%
+-commutative93.0%
associate-/r*93.9%
associate-/r*93.3%
div-inv93.2%
add-sqr-sqrt93.2%
times-frac94.8%
hypot-1-def94.8%
hypot-1-def99.2%
Applied egg-rr99.2%
Taylor expanded in z around 0 67.9%
associate-/l/68.8%
Simplified68.8%
if 1 < z Initial program 75.7%
associate-/r*75.7%
+-commutative75.7%
fma-def75.7%
Simplified75.7%
Taylor expanded in z around inf 74.8%
unpow274.8%
Simplified74.8%
Final simplification70.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= z 1.0) (/ (/ 1.0 x) y) (/ 1.0 (* y (* x z)))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if (z <= 1.0) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (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 <= 1.0d0) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (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 <= 1.0) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (y * (x * z));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if z <= 1.0: tmp = (1.0 / x) / y else: tmp = 1.0 / (y * (x * z)) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (z <= 1.0) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / 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 <= 1.0)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (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[z, 1.0], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 1:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y \cdot \left(x \cdot z\right)}\\
\end{array}
\end{array}
if z < 1Initial program 93.9%
associate-/r*93.0%
+-commutative93.0%
fma-def93.0%
Simplified93.0%
fma-udef93.0%
+-commutative93.0%
associate-/r*93.9%
associate-/r*93.3%
div-inv93.2%
add-sqr-sqrt93.2%
times-frac94.8%
hypot-1-def94.8%
hypot-1-def99.2%
Applied egg-rr99.2%
Taylor expanded in z around 0 67.9%
associate-/l/68.8%
Simplified68.8%
if 1 < z Initial program 75.7%
associate-/r*75.7%
+-commutative75.7%
fma-def75.7%
Simplified75.7%
fma-udef75.7%
+-commutative75.7%
associate-/r*75.7%
associate-/r*73.7%
div-inv73.7%
add-sqr-sqrt73.7%
times-frac80.2%
hypot-1-def80.2%
hypot-1-def95.3%
Applied egg-rr95.3%
Taylor expanded in z around inf 94.3%
Taylor expanded in z around 0 44.8%
Final simplification62.9%
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 89.4%
associate-/r*88.8%
+-commutative88.8%
fma-def88.8%
Simplified88.8%
Taylor expanded in z around 0 59.1%
Final simplification59.1%
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(Float64(1.0 / 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[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{1}{x}}{y}
\end{array}
Initial program 89.4%
associate-/r*88.8%
+-commutative88.8%
fma-def88.8%
Simplified88.8%
fma-udef88.8%
+-commutative88.8%
associate-/r*89.4%
associate-/r*88.5%
div-inv88.4%
add-sqr-sqrt88.4%
times-frac91.2%
hypot-1-def91.2%
hypot-1-def98.3%
Applied egg-rr98.3%
Taylor expanded in z around 0 59.1%
associate-/l/59.8%
Simplified59.8%
Final simplification59.8%
(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 2023242
(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)))))