summaryrefslogtreecommitdiff
path: root/noncore/games/solitaire/cardgamelayout.cpp
blob: 1ceee8da4e808273774d325ad7816111cad5d1e3 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/**********************************************************************
** 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"


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;
}


void CardGameLayout::beginDealing()
{
    for (CardPile *p = first(); p != NULL; p = next())
	p->beginDealing();
}


void CardGameLayout::endDealing()
{
    for (CardPile *p = first(); p != NULL; p = next())
	p->endDealing();
}