1 #ifndef STAN_MATH_PRIM_FUN_REP_ARRAY_HPP
2 #define STAN_MATH_PRIM_FUN_REP_ARRAY_HPP
3
4 #include <stan/math/prim/meta.hpp>
5 #include <stan/math/prim/err.hpp>
6 #include <vector>
7
8 namespace stan {
9 namespace math {
10
11 template <typename T_ret, typename In, require_std_vector_t<T_ret>* = nullptr>
rep_array(const In & x,int n)12 inline std::vector<plain_type_t<In>> rep_array(const In& x, int n) {
13 using T = plain_type_t<In>;
14 check_nonnegative("rep_array", "n", n);
15 return std::vector<T>(n, x);
16 }
17 template <typename In>
rep_array(const In & x,int n)18 inline std::vector<plain_type_t<In>> rep_array(const In& x, int n) {
19 return rep_array<std::vector<plain_type_t<In>>>(x, n);
20 }
21
22 template <typename In>
rep_array(const In & x,int m,int n)23 inline std::vector<std::vector<plain_type_t<In>>> rep_array(const In& x, int m,
24 int n) {
25 using std::vector;
26 using T = plain_type_t<In>;
27 check_nonnegative("rep_array", "rows", m);
28 check_nonnegative("rep_array", "cols", n);
29 return vector<vector<T>>(m, vector<T>(n, x));
30 }
31
32 template <typename In>
rep_array(const In & x,int k,int m,int n)33 inline std::vector<std::vector<std::vector<plain_type_t<In>>>> rep_array(
34 const In& x, int k, int m, int n) {
35 using std::vector;
36 using T = plain_type_t<In>;
37 check_nonnegative("rep_array", "shelfs", k);
38 check_nonnegative("rep_array", "rows", m);
39 check_nonnegative("rep_array", "cols", n);
40 return vector<vector<vector<T>>>(k, vector<vector<T>>(m, vector<T>(n, x)));
41 }
42
43 } // namespace math
44 } // namespace stan
45
46 #endif
47