AbstractCoupledModel.hpp 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456
  1. /**
  2. * @file artis/kernel/AbstractCoupledModel.hpp
  3. * @author See the AUTHORS file
  4. */
  5. /*
  6. * Copyright (C) 2012-2017 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_ABSTRACT_COUPLED_MODEL_HPP
  22. #define __ARTIS_KERNEL_ABSTRACT_COUPLED_MODEL_HPP
  23. #include <artis/kernel/AbstractModel.hpp>
  24. #include <artis/kernel/Externals.hpp>
  25. #include <artis/kernel/Internals.hpp>
  26. #include <artis/kernel/States.hpp>
  27. #include <artis/utils/DateTime.hpp>
  28. #include <artis/utils/Trace.hpp>
  29. #include <functional>
  30. #include <vector>
  31. namespace artis { namespace kernel {
  32. template < typename T, typename U, typename V, typename W >
  33. class AbstractCoupledModel : public AbstractModel < U, V >,
  34. public States < T, U >,
  35. public Internals < T, U >,
  36. public Externals < T, U >
  37. {
  38. typedef AbstractModel < U, V > type;
  39. typedef std::map < int, type* > Submodels;
  40. typedef std::map < int,
  41. std::vector < type* > > Setsubmodels;
  42. typedef std::map < int, std::pair < type*,
  43. int > > SubModelInternals;
  44. public:
  45. struct Var
  46. {
  47. unsigned int index;
  48. type* model;
  49. int sub_index;
  50. Var (unsigned int index, type* model, int sub_index) :
  51. index(index), model(model), sub_index(sub_index)
  52. { }
  53. };
  54. AbstractCoupledModel(const type* parent = 0) : type(parent)
  55. { }
  56. virtual ~AbstractCoupledModel()
  57. { }
  58. virtual void after(typename U::type t)
  59. {
  60. #ifdef WITH_TRACE
  61. utils::Trace < utils::DoubleTime >::trace()
  62. << utils::TraceElement < utils::DoubleTime >("KERNEL", t,
  63. utils::KERNEL)
  64. << "AFTER - "
  65. << AbstractCoupledModel < T, U, V, W >::path(this);
  66. utils::Trace < utils::DoubleTime >::trace().flush();
  67. for (size_t i = 0; i < Internals < T, U >::size(); ++i) {
  68. if (not Internals < T, U >::get(i).is_null()) {
  69. utils::Trace < utils::DoubleTime >::trace()
  70. << utils::TraceElement < utils::DoubleTime >("KERNEL", t,
  71. utils::KERNEL)
  72. << Internals < T, U >::name(i) << " = "
  73. << Internals < T, U >::get(i).to_string(
  74. dynamic_cast < const T* >(this));
  75. utils::Trace < utils::DoubleTime >::trace().flush();
  76. }
  77. }
  78. #else
  79. (void) t;
  80. #endif
  81. }
  82. virtual const Node < U >* atomic(unsigned int index) const
  83. {
  84. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  85. submodel_internals.find(index);
  86. if (it == submodel_internals.end()) {
  87. return this;
  88. } else {
  89. return it->second.first->atomic(it->second.second);
  90. }
  91. }
  92. virtual void before(typename U::type t)
  93. {
  94. #ifdef WITH_TRACE
  95. utils::Trace < utils::DoubleTime >::trace()
  96. << utils::TraceElement < utils::DoubleTime >("KERNEL", t,
  97. utils::KERNEL)
  98. << "BEFORE - "
  99. << AbstractCoupledModel < T, U, V, W >::path(this);
  100. utils::Trace < utils::DoubleTime >::trace().flush();
  101. for (size_t i = 0; i < Internals < T, U >::size(); ++i) {
  102. if (not Internals < T, U >::get(i).is_null()) {
  103. utils::Trace < utils::DoubleTime >::trace()
  104. << utils::TraceElement < utils::DoubleTime >("KERNEL", t,
  105. utils::KERNEL)
  106. << Internals < T, U >::name(i) << " = "
  107. << Internals < T, U >::get(i).to_string(
  108. dynamic_cast < const T* >(this));
  109. utils::Trace < utils::DoubleTime >::trace().flush();
  110. }
  111. }
  112. #else
  113. (void) t;
  114. #endif
  115. }
  116. virtual void build(const W& /* parameters */)
  117. { }
  118. virtual void build(const W& /* parameters */,
  119. const std::string& /* json */)
  120. { }
  121. virtual bool check(typename U::type t) const
  122. { return Externals < T, U >::check(t); }
  123. virtual void compute(typename U::type t, bool update) = 0;
  124. virtual const Any& get(typename U::type t, unsigned int index) const
  125. {
  126. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  127. submodel_internals.find(index);
  128. if (it == submodel_internals.end()) {
  129. if (type::last_time != t) {
  130. throw utils::InvalidGet("Variable not computed");
  131. }
  132. return Internals < T, U >::get(index);
  133. } else {
  134. return it->second.first->get(t, it->second.second);
  135. }
  136. }
  137. template < typename Z, typename K >
  138. Z get(typename U::type t, unsigned int index) const
  139. {
  140. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  141. submodel_internals.find(index);
  142. if (it == submodel_internals.end()) {
  143. if (type::last_time != t) {
  144. throw utils::InvalidGet("Variable not computed");
  145. }
  146. const Any& value = Internals < T, U >::get(index);
  147. return static_cast < const T* >(this)->*(value.get < T, Z >());
  148. } else {
  149. const Any& value = it->second.first->get(t, it->second.second);
  150. const Node < U >* object = it->second.first->atomic(
  151. it->second.second);
  152. return static_cast < const K* >(object)->*(value.get < K, Z >());
  153. }
  154. }
  155. virtual std::string get(const ValueType& value_type, typename U::type t,
  156. unsigned int index) const
  157. {
  158. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  159. submodel_internals.find(index);
  160. if (it == submodel_internals.end()) {
  161. Any value = Internals < T, U >::get(index);
  162. switch (value_type) {
  163. case DOUBLE:
  164. return std::to_string(
  165. static_cast < const T* >(this)->*(value.get < T,
  166. double >()));
  167. case INT:
  168. return std::to_string(
  169. static_cast < const T* >(this)->*(value.get < T, int >()));
  170. case BOOL:
  171. return std::to_string(
  172. static_cast < const T* >(this)->*(value.get < T, bool >()));
  173. default: return "NA";
  174. }
  175. } else {
  176. return it->second.first->get(value_type, t, it->second.second);
  177. }
  178. }
  179. virtual void init(typename U::type t, const V& parameters) = 0;
  180. virtual bool is_atomic() const
  181. { return false; }
  182. bool is_computed(typename U::type t, unsigned int index) const
  183. {
  184. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  185. submodel_internals.find(index);
  186. if (it == submodel_internals.end()) {
  187. return false;
  188. } else {
  189. return it->second.first->is_computed(t, it->second.second);
  190. }
  191. }
  192. bool is_stable(typename U::type t) const
  193. {
  194. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  195. submodel_internals.begin();
  196. bool stable = true;
  197. while (it != submodel_internals.end() and stable) {
  198. stable = it->second.first->is_stable(t);
  199. ++it;
  200. }
  201. return stable;
  202. }
  203. virtual bool is_updated() const
  204. { return Externals < T, U >::updated; }
  205. virtual const Node < U >* get_submodel(unsigned int index) const
  206. {
  207. typename AbstractCoupledModel::Submodels::const_iterator it =
  208. submodels.find(index);
  209. if (it != submodels.end()) {
  210. return it->second;
  211. } else {
  212. return 0;
  213. }
  214. }
  215. virtual const Node < U >* get_submodel(unsigned int index,
  216. unsigned int rank) const
  217. {
  218. typename AbstractCoupledModel::Setsubmodels::const_iterator it =
  219. setsubmodels.find(index);
  220. if (it != setsubmodels.end() and it->second.size() > rank) {
  221. return it->second.at(rank);
  222. } else {
  223. return 0;
  224. }
  225. }
  226. virtual std::string path_index(const AbstractModel < U, V >* child,
  227. int& index) const
  228. {
  229. typename Setsubmodels::const_iterator it = setsubmodels.begin();
  230. bool found = false;
  231. index = -1;
  232. while (not found and it != setsubmodels.end()) {
  233. typename std::vector < type* >::const_iterator itm =
  234. it->second.begin();
  235. index = 0;
  236. while (not found and itm != it->second.end()) {
  237. found = *itm == child;
  238. if (not found) {
  239. ++index;
  240. ++itm;
  241. }
  242. }
  243. index = found ? index : -1;
  244. ++it;
  245. }
  246. if (type::parent) {
  247. int i;
  248. std::string p = type::parent->path_index(this, i);
  249. if (i >= 0) {
  250. return p +
  251. "/[" + std::to_string(i) + "]" +
  252. boost::core::demangle(typeid(*this).name());
  253. } else {
  254. return p + "/" + boost::core::demangle(typeid(*this).name());
  255. }
  256. } else {
  257. return boost::core::demangle(typeid(*this).name());
  258. }
  259. }
  260. virtual void restore(const context::State < U >& state)
  261. {
  262. typename AbstractCoupledModel::Submodels::const_iterator it =
  263. submodels.begin();
  264. while (it != submodels.end()) {
  265. it->second->restore(state.get_substate(it->first));
  266. ++it;
  267. }
  268. States < T, U >::restore(state);
  269. Internals < T, U >::restore(state);
  270. }
  271. virtual void save(context::State < U >& state) const
  272. {
  273. typename AbstractCoupledModel::Submodels::const_iterator it =
  274. submodels.begin();
  275. while (it != submodels.end()) {
  276. context::State < U > substate;
  277. it->second->save(substate);
  278. state.add_substate(it->first, substate);
  279. ++it;
  280. }
  281. States < T, U >::save(state);
  282. Internals < T, U >::save(state);
  283. }
  284. virtual void stable()
  285. { Externals < T, U >::updated = false; }
  286. void submodel(unsigned int index, type* model)
  287. {
  288. if (model) {
  289. submodels[index] = model;
  290. model->set_parent(this);
  291. } else {
  292. submodels[index] = 0;
  293. }
  294. }
  295. protected:
  296. void change_internal(unsigned int index, double T::* var)
  297. {
  298. submodel_internals.erase(index);
  299. Internals < T, U >::internal(index, var);
  300. }
  301. void change_internal(unsigned int index, int T::* var)
  302. {
  303. submodel_internals.erase(index);
  304. Internals < T, U >::internalI(index, var);
  305. }
  306. void change_internal(unsigned int index, bool T::* var)
  307. {
  308. submodel_internals.erase(index);
  309. Internals < T, U >::internalB(index, var);
  310. }
  311. void internal_(unsigned int index, type* model, int sub_index)
  312. {
  313. submodel_internals[index] =
  314. std::pair < type*, int >(model, sub_index);
  315. }
  316. void I_(std::initializer_list < Var > internals)
  317. {
  318. for (typename std::initializer_list < Var >::iterator it =
  319. internals.begin(); it != internals.end(); ++it) {
  320. submodel_internals[it->index] =
  321. std::pair < type*, int >(it->model, it->sub_index);
  322. }
  323. }
  324. void SM_(std::initializer_list < std::pair < unsigned int,
  325. type* > > models)
  326. {
  327. for (typename std::initializer_list < std::pair < unsigned int,
  328. type* > >::iterator it =
  329. models.begin(); it != models.end(); ++it) {
  330. submodels[it->first] = it->second;
  331. it->second->set_parent(this);
  332. }
  333. }
  334. void setsubmodel(unsigned int index, type* model)
  335. {
  336. if (setsubmodels.find(index) == setsubmodels.end()) {
  337. setsubmodels[index] = std::vector < type* >();
  338. }
  339. setsubmodels[index].push_back(model);
  340. model->set_parent(this);
  341. }
  342. private:
  343. SubModelInternals submodel_internals;
  344. Submodels submodels;
  345. Setsubmodels setsubmodels;
  346. };
  347. #define InternalS(index, var, sub_index) internal_(index, var, sub_index)
  348. #define ITEM_S(index, var, sub_index) Var(index, var, sub_index)
  349. #define UNWRAP_ITEM_S(...) ITEM_S __VA_ARGS__
  350. #define LIST_S_16(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, L13, L14, L15, L16) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7), UNWRAP_ITEM_S(L8), UNWRAP_ITEM_S(L9), UNWRAP_ITEM_S(L10), UNWRAP_ITEM_S(L11), UNWRAP_ITEM_S(L12), UNWRAP_ITEM_S(L13), UNWRAP_ITEM_S(L14), UNWRAP_ITEM_S(L15), UNWRAP_ITEM_S(L16) }
  351. #define LIST_S_15(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, L13, L14, L15) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7), UNWRAP_ITEM_S(L8), UNWRAP_ITEM_S(L9), UNWRAP_ITEM_S(L10), UNWRAP_ITEM_S(L11), UNWRAP_ITEM_S(L12), UNWRAP_ITEM_S(L13), UNWRAP_ITEM_S(L14), UNWRAP_ITEM_S(L15) }
  352. #define LIST_S_14(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, L13, L14) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7), UNWRAP_ITEM_S(L8), UNWRAP_ITEM_S(L9), UNWRAP_ITEM_S(L10), UNWRAP_ITEM_S(L11), UNWRAP_ITEM_S(L12), UNWRAP_ITEM_S(L13), UNWRAP_ITEM_S(L14) }
  353. #define LIST_S_13(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, L13) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7), UNWRAP_ITEM_S(L8), UNWRAP_ITEM_S(L9), UNWRAP_ITEM_S(L10), UNWRAP_ITEM_S(L11), UNWRAP_ITEM_S(L12), UNWRAP_ITEM_S(L13) }
  354. #define LIST_S_12(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7), UNWRAP_ITEM_S(L8), UNWRAP_ITEM_S(L9), UNWRAP_ITEM_S(L10), UNWRAP_ITEM_S(L11), UNWRAP_ITEM_S(L12) }
  355. #define LIST_S_11(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7), UNWRAP_ITEM_S(L8), UNWRAP_ITEM_S(L9), UNWRAP_ITEM_S(L10), UNWRAP_ITEM_S(L11) }
  356. #define LIST_S_10(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7), UNWRAP_ITEM_S(L8), UNWRAP_ITEM_S(L9), UNWRAP_ITEM_S(L10) }
  357. #define LIST_S_9(L1, L2, L3, L4, L5, L6, L7, L8, L9) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7), UNWRAP_ITEM_S(L8), UNWRAP_ITEM_S(L9) }
  358. #define LIST_S_8(L1, L2, L3, L4, L5, L6, L7, L8) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7), UNWRAP_ITEM_S(L8) }
  359. #define LIST_S_7(L1, L2, L3, L4, L5, L6, L7) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6), UNWRAP_ITEM_S(L7) }
  360. #define LIST_S_6(L1, L2, L3, L4, L5, L6) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5), UNWRAP_ITEM_S(L6) }
  361. #define LIST_S_5(L1, L2, L3, L4, L5) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4), UNWRAP_ITEM_S(L5) }
  362. #define LIST_S_4(L1, L2, L3, L4) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4) }
  363. #define LIST_S_3(L1, L2, L3) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3) }
  364. #define LIST_S_2(L1, L2) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2) }
  365. #define LIST_S_1(L1) { UNWRAP_ITEM_S(L1) }
  366. #define UNWRAP_S_2(...) GET_MACRO(__VA_ARGS__, LIST_S_16, LIST_S_15, LIST_S_14, LIST_S_13, LIST_S_12, LIST_S_11, LIST_S_10, LIST_S_9, LIST_S_8, LIST_S_7, LIST_S_6, LIST_S_5, LIST_S_4, LIST_S_3, LIST_S_2, LIST_S_1)(__VA_ARGS__)
  367. #define InternalsS(L) I_(UNWRAP_S_2 L)
  368. #define ITEM_Sub(index, model) { index, model }
  369. #define UNWRAP_ITEM_Sub(...) ITEM_Sub __VA_ARGS__
  370. #define LIST_Sub_16(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, L13, L14, L15, L16) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7), UNWRAP_ITEM_Sub(L8), UNWRAP_ITEM_Sub(L9), UNWRAP_ITEM_Sub(L10), UNWRAP_ITEM_Sub(L11), UNWRAP_ITEM_Sub(L12), UNWRAP_ITEM_Sub(L13), UNWRAP_ITEM_Sub(L14), UNWRAP_ITEM_Sub(L15), UNWRAP_ITEM_Sub(L16) }
  371. #define LIST_Sub_15(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, L13, L14, L15) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7), UNWRAP_ITEM_Sub(L8), UNWRAP_ITEM_Sub(L9), UNWRAP_ITEM_Sub(L10), UNWRAP_ITEM_Sub(L11), UNWRAP_ITEM_Sub(L12), UNWRAP_ITEM_Sub(L13), UNWRAP_ITEM_Sub(L14), UNWRAP_ITEM_Sub(L15) }
  372. #define LIST_Sub_14(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, L13, L14) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7), UNWRAP_ITEM_Sub(L8), UNWRAP_ITEM_Sub(L9), UNWRAP_ITEM_Sub(L10), UNWRAP_ITEM_Sub(L11), UNWRAP_ITEM_Sub(L12), UNWRAP_ITEM_Sub(L13), UNWRAP_ITEM_Sub(L14) }
  373. #define LIST_Sub_13(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, L13) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7), UNWRAP_ITEM_Sub(L8), UNWRAP_ITEM_Sub(L9), UNWRAP_ITEM_Sub(L10), UNWRAP_ITEM_Sub(L11), UNWRAP_ITEM_Sub(L12), UNWRAP_ITEM_Sub(L13) }
  374. #define LIST_Sub_12(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7), UNWRAP_ITEM_Sub(L8), UNWRAP_ITEM_Sub(L9), UNWRAP_ITEM_Sub(L10), UNWRAP_ITEM_Sub(L11), UNWRAP_ITEM_Sub(L12) }
  375. #define LIST_Sub_11(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7), UNWRAP_ITEM_Sub(L8), UNWRAP_ITEM_Sub(L9), UNWRAP_ITEM_Sub(L10), UNWRAP_ITEM_Sub(L11) }
  376. #define LIST_Sub_10(L1, L2, L3, L4, L5, L6, L7, L8, L9, L10) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7), UNWRAP_ITEM_Sub(L8), UNWRAP_ITEM_Sub(L9), UNWRAP_ITEM_Sub(L10) }
  377. #define LIST_Sub_9(L1, L2, L3, L4, L5, L6, L7, L8, L9) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7), UNWRAP_ITEM_Sub(L8), UNWRAP_ITEM_Sub(L9) }
  378. #define LIST_Sub_8(L1, L2, L3, L4, L5, L6, L7, L8) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7), UNWRAP_ITEM_Sub(L8) }
  379. #define LIST_Sub_7(L1, L2, L3, L4, L5, L6, L7) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6), UNWRAP_ITEM_Sub(L7) }
  380. #define LIST_Sub_6(L1, L2, L3, L4, L5, L6) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5), UNWRAP_ITEM_Sub(L6) }
  381. #define LIST_Sub_5(L1, L2, L3, L4, L5) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4), UNWRAP_ITEM_Sub(L5) }
  382. #define LIST_Sub_4(L1, L2, L3, L4) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4) }
  383. #define LIST_Sub_3(L1, L2, L3) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3) }
  384. #define LIST_Sub_2(L1, L2) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2) }
  385. #define LIST_Sub_1(L1) { UNWRAP_ITEM_Sub(L1) }
  386. #define UNWRAP_Sub_2(...) GET_MACRO(__VA_ARGS__, LIST_Sub_16, LIST_Sub_15, LIST_Sub_14, LIST_Sub_13, LIST_Sub_12, LIST_Sub_11, LIST_Sub_10, LIST_Sub_9, LIST_Sub_8, LIST_Sub_7, LIST_Sub_6, LIST_Sub_5, LIST_Sub_4, LIST_Sub_3, LIST_Sub_2, LIST_Sub_1)(__VA_ARGS__)
  387. #define Submodels(L) SM_(UNWRAP_Sub_2 L)
  388. } }
  389. #endif