1#ifndef STAN_MATH_PRIM_FUN_TANH_HPP
2#define STAN_MATH_PRIM_FUN_TANH_HPP
25 static inline auto fun(
const T& x) {
38template <
typename Container,
42 Container>* =
nullptr>
43inline auto tanh(
const Container& x) {
55template <
typename Container,
57inline auto tanh(
const Container& x) {
59 x, [](
const auto& v) {
return v.array().
tanh(); });
74 auto exp_neg_z =
exp(-z);
require_not_t< container_type_check_base< is_container, scalar_type_t, TypeCheck, Check... > > require_not_container_st
Require type does not satisfy is_container.
require_t< container_type_check_base< is_container, scalar_type_t, TypeCheck, Check... > > require_container_st
Require type satisfies is_container.
require_all_not_t< is_nonscalar_prim_or_rev_kernel_expression< std::decay_t< Types > >... > require_all_not_nonscalar_prim_or_rev_kernel_expression_t
Require none of the types satisfy is_nonscalar_prim_or_rev_kernel_expression.
require_not_t< is_var_matrix< std::decay_t< T > > > require_not_var_matrix_t
Require type does not satisfy is_var_matrix.
complex_return_t< U, V > complex_divide(const U &lhs, const V &rhs)
Return the quotient of the specified arguments.
std::complex< V > complex_tanh(const std::complex< V > &z)
Return the hyperbolic tangent of the complex argument.
fvar< T > tanh(const fvar< T > &x)
fvar< T > exp(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 tanh() so that it can be vectorized.