-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathfit_schedules.py
More file actions
358 lines (299 loc) · 12.1 KB
/
fit_schedules.py
File metadata and controls
358 lines (299 loc) · 12.1 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
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
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
def get_start_time(schedules, duration):
def convert_to_decimal(time):
hm = time.split(":")
return int(hm[0]) * 60 + int(hm[1])
def convert_to_time_string(time):
if time == None:
return None
else:
h = int(time) / 60
m = int(time) % 60
if m < 10:
m = "0" + str(m)
if h < 10:
h = "0" + str(h)
return str(h) + ":" + str(m)
def find_free_time(schedule):
i = 0
free = []
if len(schedule) == 0:
return free
if (schedule[i][0] > 540) and (i == 0):
free.append([540, schedule[i][0], (schedule[i][0] - 540)])
while i < len(schedule) - 1:
if (schedule[i][1] != schedule[i+1][0]):
free.append([schedule[i][1], schedule[i+1][0],
(schedule[i+1][0] - schedule[i][1])])
i = i + 1
if schedule[-1][1] < 1140:
free.append([schedule[-1][1], 1140, 1140 - schedule[-1][1]])
return free
def filter_by_duration(schedule):
filtered = []
for slot in schedule:
if slot[2] >= duration:
filtered.append(slot)
return filtered
def filter_by_earliest(schedules, fit):
filtered = []
for schedule in schedules:
new_schedule = []
for slot in schedule:
if slot[1] > fit and fit + duration <= slot[1]:
new_schedule.append(slot)
filtered.append(new_schedule)
return filtered
def check_fit(schedules, fit):
candidates = []
for schedule in schedules:
for slot in schedule:
if fit >= slot[0] and slot[1] > fit and fit + duration <= slot[1]:
candidates.append(slot)
return candidates
def map_schedule(schedule):
converted_schedule = []
for slot in schedule:
slot = [convert_to_decimal(slot[0]),
convert_to_decimal(slot[1])]
converted_schedule.append(slot)
return converted_schedule
# DRAFT #3
def fit_to_schedules(schedules):
if [] in schedules:
return None
fit = 540
found = False
while not (found or [] in schedules):
if [] in schedules:
fit = None
found = True
break
for schedule in schedules:
if schedule[0][0] > fit:
fit = schedule[0][0]
schedules = filter_by_earliest(schedules, fit)
if [] in schedules:
found = True
fit = None
break
else:
candidates = check_fit(schedules, fit)
if len(candidates) >= len(schedules):
found = True
break
else:
candidates = []
return fit
print("Initial schedules: ", schedules)
print("Initial duration: ", duration)
decimal_schedules = map(map_schedule, schedules)
print("Converted schedule to decimals: ", decimal_schedules)
free_times = map(find_free_time, decimal_schedules)
free_times = map(filter_by_duration, free_times)
print("Free times found: ", free_times)
if [] in free_times:
return None
else:
fit = fit_to_schedules(free_times)
print("Found this fit: ", convert_to_time_string(fit), " (for duration " + str(duration) + " min)")
if fit == None:
return None
else:
return convert_to_time_string(fit)
# DRAFT #2
# def fit_to_schedules(schedules):
# if [] in schedules:
# return None
# candidates = []
# fit = 540
# while not(len(candidates) == 3 or [] in schedules):
# candidates[0] = schedules[0][0]
# if candidates[0][0] > fit:
# fit = candidates[0][0]
# print("Current fit: ", fit)
# for i in range(1, len(schedules) - 1):
# to_compare = schedules[i][0]
# if (fit >= to_compare[0]) and (fit + duration <= to_compare[1]):
# fit = to_compare[0]
# print("Current fit: ", fit)
# candidates.append(schedules[i][0])
# elif fit > to_compare[1]:
# schedules[i].remove(to_compare)
# print("Removed ", to_compare, " since fit is GT slot end time")
# elif candidates[0][1] < to_compare[0]:
# schedules[0].remove(candidates[0])
# print("Removed ", candidates[0], " since end time of this slot is LT earliest with others")
# if not(len(schedules[0]) == 0):
# candidates[0] = schedules[0][0]
# else:
# fit = None
# break
# else:
# candidates.append(schedules[i][0])
# if ([] in schedules):
# fit = None
# return fit
#####################################
# DRAFT 1 (WORKING BUT WITH SOME BUGS)
# def fit_to_schedules(schedules):
# while [] not in schedules:
# fit = 540
# for schedule in schedules:
# if len(schedule) > 0 and schedule[0][0] > fit:
# fit = schedule[0][0]
# print("Current fit candidate: ", fit)
# for schedule in schedules:
# if len(schedule) > 0 and fit > schedule[0][1]:
# print("...removing ", schedule[0], " since fit " + str(fit) + " is GT end of free slot")
# schedule.remove(schedule[0])
# for schedule in schedules:
# if len(schedule) > 0 and schedule[0][0] > fit:
# fit = schedule[0][0]
# print("Current fit candidate: ", fit)
# for schedule in schedules:
# mtg_end = fit + duration
# if len(schedule) > 0 and (mtg_end > schedule[0][1]):
# print("...removing ", schedule[0], " since mtg_end " + str(mtg_end) + " is GT end of free slot")
# schedule.remove(schedule[0])
# # if len(schedule) > 0 and schedule[0][0] > fit:
# # fit = schedule[0][0]
#
#
# found = True
# for i in range(0, len(schedules) - 1):
# if len(schedules[i]) == 0:
# fit = None
# elif not ((fit >= schedules[i][0][0]) and (fit + duration <= schedules[i][0][1]) and (fit + duration <= 1140)):
# found = False
# print("This fit doesn't work: ", fit)
# for sched in schedules:
# if len(sched) > 0 and sched[0][0] > fit:
# fit = sched[0][0]
# else:
# found = True
# if found:
# break
# elif [] in schedules:
# fit = None
# break
# else:
# continue
# print("Schedules after fitting...: ", schedules)
# return fit
#############################################
# DRAFT #0
# def fit_to_schedules(schedules):
# while [] not in schedules:
# fit = 540
# for schedule in schedules:
# if len(schedule) > 0 and schedule[0][0] > fit:
# fit = schedule[0][0]
# print("Current fit candidate: ", fit)
# for schedule in schedules:
# if len(schedule) > 0 and fit > schedule[0][1]:
# print("...removing ", schedule[0], " since fit is GT end of slot")
# schedule.remove(schedule[0])
# for schedule in schedules:
# mtg_end = fit + duration
# if len(schedule) > 0 and (mtg_end > schedule[0][1]):
# print("...removing ", schedule[0], " since mtg_end is GT end of slot")
# schedule.remove(schedule[0])
# if len(schedule) > 0 and schedule[0][0] > fit:
# fit = schedule[0][0]
# found = True
# for i in range(0, len(schedules) - 1):
# if len(schedules[i]) == 0:
# found = False
# fit = None
# elif not ((fit >= schedules[i][0][0]) and (fit + duration <= schedules[i][0][1]) and (fit + duration <= 1140)):
# found = False
# print("This fit doesn't work: ", fit)
# print("...removing ", schedules[i][0])
# schedules[i].remove(schedules[i][0])
# fit = None
# else:
# fit = schedules[i][0][0]
# if found:
# break
# elif [] in schedules:
# fit = None
# break
# else:
# continue
# print("Schedules after fitting...: ", schedules)
# return fit
####################################
### OLD STUFF
####################################
# def get_start_time(schedules, duration):
# def convert_to_decimal(time):
# hm = time.split(":")
# return float(hm[0]) + float(hm[1]) / 60.0
# def convert_to_time_string(time):
# h = int(time)
# m = int((time - h) * 60)
# if m < 10:
# m = "0" + str(m)
# if h < 10:
# h = "0" + str(h)
# return str(h) + ":" + str(m)
# def find_free_time(schedule):
# i = 0
# free = []
# while i < len(schedule) - 2:
# if (schedule[i][0] > 9.0) and (i == 0):
# free.append([9.0, schedule[i][0], (schedule[i][0] - 9.0) * 60])
# if (schedule[i][1] != schedule[i+1][0]) and ((schedule[i+1][0] - schedule[i][1]) * 60 >= duration):
# free.append([schedule[i][1], schedule[i+1][0],
# (schedule[i+1][0] - schedule[i][0]) * 60])
# i = i + 1
# return free
# def map_schedule(schedule):
# converted_schedule = []
# for slot in schedule:
# slot = [convert_to_decimal(slot[0]),
# convert_to_decimal(slot[1])]
# converted_schedule.append(slot)
# return converted_schedule
# def fit_to_schedules(schedules):
# while [] not in schedules:
# fit = 0
# for schedule in schedules:
# if schedule[0][0] > fit:
# fit = schedule[0][0]
# for schedule in schedules:
# mtg_end = fit + duration / 60.0
# if (mtg_end > schedule[0][1]):
# schedule.remove(schedule[0])
# if schedule[0][0] > fit:
# fit = schedule[0][0]
# found = True
# for i in range(0, len(schedules) - 1):
# if not ((fit >= schedules[i][0][0]) and (fit + duration / 60.0 <= schedules[i][0][1]) and (fit + duration / 60.0 <= 19.0)):
# found = False
# print("This one doesn't work: ", fit)
# schedules[i].remove(schedules[i][0])
# fit = None
# if found:
# break
# elif [] in schedules:
# fit = None
# break
# else:
# continue
# print("Schedules after fitting...: ", schedules)
# return fit
# print("Initial schedules: ", schedules)
# print("Initial duration: ", duration)
# decimal_schedules = map(map_schedule, schedules)
# free_times = map(find_free_time, decimal_schedules)
# print free_times
# if [] in free_times:
# return None
# else:
# fit = fit_to_schedules(free_times)
# print("Found this fit: ", fit, " (for duration " + str(duration / 60.0) + " hours)")
# if fit == None:
# return None
# else:
# return convert_to_time_string(fit)