
(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 8 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 -2.0)
(copysign (- (log (- (hypot 1.0 x) x))) x)
(if (<= t_0 1e-6)
(copysign (+ x (* (pow x 3.0) -0.16666666666666666)) x)
(copysign (+ (log x) (log 2.0)) x)))))
double code(double x) {
double t_0 = copysign(log((fabs(x) + sqrt(((x * x) + 1.0)))), x);
double tmp;
if (t_0 <= -2.0) {
tmp = copysign(-log((hypot(1.0, x) - x)), x);
} else if (t_0 <= 1e-6) {
tmp = copysign((x + (pow(x, 3.0) * -0.16666666666666666)), x);
} else {
tmp = copysign((log(x) + log(2.0)), 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 <= -2.0) {
tmp = Math.copySign(-Math.log((Math.hypot(1.0, x) - x)), x);
} else if (t_0 <= 1e-6) {
tmp = Math.copySign((x + (Math.pow(x, 3.0) * -0.16666666666666666)), x);
} else {
tmp = Math.copySign((Math.log(x) + Math.log(2.0)), 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 <= -2.0: tmp = math.copysign(-math.log((math.hypot(1.0, x) - x)), x) elif t_0 <= 1e-6: tmp = math.copysign((x + (math.pow(x, 3.0) * -0.16666666666666666)), x) else: tmp = math.copysign((math.log(x) + math.log(2.0)), 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 <= -2.0) tmp = copysign(Float64(-log(Float64(hypot(1.0, x) - x))), x); elseif (t_0 <= 1e-6) tmp = copysign(Float64(x + Float64((x ^ 3.0) * -0.16666666666666666)), x); else tmp = copysign(Float64(log(x) + log(2.0)), 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 <= -2.0) tmp = sign(x) * abs(-log((hypot(1.0, x) - x))); elseif (t_0 <= 1e-6) tmp = sign(x) * abs((x + ((x ^ 3.0) * -0.16666666666666666))); else tmp = sign(x) * abs((log(x) + log(2.0))); 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, -2.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, 1e-6], 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[(N[Log[x], $MachinePrecision] + N[Log[2.0], $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 -2:\\
\;\;\;\;\mathsf{copysign}\left(-\log \left(\mathsf{hypot}\left(1, x\right) - x\right), x\right)\\
\mathbf{elif}\;t\_0 \leq 10^{-6}:\\
\;\;\;\;\mathsf{copysign}\left(x + {x}^{3} \cdot -0.16666666666666666, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log x + \log 2, x\right)\\
\end{array}
\end{array}
if (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) < -2Initial program 57.5%
+-commutative57.5%
hypot-1-def100.0%
Simplified100.0%
flip-+1.7%
clear-num1.7%
log-div1.7%
metadata-eval1.7%
add-sqr-sqrt0.0%
fabs-sqr0.0%
add-sqr-sqrt1.8%
pow21.8%
add-sqr-sqrt0.0%
fabs-sqr0.0%
add-sqr-sqrt1.8%
hypot-1-def1.8%
hypot-1-def1.8%
add-sqr-sqrt1.8%
+-commutative1.8%
Applied egg-rr1.8%
neg-sub01.8%
div-sub1.8%
fma-undefine1.8%
unpow21.8%
associate--r+1.8%
+-inverses1.8%
metadata-eval1.8%
*-rgt-identity1.8%
associate-/l*1.8%
metadata-eval1.8%
*-commutative1.8%
*-rgt-identity1.8%
fma-undefine1.8%
unpow21.8%
associate--r+56.1%
+-inverses100.0%
metadata-eval100.0%
associate-/l*100.0%
metadata-eval100.0%
*-commutative100.0%
neg-mul-1100.0%
Simplified100.0%
if -2 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) < 9.99999999999999955e-7Initial program 7.8%
+-commutative7.8%
hypot-1-def7.8%
Simplified7.8%
*-un-lft-identity7.8%
*-commutative7.8%
log-prod7.8%
add-sqr-sqrt4.7%
fabs-sqr4.7%
add-sqr-sqrt7.8%
metadata-eval7.8%
Applied egg-rr7.8%
+-rgt-identity7.8%
Simplified7.8%
Taylor expanded in x around 0 100.0%
distribute-lft-in100.0%
*-rgt-identity100.0%
*-commutative100.0%
associate-*r*100.0%
unpow2100.0%
cube-mult100.0%
Simplified100.0%
if 9.99999999999999955e-7 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) Initial program 50.4%
+-commutative50.4%
hypot-1-def98.8%
Simplified98.8%
Taylor expanded in x around inf 98.6%
rem-square-sqrt98.6%
fabs-sqr98.6%
rem-square-sqrt98.6%
Simplified98.6%
log-prod99.4%
*-inverses99.4%
metadata-eval99.4%
Applied egg-rr99.4%
Final simplification99.8%
(FPCore (x)
:precision binary64
(if (<= x -1.25)
(copysign (log (/ -0.5 x)) x)
(if (<= x 1.26)
(copysign (+ x (* (pow x 3.0) -0.16666666666666666)) x)
(copysign (+ (log x) (log 2.0)) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(log((-0.5 / x)), x);
} else if (x <= 1.26) {
tmp = copysign((x + (pow(x, 3.0) * -0.16666666666666666)), x);
} else {
tmp = copysign((log(x) + log(2.0)), 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.26) {
tmp = Math.copySign((x + (Math.pow(x, 3.0) * -0.16666666666666666)), x);
} else {
tmp = Math.copySign((Math.log(x) + Math.log(2.0)), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.25: tmp = math.copysign(math.log((-0.5 / x)), x) elif x <= 1.26: tmp = math.copysign((x + (math.pow(x, 3.0) * -0.16666666666666666)), x) else: tmp = math.copysign((math.log(x) + math.log(2.0)), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.25) tmp = copysign(log(Float64(-0.5 / x)), x); elseif (x <= 1.26) tmp = copysign(Float64(x + Float64((x ^ 3.0) * -0.16666666666666666)), x); else tmp = copysign(Float64(log(x) + log(2.0)), 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.26) tmp = sign(x) * abs((x + ((x ^ 3.0) * -0.16666666666666666))); else tmp = sign(x) * abs((log(x) + log(2.0))); 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.26], 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[(N[Log[x], $MachinePrecision] + N[Log[2.0], $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.26:\\
\;\;\;\;\mathsf{copysign}\left(x + {x}^{3} \cdot -0.16666666666666666, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log x + \log 2, x\right)\\
\end{array}
\end{array}
if x < -1.25Initial program 57.5%
+-commutative57.5%
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.7%
metadata-eval4.7%
Applied egg-rr4.7%
+-rgt-identity4.7%
Simplified4.7%
Taylor expanded in x around -inf 98.8%
if -1.25 < x < 1.26000000000000001Initial program 7.8%
+-commutative7.8%
hypot-1-def7.8%
Simplified7.8%
*-un-lft-identity7.8%
*-commutative7.8%
log-prod7.8%
add-sqr-sqrt4.7%
fabs-sqr4.7%
add-sqr-sqrt7.8%
metadata-eval7.8%
Applied egg-rr7.8%
+-rgt-identity7.8%
Simplified7.8%
Taylor expanded in x around 0 100.0%
distribute-lft-in100.0%
*-rgt-identity100.0%
*-commutative100.0%
associate-*r*100.0%
unpow2100.0%
cube-mult100.0%
Simplified100.0%
if 1.26000000000000001 < x Initial program 50.4%
+-commutative50.4%
hypot-1-def98.8%
Simplified98.8%
Taylor expanded in x around inf 98.6%
rem-square-sqrt98.6%
fabs-sqr98.6%
rem-square-sqrt98.6%
Simplified98.6%
log-prod99.4%
*-inverses99.4%
metadata-eval99.4%
Applied egg-rr99.4%
Final simplification99.5%
(FPCore (x)
:precision binary64
(if (<= x -1.25)
(copysign (log (/ -0.5 x)) x)
(if (<= x 1.26)
(copysign (+ x (* (pow x 3.0) -0.16666666666666666)) x)
(copysign (log (* x 2.0)) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(log((-0.5 / x)), x);
} else if (x <= 1.26) {
tmp = copysign((x + (pow(x, 3.0) * -0.16666666666666666)), x);
} else {
tmp = copysign(log((x * 2.0)), 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.26) {
tmp = Math.copySign((x + (Math.pow(x, 3.0) * -0.16666666666666666)), x);
} else {
tmp = Math.copySign(Math.log((x * 2.0)), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.25: tmp = math.copysign(math.log((-0.5 / x)), x) elif x <= 1.26: tmp = math.copysign((x + (math.pow(x, 3.0) * -0.16666666666666666)), x) else: tmp = math.copysign(math.log((x * 2.0)), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.25) tmp = copysign(log(Float64(-0.5 / x)), x); elseif (x <= 1.26) tmp = copysign(Float64(x + Float64((x ^ 3.0) * -0.16666666666666666)), x); else tmp = copysign(log(Float64(x * 2.0)), 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.26) tmp = sign(x) * abs((x + ((x ^ 3.0) * -0.16666666666666666))); else tmp = sign(x) * abs(log((x * 2.0))); 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.26], 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 * 2.0), $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.26:\\
\;\;\;\;\mathsf{copysign}\left(x + {x}^{3} \cdot -0.16666666666666666, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x \cdot 2\right), x\right)\\
\end{array}
\end{array}
if x < -1.25Initial program 57.5%
+-commutative57.5%
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.7%
metadata-eval4.7%
Applied egg-rr4.7%
+-rgt-identity4.7%
Simplified4.7%
Taylor expanded in x around -inf 98.8%
if -1.25 < x < 1.26000000000000001Initial program 7.8%
+-commutative7.8%
hypot-1-def7.8%
Simplified7.8%
*-un-lft-identity7.8%
*-commutative7.8%
log-prod7.8%
add-sqr-sqrt4.7%
fabs-sqr4.7%
add-sqr-sqrt7.8%
metadata-eval7.8%
Applied egg-rr7.8%
+-rgt-identity7.8%
Simplified7.8%
Taylor expanded in x around 0 100.0%
distribute-lft-in100.0%
*-rgt-identity100.0%
*-commutative100.0%
associate-*r*100.0%
unpow2100.0%
cube-mult100.0%
Simplified100.0%
if 1.26000000000000001 < x Initial program 50.4%
+-commutative50.4%
hypot-1-def98.8%
Simplified98.8%
*-un-lft-identity98.8%
*-commutative98.8%
log-prod98.8%
add-sqr-sqrt98.8%
fabs-sqr98.8%
add-sqr-sqrt98.8%
metadata-eval98.8%
Applied egg-rr98.8%
+-rgt-identity98.8%
Simplified98.8%
Taylor expanded in x around inf 98.6%
*-commutative98.6%
Simplified98.6%
Final simplification99.3%
(FPCore (x) :precision binary64 (if (<= x -3.2) (copysign (log (- x)) x) (if (<= x 1.26) (copysign x x) (copysign (log (* x 2.0)) x))))
double code(double x) {
double tmp;
if (x <= -3.2) {
tmp = copysign(log(-x), x);
} else if (x <= 1.26) {
tmp = copysign(x, x);
} else {
tmp = copysign(log((x * 2.0)), 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.26) {
tmp = Math.copySign(x, x);
} else {
tmp = Math.copySign(Math.log((x * 2.0)), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -3.2: tmp = math.copysign(math.log(-x), x) elif x <= 1.26: tmp = math.copysign(x, x) else: tmp = math.copysign(math.log((x * 2.0)), x) return tmp
function code(x) tmp = 0.0 if (x <= -3.2) tmp = copysign(log(Float64(-x)), x); elseif (x <= 1.26) tmp = copysign(x, x); else tmp = copysign(log(Float64(x * 2.0)), 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.26) tmp = sign(x) * abs(x); else tmp = sign(x) * abs(log((x * 2.0))); 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.26], N[With[{TMP1 = Abs[x], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x * 2.0), $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.26:\\
\;\;\;\;\mathsf{copysign}\left(x, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x \cdot 2\right), x\right)\\
\end{array}
\end{array}
if x < -3.2000000000000002Initial program 57.5%
+-commutative57.5%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around -inf 31.4%
mul-1-neg31.4%
Simplified31.4%
if -3.2000000000000002 < x < 1.26000000000000001Initial program 7.8%
+-commutative7.8%
hypot-1-def7.8%
Simplified7.8%
Taylor expanded in x around 0 7.6%
log1p-define98.4%
rem-square-sqrt48.8%
fabs-sqr48.8%
rem-square-sqrt98.4%
Simplified98.4%
Taylor expanded in x around 0 99.9%
if 1.26000000000000001 < x Initial program 50.4%
+-commutative50.4%
hypot-1-def98.8%
Simplified98.8%
*-un-lft-identity98.8%
*-commutative98.8%
log-prod98.8%
add-sqr-sqrt98.8%
fabs-sqr98.8%
add-sqr-sqrt98.8%
metadata-eval98.8%
Applied egg-rr98.8%
+-rgt-identity98.8%
Simplified98.8%
Taylor expanded in x around inf 98.6%
*-commutative98.6%
Simplified98.6%
Final simplification84.2%
(FPCore (x) :precision binary64 (if (<= x -1.25) (copysign (log (/ -0.5 x)) x) (if (<= x 1.26) (copysign x x) (copysign (log (* x 2.0)) x))))
double code(double x) {
double tmp;
if (x <= -1.25) {
tmp = copysign(log((-0.5 / x)), x);
} else if (x <= 1.26) {
tmp = copysign(x, x);
} else {
tmp = copysign(log((x * 2.0)), 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.26) {
tmp = Math.copySign(x, x);
} else {
tmp = Math.copySign(Math.log((x * 2.0)), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.25: tmp = math.copysign(math.log((-0.5 / x)), x) elif x <= 1.26: tmp = math.copysign(x, x) else: tmp = math.copysign(math.log((x * 2.0)), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.25) tmp = copysign(log(Float64(-0.5 / x)), x); elseif (x <= 1.26) tmp = copysign(x, x); else tmp = copysign(log(Float64(x * 2.0)), 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.26) tmp = sign(x) * abs(x); else tmp = sign(x) * abs(log((x * 2.0))); 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.26], N[With[{TMP1 = Abs[x], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x * 2.0), $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.26:\\
\;\;\;\;\mathsf{copysign}\left(x, x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x \cdot 2\right), x\right)\\
\end{array}
\end{array}
if x < -1.25Initial program 57.5%
+-commutative57.5%
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.7%
metadata-eval4.7%
Applied egg-rr4.7%
+-rgt-identity4.7%
Simplified4.7%
Taylor expanded in x around -inf 98.8%
if -1.25 < x < 1.26000000000000001Initial program 7.8%
+-commutative7.8%
hypot-1-def7.8%
Simplified7.8%
Taylor expanded in x around 0 7.6%
log1p-define98.4%
rem-square-sqrt48.8%
fabs-sqr48.8%
rem-square-sqrt98.4%
Simplified98.4%
Taylor expanded in x around 0 99.9%
if 1.26000000000000001 < x Initial program 50.4%
+-commutative50.4%
hypot-1-def98.8%
Simplified98.8%
*-un-lft-identity98.8%
*-commutative98.8%
log-prod98.8%
add-sqr-sqrt98.8%
fabs-sqr98.8%
add-sqr-sqrt98.8%
metadata-eval98.8%
Applied egg-rr98.8%
+-rgt-identity98.8%
Simplified98.8%
Taylor expanded in x around inf 98.6%
*-commutative98.6%
Simplified98.6%
Final simplification99.3%
(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 57.5%
+-commutative57.5%
hypot-1-def100.0%
Simplified100.0%
Taylor expanded in x around -inf 31.4%
mul-1-neg31.4%
Simplified31.4%
if -1 < x Initial program 24.9%
+-commutative24.9%
hypot-1-def44.4%
Simplified44.4%
Taylor expanded in x around 0 17.2%
log1p-define71.5%
rem-square-sqrt41.8%
fabs-sqr41.8%
rem-square-sqrt71.5%
Simplified71.5%
Final simplification62.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 23.9%
+-commutative23.9%
hypot-1-def37.7%
Simplified37.7%
Taylor expanded in x around 0 15.3%
log1p-define76.7%
rem-square-sqrt33.0%
fabs-sqr33.0%
rem-square-sqrt66.6%
Simplified66.6%
Taylor expanded in x around 0 69.3%
if 1.6000000000000001 < x Initial program 50.4%
+-commutative50.4%
hypot-1-def98.8%
Simplified98.8%
Taylor expanded in x around 0 31.4%
log1p-define31.4%
rem-square-sqrt31.4%
fabs-sqr31.4%
rem-square-sqrt31.4%
Simplified31.4%
Final simplification57.5%
(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 32.2%
+-commutative32.2%
hypot-1-def56.8%
Simplified56.8%
Taylor expanded in x around 0 20.4%
log1p-define62.6%
rem-square-sqrt32.5%
fabs-sqr32.5%
rem-square-sqrt55.6%
Simplified55.6%
Taylor expanded in x around 0 49.4%
Final simplification49.4%
(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 2024112
(FPCore (x)
:name "Rust f64::asinh"
:precision binary64
:alt
(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))