void TranspositionTable::clear() {
- memset(table, 0, (hashMask + ClusterSize) * sizeof(TTEntry));
+ std::memset(table, 0, (hashMask + ClusterSize) * sizeof(TTEntry));
}
/// more valuable than a TTEntry t2 if t1 is from the current search and t2 is from
/// a previous search, or if the depth of t1 is bigger than the depth of t2.
-void TranspositionTable::store(const Key key, Value v, Bound t, Depth d, Move m, Value statV, Value kingD) {
+void TranspositionTable::store(const Key key, Value v, Bound b, Depth d, Move m, Value statV, Value evalM) {
int c1, c2, c3;
TTEntry *tte, *replace;
replace = tte;
}
- replace->save(key32, v, t, d, m, generation, statV, kingD);
+ replace->save(key32, v, b, d, m, generation, statV, evalM);
}