ub_constrain.hpp File Reference

#include <stan/math/prim/meta.hpp>
#include <stan/math/prim/err.hpp>
#include <stan/math/prim/fun/constants.hpp>
#include <stan/math/prim/fun/exp.hpp>
#include <stan/math/prim/constraint/identity_constrain.hpp>
#include <stan/math/prim/constraint/identity_free.hpp>
#include <stan/math/prim/fun/subtract.hpp>
#include <stan/math/prim/fun/sum.hpp>
#include <stan/math/prim/fun/value_of.hpp>
#include <cmath>

Go to the source code of this file.

Namespaces
namespace	stan
	The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation from C or the boost::math::lgamma implementation.
namespace	stan::math
	Matrices and templated mathematical functions.

Functions
template<typename T , typename U , require_all_stan_scalar_t< T, U > * = nullptr, require_all_not_st_var< T, U > * = nullptr>
auto	stan::math::ub_constrain (const T &x, const U &ub)
	Return the upper-bounded value for the specified unconstrained matrix and upper bound.
template<typename T , typename U , require_all_stan_scalar_t< T, U > * = nullptr, require_all_not_st_var< T, U > * = nullptr>
auto	stan::math::ub_constrain (const T &x, const U &ub, std::decay_t< return_type_t< T, U > > &lp)
	Return the upper-bounded value for the specified unconstrained scalar and upper bound and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
template<typename T , typename U , require_eigen_t< T > * = nullptr, require_stan_scalar_t< U > * = nullptr, require_all_not_st_var< T, U > * = nullptr>
auto	stan::math::ub_constrain (const T &x, const U &ub)
	Specialization of ub_constrain to apply a scalar upper bound elementwise to each input.
template<typename T , typename U , require_eigen_t< T > * = nullptr, require_stan_scalar_t< U > * = nullptr, require_all_not_st_var< T, U > * = nullptr>
auto	stan::math::ub_constrain (const T &x, const U &ub, std::decay_t< return_type_t< T, U > > &lp)
	Specialization of ub_constrain to apply a scalar upper bound elementwise to each input.
template<typename T , typename U , require_not_std_vector_t< U > * = nullptr>
auto	stan::math::ub_constrain (const std::vector< T > &x, const U &ub)
	Specialization of ub_constrain to apply a scalar upper bound elementwise to each input element.
template<typename T , typename U , require_not_std_vector_t< U > * = nullptr>
auto	stan::math::ub_constrain (const std::vector< T > &x, const U &ub, return_type_t< T, U > &lp)
	Specialization of ub_constrain to apply a scalar upper bound elementwise to each input element.
template<typename T , typename U >
auto	stan::math::ub_constrain (const std::vector< T > &x, const std::vector< U > &ub)
	Specialization of ub_constrain to apply a container of upper bounds elementwise to each input element.
template<typename T , typename U >
auto	stan::math::ub_constrain (const std::vector< T > &x, const std::vector< U > &ub, return_type_t< T, U > &lp)
	Specialization of ub_constrain to apply a container of upper bounds elementwise to each input element.
template<bool Jacobian, typename T , typename U >
auto	stan::math::ub_constrain (const T &x, const U &ub, return_type_t< T, U > &lp)
	Specialization of ub_constrain to apply a container of upper bounds elementwise to each input element.