X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.cpp;h=b1fa91d0033d28b36e4fe7fe87f931de58adde0c;hp=edee8179e2d7d3795446b628df14316925a72ae8;hb=2ca2c3f35b2e408fd97bdf7092f41e1e508eb7af;hpb=f54c44e6be0deaadefcb428af8d288e75955aa20

diff --git a/src/movepick.cpp b/src/movepick.cpp
index edee8179..b1fa91d0 100644
--- a/src/movepick.cpp
+++ b/src/movepick.cpp
@@ -49,10 +49,6 @@ namespace {
     }
   }
 
-  // Unary predicate used by std::partition to split positive values from remaining
-  // ones so as to sort the two sets separately, with the second sort delayed.
-  inline bool has_positive_value(const ExtMove& move) { return move.value > VALUE_ZERO; }
-
   // Picks the best move in the range (begin, end) and moves it to the front.
   // It's faster than sorting all the moves in advance when there are few
   // moves e.g. possible captures.
@@ -247,7 +243,7 @@ void MovePicker::generate_next_stage() {
   case QUIETS_1_S1:
       endQuiets = end = generate<QUIETS>(pos, moves);
       score<QUIETS>();
-      end = std::partition(cur, end, has_positive_value);
+      end = std::partition(cur, end, [](const ExtMove& m) { return m.value > VALUE_ZERO; });
       insertion_sort(cur, end);
       return;