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
|
import static org.junit.jupiter.api.Assertions.*;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import org.junit.jupiter.api.Test;
class CoveringSegmentsTest {
@Test
void testSegment() {
CoveringSegments.Segment s = new CoveringSegments.Segment(1, 2);
assertEquals(s.start, 1);
}
@Test
void testSegmentArray() {
CoveringSegments.Segment[] s = new CoveringSegments.Segment[2];
s[0] = new CoveringSegments.Segment(3, 4);
s[1] = new CoveringSegments.Segment(1, 2);
Arrays.sort(s);
assertEquals(1, s[0].start);
}
@Test
void testSegmentArrayRemoveDups() {
CoveringSegments.Segment[] s = new CoveringSegments.Segment[3];
s[0] = new CoveringSegments.Segment(3, 4);
s[1] = new CoveringSegments.Segment(1, 2);
s[2] = new CoveringSegments.Segment(1, 2);
Arrays.sort(s);
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>(Arrays.asList(s));
assertEquals(2, set.size());
}
@Test
void testGetOptimalPoints() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 3));
set.add(new CoveringSegments.Segment(2, 5));
set.add(new CoveringSegments.Segment(3, 6));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
int[] results = CoveringSegments.getOptimalPoints(s);
assertEquals(3, results[0]);
}
@Test
void testGetOptimalPoints1() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(4, 7));
set.add(new CoveringSegments.Segment(1, 3));
set.add(new CoveringSegments.Segment(2, 5));
set.add(new CoveringSegments.Segment(5, 6));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(2, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints2() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 1));
set.add(new CoveringSegments.Segment(1, 1));
set.add(new CoveringSegments.Segment(1, 1));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(1, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints3() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 1));
set.add(new CoveringSegments.Segment(1, 2));
set.add(new CoveringSegments.Segment(1, 1));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(1, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints4() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(5, 6));
set.add(new CoveringSegments.Segment(3, 4));
set.add(new CoveringSegments.Segment(1, 2));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(3, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints5() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 1));
set.add(new CoveringSegments.Segment(2, 2));
set.add(new CoveringSegments.Segment(1, 1));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(2, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints6() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 5));
set.add(new CoveringSegments.Segment(2, 2));
set.add(new CoveringSegments.Segment(1, 1));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(2, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints7() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 5));
set.add(new CoveringSegments.Segment(2, 4));
set.add(new CoveringSegments.Segment(1, 3));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(1, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints8() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 4));
set.add(new CoveringSegments.Segment(2, 4));
set.add(new CoveringSegments.Segment(1, 3));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(1, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints9() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 7));
set.add(new CoveringSegments.Segment(1, 6));
set.add(new CoveringSegments.Segment(1, 3));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(1, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints10() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 7));
set.add(new CoveringSegments.Segment(1, 6));
set.add(new CoveringSegments.Segment(1, 3));
set.add(new CoveringSegments.Segment(7, 7));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(2, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints11() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 2));
set.add(new CoveringSegments.Segment(3, 4));
set.add(new CoveringSegments.Segment(6, 12));
set.add(new CoveringSegments.Segment(7, 8));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(3, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints12() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 15));
set.add(new CoveringSegments.Segment(2, 14));
set.add(new CoveringSegments.Segment(6, 12));
set.add(new CoveringSegments.Segment(7, 8));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(1, CoveringSegments.getOptimalPoints(s).length);
}
@Test
void testGetOptimalPoints13() {
Set<CoveringSegments.Segment> set = new HashSet<CoveringSegments.Segment>();
set.add(new CoveringSegments.Segment(1, 15));
set.add(new CoveringSegments.Segment(2, 3));
set.add(new CoveringSegments.Segment(4, 8));
CoveringSegments.Segment[] s = set.stream().toArray(CoveringSegments.Segment[]::new);
Arrays.sort(s);
assertEquals(2, CoveringSegments.getOptimalPoints(s).length);
}
}
|
