Automatic Differentiation
 
Loading...
Searching...
No Matches
positive_free.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_CONSTRAINT_POSITIVE_FREE_HPP
2#define STAN_MATH_PRIM_CONSTRAINT_POSITIVE_FREE_HPP
3
4#include <stan/math/prim/meta.hpp>
5#include <stan/math/prim/err.hpp>
6#include <stan/math/prim/fun/log.hpp>
7#include <cmath>
8
9namespace stan {
10namespace math {
11
28template <typename T>
29inline plain_type_t<T> positive_free(const T& y) {
30 check_positive("positive_free", "Positive variable", y);
31 return log(y);
32}
33
34} // namespace math
35} // namespace stan
36#endif
stan::math::positive_free
plain_type_t< T > positive_free(const T &y)
Return the unconstrained value corresponding to the specified positive-constrained value.
Definition positive_free.hpp:29
stan::math::log
fvar< T > log(const fvar< T > &x)
Definition log.hpp:18
stan::math::check_positive
void check_positive(const char *function, const char *name, const T_y &y)
Check if y is positive.
Definition check_positive.hpp:27
stan::plain_type_t
typename plain_type< T >::type plain_type_t
Definition plain_type.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