Automatic Differentiation
 
Loading...
Searching...
No Matches
double_exponential_rng.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_PROB_DOUBLE_EXPONENTIAL_RNG_HPP
2#define STAN_MATH_PRIM_PROB_DOUBLE_EXPONENTIAL_RNG_HPP
3
10#include <boost/random/uniform_real_distribution.hpp>
11#include <boost/random/variate_generator.hpp>
12#include <cmath>
13
14namespace stan {
15namespace math {
16
35template <typename T_loc, typename T_scale, class RNG>
37double_exponential_rng(const T_loc& mu, const T_scale& sigma, RNG& rng) {
38 using boost::variate_generator;
39 using boost::random::uniform_real_distribution;
40 using T_mu_ref = ref_type_t<T_loc>;
41 using T_sigma_ref = ref_type_t<T_scale>;
42 static constexpr const char* function = "double_exponential_rng";
43 check_consistent_sizes(function, "Location parameter", mu, "Scale Parameter",
44 sigma);
45 if (size_zero(mu, sigma)) {
46 return {};
47 }
48
49 T_mu_ref mu_ref = mu;
50 T_sigma_ref sigma_ref = sigma;
51 check_finite(function, "Location parameter", mu_ref);
52 check_positive_finite(function, "Scale parameter", sigma_ref);
53
54 scalar_seq_view<T_mu_ref> mu_vec(mu_ref);
55 scalar_seq_view<T_sigma_ref> sigma_vec(sigma_ref);
56 size_t N = max_size(mu, sigma);
58
59 variate_generator<RNG&, uniform_real_distribution<> > z_rng(
60 rng, uniform_real_distribution<>(-1.0, 1.0));
61 for (size_t n = 0; n < N; ++n) {
62 double z = z_rng();
63 output[n] = mu_vec[n]
64 - ((z > 0) ? 1.0 : -1.0) * sigma_vec[n] * std::log(std::abs(z));
65 }
66
67 return output.data();
68}
69
70} // namespace math
71} // namespace stan
72#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_loc, T_scale >::type double_exponential_rng(const T_loc &mu, const T_scale &sigma, RNG &rng)
Return a double exponential random variate with the given location and scale using the specified rand...
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.
void check_finite(const char *function, const char *name, const T_y &y)
Return true if all values in y are finite.
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 ...