1#ifndef STAN_MATH_PRIM_PROB_UNIFORM_CDF_HPP
2#define STAN_MATH_PRIM_PROB_UNIFORM_CDF_HPP
20template <
typename T_y,
typename T_low,
typename T_high,
22 T_y, T_low, T_high>* =
nullptr>
29 static constexpr const char* function =
"uniform_cdf";
31 "Lower bound parameter", alpha,
32 "Upper bound parameter",
beta);
35 T_alpha_ref alpha_ref = alpha;
36 T_beta_ref beta_ref =
beta;
43 check_finite(function,
"Lower bound parameter", alpha_val);
44 check_finite(function,
"Upper bound parameter", beta_val);
45 check_greater(function,
"Upper bound parameter", beta_val, alpha_val);
51 if (
sum(promote_scalar<int>(y_val < alpha_val))
52 ||
sum(promote_scalar<int>(beta_val < y_val))) {
59 = to_ref_if<!is_constant_all<T_y, T_low, T_high>::value>(beta_val
61 const auto& cdf_n = to_ref_if<!is_constant_all<T_y, T_low>::value>(
62 (y_val - alpha_val) / b_minus_a);
64 T_partials_return cdf =
prod(cdf_n);
75 edge<1>(ops_partials).partials_
76 = (y_val - beta_val) * deriv_y / b_minus_a;
79 partials<0>(ops_partials) = std::move(deriv_y);
85 edge<2>(ops_partials).partials_
88 partials<2>(ops_partials) = -rep_deriv;
93 return ops_partials.build(cdf);
require_all_not_t< is_nonscalar_prim_or_rev_kernel_expression< std::decay_t< Types > >... > require_all_not_nonscalar_prim_or_rev_kernel_expression_t
Require none of the types satisfy is_nonscalar_prim_or_rev_kernel_expression.
return_type_t< T_y_cl, T_low_cl, T_high_cl > uniform_cdf(const T_y_cl &y, const T_low_cl &alpha, const T_high_cl &beta)
Returns the uniform cumulative distribution function for the given location, and scale.
typename return_type< Ts... >::type return_type_t
Convenience type for the return type of the specified template parameters.
bool size_zero(const T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
value_type_t< T > prod(const T &m)
Calculates product of given kernel generator expression elements.
T to_ref_if(T &&a)
No-op that should be optimized away.
auto as_value_column_array_or_scalar(T &&a)
Extract the value from an object and for eigen vectors and std::vectors convert to an eigen column ar...
void check_consistent_sizes(const char *)
Trivial no input case, this function is a no-op.
ref_type_t< T && > to_ref(T &&a)
This evaluates expensive Eigen expressions.
void check_finite(const char *function, const char *name, const T_y &y)
Return true if all values in y are finite.
void check_not_nan(const char *function, const char *name, const T_y &y)
Check if y is not NaN.
auto sum(const std::vector< T > &m)
Return the sum of the entries of the specified standard vector.
int64_t max_size(const T1 &x1, const Ts &... xs)
Calculate the size of the largest input.
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.
void check_greater(const char *function, const char *name, const T_y &y, const T_low &low, Idxs... idxs)
Throw an exception if y is not strictly greater than low.
auto make_partials_propagator(Ops &&... ops)
Construct an partials_propagator.
typename ref_type_if<!is_constant< T >::value, T >::type ref_type_if_not_constant_t
typename partials_return_type< Args... >::type partials_return_t
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...
If the input type T is either an eigen matrix with 1 column or 1 row at compile time or a standard ve...
Extends std::true_type when instantiated with zero or more template parameters, all of which extend t...