Automatic Differentiation
 
Loading...
Searching...
No Matches
bernoulli_rng.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_PROB_BERNOULLI_RNG_HPP
2#define STAN_MATH_PRIM_PROB_BERNOULLI_RNG_HPP
3
8#include <boost/random/bernoulli_distribution.hpp>
9#include <boost/random/variate_generator.hpp>
10
11namespace stan {
12namespace math {
13
28template <typename T_theta, class RNG>
30 const T_theta& theta, RNG& rng) {
31 using boost::bernoulli_distribution;
32 using boost::variate_generator;
33 static constexpr const char* function = "bernoulli_rng";
34 ref_type_t<T_theta> theta_ref = theta;
35 check_bounded(function, "Probability parameter", value_of(theta_ref), 0.0,
36 1.0);
37
38 scalar_seq_view<T_theta> theta_vec(theta_ref);
39 size_t N = stan::math::size(theta);
41
42 for (size_t n = 0; n < N; ++n) {
43 variate_generator<RNG&, bernoulli_distribution<> > bernoulli_rng(
44 rng, bernoulli_distribution<>(theta_vec[n]));
45 output[n] = bernoulli_rng();
46 }
47
48 return output.data();
49}
50
51} // namespace math
52} // namespace stan
53#endif
typename helper::type type
VectorBuilder allocates type T1 values to be used as intermediate values.
scalar_seq_view provides a uniform sequence-like wrapper around either a scalar or a sequence of scal...
VectorBuilder< true, int, T_theta >::type bernoulli_rng(const T_theta &theta, RNG &rng)
Return a Bernoulli random variate with specified chance of success parameter using the specified rand...
int64_t size(const T &m)
Returns the size (number of the elements) of a matrix_cl or var_value<matrix_cl<T>>.
Definition size.hpp:19
void check_bounded(const char *function, const char *name, const T_y &y, const T_low &low, const T_high &high)
Check if the value is between the low and high values, inclusively.
T value_of(const fvar< T > &v)
Return the value of the specified variable.
Definition value_of.hpp:18
typename ref_type_if< true, T >::type ref_type_t
Definition ref_type.hpp:55
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...