lb_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/constraint/identity_constrain.hpp>
#include <stan/math/prim/constraint/identity_free.hpp>
#include <stan/math/prim/fun/add.hpp>
#include <stan/math/prim/fun/exp.hpp>
#include <stan/math/prim/fun/eval.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 L , require_all_stan_scalar_t< T, L > * = nullptr, require_all_not_st_var< T, L > * = nullptr>
auto	stan::math::lb_constrain (const T &x, const L &lb)
	Return the lower-bounded value for the specified unconstrained input and specified lower bound.
template<typename T , typename L , require_all_kernel_expressions_and_none_scalar_t< T > * = nullptr, require_all_kernel_expressions_t< L > * = nullptr>
auto	stan::math::lb_constrain (const T &x, const L &lb, return_type_t< T, L > &lp)
	Return the lower-bounded value for the specified unconstrained input and specified lower bound.
template<typename T , typename L , require_eigen_t< T > * = nullptr, require_stan_scalar_t< L > * = nullptr, require_all_not_st_var< T, L > * = nullptr>
auto	stan::math::lb_constrain (T &&x, L &&lb)
	Specialization of lb_constrain to apply a scalar lower bound elementwise to each input.
template<typename T , typename L , require_eigen_t< T > * = nullptr, require_stan_scalar_t< L > * = nullptr, require_all_not_st_var< T, L > * = nullptr>
auto	stan::math::lb_constrain (const T &x, const L &lb, return_type_t< T, L > &lp)
	Specialization of lb_constrain to apply a scalar lower bound elementwise to each input.
template<typename T , typename L , require_all_kernel_expressions_and_none_scalar_t< T > * = nullptr, require_all_kernel_expressions_t< L > * = nullptr>
auto	stan::math::lb_constrain (T &&x, L &&lb)
	Return the lower-bounded value for the specified unconstrained input and specified lower bound.
template<typename T , typename L , require_not_std_vector_t< L > * = nullptr>
auto	stan::math::lb_constrain (const std::vector< T > &x, const L &lb)
	Specialization of lb_constrain to apply a container of lower bounds elementwise to each input element.
template<typename T , typename L , require_not_std_vector_t< L > * = nullptr>
auto	stan::math::lb_constrain (const std::vector< T > &x, const L &lb, return_type_t< T, L > &lp)
	Specialization of lb_constrain to apply a container of lower bounds elementwise to each input element.
template<typename T , typename L >
auto	stan::math::lb_constrain (const std::vector< T > &x, const std::vector< L > &lb)
	Specialization of lb_constrain to apply a container of lower bounds elementwise to each input element.
template<typename T , typename L >
auto	stan::math::lb_constrain (const std::vector< T > &x, const std::vector< L > &lb, return_type_t< T, L > &lp)
	Specialization of lb_constrain to apply a container of lower bounds elementwise to each input element.
template<bool Jacobian, typename T , typename L >
auto	stan::math::lb_constrain (const T &x, const L &lb, return_type_t< T, L > &lp)
	Specialization of lb_constrain to apply a container of lower bounds elementwise to each input element.