
(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 10 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 -5.0)
(copysign (- (log (- (hypot 1.0 x) x))) x)
(if (<= t_0 2e-10)
(copysign (+ x (* (pow x 3.0) -0.16666666666666666)) 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 <= -5.0) {
tmp = copysign(-log((hypot(1.0, x) - x)), x);
} else if (t_0 <= 2e-10) {
tmp = copysign((x + (pow(x, 3.0) * -0.16666666666666666)), 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 <= -5.0) {
tmp = Math.copySign(-Math.log((Math.hypot(1.0, x) - x)), x);
} else if (t_0 <= 2e-10) {
tmp = Math.copySign((x + (Math.pow(x, 3.0) * -0.16666666666666666)), 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 <= -5.0: tmp = math.copysign(-math.log((math.hypot(1.0, x) - x)), x) elif t_0 <= 2e-10: tmp = math.copysign((x + (math.pow(x, 3.0) * -0.16666666666666666)), 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 <= -5.0) tmp = copysign(Float64(-log(Float64(hypot(1.0, x) - x))), x); elseif (t_0 <= 2e-10) tmp = copysign(Float64(x + Float64((x ^ 3.0) * -0.16666666666666666)), 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 <= -5.0) tmp = sign(x) * abs(-log((hypot(1.0, x) - x))); elseif (t_0 <= 2e-10) tmp = sign(x) * abs((x + ((x ^ 3.0) * -0.16666666666666666))); 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, -5.0], 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, 2e-10], N[With[{TMP1 = Abs[N[(x + N[(N[Power[x, 3.0], $MachinePrecision] * -0.16666666666666666), $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 -5:\\
\;\;\;\;\mathsf{copysign}\left(-\log \left(\mathsf{hypot}\left(1, x\right) - x\right), x\right)\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-10}:\\
\;\;\;\;\mathsf{copysign}\left(x + {x}^{3} \cdot -0.16666666666666666, 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) < -5Initial program 42.2%
+-commutative42.2%
hypot-1-def100.0%
Simplified100.0%
flip-+1.3%
frac-2neg1.3%
log-div1.3%
Applied egg-rr2.7%
sub-neg2.7%
sub-neg2.7%
fma-udef2.7%
unpow22.7%
associate--r+40.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%
if -5 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) 1)))) x) < 2.00000000000000007e-10Initial program 7.0%
+-commutative7.0%
hypot-1-def7.0%
Simplified7.0%
*-un-lft-identity7.0%
*-commutative7.0%
log-prod7.0%
add-sqr-sqrt3.0%
fabs-sqr3.0%
add-sqr-sqrt7.1%
metadata-eval7.1%
Applied egg-rr7.1%
+-rgt-identity7.1%
Simplified7.1%
Taylor expanded in x around 0 100.0%
*-commutative100.0%
Simplified100.0%
if 2.00000000000000007e-10 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) 1)))) x) Initial program 50.8%
+-commutative50.8%
hypot-1-def100.0%
Simplified100.0%
*-un-lft-identity100.0%
*-commutative100.0%
log-prod100.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 (- (fabs x) x)) x)
(if (<= x 0.00092)
(copysign (+ x (* (pow x 3.0) -0.16666666666666666)) x)
(copysign (log (+ x (hypot 1.0 x))) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(log((fabs(x) - x)), x);
} else if (x <= 0.00092) {
tmp = copysign((x + (pow(x, 3.0) * -0.16666666666666666)), 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((Math.abs(x) - x)), x);
} else if (x <= 0.00092) {
tmp = Math.copySign((x + (Math.pow(x, 3.0) * -0.16666666666666666)), 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((math.fabs(x) - x)), x) elif x <= 0.00092: tmp = math.copysign((x + (math.pow(x, 3.0) * -0.16666666666666666)), 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(log(Float64(abs(x) - x)), x); elseif (x <= 0.00092) tmp = copysign(Float64(x + Float64((x ^ 3.0) * -0.16666666666666666)), 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((abs(x) - x))); elseif (x <= 0.00092) tmp = sign(x) * abs((x + ((x ^ 3.0) * -0.16666666666666666))); 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[(N[Abs[x], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 0.00092], N[With[{TMP1 = Abs[N[(x + N[(N[Power[x, 3.0], $MachinePrecision] * -0.16666666666666666), $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(\left|x\right| - x\right), x\right)\\
\mathbf{elif}\;x \leq 0.00092:\\
\;\;\;\;\mathsf{copysign}\left(x + {x}^{3} \cdot -0.16666666666666666, 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 42.2%
+-commutative42.2%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around -inf 99.2%
mul-1-neg99.2%
unsub-neg99.2%
Simplified99.2%
if -1.25 < x < 9.2000000000000003e-4Initial program 7.0%
+-commutative7.0%
hypot-1-def7.0%
Simplified7.0%
*-un-lft-identity7.0%
*-commutative7.0%
log-prod7.0%
add-sqr-sqrt3.0%
fabs-sqr3.0%
add-sqr-sqrt7.1%
metadata-eval7.1%
Applied egg-rr7.1%
+-rgt-identity7.1%
Simplified7.1%
Taylor expanded in x around 0 100.0%
*-commutative100.0%
Simplified100.0%
if 9.2000000000000003e-4 < x Initial program 50.8%
+-commutative50.8%
hypot-1-def100.0%
Simplified100.0%
*-un-lft-identity100.0%
*-commutative100.0%
log-prod100.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.8%
(FPCore (x)
:precision binary64
(if (<= x -1.25)
(copysign (log (- (fabs x) x)) x)
(if (<= x 0.95)
(copysign (+ x (* (pow x 3.0) -0.16666666666666666)) x)
(copysign (log (+ (+ x x) (/ 0.5 x))) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(log((fabs(x) - x)), x);
} else if (x <= 0.95) {
tmp = copysign((x + (pow(x, 3.0) * -0.16666666666666666)), 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((Math.abs(x) - x)), x);
} else if (x <= 0.95) {
tmp = Math.copySign((x + (Math.pow(x, 3.0) * -0.16666666666666666)), 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((math.fabs(x) - x)), x) elif x <= 0.95: tmp = math.copysign((x + (math.pow(x, 3.0) * -0.16666666666666666)), 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(log(Float64(abs(x) - x)), x); elseif (x <= 0.95) tmp = copysign(Float64(x + Float64((x ^ 3.0) * -0.16666666666666666)), 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((abs(x) - x))); elseif (x <= 0.95) tmp = sign(x) * abs((x + ((x ^ 3.0) * -0.16666666666666666))); 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[(N[Abs[x], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 0.95], N[With[{TMP1 = Abs[N[(x + N[(N[Power[x, 3.0], $MachinePrecision] * -0.16666666666666666), $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(\left|x\right| - x\right), x\right)\\
\mathbf{elif}\;x \leq 0.95:\\
\;\;\;\;\mathsf{copysign}\left(x + {x}^{3} \cdot -0.16666666666666666, 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 42.2%
+-commutative42.2%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around -inf 99.2%
mul-1-neg99.2%
unsub-neg99.2%
Simplified99.2%
if -1.25 < x < 0.94999999999999996Initial program 7.0%
+-commutative7.0%
hypot-1-def7.0%
Simplified7.0%
*-un-lft-identity7.0%
*-commutative7.0%
log-prod7.0%
add-sqr-sqrt3.0%
fabs-sqr3.0%
add-sqr-sqrt7.1%
metadata-eval7.1%
Applied egg-rr7.1%
+-rgt-identity7.1%
Simplified7.1%
Taylor expanded in x around 0 100.0%
*-commutative100.0%
Simplified100.0%
if 0.94999999999999996 < x Initial program 50.8%
+-commutative50.8%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around inf 99.7%
rem-square-sqrt99.7%
fabs-sqr99.7%
rem-square-sqrt99.7%
associate-+r+99.7%
associate-*r/99.7%
metadata-eval99.7%
Simplified99.7%
Final simplification99.7%
(FPCore (x)
:precision binary64
(if (<= x -1.25)
(copysign (log (/ -0.5 x)) x)
(if (<= x 0.95)
(copysign (+ x (* (pow x 3.0) -0.16666666666666666)) x)
(copysign (log (+ (+ x x) (/ 0.5 x))) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(log((-0.5 / x)), x);
} else if (x <= 0.95) {
tmp = copysign((x + (pow(x, 3.0) * -0.16666666666666666)), 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((-0.5 / x)), x);
} else if (x <= 0.95) {
tmp = Math.copySign((x + (Math.pow(x, 3.0) * -0.16666666666666666)), 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((-0.5 / x)), x) elif x <= 0.95: tmp = math.copysign((x + (math.pow(x, 3.0) * -0.16666666666666666)), 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(log(Float64(-0.5 / x)), x); elseif (x <= 0.95) tmp = copysign(Float64(x + Float64((x ^ 3.0) * -0.16666666666666666)), 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((-0.5 / x))); elseif (x <= 0.95) tmp = sign(x) * abs((x + ((x ^ 3.0) * -0.16666666666666666))); 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[(-0.5 / x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 0.95], N[With[{TMP1 = Abs[N[(x + N[(N[Power[x, 3.0], $MachinePrecision] * -0.16666666666666666), $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(\frac{-0.5}{x}\right), x\right)\\
\mathbf{elif}\;x \leq 0.95:\\
\;\;\;\;\mathsf{copysign}\left(x + {x}^{3} \cdot -0.16666666666666666, 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 42.2%
+-commutative42.2%
hypot-1-def100.0%
Simplified100.0%
*-un-lft-identity100.0%
*-commutative100.0%
log-prod100.0%
add-sqr-sqrt0.0%
fabs-sqr0.0%
add-sqr-sqrt4.3%
metadata-eval4.3%
Applied egg-rr4.3%
+-rgt-identity4.3%
Simplified4.3%
Taylor expanded in x around -inf 99.2%
if -1.25 < x < 0.94999999999999996Initial program 7.0%
+-commutative7.0%
hypot-1-def7.0%
Simplified7.0%
*-un-lft-identity7.0%
*-commutative7.0%
log-prod7.0%
add-sqr-sqrt3.0%
fabs-sqr3.0%
add-sqr-sqrt7.1%
metadata-eval7.1%
Applied egg-rr7.1%
+-rgt-identity7.1%
Simplified7.1%
Taylor expanded in x around 0 100.0%
*-commutative100.0%
Simplified100.0%
if 0.94999999999999996 < x Initial program 50.8%
+-commutative50.8%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around inf 99.7%
rem-square-sqrt99.7%
fabs-sqr99.7%
rem-square-sqrt99.7%
associate-+r+99.7%
associate-*r/99.7%
metadata-eval99.7%
Simplified99.7%
Final simplification99.7%
(FPCore (x)
:precision binary64
(if (<= x -1.25)
(copysign (log (/ -0.5 x)) x)
(if (<= x 1.25)
(copysign (+ x (* (pow x 3.0) -0.16666666666666666)) x)
(copysign (log (+ x x)) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(log((-0.5 / x)), x);
} else if (x <= 1.25) {
tmp = copysign((x + (pow(x, 3.0) * -0.16666666666666666)), 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((-0.5 / x)), x);
} else if (x <= 1.25) {
tmp = Math.copySign((x + (Math.pow(x, 3.0) * -0.16666666666666666)), 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((-0.5 / x)), x) elif x <= 1.25: tmp = math.copysign((x + (math.pow(x, 3.0) * -0.16666666666666666)), x) else: tmp = math.copysign(math.log((x + x)), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.25) tmp = copysign(log(Float64(-0.5 / x)), x); elseif (x <= 1.25) tmp = copysign(Float64(x + Float64((x ^ 3.0) * -0.16666666666666666)), 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((-0.5 / x))); elseif (x <= 1.25) tmp = sign(x) * abs((x + ((x ^ 3.0) * -0.16666666666666666))); 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[(-0.5 / x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 1.25], N[With[{TMP1 = Abs[N[(x + N[(N[Power[x, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]], 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(\frac{-0.5}{x}\right), x\right)\\
\mathbf{elif}\;x \leq 1.25:\\
\;\;\;\;\mathsf{copysign}\left(x + {x}^{3} \cdot -0.16666666666666666, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x + x\right), x\right)\\
\end{array}
\end{array}
if x < -1.25Initial program 42.2%
+-commutative42.2%
hypot-1-def100.0%
Simplified100.0%
*-un-lft-identity100.0%
*-commutative100.0%
log-prod100.0%
add-sqr-sqrt0.0%
fabs-sqr0.0%
add-sqr-sqrt4.3%
metadata-eval4.3%
Applied egg-rr4.3%
+-rgt-identity4.3%
Simplified4.3%
Taylor expanded in x around -inf 99.2%
if -1.25 < x < 1.25Initial program 7.0%
+-commutative7.0%
hypot-1-def7.0%
Simplified7.0%
*-un-lft-identity7.0%
*-commutative7.0%
log-prod7.0%
add-sqr-sqrt3.0%
fabs-sqr3.0%
add-sqr-sqrt7.1%
metadata-eval7.1%
Applied egg-rr7.1%
+-rgt-identity7.1%
Simplified7.1%
Taylor expanded in x around 0 100.0%
*-commutative100.0%
Simplified100.0%
if 1.25 < x Initial program 50.8%
+-commutative50.8%
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%
Simplified98.9%
Final simplification99.5%
(FPCore (x) :precision binary64 (if (<= x -3.2) (copysign (log (- x)) x) (if (<= x 1.25) (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.25) {
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.25) {
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.25: 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.25) 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.25) 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.25], 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.25:\\
\;\;\;\;\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 42.2%
+-commutative42.2%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around -inf 31.7%
mul-1-neg31.7%
Simplified31.7%
if -3.2000000000000002 < x < 1.25Initial program 7.0%
+-commutative7.0%
hypot-1-def7.0%
Simplified7.0%
Taylor expanded in x around 0 6.8%
rem-square-sqrt3.0%
fabs-sqr3.0%
rem-square-sqrt6.8%
Simplified6.8%
Taylor expanded in x around 0 99.8%
if 1.25 < x Initial program 50.8%
+-commutative50.8%
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%
Simplified98.9%
Final simplification81.8%
(FPCore (x) :precision binary64 (if (<= x -1.25) (copysign (log (/ -0.5 x)) x) (if (<= x 1.25) (copysign x x) (copysign (log (+ x x)) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(log((-0.5 / x)), x);
} else if (x <= 1.25) {
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((-0.5 / x)), x);
} else if (x <= 1.25) {
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((-0.5 / x)), x) elif x <= 1.25: 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(log(Float64(-0.5 / x)), x); elseif (x <= 1.25) 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((-0.5 / x))); elseif (x <= 1.25) 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[(-0.5 / x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 1.25], 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(\frac{-0.5}{x}\right), x\right)\\
\mathbf{elif}\;x \leq 1.25:\\
\;\;\;\;\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 42.2%
+-commutative42.2%
hypot-1-def100.0%
Simplified100.0%
*-un-lft-identity100.0%
*-commutative100.0%
log-prod100.0%
add-sqr-sqrt0.0%
fabs-sqr0.0%
add-sqr-sqrt4.3%
metadata-eval4.3%
Applied egg-rr4.3%
+-rgt-identity4.3%
Simplified4.3%
Taylor expanded in x around -inf 99.2%
if -1.25 < x < 1.25Initial program 7.0%
+-commutative7.0%
hypot-1-def7.0%
Simplified7.0%
Taylor expanded in x around 0 6.8%
rem-square-sqrt3.0%
fabs-sqr3.0%
rem-square-sqrt6.8%
Simplified6.8%
Taylor expanded in x around 0 99.8%
if 1.25 < x Initial program 50.8%
+-commutative50.8%
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%
Simplified98.9%
Final simplification99.4%
(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 42.2%
+-commutative42.2%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around -inf 31.7%
mul-1-neg31.7%
Simplified31.7%
if -1 < x Initial program 21.1%
+-commutative21.1%
hypot-1-def37.0%
Simplified37.0%
Taylor expanded in x around 0 14.7%
log1p-def77.1%
rem-square-sqrt43.5%
fabs-sqr43.5%
rem-square-sqrt77.1%
Simplified77.1%
Final simplification65.2%
(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 19.1%
+-commutative19.1%
hypot-1-def39.0%
Simplified39.0%
Taylor expanded in x around 0 15.3%
rem-square-sqrt2.0%
fabs-sqr2.0%
rem-square-sqrt4.4%
Simplified4.4%
Taylor expanded in x around 0 67.3%
if 1.6000000000000001 < x Initial program 50.8%
+-commutative50.8%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around 0 31.2%
log1p-def31.2%
rem-square-sqrt31.2%
fabs-sqr31.2%
rem-square-sqrt31.2%
Simplified31.2%
Final simplification58.7%
(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 26.6%
+-commutative26.6%
hypot-1-def53.5%
Simplified53.5%
Taylor expanded in x around 0 19.1%
rem-square-sqrt8.9%
fabs-sqr8.9%
rem-square-sqrt10.8%
Simplified10.8%
Taylor expanded in x around 0 52.6%
Final simplification52.6%
(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 2024027
(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))