-
Notifications
You must be signed in to change notification settings - Fork 2
/
TimeRanges.py
323 lines (265 loc) · 10.6 KB
/
TimeRanges.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
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
# -------------------------------------------------------------------------------
# Name: TimeRanges.py
# Purpose: Manipulate and modify lists of datetime ranges
# Author: Alexander Kim
# -------------------------------------------------------------------------------
import calendar
from datetime import datetime as dt
from datetime import timedelta as td
def to_dt(u):
return dt.utcfromtimestamp(u)
def to_ut(d):
return calendar.timegm(d.timetuple())
def validate_item(dt_range):
if type(dt_range) is not list and type(dt_range) is not tuple:
raise TypeError("{} is not a list or a tuple".format(dt_range))
if len(dt_range) != 2:
raise ValueError(
"{} contains {} element(s). Exactly two elements are expected.".format(dt_range, len(dt_range)))
if type(dt_range[0]) is not dt or type(dt_range[1]) is not dt:
raise TypeError("One of the elements in {} is not of datetime type".format(dt_range))
if dt_range[1] < dt_range[0]:
raise ValueError("End of the datetime range: {} is before its start: {}".format(dt_range[1], dt_range[0]))
class TimeRanges(list):
def __init__(self, dt_ranges):
for dt_range in dt_ranges:
validate_item(dt_range)
list.__init__(self, [tuple(dt_range) for dt_range in dt_ranges])
def append(self, new_member):
validate_item(new_member)
super(TimeRanges, self).append(tuple(new_member))
def remove(self, member):
super(TimeRanges, self).remove(tuple(member))
def __str__(self):
if len(self) == 0:
return "[]"
lst = ["[{}, {}]".format(dt_range[0].strftime("%Y-%m-%d %H:%M:%S"), dt_range[1].strftime("%Y-%m-%d %H:%M:%S"))
for dt_range in self]
result = "\n".join(lst)
return "{}\n".format(result)
def __add__(self, rhs):
return TimeRanges(list.__add__(self, rhs))
def __sub__(self, rhs):
if type(rhs) is not TimeRanges:
rhs = TimeRanges(rhs)
class IntervalTree:
def __init__(self, h, left, right):
self.h = h
self.left = left
self.right = right
def merged(A, B, op, l=-float("inf"), u=float("inf")):
if l > u:
return None
if not isinstance(A, IntervalTree):
if isinstance(B, IntervalTree):
opT = op
A, B, op = B, A, (lambda x, y: opT(y, x))
else:
return op(A, B)
left = merged(A.left, B, op, l, min(A.h, u))
right = merged(A.right, B, op, max(A.h, l), u)
if left is None:
return right
elif right is None or left == right:
return left
return IntervalTree(A.h, left, right)
def to_range_list(T, l=-float("inf"), u=float("inf")):
if isinstance(T, IntervalTree):
return to_range_list(T.left, l, T.h) + to_range_list(T.right, T.h, u)
return [(l, u - 1)] if T else []
def range_list_to_tree(L):
return reduce(lambda x, y: merged(x, y, lambda a, b: a or b),
[IntervalTree(R[0], False, IntervalTree(R[1] + 1, True, False)) for R in L])
lst1 = []
for dt_range in self:
lst1.append([to_ut(dt_range[0]), to_ut(dt_range[1])])
lst2 = []
for dt_range in rhs:
lst2.append([to_ut(dt_range[0]), to_ut(dt_range[1])])
r1 = range_list_to_tree(lst1)
r2 = range_list_to_tree(lst2)
diff = merged(r1, r2, lambda a, b: a and not b)
result = to_range_list(diff)
new_ranges = []
for item in result:
if to_dt(item[1]) > to_dt(item[0]):
new_ranges.append([to_dt(item[0]), to_dt(item[1])])
return TimeRanges(new_ranges)
def __contains__(self, new_dt_range):
validate_item(new_dt_range)
for dt_range in self:
start = dt_range[0]
end = dt_range[1]
if start <= new_dt_range[0] <= end and start <= new_dt_range[1] <= end:
return True
return False
def sort_by(self, start_or_end):
if start_or_end == "start":
indx = 0
elif start_or_end == "end":
indx = 1
else:
raise ValueError('Should be either "start" or "end"')
self.sort(key=lambda x: x[indx])
def merge(self):
# Merge overlapping time ranges
i = sorted(set([tuple(sorted(x)) for x in self]))
if len(i) > 0:
merged_ranges = [i[0]]
for c, d in i[1:]:
a, b = merged_ranges[-1]
if c <= b < d:
merged_ranges[-1] = a, d
elif b < c < d:
merged_ranges.append((c, d))
else:
pass
self.__init__(merged_ranges)
def merge_min_separation(self, years=None, months=None, days=None, hours=None, minutes=None, seconds=None):
# Merge time ranges if space between them is less a given number years, months, days, etc
dct = locals()
keywords = {}
for key in dct:
if key != 'self' and dct[key]:
keywords[key] = dct[key]
delta = td(**keywords)
new_ranges = []
self.sort(key=lambda dt_range: dt_range[0])
for i, dt_range in enumerate(self):
start = dt_range[0]
end = dt_range[1]
if i != len(self) - 1: # not last range
next_start = self[i + 1][0]
new_end = end + delta
if new_end > next_start:
end = new_end if new_end < self[i + 1][1] else self[i + 1][1]
new_ranges.append([start, end])
self.__init__(new_ranges)
self.merge()
def get_starts(self):
# get start times of all times ranges
return [dt_range[0] for dt_range in self]
def get_ends(self):
# get end times of all times ranges
return [dt_range[1] for dt_range in self]
def get_centers(self):
# get midpoints of all times ranges
return [(start + td(seconds=(end - start).total_seconds() / 2.0)) for start, end in self]
def shift_starts(self, years=None, months=None, days=None, hours=None, minutes=None, seconds=None):
dct = locals()
keywords = {}
for key in dct:
if key != 'self' and dct[key]:
keywords[key] = dct[key]
delta = td(**keywords)
new_ranges = []
for dt_range in self:
start_tm = dt_range[0]
end_tm = dt_range[1]
shifted_start = start_tm + delta
new_ranges.append([shifted_start, end_tm])
self.__init__(new_ranges)
def shift_ends(self, years=None, months=None, days=None, hours=None, minutes=None, seconds=None):
dct = locals()
keywords = {}
for key in dct:
if key != 'self' and dct[key]:
keywords[key] = dct[key]
delta = td(**keywords)
new_ranges = []
for dt_range in self:
start_tm = dt_range[0]
end_tm = dt_range[1]
shifted_end = end_tm + delta
new_ranges.append([start_tm, shifted_end])
self.__init__(new_ranges)
def shift(self, years=None, months=None, days=None, hours=None, minutes=None, seconds=None):
dct = locals()
keywords = {}
for key in dct:
if key != 'self' and dct[key]:
keywords[key] = dct[key]
try:
self.shift_starts(**keywords)
self.shift_ends(**keywords)
except ValueError:
self.shift_ends(**keywords)
self.shift_starts(**keywords)
def extend(self, years=None, months=None, days=None, hours=None, minutes=None, seconds=None):
dct = locals()
keywords = {}
keywords2 = {}
for key in dct:
if key != 'self' and dct[key]:
keywords[key] = dct[key]
for key in keywords:
keywords2[key] = -1 * keywords[key]
try:
self.shift_starts(**keywords2)
self.shift_ends(**keywords)
except ValueError:
self.shift_ends(**keywords2)
self.shift_starts(**keywords)
def contains_shorter_than(self, years=None, months=None, days=None, hours=None, minutes=None, seconds=None):
dct = locals()
keywords = {}
for key in dct:
if key != 'self' and dct[key]:
keywords[key] = dct[key]
delta = td(**keywords)
for dt_range in self:
duration = dt_range[1] - dt_range[0]
if duration < delta:
return True
return False
def remove_if_shorter(self, years=None, months=None, days=None, hours=None, minutes=None, seconds=None):
dct = locals()
keywords = {}
for key in dct:
if key != 'self' and dct[key]:
keywords[key] = dct[key]
delta = td(**keywords)
new_ranges = []
for dt_range in self:
duration = dt_range[1] - dt_range[0]
if duration >= delta:
new_ranges.append(dt_range)
self.__init__(new_ranges)
def get_boundary(self):
start_times = self.get_starts()
end_times = self.get_ends()
left_boundary = min(start_times)
right_boundary = max(end_times)
return [left_boundary, right_boundary]
def reversed(self):
return (TimeRanges([self.get_boundary()]) - self)
def get_durations_sec(self):
durations = []
for dt_range in self:
duration = (dt_range[1] - dt_range[0]).total_seconds()
durations.append(duration)
return durations
def divide(self, years=None, months=None, days=None, hours=None, minutes=None, seconds=None):
dct = locals()
keywords = {}
for key in dct:
if key != 'self' and dct[key]:
keywords[key] = dct[key]
delta = td(**keywords)
new_ranges = []
for dt_range in self:
start = dt_range[0]
end = dt_range[1]
start2 = start
end2 = start2 + delta
if end2 < end:
while end2 < end:
old_start2 = start2
old_end2 = end2
new_ranges.append([old_start2, old_end2])
start2 = old_end2 + td(seconds=1)
end2 = start2 + delta
new_ranges.append([old_end2 + td(seconds=1), end])
else:
new_ranges.append([start, end])
self.__init__(new_ranges)