-
Notifications
You must be signed in to change notification settings - Fork 152
Expand file tree
/
Copy pathDeck.java
More file actions
109 lines (97 loc) · 2.62 KB
/
Copy pathDeck.java
File metadata and controls
109 lines (97 loc) · 2.62 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
/*******************************************************************************
* Companion code for the book "Introduction to Software Design with Java",
* 3rd edition by Martin P. Robillard.
*
* Copyright (C) 2025 by Martin P. Robillard
*
* This code is licensed under a Creative Commons
* Attribution-NonCommercial-NoDerivatives 4.0 International License.
*
* See http://creativecommons.org/licenses/by-nc-nd/4.0/
*
*******************************************************************************/
package e3.chapter3;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
/**
* Represents a deck of playing cards. In this version, the cards in the deck
* are stored in a list and the list of cards in the deck can be obtained by
* client code using an immutable wrapper object.
*
* This version of the Deck class also implements {@link CardSource} and has a
* sort() method to demonstrate the use of comparators.
*
* The Deck is also iterable: it fulfills the role of ConcreteIterable in the
* Iterator design pattern.
*/
public class Deck implements CardSource, Iterable<Card> {
private List<Card> aCards = new ArrayList<>();
/**
* Creates a new deck of 52 cards, shuffled.
*/
public Deck() {
shuffle();
}
/**
* Reinitializes the deck with all 52 cards, and shuffles them.
*/
public void shuffle() {
aCards.clear();
for (Suit suit : Suit.values()) {
for (Rank rank : Rank.values()) {
aCards.add(new Card(rank, suit));
}
}
Collections.shuffle(aCards);
}
/**
* Places pCard on top of the deck.
*
* @param pCard The card to place on top of the deck.
* @pre pCard !=null
*/
public void push(Card pCard) {
assert pCard != null;
aCards.add(pCard);
}
/**
* Draws a card from the deck: removes the card from the top of the deck and
* returns it.
*
* @return The card drawn.
* @pre !isEmpty()
*/
public Card draw() {
assert !isEmpty();
return aCards.remove(aCards.size() - 1);
}
/**
* @return True if and only if there are no cards in the deck.
*/
public boolean isEmpty() {
return aCards.isEmpty();
}
/**
* @return An unmodifiable list of all the cards in the deck.
*/
public List<Card> getCards() {
return Collections.unmodifiableList(aCards);
}
/**
* Sorts the cards in the deck by ascending rank.
*/
public void sort() {
Collections.sort(aCards, new Comparator<Card>() {
public int compare(Card pCard1, Card pCard2) {
return pCard1.rank().compareTo(pCard2.rank());
}
});
}
@Override
public Iterator<Card> iterator() {
return aCards.iterator();
}
}