1 files changed, 136 insertions, 0 deletions
diff --git a/rack.cpp b/rack.cpp
new file mode 100644
index 0000000..56302f4
--- /dev/null
+++ b/rack.cpp
@@ -0,0 +1,136 @@
+/*
+ *  Quackle -- Crossword game artificial intelligence and analysis tool
+ *  Copyright (C) 2005-2006 Jason Katz-Brown and John O'Laughlin.
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  
+ *  02110-1301  USA
+ */
+
+#include <algorithm>
+#include <iostream>
+
+#include "datamanager.h"
+#include "move.h"
+#include "rack.h"
+#include "uv.h"
+
+using namespace std;
+using namespace Quackle;
+
+LetterString Rack::alphaTiles() const
+{
+	return String::alphabetize(m_tiles);
+}
+
+bool Rack::equals(const Rack &rack) const
+{
+	return alphaTiles() == rack.alphaTiles();
+}
+
+bool Rack::unload(const LetterString &used)
+{
+	// UVcout << *this << ".unload(" << used << ")" << endl;
+
+	LetterString newtiles = m_tiles;
+	bool ret = true;
+
+	LetterString::const_iterator usedEnd(used.end());
+	for (LetterString::const_iterator usedIt = used.begin(); usedIt != usedEnd; ++usedIt)
+	{
+		bool found = false;
+
+		LetterString::iterator newEnd(newtiles.end());
+		for (LetterString::iterator newIt = newtiles.begin(); newIt != newEnd; ++newIt)
+		{
+			if (*newIt == *usedIt)
+			{
+				*newIt = QUACKLE_NULL_MARK;
+				found = true;
+				break;
+			}
+		}
+
+		if (!found)
+			ret = false;
+	}
+
+	// UVcout << "newtiles: " << newtiles << endl;
+
+	m_tiles.clear();
+
+	LetterString::const_iterator newEnd(newtiles.end());
+	for (LetterString::const_iterator newIt = newtiles.begin(); newIt != newEnd; ++newIt)
+		if (*newIt != QUACKLE_NULL_MARK)
+			m_tiles += *newIt; 
+
+	return ret;
+}
+
+bool Rack::contains(const LetterString &used) const
+{
+	return Rack(*this).unload(used);
+}
+
+void Rack::shuffle()
+{
+	random_shuffle(m_tiles.begin(), m_tiles.end());
+}
+
+int Rack::score() const
+{
+	int ret = 0;
+
+	const LetterString::const_iterator end(m_tiles.end());
+	for (LetterString::const_iterator it = m_tiles.begin(); it != end; ++it)
+		ret += QUACKLE_ALPHABET_PARAMETERS->score(*it);
+
+	return ret;
+}
+
+unsigned int Rack::size() const
+{
+	return m_tiles.size();
+}
+
+const Rack operator-(const Rack &rack, const Move &move)
+{
+	Rack ret(rack);
+    ret.unload(move.usedTiles());
+    return ret;
+}
+
+const Rack operator-(const Rack &rack1, const Rack &rack2)
+{
+	Rack ret(rack1);
+    ret.unload(rack2.tiles());
+    return ret;
+}
+
+UVString Rack::xml() const
+{
+	return MARK_UV("<rack tiles=\"") + QUACKLE_ALPHABET_PARAMETERS->userVisible(m_tiles) + MARK_UV("\" />");
+}
+
+UVString Rack::toString() const
+{
+	return QUACKLE_ALPHABET_PARAMETERS->userVisible(m_tiles);
+}
+
+UVOStream &operator<<(UVOStream &o, const Rack &rack)
+{
+    o << rack.toString();
+    return o;
+}
+