#include <cstring>
-#include <algorithm>
#include <memory>
#include <list>
+#include <boost/range/algorithm.hpp>
+
#include <unistd.h>
#include <sys/wait.h>
pair->num, pair->automaton_state, pair->atomic_propositions,
pair->graph_state);
- auto res = std::equal_range(acceptancePairs_.begin(), acceptancePairs_.end(),
+ auto res = boost::range::equal_range(acceptancePairs_,
new_pair.get(), simgrid::mc::DerefAndCompareByNbProcessesAndUsedHeap());
if (pair->search_cycle) for (auto i = res.first; i != res.second; ++i) {
pair->num, pair->automaton_state, pair->atomic_propositions,
pair->graph_state);
- auto range = std::equal_range(visitedPairs_.begin(), visitedPairs_.end(),
+ auto range = boost::range::equal_range(visitedPairs_,
visited_pair.get(), simgrid::mc::DerefAndCompareByNbProcessesAndUsedHeap());
for (auto i = range.first; i != range.second; ++i) {
{
if (_sg_mc_visited != 0 && visitedPairs_.size() > (std::size_t) _sg_mc_visited) {
// Remove the oldest entry with a linear search:
- visitedPairs_.erase(std::min_element(
- visitedPairs_.begin(), visitedPairs_.end(),
+ visitedPairs_.erase(boost::min_element(visitedPairs_,
[](std::shared_ptr<VisitedPair> const a, std::shared_ptr<VisitedPair> const& b) {
return a->num < b->num; } ));
}
next_pair->depth = 1;
/* Get enabled processes and insert them in the interleave set of the next graph_state */
for (auto& p : mc_model_checker->process().simix_processes())
- if (simgrid::mc::process_is_enabled(&p.copy))
- next_pair->graph_state->interleave(&p.copy);
+ if (simgrid::mc::process_is_enabled(p.copy.getBuffer()))
+ next_pair->graph_state->interleave(p.copy.getBuffer());
next_pair->requests = next_pair->graph_state->interleaveSize();
/* FIXME : get search_cycle value for each acceptant state */
if (next_pair->automaton_state->type == 1 ||