Automatic Differentiation
 
Loading...
Searching...
No Matches
weibull_rng.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_PROB_WEIBULL_RNG_HPP
2#define STAN_MATH_PRIM_PROB_WEIBULL_RNG_HPP
3
9#include <boost/random/weibull_distribution.hpp>
10#include <boost/random/variate_generator.hpp>
11
12namespace stan {
13namespace math {
14
33template <typename T_shape, typename T_scale, class RNG>
35 const T_shape& alpha, const T_scale& sigma, RNG& rng) {
36 using boost::variate_generator;
37 using boost::random::weibull_distribution;
38 using T_alpha_ref = ref_type_t<T_shape>;
39 using T_sigma_ref = ref_type_t<T_scale>;
40 static constexpr const char* function = "weibull_rng";
41 check_consistent_sizes(function, "Shape parameter", alpha, "Scale Parameter",
42 sigma);
43 if (size_zero(alpha, sigma)) {
44 return {};
45 }
46 T_alpha_ref alpha_ref = alpha;
47 T_sigma_ref sigma_ref = sigma;
48 check_positive_finite(function, "Shape parameter", alpha_ref);
49 check_positive_finite(function, "Scale parameter", sigma_ref);
50
51 scalar_seq_view<T_alpha_ref> alpha_vec(alpha_ref);
52 scalar_seq_view<T_sigma_ref> sigma_vec(sigma_ref);
53 size_t N = max_size(alpha, sigma);
55
56 for (size_t n = 0; n < N; ++n) {
57 variate_generator<RNG&, weibull_distribution<> > weibull_rng(
58 rng, weibull_distribution<>(alpha_vec[n], sigma_vec[n]));
59 output[n] = weibull_rng();
60 }
61
62 return output.data();
63}
64
65} // namespace math
66} // namespace stan
67#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, double, T_shape, T_scale >::type weibull_rng(const T_shape &alpha, const T_scale &sigma, RNG &rng)
Return a Weibull random variate for the given shape and scale parameters using the specified random n...
bool size_zero(const T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
Definition size_zero.hpp:19
void check_consistent_sizes(const char *)
Trivial no input case, this function is a no-op.
int64_t max_size(const T1 &x1, const Ts &... xs)
Calculate the size of the largest input.
Definition max_size.hpp:20
void check_positive_finite(const char *function, const char *name, const T_y &y)
Check if y is positive and finite.
typename ref_type_if< true, T >::type ref_type_t
Definition ref_type.hpp:56
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...