-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRangeList.cs
More file actions
215 lines (165 loc) · 6.2 KB
/
RangeList.cs
File metadata and controls
215 lines (165 loc) · 6.2 KB
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
/*
RangeList - written by Ingo Karstein
(C) 2025 MIT License
Here are ranges... They have start, end and value
e.g.
4-21, value "A"
28-42, value "B"
They are added over time to the "RangeList" object. If they intersect, the newer range overwrites parts of the older ranges. Overridden ranges are removed. Partially overridden ranges are split into two ranges, one with the new value and one with the old value.
`var l = new RangeList<int, string>();`
First Insert:
```
l.Add(4, 21, "A");
l.Add(28, 42, "B");
l.Add(72, 85, "I");
```
111111111122222222223333333333444444444455555555556666666666777777777788888888889
123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890
|------A---------| |------B------| |-----I------|
Second Insert:
```
l.Add(7, 13, "C");
l.Add(18, 29, "D");
l.Add(38, 51, "E");
l.Add(54, 66, "F");
```
111111111122222222223333333333444444444455555555556666666666777777777788888888889
123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890
|--C--| |----D------| |-E----------| |--F--------|
Third Insert:
```
l.Add(1, 24, "G");
l.Add(36, 69, "H");
```
111111111122222222223333333333444444444455555555556666666666777777777788888888889
123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890
|-----------G----------| |---------H----------------------|
Result:
|-----------G----------||-D--||-B-||---------H----------------------| |-----I------|
Method "Output()" shows:
[(1,24),G][(25,30),D][(31,35),B][(36,69),H][(72,85),I]
If you add another range:
```
l.Add(7, 13, "K");
```
111111111122222222223333333333444444444455555555556666666666777777777788888888889
123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890
|--K--|
Result:
|--G-||--K--||--G------||-D--||-B-||---------H----------------------| |-----I------|
`Output()` shows:
[(1,6),G][(7,13),K][(14,24),G][(25,30),D][(31,35),B][(36,69),H][(72,85),I]
*/
using System.Numerics;
using System.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
public class RangeListKey<T> : IComparable<RangeListKey<T>>
where T : notnull, IComparable<T>
{
public T Start { get; set; }
public T End { get; set; }
public int CompareTo(RangeListKey<T> other)
{
if (other == null)
return 1;
var c1 = Start.CompareTo(other.Start);
if (c1 < 0)
return -1;
if (c1 > 0)
return 1;
var c2 = End.CompareTo(other.End);
if (c2 < 0)
return -1;
if (c2 > 0)
return 1;
return 0;
}
}
public class RangeList<T, V> : IEnumerable<KeyValuePair<RangeListKey<T>, V>>
where T : IComparable<T>, IIncrementOperators<T>, IAdditionOperators<T, int, T>, ISubtractionOperators<T, int, T>
{
private SortedDictionary<RangeListKey<T>?, V> data = new();
public void Add(T start, T end, V value)
{
var datakeys = data.Keys.ToList();
// start fits in range
var startfits = datakeys.Where(k => k.Start.CompareTo(start) < 0 && k.End.CompareTo(start) >= 0).ToList();
var endfits = datakeys.Where(k => k.End.CompareTo(end) > 0 && k.Start.CompareTo(end) <= 0).ToList();
var remove = datakeys.Where(t => t.Start.CompareTo(start) >= 0 && t.End.CompareTo(end) <= 0).Distinct().ToList();
remove.ForEach(t => data.Remove(t));
var remove2 = new List<RangeListKey<T>>();
startfits.ForEach(startfit =>
{
if (startfit.Start.CompareTo(start) < 0)
{
var newSegBefore = new RangeListKey<T> { Start = startfit.Start, End = start - 1 };
data.Add(newSegBefore, data[startfit]);
}
remove2.Add(startfit);
});
endfits.ForEach(endfit =>
{
if (endfit.End.CompareTo(end) > 0)
{
var newSegAfter = new RangeListKey<T> { Start = end + 1, End = endfit.End };
data.Add(newSegAfter, data[endfit]);
}
remove2.Add(endfit);
});
data.Add(new RangeListKey<T> { Start = start, End = end }, value);
remove2.Distinct().ToList().ForEach(t => data.Remove(t));
}
public void Remove(T start, T end)
{
var datakeys = data.Keys.ToList();
// start fits in range
var startfits = datakeys.Where(k => k.Start.CompareTo(start) < 0 && k.End.CompareTo(start) >= 0).ToList();
var endfits = datakeys.Where(k => k.End.CompareTo(end) > 0 && k.Start.CompareTo(end) <= 0).ToList();
var remove = datakeys.Where(t => t.Start.CompareTo(start) > 0 && t.End.CompareTo(end) < 0).Distinct().ToList();
remove.ForEach(t => data.Remove(t));
var remove2 = new List<RangeListKey<T>>();
startfits.ForEach(startfit =>
{
if (startfit.Start.CompareTo(start) < 0)
{
var newSegBefore = new RangeListKey<T> { Start = startfit.Start, End = start - 1 };
data.Add(newSegBefore, data[startfit]);
}
remove2.Add(startfit);
});
endfits.ForEach(endfit =>
{
if (endfit.End.CompareTo(end) > 0)
{
var newSegAfter = new RangeListKey<T> { Start = end + 1, End = endfit.End };
data.Add(newSegAfter, data[endfit]);
}
remove2.Add(endfit);
});
remove2.Distinct().ToList().ForEach(t => data.Remove(t));
}
public string Output()
{
var sb = new StringBuilder();
foreach (var key in data.Keys)
{
var item = data[key];
sb.Append($"[({key.Start},{key.End}),{item}]");
}
return sb.ToString();
}
IEnumerator IEnumerable.GetEnumerator()
{
return data.GetEnumerator();
}
public IEnumerator<KeyValuePair<RangeListKey<T>, V>> GetEnumerator()
{
return data.GetEnumerator();
}
internal void Remove(RangeListKey<T> t)
{
Remove(t.Start, t.End);
}
}