Logo AND Algorithmique Numérique Distribuée

Public GIT Repository
Use boost::range algorithms
authorGabriel Corona <gabriel.corona@loria.fr>
Tue, 31 May 2016 09:58:59 +0000 (11:58 +0200)
committerGabriel Corona <gabriel.corona@loria.fr>
Tue, 31 May 2016 09:58:59 +0000 (11:58 +0200)
src/mc/LivenessChecker.cpp
src/mc/mc_state.cpp

index e8eba86..4f60bc1 100644 (file)
@@ -125,7 +125,7 @@ std::shared_ptr<VisitedPair> LivenessChecker::insertAcceptancePair(simgrid::mc::
     pair->num, pair->automaton_state, pair->atomic_propositions,
     pair->graph_state);
 
-  auto res = boost::range::equal_range(acceptancePairs,
+  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) {
index 8975d96..a919c30 100644 (file)
@@ -57,7 +57,7 @@ State::State()
 std::size_t State::interleaveSize() const
 {
   return boost::range::count_if(this->processStates,
-    simgrid::mc::ProcessState::isToInterleave),
+    [](simgrid::mc::ProcessState const& p) { return p.isToInterleave(); });
 }
 
 Transition State::getTransition() const