1#ifndef STAN_MATH_PRIM_PROB_CAUCHY_RNG_HPP
2#define STAN_MATH_PRIM_PROB_CAUCHY_RNG_HPP
8#include <boost/random/cauchy_distribution.hpp>
9#include <boost/random/variate_generator.hpp>
32template <
typename T_loc,
typename T_scale,
class RNG>
34 const T_loc& mu,
const T_scale& sigma, RNG& rng) {
35 using boost::variate_generator;
36 using boost::random::cauchy_distribution;
37 static constexpr const char* function =
"cauchy_rng";
43 T_sigma_ref sigma_ref = sigma;
52 for (
size_t n = 0; n < N; ++n) {
53 variate_generator<RNG&, cauchy_distribution<> >
cauchy_rng(
54 rng, cauchy_distribution<>(mu_vec[n], sigma_vec[n]));
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 cauchy_rng(const T_loc &mu, const T_scale &sigma, RNG &rng)
Return a Cauchy random variate for the given location and scale using the specified random number gen...
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.
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
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...