
(FPCore (x y) :precision binary64 (sqrt (fabs (- x y))))
double code(double x, double y) {
return sqrt(fabs((x - y)));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = sqrt(abs((x - y)))
end function
public static double code(double x, double y) {
return Math.sqrt(Math.abs((x - y)));
}
def code(x, y): return math.sqrt(math.fabs((x - y)))
function code(x, y) return sqrt(abs(Float64(x - y))) end
function tmp = code(x, y) tmp = sqrt(abs((x - y))); end
code[x_, y_] := N[Sqrt[N[Abs[N[(x - y), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left|x - y\right|}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 2 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y) :precision binary64 (sqrt (fabs (- x y))))
double code(double x, double y) {
return sqrt(fabs((x - y)));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = sqrt(abs((x - y)))
end function
public static double code(double x, double y) {
return Math.sqrt(Math.abs((x - y)));
}
def code(x, y): return math.sqrt(math.fabs((x - y)))
function code(x, y) return sqrt(abs(Float64(x - y))) end
function tmp = code(x, y) tmp = sqrt(abs((x - y))); end
code[x_, y_] := N[Sqrt[N[Abs[N[(x - y), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left|x - y\right|}
\end{array}
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (sqrt (- y x)))
assert(x < y);
double code(double x, double y) {
return sqrt((y - x));
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = sqrt((y - x))
end function
assert x < y;
public static double code(double x, double y) {
return Math.sqrt((y - x));
}
[x, y] = sort([x, y]) def code(x, y): return math.sqrt((y - x))
x, y = sort([x, y]) function code(x, y) return sqrt(Float64(y - x)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = sqrt((y - x));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[Sqrt[N[(y - x), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\sqrt{y - x}
\end{array}
Initial program 100.0%
fabs-sub100.0%
Simplified100.0%
add-log-exp9.3%
*-un-lft-identity9.3%
log-prod9.3%
metadata-eval9.3%
add-log-exp100.0%
add-sqr-sqrt50.8%
fabs-sqr50.8%
add-sqr-sqrt50.8%
Applied egg-rr50.8%
+-lft-identity50.8%
Simplified50.8%
Final simplification50.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (sqrt y))
assert(x < y);
double code(double x, double y) {
return sqrt(y);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = sqrt(y)
end function
assert x < y;
public static double code(double x, double y) {
return Math.sqrt(y);
}
[x, y] = sort([x, y]) def code(x, y): return math.sqrt(y)
x, y = sort([x, y]) function code(x, y) return sqrt(y) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = sqrt(y);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[Sqrt[y], $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\sqrt{y}
\end{array}
Initial program 100.0%
fabs-sub100.0%
Simplified100.0%
add-cbrt-cube71.0%
pow1/366.2%
add-sqr-sqrt66.2%
pow166.2%
pow1/266.2%
pow-prod-up66.2%
add-sqr-sqrt34.5%
fabs-sqr34.5%
add-sqr-sqrt34.5%
metadata-eval34.5%
Applied egg-rr34.5%
unpow1/337.0%
Simplified37.0%
Taylor expanded in y around inf 24.0%
Final simplification24.0%
herbie shell --seed 2024057
(FPCore (x y)
:name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, C"
:precision binary64
(sqrt (fabs (- x y))))