1 #ifndef STAN_MATH_PRIM_SCAL_PROB_UNIFORM_CDF_HPP 2 #define STAN_MATH_PRIM_SCAL_PROB_UNIFORM_CDF_HPP 15 template <
typename T_y,
typename T_low,
typename T_high>
19 static const char*
function =
"uniform_cdf";
26 T_partials_return cdf(1.0);
30 check_greater(
function,
"Upper bound parameter", beta, alpha);
32 "Lower bound parameter", alpha,
33 "Upper bound parameter", beta);
40 for (
size_t n = 0; n < N; n++) {
41 const T_partials_return y_dbl =
value_of(y_vec[n]);
47 for (
size_t n = 0; n < N; n++) {
48 const T_partials_return y_dbl =
value_of(y_vec[n]);
49 const T_partials_return alpha_dbl =
value_of(alpha_vec[n]);
50 const T_partials_return beta_dbl =
value_of(beta_vec[n]);
51 const T_partials_return b_min_a = beta_dbl - alpha_dbl;
52 const T_partials_return cdf_ = (y_dbl - alpha_dbl) / b_min_a;
57 ops_partials.
edge1_.partials_[n] += 1.0 / b_min_a / cdf_;
59 ops_partials.
edge2_.partials_[n]
60 += (y_dbl - beta_dbl) / b_min_a / b_min_a / cdf_;
62 ops_partials.
edge3_.partials_[n] -= 1.0 / b_min_a;
67 ops_partials.
edge1_.partials_[n] *= cdf;
71 ops_partials.
edge2_.partials_[n] *= cdf;
75 ops_partials.
edge3_.partials_[n] *= cdf;
78 return ops_partials.
build(cdf);
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
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...
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.
size_t length(const std::vector< T > &x)
Returns the length of the provided std::vector.
bool size_zero(T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
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.
internal::ops_partials_edge< double, Op2 > edge2_
return_type< T_y, T_low, T_high >::type uniform_cdf(const T_y &y, const T_low &alpha, const T_high &beta)
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_
internal::ops_partials_edge< double, Op1 > edge1_