eliot-dev
[Top][All Lists]
Advanced

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

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


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

Index: eliot/game/results.cpp
diff -u /dev/null eliot/game/results.cpp:1.5.2.1
--- /dev/null   Sun Oct 23 17:16:37 2005
+++ eliot/game/results.cpp      Sun Oct 23 17:16:24 2005
@@ -0,0 +1,72 @@
+/*****************************************************************************
+ * Copyright (C) 1999-2005 Eliot
+ * Authors: Antoine Fraboulet <address@hidden>
+ *          Olivier Teuliere  <address@hidden>
+ *
+ * $Id: results.cpp,v 1.5.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 <algorithm>
+#include <functional>
+
+#include "tile.h"
+#include "round.h"
+#include "board.h"
+#include "results.h"
+#include "debug.h"
+
+
+struct less_points : public std::binary_function < const Round&, const Round&, 
bool >
+{
+    bool operator()(const Round &r1, const Round &r2)
+    {
+        // We want higher scores first, so we use '>' instead of '<'
+        return r1.getPoints() > r2.getPoints();
+    }
+};
+
+
+const Round & Results::get(int i) const
+{
+    ASSERT(0 <= i && i < size(), "Results index out of bounds");
+    return m_rounds[i];
+}
+
+
+void Results::search(const Dictionary iDic, Board &iBoard,
+                     const Rack &iRack, int iTurn)
+{
+    clear();
+
+    if (iTurn == 0)
+      {
+        iBoard.searchFirst(iDic, iRack, *this);
+      }
+    else
+      {
+        iBoard.search(iDic, iRack, *this);
+      }
+}
+
+
+void Results::sort_by_points()
+{
+    less_points lp;
+    std::sort(m_rounds.begin(), m_rounds.end(), lp);
+}
+
+




reply via email to

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