summaryrefslogtreecommitdiff
authorsandman <sandman>2002-06-28 20:56:33 (UTC)
committer sandman <sandman>2002-06-28 20:56:33 (UTC)
commit5223240e859a0433605ee642b3aac68a05e4d0f4 (patch) (side-by-side diff)
treebc9ca9e1a807a7df12f10450fff8b8ee8ea96e6f
parent545d7b51d67e4c1fa6be40436103b0a6b237a3a7 (diff)
downloadopie-5223240e859a0433605ee642b3aac68a05e4d0f4.zip
opie-5223240e859a0433605ee642b3aac68a05e4d0f4.tar.gz
opie-5223240e859a0433605ee642b3aac68a05e4d0f4.tar.bz2
Fixed includes to allow compilation on x86
Diffstat (more/less context) (ignore whitespace changes)
-rw-r--r--noncore/games/solitaire/cardgamelayout.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/noncore/games/solitaire/cardgamelayout.cpp b/noncore/games/solitaire/cardgamelayout.cpp
index 1ceee8d..e21d08a 100644
--- a/noncore/games/solitaire/cardgamelayout.cpp
+++ b/noncore/games/solitaire/cardgamelayout.cpp
@@ -1,45 +1,45 @@
/**********************************************************************
** Copyright (C) 2000 Trolltech AS. All rights reserved.
**
** This file is part of Qtopia Environment.
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.trolltech.com/gpl/ for GPL licensing information.
**
** Contact info@trolltech.com if any conditions of this licensing are
** not clear to you.
**
**********************************************************************/
#include "cardgamelayout.h"
-
+#include "card.h"
CardGameLayout::~CardGameLayout()
{
// Should I just do setAutoDelete( TRUE ); ?
for (CardPile *p = first(); p != NULL; p = next())
delete p;
}
CardPile *CardGameLayout::closestPile(int x, int y, int maxDistance)
{
int closestDistance = maxDistance * maxDistance;
CardPile *closestPile = NULL;
for (CardPile *p = first(); p != NULL; p = next()) {
int d = p->distanceFromNextPos(x, y);
if (d < closestDistance) {
closestDistance = d;
closestPile = p;
}
}
return closestPile;
}