-
Notifications
You must be signed in to change notification settings - Fork 461
Expand file tree
/
Copy pathRow.java
More file actions
70 lines (55 loc) · 1.57 KB
/
Row.java
File metadata and controls
70 lines (55 loc) · 1.57 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
package chess;
import java.util.Arrays;
public enum Row {
EIGHT, // 0
SEVEN,
SIX,
FIVE,
FOUR,
THREE,
TWO,
ONE;
public static Row fromNumber(int number) {
return Arrays.stream(Row.values())
.filter(row -> row.ordinal() == 8 - number)
.findFirst()
.orElseThrow(IllegalStateException::new);
}
public static String ofOrdinal(int ordinal) {
return Arrays.stream(Row.values())
.filter(row -> row.ordinal() == ordinal)
.map(row -> ((8 - row.ordinal()) + ""))
.findFirst()
.orElseThrow(IllegalStateException::new);
}
public boolean isTop() {
return ordinal() == 0;
}
public boolean isBottom() {
return ordinal() + 1 == values().length;
}
public boolean canMoveUp(final int step) {
return ordinal() - step >= 0;
}
public Row moveUp() {
return moveUp(1);
}
public Row moveUp(final int step) {
if (canMoveUp(step)) {
return values()[ordinal() - step];
}
throw new IllegalStateException("움직일 수 없는 위치입니다.");
}
public boolean canMoveDown(final int step) {
return ordinal() + step < values().length;
}
public Row moveDown() {
return moveDown(1);
}
public Row moveDown(final int step) {
if (canMoveDown(step)) {
return values()[ordinal() + step];
}
throw new IllegalStateException("움직일 수 없는 위치입니다.");
}
}