-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.php
More file actions
472 lines (414 loc) · 13.1 KB
/
Copy pathStack.php
File metadata and controls
472 lines (414 loc) · 13.1 KB
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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
<?php
declare(strict_types=1);
namespace Likewinter\CardDeck;
use ArrayIterator;
use Iterator;
use IteratorAggregate;
use Likewinter\CardDeck\Card\Rank;
use Likewinter\CardDeck\Card\Suit;
/**
* An ordered collection of playable cards with an optional capacity.
*
* Orientation: the top of the stack is the FRONT of the internal list —
* takeTop()/peek() operate there — while addCards() appends to the
* bottom. peek* methods inspect without removing; take* methods remove
* and return the taken cards as a NEW Stack; move* methods transfer
* cards between stacks.
*
* Moves are transactional: if the target rejects the cards (for example
* because its capacity would be exceeded), the cards are returned to
* the source stack and the exception propagates.
*
* @implements IteratorAggregate<int, PlayableCard>
*/
class Stack implements IteratorAggregate, \Countable
{
/** @var list<PlayableCard> */
protected array $cards = [];
/**
* @param iterable<mixed, mixed> $cards Any iterable of items; each must implement PlayableCard (validated at runtime).
* @param int|null $capacity Maximum number of cards this stack may hold; null means unlimited.
*
* @throws \InvalidArgumentException If capacity < 1, an item is not a PlayableCard, or the initial cards exceed capacity.
*/
public function __construct(
iterable $cards = [],
public readonly ?int $capacity = null,
) {
if ($capacity !== null && $capacity < 1) {
throw new \InvalidArgumentException('Stack capacity must be greater than 0');
}
$list = [];
foreach ($cards as $card) {
if (!$card instanceof PlayableCard) {
throw new \InvalidArgumentException('All cards must implement PlayableCard');
}
$list[] = $card;
}
if ($capacity !== null && count($list) > $capacity) {
throw new \InvalidArgumentException('Stack capacity exceeded');
}
$this->cards = $list;
}
/**
* Parse a comma-separated card string (e.g. "A♠,K♥,10♦") into a stack.
*
* @throws \InvalidArgumentException If any segment is not a valid card string.
*/
#[\NoDiscard]
public static function fromString(string $string, ?int $capacity = null): self
{
if ($string === '') {
return new self();
}
$cards = explode(',', $string);
return new self(array_map(Card::fromString(...), $cards), $capacity);
}
/**
* Iterates over the cards from top to bottom.
*/
public function getIterator(): Iterator
{
return new ArrayIterator($this->cards);
}
/**
* Returns the number of cards currently in the stack.
*/
public function count(): int
{
return count($this->cards);
}
/**
* Renders the cards as a comma-separated string, e.g. "A♠,K♥".
*/
public function __toString(): string
{
return implode(',', $this->cards);
}
/**
* Whether the stack has a capacity and it is fully occupied.
*/
public function isFull(): bool
{
return $this->capacity !== null && count($this->cards) === $this->capacity;
}
/**
* Whether the stack holds no cards.
*/
public function isEmpty(): bool
{
return $this->cards === [];
}
/**
* Stacks are the same if they have the same number of cards and the same cards in the same order.
*/
public function isSame(self $other): bool
{
if ($this->count() !== $other->count()) {
return false;
}
foreach ($this->cards as $i => $card) {
if (!$card->equals($other->cards[$i])) {
return false;
}
}
return true;
}
/**
* Whether the stack holds at least $num cards.
*
* @throws \InvalidArgumentException If $num < 1.
*/
public function enoughCards(int $num): bool
{
if ($num < 1) {
throw new \InvalidArgumentException('Number of cards to check must be greater than 0');
}
return $this->count() >= $num;
}
/**
* Check if the stack contains at least one match for each given card
* (using equals()). A single stack card can satisfy multiple query
* cards — use hasExactCards() when duplicates must match distinct
* stack entries.
*/
public function hasCards(PlayableCard ...$cards): bool
{
foreach ($cards as $card) {
$found = false;
foreach ($this->cards as $existing) {
if (!$existing->equals($card)) {
continue;
}
$found = true;
break;
}
if (!$found) {
return false;
}
}
return true;
}
/**
* Check if the stack has exactly the given cards, so if there are two of the same card and the stack contains only one,
* it will return false.
*/
public function hasExactCards(PlayableCard ...$cards): bool
{
if ($cards === []) {
return true;
}
$matched = [];
foreach ($cards as $card) {
$found = false;
foreach ($this->cards as $i => $existing) {
if (array_key_exists($i, $matched)) {
continue;
}
if ($existing->equals($card)) {
$matched[$i] = true;
$found = true;
break;
}
}
if (!$found) {
return false;
}
}
return true;
}
/**
* Append cards to the bottom of the stack.
*
* @throws \InvalidArgumentException If the cards would exceed capacity.
*/
public function addCards(PlayableCard ...$cards): void
{
if ($this->capacity !== null && (count($this->cards) + count($cards)) > $this->capacity) {
throw new \InvalidArgumentException('Adding these cards would exceed stack capacity');
}
$this->cards = array_merge($this->cards, array_values($cards));
}
/**
* Remove the given cards, matched via hasExactCards() (distinct stack
* entries per query card).
*
* @throws \InvalidArgumentException If the stack does not contain exactly these cards.
*/
public function removeCards(PlayableCard ...$cards): void
{
if (!$this->hasExactCards(...$cards)) {
throw new \InvalidArgumentException('Cards not found in stack');
}
$indicesToRemove = [];
foreach ($cards as $card) {
foreach ($this->cards as $index => $existing) {
if (array_key_exists($index, $indicesToRemove)) {
continue;
}
if ($existing->equals($card)) {
$indicesToRemove[$index] = true;
break;
}
}
}
$remaining = [];
foreach ($this->cards as $index => $existing) {
if (array_key_exists($index, $indicesToRemove)) {
continue;
}
$remaining[] = $existing;
}
$this->cards = $remaining;
}
/**
* Return the top $num cards as a new Stack WITHOUT removing them.
*
* @throws \InvalidArgumentException If the stack has fewer than $num cards.
*/
#[\NoDiscard]
public function peek(int $num = 1): self
{
if (!$this->enoughCards($num)) {
throw new \InvalidArgumentException('Not enough cards in stack');
}
return new self(array_slice($this->cards, 0, $num));
}
/**
* Return the bottom $num cards as a new Stack WITHOUT removing them.
*
* @throws \InvalidArgumentException If the stack has fewer than $num cards.
*/
#[\NoDiscard]
public function peekBottom(int $num = 1): self
{
if (!$this->enoughCards($num)) {
throw new \InvalidArgumentException('Not enough cards in stack');
}
return new self(array_slice($this->cards, -$num, $num));
}
/**
* Return $num randomly chosen cards as a new Stack WITHOUT removing them.
*
* @throws \InvalidArgumentException If the stack has fewer than $num cards.
*/
#[\NoDiscard]
public function peekRandom(int $num = 1): self
{
if (!$this->enoughCards($num)) {
throw new \InvalidArgumentException('Not enough cards in stack');
}
$keys = array_rand($this->cards, $num);
if (!is_array($keys)) {
$keys = [$keys];
}
return new self(array_map(fn($key) => $this->cards[$key], $keys));
}
/**
* Remove and return the top $num cards as a new Stack.
*
* @throws \InvalidArgumentException If the stack has fewer than $num cards.
*/
#[\NoDiscard]
public function takeCards(int $num = 1): self
{
if (!$this->enoughCards($num)) {
throw new \InvalidArgumentException('Not enough cards in stack');
}
$cards = array_splice($this->cards, 0, $num);
return new self($cards);
}
/**
* Alias of takeCards(): remove and return the top $num cards.
*
* @throws \InvalidArgumentException If the stack has fewer than $num cards.
*/
#[\NoDiscard]
public function takeTop(int $num = 1): self
{
return $this->takeCards($num);
}
/**
* Remove and return the bottom $num cards as a new Stack.
*
* @throws \InvalidArgumentException If the stack has fewer than $num cards.
*/
#[\NoDiscard]
public function takeBottom(int $num = 1): self
{
if (!$this->enoughCards($num)) {
throw new \InvalidArgumentException('Not enough cards in stack');
}
$cards = array_splice($this->cards, -$num, $num);
return new self($cards);
}
/**
* Move the top $num cards to $target.
*
* Transactional: if $target rejects the cards (e.g. its capacity
* would be exceeded), they are returned to this stack and the
* exception propagates.
*
* @throws \InvalidArgumentException If this stack has fewer than $num cards or the target rejects them.
*/
public function moveTo(self $target, int $num = 1): void
{
$cards = $this->takeCards($num);
try {
$target->addCards(...$cards);
} catch (\InvalidArgumentException $e) {
// Rollback: return the taken cards to the source so they
// aren't lost when the target rejects them (e.g. full stack).
$this->cards = array_merge($cards->cards, $this->cards);
throw $e;
}
}
/**
* Move every card to $target. No-op if this stack is empty.
*
* @throws \InvalidArgumentException If the target rejects the cards.
*/
public function moveAllTo(Stack $target): void
{
if ($this->isEmpty()) {
return;
}
$this->moveTo($target, $this->count());
}
/**
* Move specific cards to $target, matched via hasExactCards().
*
* @throws \InvalidArgumentException If the cards are not all present in this stack.
*/
public function moveCardsTo(Stack $target, PlayableCard ...$cards): void
{
if (!$this->hasExactCards(...$cards)) {
throw new \InvalidArgumentException('Cards not found in stack');
}
$target->addCards(...$cards);
$this->removeCards(...$cards);
}
/**
* Sort the cards in ascending order by rank using the given RankOrder.
*/
public function sortByRank(RankOrder $rankOrder): void
{
$this->sort(static fn(PlayableCard $a, PlayableCard $b) => $rankOrder->compare(
$a->underlyingCard()->rank,
$b->underlyingCard()->rank,
));
}
/**
* The ranks of all cards in the stack, in stack order.
*
* @return list<Rank>
*/
public function getRanks(): array
{
return array_map(static fn(PlayableCard $card) => $card->underlyingCard()->rank, $this->cards);
}
/**
* Whether at least one card in the stack has the given rank.
*/
public function hasRank(Rank $rank): bool
{
foreach ($this->cards as $card) {
if ($card->underlyingCard()->rank === $rank) {
return true;
}
}
return false;
}
/**
* The suits of all cards in the stack, in stack order.
*
* @return list<Suit>
*/
public function getSuits(): array
{
return array_map(static fn(PlayableCard $card) => $card->underlyingCard()->suit, $this->cards);
}
/**
* Sort the cards in place using a comparison callback, like usort().
*
* @param callable(PlayableCard, PlayableCard): int $callback
*/
public function sort(callable $callback): void
{
usort($this->cards, $callback);
}
/**
* Randomize the order of the cards in place.
*/
public function shuffle(): void
{
shuffle($this->cards);
}
/**
* Remove all cards from the stack.
*/
public function clear(): void
{
$this->cards = [];
}
}