forked from janbodnar/Java-Advanced
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArraysSortObjectsEx.java
More file actions
93 lines (72 loc) · 1.84 KB
/
ArraysSortObjectsEx.java
File metadata and controls
93 lines (72 loc) · 1.84 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
package com.zetcode;
import java.util.Arrays;
import java.util.Comparator;
class Card implements Comparable<Card> {
@Override
public int compareTo(Card o) {
return Comparator.comparing(Card::getValue)
.thenComparing(Card::getSuit)
.compare(this, o);
}
public enum Suits {
SPADES,
CLUBS,
HEARTS,
DIAMONDS
}
public enum Values {
TWO,
THREE,
FOUR,
FIVE,
SIX,
SEVEN,
EIGHT,
NINE,
TEN,
JACK,
QUEEN,
KING,
ACE,
}
private Suits suit;
private Values value;
public Card(Values value, Suits suit) {
this.value = value;
this.suit = suit;
}
public Values getValue() {
return value;
}
public Suits getSuit() {
return suit;
}
public void showCard() {
value = getValue();
suit = getSuit();
System.out.println(value + " of " + suit);
}
@Override
public String toString() {
final var sb = new StringBuilder("Card{");
sb.append("suit=").append(suit);
sb.append(", value=").append(value);
sb.append('}');
return sb.toString();
}
}
public class ArraysSortObjectsEx {
public static void main(String[] args) {
Card[] cards = {
new Card(Card.Values.KING, Card.Suits.DIAMONDS),
new Card(Card.Values.FIVE, Card.Suits.HEARTS),
new Card(Card.Values.ACE, Card.Suits.CLUBS),
new Card(Card.Values.NINE, Card.Suits.SPADES),
new Card(Card.Values.JACK, Card.Suits.SPADES),
new Card(Card.Values.JACK, Card.Suits.DIAMONDS)};
Arrays.sort(cards);
for (Card card : cards) {
System.out.println(card);
}
}
}