int imax = -1;
double min = my_load;
double max = -1.0;
- for (unsigned i = 0 ; i < neigh.size() ; ++i) {
- double l = neigh[i].get_load();
+ for (unsigned i = 0 ; i < pneigh.size() ; ++i) {
+ double l = pneigh[i]->get_load();
if (l >= my_load)
continue;
if (l < min) {
// found someone
double balance = (my_load - max) / 2;
DEBUG6("%d:%g %d:%g %g %g", imin, min, imax, max, my_load, balance);
- neigh[imin].set_to_send(balance);
+ pneigh[imin]->set_to_send(balance);
return balance;
} else {
return 0.0;