Use range-based-for in late join

No functional change.

diff --git a/src/search.cpp b/src/search.cpp
index 04d67afebf77195f15f8e85758d488ef17fed5d9..bc41978f2041cc1d4ac6f46aa40f6763eaea707c 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -1585,24 +1585,24 @@ void Thread::idle_loop() {
           Thread* bestThread = NULL;
           int bestScore = INT_MAX;
 
           Thread* bestThread = NULL;
           int bestScore = INT_MAX;
 

-          for (size_t i = 0; i < Threads.size(); ++i)
+          for (Thread* th : Threads)

           {
           {

-              const size_t size = Threads[i]->splitPointsSize; // Local copy
-              sp = size ? &Threads[i]->splitPoints[size - 1] : nullptr;
+              const size_t size = th->splitPointsSize; // Local copy
+              sp = size ? &th->splitPoints[size - 1] : nullptr;

 
               if (   sp
                   && sp->allSlavesSearching
                   && sp->slavesMask.count() < MAX_SLAVES_PER_SPLITPOINT
 
               if (   sp
                   && sp->allSlavesSearching
                   && sp->slavesMask.count() < MAX_SLAVES_PER_SPLITPOINT

-                  && available_to(Threads[i]))
+                  && available_to(th))

               {
               {

-                  assert(this != Threads[i]);
+                  assert(this != th);

                   assert(!(this_sp && this_sp->slavesMask.none()));
                   assert(Threads.size() > 2);
 
                   // Prefer to join to SP with few parents to reduce the probability
                   // that a cut-off occurs above us, and hence we waste our work.
                   int level = -1;
                   assert(!(this_sp && this_sp->slavesMask.none()));
                   assert(Threads.size() > 2);
 
                   // Prefer to join to SP with few parents to reduce the probability
                   // that a cut-off occurs above us, and hence we waste our work.
                   int level = -1;

-                  for (SplitPoint* spp = Threads[i]->activeSplitPoint; spp; spp = spp->parentSplitPoint)
+                  for (SplitPoint* spp = th->activeSplitPoint; spp; spp = spp->parentSplitPoint)

                       level++;
 
                   int score = level * 256 * 256 + (int)sp->slavesMask.count() * 256 - sp->depth * 1;
                       level++;
 
                   int score = level * 256 * 256 + (int)sp->slavesMask.count() * 256 - sp->depth * 1;


@@ -1610,7 +1610,7 @@ void Thread::idle_loop() {
                   if (score < bestScore)
                   {
                       bestSp = sp;
                   if (score < bestScore)
                   {
                       bestSp = sp;

-                      bestThread = Threads[i];
+                      bestThread = th;

                       bestScore = score;
                   }
               }
                       bestScore = score;
                   }
               }