-
Notifications
You must be signed in to change notification settings - Fork 33
/
Copy pathLine.java
99 lines (72 loc) · 2.54 KB
/
Line.java
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
package model;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import static model.LinkStatus.PRESENT;
import static model.LinkStatus.UNDEFINED;
public class Line {
private static final Random random = new Random();
private final List<Link> links;
public Line(int width) {
int size = width - 1;
List<Link> links = initializeLinks(size);
setupLinks(links);
this.links = List.copyOf(links);
}
public List<Link> getLinks() {
return List.copyOf(links);
}
private List<Link> initializeLinks(int size) {
List<Link> links = new ArrayList<>();
for (int i = 0; i < size; i++) {
links.add(Link.getUndefinedLink());
}
return List.copyOf(links);
}
private void setupLinks(List<Link> links) {
int index = getRandomStartIndex(links);
while (containsUndefined(links)) {
boolean connectDecider = getConnectDecider();
boolean connectable = isConnectable(index, links);
Link link = links.get(index);
link.setLinkStatus(connectDecider, connectable);
index = getNextIndex(index, links);
}
}
private int getRandomStartIndex(List<Link> links) {
return random.nextInt(links.size());
}
private boolean containsUndefined(List<Link> links) {
return links.stream()
.anyMatch(link -> link.getLinkstatus() == UNDEFINED);
}
private boolean getConnectDecider() {
return random.nextBoolean();
}
private boolean isConnectable(int index, List<Link> links) {
if (isFirstIndex(index)) {
return isRightNotPresent(index, links);
}
if (isLastIndex(index, links)) {
return isLeftNotPresent(index, links);
}
return isRightNotPresent(index, links) && isLeftNotPresent(index, links);
}
private boolean isFirstIndex(int index) {
return index == 0;
}
private boolean isLastIndex(int index, List<Link> links) {
return index == links.size() - 1;
}
private boolean isRightNotPresent(int index, List<Link> links) {
Link rightLink = links.get(index + 1);
return rightLink.getLinkstatus() != PRESENT;
}
private boolean isLeftNotPresent(int index, List<Link> links) {
Link leftLink = links.get(index - 1);
return leftLink.getLinkstatus() != PRESENT;
}
private int getNextIndex(int index, List<Link> linkStatuses) {
return ++index % linkStatuses.size();
}
}