AbstractCoupledModel.hpp 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592
  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 Simulator;
  34. template < typename T, typename U, typename V, typename W >
  35. class AbstractCoupledModel : public AbstractModel < U, V >,
  36. public States < T, U, V >,
  37. public Internals < T, U, V >,
  38. public Externals < T, U, V >
  39. {
  40. typedef AbstractModel < U, V > type;
  41. typedef std::map < int, type* > Submodels;
  42. typedef std::map < int,
  43. std::vector < type* > > Setsubmodels;
  44. typedef std::map < int, std::pair < type*,
  45. int > > SubModelInternals;
  46. using Externals < T, U, V >::restore;
  47. using Internals < T, U, V >::restore;
  48. using States < T, U, V >::restore;
  49. using Externals < T, U, V >::save;
  50. using Internals < T, U, V >::save;
  51. using States < T, U, V >::save;
  52. #ifdef WITH_TRACE
  53. friend class Simulator < T, U, V, W >;
  54. #endif
  55. public:
  56. struct Var
  57. {
  58. unsigned int index;
  59. type* model;
  60. int sub_index;
  61. std::string var_name;
  62. std::string sub_var_name;
  63. Var (unsigned int index, std::string var_name,
  64. type* model, int sub_index, std::string sub_var_name) :
  65. index(index), model(model), sub_index(sub_index),
  66. var_name(var_name), sub_var_name(sub_var_name)
  67. { }
  68. };
  69. AbstractCoupledModel(const type* parent = 0) : type(parent)
  70. {
  71. #ifdef WITH_TRACE
  72. utils::Trace < utils::DoubleTime >::trace()
  73. << utils::TraceElement < utils::DoubleTime >(
  74. true,
  75. boost::core::demangle(typeid(T).name()),
  76. utils::DoubleTime::null,
  77. utils::CONSTRUCT);
  78. utils::Trace < utils::DoubleTime >::trace().flush();
  79. #endif
  80. }
  81. virtual ~AbstractCoupledModel()
  82. {
  83. #ifdef WITH_TRACE
  84. trace_element(true, utils::DoubleTime::null,
  85. utils::DESTRUCT);
  86. #endif
  87. }
  88. virtual void after(typename U::type t)
  89. {
  90. #ifdef WITH_TRACE
  91. trace_element(true, t, utils::AFTER_COMPUTE);
  92. trace_internals(true, t, utils::AFTER_COMPUTE);
  93. #else
  94. (void) t;
  95. #endif
  96. }
  97. virtual const Node < U >* atomic(unsigned int index) const
  98. {
  99. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  100. submodel_internals.find(index);
  101. if (it == submodel_internals.end()) {
  102. return this;
  103. } else {
  104. return it->second.first->atomic(it->second.second);
  105. }
  106. }
  107. virtual void before(typename U::type t)
  108. {
  109. #ifdef WITH_TRACE
  110. trace_element(true, t, utils::BEFORE_COMPUTE);
  111. trace_internals(true, t, utils::BEFORE_COMPUTE);
  112. trace_externals(true, t, utils::BEFORE_COMPUTE);
  113. #else
  114. (void) t;
  115. #endif
  116. }
  117. virtual void build(W& /* parameters */)
  118. { }
  119. virtual void build(W& /* parameters */, const std::string& /* json */)
  120. { }
  121. virtual bool check(typename U::type t) const
  122. { return Externals < T, U, V >::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, V >::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, V >::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 ValueTypeID& 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, V >::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, V >::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, V >::restore(this, state);
  269. Internals < T, U, V >::restore(this, state);
  270. Externals < T, U, V >::restore(this, state);
  271. }
  272. virtual void save(context::State < U >& state) const
  273. {
  274. typename AbstractCoupledModel::Submodels::const_iterator it =
  275. submodels.begin();
  276. while (it != submodels.end()) {
  277. context::State < U > substate;
  278. it->second->save(substate);
  279. state.add_substate(it->first, substate);
  280. ++it;
  281. }
  282. States < T, U, V >::save(this, state);
  283. Internals < T, U, V >::save(this, state);
  284. Externals < T, U, V >::save(this, state);
  285. }
  286. virtual void stable()
  287. { Externals < T, U, V >::updated = false; }
  288. void submodel(unsigned int index, type* model)
  289. {
  290. if (model) {
  291. submodels[index] = model;
  292. model->set_parent(this);
  293. } else {
  294. submodels[index] = 0;
  295. }
  296. }
  297. virtual void trace_element(typename U::type t,
  298. utils::TraceType type = utils::NONE,
  299. std::string comment = "") const
  300. { trace_element(false, t, type, comment); }
  301. virtual void trace_internals(typename U::type t,
  302. utils::TraceType type) const
  303. { trace_internals(false, t, type); }
  304. virtual void trace_externals(typename U::type t,
  305. utils::TraceType type = utils::NONE) const
  306. { trace_externals(false, t, type); }
  307. virtual void trace_model(typename U::type t,
  308. utils::TraceType type = utils::NONE) const
  309. { trace_model(false, t, type); }
  310. private:
  311. void trace_element(bool from_kernel, typename U::type t,
  312. utils::TraceType type = utils::NONE,
  313. std::string comment = "") const
  314. {
  315. utils::Trace < utils::DoubleTime >::trace()
  316. << utils::TraceElement < utils::DoubleTime >(
  317. from_kernel,
  318. AbstractCoupledModel < T, U, V, W >::path(this),
  319. t, type)
  320. << comment;
  321. utils::Trace < utils::DoubleTime >::trace().flush();
  322. }
  323. void trace_internals(bool from_kernel, typename U::type t,
  324. utils::TraceType type) const
  325. {
  326. for (size_t i = 0; i < Internals < T, U, V >::size(); ++i) {
  327. if (not Internals < T, U, V >::get(i).is_null()) {
  328. utils::Trace < utils::DoubleTime >::trace()
  329. << utils::TraceElement < utils::DoubleTime >(
  330. from_kernel,
  331. AbstractCoupledModel < T, U, V, W >::path(this),
  332. t, type)
  333. << utils::KernelInfo(
  334. Internals < T, U, V >::name(i), true,
  335. Internals < T, U, V >::get(i).to_string(
  336. dynamic_cast < const T* >(this))
  337. );
  338. utils::Trace < utils::DoubleTime >::trace().flush();
  339. }
  340. }
  341. }
  342. void trace_externals(bool from_kernel, typename U::type t,
  343. utils::TraceType type = utils::NONE) const
  344. {
  345. for (size_t i = 0; i < Externals < T, U, V >::size(); ++i) {
  346. if (not Externals < T, U, V >::get(i).is_null()) {
  347. utils::Trace < utils::DoubleTime >::trace()
  348. << utils::TraceElement < utils::DoubleTime >(
  349. from_kernel,
  350. AbstractCoupledModel < T, U, V, W >::path(this),
  351. t, type)
  352. << utils::KernelInfo(
  353. Externals < T, U, V >::name(i), false,
  354. Externals < T, U, V >::get(i).to_string(
  355. dynamic_cast < const T* >(this))
  356. );
  357. utils::Trace < utils::DoubleTime >::trace().flush();
  358. }
  359. }
  360. }
  361. void trace_model(bool from_kernel, typename U::type t,
  362. utils::TraceType type = utils::NONE) const
  363. {
  364. trace_element(from_kernel, t, type);
  365. trace_internals(from_kernel, t, type);
  366. trace_externals(from_kernel, t, type);
  367. // typename AbstractCoupledModel::Submodels::const_iterator it =
  368. // submodels.begin();
  369. // while (it != submodels.end()) {
  370. // it->second->trace_model(from_kernel, t, type);
  371. // ++it;
  372. // }
  373. }
  374. protected:
  375. void link_internal_(unsigned int index, std::string var_name,
  376. type* model, int sub_index, std::string sub_var_name)
  377. {
  378. submodel_internals[index] =
  379. std::pair < type*, int >(model, sub_index);
  380. #ifdef WITH_TRACE
  381. utils::Trace < utils::DoubleTime >::trace()
  382. << utils::TraceElement < utils::DoubleTime >(
  383. true,
  384. AbstractCoupledModel < T, U, V, W >::path(this),
  385. utils::DoubleTime::null,
  386. utils::INTERNAL_LINK)
  387. << utils::KernelInfo(
  388. var_name,
  389. AbstractCoupledModel < T, U, V, W >::path(model),
  390. sub_var_name);
  391. utils::Trace < utils::DoubleTime >::trace().flush();
  392. #endif
  393. }
  394. void I_(std::initializer_list < Var > internals)
  395. {
  396. for (typename std::initializer_list < Var >::iterator it =
  397. internals.begin(); it != internals.end(); ++it) {
  398. submodel_internals[it->index] =
  399. std::pair < type*, int >(it->model, it->sub_index);
  400. #ifdef WITH_TRACE
  401. utils::Trace < utils::DoubleTime >::trace()
  402. << utils::TraceElement < utils::DoubleTime >(
  403. true,
  404. AbstractCoupledModel < T, U, V, W >::path(this),
  405. utils::DoubleTime::null,
  406. utils::INTERNAL_LINK)
  407. << utils::KernelInfo(
  408. it->var_name,
  409. AbstractCoupledModel < T, U, V, W >::path(it->model),
  410. it->sub_var_name);
  411. utils::Trace < utils::DoubleTime >::trace().flush();
  412. #endif
  413. }
  414. }
  415. void SM_(std::initializer_list < std::pair < unsigned int,
  416. type* > > models)
  417. {
  418. for (typename std::initializer_list < std::pair < unsigned int,
  419. type* > >::iterator it =
  420. models.begin(); it != models.end(); ++it) {
  421. submodels[it->first] = it->second;
  422. it->second->set_parent(this);
  423. #ifdef WITH_TRACE
  424. utils::Trace < utils::DoubleTime >::trace()
  425. << utils::TraceElement < utils::DoubleTime >(
  426. true,
  427. AbstractCoupledModel < T, U, V, W >::path(this),
  428. utils::DoubleTime::null,
  429. utils::SUBMODEL_ADD)
  430. << utils::KernelInfo(
  431. AbstractCoupledModel < T, U, V, W >::path(it->second));
  432. utils::Trace < utils::DoubleTime >::trace().flush();
  433. #endif
  434. }
  435. }
  436. void setsubmodel(unsigned int index, type* model)
  437. {
  438. if (setsubmodels.find(index) == setsubmodels.end()) {
  439. setsubmodels[index] = std::vector < type* >();
  440. }
  441. setsubmodels[index].push_back(model);
  442. model->set_parent(this);
  443. #ifdef WITH_TRACE
  444. utils::Trace < utils::DoubleTime >::trace()
  445. << utils::TraceElement < utils::DoubleTime >(
  446. true,
  447. AbstractCoupledModel < T, U, V, W >::path(this),
  448. utils::DoubleTime::null,
  449. utils::SUBMODEL_ADD)
  450. << utils::KernelInfo(
  451. AbstractCoupledModel < T, U, V, W >::path(model));
  452. utils::Trace < utils::DoubleTime >::trace().flush();
  453. #endif
  454. }
  455. private:
  456. SubModelInternals submodel_internals;
  457. Submodels submodels;
  458. Setsubmodels setsubmodels;
  459. };
  460. #define InternalS(index, var, sub_index) link_internal_(index, std::string(ESCAPEQUOTE(index)), var, sub_index, std::string(ESCAPEQUOTE(index)))
  461. #define ITEM_S(index, var, sub_index) Var(index, std::string(ESCAPEQUOTE(index)), var, sub_index, std::string(ESCAPEQUOTE(index)))
  462. #define UNWRAP_ITEM_S(...) ITEM_S __VA_ARGS__
  463. #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) }
  464. #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) }
  465. #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) }
  466. #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) }
  467. #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) }
  468. #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) }
  469. #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) }
  470. #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) }
  471. #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) }
  472. #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) }
  473. #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) }
  474. #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) }
  475. #define LIST_S_4(L1, L2, L3, L4) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4) }
  476. #define LIST_S_3(L1, L2, L3) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3) }
  477. #define LIST_S_2(L1, L2) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2) }
  478. #define LIST_S_1(L1) { UNWRAP_ITEM_S(L1) }
  479. #define LIST_S_(N) LIST_S_##N
  480. #define LIST_S_EVAL(N) LIST_S_(N)
  481. #define UNWRAP_S_2(...) EXPAND( LIST_S_EVAL(EXPAND( PP_NARG(__VA_ARGS__) ))(__VA_ARGS__) )
  482. //#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__)
  483. #define InternalsS(L) I_(UNWRAP_S_2 L)
  484. #define ITEM_Sub(index, model) { index, model }
  485. #define UNWRAP_ITEM_Sub(...) ITEM_Sub __VA_ARGS__
  486. #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) }
  487. #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) }
  488. #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) }
  489. #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) }
  490. #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) }
  491. #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) }
  492. #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) }
  493. #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) }
  494. #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) }
  495. #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) }
  496. #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) }
  497. #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) }
  498. #define LIST_Sub_4(L1, L2, L3, L4) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4) }
  499. #define LIST_Sub_3(L1, L2, L3) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3) }
  500. #define LIST_Sub_2(L1, L2) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2) }
  501. #define LIST_Sub_1(L1) { UNWRAP_ITEM_Sub(L1) }
  502. #define LIST_Sub_(N) LIST_Sub_##N
  503. #define LIST_Sub_EVAL(N) LIST_Sub_(N)
  504. #define UNWRAP_Sub_2(...) EXPAND( LIST_Sub_EVAL(EXPAND( PP_NARG(__VA_ARGS__) ))(__VA_ARGS__) )
  505. //#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__)
  506. #define Submodels(L) SM_(UNWRAP_Sub_2 L)
  507. } }
  508. #endif