math/one__hot__int__array_8hpp_source.html

#ifndef STAN_MATH_PRIM_FUN_ONE_HOT_INT_ARRAY_HPP

#define STAN_MATH_PRIM_FUN_ONE_HOT_INT_ARRAY_HPP


#include <stan/math/prim/err.hpp>

#include <vector>


namespace stan {

namespace math {


inline std::vector<int> one_hot_int_array(int K, int k) {

  static constexpr const char* function = "one_hot_int_array";

  check_positive(function, "size", K);

  check_bounded(function, "k", k, 1, K);


  std::vector<int> v(K, 0);

  v[k - 1] = 1;

  return v;

}


}  // namespace math

}  // namespace stan


#endif

stan::math::check_bounded
void check_bounded(const char *function, const char *name, const T_y &y, const T_low &low, const T_high &high)
Check if the value is between the low and high values, inclusively.
Definition check_bounded.hpp:75

stan::math::check_positive
void check_positive(const char *function, const char *name, const T_y &y)
Check if y is positive.
Definition check_positive.hpp:27

stan::math::one_hot_int_array
std::vector< int > one_hot_int_array(int K, int k)
Return an integer array with 1 in the k-th position and zero elsewhere.
Definition one_hot_int_array.hpp:20

stan
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...
Definition unit_vector_constrain.hpp:15

err.hpp