1#ifndef STAN_MATH_PRIM_CONSTRAINT_STOCHASTIC_ROW_FREE_HPP
2#define STAN_MATH_PRIM_CONSTRAINT_STOCHASTIC_ROW_FREE_HPP
19template <
typename Mat, require_eigen_matrix_dynamic_t<Mat>* =
nullptr,
20 require_not_st_var<Mat>* =
nullptr>
23 const Eigen::Index N = y_ref.rows();
25 for (Eigen::Index i = 0; i < N; ++i) {
38template <
typename T, require_std_vector_t<T>* =
nullptr>
plain_type_t< Mat > stochastic_row_free(const Mat &y)
Return an unconstrained matrix that when transformed produces the specified simplex matrix.
plain_type_t< Vec > simplex_free(const Vec &x)
Return an unconstrained vector that when transformed produces the specified simplex.
ref_type_t< T && > to_ref(T &&a)
This evaluates expensive Eigen expressions.
typename plain_type< T >::type plain_type_t
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...