dtss_tests.cpp 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212
  1. /**
  2. * @file examples.cpp
  3. * @author The PARADEVS Development Team
  4. * See the AUTHORS or Authors.txt file
  5. */
  6. /*
  7. * PARADEVS - the multimodeling and simulation environment
  8. * This file is a part of the PARADEVS environment
  9. *
  10. * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
  11. *
  12. * This program is free software: you can redistribute it and/or modify
  13. * it under the terms of the GNU General Public License as published by
  14. * the Free Software Foundation, either version 3 of the License, or
  15. * (at your option) any later version.
  16. *
  17. * This program is distributed in the hope that it will be useful,
  18. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  19. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  20. * GNU General Public License for more details.
  21. *
  22. * You should have received a copy of the GNU General Public License
  23. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  24. */
  25. #include <tests/dtss_tests.hpp>
  26. #include <common/RootCoordinator.hpp>
  27. #include <common/Trace.hpp>
  28. #include <dtss/Coordinator.hpp>
  29. #include <dtss/GraphManager.hpp>
  30. #define CATCH_CONFIG_MAIN
  31. #include "catch.hpp"
  32. namespace paradevs { namespace dtss {
  33. void A::transition(const common::Bag& /* x */, common::Time t)
  34. {
  35. common::Trace::trace() << common::TraceElement(get_name(), t,
  36. common::DELTA_INT);
  37. common::Trace::trace().flush();
  38. }
  39. common::Time A::start(common::Time t)
  40. {
  41. common::Trace::trace() << common::TraceElement(get_name(), t,
  42. common::START);
  43. common::Trace::trace().flush();
  44. return 0;
  45. }
  46. common::Bag A::lambda(common::Time t) const
  47. {
  48. common::Bag msgs;
  49. msgs.push_back(common::ExternalEvent("out", 0.));
  50. common::Trace::trace() << common::TraceElement(get_name(), t,
  51. common::LAMBDA)
  52. << "messages = " << msgs.to_string();
  53. common::Trace::trace().flush();
  54. return msgs;
  55. }
  56. void B::transition(const common::Bag& x, common::Time t)
  57. {
  58. common::Trace::trace() << common::TraceElement(get_name(), t,
  59. common::DELTA_INT)
  60. << "x = " << x.to_string();
  61. common::Trace::trace().flush();
  62. }
  63. common::Time B::start(common::Time t)
  64. {
  65. common::Trace::trace() << common::TraceElement(get_name(), t,
  66. common::START);
  67. common::Trace::trace().flush();
  68. return 0;
  69. }
  70. common::Bag B::lambda(common::Time t) const
  71. {
  72. common::Bag msgs;
  73. msgs.push_back(common::ExternalEvent("out", 0.));
  74. common::Trace::trace() << common::TraceElement(get_name(), t,
  75. common::LAMBDA)
  76. << "messages = " << msgs.to_string();
  77. common::Trace::trace().flush();
  78. return msgs;
  79. }
  80. struct Policy
  81. {
  82. const common::Bag& bag() const
  83. { return _bag; }
  84. virtual void operator()(common::Time /* t */,
  85. const common::ExternalEvent& event,
  86. common::Time /* tl */,
  87. common::Time /* tn */)
  88. {
  89. _bag.clear();
  90. _bag.push_back(event);
  91. }
  92. private:
  93. common::Bag _bag;
  94. };
  95. class OnlyOneGraphManager : public dtss::GraphManager
  96. {
  97. public:
  98. OnlyOneGraphManager(common::Coordinator* coordinator) :
  99. dtss::GraphManager(coordinator)
  100. {
  101. dtss::Simulator < A >* a = new dtss::Simulator < A >("a", 1);
  102. add_child(a);
  103. }
  104. virtual ~OnlyOneGraphManager()
  105. { }
  106. };
  107. class TwoGraphManager : public dtss::GraphManager
  108. {
  109. public:
  110. TwoGraphManager(common::Coordinator* coordinator) :
  111. dtss::GraphManager(coordinator)
  112. {
  113. dtss::Simulator < A >* a = new dtss::Simulator < A >("a", 1);
  114. dtss::Simulator < B >* b = new dtss::Simulator < B >("b", 1);
  115. add_child(a);
  116. add_child(b);
  117. add_link(a, "out", b, "in");
  118. }
  119. virtual ~TwoGraphManager()
  120. { }
  121. };
  122. } } // namespace paradevs dtss
  123. TEST_CASE("dtss/only_one", "run")
  124. {
  125. paradevs::common::RootCoordinator <
  126. paradevs::dtss::Coordinator < paradevs::dtss::Policy,
  127. paradevs::dtss::OnlyOneGraphManager >
  128. > rc(0, 10, "root", paradevs::dtss::Parameters(1));
  129. paradevs::common::Trace::trace().clear();
  130. rc.run();
  131. REQUIRE(paradevs::common::Trace::trace().elements().
  132. filter_model_name("a").
  133. filter_type(paradevs::common::START).size() == 1);
  134. for (unsigned int t = 0; t <= 10; ++t) {
  135. REQUIRE(paradevs::common::Trace::trace().elements().
  136. filter_model_name("a").filter_time(t).
  137. filter_type(paradevs::common::DELTA_INT).size() == 1);
  138. REQUIRE(paradevs::common::Trace::trace().elements().
  139. filter_model_name("a").filter_time(t).
  140. filter_type(paradevs::common::LAMBDA).size() == 1);
  141. }
  142. }
  143. TEST_CASE("dtss/two", "run")
  144. {
  145. paradevs::common::RootCoordinator <
  146. paradevs::dtss::Coordinator < paradevs::dtss::Policy,
  147. paradevs::dtss::TwoGraphManager >
  148. > rc(0, 10, "root", paradevs::dtss::Parameters(1));
  149. paradevs::common::Trace::trace().clear();
  150. rc.run();
  151. REQUIRE(paradevs::common::Trace::trace().elements().
  152. filter_model_name("a").
  153. filter_type(paradevs::common::START).size() == 1);
  154. for (unsigned int t = 0; t <= 10; ++t) {
  155. REQUIRE(paradevs::common::Trace::trace().elements().
  156. filter_model_name("a").filter_time(t).
  157. filter_type(paradevs::common::DELTA_INT).size() == 1);
  158. REQUIRE(paradevs::common::Trace::trace().elements().
  159. filter_model_name("a").filter_time(t).
  160. filter_type(paradevs::common::LAMBDA).size() == 1);
  161. }
  162. REQUIRE(paradevs::common::Trace::trace().elements().
  163. filter_model_name("b").
  164. filter_type(paradevs::common::START).size() == 1);
  165. for (unsigned int t = 0; t <= 10; ++t) {
  166. REQUIRE(paradevs::common::Trace::trace().elements().
  167. filter_model_name("b").filter_time(t).
  168. filter_type(paradevs::common::DELTA_INT).size() == 1);
  169. REQUIRE(paradevs::common::Trace::trace().elements().
  170. filter_model_name("b").filter_time(t).
  171. filter_type(paradevs::common::LAMBDA).size() == 1);
  172. }
  173. }