math/prim_2constraint_2identity__free_8hpp_source.html

#ifndef STAN_MATH_PRIM_CONSTRAINT_IDENTITY_FREE_HPP

#define STAN_MATH_PRIM_CONSTRAINT_IDENTITY_FREE_HPP


#include <stan/math/prim/meta.hpp>


namespace stan {

namespace math {


template <typename T, typename... Types,

          require_all_not_var_matrix_t<T, Types...>* = nullptr>

inline auto identity_free(T&& x, Types&&... /* args */) {

  return promote_scalar_t<return_type_t<T, Types...>, T>(x);

}


}  // namespace math

}  // namespace stan


#endif

stan::return_type_t
typename return_type< Ts... >::type return_type_t
Convenience type for the return type of the specified template parameters.
Definition return_type.hpp:218

stan::require_all_not_var_matrix_t
require_all_not_t< is_var_matrix< std::decay_t< Types > >... > require_all_not_var_matrix_t
Require none of the types satisfy is_var_matrix.
Definition is_var_matrix.hpp:53

stan::math::promote_scalar_t
typename promote_scalar_type< std::decay_t< T >, std::decay_t< S > >::type promote_scalar_t
Definition promote_scalar_type.hpp:117

stan::math::identity_free
auto identity_free(T &&x, Types &&...)
Returns the result of applying the inverse of the identity constraint transform to the input.
Definition identity_free.hpp:22

stan
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...
Definition unit_vector_constrain.hpp:15

meta.hpp