diff --git a/AUTHORS b/AUTHORS index 462ae5e82d5..f34da92ed59 100644 --- a/AUTHORS +++ b/AUTHORS @@ -45,6 +45,7 @@ candirufish Chess13234 Chris Cain (ceebo) clefrks +Cody Ho Dale Weiler (graphitemaster) Daniel Axtens (daxtens) Daniel Dugovic (ddugovic) diff --git a/src/bitboard.h b/src/bitboard.h index bbed9177507..4faf271704b 100644 --- a/src/bitboard.h +++ b/src/bitboard.h @@ -44,8 +44,6 @@ constexpr Bitboard FileHBB = FileABB << 7; constexpr Bitboard Rank1BB = 0xFF; constexpr Bitboard Rank2BB = Rank1BB << (8 * 1); constexpr Bitboard Rank3BB = Rank1BB << (8 * 2); -constexpr Bitboard Rank4BB = Rank1BB << (8 * 3); -constexpr Bitboard Rank5BB = Rank1BB << (8 * 4); constexpr Bitboard Rank6BB = Rank1BB << (8 * 5); constexpr Bitboard Rank7BB = Rank1BB << (8 * 6); constexpr Bitboard Rank8BB = Rank1BB << (8 * 7); @@ -186,16 +184,6 @@ inline Bitboard between_bb(Square s1, Square s2) { return BetweenBB[s1][s2]; } - -/// forward_ranks_bb() returns a bitboard representing the squares on the ranks in -/// front of the given one, from the point of view of the given color. For instance, -/// forward_ranks_bb(BLACK, SQ_D3) will return the 16 squares on ranks 1 and 2. - -constexpr Bitboard forward_ranks_bb(Color c, Square s) { - return c == WHITE ? ~Rank1BB << 8 * relative_rank(WHITE, s) - : ~Rank8BB >> 8 * relative_rank(BLACK, s); -} - /// aligned() returns true if the squares s1, s2 and s3 are aligned either on a /// straight or on a diagonal line. diff --git a/src/misc.h b/src/misc.h index 69d470c22f8..0005fc0fb09 100644 --- a/src/misc.h +++ b/src/misc.h @@ -55,14 +55,6 @@ inline TimePoint now() { (std::chrono::steady_clock::now().time_since_epoch()).count(); } -template -struct HashTable { - Entry* operator[](Key key) { return &table[(uint32_t)key & (Size - 1)]; } - -private: - std::vector table = std::vector(Size); // Allocate on the heap -}; - enum SyncCout { IO_LOCK, IO_UNLOCK }; std::ostream& operator<<(std::ostream&, SyncCout);