append_array.hpp

Go to the documentation of this file.

#ifndef STAN_MATH_PRIM_FUN_APPEND_ARRAY_HPP
#define STAN_MATH_PRIM_FUN_APPEND_ARRAY_HPP
 
#include <stan/math/prim/meta.hpp>
#include <stan/math/prim/err.hpp>
#include <stan/math/prim/fun/Eigen.hpp>
#include <stan/math/prim/fun/dims.hpp>
#include <stan/math/prim/fun/resize.hpp>
#include <stan/math/prim/fun/assign.hpp>
#include <vector>
 
namespace stan {
namespace math {
 
template <typename T1, typename T2>
inline typename append_return_type<std::vector<T1>, std::vector<T2> >::type
append_array(const std::vector<T1>& x, const std::vector<T2>& y) {
  typename append_return_type<std::vector<T1>, std::vector<T2> >::type z;
  std::vector<int> zdims;
  if (x.empty()) {
    zdims = dims(y);
    zdims[0] += x.size();
  } else {
    zdims = dims(x);
    zdims[0] += y.size();
  }
  resize(z, zdims);
  for (size_t i = 0; i < x.size(); ++i) {
    assign(z[i], x[i]);
  }
  for (size_t i = 0; i < y.size(); ++i) {
    assign(z[i + x.size()], y[i]);
  }
  return z;
}
 
template <typename T1>
inline std::vector<T1> append_array(const std::vector<T1>& x,
                                    const std::vector<T1>& y) {
  std::vector<T1> z;
 
  if (!x.empty() && !y.empty()) {
    std::vector<int> xdims = dims(x), ydims = dims(y);
    check_matching_sizes("append_array", "dimension of x", xdims,
                         "dimension of y", ydims);
    for (size_t i = 1; i < xdims.size(); ++i) {
      check_size_match("append_array", "shape of x", xdims[i], "shape of y",
                       ydims[i]);
    }
  }
 
  z.reserve(x.size() + y.size());
  z.insert(z.end(), x.begin(), x.end());
  z.insert(z.end(), y.begin(), y.end());
  return z;
}
 
}  // namespace math
}  // namespace stan
 
#endif