Automatic Differentiation
 
Loading...
Searching...
No Matches
ub_constrain.hpp File Reference

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_kernel_expressions_and_none_scalar_t< T > * = nullptr, require_all_kernel_expressions_t< U > * = nullptr>
auto stan::math::ub_constrain (const T &x, const U &ub, return_type_t< T, U > &lp)
 Return the upper-bounded value for the specified unconstrained matrix and upper bound.
 
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_matrix_t< T > * = nullptr, require_stan_scalar_t< U > * = nullptr, require_any_st_var< T, U > * = nullptr>
auto stan::math::ub_constrain (const 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.