Define classes with "class".

diff --git a/src/mc/explo/odpor/ReversibleRaceCalculator.hpp b/src/mc/explo/odpor/ReversibleRaceCalculator.hpp
index 5135bd2..283b7c9 100644 (file)
--- a/src/mc/explo/odpor/ReversibleRaceCalculator.hpp
+++ b/src/mc/explo/odpor/ReversibleRaceCalculator.hpp
@@ -29,7 +29,7 @@ namespace simgrid::mc::odpor {
  * execution; indeed, the question the method answers
  * is only sensible in the context of a race
  */
-struct ReversibleRaceCalculator final {
+class ReversibleRaceCalculator final {
   static bool is_race_reversible_ActorJoin(const Execution&, Execution::EventHandle e1, const Transition* e2);
   static bool is_race_reversible_BarrierAsyncLock(const Execution&, Execution::EventHandle e1, const Transition* e2);
   static bool is_race_reversible_BarrierWait(const Execution&, Execution::EventHandle e1, const Transition* e2);

diff --git a/src/mc/explo/odpor/WakeupTreeIterator.hpp b/src/mc/explo/odpor/WakeupTreeIterator.hpp
index 32b968c..0ccc6bc 100644 (file)
--- a/src/mc/explo/odpor/WakeupTreeIterator.hpp
+++ b/src/mc/explo/odpor/WakeupTreeIterator.hpp
@@ -26,7 +26,7 @@ namespace simgrid::mc::odpor {
  * This iterator provides such a postorder traversal over the nodes in the
  * wakeup tree.
  */
-struct WakeupTreeIterator
+class WakeupTreeIterator
     : public boost::iterator_facade<WakeupTreeIterator, WakeupTreeNode*, boost::forward_traversal_tag> {
 public:
   WakeupTreeIterator() = default;

diff --git a/src/mc/explo/odpor/odpor_forward.hpp b/src/mc/explo/odpor/odpor_forward.hpp
index 8fba97c..52388bc 100644 (file)
--- a/src/mc/explo/odpor/odpor_forward.hpp
+++ b/src/mc/explo/odpor/odpor_forward.hpp
@@ -22,10 +22,10 @@ using PartialExecution = std::list<std::shared_ptr<Transition>>;
 
 class Event;
 class Execution;
-struct ReversibleRaceCalculator;
+class ReversibleRaceCalculator;
 class WakeupTree;
 class WakeupTreeNode;
-struct WakeupTreeIterator;
+class WakeupTreeIterator;
 
 } // namespace simgrid::mc::odpor