tests.cpp 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. /**
  2. * @file tests/mixed/tests.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 <paradevs/common/RootCoordinator.hpp>
  26. #include <tests/mixed/graph_manager.hpp>
  27. #include <tests/mixed/models.hpp>
  28. #define CATCH_CONFIG_MAIN
  29. #include <tests/catch.hpp>
  30. using namespace paradevs::tests::mixed;
  31. using namespace paradevs::common;
  32. TEST_CASE("mixed/hierachical", "run")
  33. {
  34. paradevs::common::RootCoordinator <
  35. DoubleTime,
  36. paradevs::pdevs::Coordinator <
  37. DoubleTime,
  38. paradevs::common::scheduler::HeapScheduler <
  39. DoubleTime, SchedulerHandle >,
  40. SchedulerHandle,
  41. RootGraphManager >
  42. > rc(0, 100, "root");
  43. paradevs::common::Trace < DoubleTime >::trace().clear();
  44. rc.run();
  45. REQUIRE(paradevs::common::Trace < DoubleTime >::trace().elements().
  46. filter_model_name("a1").
  47. filter_type(paradevs::common::START).size() == 1);
  48. REQUIRE(paradevs::common::Trace < DoubleTime >::trace().elements().
  49. filter_model_name("b1").
  50. filter_type(paradevs::common::START).size() == 1);
  51. REQUIRE(paradevs::common::Trace < DoubleTime >::trace().elements().
  52. filter_model_name("a2").
  53. filter_type(paradevs::common::START).size() == 1);
  54. REQUIRE(paradevs::common::Trace < DoubleTime >::trace().elements().
  55. filter_model_name("b2").
  56. filter_type(paradevs::common::START).size() == 1);
  57. REQUIRE(paradevs::common::Trace < DoubleTime >::trace().elements().
  58. filter_model_name("a1").
  59. filter_type(paradevs::common::DELTA_EXT).size() == 0);
  60. for (double t = 0; t <= 100; ++t) {
  61. REQUIRE(paradevs::common::Trace <
  62. DoubleTime >::trace().elements().
  63. filter_model_name("a1").filter_time(t).
  64. filter_type(paradevs::common::LAMBDA).size() == 1);
  65. REQUIRE(paradevs::common::Trace <
  66. DoubleTime >::trace().elements().
  67. filter_model_name("a1").filter_time(t).
  68. filter_type(paradevs::common::DELTA_INT).size() == 1);
  69. REQUIRE(paradevs::common::Trace <
  70. DoubleTime >::trace().elements().
  71. filter_model_name("a1").filter_time(t).
  72. filter_type(paradevs::common::TA).size() == 1);
  73. }
  74. for (double t = 0; t <= 100; ++t) {
  75. REQUIRE(paradevs::common::Trace <
  76. DoubleTime >::trace().elements().
  77. filter_model_name("b1").filter_time(t).
  78. filter_type(paradevs::common::LAMBDA).size() == 1);
  79. REQUIRE(paradevs::common::Trace <
  80. DoubleTime >::trace().elements().
  81. filter_model_name("b1").filter_time(t).
  82. filter_type(paradevs::common::DELTA_INT).size() == 1);
  83. REQUIRE(paradevs::common::Trace <
  84. DoubleTime >::trace().elements().
  85. filter_model_name("b1").filter_time(t).
  86. filter_type(paradevs::common::TA).size() == 2);
  87. REQUIRE(paradevs::common::Trace <
  88. DoubleTime >::trace().elements().
  89. filter_model_name("b1").filter_time(t).
  90. filter_type(paradevs::common::DELTA_EXT).size() == 1);
  91. }
  92. for (unsigned int t = 0; t <= 100; t += 20) {
  93. REQUIRE(paradevs::common::Trace <
  94. DoubleTime >::trace().elements().
  95. filter_model_name("a2").filter_time(t).
  96. filter_type(paradevs::common::LAMBDA).size() == 1);
  97. REQUIRE(paradevs::common::Trace <
  98. DoubleTime >::trace().elements().
  99. filter_model_name("a2").filter_time(t).
  100. filter_type(paradevs::common::DELTA_INT).size() == 1);
  101. }
  102. for (unsigned int t = 0; t <= 100; t += 20) {
  103. REQUIRE(paradevs::common::Trace <
  104. DoubleTime >::trace().elements().
  105. filter_model_name("b2").filter_time(t).
  106. filter_type(paradevs::common::LAMBDA).size() == 1);
  107. REQUIRE(paradevs::common::Trace <
  108. DoubleTime >::trace().elements().
  109. filter_model_name("b2").filter_time(t).
  110. filter_type(paradevs::common::DELTA_INT).size() == 1);
  111. }
  112. }