mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-20 00:56:39 +08:00
Use std::vector to implement HashTable
Allows some code semplification and avoids directly allocation and managing heap memory. Also the usual renaming while there. No functional change and no speed regression. Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
@@ -903,8 +903,8 @@ void Position::do_move(Move m, StateInfo& newSt, const CheckInfo& ci, bool moveI
|
||||
}
|
||||
|
||||
// Prefetch pawn and material hash tables
|
||||
Threads[threadID].pawnTable.prefetch(st->pawnKey);
|
||||
Threads[threadID].materialTable.prefetch(st->materialKey);
|
||||
prefetch((char*)Threads[threadID].pawnTable.entries[st->pawnKey]);
|
||||
prefetch((char*)Threads[threadID].materialTable.entries[st->materialKey]);
|
||||
|
||||
// Update incremental scores
|
||||
st->value += pst_delta(piece, from, to);
|
||||
|
||||
Reference in New Issue
Block a user