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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
/*
* Copyright (C) 2010 Parker Coates <coates@kde.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of
* the License, or (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "pileutils.h"
#include "KCard"
#include "KCardDeck"
namespace
{
inline int alternateColor( int color )
{
return color == KCardDeck::Red ? KCardDeck::Black : KCardDeck::Red;
}
}
bool isSameSuitAscending( const QList<KCard*> & cards )
{
if ( cards.size() <= 1 )
return true;
int suit = cards.first()->suit();
int lastRank = cards.first()->rank();
for( int i = 1; i < cards.size(); ++i )
{
++lastRank;
if ( cards[i]->suit() != suit || cards[i]->rank() != lastRank )
return false;
}
return true;
}
int countSameSuitDescendingSequences( const QList<KCard*> & cards )
{
if ( cards.size() <= 1 )
return 0;
int suit = cards.first()->suit();
int lastRank = cards.first()->rank();
int count = 1;
for( int i = 1; i < cards.size(); ++i )
{
--lastRank;
if ( cards[i]->rank() != lastRank )
return -1;
if ( cards[i]->suit() != suit )
{
count++;
suit = cards[i]->suit();
}
}
return count;
}
bool isSameSuitDescending( const QList<KCard*> & cards )
{
if ( cards.size() <= 1 )
return true;
int suit = cards.first()->suit();
int lastRank = cards.first()->rank();
for( int i = 1; i < cards.size(); ++i )
{
--lastRank;
if ( cards[i]->suit() != suit || cards[i]->rank() != lastRank )
return false;
}
return true;
}
bool isAlternateColorDescending( const QList<KCard*> & cards )
{
if ( cards.size() <= 1 )
return true;
int lastColor = cards.first()->color();
int lastRank = cards.first()->rank();
for( int i = 1; i < cards.size(); ++i )
{
lastColor = alternateColor( lastColor );
--lastRank;
if ( cards[i]->color() != lastColor || cards[i]->rank() != lastRank )
return false;
}
return true;
}
bool checkAddSameSuitAscendingFromAce( const QList<KCard*> & oldCards, const QList<KCard*> & newCards )
{
if ( !isSameSuitAscending( newCards ) )
return false;
if ( oldCards.isEmpty() )
return newCards.first()->rank() == KCardDeck::Ace;
else
return newCards.first()->suit() == oldCards.last()->suit()
&& newCards.first()->rank() == oldCards.last()->rank() + 1;
}
bool checkAddAlternateColorDescending( const QList<KCard*> & oldCards, const QList<KCard*> & newCards )
{
return isAlternateColorDescending( newCards )
&& ( oldCards.isEmpty()
|| ( newCards.first()->color() == alternateColor( oldCards.last()->color() )
&& newCards.first()->rank() == oldCards.last()->rank() - 1 ) );
}
bool checkAddAlternateColorDescendingFromKing( const QList<KCard*> & oldCards, const QList<KCard*> & newCards )
{
if ( !isAlternateColorDescending( newCards ) )
return false;
if ( oldCards.isEmpty() )
return newCards.first()->rank() == KCardDeck::King;
else
return newCards.first()->color() == alternateColor( oldCards.last()->color() )
&& newCards.first()->rank() == oldCards.last()->rank() - 1;
}
QString suitToString(int s) {
switch (s) {
case KCardDeck::Clubs:
return QStringLiteral("C");
case KCardDeck::Hearts:
return QStringLiteral("H");
case KCardDeck::Diamonds:
return QStringLiteral("D");
case KCardDeck::Spades:
return QStringLiteral("S");
default:
exit(-1);
}
return QString();
}
QString rankToString(int r)
{
switch (r) {
case KCardDeck::King:
return QStringLiteral("K");
case KCardDeck::Ace:
return QStringLiteral("A");
case KCardDeck::Jack:
return QStringLiteral("J");
case KCardDeck::Queen:
return QStringLiteral("Q");
case KCardDeck::Ten:
return QStringLiteral("T");
default:
return QString::number(r);
}
}
QString cardToRankSuitString(const KCard *const card)
{
return rankToString(card->rank()) + suitToString(card->suit());
}
void cardsListToLine(QString & output, const QList<KCard*> &cards)
{
bool first = true;
for (QList<KCard*>::ConstIterator it = cards.constBegin(); it != cards.constEnd(); ++it)
{
if (!first)
{
output += QLatin1Char(' ');
}
first = false;
output += cardToRankSuitString(*it);
}
output += QLatin1Char('\n');
}
|
