1 #ifndef STAN_MATH_PRIM_SCAL_PROB_UNIFORM_LPDF_HPP 2 #define STAN_MATH_PRIM_SCAL_PROB_UNIFORM_LPDF_HPP 39 template <
bool propto,
typename T_y,
typename T_low,
typename T_high>
41 const T_y& y,
const T_low& alpha,
const T_high&
beta) {
42 static const char*
function =
"uniform_lpdf";
51 T_partials_return logp(0.0);
55 check_greater(
function,
"Upper bound parameter", beta, alpha);
57 "Lower bound parameter", alpha,
58 "Upper bound parameter", beta);
68 for (
size_t n = 0; n < N; n++) {
69 const T_partials_return y_dbl =
value_of(y_vec[n]);
75 T_partials_return, T_low, T_high>
76 inv_beta_minus_alpha(
max_size(alpha, beta));
77 for (
size_t i = 0; i <
max_size(alpha, beta); i++)
79 inv_beta_minus_alpha[i]
83 T_partials_return, T_low, T_high>
84 log_beta_minus_alpha(
max_size(alpha, beta));
85 for (
size_t i = 0; i <
max_size(alpha, beta); i++)
87 log_beta_minus_alpha[i]
91 for (
size_t n = 0; n < N; n++) {
93 logp -= log_beta_minus_alpha[n];
96 ops_partials.
edge2_.partials_[n] += inv_beta_minus_alpha[n];
98 ops_partials.
edge3_.partials_[n] -= inv_beta_minus_alpha[n];
100 return ops_partials.
build(logp);
103 template <
typename T_y,
typename T_low,
typename T_high>
105 const T_y& y,
const T_low& alpha,
const T_high&
beta) {
106 return uniform_lpdf<false>(y, alpha,
beta);
void check_finite(const char *function, const char *name, const T_y &y)
Check if y is finite.
boost::math::tools::promote_args< double, typename partials_type< typename scalar_type< T >::type >::type, typename partials_return_type< T_pack... >::type >::type type
return_type< T_y, T_low, T_high >::type uniform_lpdf(const T_y &y, const T_low &alpha, const T_high &beta)
The log of a uniform density for the given y, lower, and upper bound.
T value_of(const fvar< T > &v)
Return the value of the specified variable.
Extends std::true_type when instantiated with zero or more template parameters, all of which extend t...
fvar< T > log(const fvar< T > &x)
scalar_seq_view provides a uniform sequence-like wrapper around either a scalar or a sequence of scal...
This template builds partial derivatives with respect to a set of operands.
bool size_zero(T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
Template metaprogram to calculate whether a summand needs to be included in a proportional (log) prob...
fvar< T > beta(const fvar< T > &x1, const fvar< T > &x2)
Return fvar with the beta function applied to the specified arguments and its gradient.
boost::math::tools::promote_args< double, typename scalar_type< T >::type, typename return_type< Types_pack... >::type >::type type
void check_not_nan(const char *function, const char *name, const T_y &y)
Check if y is not NaN.
size_t max_size(const T1 &x1, const T2 &x2)
T_return_type build(double value)
Build the node to be stored on the autodiff graph.
VectorBuilder allocates type T1 values to be used as intermediate values.
internal::ops_partials_edge< double, Op2 > edge2_
void check_greater(const char *function, const char *name, const T_y &y, const T_low &low)
Check if y is strictly greater than low.
void check_consistent_sizes(const char *function, const char *name1, const T1 &x1, const char *name2, const T2 &x2)
Check if the dimension of x1 is consistent with x2.
internal::ops_partials_edge< double, Op3 > edge3_