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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/*
This file is part of the TDE games library
Copyright (C) 2003 Andreas Beckermann ([email protected])
Copyright (C) 2003 Martin Heni ([email protected])
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License version 2 as published by the Free Software Foundation.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
/*
$Id$
*/
#include "kgamesequence.h"
#include "kgamesequence.moc"
#include "kplayer.h"
#include "kgame.h"
KGameSequence::KGameSequence() : TQObject()
{
mGame = 0;
mCurrentPlayer = 0;
}
KGameSequence::~KGameSequence()
{
}
void KGameSequence::setGame(KGame* game)
{
mGame = game;
}
void KGameSequence::setCurrentPlayer(KPlayer* player)
{
mCurrentPlayer = player;
}
KPlayer *KGameSequence::nextPlayer(KPlayer *last,bool exclusive)
{
kdDebug(11001) << "=================== NEXT PLAYER =========================="<<endl;
if (!game())
{
kdError() << k_funcinfo << "NULL game object" << endl;
return 0;
}
unsigned int minId,nextId,lastId;
KPlayer *nextplayer, *minplayer;
if (last)
{
lastId = last->id();
}
else
{
lastId = 0;
}
kdDebug(11001) << "nextPlayer: lastId="<<lastId<<endl;
// remove when this has been checked
minId = 0x7fff; // we just need a very large number...properly MAX_UINT or so would be ok...
nextId = minId;
nextplayer = 0;
minplayer = 0;
KPlayer *player;
for (player = game()->playerList()->first(); player != 0; player=game()->playerList()->next() )
{
// Find the first player for a cycle
if (player->id() < minId)
{
minId=player->id();
minplayer=player;
}
if (player==last)
{
continue;
}
// Find the next player which is bigger than the current one
if (player->id() > lastId && player->id() < nextId)
{
nextId=player->id();
nextplayer=player;
}
}
// Cycle to the beginning
if (!nextplayer)
{
nextplayer=minplayer;
}
kdDebug(11001) << k_funcinfo << " ##### lastId=" << lastId << " exclusive="
<< exclusive << " minId=" << minId << " nextid=" << nextId
<< " count=" << game()->playerList()->count() << endl;
if (nextplayer)
{
nextplayer->setTurn(true,exclusive);
}
else
{
return 0;
}
return nextplayer;
}
// Per default we do not do anything
int KGameSequence::checkGameOver(KPlayer*)
{
return 0;
}
/*
* vim: et sw=2
*/
|
