bernoulli_lccdf.hpp

Go to the documentation of this file.

#ifndef STAN_MATH_PRIM_PROB_BERNOULLI_LCCDF_HPP
#define STAN_MATH_PRIM_PROB_BERNOULLI_LCCDF_HPP
 
#include <stan/math/prim/meta.hpp>
#include <stan/math/prim/err.hpp>
#include <stan/math/prim/fun/any.hpp>
#include <stan/math/prim/fun/constants.hpp>
#include <stan/math/prim/fun/inv.hpp>
#include <stan/math/prim/fun/log.hpp>
#include <stan/math/prim/fun/select.hpp>
#include <stan/math/prim/fun/size_zero.hpp>
#include <stan/math/prim/functor/partials_propagator.hpp>
 
namespace stan {
namespace math {
 
template <typename T_n, typename T_prob,
          require_all_not_nonscalar_prim_or_rev_kernel_expression_t<
              T_n, T_prob>* = nullptr>
return_type_t<T_prob> bernoulli_lccdf(const T_n& n, const T_prob& theta) {
  using T_theta_ref = ref_type_t<T_prob>;
  static constexpr const char* function = "bernoulli_lccdf";
  check_consistent_sizes(function, "Random variable", n,
                         "Probability parameter", theta);
  T_theta_ref theta_ref = theta;
  const auto& n_arr = as_value_column_array_or_scalar(n);
  const auto& theta_arr = as_value_column_array_or_scalar(theta_ref);
  check_bounded(function, "Probability parameter", theta_arr, 0.0, 1.0);
 
  if (size_zero(n, theta)) {
    return 0.0;
  }
 
  auto ops_partials = make_partials_propagator(theta_ref);
 
  // Explicit return for extreme values
  // The gradients are technically ill-defined, but treated as zero
  if (any(n_arr < 0)) {
    return ops_partials.build(0.0);
  } else if (any(n_arr >= 1)) {
    return ops_partials.build(NEGATIVE_INFTY);
  }
 
  size_t theta_size = math::size(theta_arr);
  size_t n_size = math::size(n_arr);
  double broadcast_n = theta_size == n_size ? 1 : n_size;
 
  if (!is_constant_all<T_prob>::value) {
    partials<0>(ops_partials) = inv(theta_arr) * broadcast_n;
  }
 
  return ops_partials.build(sum(log(theta_arr)) * broadcast_n);
}
 
}  // namespace math
}  // namespace stan
#endif