Diffstat (limited to 'noncore/games/solitaire/cardgamelayout.cpp') (more/less context) (show whitespace changes)
-rw-r--r-- | noncore/games/solitaire/cardgamelayout.cpp | 61 |
1 files changed, 61 insertions, 0 deletions
diff --git a/noncore/games/solitaire/cardgamelayout.cpp b/noncore/games/solitaire/cardgamelayout.cpp new file mode 100644 index 0000000..1ceee8d --- a/dev/null +++ b/noncore/games/solitaire/cardgamelayout.cpp | |||
@@ -0,0 +1,61 @@ | |||
1 | /********************************************************************** | ||
2 | ** Copyright (C) 2000 Trolltech AS. All rights reserved. | ||
3 | ** | ||
4 | ** This file is part of Qtopia Environment. | ||
5 | ** | ||
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 | ||
8 | ** Foundation and appearing in the file LICENSE.GPL included in the | ||
9 | ** packaging of this file. | ||
10 | ** | ||
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. | ||
13 | ** | ||
14 | ** See http://www.trolltech.com/gpl/ for GPL licensing information. | ||
15 | ** | ||
16 | ** Contact info@trolltech.com if any conditions of this licensing are | ||
17 | ** not clear to you. | ||
18 | ** | ||
19 | **********************************************************************/ | ||
20 | #include "cardgamelayout.h" | ||
21 | |||
22 | |||
23 | CardGameLayout::~CardGameLayout() | ||
24 | { | ||
25 | // Should I just do setAutoDelete( TRUE ); ? | ||
26 | for (CardPile *p = first(); p != NULL; p = next()) | ||
27 | delete p; | ||
28 | } | ||
29 | |||
30 | |||
31 | CardPile *CardGameLayout::closestPile(int x, int y, int maxDistance) | ||
32 | { | ||
33 | int closestDistance = maxDistance * maxDistance; | ||
34 | CardPile *closestPile = NULL; | ||
35 | |||
36 | for (CardPile *p = first(); p != NULL; p = next()) { | ||
37 | int d = p->distanceFromNextPos(x, y); | ||
38 | if (d < closestDistance) { | ||
39 | closestDistance = d; | ||
40 | closestPile = p; | ||
41 | } | ||
42 | } | ||
43 | |||
44 | return closestPile; | ||
45 | } | ||
46 | |||
47 | |||
48 | void CardGameLayout::beginDealing() | ||
49 | { | ||
50 | for (CardPile *p = first(); p != NULL; p = next()) | ||
51 | p->beginDealing(); | ||
52 | } | ||
53 | |||
54 | |||
55 | void CardGameLayout::endDealing() | ||
56 | { | ||
57 | for (CardPile *p = first(); p != NULL; p = next()) | ||
58 | p->endDealing(); | ||
59 | } | ||
60 | |||
61 | |||