Speed back up by only looking at subpops

benchmarktimes.txt

@@ -2,3 +2,4 @@ The median time is TrialEstimate(3.136 s)
 The median time is TrialEstimate(435.125 ms)
 The median time is TrialEstimate(422.519 ms) with annealing, TrialEstimate(361.631 ms) without
 The median time is TrialEstimate(985.015 ms) with annealing, TrialEstimate(857.946 ms) without
+The median time is TrialEstimate(690.542 ms) with annealing, TrialEstimate(581.777 ms) without

paralleleureqa.jl

@@ -40,13 +40,11 @@ function fullRun(niterations::Integer;
         bestPops = deepcopy(Population([member for pop in allPops for member in bestSubPop(pop).members]))
 
         #Update hall of fame
-        for pop in allPops
-            for member in pop.members
-                size = countNodes(member.tree)
-                if member.score < hallOfFame.members[size].score
-                    hallOfFame.members[size] = deepcopy(member)
-                    hallOfFame.exists[size] = true
-                end
+        for member in bestPops.members
+            size = countNodes(member.tree)
+            if member.score < hallOfFame.members[size].score
+                hallOfFame.members[size] = deepcopy(member)
+                hallOfFame.exists[size] = true
             end
         end