eliot-dev
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Eliot-dev] Changes to eliot/game/cross.cpp [antoine-1]


From: eliot-dev
Subject: [Eliot-dev] Changes to eliot/game/cross.cpp [antoine-1]
Date: Sun, 23 Oct 2005 13:16:29 -0400

Index: eliot/game/cross.cpp
diff -u /dev/null eliot/game/cross.cpp:1.3.2.1
--- /dev/null   Sun Oct 23 17:16:29 2005
+++ eliot/game/cross.cpp        Sun Oct 23 17:16:24 2005
@@ -0,0 +1,66 @@
+/*****************************************************************************
+ * Copyright (C) 2005 Eliot
+ * Authors: Olivier Teuliere  <address@hidden>
+ *
+ * $Id: cross.cpp,v 1.3.2.1 2005/10/23 17:16:24 afrab Exp $
+ *
+ * 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 St, Fifth Floor, Boston, MA  02110-1301  USA
+ *****************************************************************************/
+
+#include "cross.h"
+
+
+Cross::Cross()
+{
+    // the default behaviour is to match everything
+    m_any = true;
+}
+
+
+void Cross::clear()
+{
+    m_tilesSet.clear();
+    m_any = false;
+}
+
+
+bool Cross::check(const Tile& iTile) const
+{
+    if (m_any || (iTile.isJoker() && !m_tilesSet.empty()))
+        return true;
+    std::set<Tile>::const_iterator it = m_tilesSet.find(iTile);
+    return it != m_tilesSet.end();
+}
+
+
+bool Cross::operator==(const Cross &iOther) const
+{
+    if (isAny() && iOther.isAny())
+        return true;
+    // Two sets are equal if they have the same size and one of them contains
+    // the other one
+    if (m_tilesSet.size() == iOther.m_tilesSet.size())
+    {
+        std::set<Tile>::const_iterator it;
+        for (it = m_tilesSet.begin(); it != m_tilesSet.end(); it++)
+        {
+            if (!iOther.check(*it))
+                return false;
+        }
+        return true;
+    }
+    else
+        return false;
+}




reply via email to

[Prev in Thread] Current Thread [Next in Thread]