sort_asc.hpp

Go to the documentation of this file.

#ifndef STAN_MATH_PRIM_FUN_SORT_ASC_HPP
#define STAN_MATH_PRIM_FUN_SORT_ASC_HPP
 
#include <stan/math/prim/meta.hpp>
#include <stan/math/prim/err.hpp>
#include <stan/math/prim/fun/Eigen.hpp>
#include <algorithm>
#include <vector>
 
namespace stan {
namespace math {
 
template <typename T>
inline std::vector<T> sort_asc(std::vector<T> xs) {
  check_not_nan("sort_asc", "container argument", xs);
  std::sort(xs.begin(), xs.end());
  return xs;
}
 
template <typename EigVec, require_eigen_vector_t<EigVec>* = nullptr>
inline plain_type_t<EigVec> sort_asc(EigVec&& xs) {
  plain_type_t<EigVec> x = std::forward<EigVec>(xs);
  check_not_nan("sort_asc", "container argument", x);
  std::sort(x.data(), x.data() + x.size());
  return x;
}
 
}  // namespace math
}  // namespace stan
 
#endif