From d11af1de11aa1b93e970f96105516e7c9b342fa4 Mon Sep 17 00:00:00 2001 From: Marco Costalba Date: Mon, 4 Jan 2010 17:17:40 +0100 Subject: [PATCH] Fix a compile error under gcc And some warnings on the picky icc. No functional change. Signed-off-by: Marco Costalba --- src/search.cpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/src/search.cpp b/src/search.cpp index 660fb7ed..1668a74a 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -100,7 +100,7 @@ namespace { // sorting the moves. A move m1 is considered to be better // than a move m2 if it has a higher score, or if the moves // have equal score but m1 has the higher node count. - bool RootMove::operator<(const RootMove& m) const { + bool operator<(const RootMove& m) const { return score != m.score ? score < m.score : theirBeta <= m.theirBeta; } @@ -2126,13 +2126,13 @@ namespace { // RootMoveList simple methods definitions - inline void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) { + void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) { moves[moveNum].nodes = nodes; moves[moveNum].cumulativeNodes += nodes; } - inline void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) { + void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) { moves[moveNum].ourBeta = our; moves[moveNum].theirBeta = their; @@ -2152,7 +2152,7 @@ namespace { // RootMoveList::sort() sorts the root move list at the beginning of a new // iteration. - inline void RootMoveList::sort() { + void RootMoveList::sort() { sort_multipv(count - 1); // Sort all items } -- 2.39.2