Fix compiler warnings. (LeelaChessZero#1298)

borg323 · May 13, 2020 · 0d1bb0b · 0d1bb0b
1 parent c313d7c
commit 0d1bb0b
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 8 deletions.
diff --git a/src/mcts/search.cc b/src/mcts/search.cc
@@ -28,14 +28,14 @@
 #include "mcts/search.h"
 
 #include <algorithm>
+#include <array>
 #include <chrono>
 #include <cmath>
 #include <iomanip>
 #include <iostream>
 #include <iterator>
 #include <sstream>
 #include <thread>
-#include <array>
 
 #include "mcts/node.h"
 #include "neural/cache.h"
@@ -1549,9 +1549,9 @@ void SearchWorker::DoBackupUpdateSingleNode(
     // that isn't already the best and the new n is equal or greater to the old
     // n.
     if (p == search_->root_node_ &&
-        (old_update_parent_bounds && n->IsTerminal() ||
-         n != search_->current_best_edge_.node() &&
-             search_->current_best_edge_.GetN() <= n->GetN())) {
+        ((old_update_parent_bounds && n->IsTerminal()) ||
+         (n != search_->current_best_edge_.node() &&
+          search_->current_best_edge_.GetN() <= n->GetN()))) {
       search_->current_best_edge_ =
           search_->GetBestChildNoTemperature(search_->root_node_, 0);
     }

diff --git a/src/mcts/stoppers/smooth.cc b/src/mcts/stoppers/smooth.cc
@@ -314,10 +314,6 @@ class SmoothTimeManager : public TimeManager {
   int64_t last_move_final_nodes_ GUARDED_BY(mutex_) = 0;
   // Time of the last report, since the beginning of the move.
   int64_t last_time_ GUARDED_BY(mutex_) = 0;
-
-  // According to the recent calculations, how much time should be spent in
-  // average per move.
-  float last_expected_movetime_ms_ GUARDED_BY(mutex_) = 0.0f;
 };
 
 SmoothStopper::SmoothStopper(int64_t deadline_ms, SmoothTimeManager* manager)