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
|
/*
* Copyright (c) 2008, Alexandros Frantzis (alf82 [at] freemail [dot] gr)
*
* This file is part of Bless.
*
* Bless is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Bless is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Bless; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
using System;
using System.Collections.Generic;
using NUnit.Framework;
using Bless.Util;
using Range = Bless.Util.Range;
namespace BlessTests.Util
{
[TestFixture()]
public class IntervalTreeTests
{
[Test()]
public void ITInsertTest()
{
IntervalTree<Range> t = new IntervalTree<Range>();
t.Insert(new Range(5,55));
IList<Range> result = t.SearchOverlap(new Range(0, 4));
Assert.AreEqual(0, result.Count, "#1");
result = t.SearchOverlap(new Range(4, 13));
Assert.AreEqual(1, result.Count, "#2");
Assert.AreEqual(55, result[0].End, "#2.1");
result = t.SearchOverlap(new Range(57, 68));
Assert.AreEqual(0, result.Count, "#3");
result = t.SearchOverlap(new Range(3,100));
Assert.AreEqual(1, result.Count, "#4");
Assert.AreEqual(55, result[0].End, "#2.1");
}
[Test()]
public void ITSearchTest()
{
IntervalTree<Range> t = new IntervalTree<Range>();
for (int i = 0; i < 1000; i += 4) {
t.Insert(new Range(i, i + 2));
}
for (int i = 0 ; i < 1000; i += 8) {
IList<Range> result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(2, result.Count, "#1."+i.ToString());
}
for (int i = 2 ; i < 1000; i += 4) {
IList<Range> result = t.SearchOverlap(new Range(i+1, i + 1));
Assert.AreEqual(0, result.Count, "#2."+i.ToString());
}
{
IList<Range> result = t.SearchOverlap(new Range(0, 1050));
Assert.AreEqual(250, result.Count, "#3");
}
}
[Test()]
public void ITDuplicateTest()
{
IntervalTree<Range> t = new IntervalTree<Range>();
for (int i = 0; i < 1000; i += 1) {
t.Insert(new Range(0, i));
}
for (int i = 0 ; i <= 1000; i++) {
IList<Range> result = t.SearchOverlap(new Range(i, i));
Assert.AreEqual(1000 - i, result.Count, "#1."+i.ToString());
}
}
[Test()]
public void ITDeleteTest()
{
IntervalTree<Range> t = new IntervalTree<Range>();
for (int i = 0; i < 1000; i += 4) {
t.Insert(new Range(i, i + 2));
}
for (int i = 0 ; i < 1000; i += 8) {
IList<Range> result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(2, result.Count, "#1."+i.ToString());
t.Delete(new Range(i, i+2));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(1, result.Count, "#2."+i.ToString());
t.Delete(new Range(i+2, i+4));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(1, result.Count, "#3."+i.ToString());
t.Delete(new Range(i+4, i+6));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(0, result.Count, "#4."+i.ToString());
t.Delete(new Range(i+6, i+8));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(0, result.Count, "#5."+i.ToString());
}
}
[Test()]
public void ITDeleteDuplicateTest()
{
IntervalTree<Range> t = new IntervalTree<Range>();
for (int i = 0; i < 1000; i += 4) {
t.Insert(new Range(i, i + 3));
t.Insert(new Range(i, i + 3));
t.Insert(new Range(i, i + 3));
}
for (int i = 0; i < 1000; i += 8) {
IList<Range> result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(6, result.Count, "#5."+i.ToString());
t.Delete(new Range(i, i+3));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(5, result.Count, "#5."+i.ToString());
t.Delete(new Range(i, i+3));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(4, result.Count, "#5."+i.ToString());
t.Delete(new Range(i, i+3));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(3, result.Count, "#5."+i.ToString());
t.Delete(new Range(i, i+3));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(3, result.Count, "#5."+i.ToString());
t.Delete(new Range(i+4, i+7));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(2, result.Count, "#5."+i.ToString());
t.Delete(new Range(i+4, i+7));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(1, result.Count, "#5."+i.ToString());
t.Delete(new Range(i+4, i+7));
result = t.SearchOverlap(new Range(i, i + 7));
Assert.AreEqual(0, result.Count, "#5."+i.ToString());
}
}
}
}
|
