/// lsb()/msb() finds the least/most significant bit in a nonzero bitboard.
/// pop_lsb() finds and clears the least significant bit in a nonzero bitboard.
-#if !defined(USE_BSFQ)
+#ifndef USE_BSFQ
Square lsb(Bitboard b) { return BSFTable[bsf_index(b)]; }
return (Square)(result + MS1BTable[b32]);
}
-#endif // !defined(USE_BSFQ)
+#endif // ifndef USE_BSFQ
/// Bitboards::print() prints a bitboard in an easily readable format to the
do magics[s] = pick_random(rk, booster);
while (popcount<Max15>((magics[s] * masks[s]) >> 56) < 6);
- memset(attacks[s], 0, size * sizeof(Bitboard));
+ std::memset(attacks[s], 0, size * sizeof(Bitboard));
// A good magic must map every possible occupancy to an index that
// looks up the correct sliding attack in the attacks[s] database.