forked from Firkraag/algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
interval_tree_test.py
executable file
·177 lines (171 loc) · 7.16 KB
/
interval_tree_test.py
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
#!/usr/bin/env ipython
import unittest
from interval_tree import interval, interval_tree, interval_node
class TestIntervalTree(unittest.TestCase):
def test_insert_one(self):
intervals = []
values = [16, 21, 8, 9, 25, 30, 5, 8, 15, 23, 17, 19, 26, 26, 0, 3, 6, 10, 19, 20]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
values = [16, 30, 8, 23, 25, 30, 5, 10, 15, 23, 17, 20, 26, 26, 0, 3, 6, 10, 19, 20]
for i in range(0, len(values), 2):
self.wrap(T, values[i], values[i + 1])
values = [41, 41, 38, 42, 31, 35, 12, 45, 19, 23, 9, 21]
intervals = []
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
values = [38, 45, 19, 45, 41, 41, 12, 45, 31, 35, 9, 21]
for i in range(0, len(values), 2):
self.wrap(T, values[i], values[i + 1])
def test_delete_one(self):
intervals = []
values = [41, 41, 38, 42, 31, 35, 12, 45, 19, 23, 9, 21]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
T.delete(T.iterative_tree_search(9))
values = [38, 45, 19, 45, 41, 41, 12, 45, 31, 35]
for i in range(0, len(values), 2):
self.wrap(T, values[i], values[i + 1])
def test_delete_two(self):
intervals = []
values = [41, 41, 38, 42, 31, 35, 12, 45, 19, 23, 9, 21]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
T.delete(T.iterative_tree_search(9))
T.delete(T.iterative_tree_search(12))
values = [38, 42, 19, 35, 41, 41, 31, 35]
for i in range(0, len(values), 2):
self.wrap(T, values[i], values[i + 1])
def test_delete_three(self):
intervals = []
values = [41, 41, 38, 42, 31, 35, 12, 45, 19, 23, 9, 21]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
T.delete(T.iterative_tree_search(9))
T.delete(T.iterative_tree_search(12))
T.delete(T.iterative_tree_search(19))
values = [38, 42, 31, 35, 41, 41]
for i in range(0, len(values), 2):
self.wrap(T, values[i], values[i + 1])
def test_delete_four(self):
intervals = []
values = [41, 41, 38, 42, 31, 35, 12, 45, 19, 23, 9, 21]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
T.delete(T.iterative_tree_search(9))
T.delete(T.iterative_tree_search(12))
T.delete(T.iterative_tree_search(19))
T.delete(T.iterative_tree_search(31))
values = [38, 42, 41, 41]
for i in range(0, len(values), 2):
self.wrap(T, values[i], values[i + 1])
def test_delete_five(self):
intervals = []
values = [41, 41, 38, 42, 31, 35, 12, 45, 19, 23, 9, 21]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
T.delete(T.iterative_tree_search(9))
T.delete(T.iterative_tree_search(12))
T.delete(T.iterative_tree_search(19))
T.delete(T.iterative_tree_search(31))
T.delete(T.iterative_tree_search(38))
values = [41, 41]
for i in range(0, len(values), 2):
self.wrap(T, values[i], values[i + 1])
def test_delete_six(self):
intervals = []
values = [41, 41, 38, 42, 31, 35, 12, 45, 19, 23, 9, 21]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
T.delete(T.iterative_tree_search(9))
T.delete(T.iterative_tree_search(12))
T.delete(T.iterative_tree_search(19))
T.delete(T.iterative_tree_search(31))
T.delete(T.iterative_tree_search(38))
T.delete(T.iterative_tree_search(41))
self.assertEquals(T.nil.maximum, float("-Inf"))
def test_interval_search(self):
intervals = []
values = [41, 41, 38, 52, 43, 48]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
i = interval(50, 51)
t = T.closed_interval_search(i)
self.assertEquals(T.root.left, t)
i = interval(58, 60)
t = T.closed_interval_search(i)
self.assertEquals(T.nil, t)
i = interval(38, 48)
t = T.closed_interval_search(i)
self.assertEquals(T.root, t)
def test_interval_search_minimum_low_end(self):
intervals = []
values = [41, 41, 38, 52, 43, 48]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
i = interval(22, 51)
t = T.closed_interval_search_minimum_low_end(i)
self.assertEquals(T.root.left, t)
i = interval(58, 60)
t = T.closed_interval_search_minimum_low_end(i)
self.assertEquals(T.nil, t)
i = interval(38, 48)
t = T.closed_interval_search_minimum_low_end(i)
self.assertEquals(T.root.left, t)
def test_list_all_overlapping_intervals(self):
intervals = []
values = [41, 41, 38, 52, 43, 48]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
i = interval(22, 51)
t = T.list_all_overlapping_intervals(i)
i = interval(58, 60)
t = T.list_all_overlapping_intervals(i)
i = interval(38, 48)
t = T.list_all_overlapping_intervals(i)
i = interval(38, 41)
t = T.list_all_overlapping_intervals(i)
i = interval(42, 42)
t = T.list_all_overlapping_intervals(i)
def test_interval_search_exactly(self):
intervals = []
values = [41, 41, 38, 52, 43, 48]
for i in range(0, len(values), 2):
intervals.append(interval(values[i], values[i + 1]))
T = interval_tree(intervals)
i = interval(22, 51)
t = T.interval_search_exactly(i)
self.assertEquals(t, T.nil)
i = interval(41, 41)
t = T.interval_search_exactly(i)
self.assertEquals(t, T.root)
i = interval(38, 52)
t = T.interval_search_exactly(i)
self.assertEquals(t, T.root.left)
i = interval(43, 48)
t = T.interval_search_exactly(i)
self.assertEquals(t, T.root.right)
i = interval(43, 49)
t = T.interval_search_exactly(i)
self.assertEquals(t, T.nil)
i = interval(20, 50)
t = T.interval_search_exactly(i)
self.assertEquals(t, T.nil)
i = interval(39, 41)
t = T.interval_search_exactly(i)
self.assertEquals(t, T.nil)
def wrap(self, tree, node, maximum):
self.assertEquals(tree.iterative_tree_search(node).maximum, maximum)
if __name__ == '__main__':
unittest.main()