Stan Math Library  2.12.0
reverse mode automatic differentiation
check_positive.hpp
Go to the documentation of this file.
1 #ifndef STAN_MATH_PRIM_SCAL_ERR_CHECK_POSITIVE_HPP
2 #define STAN_MATH_PRIM_SCAL_ERR_CHECK_POSITIVE_HPP
3 
10 #include <boost/type_traits/is_unsigned.hpp>
11 
12 namespace stan {
13  namespace math {
14 
15  namespace {
16 
17  template <typename T_y, bool is_vec>
18  struct positive {
19  static bool check(const char* function,
20  const char* name,
21  const T_y& y) {
22  // have to use not is_unsigned. is_signed will be false
23  // floating point types that have no unsigned versions.
24  if (!boost::is_unsigned<T_y>::value && !(y > 0))
25  domain_error(function, name, y,
26  "is ", ", but must be > 0!");
27  return true;
28  }
29  };
30 
31  template <typename T_y>
32  struct positive<T_y, true> {
33  static bool check(const char* function,
34  const char* name,
35  const T_y& y) {
36  using stan::length;
37  for (size_t n = 0; n < length(y); n++) {
38  if (!boost::is_unsigned<typename value_type<T_y>::type>::value
39  && !(stan::get(y, n) > 0))
40  domain_error_vec(function, name, y, n,
41  "is ", ", but must be > 0!");
42  }
43  return true;
44  }
45  };
46 
47  }
48 
65  template <typename T_y>
66  inline bool check_positive(const char* function,
67  const char* name,
68  const T_y& y) {
69  return positive<T_y, is_vector_like<T_y>::value>
70  ::check(function, name, y);
71  }
72 
73  }
74 }
75 #endif
size_t length(const std::vector< T > &x)
Definition: length.hpp:10
bool check_positive(const char *function, const char *name, const T_y &y)
Return true if y is positive.
void domain_error_vec(const char *function, const char *name, const T &y, const size_t i, const char *msg1, const char *msg2)
Throw a domain error with a consistently formatted message.
T get(const std::vector< T > &x, size_t n)
Definition: get.hpp:10
void domain_error(const char *function, const char *name, const T &y, const char *msg1, const char *msg2)
Throw a domain error with a consistently formatted message.

     [ Stan Home Page ] © 2011–2016, Stan Development Team.