-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathutils.py
274 lines (208 loc) · 6.5 KB
/
utils.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
import time
import re
from collections import deque
from contextlib import contextmanager
from pathlib import Path
from typing import Optional
from functools import wraps
from operator import getitem
import runtype
from rich.text import Text
from . import settings
mut_dataclass = runtype.dataclass(check_types=settings.typecheck, frozen=False)
dataclass = runtype.dataclass(check_types=settings.typecheck)
dsp = runtype.Dispatch()
class SafeDict(dict):
def __setitem__(self, key, value):
if key in self:
if value is self[key]:
return # Nothing to do
raise KeyError("Attempted to override key '%s' in a SafeDict" % key)
return dict.__setitem__(self, key, value)
def update(self, *other_dicts):
for other in other_dicts:
for k, v in other.items():
self[k] = v
return self
def merge_dicts(dicts):
return SafeDict().update(*dicts)
def concat(*iters):
return [elem for it in iters for elem in it]
def concat_for(iters):
return [elem for it in iters for elem in it]
def safezip(*args):
assert len(set(map(len, args))) == 1
return zip(*args)
def split_at_index(arr, idx):
return arr[:idx], arr[idx:]
def listgen(f):
@wraps(f)
def _f(*args, **kwargs):
return list(f(*args, **kwargs))
return _f
def find_duplicate(seq, key=lambda x:x):
"Returns the first duplicate item in given sequence, or None if not found"
found = set()
for i in seq:
k = key(i)
if k in found:
return i
found.add(k)
class _X:
def __init__(self, path = None):
self.path = path or []
def __getattr__(self, attr):
x = getattr, attr
return type(self)(self.path+[x])
def __getitem__(self, item):
x = getitem, item
return type(self)(self.path+[x])
def __call__(self, obj):
for f, p in self.path:
obj = f(obj, p)
return obj
X = _X()
class Benchmark:
def __init__(self):
self.total = {}
@contextmanager
def measure(self, name):
if name not in self.total:
self.total[name] = 0
start = time.time()
try:
yield
finally:
total = time.time() - start
self.total[name] += total
def measure_func(self, f):
@wraps(f)
def _f(*args, **kwargs):
with benchmark.measure(f.__name__):
return f(*args, **kwargs)
return _f
def reset(self):
self.total = {}
def print(self):
scores = [(total, name) for name, total in self.total.items()]
scores.sort(reverse=True)
print('---')
for total, name in scores:
print('%.4f\t%s' % (total, name))
def classify_bool(seq, pred):
true_elems = []
false_elems = []
for elem in seq:
if pred(elem):
true_elems.append(elem)
else:
false_elems.append(elem)
return true_elems, false_elems
benchmark = Benchmark()
def classify(seq, key=None, value=None):
d = {}
for item in seq:
k = key(item) if (key is not None) else item
v = value(item) if (value is not None) else item
if k in d:
d[k].append(v)
else:
d[k] = [v]
return d
# @dataclasses.dataclass
class TextPos:
char_index: int
line: int
column: int
__slots__ = 'char_index', 'line', 'column'
def __init__(self, char_index, line, column):
self.char_index = char_index
self.line = line
self.column = column
# @dataclasses.dataclass
class TextRange:
start: TextPos
end: TextPos
__slots__ = 'start', 'end'
def __init__(self, start, end):
self.start = start
self.end = end
def expand_tab(s):
return s.replace('\t', ' ')
@mut_dataclass
class TextReference:
text: str
source_file: str
ref: TextRange
context: Optional[TextRange] = None
def get_surrounding_line(self, span):
pos = self.ref.start.char_index
start = max(pos - span, 0)
end = pos + span
text_before = self.text[start:pos].rsplit('\n', 1)[-1]
text_after = self.text[pos:end].split('\n', 1)[0]
return expand_tab(text_before), expand_tab(text_after)
def get_pinpoint_text(self, span=80, rich=False):
text_before, text_after = self.get_surrounding_line(span)
MARK_CHAR = '-'
mark_before = mark_after = 0
if self.context:
pos = self.ref.start.char_index
mark_before = max(0, min(len(text_before), pos - self.context.start.char_index))
mark_after = max(0, min(len(text_after), self.context.end.char_index - pos - 1))
assert mark_before >= 0 and mark_after >= 0
source = Path(self.source_file)
start = self.ref.start
if rich:
return [
f" [red]~~~[/red] file '{source.name}' line {start.line}, column {start.column}",
Text(text_before + text_after),
Text(' ' * (len(text_before)-mark_before) + MARK_CHAR*mark_before + '^' + MARK_CHAR*mark_after),
]
res = [
" ~~~ file '%s' line %d, column %d:\n" % (source.name, start.line, start.column),
text_before, text_after, '\n',
' ' * (len(text_before)-mark_before), MARK_CHAR*mark_before, '^', MARK_CHAR*mark_after, '\n'
]
return ''.join(res)
def __str__(self):
return '<text-ref>'
def __repr__(self):
return '<text-ref>'
def bfs(initial, expand):
open_q = deque(list(initial))
visited = set(open_q)
while open_q:
node = open_q.popleft()
yield node
for next_node in expand(node):
if next_node not in visited:
visited.add(next_node)
open_q.append(next_node)
def bfs_all_unique(initial, expand):
open_q = deque(list(initial))
while open_q:
node = open_q.popleft()
yield node
open_q += expand(node)
def memoize(f, memo=None):
if memo is None:
memo = {}
@wraps(f)
def inner(*args):
if args not in memo:
memo[args] = f(*args)
return memo[args]
return inner
@listgen
def re_split(r, s):
offset = 0
for m in re.finditer(r, s):
yield None, s[offset:m.start()]
yield m, s[m.start():m.end()]
offset = m.end()
yield None, s[offset:]
def method(f):
assert len(f.__annotations__) == 1
cls ,= f.__annotations__.values()
setattr(cls, f.__name__, f)