/**
* @brief An iterator over the tree of sets of (non-empty) maximal events that
- * can be generated from a given configuration
+ * can be generated from a given set of events
*
* This iterator traverses all possible sets of maximal events that
- * can be formed from a configuration, each of which satisfy a predicate.
+ * can be formed from some subset of events of an unfolding,
+ * each of which satisfy a predicate.
*
* Iteration over the maximal events of a configuration is an important
* step in computing the extension set of a configuration for an action
using node_filter_function = std::function<bool(const UnfoldingEvent*)>;
using topological_order_position = std::vector<const UnfoldingEvent*>::const_iterator;
- maximal_subsets_iterator() = default;
- explicit maximal_subsets_iterator(const Configuration& config) : maximal_subsets_iterator(config, std::nullopt) {}
- maximal_subsets_iterator(const Configuration& config, std::optional<node_filter_function> filter);
+ maximal_subsets_iterator() = default;
+ maximal_subsets_iterator(maximal_subsets_iterator&&) noexcept = default;
+ explicit maximal_subsets_iterator(const Configuration& config,
+ std::optional<node_filter_function> filter = std::nullopt,
+ std::optional<size_t> maximum_subset_size = std::nullopt)
+ : maximal_subsets_iterator(config.get_events(), filter, maximum_subset_size)
+ {
+ }
+ explicit maximal_subsets_iterator(const EventSet& events, std::optional<node_filter_function> filter = std::nullopt,
+ std::optional<size_t> maximum_subset_size = std::nullopt);
private:
- const std::optional<std::reference_wrapper<const Configuration>> config = std::nullopt;
std::vector<const UnfoldingEvent*> topological_ordering;
// The boolean is a bit of an annoyance, but it works. Effectively,
// after the empty set" and "we've finished the search" since the resulting
// maximal set and backtracking point stack will both be empty in both cases
bool has_started_searching = false;
+ std::optional<size_t> maximum_subset_size = std::nullopt;
std::optional<EventSet> current_maximal_set = std::nullopt;
std::stack<topological_order_position> backtrack_points = std::stack<topological_order_position>();
public:
using topological_order_position = maximal_subsets_iterator::topological_order_position;
+ bookkeeper() = default;
+ bookkeeper(bookkeeper&&) = default;
+ bookkeeper& operator=(bookkeeper&) = default;
+ bookkeeper& operator=(bookkeeper&&) = default;
+
void mark_included_in_maximal_set(const UnfoldingEvent*);
void mark_removed_from_maximal_set(const UnfoldingEvent*);
topological_order_position find_next_candidate_event(topological_order_position first,
*/
topological_order_position continue_traversal_of_maximal_events_tree();
+ /**
+ * @brief: Whether or not the current maximal set can
+ * grow based on the size limit imposed on the maximal
+ * sets that can be produced
+ */
+ bool can_grow_maximal_set() const;
+
// boost::iterator_facade<...> interface to implement
void increment();
bool equal(const maximal_subsets_iterator& other) const { return current_maximal_set == other.current_maximal_set; }
friend class boost::iterator_core_access;
};
-using maximal_subsets_iterator_wrapper =
- simgrid::xbt::iterator_wrapping<maximal_subsets_iterator, const Configuration&>;
+template <typename T>
+using maximal_subsets_iterator_wrapper = simgrid::xbt::iterator_wrapping<maximal_subsets_iterator, const T&>;
} // namespace simgrid::mc::udpor
#endif
