summaryrefslogtreecommitdiff
authorsandman <sandman>2002-06-28 20:56:33 (UTC)
committer sandman <sandman>2002-06-28 20:56:33 (UTC)
commit5223240e859a0433605ee642b3aac68a05e4d0f4 (patch) (unidiff)
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,61 +1,61 @@
1/********************************************************************** 1/**********************************************************************
2** Copyright (C) 2000 Trolltech AS. All rights reserved. 2** Copyright (C) 2000 Trolltech AS. All rights reserved.
3** 3**
4** This file is part of Qtopia Environment. 4** This file is part of Qtopia Environment.
5** 5**
6** This file may be distributed and/or modified under the terms of the 6** This file may be distributed and/or modified under the terms of the
7** GNU General Public License version 2 as published by the Free Software 7** GNU General Public License version 2 as published by the Free Software
8** Foundation and appearing in the file LICENSE.GPL included in the 8** Foundation and appearing in the file LICENSE.GPL included in the
9** packaging of this file. 9** packaging of this file.
10** 10**
11** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE 11** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
12** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. 12** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
13** 13**
14** See http://www.trolltech.com/gpl/ for GPL licensing information. 14** See http://www.trolltech.com/gpl/ for GPL licensing information.
15** 15**
16** Contact info@trolltech.com if any conditions of this licensing are 16** Contact info@trolltech.com if any conditions of this licensing are
17** not clear to you. 17** not clear to you.
18** 18**
19**********************************************************************/ 19**********************************************************************/
20#include "cardgamelayout.h" 20#include "cardgamelayout.h"
21 21#include "card.h"
22 22
23CardGameLayout::~CardGameLayout() 23CardGameLayout::~CardGameLayout()
24{ 24{
25 // Should I just do setAutoDelete( TRUE ); ? 25 // Should I just do setAutoDelete( TRUE ); ?
26 for (CardPile *p = first(); p != NULL; p = next()) 26 for (CardPile *p = first(); p != NULL; p = next())
27 delete p; 27 delete p;
28} 28}
29 29
30 30
31CardPile *CardGameLayout::closestPile(int x, int y, int maxDistance) 31CardPile *CardGameLayout::closestPile(int x, int y, int maxDistance)
32{ 32{
33 int closestDistance = maxDistance * maxDistance; 33 int closestDistance = maxDistance * maxDistance;
34 CardPile *closestPile = NULL; 34 CardPile *closestPile = NULL;
35 35
36 for (CardPile *p = first(); p != NULL; p = next()) { 36 for (CardPile *p = first(); p != NULL; p = next()) {
37 int d = p->distanceFromNextPos(x, y); 37 int d = p->distanceFromNextPos(x, y);
38 if (d < closestDistance) { 38 if (d < closestDistance) {
39 closestDistance = d; 39 closestDistance = d;
40 closestPile = p; 40 closestPile = p;
41 } 41 }
42 } 42 }
43 43
44 return closestPile; 44 return closestPile;
45} 45}
46 46
47 47
48void CardGameLayout::beginDealing() 48void CardGameLayout::beginDealing()
49{ 49{
50 for (CardPile *p = first(); p != NULL; p = next()) 50 for (CardPile *p = first(); p != NULL; p = next())
51 p->beginDealing(); 51 p->beginDealing();
52} 52}
53 53
54 54
55void CardGameLayout::endDealing() 55void CardGameLayout::endDealing()
56{ 56{
57 for (CardPile *p = first(); p != NULL; p = next()) 57 for (CardPile *p = first(); p != NULL; p = next())
58 p->endDealing(); 58 p->endDealing();
59} 59}
60 60
61 61