1#ifndef STAN_MATH_PRIM_CONSTRAINT_POSITIVE_CONSTRAIN_HPP
2#define STAN_MATH_PRIM_CONSTRAINT_POSITIVE_CONSTRAIN_HPP
43template <
typename T,
typename S>
64template <
bool Jacobian,
typename T, require_not_std_vector_t<T>* =
nullptr>
89template <
bool Jacobian,
typename T, require_std_vector_t<T>* =
nullptr>
91 return apply_vector_unary<T>::apply(
92 x, [&lp](
auto&& v) {
return positive_constrain<Jacobian>(v, lp); });
typename return_type< Ts... >::type return_type_t
Convenience type for the return type of the specified template parameters.
auto sum(const std::vector< T > &m)
Return the sum of the entries of the specified standard vector.
auto positive_constrain(const T &x)
Return the positive value for the specified unconstrained input.
fvar< T > exp(const fvar< T > &x)
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...