-
Notifications
You must be signed in to change notification settings - Fork 0
/
intervaltree_test.go
323 lines (255 loc) · 10.4 KB
/
intervaltree_test.go
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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
package intervaltree
import "testing"
import "time"
func TestTreeCreation(t *testing.T) {
var tree *IntervalTree = NewIntervalTree()
if tree == nil {
t.Error("NewIntervalTree should return a non-null pointer to a tree.")
}
}
func TestInsertEmptyTree(t *testing.T) {
tree := NewIntervalTree()
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
tree.Insert(interval)
if tree.root == nil || tree.root.i != interval {
t.Error("IntervalTree root should contain interval.")
} else if tree.root.left != nil || tree.root.right != nil {
t.Error("IntervalTree root should be only node in tree.")
} else if tree.root.subTreeMax != end {
t.Error("IntervalTree root has incorrect subTreeMax.")
}
}
func TestInsertLeftOfRoot(t *testing.T) {
// insert an interval to left of root (root only node in tree)
tree := NewIntervalTree()
// root node
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
tree.Insert(interval)
// left node
start2 := time.Date(2016, 10, 1, 0, 0, 0, 0, time.UTC)
end2 := time.Date(2016, 10, 2, 0, 0, 0, 0, time.UTC)
interval2, _ := NewInterval(start2, end2)
tree.Insert(interval2)
testNode := newIntervalTreeNode(interval2)
if tree.root.left == nil || *tree.root.left != *testNode {
t.Error("Node was not inserted correctly.")
}
}
func TestInsertRightOfRoot(t *testing.T) {
// insert an interval to right of root (root only node in tree)
tree := NewIntervalTree()
// root node
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
tree.Insert(interval)
// left node
start2 := time.Date(2018, 10, 1, 0, 0, 0, 0, time.UTC)
end2 := time.Date(2018, 10, 2, 0, 0, 0, 0, time.UTC)
interval2, _ := NewInterval(start2, end2)
tree.Insert(interval2)
testNode := newIntervalTreeNode(interval2)
if tree.root.right == nil || *tree.root.right != *testNode {
t.Error("Node was not inserted correctly.")
}
}
func TestInsertOverlappingRootStart(t *testing.T) {
// insert an interval that overlaps start of root (root only node in tree)
// should be inserted to the right (based on insertion algorithm)
tree := NewIntervalTree()
// root node
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
tree.Insert(interval)
// left node
start2 := time.Date(2017, 9, 1, 0, 0, 0, 0, time.UTC)
end2 := time.Date(2017, 10, 1, 2, 0, 0, 0, time.UTC)
interval2, _ := NewInterval(start2, end2)
tree.Insert(interval2)
testNode := newIntervalTreeNode(interval2)
if tree.root.right == nil || *tree.root.right != *testNode {
t.Error("Node was not inserted correctly.")
}
}
func TestInsertOverlappingRootEnd(t *testing.T) {
// insert an interval that overlaps end of root (root only node in tree)
// should be inserted to the right (based on insertion algorithm)
tree := NewIntervalTree()
// root node
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
tree.Insert(interval)
// left node
start2 := time.Date(2017, 10, 1, 2, 0, 0, 0, time.UTC)
end2 := time.Date(2017, 10, 3, 0, 0, 0, 0, time.UTC)
interval2, _ := NewInterval(start2, end2)
tree.Insert(interval2)
testNode := newIntervalTreeNode(interval2)
if tree.root.right == nil || *tree.root.right != *testNode {
t.Error("Node was not inserted correctly.")
}
}
func TestInsertWithinRoot(t *testing.T) {
// insert an interval that is encapsulated by root (root only node in tree)
// should be inserted to the right (based on insertion algorithm)
tree := NewIntervalTree()
// root node
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
tree.Insert(interval)
// left node
start2 := time.Date(2017, 10, 1, 2, 0, 0, 0, time.UTC)
end2 := time.Date(2017, 10, 1, 4, 0, 0, 0, time.UTC)
interval2, _ := NewInterval(start2, end2)
tree.Insert(interval2)
testNode := newIntervalTreeNode(interval2)
if tree.root.right == nil || *tree.root.right != *testNode {
t.Error("Node was not inserted correctly.")
}
}
func TestInsertEncapsulatingRoot(t *testing.T) {
// insert an interval that encapsulates root (root only node in tree)
// should be inserted to the right (based on insertion algorithm)
tree := NewIntervalTree()
// root node
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
tree.Insert(interval)
// left node
start2 := time.Date(2016, 10, 1, 2, 0, 0, 0, time.UTC)
end2 := time.Date(2018, 10, 1, 4, 0, 0, 0, time.UTC)
interval2, _ := NewInterval(start2, end2)
tree.Insert(interval2)
testNode := newIntervalTreeNode(interval2)
if tree.root.right == nil || *tree.root.right != *testNode {
t.Error("Node was not inserted correctly.")
}
}
func TestOverlapsEmptyTree(t *testing.T) {
tree := NewIntervalTree()
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
if tree.Overlaps(interval) {
t.Error("Tree should not detect overlap when empty.")
}
}
func TestOverlapsPopulatedTree(t *testing.T) {
tree := NewIntervalTree()
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
start2 := time.Date(2017, 10, 3, 0, 0, 0, 0, time.UTC)
end2 := time.Date(2017, 10, 4, 0, 0, 0, 0, time.UTC)
interval2, _ := NewInterval(start2, end2)
start3 := time.Date(2015, 10, 1, 0, 0, 0, 0, time.UTC)
end3 := time.Date(2017, 4, 2, 0, 0, 0, 0, time.UTC)
interval3, _ := NewInterval(start3, end3)
start4 := time.Date(2016, 10, 1, 0, 0, 0, 0, time.UTC)
end4 := time.Date(2016, 10, 30, 0, 0, 0, 0, time.UTC)
interval4, _ := NewInterval(start4, end4)
tree.Insert(interval)
tree.Insert(interval2)
tree.Insert(interval3)
tree.Insert(interval4)
// overlaps nothing
start5 := time.Date(2017, 4, 10, 0, 0, 0, 0, time.UTC)
end5 := time.Date(2017, 4, 11, 0, 0, 0, 0, time.UTC)
testInterval1, _ := NewInterval(start5, end5)
// overlaps all intervals
start6 := time.Date(2014, 10, 1, 0, 0, 0, 0, time.UTC)
end6 := time.Date(2019, 10, 2, 0, 0, 0, 0, time.UTC)
testInterval2, _ := NewInterval(start6, end6)
if tree.Overlaps(testInterval1) {
t.Error("Tree should not detect overlap with testInterval1.")
}
if !tree.Overlaps(testInterval2) {
t.Error("Tree should detect overlap with testInterval2.")
}
}
func TestFindOverlapEmptyTree(t *testing.T) {
tree := NewIntervalTree()
interval, _ := NewInterval(
time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC),
time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC),
)
overlaps := tree.FindOverlap(interval)
if len(overlaps) != 0 {
t.Error("Tree found a phantom overlapping interval.")
}
}
func TestFindOverlapNothingReturned(t *testing.T) {
tree := NewIntervalTree()
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
start2 := time.Date(2017, 10, 3, 0, 0, 0, 0, time.UTC)
end2 := time.Date(2017, 10, 4, 0, 0, 0, 0, time.UTC)
interval2, _ := NewInterval(start2, end2)
start3 := time.Date(2015, 10, 1, 0, 0, 0, 0, time.UTC)
end3 := time.Date(2017, 4, 2, 0, 0, 0, 0, time.UTC)
interval3, _ := NewInterval(start3, end3)
start4 := time.Date(2016, 10, 1, 0, 0, 0, 0, time.UTC)
end4 := time.Date(2016, 10, 30, 0, 0, 0, 0, time.UTC)
interval4, _ := NewInterval(start4, end4)
tree.Insert(interval)
tree.Insert(interval2)
tree.Insert(interval3)
tree.Insert(interval4)
start5 := time.Date(2017, 4, 10, 0, 0, 0, 0, time.UTC)
end5 := time.Date(2017, 4, 11, 0, 0, 0, 0, time.UTC)
testInterval1, _ := NewInterval(start5, end5)
overlaps := tree.FindOverlap(testInterval1)
if len(overlaps) != 0 {
t.Error("Tree found phantom overlapping interval(s) with testInterval1.")
}
}
func TestFindOverlapMultipleReturned(t *testing.T) {
tree := NewIntervalTree()
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
start2 := time.Date(2017, 10, 3, 0, 0, 0, 0, time.UTC)
end2 := time.Date(2017, 10, 4, 0, 0, 0, 0, time.UTC)
interval2, _ := NewInterval(start2, end2)
start3 := time.Date(2015, 10, 1, 0, 0, 0, 0, time.UTC)
end3 := time.Date(2017, 4, 2, 0, 0, 0, 0, time.UTC)
interval3, _ := NewInterval(start3, end3)
start4 := time.Date(2016, 10, 1, 0, 0, 0, 0, time.UTC)
end4 := time.Date(2016, 10, 30, 0, 0, 0, 0, time.UTC)
interval4, _ := NewInterval(start4, end4)
tree.Insert(interval)
tree.Insert(interval2)
tree.Insert(interval3)
tree.Insert(interval4)
start5 := time.Date(2014, 4, 10, 0, 0, 0, 0, time.UTC)
end5 := time.Date(2018, 4, 11, 0, 0, 0, 0, time.UTC)
testInterval1, _ := NewInterval(start5, end5)
overlaps := tree.FindOverlap(testInterval1)
numOverlaps := len(overlaps)
expectedNumOverlaps := 4
if numOverlaps != expectedNumOverlaps {
t.Error("Tree did not find correct overlaps. Expected", expectedNumOverlaps, "found", numOverlaps, "instead.")
}
}
func TestTreeEmpty(t *testing.T) {
tree := NewIntervalTree()
if tree.Empty() == false {
t.Error("NewIntervalTree should return an empty tree.")
}
start := time.Date(2017, 10, 1, 0, 0, 0, 0, time.UTC)
end := time.Date(2017, 10, 2, 0, 0, 0, 0, time.UTC)
interval, _ := NewInterval(start, end)
tree.Insert(interval)
if tree.Empty() == true {
t.Error("IntervalTree should not be empty after insertion.")
}
}