1#ifndef STAN_MATH_PRIM_FUN_ASINH_HPP
2#define STAN_MATH_PRIM_FUN_ASINH_HPP
29template <
typename T, require_arithmetic_t<T>* =
nullptr>
41template <
typename T, require_complex_bt<std::is_arithmetic, T>* =
nullptr>
42inline auto asinh(
const T x) {
55 static inline auto fun(
const T& x) {
68template <
typename T, require_ad_container_t<T>* =
nullptr>
81template <
typename Container,
83inline auto asinh(
const Container& x) {
98 auto y =
log(z +
sqrt(1 + z * z));
require_t< container_type_check_base< is_container, base_type_t, TypeCheck, Check... > > require_container_bt
Require type satisfies is_container.
std::complex< V > complex_asinh(const std::complex< V > &z)
Return the hyperbolic arc sine of the complex argument.
double copysign(double a, double_d b)
double value_of_rec(const fvar< T > &v)
Return the value of the specified variable.
fvar< T > asinh(const fvar< T > &x)
fvar< T > log(const fvar< T > &x)
fvar< T > sqrt(const fvar< T > &x)
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...
Base template class for vectorization of unary scalar functions defined by a template class F to a sc...
static auto fun(const T &x)
Structure to wrap asinh() so it can be vectorized.