-
Notifications
You must be signed in to change notification settings - Fork 162
/
patchedast.py
1050 lines (897 loc) · 34.3 KB
/
patchedast.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
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
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import collections
import numbers
import re
import warnings
from itertools import chain
from rope.base import ast, codeanalyze, exceptions
basestring = (str, bytes)
COMMA_IN_WITH_PATTERN = re.compile(r"\(.*?\)|(,)")
def get_patched_ast(source, sorted_children=False):
"""Adds ``region`` and ``sorted_children`` fields to nodes
Adds ``sorted_children`` field only if `sorted_children` is True.
"""
return patch_ast(ast.parse(source), source, sorted_children)
def patch_ast(node, source, sorted_children=False):
"""Patches the given node
After calling, each node in `node` will have a new field named
`region` that is a tuple containing the start and end offsets
of the code that generated it.
If `sorted_children` is true, a `sorted_children` field will
be created for each node, too. It is a list containing child
nodes as well as whitespaces and comments that occur between
them.
"""
if hasattr(node, "region"):
return node
walker = _PatchingASTWalker(source, children=sorted_children)
ast.call_for_nodes(node, walker)
return node
def node_region(patched_ast_node):
"""Get the region of a patched ast node"""
return patched_ast_node.region
def write_ast(patched_ast_node):
"""Extract source form a patched AST node with `sorted_children` field
If the node is patched with sorted_children turned off you can use
`node_region` function for obtaining code using module source code.
"""
result = []
for child in patched_ast_node.sorted_children:
if isinstance(child, ast.AST):
result.append(write_ast(child))
else:
result.append(child)
return "".join(result)
class MismatchedTokenError(exceptions.RopeError):
pass
class _PatchingASTWalker:
def __init__(self, source, children=False):
self.source = _Source(source)
self.children = children
self.lines = codeanalyze.SourceLinesAdapter(source)
self.children_stack = []
Number = object()
String = object()
semicolon_or_as_in_except = object()
exec_open_paren_or_space = object()
exec_close_paren_or_space = object()
exec_in_or_comma = object()
with_or_comma_context_manager = object()
empty_tuple = object()
def __call__(self, node):
method = getattr(self, "_" + node.__class__.__name__, None)
if method is not None:
return method(node)
# ???: Unknown node; what should we do here?
warnings.warn(
"Unknown node type <%s>; please report!" % node.__class__.__name__,
RuntimeWarning,
)
node.region = (self.source.offset, self.source.offset)
if self.children:
node.sorted_children = ast.get_children(node)
def _handle(self, node, base_children, eat_parens=False, eat_spaces=False):
if hasattr(node, "region"):
# ???: The same node was seen twice; what should we do?
warnings.warn(
"Node <%s> has been already patched; please report!"
% node.__class__.__name__,
RuntimeWarning,
)
return
base_children = collections.deque(base_children)
self.children_stack.append(base_children)
children = collections.deque()
formats = []
suspected_start = self.source.offset
start = suspected_start
first_token = True
while base_children:
child = base_children.popleft()
if child is None:
continue
offset = self.source.offset
if isinstance(child, ast.AST):
ast.call_for_nodes(child, self)
token_start = child.region[0]
else:
if child is self.String:
region = self.source.consume_string(
end=self._find_next_statement_start()
)
elif child is self.Number:
region = self.source.consume_number()
elif child == self.empty_tuple:
region = self.source.consume_empty_tuple()
elif child == "!=":
# INFO: This has been added to handle deprecated ``<>``
region = self.source.consume_not_equal()
elif child == self.semicolon_or_as_in_except:
# INFO: This has been added to handle deprecated
# semicolon in except
region = self.source.consume_except_as_or_semicolon()
elif child == self.exec_open_paren_or_space:
# These three cases handle the differences between
# the deprecated exec statement and the exec
# function.
region = self.source.consume_exec_open_paren_or_space()
elif child == self.exec_in_or_comma:
region = self.source.consume_exec_in_or_comma()
elif child == self.exec_close_paren_or_space:
region = self.source.consume_exec_close_paren_or_space()
elif child == self.with_or_comma_context_manager:
region = self.source.consume_with_or_comma_context_manager()
else:
if hasattr(ast, "JoinedStr") and isinstance(
node, (ast.JoinedStr, ast.FormattedValue)
):
region = self.source.consume_joined_string(child)
else:
region = self.source.consume(child)
child = self.source[region[0] : region[1]]
token_start = region[0]
if not first_token:
formats.append(self.source[offset:token_start])
if self.children:
children.append(self.source[offset:token_start])
else:
first_token = False
start = token_start
if self.children:
children.append(child)
start = self._handle_parens(children, start, formats)
if eat_parens:
start = self._eat_surrounding_parens(children, suspected_start, start)
if eat_spaces:
if self.children:
children.appendleft(self.source[0:start])
end_spaces = self.source[self.source.offset :]
self.source.consume(end_spaces)
if self.children:
children.append(end_spaces)
start = 0
if self.children:
node.sorted_children = children
node.region = (start, self.source.offset)
self.children_stack.pop()
def _handle_parens(self, children, start, formats):
"""Changes `children` and returns new start"""
opens, closes = self._count_needed_parens(formats)
old_end = self.source.offset
new_end = None
for i in range(closes):
new_end = self.source.consume(")")[1]
if new_end is not None:
if self.children:
children.append(self.source[old_end:new_end])
new_start = start
for i in range(opens):
new_start = self.source.rfind_token("(", 0, new_start)
if new_start != start:
if self.children:
children.appendleft(self.source[new_start:start])
start = new_start
return start
def _eat_surrounding_parens(self, children, suspected_start, start):
index = self.source.rfind_token("(", suspected_start, start)
if index is not None:
old_start = start
old_offset = self.source.offset
start = index
if self.children:
children.appendleft(self.source[start + 1 : old_start])
children.appendleft("(")
token_start, token_end = self.source.consume(")")
if self.children:
children.append(self.source[old_offset:token_start])
children.append(")")
return start
def _count_needed_parens(self, children):
start = 0
opens = 0
for child in children:
if not isinstance(child, basestring):
continue
if child == "" or child[0] in "'\"":
continue
index = 0
while index < len(child):
if child[index] == ")":
if opens > 0:
opens -= 1
else:
start += 1
if child[index] == "(":
opens += 1
if child[index] == "#":
try:
index = child.index("\n", index)
except ValueError:
break
index += 1
return start, opens
def _find_next_statement_start(self):
for children in reversed(self.children_stack):
for child in children:
if isinstance(child, ast.stmt):
return child.col_offset + self.lines.get_line_start(child.lineno)
return len(self.source.source)
def _join(self, iterable, separator):
iterable = iter(iterable)
try:
yield next(iterable)
except StopIteration:
return
for child in iterable:
yield separator
yield child
def _flatten_keywords(self, iterable):
iterable = ([attr, "=", pattern] for attr, pattern in iterable)
iterable = self._join(iterable, separator=[","])
return chain.from_iterable(iterable)
def _child_nodes(self, nodes, separator):
return list(self._join(nodes, separator=separator))
_operators = {
"And": "and",
"Or": "or",
"Add": "+",
"Sub": "-",
"Mult": "*",
"Div": "/",
"Mod": "%",
"Pow": "**",
"MatMult": "@",
"LShift": "<<",
"RShift": ">>",
"BitOr": "|",
"BitAnd": "&",
"BitXor": "^",
"FloorDiv": "//",
"Invert": "~",
"Not": "not",
"UAdd": "+",
"USub": "-",
"Eq": "==",
"NotEq": "!=",
"Lt": "<",
"LtE": "<=",
"Gt": ">",
"GtE": ">=",
"Is": "is",
"IsNot": "is not",
"In": "in",
"NotIn": "not in",
}
def _get_op(self, node):
return self._operators[node.__class__.__name__].split(" ")
def _Attribute(self, node):
self._handle(node, [node.value, ".", node.attr])
def _Assert(self, node):
children = ["assert", node.test]
if node.msg:
children.append(",")
children.append(node.msg)
self._handle(node, children)
def _Assign(self, node):
children = self._child_nodes(node.targets, "=")
children.append("=")
children.append(node.value)
self._handle(node, children)
def _AugAssign(self, node):
children = [node.target]
children.extend(self._get_op(node.op))
children.extend(["=", node.value])
self._handle(node, children)
def _AnnAssign(self, node):
children = [node.target, ":", node.annotation]
if node.value is not None:
children.append("=")
children.append(node.value)
self._handle(node, children)
def _Repr(self, node):
self._handle(node, ["`", node.value, "`"])
def _BinOp(self, node):
children = [node.left] + self._get_op(node.op) + [node.right]
self._handle(node, children)
def _BoolOp(self, node):
self._handle(node, self._child_nodes(node.values, self._get_op(node.op)[0]))
def _Break(self, node):
self._handle(node, ["break"])
def _Call(self, node):
def _arg_sort_key(node):
if isinstance(node, ast.keyword):
return (node.value.lineno, node.value.col_offset)
return (node.lineno, node.col_offset)
children = [node.func, "("]
args = sorted([*node.args, *node.keywords], key=_arg_sort_key)
children.extend(self._child_nodes(args, ","))
children.append(")")
self._handle(node, children)
def _ClassDef(self, node):
children = []
if getattr(node, "decorator_list", None):
for decorator in node.decorator_list:
children.append("@")
children.append(decorator)
children.extend(["class", node.name])
if node.bases:
children.append("(")
children.extend(self._child_nodes(node.bases, ","))
children.append(")")
children.append(":")
children.extend(node.body)
self._handle(node, children)
def _Compare(self, node):
children = []
children.append(node.left)
for op, expr in zip(node.ops, node.comparators):
children.extend(self._get_op(op))
children.append(expr)
self._handle(node, children)
def _Delete(self, node):
self._handle(node, ["del"] + self._child_nodes(node.targets, ","))
def _Constant(self, node):
if isinstance(node.value, basestring):
self._handle(node, [self.String])
return
if any(node.value is v for v in [True, False, None]):
self._handle(node, [str(node.value)])
return
if isinstance(node.value, numbers.Number):
self._handle(node, [self.Number])
return
if node.value is Ellipsis:
self._handle(node, ["..."])
return
assert False
def _Num(self, node):
self._handle(node, [self.Number])
def _Str(self, node):
self._handle(node, [self.String])
def _Bytes(self, node):
self._handle(node, [self.String])
def _JoinedStr(self, node):
def start_quote_char():
possible_quotes = [
(self.source.source.find(q, start, end), q) for q in QUOTE_CHARS
]
quote_pos, quote_char = min(
(pos, q) for pos, q in possible_quotes if pos != -1
)
return self.source[start : quote_pos + len(quote_char)]
def end_quote_char():
possible_quotes = [
(self.source.source.rfind(q, start, end), q)
for q in reversed(QUOTE_CHARS)
]
_, quote_pos, quote_char = max(
(len(q), pos, q) for pos, q in possible_quotes if pos != -1
)
return self.source[end - len(quote_char) : end]
QUOTE_CHARS = ['"""', "'''", '"', "'"]
offset = self.source.offset
start, end = self.source.consume_string(
end=self._find_next_statement_start(),
)
self.source.offset = offset
children = []
children.append(start_quote_char())
for part in node.values:
if isinstance(part, ast.FormattedValue):
children.append(part)
children.append(end_quote_char())
self._handle(node, children)
def _FormattedValue(self, node):
children = []
children.append("{")
children.append(node.value)
if node.format_spec:
children.append(":")
for val in node.format_spec.values:
if isinstance(val, ast.FormattedValue):
children.append(val.value)
else:
children.append(val.s)
children.append("}")
self._handle(node, children)
def _Continue(self, node):
self._handle(node, ["continue"])
def _Dict(self, node):
children = []
children.append("{")
if node.keys:
for index, (key, value) in enumerate(zip(node.keys, node.values)):
if key is None:
# PEP-448 dict unpacking: {a: b, **unpack}
children.extend(["**", value])
else:
children.extend([key, ":", value])
if index < len(node.keys) - 1:
children.append(",")
children.append("}")
self._handle(node, children)
def _Ellipsis(self, node):
self._handle(node, ["..."])
def _Expr(self, node):
self._handle(node, [node.value])
def _NamedExpr(self, node):
children = [node.target, ":=", node.value]
self._handle(node, children)
def _Exec(self, node):
children = ["exec", self.exec_open_paren_or_space, node.body]
if node.globals:
children.extend([self.exec_in_or_comma, node.globals])
if node.locals:
children.extend([",", node.locals])
children.append(self.exec_close_paren_or_space)
self._handle(node, children)
def _ExtSlice(self, node):
children = []
for index, dim in enumerate(node.dims):
if index > 0:
children.append(",")
children.append(dim)
self._handle(node, children)
def _handle_for_loop_node(self, node, is_async):
if is_async:
children = ["async", "for"]
else:
children = ["for"]
children.extend([node.target, "in", node.iter, ":"])
children.extend(node.body)
if node.orelse:
children.extend(["else", ":"])
children.extend(node.orelse)
self._handle(node, children)
def _For(self, node):
self._handle_for_loop_node(node, is_async=False)
def _AsyncFor(self, node):
self._handle_for_loop_node(node, is_async=True)
def _ImportFrom(self, node):
children = ["from"]
if node.level:
children.append("." * node.level)
# see comment at rope.base.ast.walk
children.extend([node.module or "", "import"])
children.extend(self._child_nodes(node.names, ","))
self._handle(node, children)
def _alias(self, node):
children = [node.name]
if node.asname:
children.extend(["as", node.asname])
self._handle(node, children)
def _handle_function_def_node(self, node, is_async):
children = []
try:
decorators = getattr(node, "decorator_list")
except AttributeError:
decorators = getattr(node, "decorators", None)
if decorators:
for decorator in decorators:
children.append("@")
children.append(decorator)
if is_async:
children.extend(["async", "def"])
else:
children.extend(["def"])
children.extend([node.name, "(", node.args])
children.extend([")", ":"])
children.extend(node.body)
self._handle(node, children)
def _FunctionDef(self, node):
self._handle_function_def_node(node, is_async=False)
def _AsyncFunctionDef(self, node):
self._handle_function_def_node(node, is_async=True)
def _arguments(self, node):
children = []
args = list(node.args)
defaults = [None] * (len(args) - len(node.defaults)) + list(node.defaults)
for index, (arg, default) in enumerate(zip(args, defaults)):
if index > 0:
children.append(",")
self._add_args_to_children(children, arg, default)
if node.vararg is not None:
if args:
children.append(",")
children.extend(["*", node.vararg.arg])
if node.kwarg is not None:
if args or node.vararg is not None:
children.append(",")
children.extend(["**", node.kwarg.arg])
self._handle(node, children)
def _add_args_to_children(self, children, arg, default):
if isinstance(arg, (list, tuple)):
self._add_tuple_parameter(children, arg)
else:
children.append(arg)
if default is not None:
children.append("=")
children.append(default)
def _add_tuple_parameter(self, children, arg):
children.append("(")
for index, token in enumerate(arg):
if index > 0:
children.append(",")
if isinstance(token, (list, tuple)):
self._add_tuple_parameter(children, token)
else:
children.append(token)
children.append(")")
def _GeneratorExp(self, node):
children = [node.elt]
children.extend(node.generators)
self._handle(node, children, eat_parens=True)
def _comprehension(self, node):
children = ["for", node.target, "in", node.iter]
if node.ifs:
for if_ in node.ifs:
children.append("if")
children.append(if_)
self._handle(node, children)
def _Global(self, node):
children = self._child_nodes(node.names, ",")
children.insert(0, "global")
self._handle(node, children)
def _If(self, node):
if self._is_elif(node):
children = ["elif"]
else:
children = ["if"]
children.extend([node.test, ":"])
children.extend(node.body)
if node.orelse:
if len(node.orelse) == 1 and self._is_elif(node.orelse[0]):
pass
else:
children.extend(["else", ":"])
children.extend(node.orelse)
self._handle(node, children)
def _is_elif(self, node):
if not isinstance(node, ast.If):
return False
offset = self.lines.get_line_start(node.lineno) + node.col_offset
word = self.source[offset : offset + 4]
# XXX: This is a bug; the offset does not point to the first
alt_word = self.source[offset - 5 : offset - 1]
return "elif" in (word, alt_word)
def _IfExp(self, node):
return self._handle(node, [node.body, "if", node.test, "else", node.orelse])
def _Import(self, node):
children = ["import"]
children.extend(self._child_nodes(node.names, ","))
self._handle(node, children)
def _keyword(self, node):
children = []
if node.arg is None:
children.append(node.value)
else:
children.extend([node.arg, "=", node.value])
self._handle(node, children)
def _Lambda(self, node):
self._handle(node, ["lambda", node.args, ":", node.body])
def _List(self, node):
self._handle(node, ["["] + self._child_nodes(node.elts, ",") + ["]"])
def _ListComp(self, node):
children = ["[", node.elt]
children.extend(node.generators)
children.append("]")
self._handle(node, children)
def _Set(self, node):
if node.elts:
self._handle(node, ["{"] + self._child_nodes(node.elts, ",") + ["}"])
return
# Python doesn't have empty set literals
warnings.warn(
"Tried to handle empty <Set> literal; please report!", RuntimeWarning
)
self._handle(node, ["set(", ")"])
def _SetComp(self, node):
children = ["{", node.elt]
children.extend(node.generators)
children.append("}")
self._handle(node, children)
def _DictComp(self, node):
children = ["{"]
children.extend([node.key, ":", node.value])
children.extend(node.generators)
children.append("}")
self._handle(node, children)
def _Module(self, node):
self._handle(node, list(node.body), eat_spaces=True)
def _Name(self, node):
self._handle(node, [node.id])
def _NameConstant(self, node):
self._handle(node, [str(node.value)])
def _arg(self, node):
self._handle(node, [node.arg])
def _Pass(self, node):
self._handle(node, ["pass"])
def _Print(self, node):
children = ["print"]
if node.dest:
children.extend([">>", node.dest])
if node.values:
children.append(",")
children.extend(self._child_nodes(node.values, ","))
if not node.nl:
children.append(",")
self._handle(node, children)
def _Raise(self, node):
children = ["raise"]
if node.exc:
children.append(node.exc)
if node.cause:
children.append(node.cause)
self._handle(node, children)
def _Return(self, node):
children = ["return"]
if node.value:
children.append(node.value)
self._handle(node, children)
def _Sliceobj(self, node):
children = []
for index, slice in enumerate(node.nodes):
if index > 0:
children.append(":")
if slice:
children.append(slice)
self._handle(node, children)
def _Index(self, node):
self._handle(node, [node.value])
def _Subscript(self, node):
self._handle(node, [node.value, "[", node.slice, "]"])
def _Slice(self, node):
children = []
if node.lower:
children.append(node.lower)
children.append(":")
if node.upper:
children.append(node.upper)
if node.step:
children.append(":")
children.append(node.step)
self._handle(node, children)
def _TryFinally(self, node):
# @todo fixme
is_there_except_handler = False
not_empty_body = True
if len(node.finalbody) == 1:
try:
is_there_except_handler = isinstance(
node.handlers[0], ast.ExceptHandler
)
not_empty_body = True
except IndexError:
pass
children = []
if not_empty_body or not is_there_except_handler:
children.extend(["try", ":"])
children.extend(node.body)
children.extend(node.handlers)
children.extend(["finally", ":"])
children.extend(node.finalbody)
self._handle(node, children)
def _TryExcept(self, node):
children = ["try", ":"]
children.extend(node.body)
children.extend(node.handlers)
if node.orelse:
children.extend(["else", ":"])
children.extend(node.orelse)
self._handle(node, children)
def _Try(self, node):
if len(node.finalbody):
self._TryFinally(node)
else:
self._TryExcept(node)
def _ExceptHandler(self, node):
self._excepthandler(node)
def _excepthandler(self, node):
# self._handle(node, [self.semicolon_or_as_in_except])
children = ["except"]
if node.type:
children.append(node.type)
if node.name:
children.append(self.semicolon_or_as_in_except)
children.append(node.name)
children.append(":")
children.extend(node.body)
self._handle(node, children)
def _Tuple(self, node):
if node.elts:
self._handle(node, self._child_nodes(node.elts, ","), eat_parens=True)
else:
self._handle(node, [self.empty_tuple])
def _UnaryOp(self, node):
children = self._get_op(node.op)
children.append(node.operand)
self._handle(node, children)
def _Await(self, node):
children = ["await"]
if node.value:
children.append(node.value)
self._handle(node, children)
def _Yield(self, node):
children = ["yield"]
if node.value:
children.append(node.value)
self._handle(node, children)
def _YieldFrom(self, node):
children = ["yield", "from", node.value]
self._handle(node, children)
def _While(self, node):
children = ["while", node.test, ":"]
children.extend(node.body)
if node.orelse:
children.extend(["else", ":"])
children.extend(node.orelse)
self._handle(node, children)
def _handle_with_node(self, node, is_async):
children = []
if is_async:
children.extend(["async"])
for item in node.items:
children.extend([self.with_or_comma_context_manager, item.context_expr])
if item.optional_vars:
children.extend(["as", item.optional_vars])
children.append(":")
children.extend(node.body)
self._handle(node, children)
def _With(self, node):
self._handle_with_node(node, is_async=False)
def _AsyncWith(self, node):
self._handle_with_node(node, is_async=True)
def _Starred(self, node):
self._handle(node, [node.value])
def _Match(self, node):
children = ["match", node.subject, ":"]
children.extend(node.cases)
self._handle(node, children)
def _match_case(self, node):
children = ["case", node.pattern]
if node.guard:
children.extend(["if", node.guard])
children.append(":")
children.extend(node.body)
self._handle(node, children)
def _MatchAs(self, node):
if node.pattern:
children = [node.pattern, "as", node.name]
elif node.name is None:
children = ["_"]
else:
children = [node.name]
self._handle(node, children)
def _MatchClass(self, node):
children = []
children.extend([node.cls, "("])
children.extend(self._child_nodes(node.patterns, ","))
children.extend(self._flatten_keywords(zip(node.kwd_attrs, node.kwd_patterns)))
children.append(")")
self._handle(node, children)
def _MatchValue(self, node):
self._handle(node, [node.value])
def _MatchMapping(self, node):
children = []
children.append("{")
for index, (key, value) in enumerate(zip(node.keys, node.patterns)):
children.extend([key, ":", value])
if index < len(node.keys) - 1:
children.append(",")
children.append("}")
self._handle(node, children)
class _Source:
def __init__(self, source):
self.source = source
self.offset = 0
def consume(self, token, skip_comment=True):
try:
while True:
new_offset = self.source.index(token, self.offset)
if self._good_token(token, new_offset) or not skip_comment:
break
else:
self._skip_comment()
except (ValueError, TypeError) as e:
raise MismatchedTokenError(
f"Token <{token}> at {self._get_location()} cannot be matched"
)
self.offset = new_offset + len(token)
return (new_offset, self.offset)
def consume_joined_string(self, token):
new_offset = self.source.index(token, self.offset)
self.offset = new_offset + len(token)
return (new_offset, self.offset)
def consume_string(self, end=None):
if _Source._string_pattern is None:
string_pattern = codeanalyze.get_string_pattern()
formatted_string_pattern = codeanalyze.get_formatted_string_pattern()
original = r"(?:{})|(?:{})".format(string_pattern, formatted_string_pattern)
pattern = r"({})((\s|\\\n|#[^\n]*\n)*({}))*".format(original, original)
_Source._string_pattern = re.compile(pattern)
repattern = _Source._string_pattern
return self._consume_pattern(repattern, end)
def consume_number(self):
if _Source._number_pattern is None:
_Source._number_pattern = re.compile(self._get_number_pattern())
repattern = _Source._number_pattern
return self._consume_pattern(repattern)
def consume_empty_tuple(self):
return self._consume_pattern(re.compile(r"\(\s*\)"))
def consume_not_equal(self):
if _Source._not_equals_pattern is None:
_Source._not_equals_pattern = re.compile(r"<>|!=")
repattern = _Source._not_equals_pattern
return self._consume_pattern(repattern)
def consume_except_as_or_semicolon(self):
repattern = re.compile(r"as|,")
return self._consume_pattern(repattern)
def consume_exec_open_paren_or_space(self):
repattern = re.compile(r"\(|")
return self._consume_pattern(repattern)
def consume_exec_in_or_comma(self):
repattern = re.compile(r"in|,")
return self._consume_pattern(repattern)
def consume_exec_close_paren_or_space(self):
repattern = re.compile(r"\)|")
return self._consume_pattern(repattern)
def consume_with_or_comma_context_manager(self):
repattern = re.compile(r"with|,")
return self._consume_pattern(repattern)
def _good_token(self, token, offset, start=None):
"""Checks whether consumed token is in comments"""
if start is None:
start = self.offset
try:
comment_index = self.source.rindex("#", start, offset)
except ValueError:
return True
try:
new_line_index = self.source.rindex("\n", start, offset)
except ValueError:
return False
return comment_index < new_line_index
def _skip_comment(self):
self.offset = self.source.index("\n", self.offset + 1)
def _get_location(self):
lines = self.source[: self.offset].split("\n")