-
Notifications
You must be signed in to change notification settings - Fork 0
/
substitutions.py
64 lines (49 loc) · 1.71 KB
/
substitutions.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
def title(clazz):
return clazz["title"]
def number(clazz):
return clazz["number"]
def desc(clazz):
if "desc" in clazz:
return clazz["desc"]
return "Class description goes here"
def prereqs(clazz):
return expand_list([p["number"] for p in clazz["prereqs"] ])
def teachers(clazz):
if "teachers" in clazz:
return expand_list(clazz["teachers"], "or")
return "<Unknown>"
# Builds up a tree view of course prerequisites where each parent-child relationship represents a prequisite
def prereq_tree(root, depth=0, ended={0:True}):
tree = ""
# If this class has already been added, skip it
if root["number"] in ended:
return tree
for i in range(0, depth - 1):
tree += " " if ended[i] else "│ "
tree += ("" if depth == 0 else ("└─" if ended[depth] else "├─")) + root["number"] + "\n"
ended[ root["number"] ] = True
# If there are no prereqs to this class, we are done
if not "prereqs" in root or not root["prereqs"]:
return tree
ended[depth] = False
for p in root["prereqs"][0:-1]:
ended[depth + 1] = False
tree += prereq_tree(p, depth + 1, ended)
ended[depth] = True
ended[depth + 1] = True
tree += prereq_tree(root["prereqs"][-1], depth + 1, ended)
return tree
# Expands a list with commas and a conjunction
# [1] -> 1
# [1, 2] -> 1 and 2
# [1, 2, ..., n] -> 1, 2, ... , and n
def expand_list(lst, conjunction="and"):
string = ", ".join(lst[0:-1])
if len(lst) > 2:
return string + ", " + conjunction + " " + lst[-1]
elif len(lst) > 1:
return string + " " + conjunction + " " + lst[-1]
elif len(lst) == 0:
return "None"
else:
return lst[-1]