1#ifndef STAN_MATH_PRIM_PROB_UNIFORM_LCCDF_HPP
2#define STAN_MATH_PRIM_PROB_UNIFORM_LCCDF_HPP
22template <
typename T_y,
typename T_low,
typename T_high,
24 T_y, T_low, T_high>* =
nullptr>
32 static constexpr const char* function =
"uniform_lccdf";
34 "Lower bound parameter", alpha,
35 "Upper bound parameter",
beta);
38 T_alpha_ref alpha_ref = alpha;
39 T_beta_ref beta_ref =
beta;
46 check_finite(function,
"Lower bound parameter", alpha_val);
47 check_finite(function,
"Upper bound parameter", beta_val);
48 check_greater(function,
"Upper bound parameter", beta_val, alpha_val);
54 if (
sum(promote_scalar<int>(y_val < alpha_val))
55 ||
sum(promote_scalar<int>(beta_val < y_val))) {
62 = to_ref_if<is_any_autodiff_v<T_y, T_low, T_high>>(beta_val - alpha_val);
63 const auto& ccdf_log_n = to_ref_if<is_any_autodiff_v<T_y, T_low, T_high>>(
64 1 - (y_val - alpha_val) / b_minus_a);
66 T_partials_return ccdf_log =
sum(
log(ccdf_log_n));
68 if constexpr (is_autodiff_v<T_y>) {
69 partials<0>(ops_partials) =
inv(-b_minus_a * ccdf_log_n);
71 if constexpr (is_any_autodiff_v<T_low, T_high>) {
73 =
to_ref_if<(is_autodiff_v<T_low> && is_autodiff_v<T_high>)>(
74 inv(b_minus_a * b_minus_a * ccdf_log_n));
75 if constexpr (is_autodiff_v<T_low>) {
76 partials<1>(ops_partials) = (beta_val - y_val) * rep_deriv;
78 if constexpr (is_autodiff_v<T_high>) {
79 partials<2>(ops_partials) = (y_val - alpha_val) * rep_deriv;
82 return ops_partials.build(ccdf_log);
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_lccdf(const T_y_cl &y, const T_low_cl &alpha, const T_high_cl &beta)
Returns the log uniform complementary cumulative distribution function for the given location,...
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.
T to_ref_if(T &&a)
No-op that should be optimized away.
fvar< T > log(const fvar< T > &x)
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.
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.
ref_type_t< T && > to_ref(T &&a)
This evaluates expensive Eigen expressions.
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.
fvar< T > inv(const fvar< T > &x)
auto make_partials_propagator(Ops &&... ops)
Construct an partials_propagator.
typename ref_type_if< is_autodiff_v< T >, 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 ...