public:
/** @brief Possible update mechanisms */
enum class UpdateAlgo {
- Full, /**< Full update mechanism: the remaining time of every action is recomputed at each step */
- Lazy /**< Lazy update mechanism: only the modified actions get recomputed.
+ FULL, /**< Full update mechanism: the remaining time of every action is recomputed at each step */
+ LAZY /**< Lazy update mechanism: only the modified actions get recomputed.
It may be slower than full if your system is tightly coupled to the point where every action
gets recomputed anyway. In that case, you'd better not try to be cleaver with lazy and go for
a simple full update. */
virtual double next_occuring_event_lazy(double now);
virtual double next_occuring_event_full(double now);
+private:
+ Action* extract_action(Action::StateSet* list);
+
+public:
+ Action* extract_done_action();
+ Action* extract_failed_action();
+
/**
* @brief Update action to the current time
*
} // namespace resource
} // namespace kernel
} // namespace simgrid
+
+/** \ingroup SURF_models
+ * \brief List of initialized models
+ */
+XBT_PUBLIC_DATA std::vector<simgrid::kernel::resource::Model*> all_existing_models;
+
#endif
