-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutils.py
More file actions
178 lines (144 loc) · 3.47 KB
/
utils.py
File metadata and controls
178 lines (144 loc) · 3.47 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
# for operations
def dict_max(d):
""" a) create a list of the dict's keys and values;
b) return the key with the max value"""
v = list(d.values())
k = list(d.keys())
return k[v.index(max(v))]
def findall(item, l):
for i in range(0, len(l)):
if l[i] == item:
yield i
def getall(indices, l):
for i in indices:
yield l[i]
def fuzzy_count(l, num, err=3):
# l must be an array of numbers
count = 0
for i in l:
if num-err < i < num+err:
count += 1
return count
def in_list(l, *args):
for arg in args:
if arg not in l:
yield False
else:
yield True
def alternative_splits(l, *args):
if type(args[0]) is list and len(args) == 1:
args = args[0]
for i in args:
yield l.split(i)
def partition(l, part):
pt = []
its = 0
for p1 in range(len(l)):
p = l[p1]
if p == part:
if pt:
pt.append((its, ))
yield pt
pt = []
its = p1+1
else:
its = p1+1
else:
pt.append(p)
if pt:
pt.append((its, ))
yield pt
def printl(l, prefix=""):
for x in l:
if type(x) == list or type(x) == tuple:
printl(x, prefix=prefix+" ")
else:
print(prefix + str(x))
def ls(l):
ret = ""
for x in l:
if type(x) == list:
ret += "[" + ls(x) + "]"
else:
ret += str(x)
ret += ", "
return ret
def getEntityByIndex(idx, entities):
for i in entities:
if i.index == idx:
return i
def flatten(l):
ret = []
for i in l:
if type(i) == list:
ret.extend(flatten(i))
else:
ret.append(i)
return ret
def correspond(idxr, idxl):
for i in idxl:
if idxr[0] < i < idxr[1]:
yield i
def getRelationByIndex(rels, idx):
for rel in rels:
if rel.index == idx:
return rel
return False
def s_insert(string, char, index):
return string[:index] + char + string[index:]
def deep_in(l, itm, key=None):
if key is None:
key = lambda x: x
for j in l:
if itm == key(j):
return itm
elif type(j) == list or type(j) == tuple:
res = deep_in(j, itm, key=key)
if res:
return j
return False
def verify(sentence):
return sentence["pdt"] and sentence["sbj"]
def machinize(number):
d = {
"one": 1,
"two": 2,
"three": 3,
"four": 4,
"five": 5,
"six": 6,
"seven": 7,
"eight": 8,
"nine": 9,
"ten": 10,
"eleven": 11,
"twelve": 12,
"thirteen": 13,
"fourteen": 14,
"fifteen": 15,
"sixteen": 16,
"seventeen": 17,
"eighteen": 18,
"nineteen": 19,
"twenty": 20,
"thirty": 30,
"fourty": 40,
"fifty": 50,
"sixty": 60,
"seventy": 70,
"eighty": 80,
"ninety": 90,
"hundred": 100
}
if number.lower() in d:
return d[number.lower()]
else:
if "-" in number:
number = number.split("-")
tot = 0
for p in number:
if p in d:
tot + d[p]
return tot
if __name__ == "__main__":
print(list(partition([1, None, None, 4, 2, None, 1], None)))