AbstractCoupledModel.hpp 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590
  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, V >,
  35. public Internals < T, U, V >,
  36. public Externals < T, U, V >
  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. #ifdef WITH_TRACE
  45. template < typename T, typename U, typename V, typename W >
  46. friend class Simulator;
  47. #endif
  48. public:
  49. struct Var
  50. {
  51. unsigned int index;
  52. type* model;
  53. int sub_index;
  54. std::string var_name;
  55. std::string sub_var_name;
  56. Var (unsigned int index, std::string var_name,
  57. type* model, int sub_index, std::string sub_var_name) :
  58. index(index), model(model), sub_index(sub_index),
  59. var_name(var_name), sub_var_name(sub_var_name)
  60. { }
  61. };
  62. AbstractCoupledModel(const type* parent = 0) : type(parent)
  63. {
  64. #ifdef WITH_TRACE
  65. utils::Trace < utils::DoubleTime >::trace()
  66. << utils::TraceElement < utils::DoubleTime >(
  67. true,
  68. boost::core::demangle(typeid(T).name()).erase(0,6),
  69. utils::DoubleTime::null,
  70. utils::CONSTRUCT);
  71. utils::Trace < utils::DoubleTime >::trace().flush();
  72. #endif
  73. }
  74. virtual ~AbstractCoupledModel()
  75. {
  76. #ifdef WITH_TRACE
  77. trace_element(true, utils::DoubleTime::null,
  78. utils::DESTRUCT);
  79. #endif
  80. }
  81. virtual void after(typename U::type t)
  82. {
  83. #ifdef WITH_TRACE
  84. trace_element(true, t, utils::AFTER_COMPUTE);
  85. trace_internals(true, t, utils::AFTER_COMPUTE);
  86. #else
  87. (void) t;
  88. #endif
  89. }
  90. virtual const Node < U >* atomic(unsigned int index) const
  91. {
  92. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  93. submodel_internals.find(index);
  94. if (it == submodel_internals.end()) {
  95. return this;
  96. } else {
  97. return it->second.first->atomic(it->second.second);
  98. }
  99. }
  100. virtual void before(typename U::type t)
  101. {
  102. #ifdef WITH_TRACE
  103. trace_element(true, t, utils::BEFORE_COMPUTE);
  104. trace_internals(true, t, utils::BEFORE_COMPUTE);
  105. trace_externals(true, t, utils::BEFORE_COMPUTE);
  106. #else
  107. (void) t;
  108. #endif
  109. }
  110. virtual void build(W& /* parameters */)
  111. { }
  112. virtual void build(W& /* parameters */, const std::string& /* json */)
  113. { }
  114. virtual bool check(typename U::type t) const
  115. { return Externals < T, U, V >::check(t); }
  116. virtual void compute(typename U::type t, bool update) = 0;
  117. virtual const Any& get(typename U::type t, unsigned int index) const
  118. {
  119. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  120. submodel_internals.find(index);
  121. if (it == submodel_internals.end()) {
  122. if (type::last_time != t) {
  123. throw utils::InvalidGet("Variable not computed");
  124. }
  125. return Internals < T, U, V >::get(index);
  126. } else {
  127. return it->second.first->get(t, it->second.second);
  128. }
  129. }
  130. template < typename Z, typename K >
  131. Z get(typename U::type t, unsigned int index) const
  132. {
  133. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  134. submodel_internals.find(index);
  135. if (it == submodel_internals.end()) {
  136. if (type::last_time != t) {
  137. throw utils::InvalidGet("Variable not computed");
  138. }
  139. const Any& value = Internals < T, U, V >::get(index);
  140. return static_cast < const T* >(this)->*(value.get < T, Z >());
  141. } else {
  142. const Any& value = it->second.first->get(t, it->second.second);
  143. const Node < U >* object = it->second.first->atomic(
  144. it->second.second);
  145. return static_cast < const K* >(object)->*(value.get < K, Z >());
  146. }
  147. }
  148. virtual std::string get(const ValueType& value_type, typename U::type t,
  149. unsigned int index) const
  150. {
  151. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  152. submodel_internals.find(index);
  153. if (it == submodel_internals.end()) {
  154. Any value = Internals < T, U, V >::get(index);
  155. switch (value_type) {
  156. case DOUBLE:
  157. return std::to_string(
  158. static_cast < const T* >(this)->*(value.get < T,
  159. double >()));
  160. case INT:
  161. return std::to_string(
  162. static_cast < const T* >(this)->*(value.get < T, int >()));
  163. case BOOL:
  164. return std::to_string(
  165. static_cast < const T* >(this)->*(value.get < T, bool >()));
  166. default: return "NA";
  167. }
  168. } else {
  169. return it->second.first->get(value_type, t, it->second.second);
  170. }
  171. }
  172. virtual void init(typename U::type t, const V& parameters) = 0;
  173. virtual bool is_atomic() const
  174. { return false; }
  175. bool is_computed(typename U::type t, unsigned int index) const
  176. {
  177. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  178. submodel_internals.find(index);
  179. if (it == submodel_internals.end()) {
  180. return false;
  181. } else {
  182. return it->second.first->is_computed(t, it->second.second);
  183. }
  184. }
  185. bool is_stable(typename U::type t) const
  186. {
  187. typename AbstractCoupledModel::SubModelInternals::const_iterator it =
  188. submodel_internals.begin();
  189. bool stable = true;
  190. while (it != submodel_internals.end() and stable) {
  191. stable = it->second.first->is_stable(t);
  192. ++it;
  193. }
  194. return stable;
  195. }
  196. virtual bool is_updated() const
  197. { return Externals < T, U, V >::updated; }
  198. virtual const Node < U >* get_submodel(unsigned int index) const
  199. {
  200. typename AbstractCoupledModel::Submodels::const_iterator it =
  201. submodels.find(index);
  202. if (it != submodels.end()) {
  203. return it->second;
  204. } else {
  205. return 0;
  206. }
  207. }
  208. virtual const Node < U >* get_submodel(unsigned int index,
  209. unsigned int rank) const
  210. {
  211. typename AbstractCoupledModel::Setsubmodels::const_iterator it =
  212. setsubmodels.find(index);
  213. if (it != setsubmodels.end() and it->second.size() > rank) {
  214. return it->second.at(rank);
  215. } else {
  216. return 0;
  217. }
  218. }
  219. virtual std::string path_index(const AbstractModel < U, V >* child,
  220. int& index) const
  221. {
  222. typename Setsubmodels::const_iterator it = setsubmodels.begin();
  223. bool found = false;
  224. index = -1;
  225. while (not found and it != setsubmodels.end()) {
  226. typename std::vector < type* >::const_iterator itm =
  227. it->second.begin();
  228. index = 0;
  229. while (not found and itm != it->second.end()) {
  230. found = *itm == child;
  231. if (not found) {
  232. ++index;
  233. ++itm;
  234. }
  235. }
  236. index = found ? index : -1;
  237. ++it;
  238. }
  239. if (type::parent) {
  240. int i;
  241. std::string p = type::parent->path_index(this, i);
  242. if (i >= 0) {
  243. return p +
  244. "/[" + std::to_string(i) + "]" +
  245. boost::core::demangle(typeid(*this).name());
  246. } else {
  247. return p + "/" + boost::core::demangle(typeid(*this).name()).erase(0,6);
  248. }
  249. } else {
  250. return boost::core::demangle(typeid(*this).name()).erase(0,6);
  251. }
  252. }
  253. virtual void restore(const context::State < U >& state)
  254. {
  255. typename AbstractCoupledModel::Submodels::const_iterator it =
  256. submodels.begin();
  257. while (it != submodels.end()) {
  258. it->second->restore(state.get_substate(it->first));
  259. ++it;
  260. }
  261. States < T, U, V >::restore(this, state);
  262. Internals < T, U, V >::restore(this, state);
  263. Externals < T, U, V >::restore(this, state);
  264. }
  265. virtual void save(context::State < U >& state) const
  266. {
  267. typename AbstractCoupledModel::Submodels::const_iterator it =
  268. submodels.begin();
  269. while (it != submodels.end()) {
  270. context::State < U > substate;
  271. it->second->save(substate);
  272. state.add_substate(it->first, substate);
  273. ++it;
  274. }
  275. States < T, U, V >::save(this, state);
  276. Internals < T, U, V >::save(this, state);
  277. Externals < T, U, V >::save(this, state);
  278. }
  279. virtual void stable()
  280. { Externals < T, U, V >::updated = false; }
  281. void submodel(unsigned int index, type* model)
  282. {
  283. if (model) {
  284. submodels[index] = model;
  285. model->set_parent(this);
  286. } else {
  287. submodels[index] = 0;
  288. }
  289. }
  290. virtual void trace_element(typename U::type t, utils::TraceType type = utils::NONE, std::string comment = "") const
  291. {trace_element(false, t, type, comment);}
  292. virtual void trace_internals(typename U::type t, utils::TraceType type) const
  293. {trace_internals(false, t, type);}
  294. virtual void trace_externals(typename U::type t, utils::TraceType type = utils::NONE) const
  295. {trace_externals(false, t, type);}
  296. virtual void trace_model(typename U::type t, utils::TraceType type = utils::NONE) const
  297. {trace_model(false, t, type);}
  298. private:
  299. void trace_element(bool from_kernel, typename U::type t, utils::TraceType type = utils::NONE, std::string comment = "") const
  300. {
  301. utils::Trace < utils::DoubleTime >::trace()
  302. << utils::TraceElement < utils::DoubleTime >(
  303. from_kernel,
  304. AbstractCoupledModel < T, U, V, W >::path(this),
  305. t, type)
  306. << comment;
  307. utils::Trace < utils::DoubleTime >::trace().flush();
  308. }
  309. void trace_internals(bool from_kernel, typename U::type t, utils::TraceType type) const
  310. {
  311. for (size_t i = 0; i < Internals < T, U, V >::size(); ++i) {
  312. if (not Internals < T, U, V >::get(i).is_null()) {
  313. utils::Trace < utils::DoubleTime >::trace()
  314. << utils::TraceElement < utils::DoubleTime >(
  315. from_kernel,
  316. AbstractCoupledModel < T, U, V, W >::path(this),
  317. t, type)
  318. << utils::KernelInfo(
  319. Internals < T, U, V >::name(i), true,
  320. Internals < T, U, V >::get(i).to_string(
  321. dynamic_cast < const T* >(this))
  322. );
  323. utils::Trace < utils::DoubleTime >::trace().flush();
  324. }
  325. }
  326. }
  327. void trace_externals(bool from_kernel, typename U::type t, utils::TraceType type = utils::NONE) const
  328. {
  329. for (size_t i = 0; i < Externals < T, U, V >::size(); ++i) {
  330. if (not Externals < T, U, V >::get(i).is_null()) {
  331. utils::Trace < utils::DoubleTime >::trace()
  332. << utils::TraceElement < utils::DoubleTime >(
  333. from_kernel,
  334. AbstractCoupledModel < T, U, V, W >::path(this),
  335. t, type)
  336. << utils::KernelInfo(
  337. Externals < T, U, V >::name(i), false,
  338. Externals < T, U, V >::get(i).to_string(
  339. dynamic_cast < const T* >(this))
  340. );
  341. utils::Trace < utils::DoubleTime >::trace().flush();
  342. }
  343. }
  344. }
  345. void trace_model(bool from_kernel, typename U::type t, utils::TraceType type = utils::NONE) const
  346. {
  347. trace_element(from_kernel, t, type);
  348. trace_internals(from_kernel, t, type);
  349. trace_externals(from_kernel, t, type);
  350. typename AbstractCoupledModel::Submodels::const_iterator it =
  351. submodels.begin();
  352. // while (it != submodels.end()) {
  353. // it->second->trace_model(from_kernel, t, type);
  354. // ++it;
  355. // }
  356. }
  357. protected:
  358. // void change_internal(unsigned int index, double T::* var)
  359. // {
  360. // submodel_internals.erase(index);
  361. // Internals < T, U, V >::internal(index, var);
  362. // }
  363. // void change_internal(unsigned int index, int T::* var)
  364. // {
  365. // submodel_internals.erase(index);
  366. // Internals < T, U, V >::internalI(index, var);
  367. // }
  368. // void change_internal(unsigned int index, bool T::* var)
  369. // {
  370. // submodel_internals.erase(index);
  371. // Internals < T, U, V >::internalB(index, var);
  372. // }
  373. void link_internal_(unsigned int index, std::string var_name,
  374. type* model, int sub_index, std::string sub_var_name)
  375. {
  376. submodel_internals[index] =
  377. std::pair < type*, int >(model, sub_index);
  378. #ifdef WITH_TRACE
  379. utils::Trace < utils::DoubleTime >::trace()
  380. << utils::TraceElement < utils::DoubleTime >(
  381. true,
  382. AbstractCoupledModel < T, U, V, W >::path(this),
  383. utils::DoubleTime::null,
  384. utils::INTERNAL_LINK)
  385. << utils::KernelInfo(
  386. var_name,
  387. AbstractCoupledModel < T, U, V, W >::path(model),
  388. sub_var_name);
  389. utils::Trace < utils::DoubleTime >::trace().flush();
  390. #endif
  391. }
  392. void I_(std::initializer_list < Var > internals)
  393. {
  394. for (typename std::initializer_list < Var >::iterator it =
  395. internals.begin(); it != internals.end(); ++it) {
  396. submodel_internals[it->index] =
  397. std::pair < type*, int >(it->model, it->sub_index);
  398. #ifdef WITH_TRACE
  399. utils::Trace < utils::DoubleTime >::trace()
  400. << utils::TraceElement < utils::DoubleTime >(
  401. true,
  402. AbstractCoupledModel < T, U, V, W >::path(this),
  403. utils::DoubleTime::null,
  404. utils::INTERNAL_LINK)
  405. << utils::KernelInfo(
  406. it->var_name,
  407. AbstractCoupledModel < T, U, V, W >::path(it->model),
  408. it->sub_var_name);
  409. utils::Trace < utils::DoubleTime >::trace().flush();
  410. #endif
  411. }
  412. }
  413. void SM_(std::initializer_list < std::pair < unsigned int,
  414. type* > > models)
  415. {
  416. for (typename std::initializer_list < std::pair < unsigned int,
  417. type* > >::iterator it =
  418. models.begin(); it != models.end(); ++it) {
  419. submodels[it->first] = it->second;
  420. it->second->set_parent(this);
  421. #ifdef WITH_TRACE
  422. utils::Trace < utils::DoubleTime >::trace()
  423. << utils::TraceElement < utils::DoubleTime >(
  424. true,
  425. AbstractCoupledModel < T, U, V, W >::path(this),
  426. utils::DoubleTime::null,
  427. utils::SUBMODEL_ADD)
  428. << utils::KernelInfo(
  429. AbstractCoupledModel < T, U, V, W >::path(it->second));
  430. utils::Trace < utils::DoubleTime >::trace().flush();
  431. #endif
  432. }
  433. }
  434. void setsubmodel(unsigned int index, type* model)
  435. {
  436. if (setsubmodels.find(index) == setsubmodels.end()) {
  437. setsubmodels[index] = std::vector < type* >();
  438. }
  439. setsubmodels[index].push_back(model);
  440. model->set_parent(this);
  441. #ifdef WITH_TRACE
  442. utils::Trace < utils::DoubleTime >::trace()
  443. << utils::TraceElement < utils::DoubleTime >(
  444. true,
  445. AbstractCoupledModel < T, U, V, W >::path(this),
  446. utils::DoubleTime::null,
  447. utils::SUBMODEL_ADD)
  448. << utils::KernelInfo(
  449. AbstractCoupledModel < T, U, V, W >::path(model));
  450. utils::Trace < utils::DoubleTime >::trace().flush();
  451. #endif
  452. }
  453. private:
  454. SubModelInternals submodel_internals;
  455. Submodels submodels;
  456. Setsubmodels setsubmodels;
  457. };
  458. #define InternalS(index, var, sub_index) link_internal_(index, std::string(ESCAPEQUOTE(index)), var, sub_index, std::string(ESCAPEQUOTE(index)))
  459. #define ITEM_S(index, var, sub_index) Var(index, std::string(ESCAPEQUOTE(index)), var, sub_index, std::string(ESCAPEQUOTE(index)))
  460. #define UNWRAP_ITEM_S(...) ITEM_S __VA_ARGS__
  461. #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) }
  462. #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) }
  463. #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) }
  464. #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) }
  465. #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) }
  466. #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) }
  467. #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) }
  468. #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) }
  469. #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) }
  470. #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) }
  471. #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) }
  472. #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) }
  473. #define LIST_S_4(L1, L2, L3, L4) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3), UNWRAP_ITEM_S(L4) }
  474. #define LIST_S_3(L1, L2, L3) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2), UNWRAP_ITEM_S(L3) }
  475. #define LIST_S_2(L1, L2) { UNWRAP_ITEM_S(L1), UNWRAP_ITEM_S(L2) }
  476. #define LIST_S_1(L1) { UNWRAP_ITEM_S(L1) }
  477. #define LIST_S_(N) LIST_S_##N
  478. #define LIST_S_EVAL(N) LIST_S_(N)
  479. #define UNWRAP_S_2(...) EXPAND( LIST_S_EVAL(EXPAND( PP_NARG(__VA_ARGS__) ))(__VA_ARGS__) )
  480. //#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__)
  481. #define InternalsS(L) I_(UNWRAP_S_2 L)
  482. #define ITEM_Sub(index, model) { index, model }
  483. #define UNWRAP_ITEM_Sub(...) ITEM_Sub __VA_ARGS__
  484. #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) }
  485. #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) }
  486. #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) }
  487. #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) }
  488. #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) }
  489. #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) }
  490. #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) }
  491. #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) }
  492. #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) }
  493. #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) }
  494. #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) }
  495. #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) }
  496. #define LIST_Sub_4(L1, L2, L3, L4) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3), UNWRAP_ITEM_Sub(L4) }
  497. #define LIST_Sub_3(L1, L2, L3) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2), UNWRAP_ITEM_Sub(L3) }
  498. #define LIST_Sub_2(L1, L2) { UNWRAP_ITEM_Sub(L1), UNWRAP_ITEM_Sub(L2) }
  499. #define LIST_Sub_1(L1) { UNWRAP_ITEM_Sub(L1) }
  500. #define LIST_Sub_(N) LIST_Sub_##N
  501. #define LIST_Sub_EVAL(N) LIST_Sub_(N)
  502. #define UNWRAP_Sub_2(...) EXPAND( LIST_Sub_EVAL(EXPAND( PP_NARG(__VA_ARGS__) ))(__VA_ARGS__) )
  503. //#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__)
  504. #define Submodels(L) SM_(UNWRAP_Sub_2 L)
  505. } }
  506. #endif