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