
(FPCore (x) :precision binary64 (asinh x))
double code(double x) {
return asinh(x);
}
def code(x): return math.asinh(x)
function code(x) return asinh(x) end
function tmp = code(x) tmp = asinh(x); end
code[x_] := N[ArcSinh[x], $MachinePrecision]
\begin{array}{l}
\\
\sinh^{-1} x
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (copysign (log (+ (fabs x) (sqrt (+ (* x x) 1.0)))) x))
double code(double x) {
return copysign(log((fabs(x) + sqrt(((x * x) + 1.0)))), x);
}
public static double code(double x) {
return Math.copySign(Math.log((Math.abs(x) + Math.sqrt(((x * x) + 1.0)))), x);
}
def code(x): return math.copysign(math.log((math.fabs(x) + math.sqrt(((x * x) + 1.0)))), x)
function code(x) return copysign(log(Float64(abs(x) + sqrt(Float64(Float64(x * x) + 1.0)))), x) end
function tmp = code(x) tmp = sign(x) * abs(log((abs(x) + sqrt(((x * x) + 1.0))))); end
code[x_] := N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] + N[Sqrt[N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
\begin{array}{l}
\\
\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right)
\end{array}
(FPCore (x)
:precision binary64
(let* ((t_0 (copysign (log (+ (fabs x) (sqrt (+ (* x x) 1.0)))) x)))
(if (<= t_0 -0.4)
(copysign (- (log (- (hypot 1.0 x) x))) x)
(if (<= t_0 5e-13)
(copysign (- x (* 0.16666666666666666 (pow x 3.0))) x)
(copysign (log (+ x (hypot 1.0 x))) x)))))
double code(double x) {
double t_0 = copysign(log((fabs(x) + sqrt(((x * x) + 1.0)))), x);
double tmp;
if (t_0 <= -0.4) {
tmp = copysign(-log((hypot(1.0, x) - x)), x);
} else if (t_0 <= 5e-13) {
tmp = copysign((x - (0.16666666666666666 * pow(x, 3.0))), x);
} else {
tmp = copysign(log((x + hypot(1.0, x))), x);
}
return tmp;
}
public static double code(double x) {
double t_0 = Math.copySign(Math.log((Math.abs(x) + Math.sqrt(((x * x) + 1.0)))), x);
double tmp;
if (t_0 <= -0.4) {
tmp = Math.copySign(-Math.log((Math.hypot(1.0, x) - x)), x);
} else if (t_0 <= 5e-13) {
tmp = Math.copySign((x - (0.16666666666666666 * Math.pow(x, 3.0))), x);
} else {
tmp = Math.copySign(Math.log((x + Math.hypot(1.0, x))), x);
}
return tmp;
}
def code(x): t_0 = math.copysign(math.log((math.fabs(x) + math.sqrt(((x * x) + 1.0)))), x) tmp = 0 if t_0 <= -0.4: tmp = math.copysign(-math.log((math.hypot(1.0, x) - x)), x) elif t_0 <= 5e-13: tmp = math.copysign((x - (0.16666666666666666 * math.pow(x, 3.0))), x) else: tmp = math.copysign(math.log((x + math.hypot(1.0, x))), x) return tmp
function code(x) t_0 = copysign(log(Float64(abs(x) + sqrt(Float64(Float64(x * x) + 1.0)))), x) tmp = 0.0 if (t_0 <= -0.4) tmp = copysign(Float64(-log(Float64(hypot(1.0, x) - x))), x); elseif (t_0 <= 5e-13) tmp = copysign(Float64(x - Float64(0.16666666666666666 * (x ^ 3.0))), x); else tmp = copysign(log(Float64(x + hypot(1.0, x))), x); end return tmp end
function tmp_2 = code(x) t_0 = sign(x) * abs(log((abs(x) + sqrt(((x * x) + 1.0))))); tmp = 0.0; if (t_0 <= -0.4) tmp = sign(x) * abs(-log((hypot(1.0, x) - x))); elseif (t_0 <= 5e-13) tmp = sign(x) * abs((x - (0.16666666666666666 * (x ^ 3.0)))); else tmp = sign(x) * abs(log((x + hypot(1.0, x)))); end tmp_2 = tmp; end
code[x_] := Block[{t$95$0 = N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] + N[Sqrt[N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]}, If[LessEqual[t$95$0, -0.4], N[With[{TMP1 = Abs[(-N[Log[N[(N[Sqrt[1.0 ^ 2 + x ^ 2], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision])], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[t$95$0, 5e-13], N[With[{TMP1 = Abs[N[(x - N[(0.16666666666666666 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x + N[Sqrt[1.0 ^ 2 + x ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right)\\
\mathbf{if}\;t_0 \leq -0.4:\\
\;\;\;\;\mathsf{copysign}\left(-\log \left(\mathsf{hypot}\left(1, x\right) - x\right), x\right)\\
\mathbf{elif}\;t_0 \leq 5 \cdot 10^{-13}:\\
\;\;\;\;\mathsf{copysign}\left(x - 0.16666666666666666 \cdot {x}^{3}, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x + \mathsf{hypot}\left(1, x\right)\right), x\right)\\
\end{array}
\end{array}
if (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) 1)))) x) < -0.40000000000000002Initial program 60.3%
+-commutative60.3%
hypot-1-def100.0%
Simplified100.0%
flip-+1.6%
frac-2neg1.6%
log-div1.6%
Applied egg-rr3.4%
sub-neg3.4%
sub-neg3.4%
fma-udef3.4%
unpow23.4%
associate--r+59.0%
+-inverses100.0%
metadata-eval100.0%
metadata-eval100.0%
metadata-eval100.0%
neg-sub0100.0%
sub-neg100.0%
+-commutative100.0%
distribute-neg-in100.0%
remove-double-neg100.0%
sub-neg100.0%
Simplified100.0%
if -0.40000000000000002 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) 1)))) x) < 4.9999999999999999e-13Initial program 6.7%
+-commutative6.7%
hypot-1-def6.7%
Simplified6.7%
flip-+6.7%
frac-2neg6.7%
log-div6.7%
Applied egg-rr6.7%
sub-neg6.7%
sub-neg6.7%
fma-udef6.7%
unpow26.7%
associate--r+6.7%
+-inverses6.7%
metadata-eval6.7%
metadata-eval6.7%
metadata-eval6.7%
neg-sub06.7%
sub-neg6.7%
+-commutative6.7%
distribute-neg-in6.7%
remove-double-neg6.7%
sub-neg6.7%
Simplified6.7%
Taylor expanded in x around 0 100.0%
if 4.9999999999999999e-13 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) 1)))) x) Initial program 54.5%
+-commutative54.5%
hypot-1-def100.0%
Simplified100.0%
*-un-lft-identity100.0%
*-commutative100.0%
log-prod100.0%
*-un-lft-identity100.0%
*-un-lft-identity100.0%
add-sqr-sqrt100.0%
fabs-sqr100.0%
add-sqr-sqrt100.0%
metadata-eval100.0%
Applied egg-rr100.0%
+-rgt-identity100.0%
Simplified100.0%
Final simplification100.0%
(FPCore (x)
:precision binary64
(if (<= x -1.25)
(copysign (- (log (* x -2.0))) x)
(if (<= x 0.00105)
(copysign (- x (* 0.16666666666666666 (pow x 3.0))) x)
(copysign (log (+ x (hypot 1.0 x))) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(-log((x * -2.0)), x);
} else if (x <= 0.00105) {
tmp = copysign((x - (0.16666666666666666 * pow(x, 3.0))), x);
} else {
tmp = copysign(log((x + hypot(1.0, x))), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = Math.copySign(-Math.log((x * -2.0)), x);
} else if (x <= 0.00105) {
tmp = Math.copySign((x - (0.16666666666666666 * Math.pow(x, 3.0))), x);
} else {
tmp = Math.copySign(Math.log((x + Math.hypot(1.0, x))), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.25: tmp = math.copysign(-math.log((x * -2.0)), x) elif x <= 0.00105: tmp = math.copysign((x - (0.16666666666666666 * math.pow(x, 3.0))), x) else: tmp = math.copysign(math.log((x + math.hypot(1.0, x))), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.25) tmp = copysign(Float64(-log(Float64(x * -2.0))), x); elseif (x <= 0.00105) tmp = copysign(Float64(x - Float64(0.16666666666666666 * (x ^ 3.0))), x); else tmp = copysign(log(Float64(x + hypot(1.0, x))), x); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (x <= -1.25) tmp = sign(x) * abs(-log((x * -2.0))); elseif (x <= 0.00105) tmp = sign(x) * abs((x - (0.16666666666666666 * (x ^ 3.0)))); else tmp = sign(x) * abs(log((x + hypot(1.0, x)))); end tmp_2 = tmp; end
code[x_] := If[LessEqual[x, -1.25], N[With[{TMP1 = Abs[(-N[Log[N[(x * -2.0), $MachinePrecision]], $MachinePrecision])], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 0.00105], N[With[{TMP1 = Abs[N[(x - N[(0.16666666666666666 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x + N[Sqrt[1.0 ^ 2 + x ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.25:\\
\;\;\;\;\mathsf{copysign}\left(-\log \left(x \cdot -2\right), x\right)\\
\mathbf{elif}\;x \leq 0.00105:\\
\;\;\;\;\mathsf{copysign}\left(x - 0.16666666666666666 \cdot {x}^{3}, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x + \mathsf{hypot}\left(1, x\right)\right), x\right)\\
\end{array}
\end{array}
if x < -1.25Initial program 59.6%
+-commutative59.6%
hypot-1-def100.0%
Simplified100.0%
flip-+0.0%
frac-2neg0.0%
log-div0.0%
Applied egg-rr1.8%
sub-neg1.8%
sub-neg1.8%
fma-udef1.8%
unpow21.8%
associate--r+58.3%
+-inverses100.0%
metadata-eval100.0%
metadata-eval100.0%
metadata-eval100.0%
neg-sub0100.0%
sub-neg100.0%
+-commutative100.0%
distribute-neg-in100.0%
remove-double-neg100.0%
sub-neg100.0%
Simplified100.0%
Taylor expanded in x around -inf 100.0%
*-commutative100.0%
Simplified100.0%
if -1.25 < x < 0.00104999999999999994Initial program 7.4%
+-commutative7.4%
hypot-1-def7.4%
Simplified7.4%
flip-+7.4%
frac-2neg7.4%
log-div7.4%
Applied egg-rr7.4%
sub-neg7.4%
sub-neg7.4%
fma-udef7.4%
unpow27.4%
associate--r+7.4%
+-inverses7.4%
metadata-eval7.4%
metadata-eval7.4%
metadata-eval7.4%
neg-sub07.4%
sub-neg7.4%
+-commutative7.4%
distribute-neg-in7.4%
remove-double-neg7.4%
sub-neg7.4%
Simplified7.4%
Taylor expanded in x around 0 99.5%
if 0.00104999999999999994 < x Initial program 54.5%
+-commutative54.5%
hypot-1-def100.0%
Simplified100.0%
*-un-lft-identity100.0%
*-commutative100.0%
log-prod100.0%
*-un-lft-identity100.0%
*-un-lft-identity100.0%
add-sqr-sqrt100.0%
fabs-sqr100.0%
add-sqr-sqrt100.0%
metadata-eval100.0%
Applied egg-rr100.0%
+-rgt-identity100.0%
Simplified100.0%
Final simplification99.7%
(FPCore (x) :precision binary64 (if (<= x -1.25) (copysign (- (log (* x -2.0))) x) (if (<= x 0.8) (copysign x x) (copysign (log (+ (+ x x) (/ 0.5 x))) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(-log((x * -2.0)), x);
} else if (x <= 0.8) {
tmp = copysign(x, x);
} else {
tmp = copysign(log(((x + x) + (0.5 / x))), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = Math.copySign(-Math.log((x * -2.0)), x);
} else if (x <= 0.8) {
tmp = Math.copySign(x, x);
} else {
tmp = Math.copySign(Math.log(((x + x) + (0.5 / x))), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.25: tmp = math.copysign(-math.log((x * -2.0)), x) elif x <= 0.8: tmp = math.copysign(x, x) else: tmp = math.copysign(math.log(((x + x) + (0.5 / x))), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.25) tmp = copysign(Float64(-log(Float64(x * -2.0))), x); elseif (x <= 0.8) tmp = copysign(x, x); else tmp = copysign(log(Float64(Float64(x + x) + Float64(0.5 / x))), x); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (x <= -1.25) tmp = sign(x) * abs(-log((x * -2.0))); elseif (x <= 0.8) tmp = sign(x) * abs(x); else tmp = sign(x) * abs(log(((x + x) + (0.5 / x)))); end tmp_2 = tmp; end
code[x_] := If[LessEqual[x, -1.25], N[With[{TMP1 = Abs[(-N[Log[N[(x * -2.0), $MachinePrecision]], $MachinePrecision])], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 0.8], N[With[{TMP1 = Abs[x], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(N[(x + x), $MachinePrecision] + N[(0.5 / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.25:\\
\;\;\;\;\mathsf{copysign}\left(-\log \left(x \cdot -2\right), x\right)\\
\mathbf{elif}\;x \leq 0.8:\\
\;\;\;\;\mathsf{copysign}\left(x, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(\left(x + x\right) + \frac{0.5}{x}\right), x\right)\\
\end{array}
\end{array}
if x < -1.25Initial program 59.6%
+-commutative59.6%
hypot-1-def100.0%
Simplified100.0%
flip-+0.0%
frac-2neg0.0%
log-div0.0%
Applied egg-rr1.8%
sub-neg1.8%
sub-neg1.8%
fma-udef1.8%
unpow21.8%
associate--r+58.3%
+-inverses100.0%
metadata-eval100.0%
metadata-eval100.0%
metadata-eval100.0%
neg-sub0100.0%
sub-neg100.0%
+-commutative100.0%
distribute-neg-in100.0%
remove-double-neg100.0%
sub-neg100.0%
Simplified100.0%
Taylor expanded in x around -inf 100.0%
*-commutative100.0%
Simplified100.0%
if -1.25 < x < 0.80000000000000004Initial program 8.8%
+-commutative8.8%
hypot-1-def8.8%
Simplified8.8%
Taylor expanded in x around 0 6.9%
rem-square-sqrt3.5%
fabs-sqr3.5%
rem-square-sqrt6.9%
Simplified6.9%
Taylor expanded in x around 0 98.3%
if 0.80000000000000004 < x Initial program 53.1%
+-commutative53.1%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around inf 98.9%
rem-square-sqrt98.9%
fabs-sqr98.9%
rem-square-sqrt98.9%
associate-+r+98.9%
associate-*r/98.9%
metadata-eval98.9%
Simplified98.9%
Final simplification98.8%
(FPCore (x)
:precision binary64
(if (<= x -1.25)
(copysign (- (log (* x -2.0))) x)
(if (<= x 0.95)
(copysign (- x (* 0.16666666666666666 (pow x 3.0))) x)
(copysign (log (+ (+ x x) (/ 0.5 x))) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(-log((x * -2.0)), x);
} else if (x <= 0.95) {
tmp = copysign((x - (0.16666666666666666 * pow(x, 3.0))), x);
} else {
tmp = copysign(log(((x + x) + (0.5 / x))), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = Math.copySign(-Math.log((x * -2.0)), x);
} else if (x <= 0.95) {
tmp = Math.copySign((x - (0.16666666666666666 * Math.pow(x, 3.0))), x);
} else {
tmp = Math.copySign(Math.log(((x + x) + (0.5 / x))), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.25: tmp = math.copysign(-math.log((x * -2.0)), x) elif x <= 0.95: tmp = math.copysign((x - (0.16666666666666666 * math.pow(x, 3.0))), x) else: tmp = math.copysign(math.log(((x + x) + (0.5 / x))), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.25) tmp = copysign(Float64(-log(Float64(x * -2.0))), x); elseif (x <= 0.95) tmp = copysign(Float64(x - Float64(0.16666666666666666 * (x ^ 3.0))), x); else tmp = copysign(log(Float64(Float64(x + x) + Float64(0.5 / x))), x); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (x <= -1.25) tmp = sign(x) * abs(-log((x * -2.0))); elseif (x <= 0.95) tmp = sign(x) * abs((x - (0.16666666666666666 * (x ^ 3.0)))); else tmp = sign(x) * abs(log(((x + x) + (0.5 / x)))); end tmp_2 = tmp; end
code[x_] := If[LessEqual[x, -1.25], N[With[{TMP1 = Abs[(-N[Log[N[(x * -2.0), $MachinePrecision]], $MachinePrecision])], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 0.95], N[With[{TMP1 = Abs[N[(x - N[(0.16666666666666666 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(N[(x + x), $MachinePrecision] + N[(0.5 / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.25:\\
\;\;\;\;\mathsf{copysign}\left(-\log \left(x \cdot -2\right), x\right)\\
\mathbf{elif}\;x \leq 0.95:\\
\;\;\;\;\mathsf{copysign}\left(x - 0.16666666666666666 \cdot {x}^{3}, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(\left(x + x\right) + \frac{0.5}{x}\right), x\right)\\
\end{array}
\end{array}
if x < -1.25Initial program 59.6%
+-commutative59.6%
hypot-1-def100.0%
Simplified100.0%
flip-+0.0%
frac-2neg0.0%
log-div0.0%
Applied egg-rr1.8%
sub-neg1.8%
sub-neg1.8%
fma-udef1.8%
unpow21.8%
associate--r+58.3%
+-inverses100.0%
metadata-eval100.0%
metadata-eval100.0%
metadata-eval100.0%
neg-sub0100.0%
sub-neg100.0%
+-commutative100.0%
distribute-neg-in100.0%
remove-double-neg100.0%
sub-neg100.0%
Simplified100.0%
Taylor expanded in x around -inf 100.0%
*-commutative100.0%
Simplified100.0%
if -1.25 < x < 0.94999999999999996Initial program 8.8%
+-commutative8.8%
hypot-1-def8.8%
Simplified8.8%
flip-+8.7%
frac-2neg8.7%
log-div8.7%
Applied egg-rr8.7%
sub-neg8.7%
sub-neg8.7%
fma-udef8.7%
unpow28.7%
associate--r+8.7%
+-inverses8.7%
metadata-eval8.7%
metadata-eval8.7%
metadata-eval8.7%
neg-sub08.7%
sub-neg8.7%
+-commutative8.7%
distribute-neg-in8.7%
remove-double-neg8.7%
sub-neg8.7%
Simplified8.7%
Taylor expanded in x around 0 98.5%
if 0.94999999999999996 < x Initial program 53.1%
+-commutative53.1%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around inf 98.9%
rem-square-sqrt98.9%
fabs-sqr98.9%
rem-square-sqrt98.9%
associate-+r+98.9%
associate-*r/98.9%
metadata-eval98.9%
Simplified98.9%
Final simplification98.9%
(FPCore (x) :precision binary64 (if (<= x -3.2) (copysign (log (- x)) x) (if (<= x 1.3) (copysign x x) (copysign (log (+ x x)) x))))
double code(double x) {
double tmp;
if (x <= -3.2) {
tmp = copysign(log(-x), x);
} else if (x <= 1.3) {
tmp = copysign(x, x);
} else {
tmp = copysign(log((x + x)), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= -3.2) {
tmp = Math.copySign(Math.log(-x), x);
} else if (x <= 1.3) {
tmp = Math.copySign(x, x);
} else {
tmp = Math.copySign(Math.log((x + x)), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -3.2: tmp = math.copysign(math.log(-x), x) elif x <= 1.3: tmp = math.copysign(x, x) else: tmp = math.copysign(math.log((x + x)), x) return tmp
function code(x) tmp = 0.0 if (x <= -3.2) tmp = copysign(log(Float64(-x)), x); elseif (x <= 1.3) tmp = copysign(x, x); else tmp = copysign(log(Float64(x + x)), x); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (x <= -3.2) tmp = sign(x) * abs(log(-x)); elseif (x <= 1.3) tmp = sign(x) * abs(x); else tmp = sign(x) * abs(log((x + x))); end tmp_2 = tmp; end
code[x_] := If[LessEqual[x, -3.2], N[With[{TMP1 = Abs[N[Log[(-x)], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 1.3], N[With[{TMP1 = Abs[x], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x + x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -3.2:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(-x\right), x\right)\\
\mathbf{elif}\;x \leq 1.3:\\
\;\;\;\;\mathsf{copysign}\left(x, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x + x\right), x\right)\\
\end{array}
\end{array}
if x < -3.2000000000000002Initial program 59.6%
+-commutative59.6%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around -inf 31.6%
mul-1-neg31.6%
Simplified31.6%
if -3.2000000000000002 < x < 1.30000000000000004Initial program 9.4%
+-commutative9.4%
hypot-1-def9.4%
Simplified9.4%
Taylor expanded in x around 0 7.0%
rem-square-sqrt3.6%
fabs-sqr3.6%
rem-square-sqrt7.0%
Simplified7.0%
Taylor expanded in x around 0 97.7%
if 1.30000000000000004 < x Initial program 52.3%
+-commutative52.3%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around inf 99.5%
rem-square-sqrt99.5%
fabs-sqr99.5%
rem-square-sqrt99.5%
Simplified99.5%
Final simplification82.7%
(FPCore (x) :precision binary64 (if (<= x -1.25) (copysign (- (log (* x -2.0))) x) (if (<= x 1.3) (copysign x x) (copysign (log (+ x x)) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(-log((x * -2.0)), x);
} else if (x <= 1.3) {
tmp = copysign(x, x);
} else {
tmp = copysign(log((x + x)), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = Math.copySign(-Math.log((x * -2.0)), x);
} else if (x <= 1.3) {
tmp = Math.copySign(x, x);
} else {
tmp = Math.copySign(Math.log((x + x)), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.25: tmp = math.copysign(-math.log((x * -2.0)), x) elif x <= 1.3: tmp = math.copysign(x, x) else: tmp = math.copysign(math.log((x + x)), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.25) tmp = copysign(Float64(-log(Float64(x * -2.0))), x); elseif (x <= 1.3) tmp = copysign(x, x); else tmp = copysign(log(Float64(x + x)), x); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (x <= -1.25) tmp = sign(x) * abs(-log((x * -2.0))); elseif (x <= 1.3) tmp = sign(x) * abs(x); else tmp = sign(x) * abs(log((x + x))); end tmp_2 = tmp; end
code[x_] := If[LessEqual[x, -1.25], N[With[{TMP1 = Abs[(-N[Log[N[(x * -2.0), $MachinePrecision]], $MachinePrecision])], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 1.3], N[With[{TMP1 = Abs[x], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x + x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.25:\\
\;\;\;\;\mathsf{copysign}\left(-\log \left(x \cdot -2\right), x\right)\\
\mathbf{elif}\;x \leq 1.3:\\
\;\;\;\;\mathsf{copysign}\left(x, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x + x\right), x\right)\\
\end{array}
\end{array}
if x < -1.25Initial program 59.6%
+-commutative59.6%
hypot-1-def100.0%
Simplified100.0%
flip-+0.0%
frac-2neg0.0%
log-div0.0%
Applied egg-rr1.8%
sub-neg1.8%
sub-neg1.8%
fma-udef1.8%
unpow21.8%
associate--r+58.3%
+-inverses100.0%
metadata-eval100.0%
metadata-eval100.0%
metadata-eval100.0%
neg-sub0100.0%
sub-neg100.0%
+-commutative100.0%
distribute-neg-in100.0%
remove-double-neg100.0%
sub-neg100.0%
Simplified100.0%
Taylor expanded in x around -inf 100.0%
*-commutative100.0%
Simplified100.0%
if -1.25 < x < 1.30000000000000004Initial program 9.4%
+-commutative9.4%
hypot-1-def9.4%
Simplified9.4%
Taylor expanded in x around 0 7.0%
rem-square-sqrt3.6%
fabs-sqr3.6%
rem-square-sqrt7.0%
Simplified7.0%
Taylor expanded in x around 0 97.7%
if 1.30000000000000004 < x Initial program 52.3%
+-commutative52.3%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around inf 99.5%
rem-square-sqrt99.5%
fabs-sqr99.5%
rem-square-sqrt99.5%
Simplified99.5%
Final simplification98.7%
(FPCore (x) :precision binary64 (if (<= x -1.0) (copysign (log (- x)) x) (copysign (log1p x) x)))
double code(double x) {
double tmp;
if (x <= -1.0) {
tmp = copysign(log(-x), x);
} else {
tmp = copysign(log1p(x), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= -1.0) {
tmp = Math.copySign(Math.log(-x), x);
} else {
tmp = Math.copySign(Math.log1p(x), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.0: tmp = math.copysign(math.log(-x), x) else: tmp = math.copysign(math.log1p(x), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.0) tmp = copysign(log(Float64(-x)), x); else tmp = copysign(log1p(x), x); end return tmp end
code[x_] := If[LessEqual[x, -1.0], N[With[{TMP1 = Abs[N[Log[(-x)], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[1 + x], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(-x\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(x\right), x\right)\\
\end{array}
\end{array}
if x < -1Initial program 59.6%
+-commutative59.6%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around -inf 31.6%
mul-1-neg31.6%
Simplified31.6%
if -1 < x Initial program 23.2%
+-commutative23.2%
hypot-1-def38.5%
Simplified38.5%
Taylor expanded in x around 0 15.0%
log1p-def76.0%
rem-square-sqrt43.4%
fabs-sqr43.4%
rem-square-sqrt76.0%
Simplified76.0%
Final simplification65.6%
(FPCore (x) :precision binary64 (if (<= x 1.6) (copysign x x) (copysign (log1p x) x)))
double code(double x) {
double tmp;
if (x <= 1.6) {
tmp = copysign(x, x);
} else {
tmp = copysign(log1p(x), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= 1.6) {
tmp = Math.copySign(x, x);
} else {
tmp = Math.copySign(Math.log1p(x), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= 1.6: tmp = math.copysign(x, x) else: tmp = math.copysign(math.log1p(x), x) return tmp
function code(x) tmp = 0.0 if (x <= 1.6) tmp = copysign(x, x); else tmp = copysign(log1p(x), x); end return tmp end
code[x_] := If[LessEqual[x, 1.6], N[With[{TMP1 = Abs[x], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[1 + x], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 1.6:\\
\;\;\;\;\mathsf{copysign}\left(x, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(x\right), x\right)\\
\end{array}
\end{array}
if x < 1.6000000000000001Initial program 25.0%
+-commutative25.0%
hypot-1-def37.6%
Simplified37.6%
Taylor expanded in x around 0 14.7%
rem-square-sqrt2.5%
fabs-sqr2.5%
rem-square-sqrt4.8%
Simplified4.8%
Taylor expanded in x around 0 69.0%
if 1.6000000000000001 < x Initial program 52.3%
+-commutative52.3%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around 0 31.7%
log1p-def31.7%
rem-square-sqrt31.7%
fabs-sqr31.7%
rem-square-sqrt31.7%
Simplified31.7%
Final simplification59.8%
(FPCore (x) :precision binary64 (copysign x x))
double code(double x) {
return copysign(x, x);
}
public static double code(double x) {
return Math.copySign(x, x);
}
def code(x): return math.copysign(x, x)
function code(x) return copysign(x, x) end
function tmp = code(x) tmp = sign(x) * abs(x); end
code[x_] := N[With[{TMP1 = Abs[x], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
\begin{array}{l}
\\
\mathsf{copysign}\left(x, x\right)
\end{array}
Initial program 31.8%
+-commutative31.8%
hypot-1-def52.9%
Simplified52.9%
Taylor expanded in x around 0 18.9%
rem-square-sqrt9.7%
fabs-sqr9.7%
rem-square-sqrt11.5%
Simplified11.5%
Taylor expanded in x around 0 53.3%
Final simplification53.3%
(FPCore (x) :precision binary64 (let* ((t_0 (/ 1.0 (fabs x)))) (copysign (log1p (+ (fabs x) (/ (fabs x) (+ (hypot 1.0 t_0) t_0)))) x)))
double code(double x) {
double t_0 = 1.0 / fabs(x);
return copysign(log1p((fabs(x) + (fabs(x) / (hypot(1.0, t_0) + t_0)))), x);
}
public static double code(double x) {
double t_0 = 1.0 / Math.abs(x);
return Math.copySign(Math.log1p((Math.abs(x) + (Math.abs(x) / (Math.hypot(1.0, t_0) + t_0)))), x);
}
def code(x): t_0 = 1.0 / math.fabs(x) return math.copysign(math.log1p((math.fabs(x) + (math.fabs(x) / (math.hypot(1.0, t_0) + t_0)))), x)
function code(x) t_0 = Float64(1.0 / abs(x)) return copysign(log1p(Float64(abs(x) + Float64(abs(x) / Float64(hypot(1.0, t_0) + t_0)))), x) end
code[x_] := Block[{t$95$0 = N[(1.0 / N[Abs[x], $MachinePrecision]), $MachinePrecision]}, N[With[{TMP1 = Abs[N[Log[1 + N[(N[Abs[x], $MachinePrecision] + N[(N[Abs[x], $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + t$95$0 ^ 2], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{1}{\left|x\right|}\\
\mathsf{copysign}\left(\mathsf{log1p}\left(\left|x\right| + \frac{\left|x\right|}{\mathsf{hypot}\left(1, t_0\right) + t_0}\right), x\right)
\end{array}
\end{array}
herbie shell --seed 2023321
(FPCore (x)
:name "Rust f64::asinh"
:precision binary64
:herbie-target
(copysign (log1p (+ (fabs x) (/ (fabs x) (+ (hypot 1.0 (/ 1.0 (fabs x))) (/ 1.0 (fabs x)))))) x)
(copysign (log (+ (fabs x) (sqrt (+ (* x x) 1.0)))) x))