Define process::print_loads_p() to print loads by using neighp[]

[loba.git] / loba_fairstrategy.cpp

diff --git a/loba_fairstrategy.cpp b/loba_fairstrategy.cpp
index 81de9e100a7e0941fbe0974e35d9c56e949cb7f3..eb05b492d9adc4222ab64524164e25d1a40a286e 100644 (file)
--- a/loba_fairstrategy.cpp
+++ b/loba_fairstrategy.cpp
@@ -1,9 +1,10 @@
-#include "loba_fairstrategy.h"
 #include <algorithm>
 #include <xbt/log.h>
 
 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(loba);
 
+#include "loba_fairstrategy.h"
+
 /* simple version:
  *   load balance with a least-loaded neighbor,
  *   without breaking the ping-pong condition
@@ -25,12 +26,7 @@ double loba_fairstrategy::load_balance(double my_load)
 
                std::sort(pneigh.begin(),pneigh.end(),compare());
 
-               //print_loads();
-
-               INFO0("list voisins");
-               for(unsigned i=0;i< pneigh.size() ; ++i) {
-                       INFO2("%s %f ", pneigh[i]->get_name(), pneigh[i]->get_load());
-               }
+               print_loads_p();
 
                double sum_sent=0;
                bool found=true;