Automatic Differentiation
 
Loading...
Searching...
No Matches
check_std_vector_index.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_ERR_CHECK_STD_VECTOR_INDEX_HPP
2#define STAN_MATH_PRIM_ERR_CHECK_STD_VECTOR_INDEX_HPP
3
6
7#include <sstream>
8#include <string>
9#include <vector>
10
11namespace stan {
12namespace math {
13
25template <typename T>
26inline void check_std_vector_index(const char* function, const char* name,
27 const std::vector<T>& y, int i) {
29 if (!(i >= static_cast<int>(stan::error_index::value)
30 && i < static_cast<int>(y.size() + stan::error_index::value))) {
31 [&]() STAN_COLD_PATH {
32 std::stringstream msg;
33 msg << " for " << name;
34 std::string msg_str(msg.str());
35 out_of_range(function, y.size(), i, msg_str.c_str());
36 }();
37 }
38}
39
40} // namespace math
41} // namespace stan
42#endif
#define STAN_COLD_PATH
#define STAN_NO_RANGE_CHECKS_RETURN
Turns all range and size checks into no-ops.
void out_of_range(const char *function, int max, int index, const char *msg1="", const char *msg2="")
Throw an out_of_range exception with a consistently formatted message.
void check_std_vector_index(const char *function, const char *name, const std::vector< T > &y, int i)
Check if the specified index is valid in std vector This check is 1-indexed by default.
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...