Version 0.4.

[loba.git] / process.h

diff --git a/process.h b/process.h
index 25d6c442ca6abb2de60417a69839ac5d7452c189..55ee792e1e59d56751fbe6157e858ee1a0acde58 100644 (file)
--- a/process.h
+++ b/process.h
@@ -5,7 +5,7 @@
 //#undef USE_UNORDERED_MAP
 
 #include <algorithm>
 //#undef USE_UNORDERED_MAP
 
 #include <algorithm>

-#include <functional>
+#include <atomic>

 #ifdef USE_UNORDERED_MAP
 #  include <unordered_map>
 #  define MAP_TEMPLATE std::unordered_map
 #ifdef USE_UNORDERED_MAP
 #  include <unordered_map>
 #  define MAP_TEMPLATE std::unordered_map


@@ -14,9 +14,8 @@
 #  define MAP_TEMPLATE std::map
 #endif
 #include <vector>
 #  define MAP_TEMPLATE std::map
 #endif
 #include <vector>

-#include <msg/msg.h>
+#include <simgrid/msg.h>

 #include <xbt/log.h>
 #include <xbt/log.h>

-#include "atomic_compat.h"

 #include "communicator.h"
 #include "misc.h"
 #include "msg_thread.h"
 #include "communicator.h"
 #include "misc.h"
 #include "msg_thread.h"


@@ -205,12 +204,10 @@ private:
 template <typename Compare>
 void process::pneigh_sort_by_load(const Compare& comp)
 {
 template <typename Compare>
 void process::pneigh_sort_by_load(const Compare& comp)
 {

-    using std::placeholders::_1;
-    using std::placeholders::_2;

     std::sort(pneigh.begin(), pneigh.end(),
     std::sort(pneigh.begin(), pneigh.end(),

-              std::bind(comp,
-                        std::bind(&neighbor::get_load, _1),
-                        std::bind(&neighbor::get_load, _2)));
+              [&comp](const neighbor* a, const neighbor* b) {
+                  return comp(a->get_load(), b->get_load());
+              });

 }
 
 #endif // !PROCESS_H
 }
 
 #endif // !PROCESS_H