Any.hpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367
  1. /**
  2. * @file artis/kernel/Any.hpp
  3. * @author See the AUTHORS file
  4. */
  5. /*
  6. * Copyright (C) 2012-2019 ULCO http://www.univ-littoral.fr
  7. *
  8. * This program is free software: you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation, either version 3 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  20. */
  21. #ifndef __ARTIS_KERNEL_ANY_HPP
  22. #define __ARTIS_KERNEL_ANY_HPP
  23. #include <artis/context/Value.hpp>
  24. #include <string>
  25. #include <tuple>
  26. #include <utility>
  27. #include <vector>
  28. namespace artis {
  29. namespace kernel {
  30. enum ValueTypeID {
  31. DOUBLE, INT, BOOL, DOUBLE_VECTOR, INT_VECTOR, BOOL_VECTOR,
  32. STRING, USER
  33. };
  34. // template < typename H, typename T >
  35. // struct typelist
  36. // {
  37. // typedef H head;
  38. // typedef T tail;
  39. // };
  40. // struct null_typelist
  41. // { };
  42. // template < typename Fun >
  43. // struct cons;
  44. // template < typename T1 >
  45. // struct cons < void (*)(T1)>
  46. // {
  47. // typedef typelist < T1, null_typelist > type;
  48. // };
  49. // template < typename T1, typename T2 >
  50. // struct cons < void (*)(T1, T2)>
  51. // {
  52. // typedef typelist < T1, typelist < T2, null_typelist > > type;
  53. // };
  54. // template < typename T1, typename T2, typename T3 >
  55. // struct cons < void (*)(T1, T2, T3)>
  56. // {
  57. // typedef typelist < T1, typelist < T2, typelist < T3,
  58. // null_typelist > > > type;
  59. // };
  60. // #define TYPELIST(a) cons < void (*)a >::type
  61. // typedef TYPELIST((double, int, bool)) value_types;
  62. class Any {
  63. private:
  64. struct base {
  65. virtual ~base() { }
  66. virtual base* clone() const = 0;
  67. };
  68. template<typename T, typename V>
  69. struct data : base {
  70. data(V T::* const& value)
  71. :value_(value) { }
  72. base* clone() const { return new data<T, V>(*this); }
  73. V T::* value_;
  74. };
  75. base* ptr_;
  76. /* template < typename V >
  77. friend struct ValueType; */
  78. public:
  79. Any()
  80. :ptr_(nullptr) { }
  81. template<typename T, typename V>
  82. Any(V T::* const& value)
  83. : ptr_(new data<T, V>(value)) { }
  84. Any(Any const& other)
  85. :ptr_(other.ptr_ ? other.ptr_->clone() : nullptr) { }
  86. virtual ~Any() { if (ptr_) delete ptr_; }
  87. void operator=(Any const& other) { Any(other).swap(*this); }
  88. void swap(Any& other) { std::swap(ptr_, other.ptr_); }
  89. template<typename T, typename V>
  90. V T::* get() const { return dynamic_cast < data<T, V>* >(ptr_)->value_; }
  91. bool is_null() const { return ptr_ == nullptr; }
  92. template<typename T, typename V>
  93. void put(T* o, const V& value)
  94. {
  95. V T::* p = dynamic_cast <
  96. data<T, V>* >(ptr_)->value_;
  97. o->*(p) = value;
  98. }
  99. template<typename T>
  100. void restore(T* o, const context::Value& value)
  101. {
  102. if (value.is_type<double>()) {
  103. double v;
  104. value.get_content(v);
  105. put(o, v);
  106. } else if (value.is_type<int>()) {
  107. int v;
  108. value.get_content(v);
  109. put(o, v);
  110. } else if (value.is_type<bool>()) {
  111. bool v;
  112. value.get_content(v);
  113. put(o, v);
  114. } else if (value.is_type<std::vector<double> >()) {
  115. std::vector<double> v;
  116. value.get_content(v);
  117. put(o, v);
  118. } else if (value.is_type<std::vector<int> >()) {
  119. std::vector<int> v;
  120. value.get_content(v);
  121. put(o, v);
  122. } else if (value.is_type<std::vector<bool> >()) {
  123. std::vector<bool> v;
  124. value.get_content(v);
  125. put(o, v);
  126. } else {
  127. assert(false);
  128. }
  129. }
  130. template<typename T>
  131. context::Value save(const T* o) const
  132. {
  133. if (ptr_) {
  134. data<T, double>* q_double =
  135. dynamic_cast < data<T, double>* >(ptr_);
  136. if (q_double) {
  137. return context::Value(o->*(q_double->value_));
  138. } else {
  139. data<T, int>* q_int =
  140. dynamic_cast < data<T, int>* >(ptr_);
  141. if (q_int) {
  142. return context::Value(o->*(q_int->value_));
  143. } else {
  144. data<T, bool>* q_bool =
  145. dynamic_cast < data<T, bool>* >(ptr_);
  146. if (q_bool) {
  147. return context::Value(o->*(q_bool->value_));
  148. } else {
  149. data<T, std::vector<double> >* q_double_v =
  150. dynamic_cast < data<T, std::vector<
  151. double> >* >(ptr_);
  152. if (q_double_v) {
  153. return context::Value(o->*(q_double_v->value_));
  154. } else {
  155. data<T, std::vector<int> >* q_int_v =
  156. dynamic_cast < data<T, std::vector<
  157. int> >* >(ptr_);
  158. if (q_int_v) {
  159. return context::Value(o->*(q_int_v->value_));
  160. } else {
  161. data<T, std::vector<bool> >* q_bool_v =
  162. dynamic_cast < data<T, std::vector<
  163. bool> >* >(ptr_);
  164. if (q_bool_v) {
  165. return context::Value(
  166. o->*(q_bool_v->value_));
  167. }
  168. }
  169. }
  170. }
  171. }
  172. }
  173. }
  174. assert(false);
  175. return context::Value();
  176. }
  177. template<typename T>
  178. std::string to_string(const T* o) const
  179. {
  180. if (ptr_) {
  181. data<T, double>* q_double =
  182. dynamic_cast < data<T, double>* >(ptr_);
  183. if (q_double) {
  184. return std::to_string(o->*(q_double->value_));
  185. } else {
  186. data<T, int>* q_int =
  187. dynamic_cast < data<T, int>* >(ptr_);
  188. if (q_int) {
  189. return std::to_string(o->*(q_int->value_));
  190. } else {
  191. data<T, bool>* q_bool =
  192. dynamic_cast < data<T, bool>* >(ptr_);
  193. if (q_bool) {
  194. return o->*(q_bool->value_) ? "true" : "false";
  195. } else {
  196. data<T, std::vector<double> >* q_double_v =
  197. dynamic_cast < data<T, std::vector<
  198. double> >* >(ptr_);
  199. if (q_double_v) {
  200. return "";
  201. } else {
  202. data<T, std::vector<int> >* q_int_v =
  203. dynamic_cast < data<T, std::vector<
  204. int> >* >(ptr_);
  205. if (q_int_v) {
  206. return "";
  207. } else {
  208. data<T, std::vector<bool> >* q_bool_v =
  209. dynamic_cast < data<T, std::vector<
  210. bool> >* >(ptr_);
  211. if (q_bool_v) {
  212. return "";
  213. } else {
  214. return "NA";
  215. }
  216. }
  217. }
  218. }
  219. }
  220. }
  221. } else {
  222. return "NA";
  223. }
  224. }
  225. };
  226. // template < typename C,
  227. // typename T,
  228. // typename Seq = std::make_integer_sequence
  229. // < int, std::tuple_size < T >::value > >
  230. // struct TupleIterator;
  231. // template < typename C,
  232. // typename T,
  233. // int... S >
  234. // struct TupleIterator < C, T, std::integer_sequence < int, S... > >
  235. // {
  236. // TupleIterator(C caller, const T& val)
  237. // { result = std::make_tuple(caller(std::get < S >(val))...); }
  238. // std::tuple < context::Value, context::Value, context::Value > result;
  239. // };
  240. // template < typename C, typename T >
  241. // TupleIterator < C, T > tuple_iterator(C caller, const T& val)
  242. // {
  243. // return TupleIterator < C, T >(caller, val);
  244. // }
  245. // template < typename T >
  246. // struct ToValueCaller
  247. // {
  248. // ToValueCaller(const Any& any, const T* o) : _any(any), _object(o)
  249. // { }
  250. // template < typename Z >
  251. // context::Value operator()(const Z& data) const
  252. // { return data.to_value(_any, _object); }
  253. // const Any& _any;
  254. // const T* _object;
  255. // };
  256. // template < typename V >
  257. // struct ValueType
  258. // {
  259. // template < typename T >
  260. // context::Value to_value(const Any& any, const T* o) const
  261. // {
  262. // Any::data < T, V >* q = dynamic_cast < Any::data < T, V >* >(any.ptr_);
  263. // if (q) {
  264. // return context::Value(o->*(q->value_));
  265. // } else {
  266. // return context::Value();
  267. // }
  268. // }
  269. // };
  270. // template < typename Tuple, typename F, size_t... Is >
  271. // constexpr auto apply_impl(Tuple t, F f, std::index_sequence < Is... >)
  272. // { return f(std::get < Is >(t)...); }
  273. // template < typename Tuple, typename F >
  274. // constexpr auto apply(Tuple t, F f)
  275. // { return apply_impl(t, f, std::make_index_sequence <
  276. // std::tuple_size < Tuple >{}>{}); }
  277. // struct find_not_null_value
  278. // {
  279. // context::Value operator()(const context::Value& left,
  280. // const context::Value& right) const;
  281. // };
  282. // template < typename T >
  283. // static context::Value to_value(const Any& any, const T* o)
  284. // {
  285. // auto value_types =
  286. // std::make_tuple(ValueType < double >(),
  287. // ValueType < int >(),
  288. // ValueType < bool >());
  289. // auto list = tuple_iterator(ToValueCaller < T >(any, o), value_types);
  290. // auto result = apply(list.result, find_not_null_value{});
  291. // std::cout << result.to_string() << std::endl;
  292. // assert(false);
  293. // }
  294. }
  295. }
  296. #endif