Use a std::vector to store searchMoves

A std::set (that is a rb_tree) seems really
overkill to store at most a handful of moves
and nothing in the common case.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba
2012-04-01 12:26:14 +01:00
parent 72641dcaae
commit 7eb6a488ad
5 changed files with 10 additions and 11 deletions

View File

@@ -20,7 +20,6 @@
#if !defined(THREAD_H_INCLUDED)
#define THREAD_H_INCLUDED
#include <set>
#include <vector>
#include "material.h"
@@ -126,7 +125,7 @@ public:
void set_timer(int msec);
void wait_for_search_finished();
void start_searching(const Position& pos, const Search::LimitsType& limits,
const std::set<Move>& = std::set<Move>());
const std::vector<Move>& searchMoves);
template <bool Fake>
Value split(Position& pos, Search::Stack* ss, Value alpha, Value beta, Value bestValue, Move* bestMove,