1#ifndef STAN_MATH_PRIM_CONSTRAINT_STOCHASTIC_COLUMN_FREE_HPP
2#define STAN_MATH_PRIM_CONSTRAINT_STOCHASTIC_COLUMN_FREE_HPP
20template <
typename Mat, require_eigen_matrix_dynamic_t<Mat>* =
nullptr,
21 require_not_st_var<Mat>* =
nullptr>
24 const Eigen::Index M = y_ref.cols();
26 for (Eigen::Index i = 0; i < M; ++i) {
39template <
typename T, require_std_vector_t<T>* =
nullptr>
plain_type_t< Vec > simplex_free(const Vec &x)
Return an unconstrained vector that when transformed produces the specified simplex.
plain_type_t< Mat > stochastic_column_free(const Mat &y)
Return an unconstrained matrix that when transformed produces the specified columnwise stochastic mat...
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 ...