kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-05-01 01:03:09 +00:00
Code Issues Releases Wiki Activity

Fix a compile error under gcc

Browse source 
And some warnings on the picky icc.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2010-01-04 17:17:40 +01:00
parent 721d557681
commit d11af1de11
1 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
src/search.cpp
View file

@ -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
}