X-Git-Url: http://git.scottworley.com/slidingtile/blobdiff_plain/82d6eed523b5c102d826b66e21c03f5577199714..cada47bfe401f2084c4248df10cdf0488bc8750a:/sliding_tile_lib.cc diff --git a/sliding_tile_lib.cc b/sliding_tile_lib.cc index 4b422c1..5037c8e 100644 --- a/sliding_tile_lib.cc +++ b/sliding_tile_lib.cc @@ -1,5 +1,9 @@ #include "sliding_tile_lib.h" +#include +#include +#include + signed char adjacent[BOARD_SIZE][5] = { 1, 4, -1, -1, -1, 0, 2, 5, -1, -1, @@ -18,3 +22,65 @@ signed char adjacent[BOARD_SIZE][5] = { 10, 13, 15, -1, -1, 11, 14, -1, -1, -1, }; + +bool Board::is_valid() const { + bool seen[BOARD_SIZE]; + for (int i = 0; i < BOARD_SIZE; i++) { + seen[i] = false; + } + + for (int i = 0; i < BOARD_SIZE; i++) { + if (board[i] < 0 || board[i] >= BOARD_SIZE || seen[board[i]]) { + return false; + } + seen[board[i]] = true; + } + + // Redundant because pigeon-hole-principle, but check anyway + for (int i = 0; i < BOARD_SIZE; i++) { + if (!seen[i]) { + return false; + } + } + + return true; +} + +std::istream& operator>>(std::istream& is, Board& board) { + for (int i = 0; i < BOARD_SIZE; i++) { + if (!is.good()) { + is.setstate(std::istream::failbit); + break; + } + if (i > 0 && is.get() != ',') { + is.setstate(std::istream::failbit); + break; + } + int numeric; + is >> numeric; + board.board[i] = numeric; + } + if (!board.is_valid()) { + is.setstate(std::istream::failbit); + } + return is; +} + +std::ostream& operator<<(std::ostream& os, const Board& board) { + for (int i = 0; i < BOARD_SIZE; i++) { + if (i > 0) { + os << " "; + } + os << int(board.board[i]); + } + return os; +} + +signed char Board::hole() const { + for (int i = 0; i < BOARD_SIZE; i++) { + if (board[i] == 0) { + return i; + } + } + throw std::runtime_error("Board with no hole"); +}