refactor.py 0000644 00000066475 15053244155 0006751 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Refactoring framework.
Used as a main program, this can refactor any number of files and/or
recursively descend down directories. Imported as a module, this
provides infrastructure to write your own refactoring tool.
"""
__author__ = "Guido van Rossum <guido@python.org>"
# Python imports
import os
import sys
import logging
import operator
import collections
import io
from itertools import chain
# Local imports
from .pgen2 import driver, tokenize, token
from .fixer_util import find_root
from . import pytree, pygram
from . import btm_matcher as bm
def get_all_fix_names(fixer_pkg, remove_prefix=True):
"""Return a sorted list of all available fix names in the given package."""
pkg = __import__(fixer_pkg, [], [], ["*"])
fixer_dir = os.path.dirname(pkg.__file__)
fix_names = []
for name in sorted(os.listdir(fixer_dir)):
if name.startswith("fix_") and name.endswith(".py"):
if remove_prefix:
name = name[4:]
fix_names.append(name[:-3])
return fix_names
class _EveryNode(Exception):
pass
def _get_head_types(pat):
""" Accepts a pytree Pattern Node and returns a set
of the pattern types which will match first. """
if isinstance(pat, (pytree.NodePattern, pytree.LeafPattern)):
# NodePatters must either have no type and no content
# or a type and content -- so they don't get any farther
# Always return leafs
if pat.type is None:
raise _EveryNode
return {pat.type}
if isinstance(pat, pytree.NegatedPattern):
if pat.content:
return _get_head_types(pat.content)
raise _EveryNode # Negated Patterns don't have a type
if isinstance(pat, pytree.WildcardPattern):
# Recurse on each node in content
r = set()
for p in pat.content:
for x in p:
r.update(_get_head_types(x))
return r
raise Exception("Oh no! I don't understand pattern %s" %(pat))
def _get_headnode_dict(fixer_list):
""" Accepts a list of fixers and returns a dictionary
of head node type --> fixer list. """
head_nodes = collections.defaultdict(list)
every = []
for fixer in fixer_list:
if fixer.pattern:
try:
heads = _get_head_types(fixer.pattern)
except _EveryNode:
every.append(fixer)
else:
for node_type in heads:
head_nodes[node_type].append(fixer)
else:
if fixer._accept_type is not None:
head_nodes[fixer._accept_type].append(fixer)
else:
every.append(fixer)
for node_type in chain(pygram.python_grammar.symbol2number.values(),
pygram.python_grammar.tokens):
head_nodes[node_type].extend(every)
return dict(head_nodes)
def get_fixers_from_package(pkg_name):
"""
Return the fully qualified names for fixers in the package pkg_name.
"""
return [pkg_name + "." + fix_name
for fix_name in get_all_fix_names(pkg_name, False)]
def _identity(obj):
return obj
if sys.version_info < (3, 0):
import codecs
_open_with_encoding = codecs.open
# codecs.open doesn't translate newlines sadly.
def _from_system_newlines(input):
return input.replace("\r\n", "\n")
def _to_system_newlines(input):
if os.linesep != "\n":
return input.replace("\n", os.linesep)
else:
return input
else:
_open_with_encoding = open
_from_system_newlines = _identity
_to_system_newlines = _identity
def _detect_future_features(source):
have_docstring = False
gen = tokenize.generate_tokens(io.StringIO(source).readline)
def advance():
tok = next(gen)
return tok[0], tok[1]
ignore = frozenset({token.NEWLINE, tokenize.NL, token.COMMENT})
features = set()
try:
while True:
tp, value = advance()
if tp in ignore:
continue
elif tp == token.STRING:
if have_docstring:
break
have_docstring = True
elif tp == token.NAME and value == "from":
tp, value = advance()
if tp != token.NAME or value != "__future__":
break
tp, value = advance()
if tp != token.NAME or value != "import":
break
tp, value = advance()
if tp == token.OP and value == "(":
tp, value = advance()
while tp == token.NAME:
features.add(value)
tp, value = advance()
if tp != token.OP or value != ",":
break
tp, value = advance()
else:
break
except StopIteration:
pass
return frozenset(features)
class FixerError(Exception):
"""A fixer could not be loaded."""
class RefactoringTool(object):
_default_options = {"print_function" : False,
"write_unchanged_files" : False}
CLASS_PREFIX = "Fix" # The prefix for fixer classes
FILE_PREFIX = "fix_" # The prefix for modules with a fixer within
def __init__(self, fixer_names, options=None, explicit=None):
"""Initializer.
Args:
fixer_names: a list of fixers to import
options: a dict with configuration.
explicit: a list of fixers to run even if they are explicit.
"""
self.fixers = fixer_names
self.explicit = explicit or []
self.options = self._default_options.copy()
if options is not None:
self.options.update(options)
if self.options["print_function"]:
self.grammar = pygram.python_grammar_no_print_statement
else:
self.grammar = pygram.python_grammar
# When this is True, the refactor*() methods will call write_file() for
# files processed even if they were not changed during refactoring. If
# and only if the refactor method's write parameter was True.
self.write_unchanged_files = self.options.get("write_unchanged_files")
self.errors = []
self.logger = logging.getLogger("RefactoringTool")
self.fixer_log = []
self.wrote = False
self.driver = driver.Driver(self.grammar,
convert=pytree.convert,
logger=self.logger)
self.pre_order, self.post_order = self.get_fixers()
self.files = [] # List of files that were or should be modified
self.BM = bm.BottomMatcher()
self.bmi_pre_order = [] # Bottom Matcher incompatible fixers
self.bmi_post_order = []
for fixer in chain(self.post_order, self.pre_order):
if fixer.BM_compatible:
self.BM.add_fixer(fixer)
# remove fixers that will be handled by the bottom-up
# matcher
elif fixer in self.pre_order:
self.bmi_pre_order.append(fixer)
elif fixer in self.post_order:
self.bmi_post_order.append(fixer)
self.bmi_pre_order_heads = _get_headnode_dict(self.bmi_pre_order)
self.bmi_post_order_heads = _get_headnode_dict(self.bmi_post_order)
def get_fixers(self):
"""Inspects the options to load the requested patterns and handlers.
Returns:
(pre_order, post_order), where pre_order is the list of fixers that
want a pre-order AST traversal, and post_order is the list that want
post-order traversal.
"""
pre_order_fixers = []
post_order_fixers = []
for fix_mod_path in self.fixers:
mod = __import__(fix_mod_path, {}, {}, ["*"])
fix_name = fix_mod_path.rsplit(".", 1)[-1]
if fix_name.startswith(self.FILE_PREFIX):
fix_name = fix_name[len(self.FILE_PREFIX):]
parts = fix_name.split("_")
class_name = self.CLASS_PREFIX + "".join([p.title() for p in parts])
try:
fix_class = getattr(mod, class_name)
except AttributeError:
raise FixerError("Can't find %s.%s" % (fix_name, class_name))
fixer = fix_class(self.options, self.fixer_log)
if fixer.explicit and self.explicit is not True and \
fix_mod_path not in self.explicit:
self.log_message("Skipping optional fixer: %s", fix_name)
continue
self.log_debug("Adding transformation: %s", fix_name)
if fixer.order == "pre":
pre_order_fixers.append(fixer)
elif fixer.order == "post":
post_order_fixers.append(fixer)
else:
raise FixerError("Illegal fixer order: %r" % fixer.order)
key_func = operator.attrgetter("run_order")
pre_order_fixers.sort(key=key_func)
post_order_fixers.sort(key=key_func)
return (pre_order_fixers, post_order_fixers)
def log_error(self, msg, *args, **kwds):
"""Called when an error occurs."""
raise
def log_message(self, msg, *args):
"""Hook to log a message."""
if args:
msg = msg % args
self.logger.info(msg)
def log_debug(self, msg, *args):
if args:
msg = msg % args
self.logger.debug(msg)
def print_output(self, old_text, new_text, filename, equal):
"""Called with the old version, new version, and filename of a
refactored file."""
pass
def refactor(self, items, write=False, doctests_only=False):
"""Refactor a list of files and directories."""
for dir_or_file in items:
if os.path.isdir(dir_or_file):
self.refactor_dir(dir_or_file, write, doctests_only)
else:
self.refactor_file(dir_or_file, write, doctests_only)
def refactor_dir(self, dir_name, write=False, doctests_only=False):
"""Descends down a directory and refactor every Python file found.
Python files are assumed to have a .py extension.
Files and subdirectories starting with '.' are skipped.
"""
py_ext = os.extsep + "py"
for dirpath, dirnames, filenames in os.walk(dir_name):
self.log_debug("Descending into %s", dirpath)
dirnames.sort()
filenames.sort()
for name in filenames:
if (not name.startswith(".") and
os.path.splitext(name)[1] == py_ext):
fullname = os.path.join(dirpath, name)
self.refactor_file(fullname, write, doctests_only)
# Modify dirnames in-place to remove subdirs with leading dots
dirnames[:] = [dn for dn in dirnames if not dn.startswith(".")]
def _read_python_source(self, filename):
"""
Do our best to decode a Python source file correctly.
"""
try:
f = open(filename, "rb")
except OSError as err:
self.log_error("Can't open %s: %s", filename, err)
return None, None
try:
encoding = tokenize.detect_encoding(f.readline)[0]
finally:
f.close()
with _open_with_encoding(filename, "r", encoding=encoding) as f:
return _from_system_newlines(f.read()), encoding
def refactor_file(self, filename, write=False, doctests_only=False):
"""Refactors a file."""
input, encoding = self._read_python_source(filename)
if input is None:
# Reading the file failed.
return
input += "\n" # Silence certain parse errors
if doctests_only:
self.log_debug("Refactoring doctests in %s", filename)
output = self.refactor_docstring(input, filename)
if self.write_unchanged_files or output != input:
self.processed_file(output, filename, input, write, encoding)
else:
self.log_debug("No doctest changes in %s", filename)
else:
tree = self.refactor_string(input, filename)
if self.write_unchanged_files or (tree and tree.was_changed):
# The [:-1] is to take off the \n we added earlier
self.processed_file(str(tree)[:-1], filename,
write=write, encoding=encoding)
else:
self.log_debug("No changes in %s", filename)
def refactor_string(self, data, name):
"""Refactor a given input string.
Args:
data: a string holding the code to be refactored.
name: a human-readable name for use in error/log messages.
Returns:
An AST corresponding to the refactored input stream; None if
there were errors during the parse.
"""
features = _detect_future_features(data)
if "print_function" in features:
self.driver.grammar = pygram.python_grammar_no_print_statement
try:
tree = self.driver.parse_string(data)
except Exception as err:
self.log_error("Can't parse %s: %s: %s",
name, err.__class__.__name__, err)
return
finally:
self.driver.grammar = self.grammar
tree.future_features = features
self.log_debug("Refactoring %s", name)
self.refactor_tree(tree, name)
return tree
def refactor_stdin(self, doctests_only=False):
input = sys.stdin.read()
if doctests_only:
self.log_debug("Refactoring doctests in stdin")
output = self.refactor_docstring(input, "<stdin>")
if self.write_unchanged_files or output != input:
self.processed_file(output, "<stdin>", input)
else:
self.log_debug("No doctest changes in stdin")
else:
tree = self.refactor_string(input, "<stdin>")
if self.write_unchanged_files or (tree and tree.was_changed):
self.processed_file(str(tree), "<stdin>", input)
else:
self.log_debug("No changes in stdin")
def refactor_tree(self, tree, name):
"""Refactors a parse tree (modifying the tree in place).
For compatible patterns the bottom matcher module is
used. Otherwise the tree is traversed node-to-node for
matches.
Args:
tree: a pytree.Node instance representing the root of the tree
to be refactored.
name: a human-readable name for this tree.
Returns:
True if the tree was modified, False otherwise.
"""
for fixer in chain(self.pre_order, self.post_order):
fixer.start_tree(tree, name)
#use traditional matching for the incompatible fixers
self.traverse_by(self.bmi_pre_order_heads, tree.pre_order())
self.traverse_by(self.bmi_post_order_heads, tree.post_order())
# obtain a set of candidate nodes
match_set = self.BM.run(tree.leaves())
while any(match_set.values()):
for fixer in self.BM.fixers:
if fixer in match_set and match_set[fixer]:
#sort by depth; apply fixers from bottom(of the AST) to top
match_set[fixer].sort(key=pytree.Base.depth, reverse=True)
if fixer.keep_line_order:
#some fixers(eg fix_imports) must be applied
#with the original file's line order
match_set[fixer].sort(key=pytree.Base.get_lineno)
for node in list(match_set[fixer]):
if node in match_set[fixer]:
match_set[fixer].remove(node)
try:
find_root(node)
except ValueError:
# this node has been cut off from a
# previous transformation ; skip
continue
if node.fixers_applied and fixer in node.fixers_applied:
# do not apply the same fixer again
continue
results = fixer.match(node)
if results:
new = fixer.transform(node, results)
if new is not None:
node.replace(new)
#new.fixers_applied.append(fixer)
for node in new.post_order():
# do not apply the fixer again to
# this or any subnode
if not node.fixers_applied:
node.fixers_applied = []
node.fixers_applied.append(fixer)
# update the original match set for
# the added code
new_matches = self.BM.run(new.leaves())
for fxr in new_matches:
if not fxr in match_set:
match_set[fxr]=[]
match_set[fxr].extend(new_matches[fxr])
for fixer in chain(self.pre_order, self.post_order):
fixer.finish_tree(tree, name)
return tree.was_changed
def traverse_by(self, fixers, traversal):
"""Traverse an AST, applying a set of fixers to each node.
This is a helper method for refactor_tree().
Args:
fixers: a list of fixer instances.
traversal: a generator that yields AST nodes.
Returns:
None
"""
if not fixers:
return
for node in traversal:
for fixer in fixers[node.type]:
results = fixer.match(node)
if results:
new = fixer.transform(node, results)
if new is not None:
node.replace(new)
node = new
def processed_file(self, new_text, filename, old_text=None, write=False,
encoding=None):
"""
Called when a file has been refactored and there may be changes.
"""
self.files.append(filename)
if old_text is None:
old_text = self._read_python_source(filename)[0]
if old_text is None:
return
equal = old_text == new_text
self.print_output(old_text, new_text, filename, equal)
if equal:
self.log_debug("No changes to %s", filename)
if not self.write_unchanged_files:
return
if write:
self.write_file(new_text, filename, old_text, encoding)
else:
self.log_debug("Not writing changes to %s", filename)
def write_file(self, new_text, filename, old_text, encoding=None):
"""Writes a string to a file.
It first shows a unified diff between the old text and the new text, and
then rewrites the file; the latter is only done if the write option is
set.
"""
try:
f = _open_with_encoding(filename, "w", encoding=encoding)
except OSError as err:
self.log_error("Can't create %s: %s", filename, err)
return
try:
f.write(_to_system_newlines(new_text))
except OSError as err:
self.log_error("Can't write %s: %s", filename, err)
finally:
f.close()
self.log_debug("Wrote changes to %s", filename)
self.wrote = True
PS1 = ">>> "
PS2 = "... "
def refactor_docstring(self, input, filename):
"""Refactors a docstring, looking for doctests.
This returns a modified version of the input string. It looks
for doctests, which start with a ">>>" prompt, and may be
continued with "..." prompts, as long as the "..." is indented
the same as the ">>>".
(Unfortunately we can't use the doctest module's parser,
since, like most parsers, it is not geared towards preserving
the original source.)
"""
result = []
block = None
block_lineno = None
indent = None
lineno = 0
for line in input.splitlines(keepends=True):
lineno += 1
if line.lstrip().startswith(self.PS1):
if block is not None:
result.extend(self.refactor_doctest(block, block_lineno,
indent, filename))
block_lineno = lineno
block = [line]
i = line.find(self.PS1)
indent = line[:i]
elif (indent is not None and
(line.startswith(indent + self.PS2) or
line == indent + self.PS2.rstrip() + "\n")):
block.append(line)
else:
if block is not None:
result.extend(self.refactor_doctest(block, block_lineno,
indent, filename))
block = None
indent = None
result.append(line)
if block is not None:
result.extend(self.refactor_doctest(block, block_lineno,
indent, filename))
return "".join(result)
def refactor_doctest(self, block, lineno, indent, filename):
"""Refactors one doctest.
A doctest is given as a block of lines, the first of which starts
with ">>>" (possibly indented), while the remaining lines start
with "..." (identically indented).
"""
try:
tree = self.parse_block(block, lineno, indent)
except Exception as err:
if self.logger.isEnabledFor(logging.DEBUG):
for line in block:
self.log_debug("Source: %s", line.rstrip("\n"))
self.log_error("Can't parse docstring in %s line %s: %s: %s",
filename, lineno, err.__class__.__name__, err)
return block
if self.refactor_tree(tree, filename):
new = str(tree).splitlines(keepends=True)
# Undo the adjustment of the line numbers in wrap_toks() below.
clipped, new = new[:lineno-1], new[lineno-1:]
assert clipped == ["\n"] * (lineno-1), clipped
if not new[-1].endswith("\n"):
new[-1] += "\n"
block = [indent + self.PS1 + new.pop(0)]
if new:
block += [indent + self.PS2 + line for line in new]
return block
def summarize(self):
if self.wrote:
were = "were"
else:
were = "need to be"
if not self.files:
self.log_message("No files %s modified.", were)
else:
self.log_message("Files that %s modified:", were)
for file in self.files:
self.log_message(file)
if self.fixer_log:
self.log_message("Warnings/messages while refactoring:")
for message in self.fixer_log:
self.log_message(message)
if self.errors:
if len(self.errors) == 1:
self.log_message("There was 1 error:")
else:
self.log_message("There were %d errors:", len(self.errors))
for msg, args, kwds in self.errors:
self.log_message(msg, *args, **kwds)
def parse_block(self, block, lineno, indent):
"""Parses a block into a tree.
This is necessary to get correct line number / offset information
in the parser diagnostics and embedded into the parse tree.
"""
tree = self.driver.parse_tokens(self.wrap_toks(block, lineno, indent))
tree.future_features = frozenset()
return tree
def wrap_toks(self, block, lineno, indent):
"""Wraps a tokenize stream to systematically modify start/end."""
tokens = tokenize.generate_tokens(self.gen_lines(block, indent).__next__)
for type, value, (line0, col0), (line1, col1), line_text in tokens:
line0 += lineno - 1
line1 += lineno - 1
# Don't bother updating the columns; this is too complicated
# since line_text would also have to be updated and it would
# still break for tokens spanning lines. Let the user guess
# that the column numbers for doctests are relative to the
# end of the prompt string (PS1 or PS2).
yield type, value, (line0, col0), (line1, col1), line_text
def gen_lines(self, block, indent):
"""Generates lines as expected by tokenize from a list of lines.
This strips the first len(indent + self.PS1) characters off each line.
"""
prefix1 = indent + self.PS1
prefix2 = indent + self.PS2
prefix = prefix1
for line in block:
if line.startswith(prefix):
yield line[len(prefix):]
elif line == prefix.rstrip() + "\n":
yield "\n"
else:
raise AssertionError("line=%r, prefix=%r" % (line, prefix))
prefix = prefix2
while True:
yield ""
class MultiprocessingUnsupported(Exception):
pass
class MultiprocessRefactoringTool(RefactoringTool):
def __init__(self, *args, **kwargs):
super(MultiprocessRefactoringTool, self).__init__(*args, **kwargs)
self.queue = None
self.output_lock = None
def refactor(self, items, write=False, doctests_only=False,
num_processes=1):
if num_processes == 1:
return super(MultiprocessRefactoringTool, self).refactor(
items, write, doctests_only)
try:
import multiprocessing
except ImportError:
raise MultiprocessingUnsupported
if self.queue is not None:
raise RuntimeError("already doing multiple processes")
self.queue = multiprocessing.JoinableQueue()
self.output_lock = multiprocessing.Lock()
processes = [multiprocessing.Process(target=self._child)
for i in range(num_processes)]
try:
for p in processes:
p.start()
super(MultiprocessRefactoringTool, self).refactor(items, write,
doctests_only)
finally:
self.queue.join()
for i in range(num_processes):
self.queue.put(None)
for p in processes:
if p.is_alive():
p.join()
self.queue = None
def _child(self):
task = self.queue.get()
while task is not None:
args, kwargs = task
try:
super(MultiprocessRefactoringTool, self).refactor_file(
*args, **kwargs)
finally:
self.queue.task_done()
task = self.queue.get()
def refactor_file(self, *args, **kwargs):
if self.queue is not None:
self.queue.put((args, kwargs))
else:
return super(MultiprocessRefactoringTool, self).refactor_file(
*args, **kwargs)
fixer_base.py 0000644 00000015042 15053244155 0007233 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Base class for fixers (optional, but recommended)."""
# Python imports
import itertools
# Local imports
from .patcomp import PatternCompiler
from . import pygram
from .fixer_util import does_tree_import
class BaseFix(object):
"""Optional base class for fixers.
The subclass name must be FixFooBar where FooBar is the result of
removing underscores and capitalizing the words of the fix name.
For example, the class name for a fixer named 'has_key' should be
FixHasKey.
"""
PATTERN = None # Most subclasses should override with a string literal
pattern = None # Compiled pattern, set by compile_pattern()
pattern_tree = None # Tree representation of the pattern
options = None # Options object passed to initializer
filename = None # The filename (set by set_filename)
numbers = itertools.count(1) # For new_name()
used_names = set() # A set of all used NAMEs
order = "post" # Does the fixer prefer pre- or post-order traversal
explicit = False # Is this ignored by refactor.py -f all?
run_order = 5 # Fixers will be sorted by run order before execution
# Lower numbers will be run first.
_accept_type = None # [Advanced and not public] This tells RefactoringTool
# which node type to accept when there's not a pattern.
keep_line_order = False # For the bottom matcher: match with the
# original line order
BM_compatible = False # Compatibility with the bottom matching
# module; every fixer should set this
# manually
# Shortcut for access to Python grammar symbols
syms = pygram.python_symbols
def __init__(self, options, log):
"""Initializer. Subclass may override.
Args:
options: a dict containing the options passed to RefactoringTool
that could be used to customize the fixer through the command line.
log: a list to append warnings and other messages to.
"""
self.options = options
self.log = log
self.compile_pattern()
def compile_pattern(self):
"""Compiles self.PATTERN into self.pattern.
Subclass may override if it doesn't want to use
self.{pattern,PATTERN} in .match().
"""
if self.PATTERN is not None:
PC = PatternCompiler()
self.pattern, self.pattern_tree = PC.compile_pattern(self.PATTERN,
with_tree=True)
def set_filename(self, filename):
"""Set the filename.
The main refactoring tool should call this.
"""
self.filename = filename
def match(self, node):
"""Returns match for a given parse tree node.
Should return a true or false object (not necessarily a bool).
It may return a non-empty dict of matching sub-nodes as
returned by a matching pattern.
Subclass may override.
"""
results = {"node": node}
return self.pattern.match(node, results) and results
def transform(self, node, results):
"""Returns the transformation for a given parse tree node.
Args:
node: the root of the parse tree that matched the fixer.
results: a dict mapping symbolic names to part of the match.
Returns:
None, or a node that is a modified copy of the
argument node. The node argument may also be modified in-place to
effect the same change.
Subclass *must* override.
"""
raise NotImplementedError()
def new_name(self, template="xxx_todo_changeme"):
"""Return a string suitable for use as an identifier
The new name is guaranteed not to conflict with other identifiers.
"""
name = template
while name in self.used_names:
name = template + str(next(self.numbers))
self.used_names.add(name)
return name
def log_message(self, message):
if self.first_log:
self.first_log = False
self.log.append("### In file %s ###" % self.filename)
self.log.append(message)
def cannot_convert(self, node, reason=None):
"""Warn the user that a given chunk of code is not valid Python 3,
but that it cannot be converted automatically.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
"""
lineno = node.get_lineno()
for_output = node.clone()
for_output.prefix = ""
msg = "Line %d: could not convert: %s"
self.log_message(msg % (lineno, for_output))
if reason:
self.log_message(reason)
def warning(self, node, reason):
"""Used for warning the user about possible uncertainty in the
translation.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
"""
lineno = node.get_lineno()
self.log_message("Line %d: %s" % (lineno, reason))
def start_tree(self, tree, filename):
"""Some fixers need to maintain tree-wide state.
This method is called once, at the start of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
"""
self.used_names = tree.used_names
self.set_filename(filename)
self.numbers = itertools.count(1)
self.first_log = True
def finish_tree(self, tree, filename):
"""Some fixers need to maintain tree-wide state.
This method is called once, at the conclusion of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
"""
pass
class ConditionalFix(BaseFix):
""" Base class for fixers which not execute if an import is found. """
# This is the name of the import which, if found, will cause the test to be skipped
skip_on = None
def start_tree(self, *args):
super(ConditionalFix, self).start_tree(*args)
self._should_skip = None
def should_skip(self, node):
if self._should_skip is not None:
return self._should_skip
pkg = self.skip_on.split(".")
name = pkg[-1]
pkg = ".".join(pkg[:-1])
self._should_skip = does_tree_import(pkg, name, node)
return self._should_skip
pygram.py 0000644 00000002202 15053244155 0006415 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Export the Python grammar and symbols."""
# Python imports
import os
# Local imports
from .pgen2 import token
from .pgen2 import driver
from . import pytree
# The grammar file
_GRAMMAR_FILE = os.path.join(os.path.dirname(__file__), "Grammar.txt")
_PATTERN_GRAMMAR_FILE = os.path.join(os.path.dirname(__file__),
"PatternGrammar.txt")
class Symbols(object):
def __init__(self, grammar):
"""Initializer.
Creates an attribute for each grammar symbol (nonterminal),
whose value is the symbol's type (an int >= 256).
"""
for name, symbol in grammar.symbol2number.items():
setattr(self, name, symbol)
python_grammar = driver.load_packaged_grammar("lib2to3", _GRAMMAR_FILE)
python_symbols = Symbols(python_grammar)
python_grammar_no_print_statement = python_grammar.copy()
del python_grammar_no_print_statement.keywords["print"]
pattern_grammar = driver.load_packaged_grammar("lib2to3", _PATTERN_GRAMMAR_FILE)
pattern_symbols = Symbols(pattern_grammar)
PatternGrammar3.6.8.final.0.pickle 0000644 00000004055 15053244155 0012514 0 ustar 00 �ccollections
OrderedDict
q )Rq(X dfasqh )Rq(M ]q(]qKK�qa]qKK�qa]q K K�q
aeh )Rq (KKKKKKKKKKu�q M]q
(]q(KK�qK K�qe]q(KK�qK K�qK K�qeeh )Rq(KKKKKKKKKKu�qM]q(]qK
K�qa]q(K K �qK K�q eeh )Rq (KKKKKKKKKKu�q M]q (]q K K�q!a]q"KK�q#a]q$K
K�q%a]q&K K�q'aeh )Rq(K Ks�q)M]q*(]q+KK�q,a]q-(KK�q.KK�q/KK�q0e]q1KK�q2a]q3(KK�q4K K�q5e]q6K K�q7a]q8KK�q9aeh )Rq:KKs�q;M]q<(]q=(KK�q>KK�q?KK�q@e]qAK K�qBa]qCKK�qDa]qE(KK�qFKK�qGe]qHKK�qIa]qJKK�qKaeh )RqL(KKKKKKu�qMM]qN(]qO(KK�qPKK�qQKK�qRKK�qSe]qTKK�qUa]qVKK�qWa]qX(KK�qYKK�qZKK�q[K K�q\e]q](KK�q^K K�q_e]q`KK�qaa]qbKK�qca]qd(KK�qeKK�qfKK �qgKK�qhe]qiK K�qja]qk(KK�qlKK�qmK K �qneeh )Rqo(KKKKKKKKu�qpuX keywordsqqh )RqrX notqsKsX labelsqt]qu(K X EMPTYqv�qwMN�qxK N�qyKN�qzK N�q{Khs�q|KN�q}KN�q~MN�qMN�q�MN�q�KN�q�KN�q�KN�q�MN�q�KN�q�KN�q�KN�q�KN�q�KN�q�K N�q�KN�q�KN�q�MN�q�K
N�q�eX
number2symbolq�h )Rq�(M X Matcherq�MX Alternativeq�MX Alternativesq�MX Detailsq�MX NegatedUnitq�MX Repeaterq�MX Unitq�uX startq�M X statesq�]q�(]q�(]q�KK�q�a]q�KK�q�a]q�K K�q�ae]q�(]q�(KK�q�K K�q�e]q�(KK�q�K K�q�K K�q�ee]q�(]q�K
K�q�a]q�(K K �q�K K�q�ee]q�(]q�K K�q�a]q�KK�q�a]q�K
K�q�a]q�K K�q�ae]q�(]q�KK�q�a]q�(KK�q�KK�q�KK�q�e]q�KK�q�a]q�(KK�q�K K�q�e]q�K K�q�a]q�KK�q�ae]q�(]q�(KK�q�KK�q�KK�q�e]q�K K�q�a]q�KK�q�a]q�(KK�q�KK�q�e]q�KK�q�a]q�KK�q�ae]q�(]q�(KK�q�KK�q�KK�q�KK�q�e]q�KK�q�a]q�KK�q�a]q�(KK�q�KK�q�KK�q�K K�q�e]q�(KK�q�K K�q�e]q�KK�q�a]q�KK�q�a]q�(KK�q�KK�q�KK �q�KK�q�e]q�K K�q�a]q�(KK�q�KK�q�K K �q�eeeX symbol2labelq�h )Rq�(X Alternativeq�K
X Alternativesq�KX Detailsq�KX NegatedUnitr KX Repeaterr KX Unitr K uX
symbol2numberr h )Rr (h�Mh�Mh�Mh�M h�Mh�Mh�MuX tokensr h )Rr (K KKKKKKKKKKKK KK
KK KKKKKKK KK KK
KKKKKKuu. PatternGrammar.txt 0000644 00000001431 15053244155 0010234 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
# A grammar to describe tree matching patterns.
# Not shown here:
# - 'TOKEN' stands for any token (leaf node)
# - 'any' stands for any node (leaf or interior)
# With 'any' we can still specify the sub-structure.
# The start symbol is 'Matcher'.
Matcher: Alternatives ENDMARKER
Alternatives: Alternative ('|' Alternative)*
Alternative: (Unit | NegatedUnit)+
Unit: [NAME '='] ( STRING [Repeater]
| NAME [Details] [Repeater]
| '(' Alternatives ')' [Repeater]
| '[' Alternatives ']'
)
NegatedUnit: 'not' (STRING | NAME [Details] | '(' Alternatives ')')
Repeater: '*' | '+' | '{' NUMBER [',' NUMBER] '}'
Details: '<' Alternatives '>'
btm_utils.py 0000644 00000023356 15053244155 0007135 0 ustar 00 "Utility functions used by the btm_matcher module"
from . import pytree
from .pgen2 import grammar, token
from .pygram import pattern_symbols, python_symbols
syms = pattern_symbols
pysyms = python_symbols
tokens = grammar.opmap
token_labels = token
TYPE_ANY = -1
TYPE_ALTERNATIVES = -2
TYPE_GROUP = -3
class MinNode(object):
"""This class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatterns"""
def __init__(self, type=None, name=None):
self.type = type
self.name = name
self.children = []
self.leaf = False
self.parent = None
self.alternatives = []
self.group = []
def __repr__(self):
return str(self.type) + ' ' + str(self.name)
def leaf_to_root(self):
"""Internal method. Returns a characteristic path of the
pattern tree. This method must be run for all leaves until the
linear subpatterns are merged into a single"""
node = self
subp = []
while node:
if node.type == TYPE_ALTERNATIVES:
node.alternatives.append(subp)
if len(node.alternatives) == len(node.children):
#last alternative
subp = [tuple(node.alternatives)]
node.alternatives = []
node = node.parent
continue
else:
node = node.parent
subp = None
break
if node.type == TYPE_GROUP:
node.group.append(subp)
#probably should check the number of leaves
if len(node.group) == len(node.children):
subp = get_characteristic_subpattern(node.group)
node.group = []
node = node.parent
continue
else:
node = node.parent
subp = None
break
if node.type == token_labels.NAME and node.name:
#in case of type=name, use the name instead
subp.append(node.name)
else:
subp.append(node.type)
node = node.parent
return subp
def get_linear_subpattern(self):
"""Drives the leaf_to_root method. The reason that
leaf_to_root must be run multiple times is because we need to
reject 'group' matches; for example the alternative form
(a | b c) creates a group [b c] that needs to be matched. Since
matching multiple linear patterns overcomes the automaton's
capabilities, leaf_to_root merges each group into a single
choice based on 'characteristic'ity,
i.e. (a|b c) -> (a|b) if b more characteristic than c
Returns: The most 'characteristic'(as defined by
get_characteristic_subpattern) path for the compiled pattern
tree.
"""
for l in self.leaves():
subp = l.leaf_to_root()
if subp:
return subp
def leaves(self):
"Generator that returns the leaves of the tree"
for child in self.children:
yield from child.leaves()
if not self.children:
yield self
def reduce_tree(node, parent=None):
"""
Internal function. Reduces a compiled pattern tree to an
intermediate representation suitable for feeding the
automaton. This also trims off any optional pattern elements(like
[a], a*).
"""
new_node = None
#switch on the node type
if node.type == syms.Matcher:
#skip
node = node.children[0]
if node.type == syms.Alternatives :
#2 cases
if len(node.children) <= 2:
#just a single 'Alternative', skip this node
new_node = reduce_tree(node.children[0], parent)
else:
#real alternatives
new_node = MinNode(type=TYPE_ALTERNATIVES)
#skip odd children('|' tokens)
for child in node.children:
if node.children.index(child)%2:
continue
reduced = reduce_tree(child, new_node)
if reduced is not None:
new_node.children.append(reduced)
elif node.type == syms.Alternative:
if len(node.children) > 1:
new_node = MinNode(type=TYPE_GROUP)
for child in node.children:
reduced = reduce_tree(child, new_node)
if reduced:
new_node.children.append(reduced)
if not new_node.children:
# delete the group if all of the children were reduced to None
new_node = None
else:
new_node = reduce_tree(node.children[0], parent)
elif node.type == syms.Unit:
if (isinstance(node.children[0], pytree.Leaf) and
node.children[0].value == '('):
#skip parentheses
return reduce_tree(node.children[1], parent)
if ((isinstance(node.children[0], pytree.Leaf) and
node.children[0].value == '[')
or
(len(node.children)>1 and
hasattr(node.children[1], "value") and
node.children[1].value == '[')):
#skip whole unit if its optional
return None
leaf = True
details_node = None
alternatives_node = None
has_repeater = False
repeater_node = None
has_variable_name = False
for child in node.children:
if child.type == syms.Details:
leaf = False
details_node = child
elif child.type == syms.Repeater:
has_repeater = True
repeater_node = child
elif child.type == syms.Alternatives:
alternatives_node = child
if hasattr(child, 'value') and child.value == '=': # variable name
has_variable_name = True
#skip variable name
if has_variable_name:
#skip variable name, '='
name_leaf = node.children[2]
if hasattr(name_leaf, 'value') and name_leaf.value == '(':
# skip parenthesis
name_leaf = node.children[3]
else:
name_leaf = node.children[0]
#set node type
if name_leaf.type == token_labels.NAME:
#(python) non-name or wildcard
if name_leaf.value == 'any':
new_node = MinNode(type=TYPE_ANY)
else:
if hasattr(token_labels, name_leaf.value):
new_node = MinNode(type=getattr(token_labels, name_leaf.value))
else:
new_node = MinNode(type=getattr(pysyms, name_leaf.value))
elif name_leaf.type == token_labels.STRING:
#(python) name or character; remove the apostrophes from
#the string value
name = name_leaf.value.strip("'")
if name in tokens:
new_node = MinNode(type=tokens[name])
else:
new_node = MinNode(type=token_labels.NAME, name=name)
elif name_leaf.type == syms.Alternatives:
new_node = reduce_tree(alternatives_node, parent)
#handle repeaters
if has_repeater:
if repeater_node.children[0].value == '*':
#reduce to None
new_node = None
elif repeater_node.children[0].value == '+':
#reduce to a single occurrence i.e. do nothing
pass
else:
#TODO: handle {min, max} repeaters
raise NotImplementedError
pass
#add children
if details_node and new_node is not None:
for child in details_node.children[1:-1]:
#skip '<', '>' markers
reduced = reduce_tree(child, new_node)
if reduced is not None:
new_node.children.append(reduced)
if new_node:
new_node.parent = parent
return new_node
def get_characteristic_subpattern(subpatterns):
"""Picks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
"""
if not isinstance(subpatterns, list):
return subpatterns
if len(subpatterns)==1:
return subpatterns[0]
# first pick out the ones containing variable names
subpatterns_with_names = []
subpatterns_with_common_names = []
common_names = ['in', 'for', 'if' , 'not', 'None']
subpatterns_with_common_chars = []
common_chars = "[]().,:"
for subpattern in subpatterns:
if any(rec_test(subpattern, lambda x: type(x) is str)):
if any(rec_test(subpattern,
lambda x: isinstance(x, str) and x in common_chars)):
subpatterns_with_common_chars.append(subpattern)
elif any(rec_test(subpattern,
lambda x: isinstance(x, str) and x in common_names)):
subpatterns_with_common_names.append(subpattern)
else:
subpatterns_with_names.append(subpattern)
if subpatterns_with_names:
subpatterns = subpatterns_with_names
elif subpatterns_with_common_names:
subpatterns = subpatterns_with_common_names
elif subpatterns_with_common_chars:
subpatterns = subpatterns_with_common_chars
# of the remaining subpatterns pick out the longest one
return max(subpatterns, key=len)
def rec_test(sequence, test_func):
"""Tests test_func on all items of sequence and items of included
sub-iterables"""
for x in sequence:
if isinstance(x, (list, tuple)):
yield from rec_test(x, test_func)
else:
yield test_func(x)
fixer_util.py 0000644 00000035547 15053244155 0007312 0 ustar 00 """Utility functions, node construction macros, etc."""
# Author: Collin Winter
# Local imports
from .pgen2 import token
from .pytree import Leaf, Node
from .pygram import python_symbols as syms
from . import patcomp
###########################################################
### Common node-construction "macros"
###########################################################
def KeywordArg(keyword, value):
return Node(syms.argument,
[keyword, Leaf(token.EQUAL, "="), value])
def LParen():
return Leaf(token.LPAR, "(")
def RParen():
return Leaf(token.RPAR, ")")
def Assign(target, source):
"""Build an assignment statement"""
if not isinstance(target, list):
target = [target]
if not isinstance(source, list):
source.prefix = " "
source = [source]
return Node(syms.atom,
target + [Leaf(token.EQUAL, "=", prefix=" ")] + source)
def Name(name, prefix=None):
"""Return a NAME leaf"""
return Leaf(token.NAME, name, prefix=prefix)
def Attr(obj, attr):
"""A node tuple for obj.attr"""
return [obj, Node(syms.trailer, [Dot(), attr])]
def Comma():
"""A comma leaf"""
return Leaf(token.COMMA, ",")
def Dot():
"""A period (.) leaf"""
return Leaf(token.DOT, ".")
def ArgList(args, lparen=LParen(), rparen=RParen()):
"""A parenthesised argument list, used by Call()"""
node = Node(syms.trailer, [lparen.clone(), rparen.clone()])
if args:
node.insert_child(1, Node(syms.arglist, args))
return node
def Call(func_name, args=None, prefix=None):
"""A function call"""
node = Node(syms.power, [func_name, ArgList(args)])
if prefix is not None:
node.prefix = prefix
return node
def Newline():
"""A newline literal"""
return Leaf(token.NEWLINE, "\n")
def BlankLine():
"""A blank line"""
return Leaf(token.NEWLINE, "")
def Number(n, prefix=None):
return Leaf(token.NUMBER, n, prefix=prefix)
def Subscript(index_node):
"""A numeric or string subscript"""
return Node(syms.trailer, [Leaf(token.LBRACE, "["),
index_node,
Leaf(token.RBRACE, "]")])
def String(string, prefix=None):
"""A string leaf"""
return Leaf(token.STRING, string, prefix=prefix)
def ListComp(xp, fp, it, test=None):
"""A list comprehension of the form [xp for fp in it if test].
If test is None, the "if test" part is omitted.
"""
xp.prefix = ""
fp.prefix = " "
it.prefix = " "
for_leaf = Leaf(token.NAME, "for")
for_leaf.prefix = " "
in_leaf = Leaf(token.NAME, "in")
in_leaf.prefix = " "
inner_args = [for_leaf, fp, in_leaf, it]
if test:
test.prefix = " "
if_leaf = Leaf(token.NAME, "if")
if_leaf.prefix = " "
inner_args.append(Node(syms.comp_if, [if_leaf, test]))
inner = Node(syms.listmaker, [xp, Node(syms.comp_for, inner_args)])
return Node(syms.atom,
[Leaf(token.LBRACE, "["),
inner,
Leaf(token.RBRACE, "]")])
def FromImport(package_name, name_leafs):
""" Return an import statement in the form:
from package import name_leafs"""
# XXX: May not handle dotted imports properly (eg, package_name='foo.bar')
#assert package_name == '.' or '.' not in package_name, "FromImport has "\
# "not been tested with dotted package names -- use at your own "\
# "peril!"
for leaf in name_leafs:
# Pull the leaves out of their old tree
leaf.remove()
children = [Leaf(token.NAME, "from"),
Leaf(token.NAME, package_name, prefix=" "),
Leaf(token.NAME, "import", prefix=" "),
Node(syms.import_as_names, name_leafs)]
imp = Node(syms.import_from, children)
return imp
def ImportAndCall(node, results, names):
"""Returns an import statement and calls a method
of the module:
import module
module.name()"""
obj = results["obj"].clone()
if obj.type == syms.arglist:
newarglist = obj.clone()
else:
newarglist = Node(syms.arglist, [obj.clone()])
after = results["after"]
if after:
after = [n.clone() for n in after]
new = Node(syms.power,
Attr(Name(names[0]), Name(names[1])) +
[Node(syms.trailer,
[results["lpar"].clone(),
newarglist,
results["rpar"].clone()])] + after)
new.prefix = node.prefix
return new
###########################################################
### Determine whether a node represents a given literal
###########################################################
def is_tuple(node):
"""Does the node represent a tuple literal?"""
if isinstance(node, Node) and node.children == [LParen(), RParen()]:
return True
return (isinstance(node, Node)
and len(node.children) == 3
and isinstance(node.children[0], Leaf)
and isinstance(node.children[1], Node)
and isinstance(node.children[2], Leaf)
and node.children[0].value == "("
and node.children[2].value == ")")
def is_list(node):
"""Does the node represent a list literal?"""
return (isinstance(node, Node)
and len(node.children) > 1
and isinstance(node.children[0], Leaf)
and isinstance(node.children[-1], Leaf)
and node.children[0].value == "["
and node.children[-1].value == "]")
###########################################################
### Misc
###########################################################
def parenthesize(node):
return Node(syms.atom, [LParen(), node, RParen()])
consuming_calls = {"sorted", "list", "set", "any", "all", "tuple", "sum",
"min", "max", "enumerate"}
def attr_chain(obj, attr):
"""Follow an attribute chain.
If you have a chain of objects where a.foo -> b, b.foo-> c, etc,
use this to iterate over all objects in the chain. Iteration is
terminated by getattr(x, attr) is None.
Args:
obj: the starting object
attr: the name of the chaining attribute
Yields:
Each successive object in the chain.
"""
next = getattr(obj, attr)
while next:
yield next
next = getattr(next, attr)
p0 = """for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
"""
p1 = """
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
"""
p2 = """
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
"""
pats_built = False
def in_special_context(node):
""" Returns true if node is in an environment where all that is required
of it is being iterable (ie, it doesn't matter if it returns a list
or an iterator).
See test_map_nochange in test_fixers.py for some examples and tests.
"""
global p0, p1, p2, pats_built
if not pats_built:
p0 = patcomp.compile_pattern(p0)
p1 = patcomp.compile_pattern(p1)
p2 = patcomp.compile_pattern(p2)
pats_built = True
patterns = [p0, p1, p2]
for pattern, parent in zip(patterns, attr_chain(node, "parent")):
results = {}
if pattern.match(parent, results) and results["node"] is node:
return True
return False
def is_probably_builtin(node):
"""
Check that something isn't an attribute or function name etc.
"""
prev = node.prev_sibling
if prev is not None and prev.type == token.DOT:
# Attribute lookup.
return False
parent = node.parent
if parent.type in (syms.funcdef, syms.classdef):
return False
if parent.type == syms.expr_stmt and parent.children[0] is node:
# Assignment.
return False
if parent.type == syms.parameters or \
(parent.type == syms.typedargslist and (
(prev is not None and prev.type == token.COMMA) or
parent.children[0] is node
)):
# The name of an argument.
return False
return True
def find_indentation(node):
"""Find the indentation of *node*."""
while node is not None:
if node.type == syms.suite and len(node.children) > 2:
indent = node.children[1]
if indent.type == token.INDENT:
return indent.value
node = node.parent
return ""
###########################################################
### The following functions are to find bindings in a suite
###########################################################
def make_suite(node):
if node.type == syms.suite:
return node
node = node.clone()
parent, node.parent = node.parent, None
suite = Node(syms.suite, [node])
suite.parent = parent
return suite
def find_root(node):
"""Find the top level namespace."""
# Scamper up to the top level namespace
while node.type != syms.file_input:
node = node.parent
if not node:
raise ValueError("root found before file_input node was found.")
return node
def does_tree_import(package, name, node):
""" Returns true if name is imported from package at the
top level of the tree which node belongs to.
To cover the case of an import like 'import foo', use
None for the package and 'foo' for the name. """
binding = find_binding(name, find_root(node), package)
return bool(binding)
def is_import(node):
"""Returns true if the node is an import statement."""
return node.type in (syms.import_name, syms.import_from)
def touch_import(package, name, node):
""" Works like `does_tree_import` but adds an import statement
if it was not imported. """
def is_import_stmt(node):
return (node.type == syms.simple_stmt and node.children and
is_import(node.children[0]))
root = find_root(node)
if does_tree_import(package, name, root):
return
# figure out where to insert the new import. First try to find
# the first import and then skip to the last one.
insert_pos = offset = 0
for idx, node in enumerate(root.children):
if not is_import_stmt(node):
continue
for offset, node2 in enumerate(root.children[idx:]):
if not is_import_stmt(node2):
break
insert_pos = idx + offset
break
# if there are no imports where we can insert, find the docstring.
# if that also fails, we stick to the beginning of the file
if insert_pos == 0:
for idx, node in enumerate(root.children):
if (node.type == syms.simple_stmt and node.children and
node.children[0].type == token.STRING):
insert_pos = idx + 1
break
if package is None:
import_ = Node(syms.import_name, [
Leaf(token.NAME, "import"),
Leaf(token.NAME, name, prefix=" ")
])
else:
import_ = FromImport(package, [Leaf(token.NAME, name, prefix=" ")])
children = [import_, Newline()]
root.insert_child(insert_pos, Node(syms.simple_stmt, children))
_def_syms = {syms.classdef, syms.funcdef}
def find_binding(name, node, package=None):
""" Returns the node which binds variable name, otherwise None.
If optional argument package is supplied, only imports will
be returned.
See test cases for examples."""
for child in node.children:
ret = None
if child.type == syms.for_stmt:
if _find(name, child.children[1]):
return child
n = find_binding(name, make_suite(child.children[-1]), package)
if n: ret = n
elif child.type in (syms.if_stmt, syms.while_stmt):
n = find_binding(name, make_suite(child.children[-1]), package)
if n: ret = n
elif child.type == syms.try_stmt:
n = find_binding(name, make_suite(child.children[2]), package)
if n:
ret = n
else:
for i, kid in enumerate(child.children[3:]):
if kid.type == token.COLON and kid.value == ":":
# i+3 is the colon, i+4 is the suite
n = find_binding(name, make_suite(child.children[i+4]), package)
if n: ret = n
elif child.type in _def_syms and child.children[1].value == name:
ret = child
elif _is_import_binding(child, name, package):
ret = child
elif child.type == syms.simple_stmt:
ret = find_binding(name, child, package)
elif child.type == syms.expr_stmt:
if _find(name, child.children[0]):
ret = child
if ret:
if not package:
return ret
if is_import(ret):
return ret
return None
_block_syms = {syms.funcdef, syms.classdef, syms.trailer}
def _find(name, node):
nodes = [node]
while nodes:
node = nodes.pop()
if node.type > 256 and node.type not in _block_syms:
nodes.extend(node.children)
elif node.type == token.NAME and node.value == name:
return node
return None
def _is_import_binding(node, name, package=None):
""" Will reuturn node if node will import name, or node
will import * from package. None is returned otherwise.
See test cases for examples. """
if node.type == syms.import_name and not package:
imp = node.children[1]
if imp.type == syms.dotted_as_names:
for child in imp.children:
if child.type == syms.dotted_as_name:
if child.children[2].value == name:
return node
elif child.type == token.NAME and child.value == name:
return node
elif imp.type == syms.dotted_as_name:
last = imp.children[-1]
if last.type == token.NAME and last.value == name:
return node
elif imp.type == token.NAME and imp.value == name:
return node
elif node.type == syms.import_from:
# str(...) is used to make life easier here, because
# from a.b import parses to ['import', ['a', '.', 'b'], ...]
if package and str(node.children[1]).strip() != package:
return None
n = node.children[3]
if package and _find("as", n):
# See test_from_import_as for explanation
return None
elif n.type == syms.import_as_names and _find(name, n):
return node
elif n.type == syms.import_as_name:
child = n.children[2]
if child.type == token.NAME and child.value == name:
return node
elif n.type == token.NAME and n.value == name:
return node
elif package and n.type == token.STAR:
return node
return None
fixes/fix_isinstance.py 0000644 00000003110 15053244155 0011241 0 ustar 00 # Copyright 2008 Armin Ronacher.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
"""
from .. import fixer_base
from ..fixer_util import token
class FixIsinstance(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
"""
run_order = 6
def transform(self, node, results):
names_inserted = set()
testlist = results["args"]
args = testlist.children
new_args = []
iterator = enumerate(args)
for idx, arg in iterator:
if arg.type == token.NAME and arg.value in names_inserted:
if idx < len(args) - 1 and args[idx + 1].type == token.COMMA:
next(iterator)
continue
else:
new_args.append(arg)
if arg.type == token.NAME:
names_inserted.add(arg.value)
if new_args and new_args[-1].type == token.COMMA:
del new_args[-1]
if len(new_args) == 1:
atom = testlist.parent
new_args[0].prefix = atom.prefix
atom.replace(new_args[0])
else:
args[:] = new_args
node.changed()
fixes/fix_nonzero.py 0000644 00000001117 15053244155 0010600 0 ustar 00 """Fixer for __nonzero__ -> __bool__ methods."""
# Author: Collin Winter
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixNonzero(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
"""
def transform(self, node, results):
name = results["name"]
new = Name("__bool__", prefix=name.prefix)
name.replace(new)
fixes/fix_idioms.py 0000644 00000011414 15053244155 0010373 0 ustar 00 """Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
"""
# Author: Jacques Frechet, Collin Winter
# Local imports
from .. import fixer_base
from ..fixer_util import Call, Comma, Name, Node, BlankLine, syms
CMP = "(n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)"
TYPE = "power< 'type' trailer< '(' x=any ')' > >"
class FixIdioms(fixer_base.BaseFix):
explicit = True # The user must ask for this fixer
PATTERN = r"""
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
""" % (TYPE, CMP, CMP, TYPE)
def match(self, node):
r = super(FixIdioms, self).match(node)
# If we've matched one of the sort/sorted subpatterns above, we
# want to reject matches where the initial assignment and the
# subsequent .sort() call involve different identifiers.
if r and "sorted" in r:
if r["id1"] == r["id2"]:
return r
return None
return r
def transform(self, node, results):
if "isinstance" in results:
return self.transform_isinstance(node, results)
elif "while" in results:
return self.transform_while(node, results)
elif "sorted" in results:
return self.transform_sort(node, results)
else:
raise RuntimeError("Invalid match")
def transform_isinstance(self, node, results):
x = results["x"].clone() # The thing inside of type()
T = results["T"].clone() # The type being compared against
x.prefix = ""
T.prefix = " "
test = Call(Name("isinstance"), [x, Comma(), T])
if "n" in results:
test.prefix = " "
test = Node(syms.not_test, [Name("not"), test])
test.prefix = node.prefix
return test
def transform_while(self, node, results):
one = results["while"]
one.replace(Name("True", prefix=one.prefix))
def transform_sort(self, node, results):
sort_stmt = results["sort"]
next_stmt = results["next"]
list_call = results.get("list")
simple_expr = results.get("expr")
if list_call:
list_call.replace(Name("sorted", prefix=list_call.prefix))
elif simple_expr:
new = simple_expr.clone()
new.prefix = ""
simple_expr.replace(Call(Name("sorted"), [new],
prefix=simple_expr.prefix))
else:
raise RuntimeError("should not have reached here")
sort_stmt.remove()
btwn = sort_stmt.prefix
# Keep any prefix lines between the sort_stmt and the list_call and
# shove them right after the sorted() call.
if "\n" in btwn:
if next_stmt:
# The new prefix should be everything from the sort_stmt's
# prefix up to the last newline, then the old prefix after a new
# line.
prefix_lines = (btwn.rpartition("\n")[0], next_stmt[0].prefix)
next_stmt[0].prefix = "\n".join(prefix_lines)
else:
assert list_call.parent
assert list_call.next_sibling is None
# Put a blank line after list_call and set its prefix.
end_line = BlankLine()
list_call.parent.append_child(end_line)
assert list_call.next_sibling is end_line
# The new prefix should be everything up to the first new line
# of sort_stmt's prefix.
end_line.prefix = btwn.rpartition("\n")[0]
fixes/fix_set_literal.py 0000644 00000003241 15053244155 0011415 0 ustar 00 """
Optional fixer to transform set() calls to set literals.
"""
# Author: Benjamin Peterson
from lib2to3 import fixer_base, pytree
from lib2to3.fixer_util import token, syms
class FixSetLiteral(fixer_base.BaseFix):
BM_compatible = True
explicit = True
PATTERN = """power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
"""
def transform(self, node, results):
single = results.get("single")
if single:
# Make a fake listmaker
fake = pytree.Node(syms.listmaker, [single.clone()])
single.replace(fake)
items = fake
else:
items = results["items"]
# Build the contents of the literal
literal = [pytree.Leaf(token.LBRACE, "{")]
literal.extend(n.clone() for n in items.children)
literal.append(pytree.Leaf(token.RBRACE, "}"))
# Set the prefix of the right brace to that of the ')' or ']'
literal[-1].prefix = items.next_sibling.prefix
maker = pytree.Node(syms.dictsetmaker, literal)
maker.prefix = node.prefix
# If the original was a one tuple, we need to remove the extra comma.
if len(maker.children) == 4:
n = maker.children[2]
n.remove()
maker.children[-1].prefix = n.prefix
# Finally, replace the set call with our shiny new literal.
return maker
fixes/fix_buffer.py 0000644 00000001116 15053244155 0010356 0 ustar 00 # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that changes buffer(...) into memoryview(...)."""
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixBuffer(fixer_base.BaseFix):
BM_compatible = True
explicit = True # The user must ask for this fixer
PATTERN = """
power< name='buffer' trailer< '(' [any] ')' > any* >
"""
def transform(self, node, results):
name = results["name"]
name.replace(Name("memoryview", prefix=name.prefix))
fixes/fix_sys_exc.py 0000644 00000002012 15053244155 0010556 0 ustar 00 """Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
"""
# By Jeff Balogh and Benjamin Peterson
# Local imports
from .. import fixer_base
from ..fixer_util import Attr, Call, Name, Number, Subscript, Node, syms
class FixSysExc(fixer_base.BaseFix):
# This order matches the ordering of sys.exc_info().
exc_info = ["exc_type", "exc_value", "exc_traceback"]
BM_compatible = True
PATTERN = """
power< 'sys' trailer< dot='.' attribute=(%s) > >
""" % '|'.join("'%s'" % e for e in exc_info)
def transform(self, node, results):
sys_attr = results["attribute"][0]
index = Number(self.exc_info.index(sys_attr.value))
call = Call(Name("exc_info"), prefix=sys_attr.prefix)
attr = Attr(Name("sys"), call)
attr[1].children[0].prefix = results["dot"].prefix
attr.append(Subscript(index))
return Node(syms.power, attr, prefix=node.prefix)
fixes/fix_unicode.py 0000644 00000002350 15053244155 0010534 0 ustar 00 r"""Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
"""
from ..pgen2 import token
from .. import fixer_base
_mapping = {"unichr" : "chr", "unicode" : "str"}
class FixUnicode(fixer_base.BaseFix):
BM_compatible = True
PATTERN = "STRING | 'unicode' | 'unichr'"
def start_tree(self, tree, filename):
super(FixUnicode, self).start_tree(tree, filename)
self.unicode_literals = 'unicode_literals' in tree.future_features
def transform(self, node, results):
if node.type == token.NAME:
new = node.clone()
new.value = _mapping[node.value]
return new
elif node.type == token.STRING:
val = node.value
if not self.unicode_literals and val[0] in '\'"' and '\\' in val:
val = r'\\'.join([
v.replace('\\u', r'\\u').replace('\\U', r'\\U')
for v in val.split(r'\\')
])
if val[0] in 'uU':
val = val[1:]
if val == node.value:
return node
new = node.clone()
new.value = val
return new
fixes/fix_imports.py 0000644 00000013064 15053244155 0010607 0 ustar 00 """Fix incompatible imports and module references."""
# Authors: Collin Winter, Nick Edds
# Local imports
from .. import fixer_base
from ..fixer_util import Name, attr_chain
MAPPING = {'StringIO': 'io',
'cStringIO': 'io',
'cPickle': 'pickle',
'__builtin__' : 'builtins',
'copy_reg': 'copyreg',
'Queue': 'queue',
'SocketServer': 'socketserver',
'ConfigParser': 'configparser',
'repr': 'reprlib',
'FileDialog': 'tkinter.filedialog',
'tkFileDialog': 'tkinter.filedialog',
'SimpleDialog': 'tkinter.simpledialog',
'tkSimpleDialog': 'tkinter.simpledialog',
'tkColorChooser': 'tkinter.colorchooser',
'tkCommonDialog': 'tkinter.commondialog',
'Dialog': 'tkinter.dialog',
'Tkdnd': 'tkinter.dnd',
'tkFont': 'tkinter.font',
'tkMessageBox': 'tkinter.messagebox',
'ScrolledText': 'tkinter.scrolledtext',
'Tkconstants': 'tkinter.constants',
'Tix': 'tkinter.tix',
'ttk': 'tkinter.ttk',
'Tkinter': 'tkinter',
'markupbase': '_markupbase',
'_winreg': 'winreg',
'thread': '_thread',
'dummy_thread': '_dummy_thread',
# anydbm and whichdb are handled by fix_imports2
'dbhash': 'dbm.bsd',
'dumbdbm': 'dbm.dumb',
'dbm': 'dbm.ndbm',
'gdbm': 'dbm.gnu',
'xmlrpclib': 'xmlrpc.client',
'DocXMLRPCServer': 'xmlrpc.server',
'SimpleXMLRPCServer': 'xmlrpc.server',
'httplib': 'http.client',
'htmlentitydefs' : 'html.entities',
'HTMLParser' : 'html.parser',
'Cookie': 'http.cookies',
'cookielib': 'http.cookiejar',
'BaseHTTPServer': 'http.server',
'SimpleHTTPServer': 'http.server',
'CGIHTTPServer': 'http.server',
#'test.test_support': 'test.support',
'commands': 'subprocess',
'UserString' : 'collections',
'UserList' : 'collections',
'urlparse' : 'urllib.parse',
'robotparser' : 'urllib.robotparser',
}
def alternates(members):
return "(" + "|".join(map(repr, members)) + ")"
def build_pattern(mapping=MAPPING):
mod_list = ' | '.join(["module_name='%s'" % key for key in mapping])
bare_names = alternates(mapping.keys())
yield """name_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
""" % (mod_list, mod_list)
yield """import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
""" % mod_list
yield """import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
""" % (mod_list, mod_list)
# Find usages of module members in code e.g. thread.foo(bar)
yield "power< bare_with_attr=(%s) trailer<'.' any > any* >" % bare_names
class FixImports(fixer_base.BaseFix):
BM_compatible = True
keep_line_order = True
# This is overridden in fix_imports2.
mapping = MAPPING
# We want to run this fixer late, so fix_import doesn't try to make stdlib
# renames into relative imports.
run_order = 6
def build_pattern(self):
return "|".join(build_pattern(self.mapping))
def compile_pattern(self):
# We override this, so MAPPING can be pragmatically altered and the
# changes will be reflected in PATTERN.
self.PATTERN = self.build_pattern()
super(FixImports, self).compile_pattern()
# Don't match the node if it's within another match.
def match(self, node):
match = super(FixImports, self).match
results = match(node)
if results:
# Module usage could be in the trailer of an attribute lookup, so we
# might have nested matches when "bare_with_attr" is present.
if "bare_with_attr" not in results and \
any(match(obj) for obj in attr_chain(node, "parent")):
return False
return results
return False
def start_tree(self, tree, filename):
super(FixImports, self).start_tree(tree, filename)
self.replace = {}
def transform(self, node, results):
import_mod = results.get("module_name")
if import_mod:
mod_name = import_mod.value
new_name = self.mapping[mod_name]
import_mod.replace(Name(new_name, prefix=import_mod.prefix))
if "name_import" in results:
# If it's not a "from x import x, y" or "import x as y" import,
# marked its usage to be replaced.
self.replace[mod_name] = new_name
if "multiple_imports" in results:
# This is a nasty hack to fix multiple imports on a line (e.g.,
# "import StringIO, urlparse"). The problem is that I can't
# figure out an easy way to make a pattern recognize the keys of
# MAPPING randomly sprinkled in an import statement.
results = self.match(node)
if results:
self.transform(node, results)
else:
# Replace usage of the module.
bare_name = results["bare_with_attr"][0]
new_name = self.replace.get(bare_name.value)
if new_name:
bare_name.replace(Name(new_name, prefix=bare_name.prefix))
fixes/fix_asserts.py 0000644 00000001730 15053244155 0010573 0 ustar 00 """Fixer that replaces deprecated unittest method names."""
# Author: Ezio Melotti
from ..fixer_base import BaseFix
from ..fixer_util import Name
NAMES = dict(
assert_="assertTrue",
assertEquals="assertEqual",
assertNotEquals="assertNotEqual",
assertAlmostEquals="assertAlmostEqual",
assertNotAlmostEquals="assertNotAlmostEqual",
assertRegexpMatches="assertRegex",
assertRaisesRegexp="assertRaisesRegex",
failUnlessEqual="assertEqual",
failIfEqual="assertNotEqual",
failUnlessAlmostEqual="assertAlmostEqual",
failIfAlmostEqual="assertNotAlmostEqual",
failUnless="assertTrue",
failUnlessRaises="assertRaises",
failIf="assertFalse",
)
class FixAsserts(BaseFix):
PATTERN = """
power< any+ trailer< '.' meth=(%s)> any* >
""" % '|'.join(map(repr, NAMES))
def transform(self, node, results):
name = results["meth"][0]
name.replace(Name(NAMES[str(name)], prefix=name.prefix))
fixes/fix_itertools.py 0000644 00000003014 15053244155 0011130 0 ustar 00 """ Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
"""
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixItertools(fixer_base.BaseFix):
BM_compatible = True
it_funcs = "('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')"
PATTERN = """
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
""" %(locals())
# Needs to be run after fix_(map|zip|filter)
run_order = 6
def transform(self, node, results):
prefix = None
func = results['func'][0]
if ('it' in results and
func.value not in ('ifilterfalse', 'izip_longest')):
dot, it = (results['dot'], results['it'])
# Remove the 'itertools'
prefix = it.prefix
it.remove()
# Replace the node which contains ('.', 'function') with the
# function (to be consistent with the second part of the pattern)
dot.remove()
func.parent.replace(func)
prefix = prefix or func.prefix
func.replace(Name(func.value[1:], prefix=prefix))
fixes/fix_funcattrs.py 0000644 00000001204 15053244155 0011114 0 ustar 00 """Fix function attribute names (f.func_x -> f.__x__)."""
# Author: Collin Winter
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixFuncattrs(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
"""
def transform(self, node, results):
attr = results["attr"][0]
attr.replace(Name(("__%s__" % attr.value[5:]),
prefix=attr.prefix))
fixes/fix_future.py 0000644 00000001043 15053244155 0010416 0 ustar 00 """Remove __future__ imports
from __future__ import foo is replaced with an empty line.
"""
# Author: Christian Heimes
# Local imports
from .. import fixer_base
from ..fixer_util import BlankLine
class FixFuture(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """import_from< 'from' module_name="__future__" 'import' any >"""
# This should be run last -- some things check for the import
run_order = 10
def transform(self, node, results):
new = BlankLine()
new.prefix = node.prefix
return new
fixes/fix_methodattrs.py 0000644 00000001136 15053244155 0011445 0 ustar 00 """Fix bound method attributes (method.im_? -> method.__?__).
"""
# Author: Christian Heimes
# Local imports
from .. import fixer_base
from ..fixer_util import Name
MAP = {
"im_func" : "__func__",
"im_self" : "__self__",
"im_class" : "__self__.__class__"
}
class FixMethodattrs(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
"""
def transform(self, node, results):
attr = results["attr"][0]
new = MAP[attr.value]
attr.replace(Name(new, prefix=attr.prefix))
fixes/fix_has_key.py 0000644 00000006174 15053244155 0010541 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for has_key().
Calls to .has_key() methods are expressed in terms of the 'in'
operator:
d.has_key(k) -> k in d
CAVEATS:
1) While the primary target of this fixer is dict.has_key(), the
fixer will change any has_key() method call, regardless of its
class.
2) Cases like this will not be converted:
m = d.has_key
if m(k):
...
Only *calls* to has_key() are converted. While it is possible to
convert the above to something like
m = d.__contains__
if m(k):
...
this is currently not done.
"""
# Local imports
from .. import pytree
from .. import fixer_base
from ..fixer_util import Name, parenthesize
class FixHasKey(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
"""
def transform(self, node, results):
assert results
syms = self.syms
if (node.parent.type == syms.not_test and
self.pattern.match(node.parent)):
# Don't transform a node matching the first alternative of the
# pattern when its parent matches the second alternative
return None
negation = results.get("negation")
anchor = results["anchor"]
prefix = node.prefix
before = [n.clone() for n in results["before"]]
arg = results["arg"].clone()
after = results.get("after")
if after:
after = [n.clone() for n in after]
if arg.type in (syms.comparison, syms.not_test, syms.and_test,
syms.or_test, syms.test, syms.lambdef, syms.argument):
arg = parenthesize(arg)
if len(before) == 1:
before = before[0]
else:
before = pytree.Node(syms.power, before)
before.prefix = " "
n_op = Name("in", prefix=" ")
if negation:
n_not = Name("not", prefix=" ")
n_op = pytree.Node(syms.comp_op, (n_not, n_op))
new = pytree.Node(syms.comparison, (arg, n_op, before))
if after:
new = parenthesize(new)
new = pytree.Node(syms.power, (new,) + tuple(after))
if node.parent.type in (syms.comparison, syms.expr, syms.xor_expr,
syms.and_expr, syms.shift_expr,
syms.arith_expr, syms.term,
syms.factor, syms.power):
new = parenthesize(new)
new.prefix = prefix
return new
fixes/fix_standarderror.py 0000644 00000000701 15053244155 0011756 0 ustar 00 # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for StandardError -> Exception."""
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixStandarderror(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
'StandardError'
"""
def transform(self, node, results):
return Name("Exception", prefix=node.prefix)
fixes/fix_urllib.py 0000644 00000020241 15053244155 0010376 0 ustar 00 """Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
"""
# Author: Nick Edds
# Local imports
from lib2to3.fixes.fix_imports import alternates, FixImports
from lib2to3.fixer_util import (Name, Comma, FromImport, Newline,
find_indentation, Node, syms)
MAPPING = {"urllib": [
("urllib.request",
["URLopener", "FancyURLopener", "urlretrieve",
"_urlopener", "urlopen", "urlcleanup",
"pathname2url", "url2pathname"]),
("urllib.parse",
["quote", "quote_plus", "unquote", "unquote_plus",
"urlencode", "splitattr", "splithost", "splitnport",
"splitpasswd", "splitport", "splitquery", "splittag",
"splittype", "splituser", "splitvalue", ]),
("urllib.error",
["ContentTooShortError"])],
"urllib2" : [
("urllib.request",
["urlopen", "install_opener", "build_opener",
"Request", "OpenerDirector", "BaseHandler",
"HTTPDefaultErrorHandler", "HTTPRedirectHandler",
"HTTPCookieProcessor", "ProxyHandler",
"HTTPPasswordMgr",
"HTTPPasswordMgrWithDefaultRealm",
"AbstractBasicAuthHandler",
"HTTPBasicAuthHandler", "ProxyBasicAuthHandler",
"AbstractDigestAuthHandler",
"HTTPDigestAuthHandler", "ProxyDigestAuthHandler",
"HTTPHandler", "HTTPSHandler", "FileHandler",
"FTPHandler", "CacheFTPHandler",
"UnknownHandler"]),
("urllib.error",
["URLError", "HTTPError"]),
]
}
# Duplicate the url parsing functions for urllib2.
MAPPING["urllib2"].append(MAPPING["urllib"][1])
def build_pattern():
bare = set()
for old_module, changes in MAPPING.items():
for change in changes:
new_module, members = change
members = alternates(members)
yield """import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
""" % (old_module, old_module)
yield """import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
""" % (old_module, members, members)
yield """import_from< 'from' module_star=%r 'import' star='*' >
""" % old_module
yield """import_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
""" % old_module
# bare_with_attr has a special significance for FixImports.match().
yield """power< bare_with_attr=%r trailer< '.' member=%s > any* >
""" % (old_module, members)
class FixUrllib(FixImports):
def build_pattern(self):
return "|".join(build_pattern())
def transform_import(self, node, results):
"""Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
"""
import_mod = results.get("module")
pref = import_mod.prefix
names = []
# create a Node list of the replacement modules
for name in MAPPING[import_mod.value][:-1]:
names.extend([Name(name[0], prefix=pref), Comma()])
names.append(Name(MAPPING[import_mod.value][-1][0], prefix=pref))
import_mod.replace(names)
def transform_member(self, node, results):
"""Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
"""
mod_member = results.get("mod_member")
pref = mod_member.prefix
member = results.get("member")
# Simple case with only a single member being imported
if member:
# this may be a list of length one, or just a node
if isinstance(member, list):
member = member[0]
new_name = None
for change in MAPPING[mod_member.value]:
if member.value in change[1]:
new_name = change[0]
break
if new_name:
mod_member.replace(Name(new_name, prefix=pref))
else:
self.cannot_convert(node, "This is an invalid module element")
# Multiple members being imported
else:
# a dictionary for replacements, order matters
modules = []
mod_dict = {}
members = results["members"]
for member in members:
# we only care about the actual members
if member.type == syms.import_as_name:
as_name = member.children[2].value
member_name = member.children[0].value
else:
member_name = member.value
as_name = None
if member_name != ",":
for change in MAPPING[mod_member.value]:
if member_name in change[1]:
if change[0] not in mod_dict:
modules.append(change[0])
mod_dict.setdefault(change[0], []).append(member)
new_nodes = []
indentation = find_indentation(node)
first = True
def handle_name(name, prefix):
if name.type == syms.import_as_name:
kids = [Name(name.children[0].value, prefix=prefix),
name.children[1].clone(),
name.children[2].clone()]
return [Node(syms.import_as_name, kids)]
return [Name(name.value, prefix=prefix)]
for module in modules:
elts = mod_dict[module]
names = []
for elt in elts[:-1]:
names.extend(handle_name(elt, pref))
names.append(Comma())
names.extend(handle_name(elts[-1], pref))
new = FromImport(module, names)
if not first or node.parent.prefix.endswith(indentation):
new.prefix = indentation
new_nodes.append(new)
first = False
if new_nodes:
nodes = []
for new_node in new_nodes[:-1]:
nodes.extend([new_node, Newline()])
nodes.append(new_nodes[-1])
node.replace(nodes)
else:
self.cannot_convert(node, "All module elements are invalid")
def transform_dot(self, node, results):
"""Transform for calls to module members in code."""
module_dot = results.get("bare_with_attr")
member = results.get("member")
new_name = None
if isinstance(member, list):
member = member[0]
for change in MAPPING[module_dot.value]:
if member.value in change[1]:
new_name = change[0]
break
if new_name:
module_dot.replace(Name(new_name,
prefix=module_dot.prefix))
else:
self.cannot_convert(node, "This is an invalid module element")
def transform(self, node, results):
if results.get("module"):
self.transform_import(node, results)
elif results.get("mod_member"):
self.transform_member(node, results)
elif results.get("bare_with_attr"):
self.transform_dot(node, results)
# Renaming and star imports are not supported for these modules.
elif results.get("module_star"):
self.cannot_convert(node, "Cannot handle star imports.")
elif results.get("module_as"):
self.cannot_convert(node, "This module is now multiple modules")
fixes/fix_paren.py 0000644 00000002313 15053244155 0010212 0 ustar 00 """Fixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``."""
# By Taek Joo Kim and Benjamin Peterson
# Local imports
from .. import fixer_base
from ..fixer_util import LParen, RParen
# XXX This doesn't support nested for loops like [x for x in 1, 2 for x in 1, 2]
class FixParen(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
"""
def transform(self, node, results):
target = results["target"]
lparen = LParen()
lparen.prefix = target.prefix
target.prefix = "" # Make it hug the parentheses
target.insert_child(0, lparen)
target.append_child(RParen())
fixes/fix_raw_input.py 0000644 00000000706 15053244155 0011121 0 ustar 00 """Fixer that changes raw_input(...) into input(...)."""
# Author: Andre Roberge
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixRawInput(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< name='raw_input' trailer< '(' [any] ')' > any* >
"""
def transform(self, node, results):
name = results["name"]
name.replace(Name("input", prefix=name.prefix))
fixes/fix_imports2.py 0000644 00000000441 15053244155 0010664 0 ustar 00 """Fix incompatible imports and module references that must be fixed after
fix_imports."""
from . import fix_imports
MAPPING = {
'whichdb': 'dbm',
'anydbm': 'dbm',
}
class FixImports2(fix_imports.FixImports):
run_order = 7
mapping = MAPPING
fixes/fix_ne.py 0000644 00000001073 15053244155 0007511 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that turns <> into !=."""
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
class FixNe(fixer_base.BaseFix):
# This is so simple that we don't need the pattern compiler.
_accept_type = token.NOTEQUAL
def match(self, node):
# Override
return node.value == "<>"
def transform(self, node, results):
new = pytree.Leaf(token.NOTEQUAL, "!=", prefix=node.prefix)
return new
fixes/fix_reduce.py 0000644 00000001505 15053244155 0010356 0 ustar 00 # Copyright 2008 Armin Ronacher.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
"""
from lib2to3 import fixer_base
from lib2to3.fixer_util import touch_import
class FixReduce(fixer_base.BaseFix):
BM_compatible = True
order = "pre"
PATTERN = """
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
"""
def transform(self, node, results):
touch_import('functools', 'reduce', node)
fixes/fix_tuple_params.py 0000644 00000012675 15053244155 0011615 0 ustar 00 """Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
"""
# Author: Collin Winter
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Assign, Name, Newline, Number, Subscript, syms
def is_docstring(stmt):
return isinstance(stmt, pytree.Node) and \
stmt.children[0].type == token.STRING
class FixTupleParams(fixer_base.BaseFix):
run_order = 4 #use a lower order since lambda is part of other
#patterns
BM_compatible = True
PATTERN = """
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
"""
def transform(self, node, results):
if "lambda" in results:
return self.transform_lambda(node, results)
new_lines = []
suite = results["suite"]
args = results["args"]
# This crap is so "def foo(...): x = 5; y = 7" is handled correctly.
# TODO(cwinter): suite-cleanup
if suite[0].children[1].type == token.INDENT:
start = 2
indent = suite[0].children[1].value
end = Newline()
else:
start = 0
indent = "; "
end = pytree.Leaf(token.INDENT, "")
# We need access to self for new_name(), and making this a method
# doesn't feel right. Closing over self and new_lines makes the
# code below cleaner.
def handle_tuple(tuple_arg, add_prefix=False):
n = Name(self.new_name())
arg = tuple_arg.clone()
arg.prefix = ""
stmt = Assign(arg, n.clone())
if add_prefix:
n.prefix = " "
tuple_arg.replace(n)
new_lines.append(pytree.Node(syms.simple_stmt,
[stmt, end.clone()]))
if args.type == syms.tfpdef:
handle_tuple(args)
elif args.type == syms.typedargslist:
for i, arg in enumerate(args.children):
if arg.type == syms.tfpdef:
# Without add_prefix, the emitted code is correct,
# just ugly.
handle_tuple(arg, add_prefix=(i > 0))
if not new_lines:
return
# This isn't strictly necessary, but it plays nicely with other fixers.
# TODO(cwinter) get rid of this when children becomes a smart list
for line in new_lines:
line.parent = suite[0]
# TODO(cwinter) suite-cleanup
after = start
if start == 0:
new_lines[0].prefix = " "
elif is_docstring(suite[0].children[start]):
new_lines[0].prefix = indent
after = start + 1
for line in new_lines:
line.parent = suite[0]
suite[0].children[after:after] = new_lines
for i in range(after+1, after+len(new_lines)+1):
suite[0].children[i].prefix = indent
suite[0].changed()
def transform_lambda(self, node, results):
args = results["args"]
body = results["body"]
inner = simplify_args(results["inner"])
# Replace lambda ((((x)))): x with lambda x: x
if inner.type == token.NAME:
inner = inner.clone()
inner.prefix = " "
args.replace(inner)
return
params = find_params(args)
to_index = map_to_index(params)
tup_name = self.new_name(tuple_name(params))
new_param = Name(tup_name, prefix=" ")
args.replace(new_param.clone())
for n in body.post_order():
if n.type == token.NAME and n.value in to_index:
subscripts = [c.clone() for c in to_index[n.value]]
new = pytree.Node(syms.power,
[new_param.clone()] + subscripts)
new.prefix = n.prefix
n.replace(new)
### Helper functions for transform_lambda()
def simplify_args(node):
if node.type in (syms.vfplist, token.NAME):
return node
elif node.type == syms.vfpdef:
# These look like vfpdef< '(' x ')' > where x is NAME
# or another vfpdef instance (leading to recursion).
while node.type == syms.vfpdef:
node = node.children[1]
return node
raise RuntimeError("Received unexpected node %s" % node)
def find_params(node):
if node.type == syms.vfpdef:
return find_params(node.children[1])
elif node.type == token.NAME:
return node.value
return [find_params(c) for c in node.children if c.type != token.COMMA]
def map_to_index(param_list, prefix=[], d=None):
if d is None:
d = {}
for i, obj in enumerate(param_list):
trailer = [Subscript(Number(str(i)))]
if isinstance(obj, list):
map_to_index(obj, trailer, d=d)
else:
d[obj] = prefix + trailer
return d
def tuple_name(param_list):
l = []
for obj in param_list:
if isinstance(obj, list):
l.append(tuple_name(obj))
else:
l.append(obj)
return "_".join(l)
fixes/fix_import.py 0000644 00000006270 15053244155 0010425 0 ustar 00 """Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
"""
# Local imports
from .. import fixer_base
from os.path import dirname, join, exists, sep
from ..fixer_util import FromImport, syms, token
def traverse_imports(names):
"""
Walks over all the names imported in a dotted_as_names node.
"""
pending = [names]
while pending:
node = pending.pop()
if node.type == token.NAME:
yield node.value
elif node.type == syms.dotted_name:
yield "".join([ch.value for ch in node.children])
elif node.type == syms.dotted_as_name:
pending.append(node.children[0])
elif node.type == syms.dotted_as_names:
pending.extend(node.children[::-2])
else:
raise AssertionError("unknown node type")
class FixImport(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
"""
def start_tree(self, tree, name):
super(FixImport, self).start_tree(tree, name)
self.skip = "absolute_import" in tree.future_features
def transform(self, node, results):
if self.skip:
return
imp = results['imp']
if node.type == syms.import_from:
# Some imps are top-level (eg: 'import ham')
# some are first level (eg: 'import ham.eggs')
# some are third level (eg: 'import ham.eggs as spam')
# Hence, the loop
while not hasattr(imp, 'value'):
imp = imp.children[0]
if self.probably_a_local_import(imp.value):
imp.value = "." + imp.value
imp.changed()
else:
have_local = False
have_absolute = False
for mod_name in traverse_imports(imp):
if self.probably_a_local_import(mod_name):
have_local = True
else:
have_absolute = True
if have_absolute:
if have_local:
# We won't handle both sibling and absolute imports in the
# same statement at the moment.
self.warning(node, "absolute and local imports together")
return
new = FromImport(".", [imp])
new.prefix = node.prefix
return new
def probably_a_local_import(self, imp_name):
if imp_name.startswith("."):
# Relative imports are certainly not local imports.
return False
imp_name = imp_name.split(".", 1)[0]
base_path = dirname(self.filename)
base_path = join(base_path, imp_name)
# If there is no __init__.py next to the file its not in a package
# so can't be a relative import.
if not exists(join(dirname(base_path), "__init__.py")):
return False
for ext in [".py", sep, ".pyc", ".so", ".sl", ".pyd"]:
if exists(base_path + ext):
return True
return False
fixes/fix_reload.py 0000644 00000002202 15053244155 0010350 0 ustar 00 """Fixer for reload().
reload(s) -> imp.reload(s)"""
# Local imports
from .. import fixer_base
from ..fixer_util import ImportAndCall, touch_import
class FixReload(fixer_base.BaseFix):
BM_compatible = True
order = "pre"
PATTERN = """
power< 'reload'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
"""
def transform(self, node, results):
if results:
# I feel like we should be able to express this logic in the
# PATTERN above but I don't know how to do it so...
obj = results['obj']
if obj:
if obj.type == self.syms.star_expr:
return # Make no change.
if (obj.type == self.syms.argument and
obj.children[0].value == '**'):
return # Make no change.
names = ('imp', 'reload')
new = ImportAndCall(node, results, names)
touch_import(None, 'imp', node)
return new
fixes/fix_print.py 0000644 00000005434 15053244155 0010250 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
"""
# Local imports
from .. import patcomp
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, Call, Comma, String
parend_expr = patcomp.compile_pattern(
"""atom< '(' [atom|STRING|NAME] ')' >"""
)
class FixPrint(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
simple_stmt< any* bare='print' any* > | print_stmt
"""
def transform(self, node, results):
assert results
bare_print = results.get("bare")
if bare_print:
# Special-case print all by itself
bare_print.replace(Call(Name("print"), [],
prefix=bare_print.prefix))
return
assert node.children[0] == Name("print")
args = node.children[1:]
if len(args) == 1 and parend_expr.match(args[0]):
# We don't want to keep sticking parens around an
# already-parenthesised expression.
return
sep = end = file = None
if args and args[-1] == Comma():
args = args[:-1]
end = " "
if args and args[0] == pytree.Leaf(token.RIGHTSHIFT, ">>"):
assert len(args) >= 2
file = args[1].clone()
args = args[3:] # Strip a possible comma after the file expression
# Now synthesize a print(args, sep=..., end=..., file=...) node.
l_args = [arg.clone() for arg in args]
if l_args:
l_args[0].prefix = ""
if sep is not None or end is not None or file is not None:
if sep is not None:
self.add_kwarg(l_args, "sep", String(repr(sep)))
if end is not None:
self.add_kwarg(l_args, "end", String(repr(end)))
if file is not None:
self.add_kwarg(l_args, "file", file)
n_stmt = Call(Name("print"), l_args)
n_stmt.prefix = node.prefix
return n_stmt
def add_kwarg(self, l_nodes, s_kwd, n_expr):
# XXX All this prefix-setting may lose comments (though rarely)
n_expr.prefix = ""
n_argument = pytree.Node(self.syms.argument,
(Name(s_kwd),
pytree.Leaf(token.EQUAL, "="),
n_expr))
if l_nodes:
l_nodes.append(Comma())
n_argument.prefix = " "
l_nodes.append(n_argument)
fixes/fix_operator.py 0000644 00000006617 15053244155 0010753 0 ustar 00 """Fixer for operator functions.
operator.isCallable(obj) -> hasattr(obj, '__call__')
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
"""
import collections
# Local imports
from lib2to3 import fixer_base
from lib2to3.fixer_util import Call, Name, String, touch_import
def invocation(s):
def dec(f):
f.invocation = s
return f
return dec
class FixOperator(fixer_base.BaseFix):
BM_compatible = True
order = "pre"
methods = """
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
"""
obj = "'(' obj=any ')'"
PATTERN = """
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
""" % dict(methods=methods, obj=obj)
def transform(self, node, results):
method = self._check_method(node, results)
if method is not None:
return method(node, results)
@invocation("operator.contains(%s)")
def _sequenceIncludes(self, node, results):
return self._handle_rename(node, results, "contains")
@invocation("hasattr(%s, '__call__')")
def _isCallable(self, node, results):
obj = results["obj"]
args = [obj.clone(), String(", "), String("'__call__'")]
return Call(Name("hasattr"), args, prefix=node.prefix)
@invocation("operator.mul(%s)")
def _repeat(self, node, results):
return self._handle_rename(node, results, "mul")
@invocation("operator.imul(%s)")
def _irepeat(self, node, results):
return self._handle_rename(node, results, "imul")
@invocation("isinstance(%s, collections.Sequence)")
def _isSequenceType(self, node, results):
return self._handle_type2abc(node, results, "collections", "Sequence")
@invocation("isinstance(%s, collections.Mapping)")
def _isMappingType(self, node, results):
return self._handle_type2abc(node, results, "collections", "Mapping")
@invocation("isinstance(%s, numbers.Number)")
def _isNumberType(self, node, results):
return self._handle_type2abc(node, results, "numbers", "Number")
def _handle_rename(self, node, results, name):
method = results["method"][0]
method.value = name
method.changed()
def _handle_type2abc(self, node, results, module, abc):
touch_import(None, module, node)
obj = results["obj"]
args = [obj.clone(), String(", " + ".".join([module, abc]))]
return Call(Name("isinstance"), args, prefix=node.prefix)
def _check_method(self, node, results):
method = getattr(self, "_" + results["method"][0].value)
if isinstance(method, collections.Callable):
if "module" in results:
return method
else:
sub = (str(results["obj"]),)
invocation_str = method.invocation % sub
self.warning(node, "You should use '%s' here." % invocation_str)
return None
fixes/fix_zip.py 0000644 00000002411 15053244155 0007706 0 ustar 00 """
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
"""
# Local imports
from .. import fixer_base
from ..pytree import Node
from ..pygram import python_symbols as syms
from ..fixer_util import Name, ArgList, in_special_context
class FixZip(fixer_base.ConditionalFix):
BM_compatible = True
PATTERN = """
power< 'zip' args=trailer< '(' [any] ')' > [trailers=trailer*]
>
"""
skip_on = "future_builtins.zip"
def transform(self, node, results):
if self.should_skip(node):
return
if in_special_context(node):
return None
args = results['args'].clone()
args.prefix = ""
trailers = []
if 'trailers' in results:
trailers = [n.clone() for n in results['trailers']]
for n in trailers:
n.prefix = ""
new = Node(syms.power, [Name("zip"), args], prefix="")
new = Node(syms.power, [Name("list"), ArgList([new])] + trailers)
new.prefix = node.prefix
return new
fixes/fix_metaclass.py 0000644 00000020005 15053244155 0011057 0 ustar 00 """Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherints
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
"""
# Author: Jack Diederich
# Local imports
from .. import fixer_base
from ..pygram import token
from ..fixer_util import syms, Node, Leaf
def has_metaclass(parent):
""" we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
"""
for node in parent.children:
if node.type == syms.suite:
return has_metaclass(node)
elif node.type == syms.simple_stmt and node.children:
expr_node = node.children[0]
if expr_node.type == syms.expr_stmt and expr_node.children:
left_side = expr_node.children[0]
if isinstance(left_side, Leaf) and \
left_side.value == '__metaclass__':
return True
return False
def fixup_parse_tree(cls_node):
""" one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
"""
for node in cls_node.children:
if node.type == syms.suite:
# already in the preferred format, do nothing
return
# !%@#! oneliners have no suite node, we have to fake one up
for i, node in enumerate(cls_node.children):
if node.type == token.COLON:
break
else:
raise ValueError("No class suite and no ':'!")
# move everything into a suite node
suite = Node(syms.suite, [])
while cls_node.children[i+1:]:
move_node = cls_node.children[i+1]
suite.append_child(move_node.clone())
move_node.remove()
cls_node.append_child(suite)
node = suite
def fixup_simple_stmt(parent, i, stmt_node):
""" if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
"""
for semi_ind, node in enumerate(stmt_node.children):
if node.type == token.SEMI: # *sigh*
break
else:
return
node.remove() # kill the semicolon
new_expr = Node(syms.expr_stmt, [])
new_stmt = Node(syms.simple_stmt, [new_expr])
while stmt_node.children[semi_ind:]:
move_node = stmt_node.children[semi_ind]
new_expr.append_child(move_node.clone())
move_node.remove()
parent.insert_child(i, new_stmt)
new_leaf1 = new_stmt.children[0].children[0]
old_leaf1 = stmt_node.children[0].children[0]
new_leaf1.prefix = old_leaf1.prefix
def remove_trailing_newline(node):
if node.children and node.children[-1].type == token.NEWLINE:
node.children[-1].remove()
def find_metas(cls_node):
# find the suite node (Mmm, sweet nodes)
for node in cls_node.children:
if node.type == syms.suite:
break
else:
raise ValueError("No class suite!")
# look for simple_stmt[ expr_stmt[ Leaf('__metaclass__') ] ]
for i, simple_node in list(enumerate(node.children)):
if simple_node.type == syms.simple_stmt and simple_node.children:
expr_node = simple_node.children[0]
if expr_node.type == syms.expr_stmt and expr_node.children:
# Check if the expr_node is a simple assignment.
left_node = expr_node.children[0]
if isinstance(left_node, Leaf) and \
left_node.value == '__metaclass__':
# We found an assignment to __metaclass__.
fixup_simple_stmt(node, i, simple_node)
remove_trailing_newline(simple_node)
yield (node, i, simple_node)
def fixup_indent(suite):
""" If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
"""
kids = suite.children[::-1]
# find the first indent
while kids:
node = kids.pop()
if node.type == token.INDENT:
break
# find the first Leaf
while kids:
node = kids.pop()
if isinstance(node, Leaf) and node.type != token.DEDENT:
if node.prefix:
node.prefix = ''
return
else:
kids.extend(node.children[::-1])
class FixMetaclass(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
classdef<any*>
"""
def transform(self, node, results):
if not has_metaclass(node):
return
fixup_parse_tree(node)
# find metaclasses, keep the last one
last_metaclass = None
for suite, i, stmt in find_metas(node):
last_metaclass = stmt
stmt.remove()
text_type = node.children[0].type # always Leaf(nnn, 'class')
# figure out what kind of classdef we have
if len(node.children) == 7:
# Node(classdef, ['class', 'name', '(', arglist, ')', ':', suite])
# 0 1 2 3 4 5 6
if node.children[3].type == syms.arglist:
arglist = node.children[3]
# Node(classdef, ['class', 'name', '(', 'Parent', ')', ':', suite])
else:
parent = node.children[3].clone()
arglist = Node(syms.arglist, [parent])
node.set_child(3, arglist)
elif len(node.children) == 6:
# Node(classdef, ['class', 'name', '(', ')', ':', suite])
# 0 1 2 3 4 5
arglist = Node(syms.arglist, [])
node.insert_child(3, arglist)
elif len(node.children) == 4:
# Node(classdef, ['class', 'name', ':', suite])
# 0 1 2 3
arglist = Node(syms.arglist, [])
node.insert_child(2, Leaf(token.RPAR, ')'))
node.insert_child(2, arglist)
node.insert_child(2, Leaf(token.LPAR, '('))
else:
raise ValueError("Unexpected class definition")
# now stick the metaclass in the arglist
meta_txt = last_metaclass.children[0].children[0]
meta_txt.value = 'metaclass'
orig_meta_prefix = meta_txt.prefix
if arglist.children:
arglist.append_child(Leaf(token.COMMA, ','))
meta_txt.prefix = ' '
else:
meta_txt.prefix = ''
# compact the expression "metaclass = Meta" -> "metaclass=Meta"
expr_stmt = last_metaclass.children[0]
assert expr_stmt.type == syms.expr_stmt
expr_stmt.children[1].prefix = ''
expr_stmt.children[2].prefix = ''
arglist.append_child(last_metaclass)
fixup_indent(suite)
# check for empty suite
if not suite.children:
# one-liner that was just __metaclass_
suite.remove()
pass_leaf = Leaf(text_type, 'pass')
pass_leaf.prefix = orig_meta_prefix
node.append_child(pass_leaf)
node.append_child(Leaf(token.NEWLINE, '\n'))
elif len(suite.children) > 1 and \
(suite.children[-2].type == token.INDENT and
suite.children[-1].type == token.DEDENT):
# there was only one line in the class body and it was __metaclass__
pass_leaf = Leaf(text_type, 'pass')
suite.insert_child(-1, pass_leaf)
suite.insert_child(-1, Leaf(token.NEWLINE, '\n'))
fixes/fix_types.py 0000644 00000003356 15053244155 0010261 0 ustar 00 # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
"""
# Local imports
from .. import fixer_base
from ..fixer_util import Name
_TYPE_MAPPING = {
'BooleanType' : 'bool',
'BufferType' : 'memoryview',
'ClassType' : 'type',
'ComplexType' : 'complex',
'DictType': 'dict',
'DictionaryType' : 'dict',
'EllipsisType' : 'type(Ellipsis)',
#'FileType' : 'io.IOBase',
'FloatType': 'float',
'IntType': 'int',
'ListType': 'list',
'LongType': 'int',
'ObjectType' : 'object',
'NoneType': 'type(None)',
'NotImplementedType' : 'type(NotImplemented)',
'SliceType' : 'slice',
'StringType': 'bytes', # XXX ?
'StringTypes' : '(str,)', # XXX ?
'TupleType': 'tuple',
'TypeType' : 'type',
'UnicodeType': 'str',
'XRangeType' : 'range',
}
_pats = ["power< 'types' trailer< '.' name='%s' > >" % t for t in _TYPE_MAPPING]
class FixTypes(fixer_base.BaseFix):
BM_compatible = True
PATTERN = '|'.join(_pats)
def transform(self, node, results):
new_value = _TYPE_MAPPING.get(results["name"].value)
if new_value:
return Name(new_value, prefix=node.prefix)
return None
fixes/fix_itertools_imports.py 0000644 00000004046 15053244155 0012713 0 ustar 00 """ Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) """
# Local imports
from lib2to3 import fixer_base
from lib2to3.fixer_util import BlankLine, syms, token
class FixItertoolsImports(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
import_from< 'from' 'itertools' 'import' imports=any >
""" %(locals())
def transform(self, node, results):
imports = results['imports']
if imports.type == syms.import_as_name or not imports.children:
children = [imports]
else:
children = imports.children
for child in children[::2]:
if child.type == token.NAME:
member = child.value
name_node = child
elif child.type == token.STAR:
# Just leave the import as is.
return
else:
assert child.type == syms.import_as_name
name_node = child.children[0]
member_name = name_node.value
if member_name in ('imap', 'izip', 'ifilter'):
child.value = None
child.remove()
elif member_name in ('ifilterfalse', 'izip_longest'):
node.changed()
name_node.value = ('filterfalse' if member_name[1] == 'f'
else 'zip_longest')
# Make sure the import statement is still sane
children = imports.children[:] or [imports]
remove_comma = True
for child in children:
if remove_comma and child.type == token.COMMA:
child.remove()
else:
remove_comma ^= True
while children and children[-1].type == token.COMMA:
children.pop().remove()
# If there are no imports left, just get rid of the entire statement
if (not (imports.children or getattr(imports, 'value', None)) or
imports.parent is None):
p = node.prefix
node = BlankLine()
node.prefix = p
return node
fixes/fix_long.py 0000644 00000000734 15053244155 0010051 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that turns 'long' into 'int' everywhere.
"""
# Local imports
from lib2to3 import fixer_base
from lib2to3.fixer_util import is_probably_builtin
class FixLong(fixer_base.BaseFix):
BM_compatible = True
PATTERN = "'long'"
def transform(self, node, results):
if is_probably_builtin(node):
node.value = "int"
node.changed()
fixes/fix_apply.py 0000644 00000004576 15053244155 0010247 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for apply().
This converts apply(func, v, k) into (func)(*v, **k)."""
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Call, Comma, parenthesize
class FixApply(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
"""
def transform(self, node, results):
syms = self.syms
assert results
func = results["func"]
args = results["args"]
kwds = results.get("kwds")
# I feel like we should be able to express this logic in the
# PATTERN above but I don't know how to do it so...
if args:
if args.type == self.syms.star_expr:
return # Make no change.
if (args.type == self.syms.argument and
args.children[0].value == '**'):
return # Make no change.
if kwds and (kwds.type == self.syms.argument and
kwds.children[0].value == '**'):
return # Make no change.
prefix = node.prefix
func = func.clone()
if (func.type not in (token.NAME, syms.atom) and
(func.type != syms.power or
func.children[-2].type == token.DOUBLESTAR)):
# Need to parenthesize
func = parenthesize(func)
func.prefix = ""
args = args.clone()
args.prefix = ""
if kwds is not None:
kwds = kwds.clone()
kwds.prefix = ""
l_newargs = [pytree.Leaf(token.STAR, "*"), args]
if kwds is not None:
l_newargs.extend([Comma(),
pytree.Leaf(token.DOUBLESTAR, "**"),
kwds])
l_newargs[-2].prefix = " " # that's the ** token
# XXX Sometimes we could be cleverer, e.g. apply(f, (x, y) + t)
# can be translated into f(x, y, *t) instead of f(*(x, y) + t)
#new = pytree.Node(syms.power, (func, ArgList(l_newargs)))
return Call(func, l_newargs, prefix=prefix)
fixes/fix_exitfunc.py 0000644 00000004677 15053244155 0010751 0 ustar 00 """
Convert use of sys.exitfunc to use the atexit module.
"""
# Author: Benjamin Peterson
from lib2to3 import pytree, fixer_base
from lib2to3.fixer_util import Name, Attr, Call, Comma, Newline, syms
class FixExitfunc(fixer_base.BaseFix):
keep_line_order = True
BM_compatible = True
PATTERN = """
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
"""
def __init__(self, *args):
super(FixExitfunc, self).__init__(*args)
def start_tree(self, tree, filename):
super(FixExitfunc, self).start_tree(tree, filename)
self.sys_import = None
def transform(self, node, results):
# First, find the sys import. We'll just hope it's global scope.
if "sys_import" in results:
if self.sys_import is None:
self.sys_import = results["sys_import"]
return
func = results["func"].clone()
func.prefix = ""
register = pytree.Node(syms.power,
Attr(Name("atexit"), Name("register"))
)
call = Call(register, [func], node.prefix)
node.replace(call)
if self.sys_import is None:
# That's interesting.
self.warning(node, "Can't find sys import; Please add an atexit "
"import at the top of your file.")
return
# Now add an atexit import after the sys import.
names = self.sys_import.children[1]
if names.type == syms.dotted_as_names:
names.append_child(Comma())
names.append_child(Name("atexit", " "))
else:
containing_stmt = self.sys_import.parent
position = containing_stmt.children.index(self.sys_import)
stmt_container = containing_stmt.parent
new_import = pytree.Node(syms.import_name,
[Name("import"), Name("atexit", " ")]
)
new = pytree.Node(syms.simple_stmt, [new_import])
containing_stmt.insert_child(position + 1, Newline())
containing_stmt.insert_child(position + 2, new)
fixes/fix_except.py 0000644 00000006420 15053244155 0010400 0 ustar 00 """Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
"""
# Author: Collin Winter
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Assign, Attr, Name, is_tuple, is_list, syms
def find_excepts(nodes):
for i, n in enumerate(nodes):
if n.type == syms.except_clause:
if n.children[0].value == 'except':
yield (n, nodes[i+2])
class FixExcept(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
"""
def transform(self, node, results):
syms = self.syms
tail = [n.clone() for n in results["tail"]]
try_cleanup = [ch.clone() for ch in results["cleanup"]]
for except_clause, e_suite in find_excepts(try_cleanup):
if len(except_clause.children) == 4:
(E, comma, N) = except_clause.children[1:4]
comma.replace(Name("as", prefix=" "))
if N.type != token.NAME:
# Generate a new N for the except clause
new_N = Name(self.new_name(), prefix=" ")
target = N.clone()
target.prefix = ""
N.replace(new_N)
new_N = new_N.clone()
# Insert "old_N = new_N" as the first statement in
# the except body. This loop skips leading whitespace
# and indents
#TODO(cwinter) suite-cleanup
suite_stmts = e_suite.children
for i, stmt in enumerate(suite_stmts):
if isinstance(stmt, pytree.Node):
break
# The assignment is different if old_N is a tuple or list
# In that case, the assignment is old_N = new_N.args
if is_tuple(N) or is_list(N):
assign = Assign(target, Attr(new_N, Name('args')))
else:
assign = Assign(target, new_N)
#TODO(cwinter) stopgap until children becomes a smart list
for child in reversed(suite_stmts[:i]):
e_suite.insert_child(0, child)
e_suite.insert_child(i, assign)
elif N.prefix == "":
# No space after a comma is legal; no space after "as",
# not so much.
N.prefix = " "
#TODO(cwinter) fix this when children becomes a smart list
children = [c.clone() for c in node.children[:3]] + try_cleanup + tail
return pytree.Node(node.type, children)
fixes/__pycache__/fix_sys_exc.cpython-36.pyc 0000644 00000002544 15053244155 0015054 0 ustar 00 3
\
� @ sJ d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
G dd� dej �Z dS )z�Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
� )�
fixer_base)�Attr�Call�Name�Number� Subscript�Node�symsc @ s: e Zd ZdddgZdZddjdd� eD �� Zd d
� Zd S ) � FixSysExc�exc_type� exc_value�
exc_tracebackTzN
power< 'sys' trailer< dot='.' attribute=(%s) > >
�|c c s | ]}d | V qdS )z'%s'N� )�.0�er r �1/usr/lib64/python3.6/lib2to3/fixes/fix_sys_exc.py� <genexpr> s zFixSysExc.<genexpr>c C st |d d }t | jj|j��}ttd�|jd�}ttd�|�}|d j|d jd _|j t
|�� t t j
||jd�S )NZ attribute� �exc_info)�prefix�sys�dot� )r r �index�valuer r r r Zchildren�appendr r r Zpower)�selfZnodeZresultsZsys_attrr Zcall�attrr r r � transform s zFixSysExc.transformN)�__name__�
__module__� __qualname__r Z
BM_compatible�joinZPATTERNr r r r r r
s
r
N)
�__doc__� r Z
fixer_utilr r r r r r r ZBaseFixr
r r r r �<module> s $ fixes/__pycache__/fix_map.cpython-36.pyc 0000644 00000006000 15053244155 0014143 0 ustar 00 3
\8 � @ sf d Z ddlmZ ddlmZ ddlmZmZmZm Z m
Z
ddl m Z
ddlmZ G dd� dej�Zd S )
a Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
� )�token)�
fixer_base)�Name�ArgList�Call�ListComp�in_special_context)�python_symbols)�Nodec @ s e Zd ZdZdZdZdd� ZdS )�FixMapTaL
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
[extra_trailers=trailer*]
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'map' args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.mapc C s� | j |�rd S g }d|kr:x |d D ]}|j|j� � q$W |jjtjkrv| j|d� |j� }d|_t t
d�|g�}�n&d|kr�t |d j� |d j� |d j� �}t tj
|g| dd �}n�d
|kr�|d j� }d|_n�d |k�rj|d }|jtjk�rL|jd
jtjk�rL|jd
jd jtjk�rL|jd
jd jdk�rL| j|d� d S t tj
t
d�|j� g�}d|_t|��rxd S t tj
t
d�t|g�g| �}d|_|j|_|S )NZextra_trailersz You should use a for loop here� �listZ
map_lambdaZxp�fp�it)�prefixZmap_none�arg�args� � �Nonezjcannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence�map)Z should_skip�appendZclone�parent�type�symsZ simple_stmtZwarningr r r r r
ZpowerZtrailerZchildrenZarglistr �NAME�valuer r )�selfZnodeZresultsZtrailers�t�newr � r �-/usr/lib64/python3.6/lib2to3/fixes/fix_map.py� transform@ sF
zFixMap.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr" r r r r! r s r N)�__doc__Zpgen2r r r Z
fixer_utilr r r r r Zpygramr r Zpytreer
ZConditionalFixr r r r r! �<module> s fixes/__pycache__/fix_has_key.cpython-36.opt-1.pyc 0000644 00000005465 15053244155 0015766 0 ustar 00 3
\| � @ sB d Z ddlmZ ddlmZ ddlmZmZ G dd� dej�ZdS )a& Fixer for has_key().
Calls to .has_key() methods are expressed in terms of the 'in'
operator:
d.has_key(k) -> k in d
CAVEATS:
1) While the primary target of this fixer is dict.has_key(), the
fixer will change any has_key() method call, regardless of its
class.
2) Cases like this will not be converted:
m = d.has_key
if m(k):
...
Only *calls* to has_key() are converted. While it is possible to
convert the above to something like
m = d.__contains__
if m(k):
...
this is currently not done.
� )�pytree)�
fixer_base)�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )� FixHasKeyTa�
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
c
C s| | j }|jj|jkr&| jj|j�r&d S |jd�}|d }|j}dd� |d D �}|d j� }|jd�} | rxdd� | D �} |j|j |j|j
|j |j |j
|jfkr�t|�}t|�d kr�|d
}ntj|j|�}d |_td d d
�}
|r�tdd d
�} tj|j| |
f�}
tj|j ||
|f�} | �r8t| �} tj|j| ft| � �} |jj|j |j|j|j|j|j|j |j |jf k�rrt| �} || _| S )N�negation�anchorc S s g | ] }|j � �qS � )�clone)�.0�nr r �1/usr/lib64/python3.6/lib2to3/fixes/fix_has_key.py�
<listcomp>R s z'FixHasKey.transform.<locals>.<listcomp>�before�arg�afterc S s g | ] }|j � �qS r )r
)r r r r r
r V s � � � �in)�prefix�not) �syms�parent�typeZnot_test�pattern�match�getr r
Z
comparisonZand_testZor_testZtestZlambdefZargumentr �lenr ZNodeZpowerr Zcomp_op�tuple�exprZxor_exprZand_exprZ
shift_exprZ
arith_exprZtermZfactor)
�selfZnodeZresultsr r r r r r r Zn_opZn_not�newr r r
� transformG sD
zFixHasKey.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr# r r r r
r & s r N) �__doc__� r r Z
fixer_utilr r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_repr.cpython-36.pyc 0000644 00000001470 15053244155 0014344 0 ustar 00 3
\e � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )z/Fixer that transforms `xyzzy` into repr(xyzzy).� )�
fixer_base)�Call�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixReprTz7
atom < '`' expr=any '`' >
c C s8 |d j � }|j| jjkr"t|�}ttd�|g|jd�S )N�expr�repr)�prefix)Zclone�typeZsymsZ testlist1r r r r )�selfZnodeZresultsr � r �./usr/lib64/python3.6/lib2to3/fixes/fix_repr.py� transform s zFixRepr.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N) �__doc__� r Z
fixer_utilr r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_operator.cpython-36.pyc 0000644 00000010170 15053244155 0015224 0 ustar 00 3
\�
� @ sN d Z ddlZddlmZ ddlmZmZmZmZ dd� Z G dd� dej
�Z dS ) a� Fixer for operator functions.
operator.isCallable(obj) -> hasattr(obj, '__call__')
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
� N)�
fixer_base)�Call�Name�String� touch_importc s � fdd�}|S )Nc s
� | _ | S )N)�
invocation)�f)�s� �2/usr/lib64/python3.6/lib2to3/fixes/fix_operator.py�dec s zinvocation.<locals>.decr
)r r r
)r r r s r c @ s� e Zd ZdZdZdZdZdeeed� Zdd� Z e
d �d
d � �Z e
d �d
d� �Z e
d�dd� �Z
e
d�dd� �Ze
d�dd� �Ze
d�dd� �Ze
d�d d � �Zd d � Zd d!� Zd"d#� Zd$S )%� FixOperatorTZprez�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
z'(' obj=any ')'z�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
)�methods�objc C s" | j ||�}|d k r |||�S d S )N)�
_check_method)�self�node�results�methodr
r
r � transform+ s zFixOperator.transformzoperator.contains(%s)c C s | j ||d�S )N�contains)�_handle_rename)r r r r
r
r �_sequenceIncludes0 s z FixOperator._sequenceIncludeszhasattr(%s, '__call__')c C s2 |d }|j � td�td�g}ttd�||jd�S )Nr z, z
'__call__'�hasattr)�prefix)�cloner r r r )r r r r �argsr
r
r � _isCallable4 s zFixOperator._isCallablezoperator.mul(%s)c C s | j ||d�S )N�mul)r )r r r r
r
r �_repeat: s zFixOperator._repeatzoperator.imul(%s)c C s | j ||d�S )N�imul)r )r r r r
r
r �_irepeat> s zFixOperator._irepeatz$isinstance(%s, collections.Sequence)c C s | j ||dd�S )N� collections�Sequence)�_handle_type2abc)r r r r
r
r �_isSequenceTypeB s zFixOperator._isSequenceTypez#isinstance(%s, collections.Mapping)c C s | j ||dd�S )Nr" �Mapping)r$ )r r r r
r
r �_isMappingTypeF s zFixOperator._isMappingTypez isinstance(%s, numbers.Number)c C s | j ||dd�S )NZnumbers�Number)r$ )r r r r
r
r �
_isNumberTypeJ s zFixOperator._isNumberTypec C s |d d }||_ |j� d S )Nr r )�valueZchanged)r r r �namer r
r
r r N s zFixOperator._handle_renamec C sF t d ||� |d }|j� tddj||g� �g}ttd�||jd�S )Nr z, �.�
isinstance)r )r r r �joinr r r )r r r �module�abcr r r
r
r r$ S s z FixOperator._handle_type2abcc C s\ t | d|d d j �}t|tj�rXd|kr0|S t|d �f}|j| }| j|d| � d S )N�_r r r/ r zYou should use '%s' here.)�getattrr* r- r" �Callable�strr Zwarning)r r r r �subZinvocation_strr
r
r r Y s
zFixOperator._check_methodN)�__name__�
__module__� __qualname__Z
BM_compatible�orderr r �dictZPATTERNr r r r r r! r% r' r) r r$ r r
r
r
r r
s r
) �__doc__r" Zlib2to3r Zlib2to3.fixer_utilr r r r r ZBaseFixr
r
r
r
r �<module>
s
fixes/__pycache__/fix_long.cpython-36.opt-2.pyc 0000644 00000001154 15053244155 0015272 0 ustar 00 3
\� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�is_probably_builtinc @ s e Zd ZdZdZdd� ZdS )�FixLongTz'long'c C s t |�rd|_|j� d S )N�int)r �valueZchanged)�selfZnodeZresults� r �./usr/lib64/python3.6/lib2to3/fixes/fix_long.py� transform s zFixLong.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_ws_comma.cpython-36.pyc 0000644 00000002116 15053244155 0015177 0 ustar 00 3
\B � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z�Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
� )�pytree)�token)�
fixer_basec @ s@ e Zd ZdZdZejejd�Zejej d�Z ee fZ
dd� Z dS )�
FixWsCommaTzH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
�,�:c C sd |j � }d}xR|jD ]H}|| jkrD|j}|j� r>d|kr>d|_d}q|rX|j}|sXd|_d}qW |S )NF�
� T� )ZcloneZchildren�SEPS�prefix�isspace)�selfZnodeZresults�newZcommaZchildr � r �2/usr/lib64/python3.6/lib2to3/fixes/fix_ws_comma.py� transform s
zFixWsComma.transformN) �__name__�
__module__� __qualname__ZexplicitZPATTERNr ZLeafr �COMMA�COLONr r r r r r r s r N)�__doc__r r Zpgen2r r ZBaseFixr r r r r �<module> s fixes/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000201 15053244155 0015213 0 ustar 00 3
\/ � @ s d S )N� r r r �./usr/lib64/python3.6/lib2to3/fixes/__init__.py�<module> s fixes/__pycache__/fix_ne.cpython-36.pyc 0000644 00000001422 15053244155 0013773 0 ustar 00 3
\; � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z Fixer that turns <> into !=.� )�pytree)�token)�
fixer_basec @ s" e Zd ZejZdd� Zdd� ZdS )�FixNec C s
|j dkS )Nz<>)�value)�self�node� r �,/usr/lib64/python3.6/lib2to3/fixes/fix_ne.py�match s z FixNe.matchc C s t jtjd|jd�}|S )Nz!=)�prefix)r ZLeafr �NOTEQUALr )r r Zresults�newr r r
� transform s zFixNe.transformN)�__name__�
__module__� __qualname__r r
Z _accept_typer r r r r r
r s r N)�__doc__� r Zpgen2r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_tuple_params.cpython-36.opt-2.pyc 0000644 00000010221 15053244155 0017022 0 ustar 00 3
\� � @ s� d dl mZ d dlmZ d dl mZ d dlmZmZmZm Z m
Z
m Z dd� Z G dd� dej
�Zd d
� Zd d � Zg d
fdd�Zdd� Zd
S )� )�pytree)�token)�
fixer_base)�Assign�Name�Newline�Number� Subscript�symsc C s t | tj�o | jd jtjkS )N� )�
isinstancer �Node�children�typer �STRING)�stmt� r �6/usr/lib64/python3.6/lib2to3/fixes/fix_tuple_params.py� is_docstring s r c @ s( e Zd ZdZdZdZdd� Zdd� ZdS ) �FixTupleParams� Ta
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s� d|kr�j ||�S g �|d }|d }|d jd jtjkrZd}|d jd j}t� � nd}d}tjtjd�� d� ��fd
d � }|jt j
kr�||� n@|jt j kr�x2t |j�D ]$\}} | jt j
kr�|| |dkd � q�W �s�d S x�D ]}
|d |
_
q�W |} |dk�rd
�d _n&t|d j| ��r8|�d _|d } x�D ]}
|d |
_
�q>W �|d j| | �< x4t| d | t�� d �D ]}||d j| _�q�W |d j� d S )N�lambda�suite�argsr � r z; � Fc s\ t �j� �}| j� }d|_t||j� �}|r2d|_| j|� �jtjt j
|� j� g�� d S )Nr � ) r �new_name�clone�prefixr �replace�appendr r
r
Z simple_stmt)Z tuple_arg�
add_prefix�n�argr )�end� new_lines�selfr r � handle_tupleC s
z.FixTupleParams.transform.<locals>.handle_tuple)r" r )F)�transform_lambdar r r �INDENT�valuer r ZLeafr
ZtfpdefZ
typedargslist� enumerate�parentr r �range�lenZchanged) r' �node�resultsr r �start�indentr( �ir$ �line�afterr )r% r& r' r � transform. sF
zFixTupleParams.transformc
C s� |d }|d }t |d �}|jtjkrD|j� }d|_|j|� d S t|�}t|�}| j t
|��}t |dd�} |j| j� � xd|j � D ]X}
|
jtjkr�|
j
|kr�dd� ||
j
D �} tjtj| j� g| �} |
j| _|
j| � q�W d S )Nr �body�innerr )r c S s g | ] }|j � �qS r )r )�.0�cr r r �
<listcomp>� s z3FixTupleParams.transform_lambda.<locals>.<listcomp>)�
simplify_argsr r �NAMEr r r � find_params� map_to_indexr �
tuple_namer Z
post_orderr+ r r
r
Zpower)
r' r0 r1 r r8 r9 ZparamsZto_indexZtup_nameZ new_paramr# Z
subscripts�newr r r r) n s(
z FixTupleParams.transform_lambdaN)�__name__�
__module__� __qualname__Z run_orderZ
BM_compatibleZPATTERNr7 r) r r r r r s
@r c C sR | j tjtjfkr| S | j tjkrBx| j tjkr<| jd } q$W | S td| ��d S )Nr zReceived unexpected node %s)r r
Zvfplistr r> �vfpdefr � RuntimeError)r0 r r r r= � s r= c C s< | j tjkrt| jd �S | j tjkr,| jS dd� | jD �S )Nr c S s g | ]}|j tjkrt|��qS r )r r �COMMAr? )r: r; r r r r< � s z find_params.<locals>.<listcomp>)r r
rF r? r r r> r+ )r0 r r r r? � s
r? Nc C s^ |d kr i }xLt | �D ]@\}}ttt|���g}t|t�rJt|||d� q|| ||< qW |S )N)�d)r, r r �strr �listr@ )�
param_listr rI r4 �objZtrailerr r r r@ � s
r@ c C s@ g }x0| D ](}t |t�r(|jt|�� q
|j|� q
W dj|�S )N�_)r rK r! rA �join)rL �lrM r r r rA � s
rA )r r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r= r? r@ rA r r r r �<module> s l fixes/__pycache__/fix_tuple_params.cpython-36.opt-1.pyc 0000644 00000010737 15053244155 0017035 0 ustar 00 3
\� � @ s� d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z m Z dd� Z
G dd � d ej�Zd
d � Zd d
� Zg dfdd�Zdd� ZdS )a: Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
� )�pytree)�token)�
fixer_base)�Assign�Name�Newline�Number� Subscript�symsc C s t | tj�o | jd jtjkS )N� )�
isinstancer �Node�children�typer �STRING)�stmt� r �6/usr/lib64/python3.6/lib2to3/fixes/fix_tuple_params.py� is_docstring s r c @ s( e Zd ZdZdZdZdd� Zdd� ZdS ) �FixTupleParams� Ta
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s� d|kr�j ||�S g �|d }|d }|d jd jtjkrZd}|d jd j}t� � nd}d}tjtjd�� d� ��fd
d � }|jt j
kr�||� n@|jt j kr�x2t |j�D ]$\}} | jt j
kr�|| |dkd � q�W �s�d S x�D ]}
|d |
_
q�W |} |dk�rd
�d _n&t|d j| ��r8|�d _|d } x�D ]}
|d |
_
�q>W �|d j| | �< x4t| d | t�� d �D ]}||d j| _�q�W |d j� d S )N�lambda�suite�argsr � r z; � Fc s\ t �j� �}| j� }d|_t||j� �}|r2d|_| j|� �jtjt j
|� j� g�� d S )Nr � ) r �new_name�clone�prefixr �replace�appendr r
r
Z simple_stmt)Z tuple_arg�
add_prefix�n�argr )�end� new_lines�selfr r � handle_tupleC s
z.FixTupleParams.transform.<locals>.handle_tuple)r" r )F)�transform_lambdar r r �INDENT�valuer r ZLeafr
ZtfpdefZ
typedargslist� enumerate�parentr r �range�lenZchanged) r' �node�resultsr r �start�indentr( �ir$ �line�afterr )r% r& r' r � transform. sF
zFixTupleParams.transformc
C s� |d }|d }t |d �}|jtjkrD|j� }d|_|j|� d S t|�}t|�}| j t
|��}t |dd�} |j| j� � xd|j � D ]X}
|
jtjkr�|
j
|kr�dd� ||
j
D �} tjtj| j� g| �} |
j| _|
j| � q�W d S )Nr �body�innerr )r c S s g | ] }|j � �qS r )r )�.0�cr r r �
<listcomp>� s z3FixTupleParams.transform_lambda.<locals>.<listcomp>)�
simplify_argsr r �NAMEr r r � find_params� map_to_indexr �
tuple_namer Z
post_orderr+ r r
r
Zpower)
r' r0 r1 r r8 r9 ZparamsZto_indexZtup_nameZ new_paramr# Z
subscripts�newr r r r) n s(
z FixTupleParams.transform_lambdaN)�__name__�
__module__� __qualname__Z run_orderZ
BM_compatibleZPATTERNr7 r) r r r r r s
@r c C sR | j tjtjfkr| S | j tjkrBx| j tjkr<| jd } q$W | S td| ��d S )Nr zReceived unexpected node %s)r r
Zvfplistr r> �vfpdefr � RuntimeError)r0 r r r r= � s r= c C s< | j tjkrt| jd �S | j tjkr,| jS dd� | jD �S )Nr c S s g | ]}|j tjkrt|��qS r )r r �COMMAr? )r: r; r r r r< � s z find_params.<locals>.<listcomp>)r r
rF r? r r r> r+ )r0 r r r r? � s
r? Nc C s^ |d kr i }xLt | �D ]@\}}ttt|���g}t|t�rJt|||d� q|| ||< qW |S )N)�d)r, r r �strr �listr@ )�
param_listr rI r4 �objZtrailerr r r r@ � s
r@ c C s@ g }x0| D ](}t |t�r(|jt|�� q
|j|� q
W dj|�S )N�_)r rK r! rA �join)rL �lrM r r r rA � s
rA )�__doc__r r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r= r? r@ rA r r r r �<module> s l fixes/__pycache__/fix_ws_comma.cpython-36.opt-1.pyc 0000644 00000002116 15053244155 0016136 0 ustar 00 3
\B � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z�Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
� )�pytree)�token)�
fixer_basec @ s@ e Zd ZdZdZejejd�Zejej d�Z ee fZ
dd� Z dS )�
FixWsCommaTzH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
�,�:c C sd |j � }d}xR|jD ]H}|| jkrD|j}|j� r>d|kr>d|_d}q|rX|j}|sXd|_d}qW |S )NF�
� T� )ZcloneZchildren�SEPS�prefix�isspace)�selfZnodeZresults�newZcommaZchildr � r �2/usr/lib64/python3.6/lib2to3/fixes/fix_ws_comma.py� transform s
zFixWsComma.transformN) �__name__�
__module__� __qualname__ZexplicitZPATTERNr ZLeafr �COMMA�COLONr r r r r r r s r N)�__doc__r r Zpgen2r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_future.cpython-36.opt-2.pyc 0000644 00000001224 15053244155 0015643 0 ustar 00 3
\# � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)� BlankLinec @ s e Zd ZdZdZdZdd� ZdS )� FixFutureTz;import_from< 'from' module_name="__future__" 'import' any >�
c C s t � }|j|_|S )N)r �prefix)�selfZnodeZresults�new� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_future.py� transform s zFixFuture.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r
r s r N)� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_long.cpython-36.opt-1.pyc 0000644 00000001254 15053244155 0015272 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z/Fixer that turns 'long' into 'int' everywhere.
� )�
fixer_base)�is_probably_builtinc @ s e Zd ZdZdZdd� ZdS )�FixLongTz'long'c C s t |�rd|_|j� d S )N�int)r �valueZchanged)�selfZnodeZresults� r �./usr/lib64/python3.6/lib2to3/fixes/fix_long.py� transform s zFixLong.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_filter.cpython-36.pyc 0000644 00000004444 15053244155 0014665 0 ustar 00 3
\[
� @ sV d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z m Z G dd� dej
�ZdS ) a� Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�ListComp�in_special_contextc @ s e Zd ZdZdZdZdd� ZdS )� FixFilterTaV
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
[extra_trailers=trailer*]
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.filterc C s2 | j |�rd S g }d|kr:x |d D ]}|j|j� � q$W d|kr�t|jd�j� |jd�j� |jd�j� |jd�j� �}ttj|g| dd�}n�d|kr�ttd �td �|d
j� td ��}ttj|g| dd�}nTt |�r�d S |d j� }ttjtd �|gdd�}ttjtd
�t
|g�g| �}d|_ |j |_ |S )NZextra_trailersZ
filter_lambda�fp�itZxp� )�prefixZnoneZ_f�seq�args�filter�list) Z should_skip�appendZcloner �getr �symsZpowerr r r r
)�selfZnodeZresultsZtrailers�t�newr � r �0/usr/lib64/python3.6/lib2to3/fixes/fix_filter.py� transform: s4
zFixFilter.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r s r N)�__doc__r r Zpytreer Zpygramr r Z
fixer_utilr r r r ZConditionalFixr r r r r �<module> s
fixes/__pycache__/fix_imports2.cpython-36.opt-2.pyc 0000644 00000000652 15053244155 0016114 0 ustar 00 3
\! � @ s, d dl mZ ddd�ZG dd� dej�ZdS )� )� fix_importsZdbm)ZwhichdbZanydbmc @ s e Zd ZdZeZdS )� FixImports2� N)�__name__�
__module__� __qualname__Z run_order�MAPPING�mapping� r
r
�2/usr/lib64/python3.6/lib2to3/fixes/fix_imports2.pyr s r N)� r r Z
FixImportsr r
r
r
r �<module> s fixes/__pycache__/fix_zip.cpython-36.opt-1.pyc 0000644 00000003030 15053244155 0015127 0 ustar 00 3
\ � @ sR d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z G dd� dej �Z
dS ) a7
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�in_special_contextc @ s e Zd ZdZdZdZdd� ZdS )�FixZipTzN
power< 'zip' args=trailer< '(' [any] ')' > [trailers=trailer*]
>
zfuture_builtins.zipc C s� | j |�rd S t|�rd S |d j� }d|_g }d|kr^dd� |d D �}x|D ]
}d|_qPW ttjtd�|gdd�}ttjtd�t|g�g| �}|j|_|S ) N�args� �trailersc S s g | ] }|j � �qS � )�clone)�.0�nr r �-/usr/lib64/python3.6/lib2to3/fixes/fix_zip.py�
<listcomp>' s z$FixZip.transform.<locals>.<listcomp>�zip)�prefix�list) Z should_skipr r
r r �symsZpowerr r )�selfZnodeZresultsr r r �newr r r � transform s
zFixZip.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r s r N)�__doc__r
r Zpytreer Zpygramr r Z
fixer_utilr r r ZConditionalFixr r r r r �<module> s
fixes/__pycache__/fix_isinstance.cpython-36.pyc 0000644 00000003003 15053244155 0015526 0 ustar 00 3
\H � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )a, Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
� )�
fixer_base)�tokenc @ s e Zd ZdZdZdZdd� ZdS )�
FixIsinstanceTz�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
� c C s� t � }|d }|j}g }t|�}xx|D ]p\}} | jtjkrt| j|krt|t|�d k r�||d jtjkr�t |� q&q&|j
| � | jtjkr&|j | j� q&W |r�|d jtjkr�|d= t|�dkr�|j }
|
j
|d _
|
j|d � n||d d �< |j� d S )N�args� � ���r )�setZchildren� enumerate�typer �NAME�value�len�COMMA�next�append�add�parent�prefix�replaceZchanged) �selfZnodeZresultsZnames_insertedZtestlistr Znew_args�iterator�idx�argZatom� r �4/usr/lib64/python3.6/lib2to3/fixes/fix_isinstance.py� transform s* $
zFixIsinstance.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module>
s fixes/__pycache__/fix_itertools_imports.cpython-36.opt-2.pyc 0000644 00000002676 15053244155 0020146 0 ustar 00 3
\& � @ s6 d dl mZ d dlmZmZmZ G dd� dej�ZdS )� )�
fixer_base)� BlankLine�syms�tokenc @ s" e Zd ZdZde� Zdd� ZdS )�FixItertoolsImportsTzT
import_from< 'from' 'itertools' 'import' imports=any >
c C sl |d }|j tjks |j r$|g}n|j}x�|d d d� D ]z}|j tjkrV|j}|}n|j tjkrfd S |jd }|j}|dkr�d |_|j� q:|dkr:|j � |d d
kr�d nd |_q:W |jd d � p�|g}d
} x0|D ](}| o�|j tj
k� r�|j� q�| d
N } q�W x*|�r,|d j tj
k�r,|j � j� �qW |j�p@t |dd � �sR|j
d k�rh|j}
t� }|
|_|S d S )N�imports� r �imap�izip�ifilter� ifilterfalse� izip_longest� �f� filterfalse� zip_longestT�value)r r
r )r r
���)�typer Zimport_as_name�childrenr �NAMEr �STAR�removeZchanged�COMMA�pop�getattr�parent�prefixr ) �selfZnodeZresultsr r Zchild�memberZ name_node� member_nameZ remove_comma�p� r" �;/usr/lib64/python3.6/lib2to3/fixes/fix_itertools_imports.py� transform sB
z FixItertoolsImports.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�localsZPATTERNr$ r" r" r" r# r s
r N)Zlib2to3r Zlib2to3.fixer_utilr r r ZBaseFixr r" r" r" r# �<module> s fixes/__pycache__/fix_future.cpython-36.opt-1.pyc 0000644 00000001373 15053244155 0015647 0 ustar 00 3
\# � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zVRemove __future__ imports
from __future__ import foo is replaced with an empty line.
� )�
fixer_base)� BlankLinec @ s e Zd ZdZdZdZdd� ZdS )� FixFutureTz;import_from< 'from' module_name="__future__" 'import' any >�
c C s t � }|j|_|S )N)r �prefix)�selfZnodeZresults�new� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_future.py� transform s zFixFuture.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r
r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_imports.cpython-36.pyc 0000644 00000010350 15053244155 0015066 0 ustar 00 3
\4 � 1 @ s� d Z ddlmZ ddlmZmZ ddddddd d
d d d d
d
ddddddddddddddd d d d d d!d"d"d#d$d%d&d'd(d(d(d)d*d*d+d,d-�0Zd.d/� Zefd0d1�ZG d2d3� d3ej �Z
d4S )5z/Fix incompatible imports and module references.� )�
fixer_base)�Name�
attr_chain�io�pickle�builtins�copyregZqueueZ socketserverZ configparser�reprlibztkinter.filedialogztkinter.simpledialogztkinter.colorchooserztkinter.commondialogztkinter.dialogz tkinter.dndz tkinter.fontztkinter.messageboxztkinter.scrolledtextztkinter.constantsz tkinter.tixz tkinter.ttkZtkinterZ _markupbase�winreg�_threadZ
_dummy_threadzdbm.bsdzdbm.dumbzdbm.ndbmzdbm.gnuz
xmlrpc.clientz
xmlrpc.serverz http.clientz
html.entitiesz html.parserz http.cookieszhttp.cookiejarz http.server�
subprocess� collectionsz urllib.parsezurllib.robotparser)0�StringIOZ cStringIOZcPickleZ __builtin__Zcopy_regZQueueZ SocketServerZ ConfigParser�reprZ
FileDialogZ tkFileDialogZ SimpleDialogZtkSimpleDialogZtkColorChooserZtkCommonDialogZDialogZTkdndZtkFontZ tkMessageBoxZ ScrolledTextZ TkconstantsZTixZttkZTkinterZ
markupbase�_winregZthreadZ dummy_threadZdbhashZdumbdbmZdbmZgdbmZ xmlrpclibZDocXMLRPCServerZSimpleXMLRPCServerZhttplibZhtmlentitydefsZ
HTMLParserZCookieZ cookielibZBaseHTTPServerZSimpleHTTPServerZ
CGIHTTPServerZcommands�
UserString�UserListZurlparseZ robotparserc C s ddj tt| �� d S )N�(�|�))�join�mapr )�members� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_imports.py�
alternates= s r c c sT dj dd� | D ��}t| j� �}d||f V d| V d||f V d| V d S )Nz | c S s g | ] }d | �qS )zmodule_name='%s'r )�.0�keyr r r �
<listcomp>B s z!build_pattern.<locals>.<listcomp>zyname_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
z�import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
z�import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
z3power< bare_with_attr=(%s) trailer<'.' any > any* >)r r �keys)�mappingZmod_listZ
bare_namesr r r �
build_patternA s
r! c sT e Zd ZdZdZeZdZdd� Z� fdd�Z � fdd�Z
� fd d
�Z d d � Z � Z
S )
�
FixImportsT� c C s dj t| j��S )Nr )r r! r )�selfr r r r! ` s zFixImports.build_patternc s | j � | _tt| �j� d S )N)r! ZPATTERN�superr" �compile_pattern)r$ )� __class__r r r& c s
zFixImports.compile_patternc sH t t| �j� � |�}|rDd|kr@t� fdd�t|d�D ��r@dS |S dS )N�bare_with_attrc 3 s | ]}� |�V qd S )Nr )r �obj)�matchr r � <genexpr>q s z#FixImports.match.<locals>.<genexpr>�parentF)r% r" r* �anyr )r$ �node�results)r' )r* r r* j s zFixImports.matchc s t t| �j||� i | _d S )N)r% r" �
start_tree�replace)r$ Ztree�filename)r' r r r0 v s zFixImports.start_treec C s� |j d�}|rh|j}| j| }|jt||jd�� d|krD|| j|< d|kr�| j|�}|r�| j||� n2|d d }| jj |j�}|r�|jt||jd�� d S )NZ module_name)�prefixZ name_importZmultiple_importsr( � )�get�valuer r1 r r3 r* � transform)r$ r. r/ Z
import_modZmod_name�new_nameZ bare_namer r r r7 z s
zFixImports.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZkeep_line_order�MAPPINGr Z run_orderr! r& r* r0 r7 �
__classcell__r r )r' r r" U s r" N) �__doc__� r Z
fixer_utilr r r< r r! ZBaseFixr" r r r r �<module> sj fixes/__pycache__/fix_zip.cpython-36.pyc 0000644 00000003030 15053244155 0014170 0 ustar 00 3
\ � @ sR d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z G dd� dej �Z
dS ) a7
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�in_special_contextc @ s e Zd ZdZdZdZdd� ZdS )�FixZipTzN
power< 'zip' args=trailer< '(' [any] ')' > [trailers=trailer*]
>
zfuture_builtins.zipc C s� | j |�rd S t|�rd S |d j� }d|_g }d|kr^dd� |d D �}x|D ]
}d|_qPW ttjtd�|gdd�}ttjtd�t|g�g| �}|j|_|S ) N�args� �trailersc S s g | ] }|j � �qS � )�clone)�.0�nr r �-/usr/lib64/python3.6/lib2to3/fixes/fix_zip.py�
<listcomp>' s z$FixZip.transform.<locals>.<listcomp>�zip)�prefix�list) Z should_skipr r
r r �symsZpowerr r )�selfZnodeZresultsr r r �newr r r � transform s
zFixZip.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r s r N)�__doc__r
r Zpytreer Zpygramr r Z
fixer_utilr r r ZConditionalFixr r r r r �<module> s
fixes/__pycache__/fix_dict.cpython-36.opt-2.pyc 0000644 00000004434 15053244155 0015262 0 ustar 00 3
\� � @ sf d dl mZ d dl mZ d dl mZ d dlmZmZmZ d dl mZ ejdhB Z G dd� dej
�Z d S )
� )�pytree)�patcomp)�
fixer_base)�Name�Call�Dot)�
fixer_util�iterc @ s@ e Zd ZdZdZdd� ZdZeje�Z dZ
eje
�Z dd� Z d S )
�FixDictTa
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c
C s |d }|d d }|d }| j }|j}|jd�}|jd�} |sD| rP|dd � }dd � |D �}d
d � |D �}| o|| j||�}
|tj|jt� t||j d �g�|d j
� g } tj|j | �} |
p�| s�d
| _ t t|r�dnd�| g�} |r�tj|j | g| �} |j | _ | S )N�head�method� �tailr Zview� c S s g | ] }|j � �qS � )�clone)�.0�nr r �./usr/lib64/python3.6/lib2to3/fixes/fix_dict.py�
<listcomp>A s z%FixDict.transform.<locals>.<listcomp>c S s g | ] }|j � �qS r )r )r r r r r r B s )�prefixZparens� �list)
�syms�value�
startswith�in_special_contextr ZNodeZtrailerr r r r Zpowerr )
�self�node�resultsr r r r Z method_name�isiterZisviewZspecial�args�newr r r � transform6 s2
zFixDict.transformz3power< func=NAME trailer< '(' node=any ')' > any* >zmfor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� |j d krdS i }|j j d k r^| jj|j j |�r^|d |kr^|rN|d jtkS |d jtjkS |sfdS | jj|j |�o�|d |kS )NFr �func)�parent�p1�matchr � iter_exemptr �consuming_calls�p2)r r r r r r r r Z s
zFixDict.in_special_contextN)
�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr# ZP1r Zcompile_patternr& ZP2r* r r r r r r
) s
r
N) r r r r r r r r r) r( ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_ne.cpython-36.opt-1.pyc 0000644 00000001422 15053244155 0014732 0 ustar 00 3
\; � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z Fixer that turns <> into !=.� )�pytree)�token)�
fixer_basec @ s" e Zd ZejZdd� Zdd� ZdS )�FixNec C s
|j dkS )Nz<>)�value)�self�node� r �,/usr/lib64/python3.6/lib2to3/fixes/fix_ne.py�match s z FixNe.matchc C s t jtjd|jd�}|S )Nz!=)�prefix)r ZLeafr �NOTEQUALr )r r Zresults�newr r r
� transform s zFixNe.transformN)�__name__�
__module__� __qualname__r r
Z _accept_typer r r r r r
r s r N)�__doc__� r Zpgen2r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_itertools.cpython-36.opt-2.pyc 0000644 00000002225 15053244155 0016357 0 ustar 00 3
\ � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s* e Zd ZdZdZde� ZdZdd� ZdS )� FixItertoolsTz7('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')z�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
� c C s� d }|d d }d|krV|j d krV|d |d }}|j}|j� |j� |jj|� |p^|j}|jt|j dd � |d�� d S )
N�func� �it� ifilterfalse� izip_longest�dot� )�prefix)r r
)�valuer
�remove�parent�replacer )�selfZnodeZresultsr
r r r � r �3/usr/lib64/python3.6/lib2to3/fixes/fix_itertools.py� transform s
zFixItertools.transformN) �__name__�
__module__� __qualname__Z
BM_compatibleZit_funcs�localsZPATTERNZ run_orderr r r r r r s
r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_xrange.cpython-36.pyc 0000644 00000004725 15053244155 0014666 0 ustar 00 3
\�
� @ sF d Z ddlmZ ddlmZmZmZ ddlmZ G dd� dej�Z dS )z/Fixer that changes xrange(...) into range(...).� )�
fixer_base)�Name�Call�consuming_calls)�patcompc sh e Zd ZdZdZ� fdd�Zdd� Zdd� Zd d
� Zd d � Z d
Z
e j e
�Z
dZe j e�Zdd� Z� ZS )� FixXrangeTz�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c s t t| �j||� t� | _d S )N)�superr �
start_tree�set�transformed_xranges)�self�tree�filename)� __class__� �0/usr/lib64/python3.6/lib2to3/fixes/fix_xrange.pyr s zFixXrange.start_treec C s
d | _ d S )N)r )r r
r r r r � finish_tree s zFixXrange.finish_treec C sD |d }|j dkr | j||�S |j dkr4| j||�S tt|���d S )N�nameZxrange�range)�value�transform_xrange�transform_range�
ValueError�repr)r �node�resultsr r r r � transform s
zFixXrange.transformc C s0 |d }|j td|jd�� | jjt|�� d S )Nr r )�prefix)�replacer r r �add�id)r r r r r r r r $ s zFixXrange.transform_xrangec C sl t |�| jkrh| j|� rhttd�|d j� g�}ttd�|g|jd�}x|d D ]}|j|� qRW |S d S )Nr �args�list)r �rest)r r �in_special_contextr r Zcloner Z append_child)r r r Z
range_callZ list_call�nr r r r * s
zFixXrange.transform_rangez3power< func=NAME trailer< '(' node=any ')' > any* >z�for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C sf |j d krdS i }|j j d k rJ| jj|j j |�rJ|d |krJ|d jtkS | jj|j |�od|d |kS )NFr �func)�parent�p1�matchr r �p2)r r r r r r r$ ? s
z FixXrange.in_special_context)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r ZP1r Zcompile_patternr( ZP2r* r$ �
__classcell__r r )r r r s
r N)
�__doc__� r Z
fixer_utilr r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_next.cpython-36.opt-1.pyc 0000644 00000005703 15053244155 0015314 0 ustar 00 3
\f � @ sn d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z dZ G dd� dej
�Zd d
� Zd d � Zd
d� ZdS )z.Fixer for it.next() -> next(it), per PEP 3114.� )�token)�python_symbols)�
fixer_base)�Name�Call� find_bindingz;Calls to builtin next() possibly shadowed by global bindingc s0 e Zd ZdZdZdZ� fdd�Zdd� Z� ZS )�FixNextTa�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
Zprec s> t t| �j||� td|�}|r4| j|t� d| _nd| _d S )N�nextTF)�superr �
start_treer �warning� bind_warning�
shadowed_next)�selfZtree�filename�n)� __class__� �./usr/lib64/python3.6/lib2to3/fixes/fix_next.pyr $ s
zFixNext.start_treec C s� |j d�}|j d�}|j d�}|rr| jr>|jtd|jd�� q�dd� |D �}d|d _|jttd
|jd�|�� n�|r�td|jd�}|j|� nj|r�t|�r�|d }djd d� |D ��j� d
kr�| j |t
� d S |jtd�� nd|kr�| j |t
� d| _d S )N�base�attr�name�__next__)�prefixc S s g | ] }|j � �qS r )Zclone)�.0r r r r �
<listcomp>9 s z%FixNext.transform.<locals>.<listcomp>� � r �headc S s g | ] }t |��qS r )�str)r r r r r r E s Z __builtin__�globalT) �getr �replacer r r �is_assign_target�join�stripr r
)r �nodeZresultsr r r r r r r r � transform. s,
zFixNext.transform) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERN�orderr r' �
__classcell__r r )r r r s
r c C sF t | �}|d krdS x,|jD ]"}|jtjkr0dS t|| �r dS q W dS )NFT)� find_assign�children�typer �EQUAL�
is_subtree)r& ZassignZchildr r r r# Q s
r# c C s4 | j tjkr| S | j tjks&| jd kr*d S t| j�S )N)r/ �symsZ expr_stmtZ simple_stmt�parentr- )r& r r r r- ] s
r- c s$ | � kr dS t � fdd�| jD ��S )NTc 3 s | ]}t |� �V qd S )N)r1 )r �c)r& r r � <genexpr>g s z is_subtree.<locals>.<genexpr>)�anyr. )�rootr& r )r& r r1 d s r1 N)�__doc__Zpgen2r Zpygramr r2 r r Z
fixer_utilr r r r
ZBaseFixr r# r- r1 r r r r �<module> s @ fixes/__pycache__/fix_exec.cpython-36.opt-2.pyc 0000644 00000001650 15053244155 0015260 0 ustar 00 3
\� � @ s6 d dl mZ d dlmZmZmZ G dd� dej�ZdS )� )�
fixer_base)�Comma�Name�Callc @ s e Zd ZdZdZdd� ZdS )�FixExecTzx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� | j }|d }|jd�}|jd�}|j� g}d|d _|d k rR|jt� |j� g� |d k rn|jt� |j� g� ttd�||jd�S )N�a�b�c� � �exec)�prefix)�syms�getZcloner
�extendr r r )�selfZnodeZresultsr r r r �args� r �./usr/lib64/python3.6/lib2to3/fixes/fix_exec.py� transform s
zFixExec.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)r
r Z
fixer_utilr r r ZBaseFixr r r r r �<module>
s fixes/__pycache__/fix_imports2.cpython-36.opt-1.pyc 0000644 00000001017 15053244155 0016107 0 ustar 00 3
\! � @ s0 d Z ddlmZ ddd�ZG dd� dej�ZdS )zTFix incompatible imports and module references that must be fixed after
fix_imports.� )� fix_importsZdbm)ZwhichdbZanydbmc @ s e Zd ZdZeZdS )� FixImports2� N)�__name__�
__module__� __qualname__Z run_order�MAPPING�mapping� r
r
�2/usr/lib64/python3.6/lib2to3/fixes/fix_imports2.pyr s r N)�__doc__� r r Z
FixImportsr r
r
r
r �<module> s fixes/__pycache__/fix_exitfunc.cpython-36.opt-2.pyc 0000644 00000004233 15053244155 0016161 0 ustar 00 3
\� � @ sF d dl mZmZ d dlmZmZmZmZmZm Z G dd� dej
�Z dS )� )�pytree�
fixer_base)�Name�Attr�Call�Comma�Newline�symsc s< e Zd ZdZdZdZ� fdd�Z� fdd�Zdd� Z� Z S ) � FixExitfuncTa�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c s t t| �j|� d S )N)�superr
�__init__)�self�args)� __class__� �2/usr/lib64/python3.6/lib2to3/fixes/fix_exitfunc.pyr s zFixExitfunc.__init__c s t t| �j||� d | _d S )N)r r
�
start_tree�
sys_import)r
Ztree�filename)r r r r ! s zFixExitfunc.start_treec C s& d|kr | j d kr |d | _ d S |d j� }d|_tjtjttd�td���}t ||g|j�}|j
|� | j d kr�| j |d� d S | j j d }|j
tjkr�|jt� � |jtdd�� nj| j j}|j j| j �}|j} tjtjtd �tdd�g�}
tjtj|
g�} |j|d t� � |j|d
| � d S ) Nr �func� �atexit�registerzKCan't find sys import; Please add an atexit import at the top of your file.� � �import� )r Zclone�prefixr ZNoder Zpowerr r r �replaceZwarningZchildren�typeZdotted_as_namesZ append_childr �parent�indexZ import_nameZ simple_stmtZ insert_childr ) r
ZnodeZresultsr r Zcall�namesZcontaining_stmtZpositionZstmt_containerZ
new_import�newr r r � transform% s2
zFixExitfunc.transform)
�__name__�
__module__� __qualname__Zkeep_line_orderZ
BM_compatibleZPATTERNr r r$ �
__classcell__r r )r r r
s r
N) Zlib2to3r r Zlib2to3.fixer_utilr r r r r r ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_exec.cpython-36.pyc 0000644 00000002150 15053244155 0014314 0 ustar 00 3
\� � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )z�Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
� )�
fixer_base)�Comma�Name�Callc @ s e Zd ZdZdZdd� ZdS )�FixExecTzx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� |st �| j}|d }|jd�}|jd�}|j� g}d|d _|d k rZ|jt� |j� g� |d k rv|jt� |j� g� ttd�||jd�S )N�a�b�c� � �exec)�prefix) �AssertionError�syms�getZcloner
�extendr r r )�selfZnodeZresultsr r r r �args� r �./usr/lib64/python3.6/lib2to3/fixes/fix_exec.py� transform s
zFixExec.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) �__doc__r
r Z
fixer_utilr r r ZBaseFixr r r r r �<module>
s fixes/__pycache__/fix_map.cpython-36.opt-1.pyc 0000644 00000006000 15053244155 0015102 0 ustar 00 3
\8 � @ sf d Z ddlmZ ddlmZ ddlmZmZmZm Z m
Z
ddl m Z
ddlmZ G dd� dej�Zd S )
a Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
� )�token)�
fixer_base)�Name�ArgList�Call�ListComp�in_special_context)�python_symbols)�Nodec @ s e Zd ZdZdZdZdd� ZdS )�FixMapTaL
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
[extra_trailers=trailer*]
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'map' args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.mapc C s� | j |�rd S g }d|kr:x |d D ]}|j|j� � q$W |jjtjkrv| j|d� |j� }d|_t t
d�|g�}�n&d|kr�t |d j� |d j� |d j� �}t tj
|g| dd �}n�d
|kr�|d j� }d|_n�d |k�rj|d }|jtjk�rL|jd
jtjk�rL|jd
jd jtjk�rL|jd
jd jdk�rL| j|d� d S t tj
t
d�|j� g�}d|_t|��rxd S t tj
t
d�t|g�g| �}d|_|j|_|S )NZextra_trailersz You should use a for loop here� �listZ
map_lambdaZxp�fp�it)�prefixZmap_none�arg�args� � �Nonezjcannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence�map)Z should_skip�appendZclone�parent�type�symsZ simple_stmtZwarningr r r r r
ZpowerZtrailerZchildrenZarglistr �NAME�valuer r )�selfZnodeZresultsZtrailers�t�newr � r �-/usr/lib64/python3.6/lib2to3/fixes/fix_map.py� transform@ sF
zFixMap.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr" r r r r! r s r N)�__doc__Zpgen2r r r Z
fixer_utilr r r r r Zpygramr r Zpytreer
ZConditionalFixr r r r r! �<module> s fixes/__pycache__/fix_unicode.cpython-36.opt-1.pyc 0000644 00000002762 15053244155 0015766 0 ustar 00 3
\� � @ s< d Z ddlmZ ddlmZ ddd�ZG dd� dej�Zd S )
z�Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
� )�token)�
fixer_base�chr�str)ZunichrZunicodec s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�
FixUnicodeTz STRING | 'unicode' | 'unichr'c s" t t| �j||� d|jk| _d S )N�unicode_literals)�superr �
start_treeZfuture_featuresr )�selfZtree�filename)� __class__� �1/usr/lib64/python3.6/lib2to3/fixes/fix_unicode.pyr s zFixUnicode.start_treec C s� |j tjkr$|j� }t|j |_|S |j tjkr�|j}| j rl|d dkrld|krldjdd� |j d�D ��}|d dkr�|dd � }||jkr�|S |j� }||_|S d S ) N� z'"�\z\\c S s g | ]}|j d d�j dd��qS )z\uz\\uz\Uz\\U)�replace)�.0�vr
r
r �
<listcomp>! s z(FixUnicode.transform.<locals>.<listcomp>ZuU� )
�typer �NAMEZclone�_mapping�value�STRINGr �join�split)r
ZnodeZresults�new�valr
r
r � transform s"
zFixUnicode.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r �
__classcell__r
r
)r r r s r N)�__doc__Zpgen2r � r r ZBaseFixr r
r
r
r �<module> s
fixes/__pycache__/fix_idioms.cpython-36.opt-1.pyc 0000644 00000007336 15053244155 0015626 0 ustar 00 3
\ � @ sN d Z ddlmZ ddlmZmZmZmZmZm Z dZ
dZ G dd� dej �Z
dS ) a� Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
� )�
fixer_base)�Call�Comma�Name�Node� BlankLine�symsz0(n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)z(power< 'type' trailer< '(' x=any ')' > >c sP e Zd ZdZdeeeef Z� fdd�Zdd� Zdd� Z d d
� Z
d d � Z � Z S )
� FixIdiomsTa�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c s8 t t| �j|�}|r4d|kr4|d |d kr0|S d S |S )N�sortedZid1Zid2)�superr �match)�self�node�r)� __class__� �0/usr/lib64/python3.6/lib2to3/fixes/fix_idioms.pyr O s zFixIdioms.matchc C sH d|kr| j ||�S d|kr(| j||�S d|kr<| j||�S td��d S )N�
isinstance�whiler
z
Invalid match)�transform_isinstance�transform_while�transform_sort� RuntimeError)r
r �resultsr r r � transformZ s zFixIdioms.transformc C sh |d j � }|d j � }d|_d|_ttd�|t� |g�}d|kr\d|_ttjtd�|g�}|j|_|S )N�x�T� � r �n�not)�clone�prefixr r r r r Znot_test)r
r r r r Ztestr r r r d s z FixIdioms.transform_isinstancec C s |d }|j td|jd�� d S )Nr �True)r" )�replacer r" )r
r r Zoner r r r p s zFixIdioms.transform_whilec C s� |d }|d }|j d�}|j d�}|r>|jtd|jd�� n8|rn|j� }d|_|jttd�|g|jd�� ntd��|j� |j}d |kr�|r�|jd �d
|d
jf} d j | �|d
_n"t
� }
|j j |
� |jd �d
|
_d S ) N�sort�next�list�exprr
)r" r z should not have reached here�
� )
�getr$ r r" r! r r �remove�
rpartition�joinr �parentZ append_child) r
r r Z sort_stmtZ next_stmtZ list_callZ simple_expr�newZbtwnZ prefix_linesZend_liner r r r t s*
zFixIdioms.transform_sort)
�__name__�
__module__� __qualname__Zexplicit�TYPE�CMPZPATTERNr r r r r �
__classcell__r r )r r r % s '
r N)�__doc__r r Z
fixer_utilr r r r r r r5 r4 ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_renames.cpython-36.opt-2.pyc 0000644 00000003544 15053244155 0015772 0 ustar 00 3
\� � @ sR d dl mZ d dlmZmZ dddiiZi Zdd� Zdd � ZG d
d � d ej �Z
d S )
� )�
fixer_base)�Name�
attr_chain�sysZmaxint�maxsizec C s ddj tt| �� d S )N�(�|�))�join�map�repr)�members� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_renames.py�
alternates s r c c sb x\t tj� �D ]L\} }xBt |j� �D ]2\}}|t| |f< d| ||f V d| |f V q$W qW d S )Nz�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
z^
power< module_name=%r trailer< '.' attr_name=%r > any* >
)�list�MAPPING�items�LOOKUP)�module�replaceZold_attr�new_attrr r r �
build_pattern s
r c s8 e Zd ZdZdje� �ZdZ� fdd�Zdd� Z � Z
S )�
FixRenamesTr Zprec s@ t t| �j� � |�}|r<t� fdd�t|d�D ��r8dS |S dS )Nc 3 s | ]}� |�V qd S )Nr )�.0�obj)�matchr r � <genexpr>5 s z#FixRenames.match.<locals>.<genexpr>�parentF)�superr r �anyr )�self�node�results)� __class__)r r r 1 s zFixRenames.matchc C sD |j d�}|j d�}|r@|r@t|j|jf }|jt||jd�� d S )NZ module_name� attr_name)�prefix)�getr �valuer r r& )r! r" r# Zmod_namer% r r r r � transform> s
zFixRenames.transform) �__name__�
__module__� __qualname__Z
BM_compatibler
r ZPATTERN�orderr r) �
__classcell__r r )r$ r r * s
r N) � r Z
fixer_utilr r r r r r ZBaseFixr r r r r �<module>
s fixes/__pycache__/fix_except.cpython-36.pyc 0000644 00000005355 15053244155 0014672 0 ustar 00 3
\
� @ sf d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z m Z dd� Z
G dd � d ej�Zd
S ) a� Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
� )�pytree)�token)�
fixer_base)�Assign�Attr�Name�is_tuple�is_list�symsc c sH xBt | �D ]6\}}|jtjkr
|jd jdkr
|| |d fV q
W d S )N� �exceptr )� enumerate�typer
�
except_clause�children�value)Znodes�i�n� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_except.py� find_excepts s r c @ s e Zd ZdZdZdd� ZdS )� FixExceptTa1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C s� | j }dd� |d D �}dd� |d D �}�x*t|�D �] \}}t|j�dkr6|jdd� \}} }
| jtdd d
�� |
jtjk�rDt| j � d d
�} |
j
� } d | _ |
j| � | j
� } |j}
x"t |
�D ]\}}t
|tj�r�P q�W t|
�s�t|
��rt| t| td ���}n
t| | �}x&t|
d |� �D ]}|jd
|� �q W |j||� q6|
j d kr6d |
_ q6W dd� |jd d� D �| | }tj|j|�S )Nc S s g | ] }|j � �qS r )�clone)�.0r r r r �
<listcomp>2 s z'FixExcept.transform.<locals>.<listcomp>�tailc S s g | ] }|j � �qS r )r )r Zchr r r r 4 s Zcleanup� � �as� )�prefix� �argsr c S s g | ] }|j � �qS r )r )r �cr r r r \ s � )r
r �lenr �replacer r r �NAME�new_namer r r
�
isinstancer ZNoder r r r �reversedZ insert_child)�selfZnodeZresultsr
r Z try_cleanupr Ze_suite�EZcomma�NZnew_N�targetZ suite_stmtsr ZstmtZassignZchildr r r r � transform/ s6
zFixExcept.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr/ r r r r r $ s r N)�__doc__r! r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_repr.cpython-36.opt-2.pyc 0000644 00000001370 15053244155 0015303 0 ustar 00 3
\e � @ s6 d dl mZ d dlmZmZmZ G dd� dej�ZdS )� )�
fixer_base)�Call�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixReprTz7
atom < '`' expr=any '`' >
c C s8 |d j � }|j| jjkr"t|�}ttd�|g|jd�S )N�expr�repr)�prefix)Zclone�typeZsymsZ testlist1r r r r )�selfZnodeZresultsr � r �./usr/lib64/python3.6/lib2to3/fixes/fix_repr.py� transform s zFixRepr.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N)� r Z
fixer_utilr r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_types.cpython-36.pyc 0000644 00000003420 15053244155 0014535 0 ustar 00 3
\� � @ sp d Z ddlmZ ddlmZ ddddddd d
d d d d
dddddddddd�Zdd� eD �ZG dd� dej�ZdS ) a� Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
� )�
fixer_base)�Name�bool�
memoryview�type�complex�dictztype(Ellipsis)�float�int�list�objectz
type(None)ztype(NotImplemented)�slice�bytesz(str,)�tuple�str�range)Z BooleanTypeZ
BufferTypeZ ClassTypeZ ComplexTypeZDictTypeZDictionaryTypeZ EllipsisTypeZ FloatTypeZIntTypeZListTypeZLongTypeZ
ObjectTypeZNoneTypeZNotImplementedTypeZ SliceTypeZ
StringTypeZ StringTypesZ TupleTypeZTypeTypeZ UnicodeTypeZ
XRangeTypec C s g | ] }d | �qS )z)power< 'types' trailer< '.' name='%s' > >� )�.0�tr r �//usr/lib64/python3.6/lib2to3/fixes/fix_types.py�
<listcomp>3 s r c @ s" e Zd ZdZdje�Zdd� ZdS )�FixTypesT�|c C s& t j|d j�}|r"t||jd�S d S )N�name)�prefix)�
_TYPE_MAPPING�get�valuer r )�selfZnodeZresultsZ new_valuer r r � transform9 s zFixTypes.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�join�_patsZPATTERNr r r r r r 5 s
r N) �__doc__� r Z
fixer_utilr r r$ ZBaseFixr r r r r �<module> s2 fixes/__pycache__/fix_paren.cpython-36.pyc 0000644 00000002531 15053244155 0014500 0 ustar 00 3
\� � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )zuFixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``.� )�
fixer_base)�LParen�RParenc @ s e Zd ZdZdZdd� ZdS )�FixParenTa
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C s8 |d }t � }|j|_d|_|jd|� |jt� � d S )N�target� � )r �prefixZ insert_childZ append_childr )�selfZnodeZresultsr Zlparen� r �//usr/lib64/python3.6/lib2to3/fixes/fix_paren.py� transform% s zFixParen.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__r r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_imports.cpython-36.opt-2.pyc 0000644 00000010250 15053244155 0016025 0 ustar 00 3
\4 � 1 @ s� d dl mZ d dlmZmZ dddddddd d
d d d d d
ddddddddddddddd d d d d d!d!d"d#d$d%d&d'd'd'd(d)d)d*d+d,�0Zd-d.� Zefd/d0�ZG d1d2� d2ej�Z d3S )4� )�
fixer_base)�Name�
attr_chain�io�pickle�builtins�copyregZqueueZ socketserverZ configparser�reprlibztkinter.filedialogztkinter.simpledialogztkinter.colorchooserztkinter.commondialogztkinter.dialogz tkinter.dndz tkinter.fontztkinter.messageboxztkinter.scrolledtextztkinter.constantsz tkinter.tixz tkinter.ttkZtkinterZ _markupbase�winreg�_threadZ
_dummy_threadzdbm.bsdzdbm.dumbzdbm.ndbmzdbm.gnuz
xmlrpc.clientz
xmlrpc.serverz http.clientz
html.entitiesz html.parserz http.cookieszhttp.cookiejarz http.server�
subprocess� collectionsz urllib.parsezurllib.robotparser)0�StringIOZ cStringIOZcPickleZ __builtin__Zcopy_regZQueueZ SocketServerZ ConfigParser�reprZ
FileDialogZ tkFileDialogZ SimpleDialogZtkSimpleDialogZtkColorChooserZtkCommonDialogZDialogZTkdndZtkFontZ tkMessageBoxZ ScrolledTextZ TkconstantsZTixZttkZTkinterZ
markupbase�_winregZthreadZ dummy_threadZdbhashZdumbdbmZdbmZgdbmZ xmlrpclibZDocXMLRPCServerZSimpleXMLRPCServerZhttplibZhtmlentitydefsZ
HTMLParserZCookieZ cookielibZBaseHTTPServerZSimpleHTTPServerZ
CGIHTTPServerZcommands�
UserString�UserListZurlparseZ robotparserc C s ddj tt| �� d S )N�(�|�))�join�mapr )�members� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_imports.py�
alternates= s r c c sT dj dd� | D ��}t| j� �}d||f V d| V d||f V d| V d S )Nz | c S s g | ] }d | �qS )zmodule_name='%s'r )�.0�keyr r r �
<listcomp>B s z!build_pattern.<locals>.<listcomp>zyname_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
z�import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
z�import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
z3power< bare_with_attr=(%s) trailer<'.' any > any* >)r r �keys)�mappingZmod_listZ
bare_namesr r r �
build_patternA s
r! c sT e Zd ZdZdZeZdZdd� Z� fdd�Z � fdd�Z
� fd d
�Z d d � Z � Z
S )
�
FixImportsT� c C s dj t| j��S )Nr )r r! r )�selfr r r r! ` s zFixImports.build_patternc s | j � | _tt| �j� d S )N)r! ZPATTERN�superr" �compile_pattern)r$ )� __class__r r r& c s
zFixImports.compile_patternc sH t t| �j� � |�}|rDd|kr@t� fdd�t|d�D ��r@dS |S dS )N�bare_with_attrc 3 s | ]}� |�V qd S )Nr )r �obj)�matchr r � <genexpr>q s z#FixImports.match.<locals>.<genexpr>�parentF)r% r" r* �anyr )r$ �node�results)r' )r* r r* j s zFixImports.matchc s t t| �j||� i | _d S )N)r% r" �
start_tree�replace)r$ Ztree�filename)r' r r r0 v s zFixImports.start_treec C s� |j d�}|rh|j}| j| }|jt||jd�� d|krD|| j|< d|kr�| j|�}|r�| j||� n2|d d }| jj |j�}|r�|jt||jd�� d S )NZ module_name)�prefixZ name_importZmultiple_importsr( � )�get�valuer r1 r r3 r* � transform)r$ r. r/ Z
import_modZmod_name�new_nameZ bare_namer r r r7 z s
zFixImports.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZkeep_line_order�MAPPINGr Z run_orderr! r& r* r0 r7 �
__classcell__r r )r' r r" U s r" N)
� r Z
fixer_utilr r r< r r! ZBaseFixr" r r r r �<module> sh fixes/__pycache__/fix_standarderror.cpython-36.opt-2.pyc 0000644 00000001205 15053244155 0017202 0 ustar 00 3
\� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�FixStandarderrorTz-
'StandardError'
c C s t d|jd�S )N� Exception)�prefix)r r )�selfZnodeZresults� r �7/usr/lib64/python3.6/lib2to3/fixes/fix_standarderror.py� transform s zFixStandarderror.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_asserts.cpython-36.opt-2.pyc 0000644 00000002236 15053244155 0016021 0 ustar 00 3
\� � @ sP d dl mZ d dlmZ eddddddd dddddd
d d �ZG d
d� de�ZdS )� )�BaseFix)�NameZ
assertTrueZ assertEqualZassertNotEqualZassertAlmostEqualZassertNotAlmostEqualZ assertRegexZassertRaisesRegexZ assertRaisesZ assertFalse)Zassert_Z assertEqualsZassertNotEqualsZassertAlmostEqualsZassertNotAlmostEqualsZassertRegexpMatchesZassertRaisesRegexpZfailUnlessEqualZ failIfEqualZfailUnlessAlmostEqualZfailIfAlmostEqualZ
failUnlessZfailUnlessRaisesZfailIfc @ s( e Zd Zddjeee�� Zdd� ZdS )�
FixAssertszH
power< any+ trailer< '.' meth=(%s)> any* >
�|c C s, |d d }|j ttt|� |jd�� d S )N�meth� )�prefix)�replacer �NAMES�strr )�selfZnodeZresults�name� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_asserts.py� transform s zFixAsserts.transformN) �__name__�
__module__� __qualname__�join�map�reprr
ZPATTERNr r r r r r s r N)Z
fixer_baser Z
fixer_utilr �dictr
r r r r r �<module> s" fixes/__pycache__/fix_raise.cpython-36.opt-2.pyc 0000644 00000003105 15053244155 0015434 0 ustar 00 3
\n � @ sV d dl mZ d dlmZ d dl mZ d dlmZmZmZm Z m
Z
G dd� dej �Z dS )� )�pytree)�token)�
fixer_base)�Name�Call�Attr�ArgList�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixRaiseTzB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c C sl | j }|d j� }|jtjkr2d}| j||� d S t|�rbx t|�rZ|jd jd j� }q<W d|_d|kr�t j
|j t d�|g�}|j|_|S |d j� }t|�r�dd � |jdd� D �}n d
|_|g}d |k�rF|d j� } d
| _|}
|jtj
kp�|jd k�rt||�}
t|
t d
��t| g�g } t j
|jt d�g| �}|j|_|S t j
|j t d�t||�g|jd�S d S )N�excz+Python 3 does not support string exceptions� � � �val�raisec S s g | ] }|j � �qS � )�clone)�.0�cr r �//usr/lib64/python3.6/lib2to3/fixes/fix_raise.py�
<listcomp>D s z&FixRaise.transform.<locals>.<listcomp>� �tb�None�with_traceback)�prefix���)�symsr �typer �STRINGZcannot_convertr Zchildrenr r ZNodeZ
raise_stmtr �NAME�valuer r r Z simple_stmt) �selfZnodeZresultsr r �msg�newr �argsr �eZwith_tbr r r � transform& s@
zFixRaise.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r r r r r
s r
N)
r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_sys_exc.cpython-36.opt-1.pyc 0000644 00000002544 15053244155 0016013 0 ustar 00 3
\
� @ sJ d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
G dd� dej �Z dS )z�Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
� )�
fixer_base)�Attr�Call�Name�Number� Subscript�Node�symsc @ s: e Zd ZdddgZdZddjdd� eD �� Zd d
� Zd S ) � FixSysExc�exc_type� exc_value�
exc_tracebackTzN
power< 'sys' trailer< dot='.' attribute=(%s) > >
�|c c s | ]}d | V qdS )z'%s'N� )�.0�er r �1/usr/lib64/python3.6/lib2to3/fixes/fix_sys_exc.py� <genexpr> s zFixSysExc.<genexpr>c C st |d d }t | jj|j��}ttd�|jd�}ttd�|�}|d j|d jd _|j t
|�� t t j
||jd�S )NZ attribute� �exc_info)�prefix�sys�dot� )r r �index�valuer r r r Zchildren�appendr r r Zpower)�selfZnodeZresultsZsys_attrr Zcall�attrr r r � transform s zFixSysExc.transformN)�__name__�
__module__� __qualname__r Z
BM_compatible�joinZPATTERNr r r r r r
s
r
N)
�__doc__� r Z
fixer_utilr r r r r r r ZBaseFixr
r r r r �<module> s $ fixes/__pycache__/fix_execfile.cpython-36.pyc 0000644 00000003224 15053244155 0015157 0 ustar 00 3
\ � @ sV d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
m Z m Z m
Z
G dd� dej�ZdS )zoFixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
� )�
fixer_base)
�Comma�Name�Call�LParen�RParen�Dot�Node�ArgList�String�symsc @ s e Zd ZdZdZdd� ZdS )� FixExecfileTz�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s0 |st �|d }|jd�}|jd�}|jd jd j� }t|j� t� tdd�g|d�}ttj t
d�|g�}ttj t � t
d �g�ttj t
� t� g�g} |g| }
|j� } d| _td
d�} |
t� | t� | g }
tt
d �|
d �}|g}|d k � r�|jt� |j� g� |d k �r |jt� |j� g� tt
d
�||jd�S )N�filename�globals�locals� z"rb"� )Zrparen�open�readz'exec'�compile� �exec)�prefix���r )�AssertionError�getZchildrenZcloner
r r r r Zpowerr Ztrailerr r r r r �extend)�selfZnodeZresultsr r r Zexecfile_parenZ open_argsZ open_callr Z open_exprZ filename_argZexec_strZ compile_argsZ compile_call�args� r �2/usr/lib64/python3.6/lib2to3/fixes/fix_execfile.py� transform s,
zFixExecfile.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr! r r r r r
s r
N)�__doc__r r Z
fixer_utilr r r r r r r r
r r ZBaseFixr
r r r r �<module> s 0 fixes/__pycache__/fix_types.cpython-36.opt-1.pyc 0000644 00000003420 15053244155 0015474 0 ustar 00 3
\� � @ sp d Z ddlmZ ddlmZ ddddddd d
d d d d
dddddddddd�Zdd� eD �ZG dd� dej�ZdS ) a� Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
� )�
fixer_base)�Name�bool�
memoryview�type�complex�dictztype(Ellipsis)�float�int�list�objectz
type(None)ztype(NotImplemented)�slice�bytesz(str,)�tuple�str�range)Z BooleanTypeZ
BufferTypeZ ClassTypeZ ComplexTypeZDictTypeZDictionaryTypeZ EllipsisTypeZ FloatTypeZIntTypeZListTypeZLongTypeZ
ObjectTypeZNoneTypeZNotImplementedTypeZ SliceTypeZ
StringTypeZ StringTypesZ TupleTypeZTypeTypeZ UnicodeTypeZ
XRangeTypec C s g | ] }d | �qS )z)power< 'types' trailer< '.' name='%s' > >� )�.0�tr r �//usr/lib64/python3.6/lib2to3/fixes/fix_types.py�
<listcomp>3 s r c @ s" e Zd ZdZdje�Zdd� ZdS )�FixTypesT�|c C s& t j|d j�}|r"t||jd�S d S )N�name)�prefix)�
_TYPE_MAPPING�get�valuer r )�selfZnodeZresultsZ new_valuer r r � transform9 s zFixTypes.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�join�_patsZPATTERNr r r r r r 5 s
r N) �__doc__� r Z
fixer_utilr r r$ ZBaseFixr r r r r �<module> s2 fixes/__pycache__/fix_isinstance.cpython-36.opt-2.pyc 0000644 00000002303 15053244155 0016470 0 ustar 00 3
\H � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�tokenc @ s e Zd ZdZdZdZdd� ZdS )�
FixIsinstanceTz�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
� c C s� t � }|d }|j}g }t|�}xx|D ]p\}} | jtjkrt| j|krt|t|�d k r�||d jtjkr�t |� q&q&|j
| � | jtjkr&|j | j� q&W |r�|d jtjkr�|d= t|�dkr�|j }
|
j
|d _
|
j|d � n||d d �< |j� d S )N�args� � ���r )�setZchildren� enumerate�typer �NAME�value�len�COMMA�next�append�add�parent�prefix�replaceZchanged) �selfZnodeZresultsZnames_insertedZtestlistr Znew_args�iterator�idx�argZatom� r �4/usr/lib64/python3.6/lib2to3/fixes/fix_isinstance.py� transform s* $
zFixIsinstance.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_import.cpython-36.opt-2.pyc 0000644 00000004632 15053244155 0015651 0 ustar 00 3
\� � @ sV d dl mZ ddlmZmZmZmZ d dlmZm Z m
Z
dd� Z G dd� dej �Z
d S )
� )�
fixer_base� )�dirname�join�exists�sep)�
FromImport�syms�tokenc c s� | g}x�|r�|j � }|jtjkr*|jV q|jtjkrPdjdd� |jD ��V q|jtj krn|j
|jd � q|jtj kr�|j |jd d d� � qt
d��qW d S )N� c S s g | ]
}|j �qS � )�value)�.0Zchr r �0/usr/lib64/python3.6/lib2to3/fixes/fix_import.py�
<listcomp> s z$traverse_imports.<locals>.<listcomp>r r zunknown node type���)�pop�typer
�NAMEr
r Z dotted_namer �childrenZdotted_as_name�appendZdotted_as_names�extend�AssertionError)�names�pending�noder r r �traverse_imports s
r c s4 e Zd ZdZdZ� fdd�Zdd� Zdd� Z� ZS ) � FixImportTzj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c s" t t| �j||� d|jk| _d S )NZabsolute_import)�superr �
start_treeZfuture_features�skip)�selfZtree�name)� __class__r r r / s zFixImport.start_treec C s� | j r
d S |d }|jtjkrZxt|d�s6|jd }q W | j|j�r�d|j |_|j� n^d}d}x$t |�D ]}| j|�r�d}qld}qlW |r�|r�| j
|d� d S t d|g�}|j |_ |S d S )N�impr
r �.FTz#absolute and local imports together)
r r r Z import_from�hasattrr �probably_a_local_importr
Zchangedr Zwarningr �prefix)r! r Zresultsr$ Z
have_localZ
have_absoluteZmod_name�newr r r � transform3 s,
zFixImport.transformc C sv |j d�rdS |jdd�d }t| j�}t||�}ttt|�d��sHdS x(dtddd d
gD ]}t|| �rZd S qZW dS ) Nr% F� r z __init__.pyz.pyz.pycz.soz.slz.pydT)�
startswith�splitr �filenamer r r )r! Zimp_name� base_pathZextr r r r' U s
z!FixImport.probably_a_local_import) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r* r' �
__classcell__r r )r# r r & s
"r N)r r Zos.pathr r r r Z
fixer_utilr r r
r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_exec.cpython-36.opt-1.pyc 0000644 00000002116 15053244155 0015255 0 ustar 00 3
\� � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )z�Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
� )�
fixer_base)�Comma�Name�Callc @ s e Zd ZdZdZdd� ZdS )�FixExecTzx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� | j }|d }|jd�}|jd�}|j� g}d|d _|d k rR|jt� |j� g� |d k rn|jt� |j� g� ttd�||jd�S )N�a�b�c� � �exec)�prefix)�syms�getZcloner
�extendr r r )�selfZnodeZresultsr r r r �args� r �./usr/lib64/python3.6/lib2to3/fixes/fix_exec.py� transform s
zFixExec.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) �__doc__r
r Z
fixer_utilr r r ZBaseFixr r r r r �<module>
s fixes/__pycache__/fix_has_key.cpython-36.opt-2.pyc 0000644 00000004373 15053244155 0015764 0 ustar 00 3
\| � @ s> d dl mZ d dl mZ d dlmZmZ G dd� dej�ZdS )� )�pytree)�
fixer_base)�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )� FixHasKeyTa�
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
c
C s| | j }|jj|jkr&| jj|j�r&d S |jd�}|d }|j}dd� |d D �}|d j� }|jd�} | rxdd� | D �} |j|j |j|j
|j |j |j
|jfkr�t|�}t|�d kr�|d
}ntj|j|�}d |_td d d
�}
|r�tdd d
�} tj|j| |
f�}
tj|j ||
|f�} | �r8t| �} tj|j| ft| � �} |jj|j |j|j|j|j|j|j |j |jf k�rrt| �} || _| S )N�negation�anchorc S s g | ] }|j � �qS � )�clone)�.0�nr r �1/usr/lib64/python3.6/lib2to3/fixes/fix_has_key.py�
<listcomp>R s z'FixHasKey.transform.<locals>.<listcomp>�before�arg�afterc S s g | ] }|j � �qS r )r
)r r r r r
r V s � � � �in)�prefix�not) �syms�parent�typeZnot_test�pattern�match�getr r
Z
comparisonZand_testZor_testZtestZlambdefZargumentr �lenr ZNodeZpowerr Zcomp_op�tuple�exprZxor_exprZand_exprZ
shift_exprZ
arith_exprZtermZfactor)
�selfZnodeZresultsr r r r r r r Zn_opZn_not�newr r r
� transformG sD
zFixHasKey.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr# r r r r
r & s r N)� r r Z
fixer_utilr r ZBaseFixr r r r r
�<module>! s fixes/__pycache__/fix_tuple_params.cpython-36.pyc 0000644 00000010737 15053244155 0016076 0 ustar 00 3
\� � @ s� d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z m Z dd� Z
G dd � d ej�Zd
d � Zd d
� Zg dfdd�Zdd� ZdS )a: Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
� )�pytree)�token)�
fixer_base)�Assign�Name�Newline�Number� Subscript�symsc C s t | tj�o | jd jtjkS )N� )�
isinstancer �Node�children�typer �STRING)�stmt� r �6/usr/lib64/python3.6/lib2to3/fixes/fix_tuple_params.py� is_docstring s r c @ s( e Zd ZdZdZdZdd� Zdd� ZdS ) �FixTupleParams� Ta
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s� d|kr�j ||�S g �|d }|d }|d jd jtjkrZd}|d jd j}t� � nd}d}tjtjd�� d� ��fd
d � }|jt j
kr�||� n@|jt j kr�x2t |j�D ]$\}} | jt j
kr�|| |dkd � q�W �s�d S x�D ]}
|d |
_
q�W |} |dk�rd
�d _n&t|d j| ��r8|�d _|d } x�D ]}
|d |
_
�q>W �|d j| | �< x4t| d | t�� d �D ]}||d j| _�q�W |d j� d S )N�lambda�suite�argsr � r z; � Fc s\ t �j� �}| j� }d|_t||j� �}|r2d|_| j|� �jtjt j
|� j� g�� d S )Nr � ) r �new_name�clone�prefixr �replace�appendr r
r
Z simple_stmt)Z tuple_arg�
add_prefix�n�argr )�end� new_lines�selfr r � handle_tupleC s
z.FixTupleParams.transform.<locals>.handle_tuple)r" r )F)�transform_lambdar r r �INDENT�valuer r ZLeafr
ZtfpdefZ
typedargslist� enumerate�parentr r �range�lenZchanged) r' �node�resultsr r �start�indentr( �ir$ �line�afterr )r% r& r' r � transform. sF
zFixTupleParams.transformc
C s� |d }|d }t |d �}|jtjkrD|j� }d|_|j|� d S t|�}t|�}| j t
|��}t |dd�} |j| j� � xd|j � D ]X}
|
jtjkr�|
j
|kr�dd� ||
j
D �} tjtj| j� g| �} |
j| _|
j| � q�W d S )Nr �body�innerr )r c S s g | ] }|j � �qS r )r )�.0�cr r r �
<listcomp>� s z3FixTupleParams.transform_lambda.<locals>.<listcomp>)�
simplify_argsr r �NAMEr r r � find_params� map_to_indexr �
tuple_namer Z
post_orderr+ r r
r
Zpower)
r' r0 r1 r r8 r9 ZparamsZto_indexZtup_nameZ new_paramr# Z
subscripts�newr r r r) n s(
z FixTupleParams.transform_lambdaN)�__name__�
__module__� __qualname__Z run_orderZ
BM_compatibleZPATTERNr7 r) r r r r r s
@r c C sR | j tjtjfkr| S | j tjkrBx| j tjkr<| jd } q$W | S td| ��d S )Nr zReceived unexpected node %s)r r
Zvfplistr r> �vfpdefr � RuntimeError)r0 r r r r= � s r= c C s< | j tjkrt| jd �S | j tjkr,| jS dd� | jD �S )Nr c S s g | ]}|j tjkrt|��qS r )r r �COMMAr? )r: r; r r r r< � s z find_params.<locals>.<listcomp>)r r
rF r? r r r> r+ )r0 r r r r? � s
r? Nc C s^ |d kr i }xLt | �D ]@\}}ttt|���g}t|t�rJt|||d� q|| ||< qW |S )N)�d)r, r r �strr �listr@ )�
param_listr rI r4 �objZtrailerr r r r@ � s
r@ c C s@ g }x0| D ](}t |t�r(|jt|�� q
|j|� q
W dj|�S )N�_)r rK r! rA �join)rL �lrM r r r rA � s
rA )�__doc__r r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r= r? r@ rA r r r r �<module> s l fixes/__pycache__/fix_xreadlines.cpython-36.opt-1.pyc 0000644 00000002110 15053244155 0016461 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zpFix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixXreadlinesTz�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C s@ |j d�}|r$|jtd|jd�� n|jdd� |d D �� d S )N�no_call�__iter__)�prefixc S s g | ] }|j � �qS � )Zclone)�.0�xr r �4/usr/lib64/python3.6/lib2to3/fixes/fix_xreadlines.py�
<listcomp> s z+FixXreadlines.transform.<locals>.<listcomp>Zcall)�get�replacer r )�selfZnodeZresultsr r r r � transform s
zFixXreadlines.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_operator.cpython-36.opt-2.pyc 0000644 00000007221 15053244155 0016167 0 ustar 00 3
\�
� @ sJ d dl Z d dlmZ d dlmZmZmZmZ dd� ZG dd� dej �Z
dS )� N)�
fixer_base)�Call�Name�String� touch_importc s � fdd�}|S )Nc s
� | _ | S )N)�
invocation)�f)�s� �2/usr/lib64/python3.6/lib2to3/fixes/fix_operator.py�dec s zinvocation.<locals>.decr
)r r r
)r r r s r c @ s� e Zd ZdZdZdZdZdeeed� Zdd� Z e
d �d
d � �Z e
d �d
d� �Z e
d�dd� �Z
e
d�dd� �Ze
d�dd� �Ze
d�dd� �Ze
d�d d � �Zd d � Zd d!� Zd"d#� Zd$S )%� FixOperatorTZprez�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
z'(' obj=any ')'z�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
)�methods�objc C s" | j ||�}|d k r |||�S d S )N)�
_check_method)�self�node�results�methodr
r
r � transform+ s zFixOperator.transformzoperator.contains(%s)c C s | j ||d�S )N�contains)�_handle_rename)r r r r
r
r �_sequenceIncludes0 s z FixOperator._sequenceIncludeszhasattr(%s, '__call__')c C s2 |d }|j � td�td�g}ttd�||jd�S )Nr z, z
'__call__'�hasattr)�prefix)�cloner r r r )r r r r �argsr
r
r � _isCallable4 s zFixOperator._isCallablezoperator.mul(%s)c C s | j ||d�S )N�mul)r )r r r r
r
r �_repeat: s zFixOperator._repeatzoperator.imul(%s)c C s | j ||d�S )N�imul)r )r r r r
r
r �_irepeat> s zFixOperator._irepeatz$isinstance(%s, collections.Sequence)c C s | j ||dd�S )N� collections�Sequence)�_handle_type2abc)r r r r
r
r �_isSequenceTypeB s zFixOperator._isSequenceTypez#isinstance(%s, collections.Mapping)c C s | j ||dd�S )Nr" �Mapping)r$ )r r r r
r
r �_isMappingTypeF s zFixOperator._isMappingTypez isinstance(%s, numbers.Number)c C s | j ||dd�S )NZnumbers�Number)r$ )r r r r
r
r �
_isNumberTypeJ s zFixOperator._isNumberTypec C s |d d }||_ |j� d S )Nr r )�valueZchanged)r r r �namer r
r
r r N s zFixOperator._handle_renamec C sF t d ||� |d }|j� tddj||g� �g}ttd�||jd�S )Nr z, �.�
isinstance)r )r r r �joinr r r )r r r �module�abcr r r
r
r r$ S s z FixOperator._handle_type2abcc C s\ t | d|d d j �}t|tj�rXd|kr0|S t|d �f}|j| }| j|d| � d S )N�_r r r/ r zYou should use '%s' here.)�getattrr* r- r" �Callable�strr Zwarning)r r r r �subZinvocation_strr
r
r r Y s
zFixOperator._check_methodN)�__name__�
__module__� __qualname__Z
BM_compatible�orderr r �dictZPATTERNr r r r r r! r% r' r) r r$ r r
r
r
r r
s r
) r" Zlib2to3r Zlib2to3.fixer_utilr r r r r ZBaseFixr
r
r
r
r �<module> s fixes/__pycache__/fix_imports2.cpython-36.pyc 0000644 00000001017 15053244155 0015150 0 ustar 00 3
\! � @ s0 d Z ddlmZ ddd�ZG dd� dej�ZdS )zTFix incompatible imports and module references that must be fixed after
fix_imports.� )� fix_importsZdbm)ZwhichdbZanydbmc @ s e Zd ZdZeZdS )� FixImports2� N)�__name__�
__module__� __qualname__Z run_order�MAPPING�mapping� r
r
�2/usr/lib64/python3.6/lib2to3/fixes/fix_imports2.pyr s r N)�__doc__� r r Z
FixImportsr r
r
r
r �<module> s fixes/__pycache__/fix_import.cpython-36.opt-1.pyc 0000644 00000005321 15053244155 0015644 0 ustar 00 3
\� � @ sZ d Z ddlmZ ddlmZmZmZmZ ddlm Z m
Z
m Z dd� Z G dd � d ej
�Zd
S ) z�Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
� )�
fixer_base� )�dirname�join�exists�sep)�
FromImport�syms�tokenc c s� | g}x�|r�|j � }|jtjkr*|jV q|jtjkrPdjdd� |jD ��V q|jtj krn|j
|jd � q|jtj kr�|j |jddd� � qt
d��qW dS ) zF
Walks over all the names imported in a dotted_as_names node.
� c S s g | ]
}|j �qS � )�value)�.0Zchr r �0/usr/lib64/python3.6/lib2to3/fixes/fix_import.py�
<listcomp> s z$traverse_imports.<locals>.<listcomp>r Nr zunknown node type���)�pop�typer
�NAMEr
r Z dotted_namer �childrenZdotted_as_name�appendZdotted_as_names�extend�AssertionError)�names�pending�noder r r �traverse_imports s
r c s4 e Zd ZdZdZ� fdd�Zdd� Zdd� Z� ZS ) � FixImportTzj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c s" t t| �j||� d|jk| _d S )NZabsolute_import)�superr �
start_treeZfuture_features�skip)�selfZtree�name)� __class__r r r / s zFixImport.start_treec C s� | j r
d S |d }|jtjkrZxt|d�s6|jd }q W | j|j�r�d|j |_|j� n^d}d}x$t |�D ]}| j|�r�d}qld}qlW |r�|r�| j
|d� d S t d|g�}|j |_ |S d S )N�impr
r �.FTz#absolute and local imports together)
r r r Z import_from�hasattrr �probably_a_local_importr
Zchangedr Zwarningr �prefix)r! r Zresultsr$ Z
have_localZ
have_absoluteZmod_name�newr r r � transform3 s,
zFixImport.transformc C sv |j d�rdS |jdd�d }t| j�}t||�}ttt|�d��sHdS x(dtddd d
gD ]}t|| �rZd S qZW dS ) Nr% F� r z __init__.pyz.pyz.pycz.soz.slz.pydT)�
startswith�splitr �filenamer r r )r! Zimp_name� base_pathZextr r r r' U s
z!FixImport.probably_a_local_import) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r* r' �
__classcell__r r )r# r r & s
"r N)�__doc__r r Zos.pathr r r r Z
fixer_utilr r r
r ZBaseFixr r r r r �<module> s
fixes/__pycache__/__init__.cpython-36.opt-2.pyc 0000644 00000000201 15053244155 0015214 0 ustar 00 3
\/ � @ s d S )N� r r r �./usr/lib64/python3.6/lib2to3/fixes/__init__.py�<module> s fixes/__pycache__/fix_filter.cpython-36.opt-1.pyc 0000644 00000004444 15053244155 0015624 0 ustar 00 3
\[
� @ sV d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z m Z G dd� dej
�ZdS ) a� Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�ListComp�in_special_contextc @ s e Zd ZdZdZdZdd� ZdS )� FixFilterTaV
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
[extra_trailers=trailer*]
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.filterc C s2 | j |�rd S g }d|kr:x |d D ]}|j|j� � q$W d|kr�t|jd�j� |jd�j� |jd�j� |jd�j� �}ttj|g| dd�}n�d|kr�ttd �td �|d
j� td ��}ttj|g| dd�}nTt |�r�d S |d j� }ttjtd �|gdd�}ttjtd
�t
|g�g| �}d|_ |j |_ |S )NZextra_trailersZ
filter_lambda�fp�itZxp� )�prefixZnoneZ_f�seq�args�filter�list) Z should_skip�appendZcloner �getr �symsZpowerr r r r
)�selfZnodeZresultsZtrailers�t�newr � r �0/usr/lib64/python3.6/lib2to3/fixes/fix_filter.py� transform: s4
zFixFilter.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r s r N)�__doc__r r Zpytreer Zpygramr r Z
fixer_utilr r r r ZConditionalFixr r r r r �<module> s
fixes/__pycache__/fix_map.cpython-36.opt-2.pyc 0000644 00000004344 15053244155 0015114 0 ustar 00 3
\8 � @ sb d dl mZ d dlmZ d dlmZmZmZmZm Z d dl
m Z d dl
mZ G dd� dej�ZdS ) � )�token)�
fixer_base)�Name�ArgList�Call�ListComp�in_special_context)�python_symbols)�Nodec @ s e Zd ZdZdZdZdd� ZdS )�FixMapTaL
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
[extra_trailers=trailer*]
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'map' args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.mapc C s� | j |�rd S g }d|kr:x |d D ]}|j|j� � q$W |jjtjkrv| j|d� |j� }d|_t t
d�|g�}�n&d|kr�t |d j� |d j� |d j� �}t tj
|g| dd �}n�d
|kr�|d j� }d|_n�d |k�rj|d }|jtjk�rL|jd
jtjk�rL|jd
jd jtjk�rL|jd
jd jdk�rL| j|d� d S t tj
t
d�|j� g�}d|_t|��rxd S t tj
t
d�t|g�g| �}d|_|j|_|S )NZextra_trailersz You should use a for loop here� �listZ
map_lambdaZxp�fp�it)�prefixZmap_none�arg�args� � �Nonezjcannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence�map)Z should_skip�appendZclone�parent�type�symsZ simple_stmtZwarningr r r r r
ZpowerZtrailerZchildrenZarglistr �NAME�valuer r )�selfZnodeZresultsZtrailers�t�newr � r �-/usr/lib64/python3.6/lib2to3/fixes/fix_map.py� transform@ sF
zFixMap.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr" r r r r! r s r N)Zpgen2r r r Z
fixer_utilr r r r r Zpygramr r Zpytreer
ZConditionalFixr r r r r! �<module> s
fixes/__pycache__/fix_buffer.cpython-36.opt-2.pyc 0000644 00000001316 15053244155 0015604 0 ustar 00 3
\N � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdZdd� ZdS )� FixBufferTzR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s |d }|j td|jd�� d S )N�name�
memoryview)�prefix)�replacer r )�selfZnodeZresultsr � r
�0/usr/lib64/python3.6/lib2to3/fixes/fix_buffer.py� transform s zFixBuffer.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s r N)� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/__init__.cpython-36.pyc 0000644 00000000201 15053244155 0014254 0 ustar 00 3
\/ � @ s d S )N� r r r �./usr/lib64/python3.6/lib2to3/fixes/__init__.py�<module> s fixes/__pycache__/fix_methodattrs.cpython-36.opt-2.pyc 0000644 00000001507 15053244155 0016673 0 ustar 00 3
\^ � @ s: d dl mZ d dlmZ dddd�ZG dd� dej�Zd S )
� )�
fixer_base)�Name�__func__�__self__z__self__.__class__)Zim_funcZim_selfZim_classc @ s e Zd ZdZdZdd� ZdS )�FixMethodattrsTzU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C s. |d d }t |j }|jt||jd�� d S )N�attr� )�prefix)�MAP�value�replacer r )�selfZnodeZresultsr �new� r �5/usr/lib64/python3.6/lib2to3/fixes/fix_methodattrs.py� transform s
zFixMethodattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)� r Z
fixer_utilr r
ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_raise.cpython-36.opt-1.pyc 0000644 00000004264 15053244155 0015442 0 ustar 00 3
\n � @ sZ d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z G dd� dej �Z
dS ) a[ Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
� )�pytree)�token)�
fixer_base)�Name�Call�Attr�ArgList�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixRaiseTzB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c C sl | j }|d j� }|jtjkr2d}| j||� d S t|�rbx t|�rZ|jd jd j� }q<W d|_d|kr�t j
|j t d�|g�}|j|_|S |d j� }t|�r�dd � |jdd� D �}n d
|_|g}d |k�rF|d j� } d
| _|}
|jtj
kp�|jd k�rt||�}
t|
t d
��t| g�g } t j
|jt d�g| �}|j|_|S t j
|j t d�t||�g|jd�S d S )N�excz+Python 3 does not support string exceptions� � � �val�raisec S s g | ] }|j � �qS � )�clone)�.0�cr r �//usr/lib64/python3.6/lib2to3/fixes/fix_raise.py�
<listcomp>D s z&FixRaise.transform.<locals>.<listcomp>� �tb�None�with_traceback)�prefix���)�symsr �typer �STRINGZcannot_convertr Zchildrenr r ZNodeZ
raise_stmtr �NAME�valuer r r Z simple_stmt) �selfZnodeZresultsr r �msg�newr �argsr �eZwith_tbr r r � transform& s@
zFixRaise.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r r r r r
s r
N)�__doc__r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r r r r �<module> s
fixes/__pycache__/fix_funcattrs.cpython-36.opt-1.pyc 0000644 00000001671 15053244155 0016347 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z3Fix function attribute names (f.func_x -> f.__x__).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixFuncattrsTz�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s2 |d d }|j td|jdd � |jd�� d S )N�attr� z__%s__� )�prefix)�replacer �valuer )�selfZnodeZresultsr � r �3/usr/lib64/python3.6/lib2to3/fixes/fix_funcattrs.py� transform s zFixFuncattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_zip.cpython-36.opt-2.pyc 0000644 00000002315 15053244155 0015135 0 ustar 00 3
\ � @ sN d dl mZ d dlmZ d dlmZ d dlmZm Z m
Z
G dd� dej �Z dS )� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�in_special_contextc @ s e Zd ZdZdZdZdd� ZdS )�FixZipTzN
power< 'zip' args=trailer< '(' [any] ')' > [trailers=trailer*]
>
zfuture_builtins.zipc C s� | j |�rd S t|�rd S |d j� }d|_g }d|kr^dd� |d D �}x|D ]
}d|_qPW ttjtd�|gdd�}ttjtd�t|g�g| �}|j|_|S ) N�args� �trailersc S s g | ] }|j � �qS � )�clone)�.0�nr r �-/usr/lib64/python3.6/lib2to3/fixes/fix_zip.py�
<listcomp>' s z$FixZip.transform.<locals>.<listcomp>�zip)�prefix�list) Z should_skipr r
r r �symsZpowerr r )�selfZnodeZresultsr r r �newr r r � transform s
zFixZip.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r s r N)
r
r Zpytreer Zpygramr r Z
fixer_utilr r r ZConditionalFixr r r r r �<module> s fixes/__pycache__/fix_set_literal.cpython-36.opt-1.pyc 0000644 00000003202 15053244155 0016635 0 ustar 00 3
\� � @ s: d Z ddlmZmZ ddlmZmZ G dd� dej�ZdS )z:
Optional fixer to transform set() calls to set literals.
� )�
fixer_base�pytree)�token�symsc @ s e Zd ZdZdZdZdd� ZdS )�
FixSetLiteralTaj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s� |j d�}|r2tjtj|j� g�}|j|� |}n|d }tjtj d�g}|j
dd� |j D �� |j tjtj
d�� |jj|d
_tjtj|�}|j|_t|j �dkr�|j d }|j� |j|j d _|S ) N�single�items�{c s s | ]}|j � V qd S )N)�clone)�.0�n� r
�5/usr/lib64/python3.6/lib2to3/fixes/fix_set_literal.py� <genexpr>' s z*FixSetLiteral.transform.<locals>.<genexpr>�}� � � ���r )�getr ZNoder Z listmakerr
�replaceZLeafr �LBRACE�extendZchildren�append�RBRACEZ next_sibling�prefixZ dictsetmaker�len�remove) �selfZnodeZresultsr Zfaker �literalZmakerr r
r
r � transform s"
zFixSetLiteral.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s
r N) �__doc__Zlib2to3r r Zlib2to3.fixer_utilr r ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_reduce.cpython-36.opt-2.pyc 0000644 00000001723 15053244155 0015604 0 ustar 00 3
\E � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReduceTZpreai
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t dd|� d S )N� functools�reduce)r )�selfZnodeZresults� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_reduce.py� transform" s zFixReduce.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr
r r r r r s r N)Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r �<module>
s fixes/__pycache__/fix_raw_input.cpython-36.pyc 0000644 00000001406 15053244155 0015403 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z2Fixer that changes raw_input(...) into input(...).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixRawInputTzU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s |d }|j td|jd�� d S )N�name�input)�prefix)�replacer r )�selfZnodeZresultsr � r
�3/usr/lib64/python3.6/lib2to3/fixes/fix_raw_input.py� transform s zFixRawInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_execfile.cpython-36.opt-1.pyc 0000644 00000003170 15053244155 0016116 0 ustar 00 3
\ � @ sV d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
m Z m Z m
Z
G dd� dej�ZdS )zoFixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
� )�
fixer_base)
�Comma�Name�Call�LParen�RParen�Dot�Node�ArgList�String�symsc @ s e Zd ZdZdZdd� ZdS )� FixExecfileTz�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s& |d }|j d�}|j d�}|jd jd j� }t|j� t� tdd�g|d�}ttjt d�|g�}ttj
t � t d �g�ttj
t � t
� g�g} |g| }
|j� } d| _td
d�} |
t� | t� | g }
tt d �|
d �}|g}|d k r�|jt� |j� g� |d k �r|jt� |j� g� tt d
�||jd�S )N�filename�globals�locals� z"rb"� )Zrparen�open�readz'exec'�compile� �exec)�prefix���r )�getZchildrenZcloner
r r r r Zpowerr Ztrailerr r r r r �extend)�selfZnodeZresultsr r r Zexecfile_parenZ open_argsZ open_callr Z open_exprZ filename_argZexec_strZ compile_argsZ compile_call�args� r �2/usr/lib64/python3.6/lib2to3/fixes/fix_execfile.py� transform s*
zFixExecfile.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r
N)�__doc__r r Z
fixer_utilr r r r r r r r
r r ZBaseFixr
r r r r �<module> s 0 fixes/__pycache__/fix_numliterals.cpython-36.pyc 0000644 00000001760 15053244155 0015735 0 ustar 00 3
\ � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z-Fixer that turns 1L into 1, 0755 into 0o755.
� )�token)�
fixer_base)�Numberc @ s" e Zd ZejZdd� Zdd� ZdS )�FixNumliteralsc C s |j jd�p|j d dkS )N�0� �Ll���)�value�
startswith)�self�node� r �5/usr/lib64/python3.6/lib2to3/fixes/fix_numliterals.py�match s zFixNumliterals.matchc C s` |j }|d dkr |d d� }n2|jd�rR|j� rRtt|��dkrRd|dd � }t||jd�S )Nr r r Z0o)�prefixr r )r
r �isdigit�len�setr r )r r
Zresults�valr r r � transform s "zFixNumliterals.transformN)�__name__�
__module__� __qualname__r �NUMBERZ _accept_typer r r r r r r s r N) �__doc__Zpgen2r � r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_metaclass.cpython-36.opt-1.pyc 0000644 00000012302 15053244155 0016303 0 ustar 00 3
\ � @ sv d Z ddlmZ ddlmZ ddlmZmZmZ dd� Z dd� Z
d d
� Z d d � Z d
d� Z
dd� ZG dd� dej�ZdS )a� Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherints
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
� )�
fixer_base)�token)�syms�Node�Leafc C sx xr| j D ]h}|jtjkr t|�S |jtjkr|j r|j d }|jtjkr|j r|j d }t|t�r|j dkrdS qW dS )z� we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
� �
__metaclass__TF)
�children�typer �suite�
has_metaclass� simple_stmt� expr_stmt�
isinstancer �value)�parent�node� expr_nodeZ left_side� r �3/usr/lib64/python3.6/lib2to3/fixes/fix_metaclass.pyr s
r c C s� x | j D ]}|jtjkrdS qW x,t| j �D ]\}}|jtjkr,P q,W td��ttjg �}x:| j |d d� r�| j |d }|j |j
� � |j � q\W | j |� |}dS )zf one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
NzNo class suite and no ':'!� ) r r
r r � enumerater �COLON�
ValueErrorr � append_child�clone�remove)�cls_noder �ir � move_noder r r �fixup_parse_tree- s
r c
C s� x(t |j�D ]\}}|jtjkr P q W dS |j� ttjg �}ttj |g�}x2|j|d� r~|j| }|j
|j � � |j� qNW | j ||� |jd jd }|jd jd } | j
|_
dS )z� if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
Nr )r r r
r �SEMIr r r r r
r r � insert_child�prefix)
r r Z stmt_nodeZsemi_indr Znew_exprZnew_stmtr Z new_leaf1Z old_leaf1r r r �fixup_simple_stmtG s
r$ c C s* | j r&| j d jtjkr&| j d j� d S )Nr ���r% )r r
r �NEWLINEr )r r r r �remove_trailing_newline_ s r' c c s� x$| j D ]}|jtjkrP qW td��x�tt|j ��D ]t\}}|jtjkr6|j r6|j d }|jtjkr6|j r6|j d }t |t
�r6|j dkr6t |||� t
|� |||fV q6W d S )NzNo class suite!r r )r r
r r r �listr r
r r r r r$ r' )r r r Z simple_noder Z left_noder r r �
find_metasd s
r) c C s� | j ddd� }x |r.|j� }|jtjkrP qW xL|r||j� }t|t�rd|jtjkrd|jr`d|_dS |j |j ddd� � q2W dS )z� If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
Nr � r% r% )
r �popr
r �INDENTr r �DEDENTr# �extend)r Zkidsr r r r � fixup_indent{ s r/ c @ s e Zd ZdZdZdd� ZdS )� FixMetaclassTz
classdef<any*>
c C s< t |�s d S t|� d }x"t|�D ]\}}}|}|j� q"W |jd j}t|j�dkr�|jd jtjkrt|jd }n(|jd j � } t
tj| g�}|j d|� n�t|j�dkr�t
tjg �}|j d|� nZt|j�dk�rt
tjg �}|j dt
tjd�� |j d|� |j dt
tjd�� ntd ��|jd jd }
d
|
_|
j} |j�r^|jt
tjd �� d |
_nd
|
_|jd } d
| jd _d
| jd _|j|� t|� |j�s�|j� t
|d�}
| |
_|j|
� |jt
tjd�� nbt|j�dk�r8|jd jtjk�r8|jd jtjk�r8t
|d�}
|j d|
� |j dt
tjd�� d S )Nr � � � � r �)�(zUnexpected class definition� metaclass�,� r* r �pass�
���r% r% r% )r r r) r r r
�lenr �arglistr r Z set_childr" r r �RPAR�LPARr r r# r �COMMAr/ r& r, r- )�selfr ZresultsZlast_metaclassr r ZstmtZ text_typer> r Zmeta_txtZorig_meta_prefixr Z pass_leafr r r � transform� s^
zFixMetaclass.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNrC r r r r r0 � s r0 N)�__doc__r* r Zpygramr Z
fixer_utilr r r r r r$ r' r) r/ ZBaseFixr0 r r r r �<module> s fixes/__pycache__/fix_input.cpython-36.pyc 0000644 00000001641 15053244155 0014533 0 ustar 00 3
\� � @ sL d Z ddlmZ ddlmZmZ ddlmZ ejd�ZG dd� dej �Z
dS ) z4Fixer that changes input(...) into eval(input(...)).� )�
fixer_base)�Call�Name)�patcompz&power< 'eval' trailer< '(' any ')' > >c @ s e Zd ZdZdZdd� ZdS )�FixInputTzL
power< 'input' args=trailer< '(' [any] ')' > >
c C s6 t j|jj�rd S |j� }d|_ttd�|g|jd�S )N� �eval)�prefix)�context�match�parentZcloner r r )�selfZnodeZresults�new� r �//usr/lib64/python3.6/lib2to3/fixes/fix_input.py� transform s
zFixInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r N) �__doc__r r Z
fixer_utilr r r Zcompile_patternr
ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_sys_exc.cpython-36.opt-2.pyc 0000644 00000002273 15053244155 0016013 0 ustar 00 3
\
� @ sF d dl mZ d dlmZmZmZmZmZmZm Z G dd� dej
�Z dS )� )�
fixer_base)�Attr�Call�Name�Number� Subscript�Node�symsc @ s: e Zd ZdddgZdZddjdd� eD �� Zd d
� Zd S ) � FixSysExc�exc_type� exc_value�
exc_tracebackTzN
power< 'sys' trailer< dot='.' attribute=(%s) > >
�|c c s | ]}d | V qdS )z'%s'N� )�.0�er r �1/usr/lib64/python3.6/lib2to3/fixes/fix_sys_exc.py� <genexpr> s zFixSysExc.<genexpr>c C st |d d }t | jj|j��}ttd�|jd�}ttd�|�}|d j|d jd _|j t
|�� t t j
||jd�S )NZ attribute� �exc_info)�prefix�sys�dot� )r r �index�valuer r r r Zchildren�appendr r r Zpower)�selfZnodeZresultsZsys_attrr Zcall�attrr r r � transform s zFixSysExc.transformN)�__name__�
__module__� __qualname__r Z
BM_compatible�joinZPATTERNr r r r r r
s
r
N) � r Z
fixer_utilr r r r r r r ZBaseFixr
r r r r �<module> s $ fixes/__pycache__/fix_operator.cpython-36.opt-1.pyc 0000644 00000010170 15053244155 0016163 0 ustar 00 3
\�
� @ sN d Z ddlZddlmZ ddlmZmZmZmZ dd� Z G dd� dej
�Z dS ) a� Fixer for operator functions.
operator.isCallable(obj) -> hasattr(obj, '__call__')
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
� N)�
fixer_base)�Call�Name�String� touch_importc s � fdd�}|S )Nc s
� | _ | S )N)�
invocation)�f)�s� �2/usr/lib64/python3.6/lib2to3/fixes/fix_operator.py�dec s zinvocation.<locals>.decr
)r r r
)r r r s r c @ s� e Zd ZdZdZdZdZdeeed� Zdd� Z e
d �d
d � �Z e
d �d
d� �Z e
d�dd� �Z
e
d�dd� �Ze
d�dd� �Ze
d�dd� �Ze
d�d d � �Zd d � Zd d!� Zd"d#� Zd$S )%� FixOperatorTZprez�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
z'(' obj=any ')'z�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
)�methods�objc C s" | j ||�}|d k r |||�S d S )N)�
_check_method)�self�node�results�methodr
r
r � transform+ s zFixOperator.transformzoperator.contains(%s)c C s | j ||d�S )N�contains)�_handle_rename)r r r r
r
r �_sequenceIncludes0 s z FixOperator._sequenceIncludeszhasattr(%s, '__call__')c C s2 |d }|j � td�td�g}ttd�||jd�S )Nr z, z
'__call__'�hasattr)�prefix)�cloner r r r )r r r r �argsr
r
r � _isCallable4 s zFixOperator._isCallablezoperator.mul(%s)c C s | j ||d�S )N�mul)r )r r r r
r
r �_repeat: s zFixOperator._repeatzoperator.imul(%s)c C s | j ||d�S )N�imul)r )r r r r
r
r �_irepeat> s zFixOperator._irepeatz$isinstance(%s, collections.Sequence)c C s | j ||dd�S )N� collections�Sequence)�_handle_type2abc)r r r r
r
r �_isSequenceTypeB s zFixOperator._isSequenceTypez#isinstance(%s, collections.Mapping)c C s | j ||dd�S )Nr" �Mapping)r$ )r r r r
r
r �_isMappingTypeF s zFixOperator._isMappingTypez isinstance(%s, numbers.Number)c C s | j ||dd�S )NZnumbers�Number)r$ )r r r r
r
r �
_isNumberTypeJ s zFixOperator._isNumberTypec C s |d d }||_ |j� d S )Nr r )�valueZchanged)r r r �namer r
r
r r N s zFixOperator._handle_renamec C sF t d ||� |d }|j� tddj||g� �g}ttd�||jd�S )Nr z, �.�
isinstance)r )r r r �joinr r r )r r r �module�abcr r r
r
r r$ S s z FixOperator._handle_type2abcc C s\ t | d|d d j �}t|tj�rXd|kr0|S t|d �f}|j| }| j|d| � d S )N�_r r r/ r zYou should use '%s' here.)�getattrr* r- r" �Callable�strr Zwarning)r r r r �subZinvocation_strr
r
r r Y s
zFixOperator._check_methodN)�__name__�
__module__� __qualname__Z
BM_compatible�orderr r �dictZPATTERNr r r r r r! r% r' r) r r$ r r
r
r
r r
s r
) �__doc__r" Zlib2to3r Zlib2to3.fixer_utilr r r r r ZBaseFixr
r
r
r
r �<module>
s
fixes/__pycache__/fix_funcattrs.cpython-36.opt-2.pyc 0000644 00000001565 15053244155 0016352 0 ustar 00 3
\� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixFuncattrsTz�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s2 |d d }|j td|jdd � |jd�� d S )N�attr� z__%s__� )�prefix)�replacer �valuer )�selfZnodeZresultsr � r �3/usr/lib64/python3.6/lib2to3/fixes/fix_funcattrs.py� transform s zFixFuncattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N)� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_imports.cpython-36.opt-1.pyc 0000644 00000010350 15053244155 0016025 0 ustar 00 3
\4 � 1 @ s� d Z ddlmZ ddlmZmZ ddddddd d
d d d d
d
ddddddddddddddd d d d d d!d"d"d#d$d%d&d'd(d(d(d)d*d*d+d,d-�0Zd.d/� Zefd0d1�ZG d2d3� d3ej �Z
d4S )5z/Fix incompatible imports and module references.� )�
fixer_base)�Name�
attr_chain�io�pickle�builtins�copyregZqueueZ socketserverZ configparser�reprlibztkinter.filedialogztkinter.simpledialogztkinter.colorchooserztkinter.commondialogztkinter.dialogz tkinter.dndz tkinter.fontztkinter.messageboxztkinter.scrolledtextztkinter.constantsz tkinter.tixz tkinter.ttkZtkinterZ _markupbase�winreg�_threadZ
_dummy_threadzdbm.bsdzdbm.dumbzdbm.ndbmzdbm.gnuz
xmlrpc.clientz
xmlrpc.serverz http.clientz
html.entitiesz html.parserz http.cookieszhttp.cookiejarz http.server�
subprocess� collectionsz urllib.parsezurllib.robotparser)0�StringIOZ cStringIOZcPickleZ __builtin__Zcopy_regZQueueZ SocketServerZ ConfigParser�reprZ
FileDialogZ tkFileDialogZ SimpleDialogZtkSimpleDialogZtkColorChooserZtkCommonDialogZDialogZTkdndZtkFontZ tkMessageBoxZ ScrolledTextZ TkconstantsZTixZttkZTkinterZ
markupbase�_winregZthreadZ dummy_threadZdbhashZdumbdbmZdbmZgdbmZ xmlrpclibZDocXMLRPCServerZSimpleXMLRPCServerZhttplibZhtmlentitydefsZ
HTMLParserZCookieZ cookielibZBaseHTTPServerZSimpleHTTPServerZ
CGIHTTPServerZcommands�
UserString�UserListZurlparseZ robotparserc C s ddj tt| �� d S )N�(�|�))�join�mapr )�members� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_imports.py�
alternates= s r c c sT dj dd� | D ��}t| j� �}d||f V d| V d||f V d| V d S )Nz | c S s g | ] }d | �qS )zmodule_name='%s'r )�.0�keyr r r �
<listcomp>B s z!build_pattern.<locals>.<listcomp>zyname_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
z�import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
z�import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
z3power< bare_with_attr=(%s) trailer<'.' any > any* >)r r �keys)�mappingZmod_listZ
bare_namesr r r �
build_patternA s
r! c sT e Zd ZdZdZeZdZdd� Z� fdd�Z � fdd�Z
� fd d
�Z d d � Z � Z
S )
�
FixImportsT� c C s dj t| j��S )Nr )r r! r )�selfr r r r! ` s zFixImports.build_patternc s | j � | _tt| �j� d S )N)r! ZPATTERN�superr" �compile_pattern)r$ )� __class__r r r& c s
zFixImports.compile_patternc sH t t| �j� � |�}|rDd|kr@t� fdd�t|d�D ��r@dS |S dS )N�bare_with_attrc 3 s | ]}� |�V qd S )Nr )r �obj)�matchr r � <genexpr>q s z#FixImports.match.<locals>.<genexpr>�parentF)r% r" r* �anyr )r$ �node�results)r' )r* r r* j s zFixImports.matchc s t t| �j||� i | _d S )N)r% r" �
start_tree�replace)r$ Ztree�filename)r' r r r0 v s zFixImports.start_treec C s� |j d�}|rh|j}| j| }|jt||jd�� d|krD|| j|< d|kr�| j|�}|r�| j||� n2|d d }| jj |j�}|r�|jt||jd�� d S )NZ module_name)�prefixZ name_importZmultiple_importsr( � )�get�valuer r1 r r3 r* � transform)r$ r. r/ Z
import_modZmod_name�new_nameZ bare_namer r r r7 z s
zFixImports.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZkeep_line_order�MAPPINGr Z run_orderr! r& r* r0 r7 �
__classcell__r r )r' r r" U s r" N) �__doc__� r Z
fixer_utilr r r< r r! ZBaseFixr" r r r r �<module> sj fixes/__pycache__/fix_next.cpython-36.opt-2.pyc 0000644 00000005604 15053244155 0015315 0 ustar 00 3
\f � @ sj d dl mZ d dlmZ d dlmZ d dlmZm Z m
Z
dZ G dd� dej �Z
dd � Zd
d � Zd d
� ZdS )� )�token)�python_symbols)�
fixer_base)�Name�Call� find_bindingz;Calls to builtin next() possibly shadowed by global bindingc s0 e Zd ZdZdZdZ� fdd�Zdd� Z� ZS )�FixNextTa�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
Zprec s> t t| �j||� td|�}|r4| j|t� d| _nd| _d S )N�nextTF)�superr �
start_treer �warning� bind_warning�
shadowed_next)�selfZtree�filename�n)� __class__� �./usr/lib64/python3.6/lib2to3/fixes/fix_next.pyr $ s
zFixNext.start_treec C s� |j d�}|j d�}|j d�}|rr| jr>|jtd|jd�� q�dd� |D �}d|d _|jttd
|jd�|�� n�|r�td|jd�}|j|� nj|r�t|�r�|d }djd d� |D ��j� d
kr�| j |t
� d S |jtd�� nd|kr�| j |t
� d| _d S )N�base�attr�name�__next__)�prefixc S s g | ] }|j � �qS r )Zclone)�.0r r r r �
<listcomp>9 s z%FixNext.transform.<locals>.<listcomp>� � r �headc S s g | ] }t |��qS r )�str)r r r r r r E s Z __builtin__�globalT) �getr �replacer r r �is_assign_target�join�stripr r
)r �nodeZresultsr r r r r r r r � transform. s,
zFixNext.transform) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERN�orderr r' �
__classcell__r r )r r r s
r c C sF t | �}|d krdS x,|jD ]"}|jtjkr0dS t|| �r dS q W dS )NFT)� find_assign�children�typer �EQUAL�
is_subtree)r& ZassignZchildr r r r# Q s
r# c C s4 | j tjkr| S | j tjks&| jd kr*d S t| j�S )N)r/ �symsZ expr_stmtZ simple_stmt�parentr- )r& r r r r- ] s
r- c s$ | � kr dS t � fdd�| jD ��S )NTc 3 s | ]}t |� �V qd S )N)r1 )r �c)r& r r � <genexpr>g s z is_subtree.<locals>.<genexpr>)�anyr. )�rootr& r )r& r r1 d s r1 N)Zpgen2r Zpygramr r2 r r Z
fixer_utilr r r r
ZBaseFixr r# r- r1 r r r r �<module> s @ fixes/__pycache__/fix_import.cpython-36.pyc 0000644 00000005321 15053244155 0014705 0 ustar 00 3
\� � @ sZ d Z ddlmZ ddlmZmZmZmZ ddlm Z m
Z
m Z dd� Z G dd � d ej
�Zd
S ) z�Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
� )�
fixer_base� )�dirname�join�exists�sep)�
FromImport�syms�tokenc c s� | g}x�|r�|j � }|jtjkr*|jV q|jtjkrPdjdd� |jD ��V q|jtj krn|j
|jd � q|jtj kr�|j |jddd� � qt
d��qW dS ) zF
Walks over all the names imported in a dotted_as_names node.
� c S s g | ]
}|j �qS � )�value)�.0Zchr r �0/usr/lib64/python3.6/lib2to3/fixes/fix_import.py�
<listcomp> s z$traverse_imports.<locals>.<listcomp>r Nr zunknown node type���)�pop�typer
�NAMEr
r Z dotted_namer �childrenZdotted_as_name�appendZdotted_as_names�extend�AssertionError)�names�pending�noder r r �traverse_imports s
r c s4 e Zd ZdZdZ� fdd�Zdd� Zdd� Z� ZS ) � FixImportTzj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c s" t t| �j||� d|jk| _d S )NZabsolute_import)�superr �
start_treeZfuture_features�skip)�selfZtree�name)� __class__r r r / s zFixImport.start_treec C s� | j r
d S |d }|jtjkrZxt|d�s6|jd }q W | j|j�r�d|j |_|j� n^d}d}x$t |�D ]}| j|�r�d}qld}qlW |r�|r�| j
|d� d S t d|g�}|j |_ |S d S )N�impr
r �.FTz#absolute and local imports together)
r r r Z import_from�hasattrr �probably_a_local_importr
Zchangedr Zwarningr �prefix)r! r Zresultsr$ Z
have_localZ
have_absoluteZmod_name�newr r r � transform3 s,
zFixImport.transformc C sv |j d�rdS |jdd�d }t| j�}t||�}ttt|�d��sHdS x(dtddd d
gD ]}t|| �rZd S qZW dS ) Nr% F� r z __init__.pyz.pyz.pycz.soz.slz.pydT)�
startswith�splitr �filenamer r r )r! Zimp_name� base_pathZextr r r r' U s
z!FixImport.probably_a_local_import) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r* r' �
__classcell__r r )r# r r & s
"r N)�__doc__r r Zos.pathr r r r Z
fixer_utilr r r
r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_reload.cpython-36.pyc 0000644 00000002165 15053244155 0014644 0 ustar 00 3
\� � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )z/Fixer for reload().
reload(s) -> imp.reload(s)� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReloadTZprez�
power< 'reload'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sd |rD|d }|rD|j | jjkr"d S |j | jjkrD|jd jdkrDd S d}t|||�}td d|� |S )N�obj� z**�imp�reload)r r )�typeZsymsZ star_exprZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_reload.py� transform s zFixReload.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)�__doc__� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_urllib.cpython-36.opt-2.pyc 0000644 00000012441 15053244155 0015625 0 ustar 00 3
\� � @ s� d dl mZmZ d dlmZmZmZmZmZm Z m
Z
ddddddd d
d gfd d
ddddddddddddddgfd d gfgddd d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4gfd d5d6gfgd7�Z e d8 j e d9 d: � d;d<� Z
G d=d>� d>e�Zd?S )@� )�
alternates�
FixImports)�Name�Comma�
FromImport�Newline�find_indentation�Node�symszurllib.requestZ URLopenerZFancyURLopenerZ urlretrieveZ
_urlopenerZurlopenZ
urlcleanupZ pathname2urlZ url2pathnamez urllib.parseZquoteZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ splitattrZ splithostZ
splitnportZ splitpasswdZ splitportZ
splitqueryZsplittagZ splittypeZ splituserZ
splitvaluez urllib.errorZContentTooShortErrorZinstall_openerZ build_openerZRequestZOpenerDirectorZ BaseHandlerZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZURLErrorZ HTTPError)�urllib�urllib2r r � c c s~ t � } xrtj� D ]f\}}x\|D ]T}|\}}t|�}d||f V d|||f V d| V d| V d||f V q W qW d S )Nz�import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
z�import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
zIimport_from< 'from' module_star=%r 'import' star='*' >
ztimport_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
zKpower< bare_with_attr=%r trailer< '.' member=%s > any* >
)�set�MAPPING�itemsr )ZbareZ
old_moduleZchanges�changeZ
new_module�members� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_urllib.py�
build_pattern0 s
r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) � FixUrllibc C s dj t� �S )N�|)�joinr )�selfr r r r I s zFixUrllib.build_patternc C sz |j d�}|j}g }x6t|j d d� D ] }|jt|d |d�t� g� q(W |jtt|j d d |d�� |j|� d S )N�moduler
r )�prefix���r ) �getr r �value�extendr r �append�replace)r �node�resultsZ
import_mod�pref�names�namer r r �transform_importL s
zFixUrllib.transform_importc C s> |j d�}|j}|j d�}|r�t|t�r0|d }d }x*t|j D ] }|j|d kr@|d }P q@W |rx|jt||d�� n | j|d� �n�g }i } |d }
x�|
D ]�}|j t
j kr�|j d j} |j d j} n
|j} d } | d kr�xPt|j D ]B}| |d kr�|d | k�r|j
|d � | j|d g �j
|� q�W q�W g }
t|�}d
}d d � }x�|D ]�}| | }g }x2|d d� D ]"}|j|||�� |j
t� � �qlW |j||d |�� t||�}| �s�|jjj|��r�||_|
j
|� d
}�qNW |
�r.g }x&|
d d� D ]}|j|t� g� �q�W |j
|
d � |j|� n | j|d� d S )N�
mod_member�memberr r
)r z!This is an invalid module elementr � �,Tc S sX | j tjkrHt| jd j|d�| jd j� | jd j� g}ttj|�gS t| j|d�gS )Nr )r r
r* )�typer
�import_as_namer �childrenr Zcloner )r& r Zkidsr r r � handle_name� s z/FixUrllib.transform_member.<locals>.handle_nameFz All module elements are invalidr r r r )r r �
isinstance�listr r r! r �cannot_convertr, r
r- r. r �
setdefaultr r r r �parent�endswithr )r r" r# r( r$ r) �new_namer �modulesZmod_dictr Zas_name� member_nameZ new_nodesZ indentation�firstr/ r Zeltsr% Zelt�newZnodesZnew_noder r r �transform_member\ sh
zFixUrllib.transform_memberc C s� |j d�}|j d�}d }t|t�r*|d }x*t|j D ] }|j|d kr6|d }P q6W |rp|jt||jd�� n | j|d� d S )N�bare_with_attrr) r r
)r z!This is an invalid module element) r r0 r1 r r r! r r r2 )r r" r# Z
module_dotr) r6 r r r r �
transform_dot� s
zFixUrllib.transform_dotc C sz |j d�r| j||� n^|j d�r0| j||� nF|j d�rH| j||� n.|j d�r`| j|d� n|j d�rv| j|d� d S )Nr r( r< Z module_starzCannot handle star imports.Z module_asz#This module is now multiple modules)r r' r; r= r2 )r r" r# r r r � transform� s
zFixUrllib.transformN)�__name__�
__module__� __qualname__r r' r; r= r> r r r r r G s
Lr N)Zlib2to3.fixes.fix_importsr r Zlib2to3.fixer_utilr r r r r r r
r r r r r r r r �<module> s> $
fixes/__pycache__/fix_renames.cpython-36.opt-1.pyc 0000644 00000003664 15053244155 0015774 0 ustar 00 3
\� � @ sV d Z ddlmZ ddlmZmZ dddiiZi Zdd� Zd d
� Z G d d � d ej
�Z d
S )z?Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
� )�
fixer_base)�Name�
attr_chain�sysZmaxint�maxsizec C s ddj tt| �� d S )N�(�|�))�join�map�repr)�members� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_renames.py�
alternates s r c c sb x\t tj� �D ]L\} }xBt |j� �D ]2\}}|t| |f< d| ||f V d| |f V q$W qW d S )Nz�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
z^
power< module_name=%r trailer< '.' attr_name=%r > any* >
)�list�MAPPING�items�LOOKUP)�module�replaceZold_attr�new_attrr r r �
build_pattern s
r c s8 e Zd ZdZdje� �ZdZ� fdd�Zdd� Z � Z
S )�
FixRenamesTr Zprec s@ t t| �j� � |�}|r<t� fdd�t|d�D ��r8dS |S dS )Nc 3 s | ]}� |�V qd S )Nr )�.0�obj)�matchr r � <genexpr>5 s z#FixRenames.match.<locals>.<genexpr>�parentF)�superr r �anyr )�self�node�results)� __class__)r r r 1 s zFixRenames.matchc C sD |j d�}|j d�}|r@|r@t|j|jf }|jt||jd�� d S )NZ module_name� attr_name)�prefix)�getr �valuer r r& )r! r" r# Zmod_namer% r r r r � transform> s
zFixRenames.transform) �__name__�
__module__� __qualname__Z
BM_compatibler
r ZPATTERN�orderr r) �
__classcell__r r )r$ r r * s
r N) �__doc__� r Z
fixer_utilr r r r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_itertools.cpython-36.pyc 0000644 00000002775 15053244155 0015431 0 ustar 00 3
\ � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )aT Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
� )�
fixer_base)�Namec @ s* e Zd ZdZdZde� ZdZdd� ZdS )� FixItertoolsTz7('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')z�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
� c C s� d }|d d }d|krV|j d krV|d |d }}|j}|j� |j� |jj|� |p^|j}|jt|j dd � |d�� d S )
N�func� �it� ifilterfalse� izip_longest�dot� )�prefix)r r
)�valuer
�remove�parent�replacer )�selfZnodeZresultsr
r r r � r �3/usr/lib64/python3.6/lib2to3/fixes/fix_itertools.py� transform s
zFixItertools.transformN) �__name__�
__module__� __qualname__Z
BM_compatibleZit_funcs�localsZPATTERNZ run_orderr r r r r r s
r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_intern.cpython-36.opt-1.pyc 0000644 00000002165 15053244155 0015634 0 ustar 00 3
\� � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )z/Fixer for intern().
intern(s) -> sys.intern(s)� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixInternTZprez�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sd |rD|d }|rD|j | jjkr"d S |j | jjkrD|jd jdkrDd S d}t|||�}td d|� |S )N�obj� z**�sys�intern)r r )�typeZsymsZ star_exprZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_intern.py� transform s zFixIntern.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)�__doc__� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_unicode.cpython-36.opt-2.pyc 0000644 00000002477 15053244155 0015772 0 ustar 00 3
\� � @ s8 d dl mZ d dlmZ ddd�ZG dd� dej�ZdS ) � )�token)�
fixer_base�chr�str)ZunichrZunicodec s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�
FixUnicodeTz STRING | 'unicode' | 'unichr'c s" t t| �j||� d|jk| _d S )N�unicode_literals)�superr �
start_treeZfuture_featuresr )�selfZtree�filename)� __class__� �1/usr/lib64/python3.6/lib2to3/fixes/fix_unicode.pyr s zFixUnicode.start_treec C s� |j tjkr$|j� }t|j |_|S |j tjkr�|j}| j rl|d dkrld|krldjdd� |j d�D ��}|d dkr�|dd � }||jkr�|S |j� }||_|S d S ) N� z'"�\z\\c S s g | ]}|j d d�j dd��qS )z\uz\\uz\Uz\\U)�replace)�.0�vr
r
r �
<listcomp>! s z(FixUnicode.transform.<locals>.<listcomp>ZuU� )
�typer �NAMEZclone�_mapping�value�STRINGr �join�split)r
ZnodeZresults�new�valr
r
r � transform s"
zFixUnicode.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r �
__classcell__r
r
)r r r s r N)Zpgen2r � r r ZBaseFixr r
r
r
r �<module> s
fixes/__pycache__/fix_apply.cpython-36.pyc 0000644 00000003215 15053244155 0014520 0 ustar 00 3
\~ � @ sR d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z G dd� dej
�Z dS ) zIFixer for apply().
This converts apply(func, v, k) into (func)(*v, **k).� )�pytree)�token)�
fixer_base)�Call�Comma� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixApplyTa.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C sF | j }|st�|d }|d }|jd�}|r`|j| j jkr>d S |j| j jkr`|jd jdkr`d S |r�|j| j jkr�|jd jdkr�d S |j}|j � }|jt
j |j fkr�|j|j
ks�|jd jt
jkr�t|�}d|_|j � }d|_|d k r�|j � }d|_tjt
jd�|g}|d k �r8|jt� tjt
jd�|g� d |d _t|||d
�S )
N�func�args�kwds� z**r � �*� )�prefix���r )�syms�AssertionError�get�typeZ star_exprZargumentZchildren�valuer Zcloner �NAMEZatomZpower�
DOUBLESTARr r ZLeaf�STAR�extendr r ) �selfZnodeZresultsr r r
r r Z l_newargs� r �//usr/lib64/python3.6/lib2to3/fixes/fix_apply.py� transform sB
zFixApply.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) �__doc__r
r Zpgen2r r Z
fixer_utilr r r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_unicode.cpython-36.pyc 0000644 00000002762 15053244155 0015027 0 ustar 00 3
\� � @ s< d Z ddlmZ ddlmZ ddd�ZG dd� dej�Zd S )
z�Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
� )�token)�
fixer_base�chr�str)ZunichrZunicodec s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�
FixUnicodeTz STRING | 'unicode' | 'unichr'c s" t t| �j||� d|jk| _d S )N�unicode_literals)�superr �
start_treeZfuture_featuresr )�selfZtree�filename)� __class__� �1/usr/lib64/python3.6/lib2to3/fixes/fix_unicode.pyr s zFixUnicode.start_treec C s� |j tjkr$|j� }t|j |_|S |j tjkr�|j}| j rl|d dkrld|krldjdd� |j d�D ��}|d dkr�|dd � }||jkr�|S |j� }||_|S d S ) N� z'"�\z\\c S s g | ]}|j d d�j dd��qS )z\uz\\uz\Uz\\U)�replace)�.0�vr
r
r �
<listcomp>! s z(FixUnicode.transform.<locals>.<listcomp>ZuU� )
�typer �NAMEZclone�_mapping�value�STRINGr �join�split)r
ZnodeZresults�new�valr
r
r � transform s"
zFixUnicode.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r �
__classcell__r
r
)r r r s r N)�__doc__Zpgen2r � r r ZBaseFixr r
r
r
r �<module> s
fixes/__pycache__/fix_throw.cpython-36.opt-2.pyc 0000644 00000003016 15053244155 0015475 0 ustar 00 3
\. � @ sV d dl mZ d dlmZ d dl mZ d dlmZmZmZm Z m
Z
G dd� dej �Z dS )� )�pytree)�token)�
fixer_base)�Name�Call�ArgList�Attr�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixThrowTz�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C s� | j }|d j� }|jtjkr.| j|d� d S |jd�}|d krDd S |j� }t|�rndd� |jdd � D �}n d|_ |g}|d }d |kr�|d j� }d|_ t
||�} t | t d
��t
|g�g }
|jtj|j|
�� n|jt
||�� d S ) N�excz+Python 3 does not support string exceptions�valc S s g | ] }|j � �qS � )�clone)�.0�cr
r
�//usr/lib64/python3.6/lib2to3/fixes/fix_throw.py�
<listcomp>) s z&FixThrow.transform.<locals>.<listcomp>� � �args�tb�with_traceback���)�symsr �typer �STRINGZcannot_convert�getr Zchildren�prefixr r r r �replacer ZNodeZpower) �selfZnodeZresultsr r r r Z
throw_argsr �eZwith_tbr
r
r � transform s*
zFixThrow.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr! r
r
r
r r
s r
N)
r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r
r
r
r �<module> s fixes/__pycache__/fix_funcattrs.cpython-36.pyc 0000644 00000001671 15053244155 0015410 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z3Fix function attribute names (f.func_x -> f.__x__).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixFuncattrsTz�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s2 |d d }|j td|jdd � |jd�� d S )N�attr� z__%s__� )�prefix)�replacer �valuer )�selfZnodeZresultsr � r �3/usr/lib64/python3.6/lib2to3/fixes/fix_funcattrs.py� transform s zFixFuncattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_numliterals.cpython-36.opt-2.pyc 0000644 00000001662 15053244155 0016676 0 ustar 00 3
\ � @ s: d dl mZ d dlmZ d dlmZ G dd� dej�ZdS )� )�token)�
fixer_base)�Numberc @ s" e Zd ZejZdd� Zdd� ZdS )�FixNumliteralsc C s |j jd�p|j d dkS )N�0� �Ll���)�value�
startswith)�self�node� r �5/usr/lib64/python3.6/lib2to3/fixes/fix_numliterals.py�match s zFixNumliterals.matchc C s` |j }|d dkr |d d� }n2|jd�rR|j� rRtt|��dkrRd|dd � }t||jd�S )Nr r r Z0o)�prefixr r )r
r �isdigit�len�setr r )r r
Zresults�valr r r � transform s "zFixNumliterals.transformN)�__name__�
__module__� __qualname__r �NUMBERZ _accept_typer r r r r r r s r N)Zpgen2r � r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_reduce.cpython-36.pyc 0000644 00000002125 15053244155 0014641 0 ustar 00 3
\E � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zqFixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
� )�
fixer_base)� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReduceTZpreai
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t dd|� d S )N� functools�reduce)r )�selfZnodeZresults� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_reduce.py� transform" s zFixReduce.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr
r r r r r s r N)�__doc__Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_buffer.cpython-36.pyc 0000644 00000001423 15053244155 0014643 0 ustar 00 3
\N � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z4Fixer that changes buffer(...) into memoryview(...).� )�
fixer_base)�Namec @ s e Zd ZdZdZdZdd� ZdS )� FixBufferTzR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s |d }|j td|jd�� d S )N�name�
memoryview)�prefix)�replacer r )�selfZnodeZresultsr � r
�0/usr/lib64/python3.6/lib2to3/fixes/fix_buffer.py� transform s zFixBuffer.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_urllib.cpython-36.opt-1.pyc 0000644 00000013517 15053244155 0015631 0 ustar 00 3
\� � @ s� d Z ddlmZmZ ddlmZmZmZmZm Z m
Z
m Z dddddd d
d d gfd
ddddddddddddddd gfd d gfgdd d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5gfd d6d7gfgd8�Z e d9 j
e d: d; � d<d=� ZG d>d?� d?e�Zd@S )Az�Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
� )�
alternates�
FixImports)�Name�Comma�
FromImport�Newline�find_indentation�Node�symszurllib.requestZ URLopenerZFancyURLopenerZ urlretrieveZ
_urlopenerZurlopenZ
urlcleanupZ pathname2urlZ url2pathnamez urllib.parseZquoteZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ splitattrZ splithostZ
splitnportZ splitpasswdZ splitportZ
splitqueryZsplittagZ splittypeZ splituserZ
splitvaluez urllib.errorZContentTooShortErrorZinstall_openerZ build_openerZRequestZOpenerDirectorZ BaseHandlerZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZURLErrorZ HTTPError)�urllib�urllib2r r � c c s~ t � } xrtj� D ]f\}}x\|D ]T}|\}}t|�}d||f V d|||f V d| V d| V d||f V q W qW d S )Nz�import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
z�import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
zIimport_from< 'from' module_star=%r 'import' star='*' >
ztimport_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
zKpower< bare_with_attr=%r trailer< '.' member=%s > any* >
)�set�MAPPING�itemsr )ZbareZ
old_moduleZchanges�changeZ
new_module�members� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_urllib.py�
build_pattern0 s
r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) � FixUrllibc C s dj t� �S )N�|)�joinr )�selfr r r r I s zFixUrllib.build_patternc C sz |j d�}|j}g }x6t|j dd� D ] }|jt|d |d�t� g� q(W |jtt|j d d |d�� |j|� dS )z�Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
�moduleNr
r )�prefix���r ) �getr r �value�extendr r �append�replace)r �node�resultsZ
import_mod�pref�names�namer r r �transform_importL s
zFixUrllib.transform_importc C s> |j d�}|j}|j d�}|r�t|t�r0|d }d}x*t|j D ] }|j|d kr@|d }P q@W |rx|jt||d�� n | j|d� �n�g }i } |d }
x�|
D ]�}|j t
j kr�|j d j} |j d j} n
|j} d} | d
kr�xPt|j D ]B}| |d kr�|d | k�r|j
|d � | j|d g �j
|� q�W q�W g }
t|�}d }d d
� }x�|D ]�}| | }g }x2|dd� D ]"}|j|||�� |j
t� � �qlW |j||d |�� t||�}| �s�|jjj|��r�||_|
j
|� d}�qNW |
�r.g }x&|
dd� D ]}|j|t� g� �q�W |j
|
d � |j|� n | j|d� dS )z�Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
�
mod_member�memberr Nr
)r z!This is an invalid module elementr � �,Tc S sX | j tjkrHt| jd j|d�| jd j� | jd j� g}ttj|�gS t| j|d�gS )Nr )r r
r* )�typer
�import_as_namer �childrenr Zcloner )r& r Zkidsr r r � handle_name� s z/FixUrllib.transform_member.<locals>.handle_nameFz All module elements are invalidr r r r )r r �
isinstance�listr r r! r �cannot_convertr, r
r- r. r �
setdefaultr r r r �parent�endswithr )r r" r# r( r$ r) �new_namer �modulesZmod_dictr Zas_name� member_nameZ new_nodesZ indentation�firstr/ r Zeltsr% Zelt�newZnodesZnew_noder r r �transform_member\ sh
zFixUrllib.transform_memberc C s� |j d�}|j d�}d}t|t�r*|d }x*t|j D ] }|j|d kr6|d }P q6W |rp|jt||jd�� n | j|d� dS )z.Transform for calls to module members in code.�bare_with_attrr) Nr r
)r z!This is an invalid module element) r r0 r1 r r r! r r r2 )r r" r# Z
module_dotr) r6 r r r r �
transform_dot� s
zFixUrllib.transform_dotc C sz |j d�r| j||� n^|j d�r0| j||� nF|j d�rH| j||� n.|j d�r`| j|d� n|j d�rv| j|d� d S )Nr r( r< Z module_starzCannot handle star imports.Z module_asz#This module is now multiple modules)r r' r; r= r2 )r r" r# r r r � transform� s
zFixUrllib.transformN)�__name__�
__module__� __qualname__r r' r; r= r> r r r r r G s
Lr N)�__doc__Zlib2to3.fixes.fix_importsr r Zlib2to3.fixer_utilr r r r r r r
r r r r r r r r �<module> s@ $
fixes/__pycache__/fix_input.cpython-36.opt-2.pyc 0000644 00000001534 15053244155 0015474 0 ustar 00 3
\� � @ sH d dl mZ d dlmZmZ d dl mZ ejd�ZG dd� dej�Z dS )� )�
fixer_base)�Call�Name)�patcompz&power< 'eval' trailer< '(' any ')' > >c @ s e Zd ZdZdZdd� ZdS )�FixInputTzL
power< 'input' args=trailer< '(' [any] ')' > >
c C s6 t j|jj�rd S |j� }d|_ttd�|g|jd�S )N� �eval)�prefix)�context�match�parentZcloner r r )�selfZnodeZresults�new� r �//usr/lib64/python3.6/lib2to3/fixes/fix_input.py� transform s
zFixInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r N)
r r Z
fixer_utilr r r Zcompile_patternr
ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_future.cpython-36.pyc 0000644 00000001373 15053244155 0014710 0 ustar 00 3
\# � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zVRemove __future__ imports
from __future__ import foo is replaced with an empty line.
� )�
fixer_base)� BlankLinec @ s e Zd ZdZdZdZdd� ZdS )� FixFutureTz;import_from< 'from' module_name="__future__" 'import' any >�
c C s t � }|j|_|S )N)r �prefix)�selfZnodeZresults�new� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_future.py� transform s zFixFuture.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r
r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_paren.cpython-36.opt-1.pyc 0000644 00000002531 15053244155 0015437 0 ustar 00 3
\� � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )zuFixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``.� )�
fixer_base)�LParen�RParenc @ s e Zd ZdZdZdd� ZdS )�FixParenTa
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C s8 |d }t � }|j|_d|_|jd|� |jt� � d S )N�target� � )r �prefixZ insert_childZ append_childr )�selfZnodeZresultsr Zlparen� r �//usr/lib64/python3.6/lib2to3/fixes/fix_paren.py� transform% s zFixParen.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__r r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_methodattrs.cpython-36.opt-1.pyc 0000644 00000001623 15053244155 0016671 0 ustar 00 3
\^ � @ s> d Z ddlmZ ddlmZ dddd�ZG dd � d ej�Zd
S ) z;Fix bound method attributes (method.im_? -> method.__?__).
� )�
fixer_base)�Name�__func__�__self__z__self__.__class__)Zim_funcZim_selfZim_classc @ s e Zd ZdZdZdd� ZdS )�FixMethodattrsTzU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C s. |d d }t |j }|jt||jd�� d S )N�attr� )�prefix)�MAP�value�replacer r )�selfZnodeZresultsr �new� r �5/usr/lib64/python3.6/lib2to3/fixes/fix_methodattrs.py� transform s
zFixMethodattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)�__doc__� r Z
fixer_utilr r
ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_ne.cpython-36.opt-2.pyc 0000644 00000001345 15053244155 0014737 0 ustar 00 3
\; � @ s: d dl mZ d dlmZ d dl mZ G dd� dej�ZdS )� )�pytree)�token)�
fixer_basec @ s" e Zd ZejZdd� Zdd� ZdS )�FixNec C s
|j dkS )Nz<>)�value)�self�node� r �,/usr/lib64/python3.6/lib2to3/fixes/fix_ne.py�match s z FixNe.matchc C s t jtjd|jd�}|S )Nz!=)�prefix)r ZLeafr �NOTEQUALr )r r Zresults�newr r r
� transform s zFixNe.transformN)�__name__�
__module__� __qualname__r r
Z _accept_typer r r r r r
r s r N)� r Zpgen2r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_next.cpython-36.pyc 0000644 00000005737 15053244155 0014364 0 ustar 00 3
\f � @ sn d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z dZ G dd� dej
�Zd d
� Zd d � Zd
d� ZdS )z.Fixer for it.next() -> next(it), per PEP 3114.� )�token)�python_symbols)�
fixer_base)�Name�Call� find_bindingz;Calls to builtin next() possibly shadowed by global bindingc s0 e Zd ZdZdZdZ� fdd�Zdd� Z� ZS )�FixNextTa�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
Zprec s> t t| �j||� td|�}|r4| j|t� d| _nd| _d S )N�nextTF)�superr �
start_treer �warning� bind_warning�
shadowed_next)�selfZtree�filename�n)� __class__� �./usr/lib64/python3.6/lib2to3/fixes/fix_next.pyr $ s
zFixNext.start_treec C s |st �|jd�}|jd�}|jd�}|rz| jrF|jtd|jd�� n2dd� |D �}d|d _|jttd
|jd�|�� n�|r�td|jd�}|j|� nl|r�t|�r�|d }djd d� |D ��j � d
kr�| j
|t � d S |jtd�� n d|k�r| j
|t � d| _d S )N�base�attr�name�__next__)�prefixc S s g | ] }|j � �qS r )Zclone)�.0r r r r �
<listcomp>9 s z%FixNext.transform.<locals>.<listcomp>� � r �headc S s g | ] }t |��qS r )�str)r r r r r r E s Z __builtin__�globalT) �AssertionError�getr �replacer r r �is_assign_target�join�stripr r
)r �nodeZresultsr r r r r r r r � transform. s.
zFixNext.transform) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERN�orderr r( �
__classcell__r r )r r r s
r c C sF t | �}|d krdS x,|jD ]"}|jtjkr0dS t|| �r dS q W dS )NFT)� find_assign�children�typer �EQUAL�
is_subtree)r' ZassignZchildr r r r$ Q s
r$ c C s4 | j tjkr| S | j tjks&| jd kr*d S t| j�S )N)r0 �symsZ expr_stmtZ simple_stmt�parentr. )r' r r r r. ] s
r. c s$ | � kr dS t � fdd�| jD ��S )NTc 3 s | ]}t |� �V qd S )N)r2 )r �c)r' r r � <genexpr>g s z is_subtree.<locals>.<genexpr>)�anyr/ )�rootr' r )r' r r2 d s r2 N)�__doc__Zpgen2r Zpygramr r3 r r Z
fixer_utilr r r r
ZBaseFixr r$ r. r2 r r r r �<module> s @ fixes/__pycache__/fix_basestring.cpython-36.pyc 0000644 00000001202 15053244155 0015526 0 ustar 00 3
\@ � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z Fixer for basestring -> str.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixBasestringTz 'basestring'c C s t d|jd�S )N�str)�prefix)r r )�selfZnodeZresults� r �4/usr/lib64/python3.6/lib2to3/fixes/fix_basestring.py� transform
s zFixBasestring.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_idioms.cpython-36.opt-2.pyc 0000644 00000006356 15053244155 0015630 0 ustar 00 3
\ � @ sJ d dl mZ d dlmZmZmZmZmZmZ dZ dZ
G dd� dej �Z dS )� )�
fixer_base)�Call�Comma�Name�Node� BlankLine�symsz0(n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)z(power< 'type' trailer< '(' x=any ')' > >c sP e Zd ZdZdeeeef Z� fdd�Zdd� Zdd� Z d d
� Z
d d � Z � Z S )
� FixIdiomsTa�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c s8 t t| �j|�}|r4d|kr4|d |d kr0|S d S |S )N�sortedZid1Zid2)�superr �match)�self�node�r)� __class__� �0/usr/lib64/python3.6/lib2to3/fixes/fix_idioms.pyr O s zFixIdioms.matchc C sH d|kr| j ||�S d|kr(| j||�S d|kr<| j||�S td��d S )N�
isinstance�whiler
z
Invalid match)�transform_isinstance�transform_while�transform_sort� RuntimeError)r
r �resultsr r r � transformZ s zFixIdioms.transformc C sh |d j � }|d j � }d|_d|_ttd�|t� |g�}d|kr\d|_ttjtd�|g�}|j|_|S )N�x�T� � r �n�not)�clone�prefixr r r r r Znot_test)r
r r r r Ztestr r r r d s z FixIdioms.transform_isinstancec C s |d }|j td|jd�� d S )Nr �True)r" )�replacer r" )r
r r Zoner r r r p s zFixIdioms.transform_whilec C s� |d }|d }|j d�}|j d�}|r>|jtd|jd�� n8|rn|j� }d|_|jttd�|g|jd�� ntd��|j� |j}d |kr�|r�|jd �d
|d
jf} d j | �|d
_n"t
� }
|j j |
� |jd �d
|
_d S ) N�sort�next�list�exprr
)r" r z should not have reached here�
� )
�getr$ r r" r! r r �remove�
rpartition�joinr �parentZ append_child) r
r r Z sort_stmtZ next_stmtZ list_callZ simple_expr�newZbtwnZ prefix_linesZend_liner r r r t s*
zFixIdioms.transform_sort)
�__name__�
__module__� __qualname__Zexplicit�TYPE�CMPZPATTERNr r r r r �
__classcell__r r )r r r % s '
r N)
r r Z
fixer_utilr r r r r r r5 r4 ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_dict.cpython-36.pyc 0000644 00000006356 15053244155 0014327 0 ustar 00 3
\� � @ sj d Z ddlmZ ddlmZ ddlmZ ddlmZmZmZ ddlmZ ej dhB Z
G dd � d ej �Z d
S ) aj Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
� )�pytree)�patcomp)�
fixer_base)�Name�Call�Dot)�
fixer_util�iterc @ s@ e Zd ZdZdZdd� ZdZeje�Z dZ
eje
�Z dd� Z d S )
�FixDictTa
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c
C s |d }|d d }|d }| j }|j}|jd�}|jd�} |sD| rP|dd � }|dksdtt|���d d � |D �}d
d � |D �}| o�| j||�}
|tj|jt � t
||j d�g�|d j � g } tj|j
| �} |
p�| s�d| _ tt
|r�dnd�| g�} |�rtj|j
| g| �} |j | _ | S )N�head�method� �tailr Zview� �keys�items�valuesc S s g | ] }|j � �qS � )�clone)�.0�nr r �./usr/lib64/python3.6/lib2to3/fixes/fix_dict.py�
<listcomp>A s z%FixDict.transform.<locals>.<listcomp>c S s g | ] }|j � �qS r )r )r r r r r r B s )�prefixZparens� �list)r r r )�syms�value�
startswith�AssertionError�repr�in_special_contextr ZNodeZtrailerr r r r Zpowerr )
�self�node�resultsr r r r Z method_name�isiterZisviewZspecial�args�newr r r � transform6 s4
zFixDict.transformz3power< func=NAME trailer< '(' node=any ')' > any* >zmfor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� |j d krdS i }|j j d k r^| jj|j j |�r^|d |kr^|rN|d jtkS |d jtjkS |sfdS | jj|j |�o�|d |kS )NFr# �func)�parent�p1�matchr � iter_exemptr �consuming_calls�p2)r" r# r% r$ r r r r! Z s
zFixDict.in_special_contextN)
�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr( ZP1r Zcompile_patternr+ ZP2r/ r! r r r r r
) s
r
N)
�__doc__r r r r r r r r r. r- ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_itertools_imports.cpython-36.opt-1.pyc 0000644 00000003020 15053244155 0020125 0 ustar 00 3
\& � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )zA Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) � )�
fixer_base)� BlankLine�syms�tokenc @ s" e Zd ZdZde� Zdd� ZdS )�FixItertoolsImportsTzT
import_from< 'from' 'itertools' 'import' imports=any >
c C sl |d }|j tjks |j r$|g}n|j}x�|d d d� D ]z}|j tjkrV|j}|}n|j tjkrfd S |jd }|j}|dkr�d |_|j� q:|dkr:|j � |d d
kr�d nd |_q:W |jd d � p�|g}d
} x0|D ](}| o�|j tj
k� r�|j� q�| d
N } q�W x*|�r,|d j tj
k�r,|j � j� �qW |j�p@t |dd � �sR|j
d k�rh|j}
t� }|
|_|S d S )N�imports� r �imap�izip�ifilter� ifilterfalse� izip_longest� �f� filterfalse� zip_longestT�value)r r
r )r r
���)�typer Zimport_as_name�childrenr �NAMEr �STAR�removeZchanged�COMMA�pop�getattr�parent�prefixr ) �selfZnodeZresultsr r Zchild�memberZ name_node� member_nameZ remove_comma�p� r" �;/usr/lib64/python3.6/lib2to3/fixes/fix_itertools_imports.py� transform sB
z FixItertoolsImports.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�localsZPATTERNr$ r" r" r" r# r s
r N) �__doc__Zlib2to3r Zlib2to3.fixer_utilr r r ZBaseFixr r" r" r" r# �<module> s fixes/__pycache__/fix_types.cpython-36.opt-2.pyc 0000644 00000002466 15053244155 0015506 0 ustar 00 3
\� � @ sl d dl mZ d dlmZ dddddddd d
d d
d d
ddddddddd�Zdd� eD �ZG dd� dej�ZdS )� )�
fixer_base)�Name�bool�
memoryview�type�complex�dictztype(Ellipsis)�float�int�list�objectz
type(None)ztype(NotImplemented)�slice�bytesz(str,)�tuple�str�range)Z BooleanTypeZ
BufferTypeZ ClassTypeZ ComplexTypeZDictTypeZDictionaryTypeZ EllipsisTypeZ FloatTypeZIntTypeZListTypeZLongTypeZ
ObjectTypeZNoneTypeZNotImplementedTypeZ SliceTypeZ
StringTypeZ StringTypesZ TupleTypeZTypeTypeZ UnicodeTypeZ
XRangeTypec C s g | ] }d | �qS )z)power< 'types' trailer< '.' name='%s' > >� )�.0�tr r �//usr/lib64/python3.6/lib2to3/fixes/fix_types.py�
<listcomp>3 s r c @ s" e Zd ZdZdje�Zdd� ZdS )�FixTypesT�|c C s& t j|d j�}|r"t||jd�S d S )N�name)�prefix)�
_TYPE_MAPPING�get�valuer r )�selfZnodeZresultsZ new_valuer r r � transform9 s zFixTypes.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�join�_patsZPATTERNr r r r r r 5 s
r N)� r Z
fixer_utilr r r$ ZBaseFixr r r r r �<module> s0 fixes/__pycache__/fix_basestring.cpython-36.opt-2.pyc 0000644 00000001125 15053244155 0016472 0 ustar 00 3
\@ � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixBasestringTz 'basestring'c C s t d|jd�S )N�str)�prefix)r r )�selfZnodeZresults� r �4/usr/lib64/python3.6/lib2to3/fixes/fix_basestring.py� transform
s zFixBasestring.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_methodattrs.cpython-36.pyc 0000644 00000001623 15053244155 0015732 0 ustar 00 3
\^ � @ s> d Z ddlmZ ddlmZ dddd�ZG dd � d ej�Zd
S ) z;Fix bound method attributes (method.im_? -> method.__?__).
� )�
fixer_base)�Name�__func__�__self__z__self__.__class__)Zim_funcZim_selfZim_classc @ s e Zd ZdZdZdd� ZdS )�FixMethodattrsTzU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C s. |d d }t |j }|jt||jd�� d S )N�attr� )�prefix)�MAP�value�replacer r )�selfZnodeZresultsr �new� r �5/usr/lib64/python3.6/lib2to3/fixes/fix_methodattrs.py� transform s
zFixMethodattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)�__doc__� r Z
fixer_utilr r
ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_set_literal.cpython-36.opt-2.pyc 0000644 00000003067 15053244155 0016647 0 ustar 00 3
\� � @ s6 d dl mZmZ d dlmZmZ G dd� dej�ZdS )� )�
fixer_base�pytree)�token�symsc @ s e Zd ZdZdZdZdd� ZdS )�
FixSetLiteralTaj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s� |j d�}|r2tjtj|j� g�}|j|� |}n|d }tjtj d�g}|j
dd� |j D �� |j tjtj
d�� |jj|d
_tjtj|�}|j|_t|j �dkr�|j d }|j� |j|j d _|S ) N�single�items�{c s s | ]}|j � V qd S )N)�clone)�.0�n� r
�5/usr/lib64/python3.6/lib2to3/fixes/fix_set_literal.py� <genexpr>' s z*FixSetLiteral.transform.<locals>.<genexpr>�}� � � ���r )�getr ZNoder Z listmakerr
�replaceZLeafr �LBRACE�extendZchildren�append�RBRACEZ next_sibling�prefixZ dictsetmaker�len�remove) �selfZnodeZresultsr Zfaker �literalZmakerr r
r
r � transform s"
zFixSetLiteral.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s
r N)Zlib2to3r r Zlib2to3.fixer_utilr r ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_xrange.cpython-36.opt-2.pyc 0000644 00000004625 15053244155 0015625 0 ustar 00 3
\�
� @ sB d dl mZ d dlmZmZmZ d dl mZ G dd� dej�ZdS )� )�
fixer_base)�Name�Call�consuming_calls)�patcompc sh e Zd ZdZdZ� fdd�Zdd� Zdd� Zd d
� Zd d � Z d
Z
e j e
�Z
dZe j e�Zdd� Z� ZS )� FixXrangeTz�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c s t t| �j||� t� | _d S )N)�superr �
start_tree�set�transformed_xranges)�self�tree�filename)� __class__� �0/usr/lib64/python3.6/lib2to3/fixes/fix_xrange.pyr s zFixXrange.start_treec C s
d | _ d S )N)r )r r
r r r r � finish_tree s zFixXrange.finish_treec C sD |d }|j dkr | j||�S |j dkr4| j||�S tt|���d S )N�nameZxrange�range)�value�transform_xrange�transform_range�
ValueError�repr)r �node�resultsr r r r � transform s
zFixXrange.transformc C s0 |d }|j td|jd�� | jjt|�� d S )Nr r )�prefix)�replacer r r �add�id)r r r r r r r r $ s zFixXrange.transform_xrangec C sl t |�| jkrh| j|� rhttd�|d j� g�}ttd�|g|jd�}x|d D ]}|j|� qRW |S d S )Nr �args�list)r �rest)r r �in_special_contextr r Zcloner Z append_child)r r r Z
range_callZ list_call�nr r r r * s
zFixXrange.transform_rangez3power< func=NAME trailer< '(' node=any ')' > any* >z�for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C sf |j d krdS i }|j j d k rJ| jj|j j |�rJ|d |krJ|d jtkS | jj|j |�od|d |kS )NFr �func)�parent�p1�matchr r �p2)r r r r r r r$ ? s
z FixXrange.in_special_context)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r ZP1r Zcompile_patternr( ZP2r* r$ �
__classcell__r r )r r r s
r N) � r Z
fixer_utilr r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_throw.cpython-36.opt-1.pyc 0000644 00000003365 15053244155 0015503 0 ustar 00 3
\. � @ sZ d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z G dd� dej �Z
dS ) z�Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions.� )�pytree)�token)�
fixer_base)�Name�Call�ArgList�Attr�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixThrowTz�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C s� | j }|d j� }|jtjkr.| j|d� d S |jd�}|d krDd S |j� }t|�rndd� |jdd � D �}n d|_ |g}|d }d |kr�|d j� }d|_ t
||�} t | t d
��t
|g�g }
|jtj|j|
�� n|jt
||�� d S ) N�excz+Python 3 does not support string exceptions�valc S s g | ] }|j � �qS � )�clone)�.0�cr
r
�//usr/lib64/python3.6/lib2to3/fixes/fix_throw.py�
<listcomp>) s z&FixThrow.transform.<locals>.<listcomp>� � �args�tb�with_traceback���)�symsr �typer �STRINGZcannot_convert�getr Zchildren�prefixr r r r �replacer ZNodeZpower) �selfZnodeZresultsr r r r Z
throw_argsr �eZwith_tbr
r
r � transform s*
zFixThrow.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr! r
r
r
r r
s r
N)�__doc__r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r
r
r
r �<module> s
fixes/__pycache__/fix_itertools_imports.cpython-36.pyc 0000644 00000003064 15053244155 0017176 0 ustar 00 3
\& � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )zA Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) � )�
fixer_base)� BlankLine�syms�tokenc @ s" e Zd ZdZde� Zdd� ZdS )�FixItertoolsImportsTzT
import_from< 'from' 'itertools' 'import' imports=any >
c C s~ |d }|j tjks |j r$|g}n|j}x�|d d d� D ]�}|j tjkrV|j}|}n*|j tjkrfd S |j tjksvt�|jd }|j}|dkr�d |_|j � q:|dkr:|j
� |d d
kr�d nd |_q:W |jd d � p�|g}d
} x2|D ]*}| �r|j tj k�r|j � q�| d
N } q�W x*|�r>|d j tj k�r>|j � j � �qW |j�pRt
|dd � �sd|jd k�rz|j}
t� }|
|_|S d S )N�imports� r �imap�izip�ifilter� ifilterfalse� izip_longest� �f� filterfalse� zip_longestT�value)r r
r )r r
���)�typer Zimport_as_name�childrenr �NAMEr �STAR�AssertionError�removeZchanged�COMMA�pop�getattr�parent�prefixr ) �selfZnodeZresultsr r Zchild�memberZ name_node� member_nameZ remove_comma�p� r# �;/usr/lib64/python3.6/lib2to3/fixes/fix_itertools_imports.py� transform sD
z FixItertoolsImports.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�localsZPATTERNr% r# r# r# r$ r s
r N) �__doc__Zlib2to3r Zlib2to3.fixer_utilr r r ZBaseFixr r# r# r# r$ �<module> s fixes/__pycache__/fix_has_key.cpython-36.pyc 0000644 00000005521 15053244155 0015020 0 ustar 00 3
\| � @ sB d Z ddlmZ ddlmZ ddlmZmZ G dd� dej�ZdS )a& Fixer for has_key().
Calls to .has_key() methods are expressed in terms of the 'in'
operator:
d.has_key(k) -> k in d
CAVEATS:
1) While the primary target of this fixer is dict.has_key(), the
fixer will change any has_key() method call, regardless of its
class.
2) Cases like this will not be converted:
m = d.has_key
if m(k):
...
Only *calls* to has_key() are converted. While it is possible to
convert the above to something like
m = d.__contains__
if m(k):
...
this is currently not done.
� )�pytree)�
fixer_base)�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )� FixHasKeyTa�
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
c
C s� |st �| j}|jj|jkr.| jj|j�r.d S |jd�}|d }|j}dd� |d D �}|d j � }|jd�} | r�dd� | D �} |j|j
|j|j |j |j
|j|jfkr�t|�}t|�d kr�|d
}ntj|j|�}d |_td d d
�}
|�rtdd d
�} tj|j| |
f�}
tj|j
||
|f�} | �rBt| �} tj|j| ft| � �} |jj|j
|j|j|j|j|j |j |j |jf k�r|t| �} || _| S )N�negation�anchorc S s g | ] }|j � �qS � )�clone)�.0�nr r �1/usr/lib64/python3.6/lib2to3/fixes/fix_has_key.py�
<listcomp>R s z'FixHasKey.transform.<locals>.<listcomp>�before�arg�afterc S s g | ] }|j � �qS r )r
)r r r r r
r V s � � � �in)�prefix�not) �AssertionError�syms�parent�typeZnot_test�pattern�match�getr r
Z
comparisonZand_testZor_testZtestZlambdefZargumentr �lenr ZNodeZpowerr Zcomp_op�tuple�exprZxor_exprZand_exprZ
shift_exprZ
arith_exprZtermZfactor)
�selfZnodeZresultsr r r r r r r Zn_opZn_not�newr r r
� transformG sF
zFixHasKey.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr$ r r r r
r & s r N) �__doc__� r r Z
fixer_utilr r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_paren.cpython-36.opt-2.pyc 0000644 00000002323 15053244155 0015437 0 ustar 00 3
\� � @ s2 d dl mZ d dlmZmZ G dd� dej�ZdS )� )�
fixer_base)�LParen�RParenc @ s e Zd ZdZdZdd� ZdS )�FixParenTa
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C s8 |d }t � }|j|_d|_|jd|� |jt� � d S )N�target� � )r �prefixZ insert_childZ append_childr )�selfZnodeZresultsr Zlparen� r �//usr/lib64/python3.6/lib2to3/fixes/fix_paren.py� transform% s zFixParen.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)r r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_nonzero.cpython-36.pyc 0000644 00000001606 15053244155 0015067 0 ustar 00 3
\O � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z*Fixer for __nonzero__ -> __bool__ methods.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixNonzeroTz�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s$ |d }t d|jd�}|j|� d S )N�name�__bool__)�prefix)r r �replace)�selfZnodeZresultsr �new� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_nonzero.py� transform s zFixNonzero.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_reload.cpython-36.opt-1.pyc 0000644 00000002165 15053244155 0015603 0 ustar 00 3
\� � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )z/Fixer for reload().
reload(s) -> imp.reload(s)� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReloadTZprez�
power< 'reload'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sd |rD|d }|rD|j | jjkr"d S |j | jjkrD|jd jdkrDd S d}t|||�}td d|� |S )N�obj� z**�imp�reload)r r )�typeZsymsZ star_exprZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_reload.py� transform s zFixReload.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)�__doc__� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_exitfunc.cpython-36.pyc 0000644 00000004343 15053244155 0015223 0 ustar 00 3
\� � @ sJ d Z ddlmZmZ ddlmZmZmZmZm Z m
Z
G dd� dej �Z dS )z7
Convert use of sys.exitfunc to use the atexit module.
� )�pytree�
fixer_base)�Name�Attr�Call�Comma�Newline�symsc s< e Zd ZdZdZdZ� fdd�Z� fdd�Zdd� Z� Z S ) � FixExitfuncTa�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c s t t| �j|� d S )N)�superr
�__init__)�self�args)� __class__� �2/usr/lib64/python3.6/lib2to3/fixes/fix_exitfunc.pyr s zFixExitfunc.__init__c s t t| �j||� d | _d S )N)r r
�
start_tree�
sys_import)r
Ztree�filename)r r r r ! s zFixExitfunc.start_treec C s& d|kr | j d kr |d | _ d S |d j� }d|_tjtjttd�td���}t ||g|j�}|j
|� | j d kr�| j |d� d S | j j d }|j
tjkr�|jt� � |jtdd�� nj| j j}|j j| j �}|j} tjtjtd �tdd�g�}
tjtj|
g�} |j|d t� � |j|d
| � d S ) Nr �func� �atexit�registerzKCan't find sys import; Please add an atexit import at the top of your file.� � �import� )r Zclone�prefixr ZNoder Zpowerr r r �replaceZwarningZchildren�typeZdotted_as_namesZ append_childr �parent�indexZ import_nameZ simple_stmtZ insert_childr ) r
ZnodeZresultsr r Zcall�namesZcontaining_stmtZpositionZstmt_containerZ
new_import�newr r r � transform% s2
zFixExitfunc.transform)
�__name__�
__module__� __qualname__Zkeep_line_orderZ
BM_compatibleZPATTERNr r r$ �
__classcell__r r )r r r
s r
N)
�__doc__Zlib2to3r r Zlib2to3.fixer_utilr r r r r r ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_intern.cpython-36.opt-2.pyc 0000644 00000002065 15053244155 0015634 0 ustar 00 3
\� � @ s2 d dl mZ d dlmZmZ G dd� dej�ZdS )� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixInternTZprez�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sd |rD|d }|rD|j | jjkr"d S |j | jjkrD|jd jdkrDd S d}t|||�}td d|� |S )N�obj� z**�sys�intern)r r )�typeZsymsZ star_exprZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_intern.py� transform s zFixIntern.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_itertools.cpython-36.opt-1.pyc 0000644 00000002775 15053244155 0016370 0 ustar 00 3
\ � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )aT Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
� )�
fixer_base)�Namec @ s* e Zd ZdZdZde� ZdZdd� ZdS )� FixItertoolsTz7('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')z�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
� c C s� d }|d d }d|krV|j d krV|d |d }}|j}|j� |j� |jj|� |p^|j}|jt|j dd � |d�� d S )
N�func� �it� ifilterfalse� izip_longest�dot� )�prefix)r r
)�valuer
�remove�parent�replacer )�selfZnodeZresultsr
r r r � r �3/usr/lib64/python3.6/lib2to3/fixes/fix_itertools.py� transform s
zFixItertools.transformN) �__name__�
__module__� __qualname__Z
BM_compatibleZit_funcs�localsZPATTERNZ run_orderr r r r r r s
r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_raw_input.cpython-36.opt-1.pyc 0000644 00000001406 15053244155 0016342 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z2Fixer that changes raw_input(...) into input(...).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixRawInputTzU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s |d }|j td|jd�� d S )N�name�input)�prefix)�replacer r )�selfZnodeZresultsr � r
�3/usr/lib64/python3.6/lib2to3/fixes/fix_raw_input.py� transform s zFixRawInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_execfile.cpython-36.opt-2.pyc 0000644 00000002770 15053244155 0016124 0 ustar 00 3
\ � @ sR d dl mZ d dlmZmZmZmZmZmZm Z m
Z
m Z m Z G dd� dej
�ZdS )� )�
fixer_base)
�Comma�Name�Call�LParen�RParen�Dot�Node�ArgList�String�symsc @ s e Zd ZdZdZdd� ZdS )� FixExecfileTz�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s& |d }|j d�}|j d�}|jd jd j� }t|j� t� tdd�g|d�}ttjt d�|g�}ttj
t � t d �g�ttj
t � t
� g�g} |g| }
|j� } d| _td
d�} |
t� | t� | g }
tt d �|
d �}|g}|d k r�|jt� |j� g� |d k �r|jt� |j� g� tt d
�||jd�S )N�filename�globals�locals� z"rb"� )Zrparen�open�readz'exec'�compile� �exec)�prefix���r )�getZchildrenZcloner
r r r r Zpowerr Ztrailerr r r r r �extend)�selfZnodeZresultsr r r Zexecfile_parenZ open_argsZ open_callr Z open_exprZ filename_argZexec_strZ compile_argsZ compile_call�args� r �2/usr/lib64/python3.6/lib2to3/fixes/fix_execfile.py� transform s*
zFixExecfile.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r
N)r r Z
fixer_utilr r r r r r r r
r r ZBaseFixr
r r r r �<module>
s 0 fixes/__pycache__/fix_buffer.cpython-36.opt-1.pyc 0000644 00000001423 15053244155 0015602 0 ustar 00 3
\N � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z4Fixer that changes buffer(...) into memoryview(...).� )�
fixer_base)�Namec @ s e Zd ZdZdZdZdd� ZdS )� FixBufferTzR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s |d }|j td|jd�� d S )N�name�
memoryview)�prefix)�replacer r )�selfZnodeZresultsr � r
�0/usr/lib64/python3.6/lib2to3/fixes/fix_buffer.py� transform s zFixBuffer.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_numliterals.cpython-36.opt-1.pyc 0000644 00000001760 15053244155 0016674 0 ustar 00 3
\ � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z-Fixer that turns 1L into 1, 0755 into 0o755.
� )�token)�
fixer_base)�Numberc @ s" e Zd ZejZdd� Zdd� ZdS )�FixNumliteralsc C s |j jd�p|j d dkS )N�0� �Ll���)�value�
startswith)�self�node� r �5/usr/lib64/python3.6/lib2to3/fixes/fix_numliterals.py�match s zFixNumliterals.matchc C s` |j }|d dkr |d d� }n2|jd�rR|j� rRtt|��dkrRd|dd � }t||jd�S )Nr r r Z0o)�prefixr r )r
r �isdigit�len�setr r )r r
Zresults�valr r r � transform s "zFixNumliterals.transformN)�__name__�
__module__� __qualname__r �NUMBERZ _accept_typer r r r r r r s r N) �__doc__Zpgen2r � r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_standarderror.cpython-36.opt-1.pyc 0000644 00000001273 15053244155 0017206 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z%Fixer for StandardError -> Exception.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�FixStandarderrorTz-
'StandardError'
c C s t d|jd�S )N� Exception)�prefix)r r )�selfZnodeZresults� r �7/usr/lib64/python3.6/lib2to3/fixes/fix_standarderror.py� transform s zFixStandarderror.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_apply.cpython-36.opt-2.pyc 0000644 00000003031 15053244155 0015454 0 ustar 00 3
\~ � @ sN d dl mZ d dlmZ d dl mZ d dlmZmZmZ G dd� dej �Z
dS )� )�pytree)�token)�
fixer_base)�Call�Comma� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixApplyTa.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C s> | j }|d }|d }|jd�}|rX|j| j jkr6d S |j| j jkrX|jd jdkrXd S |r~|j| j jkr~|jd jdkr~d S |j}|j� }|jt j
|j fkr�|j|j ks�|jd jt j
kr�t|�}d|_|j� }d|_|d k r�|j� }d|_tjt jd�|g}|d k �r0|jt� tjt j
d�|g� d |d _t|||d
�S )
N�func�args�kwds� z**r � �*� )�prefix���r )�syms�get�typeZ star_exprZargumentZchildren�valuer Zcloner �NAMEZatomZpower�
DOUBLESTARr r ZLeaf�STAR�extendr r ) �selfZnodeZresultsr r r
r r Z l_newargs� r �//usr/lib64/python3.6/lib2to3/fixes/fix_apply.py� transform s@
zFixApply.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) r
r Zpgen2r r Z
fixer_utilr r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_xreadlines.cpython-36.pyc 0000644 00000002110 15053244155 0015522 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zpFix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixXreadlinesTz�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C s@ |j d�}|r$|jtd|jd�� n|jdd� |d D �� d S )N�no_call�__iter__)�prefixc S s g | ] }|j � �qS � )Zclone)�.0�xr r �4/usr/lib64/python3.6/lib2to3/fixes/fix_xreadlines.py�
<listcomp> s z+FixXreadlines.transform.<locals>.<listcomp>Zcall)�get�replacer r )�selfZnodeZresultsr r r r � transform s
zFixXreadlines.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_set_literal.cpython-36.pyc 0000644 00000003202 15053244155 0015676 0 ustar 00 3
\� � @ s: d Z ddlmZmZ ddlmZmZ G dd� dej�ZdS )z:
Optional fixer to transform set() calls to set literals.
� )�
fixer_base�pytree)�token�symsc @ s e Zd ZdZdZdZdd� ZdS )�
FixSetLiteralTaj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s� |j d�}|r2tjtj|j� g�}|j|� |}n|d }tjtj d�g}|j
dd� |j D �� |j tjtj
d�� |jj|d
_tjtj|�}|j|_t|j �dkr�|j d }|j� |j|j d _|S ) N�single�items�{c s s | ]}|j � V qd S )N)�clone)�.0�n� r
�5/usr/lib64/python3.6/lib2to3/fixes/fix_set_literal.py� <genexpr>' s z*FixSetLiteral.transform.<locals>.<genexpr>�}� � � ���r )�getr ZNoder Z listmakerr
�replaceZLeafr �LBRACE�extendZchildren�append�RBRACEZ next_sibling�prefixZ dictsetmaker�len�remove) �selfZnodeZresultsr Zfaker �literalZmakerr r
r
r � transform s"
zFixSetLiteral.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s
r N) �__doc__Zlib2to3r r Zlib2to3.fixer_utilr r ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_raw_input.cpython-36.opt-2.pyc 0000644 00000001303 15053244155 0016337 0 ustar 00 3
\� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixRawInputTzU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s |d }|j td|jd�� d S )N�name�input)�prefix)�replacer r )�selfZnodeZresultsr � r
�3/usr/lib64/python3.6/lib2to3/fixes/fix_raw_input.py� transform s zFixRawInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r s r N)� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_renames.cpython-36.pyc 0000644 00000003664 15053244155 0015035 0 ustar 00 3
\� � @ sV d Z ddlmZ ddlmZmZ dddiiZi Zdd� Zd d
� Z G d d � d ej
�Z d
S )z?Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
� )�
fixer_base)�Name�
attr_chain�sysZmaxint�maxsizec C s ddj tt| �� d S )N�(�|�))�join�map�repr)�members� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_renames.py�
alternates s r c c sb x\t tj� �D ]L\} }xBt |j� �D ]2\}}|t| |f< d| ||f V d| |f V q$W qW d S )Nz�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
z^
power< module_name=%r trailer< '.' attr_name=%r > any* >
)�list�MAPPING�items�LOOKUP)�module�replaceZold_attr�new_attrr r r �
build_pattern s
r c s8 e Zd ZdZdje� �ZdZ� fdd�Zdd� Z � Z
S )�
FixRenamesTr Zprec s@ t t| �j� � |�}|r<t� fdd�t|d�D ��r8dS |S dS )Nc 3 s | ]}� |�V qd S )Nr )�.0�obj)�matchr r � <genexpr>5 s z#FixRenames.match.<locals>.<genexpr>�parentF)�superr r �anyr )�self�node�results)� __class__)r r r 1 s zFixRenames.matchc C sD |j d�}|j d�}|r@|r@t|j|jf }|jt||jd�� d S )NZ module_name� attr_name)�prefix)�getr �valuer r r& )r! r" r# Zmod_namer% r r r r � transform> s
zFixRenames.transform) �__name__�
__module__� __qualname__Z
BM_compatibler
r ZPATTERN�orderr r) �
__classcell__r r )r$ r r * s
r N) �__doc__� r Z
fixer_utilr r r r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_repr.cpython-36.opt-1.pyc 0000644 00000001470 15053244155 0015303 0 ustar 00 3
\e � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )z/Fixer that transforms `xyzzy` into repr(xyzzy).� )�
fixer_base)�Call�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixReprTz7
atom < '`' expr=any '`' >
c C s8 |d j � }|j| jjkr"t|�}ttd�|g|jd�S )N�expr�repr)�prefix)Zclone�typeZsymsZ testlist1r r r r )�selfZnodeZresultsr � r �./usr/lib64/python3.6/lib2to3/fixes/fix_repr.py� transform s zFixRepr.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N) �__doc__� r Z
fixer_utilr r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_asserts.cpython-36.pyc 0000644 00000002344 15053244155 0015061 0 ustar 00 3
\� � @ sT d Z ddlmZ ddlmZ edddddd d
dddddd d d
�ZG dd� de�ZdS )z5Fixer that replaces deprecated unittest method names.� )�BaseFix)�NameZ
assertTrueZ assertEqualZassertNotEqualZassertAlmostEqualZassertNotAlmostEqualZ assertRegexZassertRaisesRegexZ assertRaisesZ assertFalse)Zassert_Z assertEqualsZassertNotEqualsZassertAlmostEqualsZassertNotAlmostEqualsZassertRegexpMatchesZassertRaisesRegexpZfailUnlessEqualZ failIfEqualZfailUnlessAlmostEqualZfailIfAlmostEqualZ
failUnlessZfailUnlessRaisesZfailIfc @ s( e Zd Zddjeee�� Zdd� ZdS )�
FixAssertszH
power< any+ trailer< '.' meth=(%s)> any* >
�|c C s, |d d }|j ttt|� |jd�� d S )N�meth� )�prefix)�replacer �NAMES�strr )�selfZnodeZresults�name� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_asserts.py� transform s zFixAsserts.transformN) �__name__�
__module__� __qualname__�join�map�reprr
ZPATTERNr r r r r r s r N)�__doc__Z
fixer_baser Z
fixer_utilr �dictr
r r r r r �<module> s$ fixes/__pycache__/fix_xrange.cpython-36.opt-1.pyc 0000644 00000004725 15053244155 0015625 0 ustar 00 3
\�
� @ sF d Z ddlmZ ddlmZmZmZ ddlmZ G dd� dej�Z dS )z/Fixer that changes xrange(...) into range(...).� )�
fixer_base)�Name�Call�consuming_calls)�patcompc sh e Zd ZdZdZ� fdd�Zdd� Zdd� Zd d
� Zd d � Z d
Z
e j e
�Z
dZe j e�Zdd� Z� ZS )� FixXrangeTz�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c s t t| �j||� t� | _d S )N)�superr �
start_tree�set�transformed_xranges)�self�tree�filename)� __class__� �0/usr/lib64/python3.6/lib2to3/fixes/fix_xrange.pyr s zFixXrange.start_treec C s
d | _ d S )N)r )r r
r r r r � finish_tree s zFixXrange.finish_treec C sD |d }|j dkr | j||�S |j dkr4| j||�S tt|���d S )N�nameZxrange�range)�value�transform_xrange�transform_range�
ValueError�repr)r �node�resultsr r r r � transform s
zFixXrange.transformc C s0 |d }|j td|jd�� | jjt|�� d S )Nr r )�prefix)�replacer r r �add�id)r r r r r r r r $ s zFixXrange.transform_xrangec C sl t |�| jkrh| j|� rhttd�|d j� g�}ttd�|g|jd�}x|d D ]}|j|� qRW |S d S )Nr �args�list)r �rest)r r �in_special_contextr r Zcloner Z append_child)r r r Z
range_callZ list_call�nr r r r * s
zFixXrange.transform_rangez3power< func=NAME trailer< '(' node=any ')' > any* >z�for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C sf |j d krdS i }|j j d k rJ| jj|j j |�rJ|d |krJ|d jtkS | jj|j |�od|d |kS )NFr �func)�parent�p1�matchr r �p2)r r r r r r r$ ? s
z FixXrange.in_special_context)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r ZP1r Zcompile_patternr( ZP2r* r$ �
__classcell__r r )r r r s
r N)
�__doc__� r Z
fixer_utilr r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_except.cpython-36.opt-2.pyc 0000644 00000004457 15053244155 0015634 0 ustar 00 3
\
� @ sb d dl mZ d dlmZ d dl mZ d dlmZmZmZm Z m
Z
m Z dd� Z G dd� dej
�Zd S )
� )�pytree)�token)�
fixer_base)�Assign�Attr�Name�is_tuple�is_list�symsc c sH xBt | �D ]6\}}|jtjkr
|jd jdkr
|| |d fV q
W d S )N� �exceptr )� enumerate�typer
�
except_clause�children�value)Znodes�i�n� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_except.py� find_excepts s r c @ s e Zd ZdZdZdd� ZdS )� FixExceptTa1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C s� | j }dd� |d D �}dd� |d D �}�x*t|�D �] \}}t|j�dkr6|jdd� \}} }
| jtdd d
�� |
jtjk�rDt| j � d d
�} |
j
� } d | _ |
j| � | j
� } |j}
x"t |
�D ]\}}t
|tj�r�P q�W t|
�s�t|
��rt| t| td ���}n
t| | �}x&t|
d |� �D ]}|jd
|� �q W |j||� q6|
j d kr6d |
_ q6W dd� |jd d� D �| | }tj|j|�S )Nc S s g | ] }|j � �qS r )�clone)�.0r r r r �
<listcomp>2 s z'FixExcept.transform.<locals>.<listcomp>�tailc S s g | ] }|j � �qS r )r )r Zchr r r r 4 s Zcleanup� � �as� )�prefix� �argsr c S s g | ] }|j � �qS r )r )r �cr r r r \ s � )r
r �lenr �replacer r r �NAME�new_namer r r
�
isinstancer ZNoder r r r �reversedZ insert_child)�selfZnodeZresultsr
r Z try_cleanupr Ze_suite�EZcomma�NZnew_N�targetZ suite_stmtsr ZstmtZassignZchildr r r r � transform/ s6
zFixExcept.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr/ r r r r r $ s r N)r! r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_urllib.cpython-36.pyc 0000644 00000013517 15053244155 0014672 0 ustar 00 3
\� � @ s� d Z ddlmZmZ ddlmZmZmZmZm Z m
Z
m Z dddddd d
d d gfd
ddddddddddddddd gfd d gfgdd d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5gfd d6d7gfgd8�Z e d9 j
e d: d; � d<d=� ZG d>d?� d?e�Zd@S )Az�Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
� )�
alternates�
FixImports)�Name�Comma�
FromImport�Newline�find_indentation�Node�symszurllib.requestZ URLopenerZFancyURLopenerZ urlretrieveZ
_urlopenerZurlopenZ
urlcleanupZ pathname2urlZ url2pathnamez urllib.parseZquoteZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ splitattrZ splithostZ
splitnportZ splitpasswdZ splitportZ
splitqueryZsplittagZ splittypeZ splituserZ
splitvaluez urllib.errorZContentTooShortErrorZinstall_openerZ build_openerZRequestZOpenerDirectorZ BaseHandlerZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZURLErrorZ HTTPError)�urllib�urllib2r r � c c s~ t � } xrtj� D ]f\}}x\|D ]T}|\}}t|�}d||f V d|||f V d| V d| V d||f V q W qW d S )Nz�import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
z�import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
zIimport_from< 'from' module_star=%r 'import' star='*' >
ztimport_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
zKpower< bare_with_attr=%r trailer< '.' member=%s > any* >
)�set�MAPPING�itemsr )ZbareZ
old_moduleZchanges�changeZ
new_module�members� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_urllib.py�
build_pattern0 s
r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) � FixUrllibc C s dj t� �S )N�|)�joinr )�selfr r r r I s zFixUrllib.build_patternc C sz |j d�}|j}g }x6t|j dd� D ] }|jt|d |d�t� g� q(W |jtt|j d d |d�� |j|� dS )z�Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
�moduleNr
r )�prefix���r ) �getr r �value�extendr r �append�replace)r �node�resultsZ
import_mod�pref�names�namer r r �transform_importL s
zFixUrllib.transform_importc C s> |j d�}|j}|j d�}|r�t|t�r0|d }d}x*t|j D ] }|j|d kr@|d }P q@W |rx|jt||d�� n | j|d� �n�g }i } |d }
x�|
D ]�}|j t
j kr�|j d j} |j d j} n
|j} d} | d
kr�xPt|j D ]B}| |d kr�|d | k�r|j
|d � | j|d g �j
|� q�W q�W g }
t|�}d }d d
� }x�|D ]�}| | }g }x2|dd� D ]"}|j|||�� |j
t� � �qlW |j||d |�� t||�}| �s�|jjj|��r�||_|
j
|� d}�qNW |
�r.g }x&|
dd� D ]}|j|t� g� �q�W |j
|
d � |j|� n | j|d� dS )z�Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
�
mod_member�memberr Nr
)r z!This is an invalid module elementr � �,Tc S sX | j tjkrHt| jd j|d�| jd j� | jd j� g}ttj|�gS t| j|d�gS )Nr )r r
r* )�typer
�import_as_namer �childrenr Zcloner )r& r Zkidsr r r � handle_name� s z/FixUrllib.transform_member.<locals>.handle_nameFz All module elements are invalidr r r r )r r �
isinstance�listr r r! r �cannot_convertr, r
r- r. r �
setdefaultr r r r �parent�endswithr )r r" r# r( r$ r) �new_namer �modulesZmod_dictr Zas_name� member_nameZ new_nodesZ indentation�firstr/ r Zeltsr% Zelt�newZnodesZnew_noder r r �transform_member\ sh
zFixUrllib.transform_memberc C s� |j d�}|j d�}d}t|t�r*|d }x*t|j D ] }|j|d kr6|d }P q6W |rp|jt||jd�� n | j|d� dS )z.Transform for calls to module members in code.�bare_with_attrr) Nr r
)r z!This is an invalid module element) r r0 r1 r r r! r r r2 )r r" r# Z
module_dotr) r6 r r r r �
transform_dot� s
zFixUrllib.transform_dotc C sz |j d�r| j||� n^|j d�r0| j||� nF|j d�rH| j||� n.|j d�r`| j|d� n|j d�rv| j|d� d S )Nr r( r< Z module_starzCannot handle star imports.Z module_asz#This module is now multiple modules)r r' r; r= r2 )r r" r# r r r � transform� s
zFixUrllib.transformN)�__name__�
__module__� __qualname__r r' r; r= r> r r r r r G s
Lr N)�__doc__Zlib2to3.fixes.fix_importsr r Zlib2to3.fixer_utilr r r r r r r
r r r r r r r r �<module> s@ $
fixes/__pycache__/fix_standarderror.cpython-36.pyc 0000644 00000001273 15053244155 0016247 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z%Fixer for StandardError -> Exception.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�FixStandarderrorTz-
'StandardError'
c C s t d|jd�S )N� Exception)�prefix)r r )�selfZnodeZresults� r �7/usr/lib64/python3.6/lib2to3/fixes/fix_standarderror.py� transform s zFixStandarderror.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_idioms.cpython-36.pyc 0000644 00000007452 15053244155 0014666 0 ustar 00 3
\ � @ sN d Z ddlmZ ddlmZmZmZmZmZm Z dZ
dZ G dd� dej �Z
dS ) a� Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
� )�
fixer_base)�Call�Comma�Name�Node� BlankLine�symsz0(n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)z(power< 'type' trailer< '(' x=any ')' > >c sP e Zd ZdZdeeeef Z� fdd�Zdd� Zdd� Z d d
� Z
d d � Z � Z S )
� FixIdiomsTa�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c s8 t t| �j|�}|r4d|kr4|d |d kr0|S d S |S )N�sortedZid1Zid2)�superr �match)�self�node�r)� __class__� �0/usr/lib64/python3.6/lib2to3/fixes/fix_idioms.pyr O s zFixIdioms.matchc C sH d|kr| j ||�S d|kr(| j||�S d|kr<| j||�S td��d S )N�
isinstance�whiler
z
Invalid match)�transform_isinstance�transform_while�transform_sort� RuntimeError)r
r �resultsr r r � transformZ s zFixIdioms.transformc C sh |d j � }|d j � }d|_d|_ttd�|t� |g�}d|kr\d|_ttjtd�|g�}|j|_|S )N�x�T� � r �n�not)�clone�prefixr r r r r Znot_test)r
r r r r Ztestr r r r d s z FixIdioms.transform_isinstancec C s |d }|j td|jd�� d S )Nr �True)r" )�replacer r" )r
r r Zoner r r r p s zFixIdioms.transform_whilec C s |d }|d }|j d�}|j d�}|r>|jtd|jd�� n8|rn|j� }d|_|jttd�|g|jd�� ntd��|j� |j}d |k�r|r�|jd �d
|d
jf} d j | �|d
_nH|j
s�t �|j d ks�t �t
� }
|j
j|
� |j |
ks�t �|jd �d
|
_d S ) N�sort�next�list�exprr
)r" r z should not have reached here�
� )�getr$ r r" r! r r �remove�
rpartition�join�parent�AssertionErrorZ next_siblingr Z append_child) r
r r Z sort_stmtZ next_stmtZ list_callZ simple_expr�newZbtwnZ prefix_linesZend_liner r r r t s0
zFixIdioms.transform_sort)
�__name__�
__module__� __qualname__Zexplicit�TYPE�CMPZPATTERNr r r r r �
__classcell__r r )r r r % s '
r N)�__doc__r r Z
fixer_utilr r r r r r r6 r5 ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_getcwdu.cpython-36.opt-2.pyc 0000644 00000001275 15053244155 0016001 0 ustar 00 3
\� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixGetcwduTzR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s |d }|j td|jd�� d S )N�name�getcwd)�prefix)�replacer r )�selfZnodeZresultsr � r
�1/usr/lib64/python3.6/lib2to3/fixes/fix_getcwdu.py� transform s zFixGetcwdu.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r
s r N)� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_xreadlines.cpython-36.opt-2.pyc 0000644 00000001707 15053244155 0016475 0 ustar 00 3
\� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixXreadlinesTz�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C s@ |j d�}|r$|jtd|jd�� n|jdd� |d D �� d S )N�no_call�__iter__)�prefixc S s g | ] }|j � �qS � )Zclone)�.0�xr r �4/usr/lib64/python3.6/lib2to3/fixes/fix_xreadlines.py�
<listcomp> s z+FixXreadlines.transform.<locals>.<listcomp>Zcall)�get�replacer r )�selfZnodeZresultsr r r r � transform s
zFixXreadlines.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_ws_comma.cpython-36.opt-2.pyc 0000644 00000001624 15053244155 0016142 0 ustar 00 3
\B � @ s: d dl mZ d dlmZ d dl mZ G dd� dej�ZdS )� )�pytree)�token)�
fixer_basec @ s@ e Zd ZdZdZejejd�Zejej d�Z ee fZ
dd� Z dS )�
FixWsCommaTzH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
�,�:c C sd |j � }d}xR|jD ]H}|| jkrD|j}|j� r>d|kr>d|_d}q|rX|j}|sXd|_d}qW |S )NF�
� T� )ZcloneZchildren�SEPS�prefix�isspace)�selfZnodeZresults�newZcommaZchildr � r �2/usr/lib64/python3.6/lib2to3/fixes/fix_ws_comma.py� transform s
zFixWsComma.transformN) �__name__�
__module__� __qualname__ZexplicitZPATTERNr ZLeafr �COMMA�COLONr r r r r r r s r N)r r Zpgen2r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_long.cpython-36.pyc 0000644 00000001254 15053244155 0014333 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z/Fixer that turns 'long' into 'int' everywhere.
� )�
fixer_base)�is_probably_builtinc @ s e Zd ZdZdZdd� ZdS )�FixLongTz'long'c C s t |�rd|_|j� d S )N�int)r �valueZchanged)�selfZnodeZresults� r �./usr/lib64/python3.6/lib2to3/fixes/fix_long.py� transform s zFixLong.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_reload.cpython-36.opt-2.pyc 0000644 00000002065 15053244155 0015603 0 ustar 00 3
\� � @ s2 d dl mZ d dlmZmZ G dd� dej�ZdS )� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReloadTZprez�
power< 'reload'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sd |rD|d }|rD|j | jjkr"d S |j | jjkrD|jd jdkrDd S d}t|||�}td d|� |S )N�obj� z**�imp�reload)r r )�typeZsymsZ star_exprZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_reload.py� transform s zFixReload.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_reduce.cpython-36.opt-1.pyc 0000644 00000002125 15053244155 0015600 0 ustar 00 3
\E � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zqFixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
� )�
fixer_base)� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReduceTZpreai
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t dd|� d S )N� functools�reduce)r )�selfZnodeZresults� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_reduce.py� transform" s zFixReduce.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr
r r r r r s r N)�__doc__Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_print.cpython-36.opt-1.pyc 0000644 00000004266 15053244155 0015475 0 ustar 00 3
\ � @ sl d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZm Z m
Z
m Z ej d�Z
G dd � d ej�Zd
S ) a Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
� )�patcomp)�pytree)�token)�
fixer_base)�Name�Call�Comma�Stringz"atom< '(' [atom|STRING|NAME] ')' >c @ s$ e Zd ZdZdZdd� Zdd� ZdS )�FixPrintTzP
simple_stmt< any* bare='print' any* > | print_stmt
c
C s` |j d�}|r,|jttd�g |jd�� d S |jdd � }t|�dkrXtj|d �rXd S d } }}|r�|d t � kr�|d d� }d}|r�|d t
j t j
d�kr�|d j� }|dd � }d d
� |D �}|r�d |d _|d k s�|d k s�|d k �rF|d k �r| j|d tt|��� |d k �r.| j|d
tt|��� |d k �rF| j|d|� ttd�|�} |j| _| S )NZbare�print)�prefix� � � z>>� c S s g | ] }|j � �qS � )�clone)�.0�argr r �//usr/lib64/python3.6/lib2to3/fixes/fix_print.py�
<listcomp>? s z&FixPrint.transform.<locals>.<listcomp>� �sep�end�file���r )�get�replacer r r Zchildren�len� parend_expr�matchr r �Leafr �
RIGHTSHIFTr � add_kwargr �repr)
�selfZnodeZresultsZ
bare_print�argsr r r Zl_argsZn_stmtr r r � transform% s8
zFixPrint.transformc C sN d|_ tj| jjt|�tjtjd�|f�}|r@|j t
� � d|_ |j |� d S )Nr �=r ) r r ZNodeZsymsZargumentr r! r �EQUAL�appendr )r% Zl_nodesZs_kwdZn_exprZ
n_argumentr r r r# M s
zFixPrint.add_kwargN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r# r r r r r
s (r
N)�__doc__r r r Zpgen2r r Z
fixer_utilr r r r Zcompile_patternr ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_raise.cpython-36.pyc 0000644 00000004264 15053244155 0014503 0 ustar 00 3
\n � @ sZ d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z G dd� dej �Z
dS ) a[ Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
� )�pytree)�token)�
fixer_base)�Name�Call�Attr�ArgList�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixRaiseTzB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c C sl | j }|d j� }|jtjkr2d}| j||� d S t|�rbx t|�rZ|jd jd j� }q<W d|_d|kr�t j
|j t d�|g�}|j|_|S |d j� }t|�r�dd � |jdd� D �}n d
|_|g}d |k�rF|d j� } d
| _|}
|jtj
kp�|jd k�rt||�}
t|
t d
��t| g�g } t j
|jt d�g| �}|j|_|S t j
|j t d�t||�g|jd�S d S )N�excz+Python 3 does not support string exceptions� � � �val�raisec S s g | ] }|j � �qS � )�clone)�.0�cr r �//usr/lib64/python3.6/lib2to3/fixes/fix_raise.py�
<listcomp>D s z&FixRaise.transform.<locals>.<listcomp>� �tb�None�with_traceback)�prefix���)�symsr �typer �STRINGZcannot_convertr Zchildrenr r ZNodeZ
raise_stmtr �NAME�valuer r r Z simple_stmt) �selfZnodeZresultsr r �msg�newr �argsr �eZwith_tbr r r � transform& s@
zFixRaise.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r r r r r
s r
N)�__doc__r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r r r r �<module> s
fixes/__pycache__/fix_filter.cpython-36.opt-2.pyc 0000644 00000003530 15053244155 0015620 0 ustar 00 3
\[
� @ sR d dl mZ d dlmZ d dlmZ d dlmZm Z m
Z
m Z G dd� dej �Z
dS )� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�ListComp�in_special_contextc @ s e Zd ZdZdZdZdd� ZdS )� FixFilterTaV
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
[extra_trailers=trailer*]
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.filterc C s2 | j |�rd S g }d|kr:x |d D ]}|j|j� � q$W d|kr�t|jd�j� |jd�j� |jd�j� |jd�j� �}ttj|g| dd�}n�d|kr�ttd �td �|d
j� td ��}ttj|g| dd�}nTt |�r�d S |d j� }ttjtd �|gdd�}ttjtd
�t
|g�g| �}d|_ |j |_ |S )NZextra_trailersZ
filter_lambda�fp�itZxp� )�prefixZnoneZ_f�seq�args�filter�list) Z should_skip�appendZcloner �getr �symsZpowerr r r r
)�selfZnodeZresultsZtrailers�t�newr � r �0/usr/lib64/python3.6/lib2to3/fixes/fix_filter.py� transform: s4
zFixFilter.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r s r N)r r Zpytreer Zpygramr r Z
fixer_utilr r r r ZConditionalFixr r r r r �<module> s fixes/__pycache__/fix_apply.cpython-36.opt-1.pyc 0000644 00000003163 15053244155 0015461 0 ustar 00 3
\~ � @ sR d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z G dd� dej
�Z dS ) zIFixer for apply().
This converts apply(func, v, k) into (func)(*v, **k).� )�pytree)�token)�
fixer_base)�Call�Comma� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixApplyTa.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C s> | j }|d }|d }|jd�}|rX|j| j jkr6d S |j| j jkrX|jd jdkrXd S |r~|j| j jkr~|jd jdkr~d S |j}|j� }|jt j
|j fkr�|j|j ks�|jd jt j
kr�t|�}d|_|j� }d|_|d k r�|j� }d|_tjt jd�|g}|d k �r0|jt� tjt j
d�|g� d |d _t|||d
�S )
N�func�args�kwds� z**r � �*� )�prefix���r )�syms�get�typeZ star_exprZargumentZchildren�valuer Zcloner �NAMEZatomZpower�
DOUBLESTARr r ZLeaf�STAR�extendr r ) �selfZnodeZresultsr r r
r r Z l_newargs� r �//usr/lib64/python3.6/lib2to3/fixes/fix_apply.py� transform s@
zFixApply.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) �__doc__r
r Zpgen2r r Z
fixer_utilr r r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_intern.cpython-36.pyc 0000644 00000002165 15053244155 0014675 0 ustar 00 3
\� � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )z/Fixer for intern().
intern(s) -> sys.intern(s)� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixInternTZprez�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sd |rD|d }|rD|j | jjkr"d S |j | jjkrD|jd jdkrDd S d}t|||�}td d|� |S )N�obj� z**�sys�intern)r r )�typeZsymsZ star_exprZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_intern.py� transform s zFixIntern.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)�__doc__� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_input.cpython-36.opt-1.pyc 0000644 00000001641 15053244155 0015472 0 ustar 00 3
\� � @ sL d Z ddlmZ ddlmZmZ ddlmZ ejd�ZG dd� dej �Z
dS ) z4Fixer that changes input(...) into eval(input(...)).� )�
fixer_base)�Call�Name)�patcompz&power< 'eval' trailer< '(' any ')' > >c @ s e Zd ZdZdZdd� ZdS )�FixInputTzL
power< 'input' args=trailer< '(' [any] ')' > >
c C s6 t j|jj�rd S |j� }d|_ttd�|g|jd�S )N� �eval)�prefix)�context�match�parentZcloner r r )�selfZnodeZresults�new� r �//usr/lib64/python3.6/lib2to3/fixes/fix_input.py� transform s
zFixInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r N) �__doc__r r Z
fixer_utilr r r Zcompile_patternr
ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_print.cpython-36.opt-2.pyc 0000644 00000003627 15053244155 0015476 0 ustar 00 3
\ � @ sh d dl mZ d dl mZ d dlmZ d dl mZ d dlmZmZm Z m
Z
ej d�Z G dd� dej
�Zd S )
� )�patcomp)�pytree)�token)�
fixer_base)�Name�Call�Comma�Stringz"atom< '(' [atom|STRING|NAME] ')' >c @ s$ e Zd ZdZdZdd� Zdd� ZdS )�FixPrintTzP
simple_stmt< any* bare='print' any* > | print_stmt
c
C s` |j d�}|r,|jttd�g |jd�� d S |jdd � }t|�dkrXtj|d �rXd S d } }}|r�|d t � kr�|d d� }d}|r�|d t
j t j
d�kr�|d j� }|dd � }d d
� |D �}|r�d |d _|d k s�|d k s�|d k �rF|d k �r| j|d tt|��� |d k �r.| j|d
tt|��� |d k �rF| j|d|� ttd�|�} |j| _| S )NZbare�print)�prefix� � � z>>� c S s g | ] }|j � �qS � )�clone)�.0�argr r �//usr/lib64/python3.6/lib2to3/fixes/fix_print.py�
<listcomp>? s z&FixPrint.transform.<locals>.<listcomp>� �sep�end�file���r )�get�replacer r r Zchildren�len� parend_expr�matchr r �Leafr �
RIGHTSHIFTr � add_kwargr �repr)
�selfZnodeZresultsZ
bare_print�argsr r r Zl_argsZn_stmtr r r � transform% s8
zFixPrint.transformc C sN d|_ tj| jjt|�tjtjd�|f�}|r@|j t
� � d|_ |j |� d S )Nr �=r ) r r ZNodeZsymsZargumentr r! r �EQUAL�appendr )r% Zl_nodesZs_kwdZn_exprZ
n_argumentr r r r# M s
zFixPrint.add_kwargN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r# r r r r r
s (r
N)r r r Zpgen2r r Z
fixer_utilr r r r Zcompile_patternr ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_nonzero.cpython-36.opt-1.pyc 0000644 00000001606 15053244155 0016026 0 ustar 00 3
\O � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z*Fixer for __nonzero__ -> __bool__ methods.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixNonzeroTz�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s$ |d }t d|jd�}|j|� d S )N�name�__bool__)�prefix)r r �replace)�selfZnodeZresultsr �new� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_nonzero.py� transform s zFixNonzero.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_basestring.cpython-36.opt-1.pyc 0000644 00000001202 15053244155 0016465 0 ustar 00 3
\@ � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z Fixer for basestring -> str.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixBasestringTz 'basestring'c C s t d|jd�S )N�str)�prefix)r r )�selfZnodeZresults� r �4/usr/lib64/python3.6/lib2to3/fixes/fix_basestring.py� transform
s zFixBasestring.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_print.cpython-36.pyc 0000644 00000004405 15053244155 0014531 0 ustar 00 3
\ � @ sl d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZm Z m
Z
m Z ej d�Z
G dd � d ej�Zd
S ) a Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
� )�patcomp)�pytree)�token)�
fixer_base)�Name�Call�Comma�Stringz"atom< '(' [atom|STRING|NAME] ')' >c @ s$ e Zd ZdZdZdd� Zdd� ZdS )�FixPrintTzP
simple_stmt< any* bare='print' any* > | print_stmt
c
C s� |st �|jd�}|r4|jttd�g |jd�� d S |jd td�ksJt �|jdd � }t|�dkrvtj |d �rvd S d } }}|r�|d t
� kr�|d d� }d}|r�|d t j t
jd�kr�t|�dks�t �|d j� }|d d � }d
d � |D �}|�rd |d _|d k �s"|d k �s"|d k �rz|d k �rB| j|d
tt|��� |d k �rb| j|dtt|��� |d k �rz| j|d|� ttd�|�} |j| _| S )NZbare�print)�prefix� � � z>>r � c S s g | ] }|j � �qS � )�clone)�.0�argr r �//usr/lib64/python3.6/lib2to3/fixes/fix_print.py�
<listcomp>? s z&FixPrint.transform.<locals>.<listcomp>� �sep�end�file���r )�AssertionError�get�replacer r r Zchildren�len� parend_expr�matchr r �Leafr �
RIGHTSHIFTr � add_kwargr �repr)
�selfZnodeZresultsZ
bare_print�argsr r r Zl_argsZn_stmtr r r � transform% s>
zFixPrint.transformc C sN d|_ tj| jjt|�tjtjd�|f�}|r@|j t
� � d|_ |j |� d S )Nr �=r ) r r ZNodeZsymsZargumentr r" r �EQUAL�appendr )r& Zl_nodesZs_kwdZn_exprZ
n_argumentr r r r$ M s
zFixPrint.add_kwargN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr( r$ r r r r r
s (r
N)�__doc__r r r Zpgen2r r Z
fixer_utilr r r r Zcompile_patternr ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_asserts.cpython-36.opt-1.pyc 0000644 00000002344 15053244155 0016020 0 ustar 00 3
\� � @ sT d Z ddlmZ ddlmZ edddddd d
dddddd d d
�ZG dd� de�ZdS )z5Fixer that replaces deprecated unittest method names.� )�BaseFix)�NameZ
assertTrueZ assertEqualZassertNotEqualZassertAlmostEqualZassertNotAlmostEqualZ assertRegexZassertRaisesRegexZ assertRaisesZ assertFalse)Zassert_Z assertEqualsZassertNotEqualsZassertAlmostEqualsZassertNotAlmostEqualsZassertRegexpMatchesZassertRaisesRegexpZfailUnlessEqualZ failIfEqualZfailUnlessAlmostEqualZfailIfAlmostEqualZ
failUnlessZfailUnlessRaisesZfailIfc @ s( e Zd Zddjeee�� Zdd� ZdS )�
FixAssertszH
power< any+ trailer< '.' meth=(%s)> any* >
�|c C s, |d d }|j ttt|� |jd�� d S )N�meth� )�prefix)�replacer �NAMES�strr )�selfZnodeZresults�name� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_asserts.py� transform s zFixAsserts.transformN) �__name__�
__module__� __qualname__�join�map�reprr
ZPATTERNr r r r r r s r N)�__doc__Z
fixer_baser Z
fixer_utilr �dictr
r r r r r �<module> s$ fixes/__pycache__/fix_metaclass.cpython-36.pyc 0000644 00000012353 15053244155 0015352 0 ustar 00 3
\ � @ sv d Z ddlmZ ddlmZ ddlmZmZmZ dd� Z dd� Z
d d
� Z d d � Z d
d� Z
dd� ZG dd� dej�ZdS )a� Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherints
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
� )�
fixer_base)�token)�syms�Node�Leafc C sx xr| j D ]h}|jtjkr t|�S |jtjkr|j r|j d }|jtjkr|j r|j d }t|t�r|j dkrdS qW dS )z� we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
� �
__metaclass__TF)
�children�typer �suite�
has_metaclass� simple_stmt� expr_stmt�
isinstancer �value)�parent�node� expr_nodeZ left_side� r �3/usr/lib64/python3.6/lib2to3/fixes/fix_metaclass.pyr s
r c C s� x | j D ]}|jtjkrdS qW x,t| j �D ]\}}|jtjkr,P q,W td��ttjg �}x:| j |d d� r�| j |d }|j |j
� � |j � q\W | j |� |}dS )zf one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
NzNo class suite and no ':'!� ) r r
r r � enumerater �COLON�
ValueErrorr � append_child�clone�remove)�cls_noder �ir � move_noder r r �fixup_parse_tree- s
r c
C s� x(t |j�D ]\}}|jtjkr P q W dS |j� ttjg �}ttj |g�}x2|j|d� r~|j| }|j
|j � � |j� qNW | j ||� |jd jd }|jd jd } | j
|_
dS )z� if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
Nr )r r r
r �SEMIr r r r r
r r � insert_child�prefix)
r r Z stmt_nodeZsemi_indr Znew_exprZnew_stmtr Z new_leaf1Z old_leaf1r r r �fixup_simple_stmtG s
r$ c C s* | j r&| j d jtjkr&| j d j� d S )Nr ���r% )r r
r �NEWLINEr )r r r r �remove_trailing_newline_ s r' c c s� x$| j D ]}|jtjkrP qW td��x�tt|j ��D ]t\}}|jtjkr6|j r6|j d }|jtjkr6|j r6|j d }t |t
�r6|j dkr6t |||� t
|� |||fV q6W d S )NzNo class suite!r r )r r
r r r �listr r
r r r r r$ r' )r r r Z simple_noder Z left_noder r r �
find_metasd s
r) c C s� | j ddd� }x |r.|j� }|jtjkrP qW xL|r||j� }t|t�rd|jtjkrd|jr`d|_dS |j |j ddd� � q2W dS )z� If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
Nr � r% r% )
r �popr
r �INDENTr r �DEDENTr# �extend)r Zkidsr r r r � fixup_indent{ s r/ c @ s e Zd ZdZdZdd� ZdS )� FixMetaclassTz
classdef<any*>
c C sN t |�s d S t|� d }x"t|�D ]\}}}|}|j� q"W |jd j}t|j�dkr�|jd jtjkrt|jd }n(|jd j � } t
tj| g�}|j d|� n�t|j�dkr�t
tjg �}|j d|� nZt|j�dk�rt
tjg �}|j dt
tjd�� |j d|� |j dt
tjd�� ntd ��|jd jd }
d
|
_|
j} |j�r^|jt
tjd �� d |
_nd
|
_|jd } | jtjk�s�t�d
| jd _d
| jd _|j|� t|� |j�s�|j� t
|d�}
| |
_|j|
� |jt
tjd�� nbt|j�dk�rJ|jd jtjk�rJ|jd jtjk�rJt
|d�}
|j d|
� |j dt
tjd�� d S )Nr � � � � r �)�(zUnexpected class definition� metaclass�,� r* r �pass�
���r% r% r% ) r r r) r r r
�lenr �arglistr r Z set_childr" r r �RPAR�LPARr r r# r �COMMAr �AssertionErrorr/ r& r, r- )�selfr ZresultsZlast_metaclassr r ZstmtZ text_typer> r Zmeta_txtZorig_meta_prefixr Z pass_leafr r r � transform� s`
zFixMetaclass.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNrD r r r r r0 � s r0 N)�__doc__r* r Zpygramr Z
fixer_utilr r r r r r$ r' r) r/ ZBaseFixr0 r r r r �<module> s fixes/__pycache__/fix_throw.cpython-36.pyc 0000644 00000003365 15053244155 0014544 0 ustar 00 3
\. � @ sZ d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z G dd� dej �Z
dS ) z�Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions.� )�pytree)�token)�
fixer_base)�Name�Call�ArgList�Attr�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixThrowTz�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C s� | j }|d j� }|jtjkr.| j|d� d S |jd�}|d krDd S |j� }t|�rndd� |jdd � D �}n d|_ |g}|d }d |kr�|d j� }d|_ t
||�} t | t d
��t
|g�g }
|jtj|j|
�� n|jt
||�� d S ) N�excz+Python 3 does not support string exceptions�valc S s g | ] }|j � �qS � )�clone)�.0�cr
r
�//usr/lib64/python3.6/lib2to3/fixes/fix_throw.py�
<listcomp>) s z&FixThrow.transform.<locals>.<listcomp>� � �args�tb�with_traceback���)�symsr �typer �STRINGZcannot_convert�getr Zchildren�prefixr r r r �replacer ZNodeZpower) �selfZnodeZresultsr r r r Z
throw_argsr �eZwith_tbr
r
r � transform s*
zFixThrow.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr! r
r
r
r r
s r
N)�__doc__r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r
r
r
r �<module> s
fixes/__pycache__/fix_dict.cpython-36.opt-1.pyc 0000644 00000006232 15053244155 0015257 0 ustar 00 3
\� � @ sj d Z ddlmZ ddlmZ ddlmZ ddlmZmZmZ ddlmZ ej dhB Z
G dd � d ej �Z d
S ) aj Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
� )�pytree)�patcomp)�
fixer_base)�Name�Call�Dot)�
fixer_util�iterc @ s@ e Zd ZdZdZdd� ZdZeje�Z dZ
eje
�Z dd� Z d S )
�FixDictTa
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c
C s |d }|d d }|d }| j }|j}|jd�}|jd�} |sD| rP|dd � }dd � |D �}d
d � |D �}| o|| j||�}
|tj|jt� t||j d �g�|d j
� g } tj|j | �} |
p�| s�d
| _ t t|r�dnd�| g�} |r�tj|j | g| �} |j | _ | S )N�head�method� �tailr Zview� c S s g | ] }|j � �qS � )�clone)�.0�nr r �./usr/lib64/python3.6/lib2to3/fixes/fix_dict.py�
<listcomp>A s z%FixDict.transform.<locals>.<listcomp>c S s g | ] }|j � �qS r )r )r r r r r r B s )�prefixZparens� �list)
�syms�value�
startswith�in_special_contextr ZNodeZtrailerr r r r Zpowerr )
�self�node�resultsr r r r Z method_name�isiterZisviewZspecial�args�newr r r � transform6 s2
zFixDict.transformz3power< func=NAME trailer< '(' node=any ')' > any* >zmfor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� |j d krdS i }|j j d k r^| jj|j j |�r^|d |kr^|rN|d jtkS |d jtjkS |sfdS | jj|j |�o�|d |kS )NFr �func)�parent�p1�matchr � iter_exemptr �consuming_calls�p2)r r r r r r r r Z s
zFixDict.in_special_contextN)
�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr# ZP1r Zcompile_patternr& ZP2r* r r r r r r
) s
r
N)
�__doc__r r r r r r r r r) r( ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_isinstance.cpython-36.opt-1.pyc 0000644 00000003003 15053244155 0016465 0 ustar 00 3
\H � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )a, Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
� )�
fixer_base)�tokenc @ s e Zd ZdZdZdZdd� ZdS )�
FixIsinstanceTz�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
� c C s� t � }|d }|j}g }t|�}xx|D ]p\}} | jtjkrt| j|krt|t|�d k r�||d jtjkr�t |� q&q&|j
| � | jtjkr&|j | j� q&W |r�|d jtjkr�|d= t|�dkr�|j }
|
j
|d _
|
j|d � n||d d �< |j� d S )N�args� � ���r )�setZchildren� enumerate�typer �NAME�value�len�COMMA�next�append�add�parent�prefix�replaceZchanged) �selfZnodeZresultsZnames_insertedZtestlistr Znew_args�iterator�idx�argZatom� r �4/usr/lib64/python3.6/lib2to3/fixes/fix_isinstance.py� transform s* $
zFixIsinstance.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module>
s fixes/__pycache__/fix_getcwdu.cpython-36.opt-1.pyc 0000644 00000001377 15053244155 0016003 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z1
Fixer that changes os.getcwdu() to os.getcwd().
� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixGetcwduTzR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s |d }|j td|jd�� d S )N�name�getcwd)�prefix)�replacer r )�selfZnodeZresultsr � r
�1/usr/lib64/python3.6/lib2to3/fixes/fix_getcwdu.py� transform s zFixGetcwdu.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r
s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_metaclass.cpython-36.opt-2.pyc 0000644 00000007535 15053244155 0016320 0 ustar 00 3
\ � @ sr d dl mZ d dlmZ d dlmZmZmZ dd� Zdd� Z dd � Z
d
d � Z d d
� Z dd� Z
G dd� dej�ZdS )� )�
fixer_base)�token)�syms�Node�Leafc C sx xr| j D ]h}|jtjkr t|�S |jtjkr|j r|j d }|jtjkr|j r|j d }t|t�r|j dkrdS qW dS )N� �
__metaclass__TF)
�children�typer �suite�
has_metaclass� simple_stmt� expr_stmt�
isinstancer �value)�parent�node� expr_nodeZ left_side� r �3/usr/lib64/python3.6/lib2to3/fixes/fix_metaclass.pyr s
r c C s� x | j D ]}|jtjkrd S qW x,t| j �D ]\}}|jtjkr,P q,W td��ttjg �}x:| j |d d � r�| j |d }|j |j
� � |j � q\W | j |� |}d S )NzNo class suite and no ':'!� ) r r
r r � enumerater �COLON�
ValueErrorr � append_child�clone�remove)�cls_noder �ir � move_noder r r �fixup_parse_tree- s
r c
C s� x(t |j�D ]\}}|jtjkr P q W d S |j� ttjg �}ttj |g�}x2|j|d � r~|j| }|j
|j � � |j� qNW | j ||� |jd jd }|jd jd } | j
|_
d S )Nr )r r r
r �SEMIr r r r r
r r � insert_child�prefix)
r r Z stmt_nodeZsemi_indr Znew_exprZnew_stmtr Z new_leaf1Z old_leaf1r r r �fixup_simple_stmtG s
r$ c C s* | j r&| j d jtjkr&| j d j� d S )Nr ���r% )r r
r �NEWLINEr )r r r r �remove_trailing_newline_ s r' c c s� x$| j D ]}|jtjkrP qW td��x�tt|j ��D ]t\}}|jtjkr6|j r6|j d }|jtjkr6|j r6|j d }t |t
�r6|j dkr6t |||� t
|� |||fV q6W d S )NzNo class suite!r r )r r
r r r �listr r
r r r r r$ r' )r r r Z simple_noder Z left_noder r r �
find_metasd s
r) c C s� | j d d d� }x |r.|j� }|jtjkrP qW xL|r||j� }t|t�rd|jtjkrd|jr`d|_d S |j |j d d d� � q2W d S )Nr � r% r% )
r �popr
r �INDENTr r �DEDENTr# �extend)r Zkidsr r r r � fixup_indent{ s r/ c @ s e Zd ZdZdZdd� ZdS )� FixMetaclassTz
classdef<any*>
c C s< t |�s d S t|� d }x"t|�D ]\}}}|}|j� q"W |jd j}t|j�dkr�|jd jtjkrt|jd }n(|jd j � } t
tj| g�}|j d|� n�t|j�dkr�t
tjg �}|j d|� nZt|j�dk�rt
tjg �}|j dt
tjd�� |j d|� |j dt
tjd�� ntd ��|jd jd }
d
|
_|
j} |j�r^|jt
tjd �� d |
_nd
|
_|jd } d
| jd _d
| jd _|j|� t|� |j�s�|j� t
|d�}
| |
_|j|
� |jt
tjd�� nbt|j�dk�r8|jd jtjk�r8|jd jtjk�r8t
|d�}
|j d|
� |j dt
tjd�� d S )Nr � � � � r �)�(zUnexpected class definition� metaclass�,� r* r �pass�
���r% r% r% )r r r) r r r
�lenr �arglistr r Z set_childr" r r �RPAR�LPARr r r# r �COMMAr/ r& r, r- )�selfr ZresultsZlast_metaclassr r ZstmtZ text_typer> r Zmeta_txtZorig_meta_prefixr Z pass_leafr r r � transform� s^
zFixMetaclass.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNrC r r r r r0 � s r0 N)r* r Zpygramr Z
fixer_utilr r r r r r$ r' r) r/ ZBaseFixr0 r r r r �<module> s fixes/__pycache__/fix_nonzero.cpython-36.opt-2.pyc 0000644 00000001513 15053244155 0016024 0 ustar 00 3
\O � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixNonzeroTz�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s$ |d }t d|jd�}|j|� d S )N�name�__bool__)�prefix)r r �replace)�selfZnodeZresultsr �new� r �1/usr/lib64/python3.6/lib2to3/fixes/fix_nonzero.py� transform s zFixNonzero.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_exitfunc.cpython-36.opt-1.pyc 0000644 00000004343 15053244155 0016162 0 ustar 00 3
\� � @ sJ d Z ddlmZmZ ddlmZmZmZmZm Z m
Z
G dd� dej �Z dS )z7
Convert use of sys.exitfunc to use the atexit module.
� )�pytree�
fixer_base)�Name�Attr�Call�Comma�Newline�symsc s< e Zd ZdZdZdZ� fdd�Z� fdd�Zdd� Z� Z S ) � FixExitfuncTa�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c s t t| �j|� d S )N)�superr
�__init__)�self�args)� __class__� �2/usr/lib64/python3.6/lib2to3/fixes/fix_exitfunc.pyr s zFixExitfunc.__init__c s t t| �j||� d | _d S )N)r r
�
start_tree�
sys_import)r
Ztree�filename)r r r r ! s zFixExitfunc.start_treec C s& d|kr | j d kr |d | _ d S |d j� }d|_tjtjttd�td���}t ||g|j�}|j
|� | j d kr�| j |d� d S | j j d }|j
tjkr�|jt� � |jtdd�� nj| j j}|j j| j �}|j} tjtjtd �tdd�g�}
tjtj|
g�} |j|d t� � |j|d
| � d S ) Nr �func� �atexit�registerzKCan't find sys import; Please add an atexit import at the top of your file.� � �import� )r Zclone�prefixr ZNoder Zpowerr r r �replaceZwarningZchildren�typeZdotted_as_namesZ append_childr �parent�indexZ import_nameZ simple_stmtZ insert_childr ) r
ZnodeZresultsr r Zcall�namesZcontaining_stmtZpositionZstmt_containerZ
new_import�newr r r � transform% s2
zFixExitfunc.transform)
�__name__�
__module__� __qualname__Zkeep_line_orderZ
BM_compatibleZPATTERNr r r$ �
__classcell__r r )r r r
s r
N)
�__doc__Zlib2to3r r Zlib2to3.fixer_utilr r r r r r ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_getcwdu.cpython-36.pyc 0000644 00000001377 15053244155 0015044 0 ustar 00 3
\� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z1
Fixer that changes os.getcwdu() to os.getcwd().
� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixGetcwduTzR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s |d }|j td|jd�� d S )N�name�getcwd)�prefix)�replacer r )�selfZnodeZresultsr � r
�1/usr/lib64/python3.6/lib2to3/fixes/fix_getcwdu.py� transform s zFixGetcwdu.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r
s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_except.cpython-36.opt-1.pyc 0000644 00000005355 15053244155 0015631 0 ustar 00 3
\
� @ sf d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z m Z dd� Z
G dd � d ej�Zd
S ) a� Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
� )�pytree)�token)�
fixer_base)�Assign�Attr�Name�is_tuple�is_list�symsc c sH xBt | �D ]6\}}|jtjkr
|jd jdkr
|| |d fV q
W d S )N� �exceptr )� enumerate�typer
�
except_clause�children�value)Znodes�i�n� r �0/usr/lib64/python3.6/lib2to3/fixes/fix_except.py� find_excepts s r c @ s e Zd ZdZdZdd� ZdS )� FixExceptTa1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C s� | j }dd� |d D �}dd� |d D �}�x*t|�D �] \}}t|j�dkr6|jdd� \}} }
| jtdd d
�� |
jtjk�rDt| j � d d
�} |
j
� } d | _ |
j| � | j
� } |j}
x"t |
�D ]\}}t
|tj�r�P q�W t|
�s�t|
��rt| t| td ���}n
t| | �}x&t|
d |� �D ]}|jd
|� �q W |j||� q6|
j d kr6d |
_ q6W dd� |jd d� D �| | }tj|j|�S )Nc S s g | ] }|j � �qS r )�clone)�.0r r r r �
<listcomp>2 s z'FixExcept.transform.<locals>.<listcomp>�tailc S s g | ] }|j � �qS r )r )r Zchr r r r 4 s Zcleanup� � �as� )�prefix� �argsr c S s g | ] }|j � �qS r )r )r �cr r r r \ s � )r
r �lenr �replacer r r �NAME�new_namer r r
�
isinstancer ZNoder r r r �reversedZ insert_child)�selfZnodeZresultsr
r Z try_cleanupr Ze_suite�EZcomma�NZnew_N�targetZ suite_stmtsr ZstmtZassignZchildr r r r � transform/ s6
zFixExcept.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr/ r r r r r $ s r N)�__doc__r! r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r r r r �<module> s fixes/fix_getcwdu.py 0000644 00000000703 15053244155 0010550 0 ustar 00 """
Fixer that changes os.getcwdu() to os.getcwd().
"""
# Author: Victor Stinner
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixGetcwdu(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< 'os' trailer< dot='.' name='getcwdu' > any* >
"""
def transform(self, node, results):
name = results["name"]
name.replace(Name("getcwd", prefix=name.prefix))
fixes/fix_throw.py 0000644 00000003056 15053244155 0010255 0 ustar 00 """Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions."""
# Author: Collin Winter
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, Call, ArgList, Attr, is_tuple
class FixThrow(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
"""
def transform(self, node, results):
syms = self.syms
exc = results["exc"].clone()
if exc.type is token.STRING:
self.cannot_convert(node, "Python 3 does not support string exceptions")
return
# Leave "g.throw(E)" alone
val = results.get("val")
if val is None:
return
val = val.clone()
if is_tuple(val):
args = [c.clone() for c in val.children[1:-1]]
else:
val.prefix = ""
args = [val]
throw_args = results["args"]
if "tb" in results:
tb = results["tb"].clone()
tb.prefix = ""
e = Call(exc, args)
with_tb = Attr(e, Name('with_traceback')) + [ArgList([tb])]
throw_args.replace(pytree.Node(syms.power, with_tb))
else:
throw_args.replace(Call(exc, args))
fixes/fix_execfile.py 0000644 00000004000 15053244155 0010664 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
"""
from .. import fixer_base
from ..fixer_util import (Comma, Name, Call, LParen, RParen, Dot, Node,
ArgList, String, syms)
class FixExecfile(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
"""
def transform(self, node, results):
assert results
filename = results["filename"]
globals = results.get("globals")
locals = results.get("locals")
# Copy over the prefix from the right parentheses end of the execfile
# call.
execfile_paren = node.children[-1].children[-1].clone()
# Construct open().read().
open_args = ArgList([filename.clone(), Comma(), String('"rb"', ' ')],
rparen=execfile_paren)
open_call = Node(syms.power, [Name("open"), open_args])
read = [Node(syms.trailer, [Dot(), Name('read')]),
Node(syms.trailer, [LParen(), RParen()])]
open_expr = [open_call] + read
# Wrap the open call in a compile call. This is so the filename will be
# preserved in the execed code.
filename_arg = filename.clone()
filename_arg.prefix = " "
exec_str = String("'exec'", " ")
compile_args = open_expr + [Comma(), filename_arg, Comma(), exec_str]
compile_call = Call(Name("compile"), compile_args, "")
# Finally, replace the execfile call with an exec call.
args = [compile_call]
if globals is not None:
args.extend([Comma(), globals.clone()])
if locals is not None:
args.extend([Comma(), locals.clone()])
return Call(Name("exec"), args, prefix=node.prefix)
fixes/fix_intern.py 0000644 00000002323 15053244155 0010405 0 ustar 00 # Copyright 2006 Georg Brandl.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for intern().
intern(s) -> sys.intern(s)"""
# Local imports
from .. import fixer_base
from ..fixer_util import ImportAndCall, touch_import
class FixIntern(fixer_base.BaseFix):
BM_compatible = True
order = "pre"
PATTERN = """
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
"""
def transform(self, node, results):
if results:
# I feel like we should be able to express this logic in the
# PATTERN above but I don't know how to do it so...
obj = results['obj']
if obj:
if obj.type == self.syms.star_expr:
return # Make no change.
if (obj.type == self.syms.argument and
obj.children[0].value == '**'):
return # Make no change.
names = ('sys', 'intern')
new = ImportAndCall(node, results, names)
touch_import(None, 'sys', node)
return new
fixes/fix_xreadlines.py 0000644 00000001261 15053244155 0011244 0 ustar 00 """Fix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__)."""
# Author: Collin Winter
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixXreadlines(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
"""
def transform(self, node, results):
no_call = results.get("no_call")
if no_call:
no_call.replace(Name("__iter__", prefix=no_call.prefix))
else:
node.replace([x.clone() for x in results["call"]])
fixes/fix_input.py 0000644 00000001304 15053244155 0010243 0 ustar 00 """Fixer that changes input(...) into eval(input(...))."""
# Author: Andre Roberge
# Local imports
from .. import fixer_base
from ..fixer_util import Call, Name
from .. import patcomp
context = patcomp.compile_pattern("power< 'eval' trailer< '(' any ')' > >")
class FixInput(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< 'input' args=trailer< '(' [any] ')' > >
"""
def transform(self, node, results):
# If we're already wrapped in an eval() call, we're done.
if context.match(node.parent.parent):
return
new = node.clone()
new.prefix = ""
return Call(Name("eval"), [new], prefix=node.prefix)
fixes/fix_basestring.py 0000644 00000000500 15053244155 0011242 0 ustar 00 """Fixer for basestring -> str."""
# Author: Christian Heimes
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixBasestring(fixer_base.BaseFix):
BM_compatible = True
PATTERN = "'basestring'"
def transform(self, node, results):
return Name("str", prefix=node.prefix)
fixes/fix_dict.py 0000644 00000007260 15053244155 0010036 0 ustar 00 # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
"""
# Local imports
from .. import pytree
from .. import patcomp
from .. import fixer_base
from ..fixer_util import Name, Call, Dot
from .. import fixer_util
iter_exempt = fixer_util.consuming_calls | {"iter"}
class FixDict(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
"""
def transform(self, node, results):
head = results["head"]
method = results["method"][0] # Extract node for method name
tail = results["tail"]
syms = self.syms
method_name = method.value
isiter = method_name.startswith("iter")
isview = method_name.startswith("view")
if isiter or isview:
method_name = method_name[4:]
assert method_name in ("keys", "items", "values"), repr(method)
head = [n.clone() for n in head]
tail = [n.clone() for n in tail]
special = not tail and self.in_special_context(node, isiter)
args = head + [pytree.Node(syms.trailer,
[Dot(),
Name(method_name,
prefix=method.prefix)]),
results["parens"].clone()]
new = pytree.Node(syms.power, args)
if not (special or isview):
new.prefix = ""
new = Call(Name("iter" if isiter else "list"), [new])
if tail:
new = pytree.Node(syms.power, [new] + tail)
new.prefix = node.prefix
return new
P1 = "power< func=NAME trailer< '(' node=any ')' > any* >"
p1 = patcomp.compile_pattern(P1)
P2 = """for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
"""
p2 = patcomp.compile_pattern(P2)
def in_special_context(self, node, isiter):
if node.parent is None:
return False
results = {}
if (node.parent.parent is not None and
self.p1.match(node.parent.parent, results) and
results["node"] is node):
if isiter:
# iter(d.iterkeys()) -> iter(d.keys()), etc.
return results["func"].value in iter_exempt
else:
# list(d.keys()) -> list(d.keys()), etc.
return results["func"].value in fixer_util.consuming_calls
if not isiter:
return False
# for ... in d.iterkeys() -> for ... in d.keys(), etc.
return self.p2.match(node.parent, results) and results["node"] is node
fixes/fix_xrange.py 0000644 00000005206 15053244155 0010375 0 ustar 00 # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that changes xrange(...) into range(...)."""
# Local imports
from .. import fixer_base
from ..fixer_util import Name, Call, consuming_calls
from .. import patcomp
class FixXrange(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
"""
def start_tree(self, tree, filename):
super(FixXrange, self).start_tree(tree, filename)
self.transformed_xranges = set()
def finish_tree(self, tree, filename):
self.transformed_xranges = None
def transform(self, node, results):
name = results["name"]
if name.value == "xrange":
return self.transform_xrange(node, results)
elif name.value == "range":
return self.transform_range(node, results)
else:
raise ValueError(repr(name))
def transform_xrange(self, node, results):
name = results["name"]
name.replace(Name("range", prefix=name.prefix))
# This prevents the new range call from being wrapped in a list later.
self.transformed_xranges.add(id(node))
def transform_range(self, node, results):
if (id(node) not in self.transformed_xranges and
not self.in_special_context(node)):
range_call = Call(Name("range"), [results["args"].clone()])
# Encase the range call in list().
list_call = Call(Name("list"), [range_call],
prefix=node.prefix)
# Put things that were after the range() call after the list call.
for n in results["rest"]:
list_call.append_child(n)
return list_call
P1 = "power< func=NAME trailer< '(' node=any ')' > any* >"
p1 = patcomp.compile_pattern(P1)
P2 = """for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
"""
p2 = patcomp.compile_pattern(P2)
def in_special_context(self, node):
if node.parent is None:
return False
results = {}
if (node.parent.parent is not None and
self.p1.match(node.parent.parent, results) and
results["node"] is node):
# list(d.keys()) -> list(d.keys()), etc.
return results["func"].value in consuming_calls
# for ... in d.iterkeys() -> for ... in d.keys(), etc.
return self.p2.match(node.parent, results) and results["node"] is node
fixes/__init__.py 0000644 00000000057 15053244155 0010001 0 ustar 00 # Dummy file to make this directory a package.
fixes/fix_exec.py 0000644 00000001723 15053244155 0010035 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
"""
# Local imports
from .. import fixer_base
from ..fixer_util import Comma, Name, Call
class FixExec(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
"""
def transform(self, node, results):
assert results
syms = self.syms
a = results["a"]
b = results.get("b")
c = results.get("c")
args = [a.clone()]
args[0].prefix = ""
if b is not None:
args.extend([Comma(), b.clone()])
if c is not None:
args.extend([Comma(), c.clone()])
return Call(Name("exec"), args, prefix=node.prefix)
fixes/fix_renames.py 0000644 00000004255 15053244155 0010546 0 ustar 00 """Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
"""
# Author: Christian Heimes
# based on Collin Winter's fix_import
# Local imports
from .. import fixer_base
from ..fixer_util import Name, attr_chain
MAPPING = {"sys": {"maxint" : "maxsize"},
}
LOOKUP = {}
def alternates(members):
return "(" + "|".join(map(repr, members)) + ")"
def build_pattern():
#bare = set()
for module, replace in list(MAPPING.items()):
for old_attr, new_attr in list(replace.items()):
LOOKUP[(module, old_attr)] = new_attr
#bare.add(module)
#bare.add(old_attr)
#yield """
# import_name< 'import' (module=%r
# | dotted_as_names< any* module=%r any* >) >
# """ % (module, module)
yield """
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
""" % (module, old_attr, old_attr)
yield """
power< module_name=%r trailer< '.' attr_name=%r > any* >
""" % (module, old_attr)
#yield """bare_name=%s""" % alternates(bare)
class FixRenames(fixer_base.BaseFix):
BM_compatible = True
PATTERN = "|".join(build_pattern())
order = "pre" # Pre-order tree traversal
# Don't match the node if it's within another match
def match(self, node):
match = super(FixRenames, self).match
results = match(node)
if results:
if any(match(obj) for obj in attr_chain(node, "parent")):
return False
return results
return False
#def start_tree(self, tree, filename):
# super(FixRenames, self).start_tree(tree, filename)
# self.replace = {}
def transform(self, node, results):
mod_name = results.get("module_name")
attr_name = results.get("attr_name")
#bare_name = results.get("bare_name")
#import_mod = results.get("module")
if mod_name and attr_name:
new_attr = LOOKUP[(mod_name.value, attr_name.value)]
attr_name.replace(Name(new_attr, prefix=attr_name.prefix))
fixes/fix_repr.py 0000644 00000001145 15053244155 0010057 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that transforms `xyzzy` into repr(xyzzy)."""
# Local imports
from .. import fixer_base
from ..fixer_util import Call, Name, parenthesize
class FixRepr(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
atom < '`' expr=any '`' >
"""
def transform(self, node, results):
expr = results["expr"].clone()
if expr.type == self.syms.testlist1:
expr = parenthesize(expr)
return Call(Name("repr"), [expr], prefix=node.prefix)
fixes/fix_ws_comma.py 0000644 00000002102 15053244155 0010706 0 ustar 00 """Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
"""
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
class FixWsComma(fixer_base.BaseFix):
explicit = True # The user must ask for this fixers
PATTERN = """
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
"""
COMMA = pytree.Leaf(token.COMMA, ",")
COLON = pytree.Leaf(token.COLON, ":")
SEPS = (COMMA, COLON)
def transform(self, node, results):
new = node.clone()
comma = False
for child in new.children:
if child in self.SEPS:
prefix = child.prefix
if prefix.isspace() and "\n" not in prefix:
child.prefix = ""
comma = True
else:
if comma:
prefix = child.prefix
if not prefix:
child.prefix = " "
comma = False
return new
fixes/fix_raise.py 0000644 00000005556 15053244155 0010224 0 ustar 00 """Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
"""
# Author: Collin Winter
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, Call, Attr, ArgList, is_tuple
class FixRaise(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
"""
def transform(self, node, results):
syms = self.syms
exc = results["exc"].clone()
if exc.type == token.STRING:
msg = "Python 3 does not support string exceptions"
self.cannot_convert(node, msg)
return
# Python 2 supports
# raise ((((E1, E2), E3), E4), E5), V
# as a synonym for
# raise E1, V
# Since Python 3 will not support this, we recurse down any tuple
# literals, always taking the first element.
if is_tuple(exc):
while is_tuple(exc):
# exc.children[1:-1] is the unparenthesized tuple
# exc.children[1].children[0] is the first element of the tuple
exc = exc.children[1].children[0].clone()
exc.prefix = " "
if "val" not in results:
# One-argument raise
new = pytree.Node(syms.raise_stmt, [Name("raise"), exc])
new.prefix = node.prefix
return new
val = results["val"].clone()
if is_tuple(val):
args = [c.clone() for c in val.children[1:-1]]
else:
val.prefix = ""
args = [val]
if "tb" in results:
tb = results["tb"].clone()
tb.prefix = ""
e = exc
# If there's a traceback and None is passed as the value, then don't
# add a call, since the user probably just wants to add a
# traceback. See issue #9661.
if val.type != token.NAME or val.value != "None":
e = Call(exc, args)
with_tb = Attr(e, Name('with_traceback')) + [ArgList([tb])]
new = pytree.Node(syms.simple_stmt, [Name("raise")] + with_tb)
new.prefix = node.prefix
return new
else:
return pytree.Node(syms.raise_stmt,
[Name("raise"), Call(exc, args)],
prefix=node.prefix)
fixes/fix_next.py 0000644 00000006146 15053244155 0010073 0 ustar 00 """Fixer for it.next() -> next(it), per PEP 3114."""
# Author: Collin Winter
# Things that currently aren't covered:
# - listcomp "next" names aren't warned
# - "with" statement targets aren't checked
# Local imports
from ..pgen2 import token
from ..pygram import python_symbols as syms
from .. import fixer_base
from ..fixer_util import Name, Call, find_binding
bind_warning = "Calls to builtin next() possibly shadowed by global binding"
class FixNext(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
"""
order = "pre" # Pre-order tree traversal
def start_tree(self, tree, filename):
super(FixNext, self).start_tree(tree, filename)
n = find_binding('next', tree)
if n:
self.warning(n, bind_warning)
self.shadowed_next = True
else:
self.shadowed_next = False
def transform(self, node, results):
assert results
base = results.get("base")
attr = results.get("attr")
name = results.get("name")
if base:
if self.shadowed_next:
attr.replace(Name("__next__", prefix=attr.prefix))
else:
base = [n.clone() for n in base]
base[0].prefix = ""
node.replace(Call(Name("next", prefix=node.prefix), base))
elif name:
n = Name("__next__", prefix=name.prefix)
name.replace(n)
elif attr:
# We don't do this transformation if we're assigning to "x.next".
# Unfortunately, it doesn't seem possible to do this in PATTERN,
# so it's being done here.
if is_assign_target(node):
head = results["head"]
if "".join([str(n) for n in head]).strip() == '__builtin__':
self.warning(node, bind_warning)
return
attr.replace(Name("__next__"))
elif "global" in results:
self.warning(node, bind_warning)
self.shadowed_next = True
### The following functions help test if node is part of an assignment
### target.
def is_assign_target(node):
assign = find_assign(node)
if assign is None:
return False
for child in assign.children:
if child.type == token.EQUAL:
return False
elif is_subtree(child, node):
return True
return False
def find_assign(node):
if node.type == syms.expr_stmt:
return node
if node.type == syms.simple_stmt or node.parent is None:
return None
return find_assign(node.parent)
def is_subtree(root, node):
if root == node:
return True
return any(is_subtree(c, node) for c in root.children)
fixes/fix_filter.py 0000644 00000005133 15053244155 0010375 0 ustar 00 # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
"""
# Local imports
from .. import fixer_base
from ..pytree import Node
from ..pygram import python_symbols as syms
from ..fixer_util import Name, ArgList, ListComp, in_special_context
class FixFilter(fixer_base.ConditionalFix):
BM_compatible = True
PATTERN = """
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
[extra_trailers=trailer*]
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
"""
skip_on = "future_builtins.filter"
def transform(self, node, results):
if self.should_skip(node):
return
trailers = []
if 'extra_trailers' in results:
for t in results['extra_trailers']:
trailers.append(t.clone())
if "filter_lambda" in results:
new = ListComp(results.get("fp").clone(),
results.get("fp").clone(),
results.get("it").clone(),
results.get("xp").clone())
new = Node(syms.power, [new] + trailers, prefix="")
elif "none" in results:
new = ListComp(Name("_f"),
Name("_f"),
results["seq"].clone(),
Name("_f"))
new = Node(syms.power, [new] + trailers, prefix="")
else:
if in_special_context(node):
return None
args = results['args'].clone()
new = Node(syms.power, [Name("filter"), args], prefix="")
new = Node(syms.power, [Name("list"), ArgList([new])] + trailers)
new.prefix = ""
new.prefix = node.prefix
return new
fixes/fix_numliterals.py 0000644 00000001400 15053244155 0011440 0 ustar 00 """Fixer that turns 1L into 1, 0755 into 0o755.
"""
# Copyright 2007 Georg Brandl.
# Licensed to PSF under a Contributor Agreement.
# Local imports
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Number
class FixNumliterals(fixer_base.BaseFix):
# This is so simple that we don't need the pattern compiler.
_accept_type = token.NUMBER
def match(self, node):
# Override
return (node.value.startswith("0") or node.value[-1] in "Ll")
def transform(self, node, results):
val = node.value
if val[-1] in 'Ll':
val = val[:-1]
elif val.startswith('0') and val.isdigit() and len(set(val)) > 1:
val = "0o" + val[1:]
return Number(val, prefix=node.prefix)
fixes/fix_map.py 0000644 00000007070 15053244155 0007667 0 ustar 00 # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
"""
# Local imports
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, ArgList, Call, ListComp, in_special_context
from ..pygram import python_symbols as syms
from ..pytree import Node
class FixMap(fixer_base.ConditionalFix):
BM_compatible = True
PATTERN = """
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
[extra_trailers=trailer*]
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'map' args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
"""
skip_on = 'future_builtins.map'
def transform(self, node, results):
if self.should_skip(node):
return
trailers = []
if 'extra_trailers' in results:
for t in results['extra_trailers']:
trailers.append(t.clone())
if node.parent.type == syms.simple_stmt:
self.warning(node, "You should use a for loop here")
new = node.clone()
new.prefix = ""
new = Call(Name("list"), [new])
elif "map_lambda" in results:
new = ListComp(results["xp"].clone(),
results["fp"].clone(),
results["it"].clone())
new = Node(syms.power, [new] + trailers, prefix="")
else:
if "map_none" in results:
new = results["arg"].clone()
new.prefix = ""
else:
if "args" in results:
args = results["args"]
if args.type == syms.trailer and \
args.children[1].type == syms.arglist and \
args.children[1].children[0].type == token.NAME and \
args.children[1].children[0].value == "None":
self.warning(node, "cannot convert map(None, ...) "
"with multiple arguments because map() "
"now truncates to the shortest sequence")
return
new = Node(syms.power, [Name("map"), args.clone()])
new.prefix = ""
if in_special_context(node):
return None
new = Node(syms.power, [Name("list"), ArgList([new])] + trailers)
new.prefix = ""
new.prefix = node.prefix
return new
Grammar3.6.8.final.0.pickle 0000644 00000076774 15053244155 0011177 0 ustar 00 �ccollections
OrderedDict
q )Rq(X dfasqh )Rq(M ]q(]q(KK�qKK �qKK �qe]q K K�q
aeh )Rq (KKKKKKKKKKKKKKK KK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKKKKKKKKKK KK KK KK KK KK!KK"KK#KK$KK%KK&KK'KK(KK)Ku�q M]q
(]qK*K�qa]q(K+K �qK K�qeeh )Rq(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku�qM]q(]qK,K�qa]q(K-K �qK K�qeeh )Rq(KKKKKKKKK
KK KKKK#KK$KK&KK'KK(KK)Ku�q M]q (]q K.K�q a]q K/K�q!a]q"(K0K�q#K K�q$e]q%K/K�q&a]q'K K�q(aeh )Rq)K.Ks�q*M]q+(]q,K1K�q-a]q.(K2K�q/K K�q0e]q1(K1K�q2K K�q3eeh )Rq4(KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)KK3Ku�q5M]q6(]q7(K3K�q8K4K�q9K/K�q:e]q;K5K�q<a]q=K K�q>a]q?(K0K�q@K6K�qAK K�qBe]qCK/K�qDaeh )RqE(KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)KK3Ku�qFM]qG(]qHK7K�qIa]qJ(KK �qKKK �qLK K�qMeeh )RqN(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku�qOM]qP(]qQK K�qRa]qSK/K�qTa]qU(K2K�qVK K�qWe]qXK/K�qYa]qZK K�q[aeh )Rq\K Ks�q]M]q^(]q_K%K�q`a]qaK8K�qba]qcK K�qdaeh )RqeK%Ks�qfM ]qg(]qhK%K�qia]qj(K9K�qkK8K�qlK:K�qme]qnK K�qoaeh )RqpK%Ks�qqM
]qr(]qs(KK�qtKK�quK
K�qvK K�qwK#K�qxK'K�qyK(K�qzK)K�q{e]q|(K;K�q}K<K�q~K=K�qe]q�KK �q�a]q�(K>K�q�K?K
�q�e]q�K@K �q�a]q�(KAK�q�KBK �q�e]q�K K�q�a]q�(K)K�q�K K�q�e]q�K;K�q�a]q�KK�q�a]q�K>K�q�a]q�K K�q�a]q�KAK�q�aeh )Rq�(KKKKK
KK KK#KK'KK(KK)Ku�q�M ]q�(]q�(KCK�q�KDK�q�KEK�q�KFK�q�KGK�q�KHK�q�KIK�q�KJK�q�KKK�q�KLK�q�KMK�q�KNK�q�KOK�q�e]q�K K�q�aeh )Rq�(KCKKDKKEKKFKKGKKHKKIKKJKKKKKLKKMKKNKKOKu�q�M ]q�(]q�K
K�q�a]q�K K�q�aeh )Rq�K
Ks�q�M
]q�(]q�KK�q�a]q�K'K�q�a]q�(KK�q�K.K�q�e]q�(K;K�q�KPK�q�e]q�KQK�q�a]q�K.K�q�a]q�K;K�q�a]q�K K�q�aeh )Rq�KKs�q�M]q�(]q�(KK�q�K%K�q�e]q�KRK�q�a]q�KK�q�a]q�KSK�q�a]q�KTK�q�a]q�(KUK�q�K K�q�e]q�K K�q�aeh )Rq�(KKK%Ku�q�M]q�(]q�KK�q�a]q�KVK�q�a]q�(KUK�q�K K�q�e]q�K K�q�aeh )Rq�KKs�q�M]q�(]q�(K6K�q�KWK�q�e]q�K K�q�aeh )Rq�(KKKKK%Ku�q�M]q�(]q�(KXK�q�KYK�q�KZK�q�KXK�q�K[K�q�K\K�q�K]K�q�KSK�q�K^K�q�KK�q�e]q�K K�q�a]q�(KK�r K K�r e]r KSK�r aeh )Rr (KKKSKKXKKYKKZKK[KK\KK]KK^Ku�r M]r (]r K5K�r a]r (K_K �r
K K�r eeh )Rr (KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku�r
M]r (]r (K`K�r KaK�r KbK�r K9K�r K8K�r KcK�r KdK�r KeK�r K:K�r e]r K K�r aeh )Rr (K KKKKKKKKKK KK KK!KK%Ku�r M]r (]r KK�r a]r K K�r! aeh )Rr" KKs�r# M]r$ (]r% KfK�r& a]r' (KgK�r( KaK�r) K8K�r* e]r+ K K�r, aeh )Rr- K Ks�r. M]r/ (]r0 K K�r1 a]r2 KhK�r3 a]r4 (KK�r5 KK�r6 e]r7 (K;K�r8 KPK�r9 e]r: K K�r; a]r< KK�r= a]r> K;K�r? aeh )Rr@ K Ks�rA M]rB (]rC KiK�rD a]rE (KiK�rF K K�rG eeh )RrH K Ks�rI M]rJ (]rK KK�rL a]rM KRK�rN a]rO K K�rP aeh )RrQ KKs�rR M]rS (]rT (K3K�rU K4K�rV K/K�rW e]rX K5K�rY a]rZ (K2K�r[ K6K�r\ K K�r] e]r^ (K2K�r_ K.K�r` K6K�ra K K�rb e]rc (K2K�rd K6K�re K K�rf e]rg (K4K �rh K/K �ri K K�rj e]rk K K�rl a]rm K/K�rn a]ro (K3K
�rp K/K �rq K K�rr e]rs (K2K�rt K K �ru e]rv K5K �rw a]rx K.K
�ry a]rz (K2K�r{ K K �r| e]r} K/K �r~ aeh )Rr (KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)KK3Ku�r� M]r� (]r� KhK�r� a]r� (KjK�r� K K�r� e]r� K'K�r� a]r� K K�r� aeh )Rr� K'Ks�r� M]r� (]r� KkK�r� a]r� (K2K �r� K K�r� eeh )Rr� K'Ks�r� M ]r� (]r� K'K�r� a]r� (KK �r� K K�r� eeh )Rr� K'Ks�r� M ]r� (]r� K'K�r� a]r� K K�r� aeh )Rr� K'Ks�r� M ]r� (]r� KlK�r� a]r� (KK�r� KK�r� e]r� K K�r� aeh )Rr� (KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r� M ]r� (]r� KmK�r� a]r� (K/K�r� K K�r� e]r� (K2K�r� KjK�r� K K�r� e]r� K/K�r� a]r� K K�r� aeh )Rr� KmKs�r� M ]r� (]r� KK�r� a]r� K5K�r� a]r� (KSK�r� K K�r� e]r� K/K�r� a]r� (K2K�r� K K�r� e]r� K/K�r� a]r� K K�r� aeh )Rr� KKs�r� M!]r� (]r� KnK�r� a]r� (KoK �r� K K�r� eeh )Rr� (KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku�r� M"]r� (]r� KpK�r� a]r� (K0K�r� KqK�r� KrK�r� K K�r� e]r� (KpK�r� K=K�r� e]r� K K�r� a]r� (KlK�r� K=K�r� e]r� (K0K�r� K K�r� eeh )Rr� (KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r� M#]r� (]r� (K5K�r� K4K�r� e]r� (K2K�r� K K�r� e]r� (K5K�r� K4K�r� K K�r� eeh )Rr� (KKKKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku�r� M$]r� (]r� (KK�r� KK�r� K$K�r� KsK�r e]r KtK�r a]r K K�r aeh )Rr (KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku�r M%]r (]r (KuK�r KvK�r
KwK�r KxK�r KyK�r
e]r K K�r aeh )Rr (K
KKKK KK KK"Ku�r M&]r (]r KK�r a]r KRK�r a]r KSK�r a]r KlK�r a]r K.K�r a]r KQK�r a]r (KzK�r K K�r! e]r" K.K�r# a]r$ KQK �r% a]r& K K �r' aeh )Rr( KKs�r) M']r* (]r+ KK�r, a]r- K'K�r. a]r/ K{K�r0 a]r1 (K|K�r2 K.K�r3 e]r4 K/K�r5 a]r6 KQK�r7 a]r8 K.K�r9 a]r: K K�r; aeh )Rr< KKs�r= M(]r> (]r? (KK�r@ KK�rA e]rB K'K�rC a]rD (K2K�rE K K�rF eeh )RrG (KKKKu�rH M)]rI (]rJ KK�rK a]rL K/K�rM a]rN K.K�rO a]rP KQK�rQ a]rR (K}K�rS KzK�rT K K�rU e]rV K.K�rW a]rX KQK�rY a]rZ K K�r[ aeh )Rr\ KKs�r] M*]r^ (]r_ K'K�r` a]ra (KjK�rb K K�rc e]rd K'K�re a]rf K K�rg aeh )Rrh K'Ks�ri M+]rj (]rk K~K�rl a]rm (K2K�rn K K�ro e]rp (K~K�rq K K�rr eeh )Rrs K'Ks�rt M,]ru (]rv KK�rw a]rx (KK�ry KhK�rz e]r{ (KK�r| KK�r} KhK�r~ e]r KK�r� a]r� (KK�r� KK�r� KK�r� e]r� KK�r� a]r� K K�r� a]r� K;K�r� aeh )Rr� KKs�r� M-]r� (]r� KK�r� a]r� K�K�r� a]r� K K�r� aeh )Rr� KKs�r� M.]r� (]r� (K�K�r� K�K�r� e]r� K K�r� aeh )Rr� (KKKKu�r� M/]r� (]r� KK�r� a]r� (K.K�r� K�K�r� e]r� K/K�r� a]r� K.K�r� a]r� K K�r� aeh )Rr� KKs�r� M0]r� (]r� (K4K�r� K/K�r� e]r� (K2K�r� K6K�r� K K�r� e]r� (K4K�r� K/K�r� K K�r� e]r� K K�r� a]r� (K2K�r� K K�r� eeh )Rr� (KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r� M1]r� (]r� (KK�r� K�K�r� e]r� K,K�r� a]r� K K�r� aeh )Rr� (KKKKKKKKK
KK KKKK#KK$KK&KK'KK(KK)Ku�r� M2]r� (]r� KK�r� a]r� (K.K�r� K�K�r� e]r� KVK�r� a]r� K.K�r� a]r� K K�r� aeh )Rr� KKs�r� M3]r� (]r� (K�K�r� K�K�r� e]r� K K�r� aeh )Rr� (KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r� M4]r� (]r� K�K�r� a]r� (K�K �r� K K�r� eeh )Rr� (KKKKKKKKK
KK KKKK#KK$KK&KK'KK(KK)Ku�r� M5]r� (]r� KK�r� a]r� (K;K�r� K�K�r� e]r� K K�r� a]r� K;K�r� aeh )Rr� KKs�r� M6]r� (]r� KK�r� a]r� K K�r� aeh )Rr� KKs�r� M7]r� (]r� (K&K�r� K�K�r� e]r� K�K�r� a]r (K3K�r K�K�r K K�r e]r KtK�r a]r K K�r aeh )Rr (KKKKK
KK KK#KK&KK'KK(KK)Ku�r M8]r
(]r K K�r a]r
(K�K�r K/K�r K K�r e]r K/K�r a]r (K2K�r K K�r e]r (K2K�r K K�r e]r (K/K�r K K�r e]r K/K�r a]r (K2K�r K K�r e]r! (K/K�r" K K�r# eeh )Rr$ K Ks�r% M9]r& (]r' K K�r( a]r) (K/K�r* K K�r+ e]r, (K2K�r- KK�r. K K�r/ e]r0 K/K�r1 a]r2 K/K�r3 a]r4 (K2K�r5 K K�r6 e]r7 K K�r8 aeh )Rr9 K Ks�r: M:]r; (]r< K K�r= a]r> (KlK�r? K K�r@ e]rA K K�rB aeh )RrC K Ks�rD M;]rE (]rF K�K�rG a]rH (K�K �rI K�K �rJ K K�rK eeh )RrL (KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku�rM M<]rN (]rO K�K�rP a]rQ (K�K�rR KK�rS e]rT (KK�rU K�K�rV e]rW K K�rX aeh )RrY (KKKKKKKKKKK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKK KK KK KK"KK#KK$KK&KK'KK(KK)Ku�rZ M=]r[ (]r\ (KK�r] K�K�r^ K�K�r_ e]r` K K�ra a]rb KK�rc aeh )Rrd (KKKKKKKKKKKKK KK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKKKKKKKKKK KK KK KK KK KK!KK"KK#KK$KK%KK&KK'KK(KK)Ku�re M>]rf (]rg K.K�rh a]ri (K/K�rj K K�rk e]rl K K�rm aeh )Rrn K.Ks�ro M?]rp (]rq (K�K�rr K�K�rs K�K�rt K�K�ru K�K�rv K�K�rw K�K�rx K�K�ry K�K�rz e]r{ K K�r| aeh )Rr} (KKKKKKKKKKK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKK KK KK KK"KK#KK$KK&KK'KK(KK)Ku�r~ M@]r (]r� KK�r� a]r� K5K�r� a]r� K K�r� aeh )Rr� KKs�r� MA]r� (]r� (K�K�r� K�K�r� e]r� K K�r� aeh )Rr� (KKKKKKKKKKK KK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKKKKKKKKKK KK KK KK KK KK!KK"KK#KK$KK%KK&KK'KK(KK)Ku�r� MB]r� (]r� (K.K�r� K/K�r� e]r� (K�K�r� K/K�r� K K�r� e]r� (K.K�r� K K�r� e]r� K K�r� a]r� (K�K�r� K K�r� eeh )Rr� (KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)KK.Ku�r� MC]r� (]r� K�K�r� a]r� (K2K�r� K K�r� e]r� (K�K�r� K K�r� eeh )Rr� (KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)KK.Ku�r� MD]r� (]r� (KK�r� K�K�r� e]r� K�K�r� a]r� K K�r� a]r� KK�r� a]r� (K�K�r� KK�r� eeh )Rr� (KKKKKKKKKKKKK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKK KK KK KK"KK#KK$KK&KK'KK(KK)Ku�r� ME]r� (]r� KtK�r� a]r� (K�K �r� KK �r� K�K �r� K�K �r� K K �r� K K�r� eeh )Rr� (KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku�r� MF]r� (]r� (K�K�r� K�K�r� e]r� K K�r� a]r� (KK�r� K K�r� e]r� K�K�r� a]r� KzK�r� a]r� K/K�r� aeh )Rr� (KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r� MG]r� (]r� K/K�r� a]r� (K2K�r� K K�r� e]r� (K/K�r� K K�r� eeh )Rr� (KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r� MH]r� (]r� K/K�r� a]r� (K2K �r� K K�r� eeh )Rr� (KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r� MI]r� (]r� (K4K�r� K/K�r� e]r� (K2K�r� K6K�r� K K�r� e]r� (K4K�r� K/K�r� K K�r� e]r� K K�r� a]r� (K2K�r� K K�r� eeh )Rr� (KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r� MJ]r� (]r KVK�r a]r (K2K�r K K�r e]r KVK�r a]r (K2K�r K K�r e]r
(KVK�r K K�r eeh )Rr
(KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r MK]r (]r (K4K�r K/K�r e]r (K2K�r K K�r e]r (K4K�r K/K�r K K�r eeh )Rr (KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r ML]r (]r (KK�r K�K�r e]r K�K�r! a]r" K K�r# a]r$ K;K�r% aeh )Rr& (KKK'Ku�r' MM]r( (]r) K�K�r* a]r+ (K2K�r, K K�r- e]r. (K�K�r/ K K�r0 eeh )Rr1 (KKK'Ku�r2 MN]r3 (]r4 K'K�r5 a]r6 (K.K�r7 K K�r8 e]r9 K/K�r: a]r; K K�r< aeh )Rr= K'Ks�r> MO]r? (]r@ (KK�rA KK�rB K
K�rC e]rD (K;K�rE KPK�rF e]rG K'K�rH a]rI K�K�rJ a]rK K K�rL a]rM K;K�rN a]rO K>K�rP aeh )RrQ (KKKKK
Ku�rR MP]rS (]rT K K�rU a]rV K.K�rW a]rX KQK�rY a]rZ (K�K�r[ K�K�r\ e]r] K.K�r^ a]r_ K.K�r` a]ra KQK�rb a]rc KQK �rd a]re K K�rf a]rg (KzK
�rh K�K�ri K�K�rj K K �rk e]rl K.K �rm a]rn KQK �ro a]rp (K�K�rq K K �rr eeh )Rrs K Ks�rt MQ]ru (]rv (KK�rw K3K�rx K�K�ry e]rz (K2K�r{ K�K�r| K K�r} e]r~ K�K�r a]r� (K2K�r� K0K�r� K K�r� e]r� (K3K�r� K�K �r� K K�r� e]r� (K2K�r� K K�r� e]r� (K2K
�r� K K�r� e]r� (KK�r� K3K�r� K�K�r� K K�r� e]r� K/K �r� a]r� (K2K�r� K0K �r� K K �r� e]r� K K
�r� a]r� (K2K�r� K K �r� e]r� K/K�r� aeh )Rr� (KKKKK'KK3Ku�r� MR]r� (]r� (KK�r� K3K�r� K�K�r� e]r� (K2K�r� K�K�r� K K�r� e]r� K�K�r� a]r� (K2K�r� K0K�r� K K�r� e]r� (K3K�r� K�K �r� K K�r� e]r� (K2K�r� K K�r� e]r� (K2K
�r� K K�r� e]r� (KK�r� K3K�r� K�K�r� K K�r� e]r� K/K �r� a]r� (K2K�r� K0K �r� K K �r� e]r� K K
�r� a]r� (K2K�r� K K �r� e]r� K/K�r� aeh )Rr� (KKKKK'KK3Ku�r� MS]r� (]r� (KK�r� K�K�r� e]r� K�K�r� a]r� K K�r� a]r� K;K�r� aeh )Rr� (KKK'Ku�r� MT]r� (]r� K�K�r� a]r� (K2K�r� K K�r� e]r� (K�K�r� K K�r� eeh )Rr� (KKK'Ku�r� MU]r� (]r� K'K�r� a]r� K K�r� aeh )Rr� K'Ks�r� MV]r� (]r� K K�r� a]r� K/K�r� a]r� K.K�r� a]r� KQK�r� a]r� (KzK�r� K K�r� e]r� K.K�r� a]r� KQK�r� a]r� K K�r� aeh )Rr� K Ks�r MW]r (]r K/K�r a]r (KjK�r K K�r e]r K5K�r a]r K K�r
aeh )Rr (KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku�r MX]r
(]r K!K�r a]r K�K�r a]r (K2K�r K.K�r e]r KQK�r a]r K K�r aeh )Rr K!Ks�r MY]r (]r KjK�r a]r K5K�r a]r K K�r! aeh )Rr" KjKs�r# MZ]r$ (]r% K�K�r& a]r' (K�K �r( K K�r) eeh )Rr* (KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku�r+ M[]r, (]r- (KK�r. KlK�r/ e]r0 K/K�r1 a]r2 K K�r3 aeh )Rr4 (KKKKKKKKK
KK KKKKKKKK#KK$KK&KK'KK(KK)Ku�r5 M\]r6 (]r7 K"K�r8 a]r9 (K�K�r: K K�r; e]r< K K�r= aeh )Rr> K"Ks�r? M]]r@ (]rA K=K�rB a]rC K K�rD aeh )RrE K"Ks�rF uX keywordsrG h )RrH (X andrI K-X asrJ KjX assertrK K X breakrL K
X classrM KX continuerN KX defrO KX delrP KX elifrQ K}X elserR KzX exceptrS KmX execrT KX finallyrU K�X forrV KX fromrW KX globalrX KX ifrY KX importrZ KX inr[ KSX isr\ K^X lambdar] KX nonlocalr^ KX notr_ KX orr` K�X passra KX printrb K X raiserc K X returnrd K X tryre K X whilerf K X withrg K!X yieldrh K"uX labelsri ]rj (K X EMPTYrk �rl K N�rm KN�rn MAN�ro KN�rp KN�rq KN�rr KN�rs KN�rt K2N�ru K N�rv KN�rw KjK �rx KjL �ry KjM �rz KjN �r{ KjO �r| KjP �r} KjT �r~ KjV �r KjW �r� KjX �r� KjY �r� KjZ �r� Kj] �r� Kj^ �r� Kj_ �r� Kja �r� Kjb �r� Kjc �r� Kjd �r� Kje �r� Kjf �r� Kjg �r� Kjh �r� KN�r� K N�r� K9N�r� K8N�r� KN�r� KN�r� KN�r� M;N�r� KN�r� M1N�r� KjI �r� K N�r� MFN�r� KN�r� MN�r� K N�r� K$N�r� M@N�r� M!N�r� MN�r� MEN�r� M'N�r� M&N�r� MXN�r� KN�r� MIN�r� M\N�r� K
N�r� M0N�r� MHN�r� KN�r� MN�r� K)N�r� K*N�r� K/N�r� K'N�r� K%N�r� K&N�r� K1N�r� K(N�r� K-N�r� K.N�r� K3N�r� K,N�r� K+N�r� MN�r� MDN�r� M#N�r� Kj[ �r� MJN�r� MN�r� M3N�r� MN�r� K N�r� KN�r� K N�r� K N�r� KN�r� K N�r� Kj\ �r� MN�r� M N�r� M
N�r� MN�r� M)N�r� MPN�r� MVN�r� MN�r� MN�r� M N�r� MN�r� KjJ �r� MN�r� MGN�r� KjS �r� MZN�r� KN�r� MKN�r� MN�r� M N�r� M7N�r� M$N�r� M N�r� MN�r� M9N�r� M:N�r� M]N�r� KjR �r� M5N�r� K7N�r� KjQ �r� M*N�r� M+N�r� MN�r� M,N�r� M-N�r� MRN�r� MN�r� M2N�r� M4N�r� MN�r� Kj` �r� MQN�r� M
N�r� MON�r� K#N�r� MN�r� K"N�r� M?N�r� K
N�r� MN�r� M<N�r� MN�r� MN�r M N�r M"N�r M%N�r M(N�r M.N�r M6N�r M8N�r M>N�r MBN�r KN�r
KN�r KN�r KN�r
K0N�r M/N�r MNN�r MMN�r MLN�r MCN�r KjU �r M N�r MSN�r MUN�r MTN�r MWN�r MN�r K!N�r M[N�r eX
number2symbolr h )Rr (M X
file_inputr MX and_exprr MX and_testr! MX annassignr" MX arglistr# MX argumentr$ MX
arith_exprr% MX assert_stmtr& MX
async_funcdefr' M X
async_stmtr( M
X atomr) M X augassignr* M X
break_stmtr+ M
X classdefr, MX comp_forr- MX comp_ifr. MX comp_iterr/ MX comp_opr0 MX
comparisonr1 MX
compound_stmtr2 MX
continue_stmtr3 MX decoratedr4 MX decoratorr5 MX
decoratorsr6 MX del_stmtr7 MX dictsetmakerr8 MX dotted_as_namer9 MX dotted_as_namesr: M X dotted_namer; M X
encoding_declr< M X
eval_inputr= M X
except_clauser> M X exec_stmtr? M!X exprr@ M"X expr_stmtrA M#X exprlistrB M$X factorrC M%X flow_stmtrD M&X for_stmtrE M'X funcdefrF M(X global_stmtrG M)X if_stmtrH M*X import_as_namerI M+X import_as_namesrJ M,X import_fromrK M-X import_namerL M.X import_stmtrM M/X lambdefrN M0X listmakerrO M1X not_testrP M2X old_lambdefrQ M3X old_testrR M4X or_testrS M5X
parametersrT M6X pass_stmtrU M7X powerrV M8X
print_stmtrW M9X
raise_stmtrX M:X return_stmtrY M;X
shift_exprrZ M<X simple_stmtr[ M=X single_inputr\ M>X sliceopr] M?X
small_stmtr^ M@X star_exprr_ MAX stmtr` MBX subscriptra MCX
subscriptlistrb MDX suiterc MEX termrd MFX testre MGX testlistrf MHX testlist1rg MIX
testlist_gexprh MJX
testlist_saferi MKX testlist_star_exprrj MLX tfpdefrk MMX tfplistrl MNX tnamerm MOX trailerrn MPX try_stmtro MQX
typedargslistrp MRX varargslistrq MSX vfpdefrr MTX vfplistrs MUX vnamert MVX
while_stmtru MWX with_itemrv MXX with_stmtrw MYX with_varrx MZX xor_exprry M[X yield_argrz M\X
yield_exprr{ M]X
yield_stmtr| uX startr} M X statesr~ ]r (]r� (]r� (KK�r� KK �r� KK �r� e]r� K K�r� ae]r� (]r� K*K�r� a]r� (K+K �r� K K�r� ee]r� (]r� K,K�r� a]r� (K-K �r� K K�r� ee]r� (]r� K.K�r� a]r� K/K�r� a]r� (K0K�r� K K�r� e]r� K/K�r� a]r� K K�r� ae]r� (]r� K1K�r� a]r� (K2K�r� K K�r� e]r� (K1K�r� K K�r� ee]r� (]r� (K3K�r� K4K�r� K/K�r� e]r� K5K�r� a]r� K K�r� a]r� (K0K�r� K6K�r� K K�r� e]r� K/K�r� ae]r� (]r� K7K�r� a]r� (KK �r� KK �r� K K�r� ee]r� (]r� K K�r� a]r� K/K�r� a]r� (K2K�r� K K�r� e]r� K/K�r� a]r� K K�r� ae]r� (]r� K%K�r� a]r� K8K�r� a]r� K K�r� ae]r� (]r� K%K�r� a]r� (K9K�r� K8K�r� K:K�r� e]r� K K�r� ae]r� (]r� (KK�r� KK�r� K
K�r� K K�r� K#K�r� K'K�r� K(K�r� K)K�r� e]r� (K;K�r� K<K�r� K=K�r� e]r� KK �r� a]r� (K>K�r� K?K
�r� e]r� K@K �r� a]r� (KAK�r� KBK �r� e]r� K K�r� a]r� (K)K�r� K K�r� e]r� K;K�r� a]r� KK�r� a]r� K>K�r� a]r� K K�r� a]r� KAK�r ae]r (]r (KCK�r KDK�r KEK�r KFK�r KGK�r KHK�r KIK�r KJK�r
KKK�r KLK�r KMK�r
KNK�r KOK�r e]r K K�r ae]r (]r K
K�r a]r K K�r ae]r (]r KK�r a]r K'K�r a]r (KK�r K.K�r e]r (K;K�r KPK�r! e]r" KQK�r# a]r$ K.K�r% a]r& K;K�r' a]r( K K�r) ae]r* (]r+ (KK�r, K%K�r- e]r. KRK�r/ a]r0 KK�r1 a]r2 KSK�r3 a]r4 KTK�r5 a]r6 (KUK�r7 K K�r8 e]r9 K K�r: ae]r; (]r< KK�r= a]r> KVK�r? a]r@ (KUK�rA K K�rB e]rC K K�rD ae]rE (]rF (K6K�rG KWK�rH e]rI K K�rJ ae]rK (]rL (KXK�rM KYK�rN KZK�rO KXK�rP K[K�rQ K\K�rR K]K�rS KSK�rT K^K�rU KK�rV e]rW K K�rX a]rY (KK�rZ K K�r[ e]r\ KSK�r] ae]r^ (]r_ K5K�r` a]ra (K_K �rb K K�rc ee]rd (]re (K`K�rf KaK�rg KbK�rh K9K�ri K8K�rj KcK�rk KdK�rl KeK�rm K:K�rn e]ro K K�rp ae]rq (]rr KK�rs a]rt K K�ru ae]rv (]rw KfK�rx a]ry (KgK�rz KaK�r{ K8K�r| e]r} K K�r~ ae]r (]r� K K�r� a]r� KhK�r� a]r� (KK�r� KK�r� e]r� (K;K�r� KPK�r� e]r� K K�r� a]r� KK�r� a]r� K;K�r� ae]r� (]r� KiK�r� a]r� (KiK�r� K K�r� ee]r� (]r� KK�r� a]r� KRK�r� a]r� K K�r� ae]r� (]r� (K3K�r� K4K�r� K/K�r� e]r� K5K�r� a]r� (K2K�r� K6K�r� K K�r� e]r� (K2K�r� K.K�r� K6K�r� K K�r� e]r� (K2K�r� K6K�r� K K�r� e]r� (K4K �r� K/K �r� K K�r� e]r� K K�r� a]r� K/K�r� a]r� (K3K
�r� K/K �r� K K�r� e]r� (K2K�r� K K �r� e]r� K5K �r� a]r� K.K
�r� a]r� (K2K�r� K K �r� e]r� K/K �r� ae]r� (]r� KhK�r� a]r� (KjK�r� K K�r� e]r� K'K�r� a]r� K K�r� ae]r� (]r� KkK�r� a]r� (K2K �r� K K�r� ee]r� (]r� K'K�r� a]r� (KK �r� K K�r� ee]r� (]r� K'K�r� a]r� K K�r� ae]r� (]r� KlK�r� a]r� (KK�r� KK�r� e]r� K K�r� ae]r� (]r� KmK�r� a]r� (K/K�r� K K�r� e]r� (K2K�r� KjK�r� K K�r� e]r� K/K�r� a]r� K K�r� ae]r� (]r� KK�r� a]r� K5K�r� a]r� (KSK�r K K�r e]r K/K�r a]r (K2K�r K K�r e]r K/K�r a]r K K�r
ae]r (]r KnK�r
a]r (KoK �r K K�r ee]r (]r KpK�r a]r (K0K�r KqK�r KrK�r K K�r e]r (KpK�r K=K�r e]r K K�r a]r (KlK�r K=K�r e]r! (K0K�r" K K�r# ee]r$ (]r% (K5K�r& K4K�r' e]r( (K2K�r) K K�r* e]r+ (K5K�r, K4K�r- K K�r. ee]r/ (]r0 (KK�r1 KK�r2 K$K�r3 KsK�r4 e]r5 KtK�r6 a]r7 K K�r8 ae]r9 (]r: (KuK�r; KvK�r< KwK�r= KxK�r> KyK�r? e]r@ K K�rA ae]rB (]rC KK�rD a]rE KRK�rF a]rG KSK�rH a]rI KlK�rJ a]rK K.K�rL a]rM KQK�rN a]rO (KzK�rP K K�rQ e]rR K.K�rS a]rT KQK �rU a]rV K K �rW ae]rX (]rY KK�rZ a]r[ K'K�r\ a]r] K{K�r^ a]r_ (K|K�r` K.K�ra e]rb K/K�rc a]rd KQK�re a]rf K.K�rg a]rh K K�ri ae]rj (]rk (KK�rl KK�rm e]rn K'K�ro a]rp (K2K�rq K K�rr ee]rs (]rt KK�ru a]rv K/K�rw a]rx K.K�ry a]rz KQK�r{ a]r| (K}K�r} KzK�r~ K K�r e]r� K.K�r� a]r� KQK�r� a]r� K K�r� ae]r� (]r� K'K�r� a]r� (KjK�r� K K�r� e]r� K'K�r� a]r� K K�r� ae]r� (]r� K~K�r� a]r� (K2K�r� K K�r� e]r� (K~K�r� K K�r� ee]r� (]r� KK�r� a]r� (KK�r� KhK�r� e]r� (KK�r� KK�r� KhK�r� e]r� KK�r� a]r� (KK�r� KK�r� KK�r� e]r� KK�r� a]r� K K�r� a]r� K;K�r� ae]r� (]r� KK�r� a]r� K�K�r� a]r� K K�r� ae]r� (]r� (K�K�r� K�K�r� e]r� K K�r� ae]r� (]r� KK�r� a]r� (K.K�r� K�K�r� e]r� K/K�r� a]r� K.K�r� a]r� K K�r� ae]r� (]r� (K4K�r� K/K�r� e]r� (K2K�r� K6K�r� K K�r� e]r� (K4K�r� K/K�r� K K�r� e]r� K K�r� a]r� (K2K�r� K K�r� ee]r� (]r� (KK�r� K�K�r� e]r� K,K�r� a]r� K K�r� ae]r� (]r� KK�r� a]r� (K.K�r� K�K�r� e]r� KVK�r� a]r� K.K�r� a]r� K K�r� ae]r� (]r� (K�K�r� K�K�r� e]r� K K�r� ae]r� (]r� K�K�r� a]r� (K�K �r� K K�r� ee]r� (]r� KK�r� a]r� (K;K�r� K�K�r� e]r� K K�r a]r K;K�r ae]r (]r KK�r a]r K K�r ae]r (]r (K&K�r
K�K�r e]r K�K�r
a]r (K3K�r K�K�r K K�r e]r KtK�r a]r K K�r ae]r (]r K K�r a]r (K�K�r K/K�r K K�r e]r K/K�r a]r (K2K�r K K�r! e]r" (K2K�r# K K�r$ e]r% (K/K�r& K K�r' e]r( K/K�r) a]r* (K2K�r+ K K�r, e]r- (K/K�r. K K�r/ ee]r0 (]r1 K K�r2 a]r3 (K/K�r4 K K�r5 e]r6 (K2K�r7 KK�r8 K K�r9 e]r: K/K�r; a]r< K/K�r= a]r> (K2K�r? K K�r@ e]rA K K�rB ae]rC (]rD K K�rE a]rF (KlK�rG K K�rH e]rI K K�rJ ae]rK (]rL K�K�rM a]rN (K�K �rO K�K �rP K K�rQ ee]rR (]rS K�K�rT a]rU (K�K�rV KK�rW e]rX (KK�rY K�K�rZ e]r[ K K�r\ ae]r] (]r^ (KK�r_ K�K�r` K�K�ra e]rb K K�rc a]rd KK�re ae]rf (]rg K.K�rh a]ri (K/K�rj K K�rk e]rl K K�rm ae]rn (]ro (K�K�rp K�K�rq K�K�rr K�K�rs K�K�rt K�K�ru K�K�rv K�K�rw K�K�rx e]ry K K�rz ae]r{ (]r| KK�r} a]r~ K5K�r a]r� K K�r� ae]r� (]r� (K�K�r� K�K�r� e]r� K K�r� ae]r� (]r� (K.K�r� K/K�r� e]r� (K�K�r� K/K�r� K K�r� e]r� (K.K�r� K K�r� e]r� K K�r� a]r� (K�K�r� K K�r� ee]r� (]r� K�K�r� a]r� (K2K�r� K K�r� e]r� (K�K�r� K K�r� ee]r� (]r� (KK�r� K�K�r� e]r� K�K�r� a]r� K K�r� a]r� KK�r� a]r� (K�K�r� KK�r� ee]r� (]r� KtK�r� a]r� (K�K �r� KK �r� K�K �r� K�K �r� K K �r� K K�r� ee]r� (]r� (K�K�r� K�K�r� e]r� K K�r� a]r� (KK�r� K K�r� e]r� K�K�r� a]r� KzK�r� a]r� K/K�r� ae]r� (]r� K/K�r� a]r� (K2K�r� K K�r� e]r� (K/K�r� K K�r� ee]r� (]r� K/K�r� a]r� (K2K �r� K K�r� ee]r� (]r� (K4K�r� K/K�r� e]r� (K2K�r� K6K�r� K K�r� e]r� (K4K�r� K/K�r� K K�r� e]r� K K�r� a]r� (K2K�r� K K�r� ee]r� (]r� KVK�r� a]r� (K2K�r� K K�r� e]r� KVK�r� a]r� (K2K�r� K K�r� e]r� (KVK�r� K K�r� ee]r� (]r� (K4K�r� K/K�r� e]r� (K2K�r� K K�r� e]r� (K4K�r� K/K�r� K K�r� ee]r
(]r
(KK�r
K�K�r
e]r
K�K�r
a]r
K K�r
a]r
K;K�r
ae]r
(]r
K�K�r
a]r
(K2K�r
K K�r
e]r
(K�K�r
K K�r
ee]r
(]r
K'K�r
a]r
(K.K�r
K K�r
e]r
K/K�r
a]r
K K�r
ae]r
(]r
(KK�r
KK�r
K
K�r!
e]r"
(K;K�r#
KPK�r$
e]r%
K'K�r&
a]r'
K�K�r(
a]r)
K K�r*
a]r+
K;K�r,
a]r-
K>K�r.
ae]r/
(]r0
K K�r1
a]r2
K.K�r3
a]r4
KQK�r5
a]r6
(K�K�r7
K�K�r8
e]r9
K.K�r:
a]r;
K.K�r<
a]r=
KQK�r>
a]r?
KQK �r@
a]rA
K K�rB
a]rC
(KzK
�rD
K�K�rE
K�K�rF
K K �rG
e]rH
K.K �rI
a]rJ
KQK �rK
a]rL
(K�K�rM
K K �rN
ee]rO
(]rP
(KK�rQ
K3K�rR
K�K�rS
e]rT
(K2K�rU
K�K�rV
K K�rW
e]rX
K�K�rY
a]rZ
(K2K�r[
K0K�r\
K K�r]
e]r^
(K3K�r_
K�K �r`
K K�ra
e]rb
(K2K�rc
K K�rd
e]re
(K2K
�rf
K K�rg
e]rh
(KK�ri
K3K�rj
K�K�rk
K K�rl
e]rm
K/K �rn
a]ro
(K2K�rp
K0K �rq
K K �rr
e]rs
K K
�rt
a]ru
(K2K�rv
K K �rw
e]rx
K/K�ry
ae]rz
(]r{
(KK�r|
K3K�r}
K�K�r~
e]r
(K2K�r�
K�K�r�
K K�r�
e]r�
K�K�r�
a]r�
(K2K�r�
K0K�r�
K K�r�
e]r�
(K3K�r�
K�K �r�
K K�r�
e]r�
(K2K�r�
K K�r�
e]r�
(K2K
�r�
K K�r�
e]r�
(KK�r�
K3K�r�
K�K�r�
K K�r�
e]r�
K/K �r�
a]r�
(K2K�r�
K0K �r�
K K �r�
e]r�
K K
�r�
a]r�
(K2K�r�
K K �r�
e]r�
K/K�r�
ae]r�
(]r�
(KK�r�
K�K�r�
e]r�
K�K�r�
a]r�
K K�r�
a]r�
K;K�r�
ae]r�
(]r�
K�K�r�
a]r�
(K2K�r�
K K�r�
e]r�
(K�K�r�
K K�r�
ee]r�
(]r�
K'K�r�
a]r�
K K�r�
ae]r�
(]r�
K K�r�
a]r�
K/K�r�
a]r�
K.K�r�
a]r�
KQK�r�
a]r�
(KzK�r�
K K�r�
e]r�
K.K�r�
a]r�
KQK�r�
a]r�
K K�r�
ae]r�
(]r�
K/K�r�
a]r�
(KjK�r�
K K�r�
e]r�
K5K�r�
a]r�
K K�r�
ae]r�
(]r�
K!K�r�
a]r�
K�K�r�
a]r�
(K2K�r�
K.K�r�
e]r�
KQK�r�
a]r�
K K�r�
ae]r�
(]r�
KjK�r�
a]r�
K5K�r�
a]r�
K K�r�
ae]r�
(]r�
K�K�r�
a]r�
(K�K �r�
K K�r�
ee]r�
(]r�
(KK�r�
KlK�r�
e]r�
K/K�r�
a]r�
K K�r�
ae]r�
(]r�
K"K�r�
a]r�
(K�K�r�
K K�r�
e]r K K�r ae]r (]r K=K�r a]r K K�r aeeX symbol2labelr h )Rr (X and_exprr K�X and_testr
K�X annassignr KqX arglistr KPX argumentr
K1X
arith_exprr K�X assert_stmtr K�X
async_funcdefr KgX
async_stmtr K`X atomr K�X augassignr KrX
break_stmtr KuX classdefr KaX comp_forr K6X comp_ifr KWX comp_iterr KUX comp_opr K_X
comparisonr K�X
compound_stmtr K�X
continue_stmtr KvX decoratedr KbX decoratorr KiX
decoratorsr KfX del_stmtr K�X dictsetmakerr! KBX dotted_as_namer" KkX dotted_as_namesr# K�X dotted_namer$ KhX
except_clauser% K�X exec_stmtr& K�X exprr' K5X expr_stmtr( K�X exprlistr) KRX factorr* KtX flow_stmtr+ K�X for_stmtr, K9X funcdefr- K8X global_stmtr. K�X if_stmtr/ KcX import_as_namer0 K~X import_as_namesr1 KX import_fromr2 K�X import_namer3 K�X import_stmtr4 K�X lambdefr5 K�X listmakerr6 K?X not_testr7 K,X old_lambdefr8 K�X old_testr9 KVX or_testr: K�X
parametersr; K{X pass_stmtr< K�X powerr= KsX
print_stmtr> K�X
raise_stmtr? KwX return_stmtr@ KxX
shift_exprrA K*X simple_stmtrB K�X sliceoprC K�X
small_stmtrD K�X star_exprrE K4X stmtrF KX subscriptrG K�X
subscriptlistrH K�X suiterI KQX termrJ K7X testrK K/X testlistrL KlX testlist1rM K@X
testlist_gexprN K<X
testlist_saferO KTX testlist_star_exprrP KpX tfpdefrQ K�X tfplistrR K�X tnamerS K�X trailerrT K�X try_stmtrU KdX
typedargslistrV K�X varargslistrW K�X vfpdefrX K�X vfplistrY K�X vnamerZ K�X
while_stmtr[ KeX with_itemr\ K�X with_stmtr] K:X xor_exprr^ KnX yield_argr_ K�X
yield_exprr` K=X
yield_stmtra KyuX
symbol2numberrb h )Rrc (j Mj! Mj" Mj# Mj$ Mj% Mj& Mj' Mj( M j) M
j* M j+ M j, M
j- Mj. Mj/ Mj0 Mj1 Mj2 Mj3 Mj4 Mj5 Mj6 Mj7 Mj8 Mj9 Mj: Mj; M j< M j= M j> M j? M j@ M!jA M"jB M#jC M$j M jD M%jE M&jF M'jG M(jH M)jI M*jJ M+jK M,jL M-jM M.jN M/jO M0jP M1jQ M2jR M3jS M4jT M5jU M6jV M7jW M8jX M9jY M:jZ M;j[ M<j\ M=j] M>j^ M?j_ M@j` MAja MBjb MCjc MDjd MEje MFjf MGjg MHjh MIji MJjj MKjk MLjl MMjm MNjn MOjo MPjp MQjq MRjr MSjs MTjt MUju MVjv MWjw MXjx MYjy MZjz M[j{ M\j| M]uX tokensrd h )Rre (K KKK'KK(KK)KKKK�KK�KKKK;K K
K
K>K K.K K2K
K�KKKKKKKK�KKoKK+KKYKK\KK0KKKK�KK KK#KKAK K[K KXK KZK K]K K$K!K�K"K�K#K�K$K3K%KGK&KHK'KFK(KJK)KCK*KDK+KOK,KNK-KKK.KLK/KEK0K�K1KIK2K K3KMK7K|K8K&K9K%uu. patcomp.py 0000644 00000015604 15053244155 0006573 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Pattern compiler.
The grammar is taken from PatternGrammar.txt.
The compiler compiles a pattern to a pytree.*Pattern instance.
"""
__author__ = "Guido van Rossum <guido@python.org>"
# Python imports
import io
# Fairly local imports
from .pgen2 import driver, literals, token, tokenize, parse, grammar
# Really local imports
from . import pytree
from . import pygram
class PatternSyntaxError(Exception):
pass
def tokenize_wrapper(input):
"""Tokenizes a string suppressing significant whitespace."""
skip = {token.NEWLINE, token.INDENT, token.DEDENT}
tokens = tokenize.generate_tokens(io.StringIO(input).readline)
for quintuple in tokens:
type, value, start, end, line_text = quintuple
if type not in skip:
yield quintuple
class PatternCompiler(object):
def __init__(self, grammar_file=None):
"""Initializer.
Takes an optional alternative filename for the pattern grammar.
"""
if grammar_file is None:
self.grammar = pygram.pattern_grammar
self.syms = pygram.pattern_symbols
else:
self.grammar = driver.load_grammar(grammar_file)
self.syms = pygram.Symbols(self.grammar)
self.pygrammar = pygram.python_grammar
self.pysyms = pygram.python_symbols
self.driver = driver.Driver(self.grammar, convert=pattern_convert)
def compile_pattern(self, input, debug=False, with_tree=False):
"""Compiles a pattern string to a nested pytree.*Pattern object."""
tokens = tokenize_wrapper(input)
try:
root = self.driver.parse_tokens(tokens, debug=debug)
except parse.ParseError as e:
raise PatternSyntaxError(str(e))
if with_tree:
return self.compile_node(root), root
else:
return self.compile_node(root)
def compile_node(self, node):
"""Compiles a node, recursively.
This is one big switch on the node type.
"""
# XXX Optimize certain Wildcard-containing-Wildcard patterns
# that can be merged
if node.type == self.syms.Matcher:
node = node.children[0] # Avoid unneeded recursion
if node.type == self.syms.Alternatives:
# Skip the odd children since they are just '|' tokens
alts = [self.compile_node(ch) for ch in node.children[::2]]
if len(alts) == 1:
return alts[0]
p = pytree.WildcardPattern([[a] for a in alts], min=1, max=1)
return p.optimize()
if node.type == self.syms.Alternative:
units = [self.compile_node(ch) for ch in node.children]
if len(units) == 1:
return units[0]
p = pytree.WildcardPattern([units], min=1, max=1)
return p.optimize()
if node.type == self.syms.NegatedUnit:
pattern = self.compile_basic(node.children[1:])
p = pytree.NegatedPattern(pattern)
return p.optimize()
assert node.type == self.syms.Unit
name = None
nodes = node.children
if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
name = nodes[0].value
nodes = nodes[2:]
repeat = None
if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
repeat = nodes[-1]
nodes = nodes[:-1]
# Now we've reduced it to: STRING | NAME [Details] | (...) | [...]
pattern = self.compile_basic(nodes, repeat)
if repeat is not None:
assert repeat.type == self.syms.Repeater
children = repeat.children
child = children[0]
if child.type == token.STAR:
min = 0
max = pytree.HUGE
elif child.type == token.PLUS:
min = 1
max = pytree.HUGE
elif child.type == token.LBRACE:
assert children[-1].type == token.RBRACE
assert len(children) in (3, 5)
min = max = self.get_int(children[1])
if len(children) == 5:
max = self.get_int(children[3])
else:
assert False
if min != 1 or max != 1:
pattern = pattern.optimize()
pattern = pytree.WildcardPattern([[pattern]], min=min, max=max)
if name is not None:
pattern.name = name
return pattern.optimize()
def compile_basic(self, nodes, repeat=None):
# Compile STRING | NAME [Details] | (...) | [...]
assert len(nodes) >= 1
node = nodes[0]
if node.type == token.STRING:
value = str(literals.evalString(node.value))
return pytree.LeafPattern(_type_of_literal(value), value)
elif node.type == token.NAME:
value = node.value
if value.isupper():
if value not in TOKEN_MAP:
raise PatternSyntaxError("Invalid token: %r" % value)
if nodes[1:]:
raise PatternSyntaxError("Can't have details for token")
return pytree.LeafPattern(TOKEN_MAP[value])
else:
if value == "any":
type = None
elif not value.startswith("_"):
type = getattr(self.pysyms, value, None)
if type is None:
raise PatternSyntaxError("Invalid symbol: %r" % value)
if nodes[1:]: # Details present
content = [self.compile_node(nodes[1].children[1])]
else:
content = None
return pytree.NodePattern(type, content)
elif node.value == "(":
return self.compile_node(nodes[1])
elif node.value == "[":
assert repeat is None
subpattern = self.compile_node(nodes[1])
return pytree.WildcardPattern([[subpattern]], min=0, max=1)
assert False, node
def get_int(self, node):
assert node.type == token.NUMBER
return int(node.value)
# Map named tokens to the type value for a LeafPattern
TOKEN_MAP = {"NAME": token.NAME,
"STRING": token.STRING,
"NUMBER": token.NUMBER,
"TOKEN": None}
def _type_of_literal(value):
if value[0].isalpha():
return token.NAME
elif value in grammar.opmap:
return grammar.opmap[value]
else:
return None
def pattern_convert(grammar, raw_node_info):
"""Converts raw node information to a Node or Leaf instance."""
type, value, context, children = raw_node_info
if children or type in grammar.number2symbol:
return pytree.Node(type, children, context=context)
else:
return pytree.Leaf(type, value, context=context)
def compile_pattern(pattern):
return PatternCompiler().compile_pattern(pattern)
__pycache__/patcomp.cpython-36.opt-1.pyc 0000644 00000012355 15053244155 0014016 0 ustar 00 3
\� � @ s� d Z dZddlZddlmZmZmZmZmZm Z ddl
m Z ddl
m Z G dd � d e
�Zd
d � ZG d d
� d
e�Zejejejdd�Zdd� Zdd� Zdd� ZdS )z�Pattern compiler.
The grammar is taken from PatternGrammar.txt.
The compiler compiles a pattern to a pytree.*Pattern instance.
z#Guido van Rossum <guido@python.org>� N� )�driver�literals�token�tokenize�parse�grammar)�pytree)�pygramc @ s e Zd ZdS )�PatternSyntaxErrorN)�__name__�
__module__� __qualname__� r r �'/usr/lib64/python3.6/lib2to3/patcomp.pyr s r c c sP t jt jt jh}tjtj| �j�}x(|D ] }|\}}}}}||kr(|V q(W dS )z6Tokenizes a string suppressing significant whitespace.N) r �NEWLINE�INDENT�DEDENTr �generate_tokens�io�StringIO�readline) �input�skip�tokensZ quintuple�type�value�start�endZ line_textr r r �tokenize_wrapper s
r c @ s: e Zd Zd
dd�Zddd�Zdd� Zdd d
�Zd d � ZdS )�PatternCompilerNc C sZ |dkrt j| _t j| _ntj|�| _t j| j�| _t j| _ t j
| _ tj | jt
d�| _dS )z^Initializer.
Takes an optional alternative filename for the pattern grammar.
N)Zconvert)r
Zpattern_grammarr Zpattern_symbols�symsr Z load_grammarZSymbolsZpython_grammarZ pygrammarZpython_symbols�pysymsZDriver�pattern_convert)�selfZ grammar_filer r r �__init__( s
zPatternCompiler.__init__Fc C sn t |�}y| jj||d�}W n0 tjk
rL } ztt|���W Y dd}~X nX |r`| j|�|fS | j|�S dS )z=Compiles a pattern string to a nested pytree.*Pattern object.)�debugN)r r Z parse_tokensr Z
ParseErrorr �str� compile_node)r$ r r& Z with_treer �root�er r r �compile_pattern7 s z PatternCompiler.compile_patternc
sV |j � jjkr|jd }|j � jjkrz� fdd�|jddd� D �}t|�dkrX|d S tjdd� |D �ddd�}|j� S |j � jj krʇ fd d�|jD �}t|�dkr�|d S tj|gddd�}|j� S |j � jj
kr�� j |jdd� �}tj |�}|j� S d}|j}t|�d
k�r>|d j t
jk�r>|d j}|dd� }d}t|�dk�rx|d j � jjk�rx|d
}|dd� }� j ||�}|dk �r>|j} | d }
|
j t
jk�r�d} tj} nX|
j t
jk�r�d} tj} n>|
j t
jk�r� j| d � } } t| �d k�r� j| d
�} n | dk�s"| dk�r>|j� }tj|gg| | d�}|dk �rN||_|j� S )zXCompiles a node, recursively.
This is one big switch on the node type.
r c s g | ]}� j |��qS r )r( )�.0�ch)r$ r r �
<listcomp>O s z0PatternCompiler.compile_node.<locals>.<listcomp>N� r c S s g | ]
}|g�qS r r )r, �ar r r r. R s )�min�maxc s g | ]}� j |��qS r )r( )r, r- )r$ r r r. V s � � ���r5 r5 )r r! ZMatcher�childrenZ Alternatives�lenr �WildcardPattern�optimizeZ AlternativeZ NegatedUnit�
compile_basicZNegatedPatternr �EQUALr ZRepeater�STARZHUGE�PLUS�LBRACE�get_int�name)
r$ �nodeZalts�pZunits�patternr@ �nodes�repeatr6 Zchildr1 r2 r )r$ r r( C s^
"
z PatternCompiler.compile_nodec C s@ |d }|j tjkr4ttj|j��}tjt |�|�S |j tj
kr�|j}|j � r�|t krbt
d| ��|dd � rvt
d��tjt | �S |dkr�d }n,|jd�s�t| j|d �}|d kr�t
d| ��|dd � r�| j|d jd �g}nd }tj||�S nH|jdk�r| j|d �S |jd k�r<| j|d �}tj|ggddd
�S d S ) Nr zInvalid token: %rr z Can't have details for token�any�_zInvalid symbol: %r�(�[)r1 r2 )r r �STRINGr' r Z
evalStringr r Z LeafPattern�_type_of_literal�NAME�isupper� TOKEN_MAPr �
startswith�getattrr" r( r6 Z NodePatternr8 )r$ rD rE rA r r Zcontent�
subpatternr r r r: � s8
z PatternCompiler.compile_basicc C s
t |j�S )N)�intr )r$ rA r r r r? � s zPatternCompiler.get_int)N)FF)N)r r
r r% r+ r( r: r? r r r r r & s
G
#r )rL rJ �NUMBERZTOKENc C s. | d j � rtjS | tjkr&tj| S d S d S )Nr )�isalphar rL r Zopmap)r r r r rK � s
rK c C s> |\}}}}|s|| j kr*tj|||d�S tj|||d�S dS )z9Converts raw node information to a Node or Leaf instance.)�contextN)Z
number2symbolr ZNodeZLeaf)r Z
raw_node_infor r rU r6 r r r r# � s r# c C s t � j| �S )N)r r+ )rC r r r r+ � s r+ )�__doc__�
__author__r Zpgen2r r r r r r � r r
� Exceptionr r �objectr rL rJ rS rN rK r# r+ r r r r �<module> s
__pycache__/__main__.cpython-36.opt-1.pyc 0000644 00000000317 15053244155 0014066 0 ustar 00 3
\C � @ s& d dl Z ddlmZ e jed�� dS )� N� )�mainz
lib2to3.fixes)�sysr �exit� r r �(/usr/lib64/python3.6/lib2to3/__main__.py�<module> s __pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000173 15053244155 0014105 0 ustar 00 3
\ � @ s d S )N� r r r �(/usr/lib64/python3.6/lib2to3/__init__.py�<module> s __pycache__/main.cpython-36.opt-2.pyc 0000644 00000015127 15053244155 0013300 0 ustar 00 3
\�- � @ s| d dl mZmZ d dlZd dlZd dlZd dlZd dlZd dlZddl m
Z
dd� Z G dd� de
j �Z
d d
� Zd
d d �ZdS )� )�with_statement�print_functionN� )�refactorc C s( | j � } |j � }tj| |||dddd�S )Nz
(original)z (refactored)� )Zlineterm)�
splitlines�difflibZ unified_diff)�a�b�filename� r �$/usr/lib64/python3.6/lib2to3/main.py�
diff_texts s
r c s: e Zd Zd
� fdd� Zdd� Z� fdd�Zdd � Z� ZS ) �StdoutRefactoringToolr c sR || _ || _|r(|jtj� r(|tj7 }|| _|| _|| _tt | �j
|||� d S )N) � nobackups�
show_diffs�endswith�os�sep�_input_base_dir� _output_dir�_append_suffix�superr �__init__) �selfZfixers�options�explicitr r �input_base_dir�
output_dir�
append_suffix)� __class__r r
r $ s
z StdoutRefactoringTool.__init__c O s* | j j|||f� | jj|f|�|� d S )N)�errors�append�logger�error)r �msg�args�kwargsr r r
� log_errorA s z StdoutRefactoringTool.log_errorc
! s| |}| j rH|j| j�r6tjj| j |t| j�d � �}ntd|| jf ��| jrX|| j7 }||kr�tjj |�}tjj
|� r�|r�tj |� | j d||� | j
�s4|d }tjj|�r�ytj|� W n. tk
r� } z| j d|� W Y d d }~X nX ytj||� W n2 tk
�r2 } z| j d||� W Y d d }~X nX tt| �j} | ||||� | j
�sbtj||� ||k�rxtj||� d S )Nz5filename %s does not start with the input_base_dir %szWriting converted %s to %s.z.bakzCan't remove backup %szCan't rename %s to %s)r �
startswithr r �path�join�len�
ValueErrorr �dirname�isdir�makedirs� log_messager �lexists�remove�OSError�renamer r �
write_file�shutilZcopymode)
r Znew_textr Zold_text�encodingZ
orig_filenamer Zbackup�err�write)r r r
r6 E s@
z StdoutRefactoringTool.write_filec C s� |r| j d|� n�| j d|� | jr�t|||�}yX| jd k rp| j�& x|D ] }t|� qJW tjj� W d Q R X nx|D ] }t|� qvW W n" tk
r� t d|f � d S X d S )NzNo changes to %sz
Refactored %sz+couldn't encode %s's diff for your terminal)
r1 r r Z output_lock�print�sys�stdout�flush�UnicodeEncodeError�warn)r �old�newr ZequalZ
diff_lines�liner r r
� print_outputl s"
z"StdoutRefactoringTool.print_output)r r r )�__name__�
__module__� __qualname__r r( r6 rD �
__classcell__r r )r r
r s 'r c C s t d| f tjd� d S )Nz WARNING: %s)�file)r; r< �stderr)r% r r r
r@ � s r@ c s t jdd�}|jddddd� |jdd d
g d d � |jd
dddddd� |jddd
g dd � |jddddd� |jdddd d� |jd d dd d� |jd dd!d� |jd"d#dd$d� |jd%d&dd'd(d � |jd)d*dd+d,d-d.� |jd/d0dd1d� |jd2dd+d,d3d.� d'}i }|j|�\}}|j�r@d4|d5< |j�s:td6� d4|_|j�r\|j �r\|j d7� |j
�rx|j �rx|j d8� |j �r�|j �r�td9� |j �r�|j�r�|j d:� |j �r�t
d;� x tj� �D ]}t
|� �q�W |�s�d<S |�s t
d=tjd>� t
d?tjd>� d@S dA|k�r4d4}|j�r4t
dBtjd>� d@S |j�rDd4|dC< |j�rRtjntj}tjdD|dE� tjdF�}ttj� ��} t� fdGdH�|jD ��}
t� } |j �r�d'} x2|j D ](}
|
dIk�r�d4} n| j � dJ |
� �q�W | �r�| j | �n| }n
| j | �}|j |
�}t j!j"|�}|�rD|j#t j$� �rDt j!j%|� �rDt j!j&|�}|j�rh|j't j$�}|j(dK|j|� t)t*|�|t*| �|j|j ||j|j
dL�}|j+�s�|�r�|j,� nBy|j||j|j-|j.� W n& tj/k
�r� t
dMtjd>� dS X |j0� t1t2|j+��S )NNz2to3 [options] file|dir ...)Zusagez-dz--doctests_only�
store_truezFix up doctests only)�action�helpz-fz--fixr" z1Each FIX specifies a transformation; default: all)rL �defaultrM z-jz --processesZstorer �intzRun 2to3 concurrently)rL rN �typerM z-xz--nofixz'Prevent a transformation from being runz-lz --list-fixesz List available transformationsz-pz--print-functionz0Modify the grammar so that print() is a functionz-vz --verbosezMore verbose loggingz
--no-diffsz#Don't show diffs of the refactoringz-wz--writezWrite back modified filesz-nz --nobackupsFz&Don't write backups for modified filesz-oz --output-dir�strr zXPut output files in this directory instead of overwriting the input files. Requires -n.)rL rP rN rM z-Wz--write-unchanged-fileszYAlso write files even if no changes were required (useful with --output-dir); implies -w.z --add-suffixzuAppend this string to all output filenames. Requires -n if non-empty. ex: --add-suffix='3' will generate .py3 files.T�write_unchanged_filesz&--write-unchanged-files/-W implies -w.z%Can't use --output-dir/-o without -n.z"Can't use --add-suffix without -n.z@not writing files and not printing diffs; that's not very usefulzCan't use -n without -wz2Available transformations for the -f/--fix option:r z1At least one file or directory argument required.)rI zUse --help to show usage.� �-zCan't write to stdin.r z%(name)s: %(message)s)�format�levelz lib2to3.mainc 3 s | ]}� d | V qdS )z.fix_Nr )�.0�fix)� fixer_pkgr r
� <genexpr>� s zmain.<locals>.<genexpr>�allz.fix_z7Output in %r will mirror the input directory %r layout.)r r r z+Sorry, -j isn't supported on this platform.)3�optparseZ OptionParserZ
add_option�
parse_argsrR r: r@ r r r$ Z
add_suffixZno_diffsZ
list_fixesr; r Zget_all_fix_namesr< rJ r �verbose�logging�DEBUG�INFOZ basicConfigZ getLogger�setZget_fixers_from_packageZnofixrX �add�union�
differencer r* � commonprefixr r r/ r. �rstrip�infor �sortedr! �refactor_stdinZ
doctests_onlyZ processesZMultiprocessingUnsupportedZ summarizerO �bool)rY r& �parserrj �flagsr ZfixnamerV r# Z avail_fixesZunwanted_fixesr Z all_presentrX Z requestedZ fixer_namesr Zrtr )rY r
�main� s�
rn )N)Z
__future__r r r< r r r_ r7 r\ r r r ZMultiprocessRefactoringToolr r@ rn r r r r
�<module> s g __pycache__/btm_utils.cpython-36.opt-2.pyc 0000644 00000011005 15053244155 0014345 0 ustar 00 3
\�& � @ sx d dl mZ d dlmZmZ d dlmZmZ eZeZ ej
Z eZ dZ
dZdZG dd� de�Zdd d
�Zd d � Zd
d� ZdS )� )�pytree)�grammar�token)�pattern_symbols�python_symbols� � c @ s6 e Zd Zd dd�Zdd� Zdd� Zdd � Zd
d � ZdS )
�MinNodeNc C s. || _ || _g | _d| _d | _g | _g | _d S )NF)�type�name�children�leaf�parent� alternatives�group)�selfr
r � r �)/usr/lib64/python3.6/lib2to3/btm_utils.py�__init__ s zMinNode.__init__c C s t | j�d t | j� S )N� )�strr
r )r r r r �__repr__ s zMinNode.__repr__c C s� | }g }x�|r�|j tkr`|jj|� t|j�t|j�krTt|j�g}g |_|j}q
n |j}d }P |j tkr�|j j|� t|j �t|j�kr�t
|j �}g |_ |j}q
n |j}d }P |j t j kr�|j
r�|j|j
� n |j|j � |j}q
W |S )N)r
�TYPE_ALTERNATIVESr �append�lenr �tupler �
TYPE_GROUPr � get_characteristic_subpattern� token_labels�NAMEr )r �node�subpr r r � leaf_to_root! s8
zMinNode.leaf_to_rootc C s& x | j � D ]}|j� }|r
|S q
W d S )N)�leavesr" )r �lr! r r r �get_linear_subpatternK s z MinNode.get_linear_subpatternc c s. x | j D ]}|j� E d H qW | j s*| V d S )N)r r# )r �childr r r r# ` s zMinNode.leaves)NN)�__name__�
__module__� __qualname__r r r" r% r# r r r r r s
*r Nc
C s� d }| j tjkr| jd } | j tjkr�t| j�dkrFt| jd |�}nJttd�}x>| jD ]4}| jj |�d rnqXt||�}|d k rX|jj
|� qXW �n| j tj k�rt| j�dkr�tt d�}x(| jD ] }t||�}|r�|jj
|� q�W |js�d }nt| jd |�}�n�| j tj
k�r�t| jd tj��rH| jd jdk�rHt| jd |�S t| jd tj��rn| jd jdk�s�t| j�dk�r�t| jd d��r�| jd jdk�r�d S d}d }d }d }d } d }
xn| jD ]d}|j tjk�r�d }|}n*|j tjk�r�d}|} n|j tjk�r |}t|d��r�|jd
k�r�d}
�q�W |
�rb| jd } t| d��rl| jdk�rl| jd } n
| jd } | j tjk�r�| jd k�r�ttd�}n4tt| j��r�ttt| j�d�}nttt| j�d�}n\| j tjk�r | jjd
�} | t k�r�tt | d�}nttj| d�}n| j tjk�r$t||�}|�rZ| jd jdk�rBd }n| jd jdk�rVnt �|�r�|d k �r�x8|jdd� D ]&}t||�}|d k �rz|jj
|� �qzW |�r�||_ |S )N� r )r
r �(�[�valueTF�=r �any�')r
r �*�+���) r
�symsZMatcherr Z Alternativesr � reduce_treer r �indexr Z Alternativer ZUnit�
isinstancer ZLeafr- �hasattrZDetailsZRepeaterr r �TYPE_ANY�getattr�pysyms�STRING�strip�tokens�NotImplementedErrorr )
r r Znew_noder& Zreducedr
Z details_nodeZalternatives_nodeZ has_repeaterZ
repeater_nodeZhas_variable_nameZ name_leafr r r r r5 g s�
r5 c s� t | t�s| S t| �dkr"| d S g }g }dddddg�g }d� xl| D ]d}tt|d d
� ��rFtt|� fd d
���r~|j|� qFtt|�fd d
���r�|j|� qF|j|� qFW |r�|} n|r�|} n|r�|} t| td
�S )Nr r* �in�for�if�not�Nonez[]().,:c S s t | �tkS )N)r
r )�xr r r �<lambda>� s z/get_characteristic_subpattern.<locals>.<lambda>c s t | t�o| � kS )N)r7 r )rE )� common_charsr r rF s c s t | t�o| � kS )N)r7 r )rE )� common_namesr r rF s )�key)r7 �listr r/ �rec_testr �max)Z subpatternsZsubpatterns_with_namesZ subpatterns_with_common_namesZ subpatterns_with_common_chars�
subpatternr )rG rH r r � s2
r c c s< x6| D ].}t |ttf�r*t||�E d H q||�V qW d S )N)r7 rJ r rK )ZsequenceZ test_funcrE r r r rK s
rK r3 ������)N)� r Zpgen2r r Zpygramr r r4 r; Zopmapr> r r9 r r �objectr r5 r rK r r r r �<module> s W
% __pycache__/pytree.cpython-36.opt-1.pyc 0000644 00000057601 15053244155 0013666 0 ustar 00 3
\�m � @ s� d Z dZddlZddlZddlmZ dZi add� ZG dd � d e �Z
G d
d � d e
�Z G d d
� d
e
�Z dd� Z
G dd� de �ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�Zdd� ZdS ) z�
Python parse tree definitions.
This is a very concrete parse tree; we need to keep every token and
even the comments and whitespace between tokens.
There's also a pattern matching implementation here.
z#Guido van Rossum <guido@python.org>� N)�StringIOi���c C sH t s<ddlm} x*|jj� D ] \}}t|�tkr |t |< q W t j| | �S )N� )�python_symbols)� _type_reprsZpygramr �__dict__�items�type�int�
setdefault)Ztype_numr �name�val� r
�&/usr/lib64/python3.6/lib2to3/pytree.py� type_repr s r c @ s� e Zd ZdZdZdZf ZdZdZdd� Z dd� Z
dZ dd � Z d
d � Z
d d
� Zdd� Zdd� Zdd� Zdd� Zdd� Zedd� �Zedd� �Zd d � Zd d � Zd d!� Zejd&k r�d$d%� Z dS )'�Basez�
Abstract base class for Node and Leaf.
This provides some default functionality and boilerplate using the
template pattern.
A node may be a subnode of at most one parent.
NFc O s
t j| �S )z7Constructor that prevents Base from being instantiated.)�object�__new__)�cls�args�kwdsr
r
r r 2 s z Base.__new__c C s | j |j k rtS | j|�S )zW
Compare two nodes for equality.
This calls the method _eq().
)� __class__�NotImplemented�_eq)�self�otherr
r
r �__eq__7 s z Base.__eq__c C s t �dS )a_
Compare two nodes for equality.
This is called by __eq__ and __ne__. It is only called if the two nodes
have the same type. This must be implemented by the concrete subclass.
Nodes should be considered equal if they have the same structure,
ignoring the prefix string and other context information.
N)�NotImplementedError)r r r
r
r r C s zBase._eqc C s t �dS )zr
Return a cloned (deep) copy of self.
This must be implemented by the concrete subclass.
N)r )r r
r
r �cloneN s z
Base.clonec C s t �dS )zx
Return a post-order iterator for the tree.
This must be implemented by the concrete subclass.
N)r )r r
r
r �
post_orderV s zBase.post_orderc C s t �dS )zw
Return a pre-order iterator for the tree.
This must be implemented by the concrete subclass.
N)r )r r
r
r � pre_order^ s zBase.pre_orderc C s� t |t�s|g}g }d}x:| jjD ].}|| krF|dk r@|j|� d}q"|j|� q"W | jj� || j_x|D ] }| j|_qlW d| _dS )z/Replace this node with a new one in the parent.FNT)�
isinstance�list�parent�children�extend�append�changed)r �newZ
l_children�found�ch�xr
r
r �replacef s
z Base.replacec C s. | }x"t |t�s&|jsdS |jd }qW |jS )z9Return the line number which generated the invocant node.Nr )r �Leafr# �lineno)r �noder
r
r �
get_lineno} s zBase.get_linenoc C s | j r| j j� d| _d S )NT)r" r& � was_changed)r r
r
r r& � s
z Base.changedc C sJ | j rFx>t| j j�D ].\}}|| kr| j j� | j j|= d| _ |S qW dS )z�
Remove the node from the tree. Returns the position of the node in its
parent's children before it was removed.
N)r" � enumerater# r& )r �ir. r
r
r �remove� s
z Base.removec C sZ | j dkrdS xFt| j j�D ]6\}}|| kr y| j j|d S tk
rP dS X q W dS )z�
The node immediately following the invocant in their parent's children
list. If the invocant does not have a next sibling, it is None
Nr )r" r1 r# �
IndexError)r r2 �childr
r
r � next_sibling� s
zBase.next_siblingc C sP | j dkrdS x<t| j j�D ],\}}|| kr |dkr8dS | j j|d S q W dS )z�
The node immediately preceding the invocant in their parent's children
list. If the invocant does not have a previous sibling, it is None.
Nr r )r" r1 r# )r r2 r5 r
r
r � prev_sibling� s
zBase.prev_siblingc c s" x | j D ]}|j� E d H qW d S )N)r# �leaves)r r5 r
r
r r8 � s z Base.leavesc C s | j d krdS d| j j� S )Nr r )r" �depth)r r
r
r r9 � s
z
Base.depthc C s | j }|dkrdS |jS )z�
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
N� )r6 �prefix)r Znext_sibr
r
r �
get_suffix� s zBase.get_suffix� r c C s t | �jd�S )N�ascii)�str�encode)r r
r
r �__str__� s z Base.__str__)r= r ) �__name__�
__module__� __qualname__�__doc__r r" r# r0 Z was_checkedr r �__hash__r r r r r+ r/ r& r3 �propertyr6 r7 r8 r9 r< �sys� version_inforA r
r
r
r r s0
r c @ s� e Zd ZdZd dd�Zdd� Zdd� Zejd kr4eZ d d � Z
d
d� Z dd� Z dd� Z
dd� Zdd� Zeee�Zdd� Zdd� Zdd � ZdS ) �Nodez+Concrete implementation for interior nodes.Nc C sR || _ t|�| _x| jD ]
}| |_qW |dk r4|| _|rH|dd� | _nd| _dS )z�
Initializer.
Takes a type constant (a symbol number >= 256), a sequence of
child nodes, and an optional context keyword argument.
As a side effect, the parent pointers of the children are updated.
N)r r! r# r" r; �fixers_applied)r r r# �contextr; rK r) r
r
r �__init__� s
z
Node.__init__c C s d| j jt| j�| jf S )z)Return a canonical string representation.z
%s(%s, %r))r rB r r r# )r r
r
r �__repr__� s z
Node.__repr__c C s dj tt| j��S )zk
Return a pretty string representation.
This reproduces the input source exactly.
r: )�join�mapr? r# )r r
r
r � __unicode__� s zNode.__unicode__r= r c C s | j | jf|j |jfkS )z Compare two nodes for equality.)r r# )r r r
r
r r � s zNode._eqc C s t | jdd� | jD �| jd�S )z$Return a cloned (deep) copy of self.c S s g | ] }|j � �qS r
)r )�.0r) r
r
r �
<listcomp> s z Node.clone.<locals>.<listcomp>)rK )rJ r r# rK )r r
r
r r s z
Node.clonec c s( x | j D ]}|j� E dH qW | V dS )z*Return a post-order iterator for the tree.N)r# r )r r5 r
r
r r s zNode.post_orderc c s( | V x | j D ]}|j� E dH qW dS )z)Return a pre-order iterator for the tree.N)r# r )r r5 r
r
r r
s zNode.pre_orderc C s | j s
dS | j d jS )zO
The whitespace and comments preceding this node in the input.
r: r )r# r; )r r
r
r �_prefix_getter s zNode._prefix_getterc C s | j r|| j d _d S )Nr )r# r; )r r; r
r
r �_prefix_setter s zNode._prefix_setterc C s( | |_ d| j| _ || j|< | j� dS )z�
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N)r" r# r& )r r2 r5 r
r
r � set_child! s
zNode.set_childc C s | |_ | jj||� | j� dS )z�
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N)r" r# �insertr& )r r2 r5 r
r
r � insert_child+ s zNode.insert_childc C s | |_ | jj|� | j� dS )z�
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N)r" r# r% r& )r r5 r
r
r � append_child4 s zNode.append_child)NNN)r= r )rB rC rD rE rM rN rQ rH rI rA r r r r rT rU rG r; rV rX rY r
r
r
r rJ � s$
rJ c @ s� e Zd ZdZdZdZdZddg fdd�Zdd� Zd d
� Z e
j dkrFe Z d d
� Z
dd� Zdd� Zdd� Zdd� Zdd� Zdd� Zeee�ZdS )r, z'Concrete implementation for leaf nodes.r: r Nc C sF |dk r|\| _ \| _| _|| _|| _|dk r4|| _ |dd� | _dS )z�
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
N)�_prefixr- �columnr �valuerK )r r r\ rL r; rK r
r
r rM G s z
Leaf.__init__c C s d| j j| j| jf S )z)Return a canonical string representation.z
%s(%r, %r))r rB r r\ )r r
r
r rN Z s z
Leaf.__repr__c C s | j t| j� S )zk
Return a pretty string representation.
This reproduces the input source exactly.
)r; r? r\ )r r
r
r rQ ` s zLeaf.__unicode__r= c C s | j | jf|j |jfkS )z Compare two nodes for equality.)r r\ )r r r
r
r r k s zLeaf._eqc C s$ t | j| j| j| j| jff| jd�S )z$Return a cloned (deep) copy of self.)rK )r, r r\ r; r- r[ rK )r r
r
r r o s
z
Leaf.clonec c s
| V d S )Nr
)r r
r
r r8 u s z Leaf.leavesc c s
| V dS )z*Return a post-order iterator for the tree.Nr
)r r
r
r r x s zLeaf.post_orderc c s
| V dS )z)Return a pre-order iterator for the tree.Nr
)r r
r
r r | s zLeaf.pre_orderc C s | j S )zP
The whitespace and comments preceding this token in the input.
)rZ )r r
r
r rT � s zLeaf._prefix_getterc C s | j � || _d S )N)r& rZ )r r; r
r
r rU � s zLeaf._prefix_setter)r= r )rB rC rD rE rZ r- r[ rM rN rQ rH rI rA r r r8 r r rT rU rG r; r
r
r
r r, > s&
r, c C sN |\}}}}|s|| j kr<t|�dkr.|d S t|||d�S t|||d�S dS )z�
Convert raw node information to a Node or Leaf instance.
This is passed to the parser driver which calls it whenever a reduction of a
grammar rule produces a new complete node, so that the tree is build
strictly bottom-up.
r r )rL N)Z
number2symbol�lenrJ r, )ZgrZraw_noder r\ rL r# r
r
r �convert� s r^ c @ sP e Zd ZdZdZdZdZdd� Zdd� Zdd� Z dd d
�Z
dd d �Z d
d� Z dS )� BasePatterna�
A pattern is a tree matching pattern.
It looks for a specific node type (token or symbol), and
optionally for a specific content.
This is an abstract base class. There are three concrete
subclasses:
- LeafPattern matches a single leaf node;
- NodePattern matches a single node (usually non-leaf);
- WildcardPattern matches a sequence of nodes of variable length.
Nc O s
t j| �S )z>Constructor that prevents BasePattern from being instantiated.)r r )r r r r
r
r r � s zBasePattern.__new__c C sL t | j�| j| jg}x|r.|d d kr.|d= qW d| jjdjtt|��f S )Nr z%s(%s)z, ���r` ) r r �contentr r rB rO rP �repr)r r r
r
r rN � s
zBasePattern.__repr__c C s | S )z�
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
r
)r r
r
r �optimize� s zBasePattern.optimizec C sn | j dk r|j | j krdS | jdk rRd}|dk r4i }| j||�sDdS |rR|j|� |dk rj| jrj||| j< dS )a#
Does this pattern exactly match a node?
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
Default implementation for non-wildcard patterns.
NFT)r ra � _submatch�updater )r r. �results�rr
r
r �match� s
zBasePattern.matchc C s t |�dkrdS | j|d |�S )z�
Does this pattern exactly match a sequence of nodes?
Default implementation for non-wildcard patterns.
r Fr )r] rh )r �nodesrf r
r
r � match_seq� s zBasePattern.match_seqc c s& i }|r"| j |d |�r"d|fV dS )z}
Generator yielding all matches for this pattern.
Default implementation for non-wildcard patterns.
r r N)rh )r ri rg r
r
r �generate_matches� s z BasePattern.generate_matches)N)N)
rB rC rD rE r ra r r rN rc rh rj rk r
r
r
r r_ � s
r_ c @ s* e Zd Zddd�Zd dd�Zd
dd�ZdS ) � LeafPatternNc C s& |dk r|dk r|| _ || _|| _dS )ap
Initializer. Takes optional type, content, and name.
The type, if given must be a token type (< 256). If not given,
this matches any *leaf* node; the content may still be required.
The content, if given, must be a string.
If a name is given, the matching node is stored in the results
dict under that key.
N)r ra r )r r ra r r
r
r rM � s
zLeafPattern.__init__c C s t |t�sdS tj| ||�S )z*Override match() to insist on a leaf node.F)r r, r_ rh )r r. rf r
r
r rh s
zLeafPattern.matchc C s | j |jkS )a�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
)ra r\ )r r. rf r
r
r rd s
zLeafPattern._submatch)NNN)N)N)rB rC rD rM rh rd r
r
r
r rl � s
rl c @ s$ e Zd ZdZddd�Zddd�ZdS ) � NodePatternFNc C sT |dk r|dk r>t |�}x$t|�D ]\}}t|t�r"d| _q"W || _|| _|| _dS )ad
Initializer. Takes optional type, content, and name.
The type, if given, must be a symbol type (>= 256). If the
type is None this matches *any* single node (leaf or not),
except if content is not None, in which it only matches
non-leaf nodes that also match the content pattern.
The content, if not None, must be a sequence of Patterns that
must match the node's children exactly. If the content is
given, the type must not be None.
If a name is given, the matching node is stored in the results
dict under that key.
NT)r! r1 r �WildcardPattern� wildcardsr ra r )r r ra r r2 �itemr
r
r rM % s
zNodePattern.__init__c C s� | j rJx>t| j|j�D ],\}}|t|j�kr|dk r>|j|� dS qW dS t| j�t|j�krbdS x*t| j|j�D ]\}}|j||�srdS qrW dS )a�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
NTF)ro rk ra r# r] re �ziprh )r r. rf �crg �
subpatternr5 r
r
r rd B s
zNodePattern._submatch)NNN)N)rB rC rD ro rM rd r
r
r
r rm ! s
rm c @ s^ e Zd ZdZddedfdd�Zdd� Zddd �Zdd
d �Zd d
� Z dd� Z
dd� Z dd� Z dS )rn a
A wildcard pattern can match zero or more nodes.
This has all the flexibility needed to implement patterns like:
.* .+ .? .{m,n}
(a b c | d e | f)
(...)* (...)+ (...)? (...){m,n}
except it always uses non-greedy matching.
Nr c C s@ |dk r$t tt |��}x |D ]}q W || _|| _|| _|| _dS )a�
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optional minimum number of times to match, default 0
max: optional maximum number of times to match, default HUGE
name: optional name assigned to this match
[*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is
equivalent to (a b c | d e | f g h); if content is None,
this is equivalent to '.' in regular expression terms.
The min and max parameters work as follows:
min=0, max=maxint: .*
min=1, max=maxint: .+
min=0, max=1: .?
min=1, max=1: .
If content is not None, replace the dot with the parenthesized
list of alternatives, e.g. (a b c | d e | f g h)*
N)�tuplerP ra �min�maxr )r ra ru rv r �altr
r
r rM l s
zWildcardPattern.__init__c C s� d}| j dk r<t| j �dkr<t| j d �dkr<| j d d }| jdkr�| jdkr�| j dkrft| jd�S |dk r�| j|jkr�|j� S | jdkr�t|t�r�|jdkr�| j|jkr�t|j | j|j | j|j |j�S | S )z+Optimize certain stacked wildcard patterns.Nr r )r ) ra r] ru rv rm r rc r rn )r rs r
r
r rc � s
zWildcardPattern.optimizec C s | j |g|�S )z'Does this pattern exactly match a node?)rj )r r. rf r
r
r rh � s zWildcardPattern.matchc C sR xL| j |�D ]>\}}|t|�kr |dk rF|j|� | jrFt|�|| j< dS q W dS )z4Does this pattern exactly match a sequence of nodes?NTF)rk r] re r r! )r ri rf rr rg r
r
r rj � s
zWildcardPattern.match_seqc c s: | j dkrXxJt| jdtt|�| j� �D ]*}i }| jrH|d|� || j< ||fV q(W n�| jdkrp| j|�V n�ttd�r�tj }t
� t_ z�y@x:| j |d�D ]*\}}| jr�|d|� || j< ||fV q�W W nR t k
�r x:| j
|�D ],\}}| j�r
|d|� || j< ||fV q�W Y nX W dttd��r4|t_ X dS )a"
Generator yielding matches for a sequence of nodes.
Args:
nodes: sequence of nodes
Yields:
(count, results) tuples where:
count: the match comprises nodes[:count];
results: dict containing named submatches.
Nr Z bare_name� getrefcountr )ra �rangeru r] rv r �_bare_name_matches�hasattrrH �stderrr �_recursive_matches� RuntimeError�_iterative_matches)r ri �countrg Z save_stderrr
r
r rk � s.
"
z WildcardPattern.generate_matchesc c s t |�}d| jkr di fV g }x>| jD ]4}x.t||�D ] \}}||fV |j||f� q8W q(W x�|�rg }x�|D ]�\}} ||k rr|| jkrrxn| jD ]d}x^t|||d� �D ]H\}
} |
dkr�i }|j| � |j| � ||
|fV |j||
|f� q�W q�W qrW |}qbW dS )z(Helper to iteratively yield the matches.r N)r] ru ra rk r% rv re ) r ri Znodelenrf rw rr rg Z new_results�c0�r0�c1�r1r
r
r r � s*
z"WildcardPattern._iterative_matchesc C sx d}i }d}t |�}xH| r\||k r\d}x0| jD ]&}|d j|| |�r0|d7 }d}P q0W qW |d|� || j< ||fS )z(Special optimized matcher for bare_name.r FTr N)r] ra rh r )r ri r� rg �donerv Zleafr
r
r rz � s
z"WildcardPattern._bare_name_matchesc c s� || j krdi fV || jk r�xr| jD ]h}xbt||�D ]T\}}xJ| j||d� |d �D ].\}}i }|j|� |j|� || |fV qXW q6W q&W dS )z(Helper to recursively yield the matches.r Nr )ru rv ra rk r} re ) r ri r� rw r� r� r� r� rg r
r
r r} s
"
z"WildcardPattern._recursive_matches)N)N)
rB rC rD rE �HUGErM rc rh rj rk r rz r} r
r
r
r rn ^ s #
- rn c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �NegatedPatternNc C s |dk r|| _ dS )a
Initializer.
The argument is either a pattern or None. If it is None, this
only matches an empty sequence (effectively '$' in regex
lingo). If it is not None, this matches whenever the argument
pattern doesn't have any matches.
N)ra )r ra r
r
r rM s zNegatedPattern.__init__c C s dS )NFr
)r r. r
r
r rh ) s zNegatedPattern.matchc C s t |�dkS )Nr )r] )r ri r
r
r rj - s zNegatedPattern.match_seqc c sL | j d kr"t|�dkrHdi fV n&x| j j|�D ]
\}}d S W di fV d S )Nr )ra r] rk )r ri rr rg r
r
r rk 1 s
z NegatedPattern.generate_matches)N)rB rC rD rM rh rj rk r
r
r
r r� s
r� c c s� | sdi fV n�| d | dd� }}xl|j |�D ]^\}}|sJ||fV q2xDt |||d� �D ].\}}i }|j|� |j|� || |fV q^W q2W dS )aR
Generator yielding matches for a sequence of patterns and nodes.
Args:
patterns: a sequence of patterns
nodes: a sequence of nodes
Yields:
(count, results) tuples where:
count: the entire sequence of patterns matches nodes[:count];
results: dict containing named submatches.
r r N)rk re ) Zpatternsri �p�restr� r� r� r� rg r
r
r rk = s
rk )rE �
__author__rH �warnings�ior r� r r r r rJ r, r^ r_ rl rm rn r� rk r
r
r
r �<module> s&
1nNV,= =# __pycache__/pygram.cpython-36.pyc 0000644 00000002232 15053244155 0012704 0 ustar 00 3
\� � @ s� d Z ddlZddlmZ ddlmZ ddlmZ ejjejj e
�d�Z ejjejj e
�d�Z G d d
� d
e
�Zejd e �Zee�Zej� Zejd = ejd e �Zee�ZdS )
z&Export the Python grammar and symbols.� N� )�token)�driver)�pytreez Grammar.txtzPatternGrammar.txtc @ s e Zd Zdd� ZdS )�Symbolsc C s( x"|j j� D ]\}}t| ||� q W dS )z�Initializer.
Creates an attribute for each grammar symbol (nonterminal),
whose value is the symbol's type (an int >= 256).
N)Z
symbol2number�items�setattr)�selfZgrammar�nameZsymbol� r �&/usr/lib64/python3.6/lib2to3/pygram.py�__init__ s zSymbols.__init__N)�__name__�
__module__� __qualname__r
r r r r r s r Zlib2to3�print)�__doc__�osZpgen2r r � r �path�join�dirname�__file__Z
_GRAMMAR_FILEZ_PATTERN_GRAMMAR_FILE�objectr Zload_packaged_grammarZpython_grammarZpython_symbols�copyZ!python_grammar_no_print_statement�keywordsZpattern_grammarZpattern_symbolsr r r r �<module> s __pycache__/patcomp.cpython-36.opt-2.pyc 0000644 00000011357 15053244155 0014020 0 ustar 00 3
\� � @ s� d Z ddlZddlmZmZmZmZmZmZ ddl m
Z
ddl m Z G dd� de �Z
d d
� ZG d d � d e�Zejejejdd
�Zdd� Zdd� Zdd� ZdS )z#Guido van Rossum <guido@python.org>� N� )�driver�literals�token�tokenize�parse�grammar)�pytree)�pygramc @ s e Zd ZdS )�PatternSyntaxErrorN)�__name__�
__module__� __qualname__� r r �'/usr/lib64/python3.6/lib2to3/patcomp.pyr s r c c sP t jt jt jh}tjtj| �j�}x(|D ] }|\}}}}}||kr(|V q(W d S )N) r �NEWLINE�INDENT�DEDENTr �generate_tokens�io�StringIO�readline) �input�skip�tokensZ quintuple�type�value�start�endZ line_textr r r �tokenize_wrapper s
r c @ s: e Zd Zd
dd�Zddd�Zdd� Zdd d
�Zd d � ZdS )�PatternCompilerNc C sZ |d krt j| _t j| _ntj|�| _t j| j�| _t j| _ t j
| _ tj | jt
d�| _d S )N)Zconvert)r
Zpattern_grammarr Zpattern_symbols�symsr Z load_grammarZSymbolsZpython_grammarZ pygrammarZpython_symbols�pysymsZDriver�pattern_convert)�selfZ grammar_filer r r �__init__( s
zPatternCompiler.__init__Fc C sn t |�}y| jj||d�}W n0 tjk
rL } ztt|���W Y d d }~X nX |r`| j|�|fS | j|�S d S )N)�debug)r r Z parse_tokensr Z
ParseErrorr �str� compile_node)r$ r r& Z with_treer �root�er r r �compile_pattern7 s z PatternCompiler.compile_patternc
sV |j � jjkr|jd }|j � jjkrz� fdd�|jd d d� D �}t|�dkrX|d S tjdd� |D �ddd�}|j� S |j � jj krʇ fdd�|jD �}t|�dkr�|d S tj|gddd�}|j� S |j � jj
kr�� j |jdd � �}tj |�}|j� S d }|j}t|�d k�r>|d j t
jk�r>|d j}|dd � }d }t|�dk�rx|d j � jjk�rx|d }|d d
� }� j ||�}|d k �r>|j} | d }
|
j t
jk�r�d} tj} nX|
j t
jk�r�d} tj} n>|
j t
jk�r� j| d � } } t| �d
k�r� j| d �} n | dk�s"| dk�r>|j� }tj|gg| | d�}|d k �rN||_|j� S )Nr c s g | ]}� j |��qS r )r( )�.0�ch)r$ r r �
<listcomp>O s z0PatternCompiler.compile_node.<locals>.<listcomp>� r c S s g | ]
}|g�qS r r )r, �ar r r r. R s )�min�maxc s g | ]}� j |��qS r )r( )r, r- )r$ r r r. V s � � ���r5 r5 )r r! ZMatcher�childrenZ Alternatives�lenr �WildcardPattern�optimizeZ AlternativeZ NegatedUnit�
compile_basicZNegatedPatternr �EQUALr ZRepeater�STARZHUGE�PLUS�LBRACE�get_int�name)
r$ �nodeZalts�pZunits�patternr@ �nodes�repeatr6 Zchildr1 r2 r )r$ r r( C s^
"
z PatternCompiler.compile_nodec C s@ |d }|j tjkr4ttj|j��}tjt |�|�S |j tj
kr�|j}|j � r�|t krbt
d| ��|dd � rvt
d��tjt | �S |dkr�d }n,|jd�s�t| j|d �}|d kr�t
d| ��|dd � r�| j|d jd �g}nd }tj||�S nH|jdk�r| j|d �S |jd k�r<| j|d �}tj|ggddd
�S d S ) Nr zInvalid token: %rr z Can't have details for token�any�_zInvalid symbol: %r�(�[)r1 r2 )r r �STRINGr' r Z
evalStringr r Z LeafPattern�_type_of_literal�NAME�isupper� TOKEN_MAPr �
startswith�getattrr" r( r6 Z NodePatternr8 )r$ rD rE rA r r Zcontent�
subpatternr r r r: � s8
z PatternCompiler.compile_basicc C s
t |j�S )N)�intr )r$ rA r r r r? � s zPatternCompiler.get_int)N)FF)N)r r
r r% r+ r( r: r? r r r r r & s
G
#r )rL rJ �NUMBERZTOKENc C s. | d j � rtjS | tjkr&tj| S d S d S )Nr )�isalphar rL r Zopmap)r r r r rK � s
rK c C s> |\}}}}|s|| j kr*tj|||d�S tj|||d�S d S )N)�context)Z
number2symbolr ZNodeZLeaf)r Z
raw_node_infor r rU r6 r r r r# � s r# c C s t � j| �S )N)r r+ )rC r r r r+ � s r+ )�
__author__r Zpgen2r r r r r r � r r
� Exceptionr r �objectr rL rJ rS rN rK r# r+ r r r r �<module> s
__pycache__/refactor.cpython-36.pyc 0000644 00000050467 15053244155 0013227 0 ustar 00 3
\=m � @ s< d Z dZddlZddlZddlZddlZddlZddlZddlm Z ddl
m Z m Z m
Z
ddlmZ ddlmZmZ dd lmZ d&d d �ZG d
d� de�Zdd� Zdd� Zdd� Zdd� Zej d'k r�ddl Z e j Z dd� Z dd� Z!n e Z eZ eZ!d d � Z"G d d � d e�Z#G d d!� d!e$�Z%G d"d#� d#e�Z&G d$d%� d%e%�Z'dS )(z�Refactoring framework.
Used as a main program, this can refactor any number of files and/or
recursively descend down directories. Imported as a module, this
provides infrastructure to write your own refactoring tool.
z#Guido van Rossum <guido@python.org>� N)�chain� )�driver�tokenize�token)� find_root)�pytree�pygram)� btm_matcherTc C st t | g g dg�}tjj|j�}g }xLttj|��D ]:}|jd�r2|jd�r2|rZ|dd� }|j |dd� � q2W |S )zEReturn a sorted list of all available fix names in the given package.�*�fix_z.py� N� ���)
�
__import__�os�path�dirname�__file__�sorted�listdir�
startswith�endswith�append)Z fixer_pkgZ
remove_prefixZpkgZ fixer_dirZ fix_names�name� r �(/usr/lib64/python3.6/lib2to3/refactor.py�get_all_fix_names s r c @ s e Zd ZdS )�
_EveryNodeN)�__name__�
__module__� __qualname__r r r r r + s r c C s� t | tjtjf�r(| jdkr t�| jhS t | tj�rH| jrDt| j�S t�t | tj �r�t
� }x*| jD ] }x|D ]}|j t|�� qlW qbW |S t d| ��dS )zf Accepts a pytree Pattern Node and returns a set
of the pattern types which will match first. Nz$Oh no! I don't understand pattern %s)
�
isinstancer Z NodePatternZ LeafPattern�typer ZNegatedPatternZcontent�_get_head_typesZWildcardPattern�set�update� Exception)Zpat�r�p�xr r r r$ / s
r$ c C s� t jt�}g }x�| D ]|}|jrjyt|j�}W n tk
rJ |j|� Y q�X xB|D ]}|| j|� qRW q|jdk r�||j j|� q|j|� qW x,tt j
j j � t j
j
�D ]}|| j|� q�W t|�S )z^ Accepts a list of fixers and returns a dictionary
of head node type --> fixer list. N)� collections� defaultdict�list�patternr$ r r Z _accept_typer r �python_grammarZ
symbol2number�values�tokens�extend�dict)Z
fixer_listZ
head_nodesZevery�fixerZheadsZ node_typer r r �_get_headnode_dictK s"
r5 c s � fdd�t � d�D �S )zN
Return the fully qualified names for fixers in the package pkg_name.
c s g | ]}� d | �qS )�.r )�.0�fix_name)�pkg_namer r �
<listcomp>h s z+get_fixers_from_package.<locals>.<listcomp>F)r )r9 r )r9 r �get_fixers_from_packaged s
r; c C s | S )Nr )�objr r r � _identityk s r= r c C s | j dd�S )Nz
�
)�replace)�inputr r r �_from_system_newlinesr s rA c C s t jdkr| jdt j�S | S d S )Nr> )r �linesepr? )r@ r r r �_to_system_newlinest s
rC c sT d}t jtj| �j�� � fdd�}ttjt jtj h�}t
� }y�x�|� \}}||krVq@q@|tj krl|rfP d}q@|tj ko||dk�r,|� \}}|tj ks�|dkr�P |� \}}|tj ks�|dkr�P |� \}}|tj
kr�|dkr�|� \}}xJ|tj k�r(|j|� |� \}}|tj
k�s|d k�r P |� \}}q�W q@P q@W W n tk
�rJ Y nX t|�S )
NFc s t � �} | d | d fS )Nr r )�next)�tok)�genr r �advance� s z(_detect_future_features.<locals>.advanceT�fromZ
__future__�import�(�,)r �generate_tokens�io�StringIO�readline� frozensetr �NEWLINE�NL�COMMENTr% �STRING�NAME�OP�add�
StopIteration)�sourceZhave_docstringrG �ignore�features�tp�valuer )rF r �_detect_future_features sD
r^ c @ s e Zd ZdZdS )�
FixerErrorz A fixer could not be loaded.N)r r r! �__doc__r r r r r_ � s r_ c @ s� e Zd Zddd�ZdZdZd4dd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d5dd�Z d6dd�Z
dd� Zd7dd�Zdd� Zd8d d �Zd d � Zd d!� Zd9d"d#�Zd:d$d%�Zd&Zd'Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Z d2d3� Z dS );�RefactoringToolF)�print_function�write_unchanged_filesZFixr Nc C s2 || _ |p g | _| jj� | _|dk r0| jj|� | jd rDtj| _ntj | _| jj
d�| _ g | _ t
jd�| _g | _d| _tj| jtj| jd�| _| j� \| _| _g | _tj� | _ g | _ g | _ xXt | j| j�D ]F}|j r�| j j!|� q�|| jkr�| j j"|� q�|| jkr�| j j"|� q�W t#| j �| _$t#| j �| _%dS )z�Initializer.
Args:
fixer_names: a list of fixers to import
options: a dict with configuration.
explicit: a list of fixers to run even if they are explicit.
Nrb rc ra F)�convert�logger)&�fixers�explicit�_default_options�copy�optionsr& r �!python_grammar_no_print_statement�grammarr/ �getrc �errors�loggingZ getLoggerre � fixer_log�wroter ZDriverr rd �
get_fixers� pre_order�
post_order�files�bmZ
BottomMatcher�BMZ
bmi_pre_orderZbmi_post_orderr Z
BM_compatibleZ add_fixerr r5 �bmi_pre_order_heads�bmi_post_order_heads)�selfZ fixer_namesrj rg r4 r r r �__init__� s<
zRefactoringTool.__init__c C s\ g }g }�x&| j D �]}t|i i dg�}|jdd�d }|j| j�rV|t| j�d� }|jd�}| jdjdd� |D �� }yt ||�}W n$ t
k
r� t d ||f ��Y nX || j | j
�} | jr�| jd
k r�|| jkr�| jd |� q| jd |� | jd
k�r|j| � q| jdk�r |j| � qt d| j ��qW tjd�}
|j|
d� |j|
d� ||fS )a Inspects the options to load the requested patterns and handlers.
Returns:
(pre_order, post_order), where pre_order is the list of fixers that
want a pre-order AST traversal, and post_order is the list that want
post-order traversal.
r r6 r N�_� c S s g | ] }|j � �qS r )�title)r7 r) r r r r: � s z.RefactoringTool.get_fixers.<locals>.<listcomp>zCan't find %s.%sTzSkipping optional fixer: %szAdding transformation: %sZpreZpostzIllegal fixer order: %rZ run_order)�key���)rf r �rsplitr � FILE_PREFIX�len�split� CLASS_PREFIX�join�getattr�AttributeErrorr_ rj rp rg � log_message� log_debug�orderr �operator�
attrgetter�sort) rz Zpre_order_fixersZpost_order_fixersZ fix_mod_path�modr8 �parts�
class_nameZ fix_classr4 Zkey_funcr r r rr � s8
zRefactoringTool.get_fixersc O s � dS )z Called when an error occurs.Nr )rz �msg�args�kwdsr r r � log_error s zRefactoringTool.log_errorc G s |r || }| j j|� dS )zHook to log a message.N)re �info)rz r� r� r r r r� s zRefactoringTool.log_messagec G s |r || }| j j|� d S )N)re �debug)rz r� r� r r r r� s zRefactoringTool.log_debugc C s dS )zTCalled with the old version, new version, and filename of a
refactored file.Nr )rz �old_text�new_text�filename�equalr r r � print_output s z RefactoringTool.print_outputc C s< x6|D ].}t jj|�r&| j|||� q| j|||� qW dS )z)Refactor a list of files and directories.N)r r �isdir� refactor_dir�
refactor_file)rz �items�write�
doctests_onlyZ dir_or_filer r r �refactor# s
zRefactoringTool.refactorc
C s� t jd }x�t j|�D ]�\}}}| jd|� |j� |j� xH|D ]@}|jd� rBt jj|�d |krBt jj||�} | j | ||� qBW dd� |D �|dd�< qW dS )z�Descends down a directory and refactor every Python file found.
Python files are assumed to have a .py extension.
Files and subdirectories starting with '.' are skipped.
�pyzDescending into %sr6 r c S s g | ]}|j d �s|�qS )r6 )r )r7 Zdnr r r r: > s z0RefactoringTool.refactor_dir.<locals>.<listcomp>N)
r �extsep�walkr� r� r r �splitextr� r� )
rz Zdir_namer� r� Zpy_ext�dirpathZdirnames� filenamesr �fullnamer r r r� , s
z RefactoringTool.refactor_dirc C s� yt |d�}W n. tk
r< } z| jd||� dS d}~X nX ztj|j�d }W d|j� X t|d|d��}t|j � �|fS Q R X dS )zG
Do our best to decode a Python source file correctly.
�rbzCan't open %s: %sNr r( )�encoding)NN)
�open�OSErrorr� r �detect_encodingrO �close�_open_with_encodingrA �read)rz r� �f�errr� r r r �_read_python_source@ s
z#RefactoringTool._read_python_sourcec C s� | j |�\}}|dkrdS |d7 }|rn| jd|� | j||�}| jsL||kr`| j|||||� q�| jd|� nH| j||�}| js�|r�|jr�| jt|�dd� |||d� n | jd|� dS ) zRefactors a file.Nr> zRefactoring doctests in %szNo doctest changes in %sr )r� r� zNo changes in %sr� )r� r� �refactor_docstringrc �processed_file�refactor_string� was_changed�str)rz r� r� r� r@ r� �output�treer r r r� P s z RefactoringTool.refactor_filec C s� t |�}d|krtj| j_zJy| jj|�}W n4 tk
r` } z| jd||jj |� dS d}~X nX W d| j| j_X ||_
| j d|� | j ||� |S )aF Refactor a given input string.
Args:
data: a string holding the code to be refactored.
name: a human-readable name for use in error/log messages.
Returns:
An AST corresponding to the refactored input stream; None if
there were errors during the parse.
rb zCan't parse %s: %s: %sNzRefactoring %s)
r^ r rk r rl Z parse_stringr' r� � __class__r �future_featuresr� �
refactor_tree)rz �datar r[ r� r� r r r r� g s
z RefactoringTool.refactor_stringc C s� t jj� }|rN| jd� | j|d�}| js2||krB| j|d|� q�| jd� n:| j|d�}| jsj|r~|jr~| jt |�d|� n
| jd� d S )Nz Refactoring doctests in stdinz<stdin>zNo doctest changes in stdinzNo changes in stdin)
�sys�stdinr� r� r� rc r� r� r� r� )rz r� r@ r� r� r r r �refactor_stdin� s
z RefactoringTool.refactor_stdinc
C s� x"t | j| j�D ]}|j||� qW | j| j|j� � | j| j|j� � | jj|j � �}�xvt
|j � ��rАx`| jj D �]R}||ko�|| rv|| j
tjjdd� |jr�|| j
tjjd� �x
t|| �D � ]�}||| kr�|| j|� y t|� W n tk
�r w�Y nX |j�r(||jk�r(q�|j|�}|r�|j||�}|dk r�|j|� x,|j� D ] }|j�spg |_|jj|� �q^W | jj|j � �}x2|D ]*} | |k�r�g || < || j || � �q�W q�W qvW q\W x$t | j| j�D ]}|j ||� �q�W |j S )a� Refactors a parse tree (modifying the tree in place).
For compatible patterns the bottom matcher module is
used. Otherwise the tree is traversed node-to-node for
matches.
Args:
tree: a pytree.Node instance representing the root of the tree
to be refactored.
name: a human-readable name for this tree.
Returns:
True if the tree was modified, False otherwise.
T)r �reverse)r N) r rs rt Z
start_tree� traverse_byrx ry rw ZrunZleaves�anyr0 rf r� r ZBaseZdepthZkeep_line_orderZ
get_linenor- �remover �
ValueErrorZfixers_applied�match� transformr? r r2 Z finish_treer� )
rz r� r r4 Z match_set�node�results�newZ new_matchesZfxrr r r r� � sJ
$z RefactoringTool.refactor_treec C s^ |sdS xP|D ]H}xB||j D ]4}|j|�}|r |j||�}|dk r |j|� |}q W qW dS )a Traverse an AST, applying a set of fixers to each node.
This is a helper method for refactor_tree().
Args:
fixers: a list of fixer instances.
traversal: a generator that yields AST nodes.
Returns:
None
N)r# r� r� r? )rz rf Z traversalr� r4 r� r� r r r r� � s
zRefactoringTool.traverse_byc C s� | j j|� |dkr.| j|�d }|dkr.dS ||k}| j||||� |r`| jd|� | js`dS |rv| j||||� n | jd|� dS )zR
Called when a file has been refactored and there may be changes.
Nr zNo changes to %szNot writing changes to %s)ru r r� r� r� rc �
write_file)rz r� r� r� r� r� r� r r r r� � s z RefactoringTool.processed_filec % C s� yt |d|d�}W n. tk
r@ } z| jd||� dS d}~X nX zHy|jt|�� W n0 tk
r� } z| jd||� W Y dd}~X nX W d|j� X | jd|� d| _dS )z�Writes a string to a file.
It first shows a unified diff between the old text and the new text, and
then rewrites the file; the latter is only done if the write option is
set.
�w)r� zCan't create %s: %sNzCan't write %s: %szWrote changes to %sT)r� r� r� r� rC r� r� rq )rz r� r� r� r� r� r� r r r r�
s $
zRefactoringTool.write_filez>>> z... c
C s g }d}d}d}d}x�|j dd�D ]�}|d7 }|j� j| j�r�|dk r\|j| j||||�� |}|g}|j| j�} |d| � }q"|dk r�|j|| j �s�||| jj� d kr�|j |� q"|dk r�|j| j||||�� d}d}|j |� q"W |dk �r|j| j||||�� dj
|�S )a� Refactors a docstring, looking for doctests.
This returns a modified version of the input string. It looks
for doctests, which start with a ">>>" prompt, and may be
continued with "..." prompts, as long as the "..." is indented
the same as the ">>>".
(Unfortunately we can't use the doctest module's parser,
since, like most parsers, it is not geared towards preserving
the original source.)
Nr T)�keependsr r> r} ) �
splitlines�lstripr �PS1r2 �refactor_doctest�find�PS2�rstripr r� )
rz r@ r� �result�blockZ block_lineno�indent�lineno�line�ir r r r� % s:
z"RefactoringTool.refactor_docstringc
s( y�j ||� �}W nd tk
rv } zH�jjtj�rRx |D ]}�jd|jd�� q8W �jd|||j j
|� |S d}~X nX �j ||��r$t |�j
dd�}|d|d � ||d d� } }| dg|d ks�t| ��|d jd�s�|d d7 < � �j |jd� g}|�r$|� �fd d
�|D �7 }|S )
z�Refactors one doctest.
A doctest is given as a block of lines, the first of which starts
with ">>>" (possibly indented), while the remaining lines start
with "..." (identically indented).
z
Source: %sr> z+Can't parse docstring in %s line %s: %s: %sNT)r� r r c s g | ]}� �j | �qS r )r� )r7 r� )r� rz r r r: j s z4RefactoringTool.refactor_doctest.<locals>.<listcomp>r� r� )� parse_blockr' re Z isEnabledForro �DEBUGr� r� r� r� r r� r� r� �AssertionErrorr r� �pop)
rz r� r� r� r� r� r� r� r� Zclippedr )r� rz r r� P s&
"z RefactoringTool.refactor_doctestc C s� | j r d}nd}| js$| jd|� n&| jd|� x| jD ]}| j|� q8W | jrt| jd� x| jD ]}| j|� qbW | jr�t| j�dkr�| jd� n| jdt| j�� x&| jD ] \}}}| j|f|�|� q�W d S ) N�werez
need to bezNo files %s modified.zFiles that %s modified:z$Warnings/messages while refactoring:r zThere was 1 error:zThere were %d errors:)rq ru r� rp rn r� )rz r� �file�messager� r� r� r r r � summarizem s$
zRefactoringTool.summarizec C s" | j j| j|||��}t� |_|S )z�Parses a block into a tree.
This is necessary to get correct line number / offset information
in the parser diagnostics and embedded into the parse tree.
)r Z parse_tokens� wrap_toksrP r� )rz r� r� r� r� r r r r� � s zRefactoringTool.parse_blockc c sh t j| j||�j�}xN|D ]F\}}\}}\} }
} ||d 7 }| |d 7 } ||||f| |
f| fV qW dS )z;Wraps a tokenize stream to systematically modify start/end.r N)r rL � gen_lines�__next__) rz r� r� r� r1 r# r] Zline0Zcol0Zline1Zcol1Z line_textr r r r� � s
zRefactoringTool.wrap_toksc c s� || j }|| j }|}xV|D ]N}|j|�r@|t|�d� V n(||j� d krXdV ntd||f ��|}q W x
dV qrW dS )z�Generates lines as expected by tokenize from a list of lines.
This strips the first len(indent + self.PS1) characters off each line.
Nr> zline=%r, prefix=%rr} )r� r� r r� r� r� )rz r� r� �prefix1Zprefix2�prefixr� r r r r� � s
zRefactoringTool.gen_lines)NN)FF)FF)FF)F)NFN)N) r r r! rh r� r� r{ rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r ra � s:
4(
O
+
ra c @ s e Zd ZdS )�MultiprocessingUnsupportedN)r r r! r r r r r� � s r� c sB e Zd Z� fdd�Zd � fdd� Z� fdd�Z� fd d
�Z� ZS ) �MultiprocessRefactoringToolc s" t t| �j||� d | _d | _d S )N)�superr� r{ �queue� output_lock)rz r� �kwargs)r� r r r{ � s z$MultiprocessRefactoringTool.__init__Fr c s |dkr t t��j|||�S y dd l� W n tk
r@ t�Y nX �jd k rTtd��� j� �_� j � �_
� �fdd�t |�D �}z.x|D ] }|j � q�W t t��j|||� W d �jj
� x t |�D ]}�jjd � q�W x |D ]}|j� r�|j
� q�W d �_X d S )Nr r z already doing multiple processesc s g | ]}� j �jd ��qS ))�target)ZProcess�_child)r7 r� )�multiprocessingrz r r r: � s z8MultiprocessRefactoringTool.refactor.<locals>.<listcomp>)r� r� r� r� � ImportErrorr� r� � RuntimeErrorZ
JoinableQueueZLockr� �range�startr� �putZis_alive)rz r� r� r� Z
num_processesZ processesr) r� )r� )r� rz r r� � s2
z$MultiprocessRefactoringTool.refactorc
sR | j j� }xB|d k rL|\}}ztt| �j||� W d | j j� X | j j� }q W d S )N)r� rm r� r� r� Z task_done)rz Ztaskr� r� )r� r r r� � s
z"MultiprocessRefactoringTool._childc s2 | j d k r | j j||f� ntt| �j||�S d S )N)r� r� r� r� r� )rz r� r� )r� r r r� � s
z)MultiprocessRefactoringTool.refactor_file)FFr )r r r! r{ r� r� r� �
__classcell__r r )r� r r� � s
r� )T)r r )(r` �
__author__r r� ro r� r+ rM � itertoolsr Zpgen2r r r Z
fixer_utilr r} r r r
rv r r' r r$ r5 r; r= � version_info�codecsr� r� rA rC r^ r_ �objectra r� r� r r r r �<module> sF
( __pycache__/main.cpython-36.pyc 0000644 00000020524 15053244155 0012335 0 ustar 00 3
\�- � @ s� d Z ddlmZmZ ddlZddlZddlZddlZddlZddl Z ddl
m Z dd� Z G dd � d e j
�Zd
d � Zdd d
�ZdS )z
Main program for 2to3.
� )�with_statement�print_functionN� )�refactorc C s( | j � } |j � }tj| |||dddd�S )z%Return a unified diff of two strings.z
(original)z (refactored)� )Zlineterm)�
splitlines�difflibZ unified_diff)�a�b�filename� r �$/usr/lib64/python3.6/lib2to3/main.py�
diff_texts s
r c s> e Zd ZdZd � fdd� Zdd� Z� fdd�Zd d
� Z� ZS ) �StdoutRefactoringToola2
A refactoring tool that can avoid overwriting its input files.
Prints output to stdout.
Output files can optionally be written to a different directory and or
have an extra file suffix appended to their name for use in situations
where you do not want to replace the input files.
r c sR || _ || _|r(|jtj� r(|tj7 }|| _|| _|| _tt | �j
|||� dS )aF
Args:
fixers: A list of fixers to import.
options: A dict with RefactoringTool configuration.
explicit: A list of fixers to run even if they are explicit.
nobackups: If true no backup '.bak' files will be created for those
files that are being refactored.
show_diffs: Should diffs of the refactoring be printed to stdout?
input_base_dir: The base directory for all input files. This class
will strip this path prefix off of filenames before substituting
it with output_dir. Only meaningful if output_dir is supplied.
All files processed by refactor() must start with this path.
output_dir: If supplied, all converted files will be written into
this directory tree instead of input_base_dir.
append_suffix: If supplied, all files output by this tool will have
this appended to their filename. Useful for changing .py to
.py3 for example by passing append_suffix='3'.
N) � nobackups�
show_diffs�endswith�os�sep�_input_base_dir� _output_dir�_append_suffix�superr �__init__) �selfZfixers�options�explicitr r �input_base_dir�
output_dir�
append_suffix)� __class__r r
r $ s
z StdoutRefactoringTool.__init__c O s* | j j|||f� | jj|f|�|� d S )N)�errors�append�logger�error)r �msg�args�kwargsr r r
� log_errorA s z StdoutRefactoringTool.log_errorc
! s| |}| j rH|j| j�r6tjj| j |t| j�d � �}ntd|| jf ��| jrX|| j7 }||kr�tjj |�}tjj
|� r�|r�tj |� | j d||� | j
�s4|d }tjj|�r�ytj|� W n. tk
r� } z| j d|� W Y d d }~X nX ytj||� W n2 tk
�r2 } z| j d||� W Y d d }~X nX tt| �j} | ||||� | j
�sbtj||� ||k�rxtj||� d S )Nz5filename %s does not start with the input_base_dir %szWriting converted %s to %s.z.bakzCan't remove backup %szCan't rename %s to %s)r �
startswithr r �path�join�len�
ValueErrorr �dirname�isdir�makedirs� log_messager �lexists�remove�OSError�renamer r �
write_file�shutilZcopymode)
r Znew_textr Zold_text�encodingZ
orig_filenamer Zbackup�err�write)r r r
r6 E s@
z StdoutRefactoringTool.write_filec C s� |r| j d|� n�| j d|� | jr�t|||�}yX| jd k rp| j�& x|D ] }t|� qJW tjj� W d Q R X nx|D ] }t|� qvW W n" tk
r� t d|f � d S X d S )NzNo changes to %sz
Refactored %sz+couldn't encode %s's diff for your terminal)
r1 r r Z output_lock�print�sys�stdout�flush�UnicodeEncodeError�warn)r �old�newr ZequalZ
diff_lines�liner r r
� print_outputl s"
z"StdoutRefactoringTool.print_output)r r r ) �__name__�
__module__� __qualname__�__doc__r r( r6 rD �
__classcell__r r )r r
r s
'r c C s t d| f tjd� d S )Nz WARNING: %s)�file)r; r< �stderr)r% r r r
r@ � s r@ c s t jdd�}|jddddd� |jdd d
g d d � |jd
dddddd� |jddd
g dd � |jddddd� |jdddd d� |jd d dd d� |jd dd!d� |jd"d#dd$d� |jd%d&dd'd(d � |jd)d*dd+d,d-d.� |jd/d0dd1d� |jd2dd+d,d3d.� d'}i }|j|�\}}|j�r@d4|d5< |j�s:td6� d4|_|j�r\|j �r\|j d7� |j
�rx|j �rx|j d8� |j �r�|j �r�td9� |j �r�|j�r�|j d:� |j �r�t
d;� x tj� �D ]}t
|� �q�W |�s�d<S |�s t
d=tjd>� t
d?tjd>� d@S dA|k�r4d4}|j�r4t
dBtjd>� d@S |j�rDd4|dC< |j�rRtjntj}tjdD|dE� tjdF�}ttj� ��} t� fdGdH�|jD ��}
t� } |j �r�d'} x2|j D ](}
|
dIk�r�d4} n| j � dJ |
� �q�W | �r�| j | �n| }n
| j | �}|j |
�}t j!j"|�}|�rD|j#t j$� �rDt j!j%|� �rDt j!j&|�}|j�rh|j't j$�}|j(dK|j|� t)t*|�|t*| �|j|j ||j|j
dL�}|j+�s|�r�|j,� nRy|j||j|j-|j.� W n6 tj/k
�r� |j.dk�s�t0�t
dMtjd>� dS X |j1� t2t3|j+��S )Nz�Main program.
Args:
fixer_pkg: the name of a package where the fixers are located.
args: optional; a list of command line arguments. If omitted,
sys.argv[1:] is used.
Returns a suggested exit status (0, 1, 2).
z2to3 [options] file|dir ...)Zusagez-dz--doctests_only�
store_truezFix up doctests only)�action�helpz-fz--fixr" z1Each FIX specifies a transformation; default: all)rM �defaultrN z-jz --processesZstorer �intzRun 2to3 concurrently)rM rO �typerN z-xz--nofixz'Prevent a transformation from being runz-lz --list-fixesz List available transformationsz-pz--print-functionz0Modify the grammar so that print() is a functionz-vz --verbosezMore verbose loggingz
--no-diffsz#Don't show diffs of the refactoringz-wz--writezWrite back modified filesz-nz --nobackupsFz&Don't write backups for modified filesz-oz --output-dir�strr zXPut output files in this directory instead of overwriting the input files. Requires -n.)rM rQ rO rN z-Wz--write-unchanged-fileszYAlso write files even if no changes were required (useful with --output-dir); implies -w.z --add-suffixzuAppend this string to all output filenames. Requires -n if non-empty. ex: --add-suffix='3' will generate .py3 files.T�write_unchanged_filesz&--write-unchanged-files/-W implies -w.z%Can't use --output-dir/-o without -n.z"Can't use --add-suffix without -n.z@not writing files and not printing diffs; that's not very usefulzCan't use -n without -wz2Available transformations for the -f/--fix option:r z1At least one file or directory argument required.)rJ zUse --help to show usage.� �-zCan't write to stdin.r z%(name)s: %(message)s)�format�levelz lib2to3.mainc 3 s | ]}� d | V qdS )z.fix_Nr )�.0�fix)� fixer_pkgr r
� <genexpr>� s zmain.<locals>.<genexpr>�allz.fix_z7Output in %r will mirror the input directory %r layout.)r r r z+Sorry, -j isn't supported on this platform.)4�optparseZ OptionParserZ
add_option�
parse_argsrS r: r@ r r r$ Z
add_suffixZno_diffsZ
list_fixesr; r Zget_all_fix_namesr< rK r �verbose�logging�DEBUG�INFOZ basicConfigZ getLogger�setZget_fixers_from_packageZnofixrY �add�union�
differencer r* � commonprefixr r r/ r. �rstrip�infor �sortedr! �refactor_stdinZ
doctests_onlyZ processesZMultiprocessingUnsupported�AssertionErrorZ summarizerP �bool)rZ r& �parserrk �flagsr ZfixnamerW r# Z avail_fixesZunwanted_fixesr Z all_presentrY Z requestedZ fixer_namesr Zrtr )rZ r
�main� s�
rp )N)rH Z
__future__r r r< r r r` r7 r] r r r ZMultiprocessRefactoringToolr r@ rp r r r r
�<module> s g __pycache__/pygram.cpython-36.opt-1.pyc 0000644 00000002232 15053244155 0013643 0 ustar 00 3
\� � @ s� d Z ddlZddlmZ ddlmZ ddlmZ ejjejj e
�d�Z ejjejj e
�d�Z G d d
� d
e
�Zejd e �Zee�Zej� Zejd = ejd e �Zee�ZdS )
z&Export the Python grammar and symbols.� N� )�token)�driver)�pytreez Grammar.txtzPatternGrammar.txtc @ s e Zd Zdd� ZdS )�Symbolsc C s( x"|j j� D ]\}}t| ||� q W dS )z�Initializer.
Creates an attribute for each grammar symbol (nonterminal),
whose value is the symbol's type (an int >= 256).
N)Z
symbol2number�items�setattr)�selfZgrammar�nameZsymbol� r �&/usr/lib64/python3.6/lib2to3/pygram.py�__init__ s zSymbols.__init__N)�__name__�
__module__� __qualname__r
r r r r r s r Zlib2to3�print)�__doc__�osZpgen2r r � r �path�join�dirname�__file__Z
_GRAMMAR_FILEZ_PATTERN_GRAMMAR_FILE�objectr Zload_packaged_grammarZpython_grammarZpython_symbols�copyZ!python_grammar_no_print_statement�keywordsZpattern_grammarZpattern_symbolsr r r r �<module> s __pycache__/__main__.cpython-36.pyc 0000644 00000000317 15053244155 0013127 0 ustar 00 3
\C � @ s& d dl Z ddlmZ e jed�� dS )� N� )�mainz
lib2to3.fixes)�sysr �exit� r r �(/usr/lib64/python3.6/lib2to3/__main__.py�<module> s __pycache__/fixer_base.cpython-36.pyc 0000644 00000014121 15053244155 0013514 0 ustar 00 3
\" � @ sT d Z ddlZddlmZ ddlmZ ddlmZ G dd� de�Z G d d
� d
e �Z
dS ) z2Base class for fixers (optional, but recommended).� N� )�PatternCompiler)�pygram)�does_tree_importc @ s� e Zd ZdZdZdZdZdZdZe j
d�Z e � Z
dZdZdZdZdZdZejZdd� Zd d
� Zd d � Zd
d� Zdd� Zd dd�Z dd� Z d dd�Z dd� Z dd� Z d d � Z!dS ) �BaseFixa Optional base class for fixers.
The subclass name must be FixFooBar where FooBar is the result of
removing underscores and capitalizing the words of the fix name.
For example, the class name for a fixer named 'has_key' should be
FixHasKey.
Nr ZpostF� c C s || _ || _| j� dS )a Initializer. Subclass may override.
Args:
options: a dict containing the options passed to RefactoringTool
that could be used to customize the fixer through the command line.
log: a list to append warnings and other messages to.
N)�options�log�compile_pattern)�selfr r � r �*/usr/lib64/python3.6/lib2to3/fixer_base.py�__init__/ s zBaseFix.__init__c C s, | j dk r(t� }|j| j dd�\| _| _dS )z�Compiles self.PATTERN into self.pattern.
Subclass may override if it doesn't want to use
self.{pattern,PATTERN} in .match().
NT)Z with_tree)�PATTERNr r
�pattern� pattern_tree)r �PCr r r
r
; s
zBaseFix.compile_patternc C s
|| _ dS )zOSet the filename.
The main refactoring tool should call this.
N)�filename)r r r r r
� set_filenameF s zBaseFix.set_filenamec C s d|i}| j j||�o|S )a Returns match for a given parse tree node.
Should return a true or false object (not necessarily a bool).
It may return a non-empty dict of matching sub-nodes as
returned by a matching pattern.
Subclass may override.
�node)r �match)r r �resultsr r r
r M s z
BaseFix.matchc C s
t � �dS )a� Returns the transformation for a given parse tree node.
Args:
node: the root of the parse tree that matched the fixer.
results: a dict mapping symbolic names to part of the match.
Returns:
None, or a node that is a modified copy of the
argument node. The node argument may also be modified in-place to
effect the same change.
Subclass *must* override.
N)�NotImplementedError)r r r r r r
� transformY s zBaseFix.transform�xxx_todo_changemec C s6 |}x || j kr$|tt| j�� }qW | j j|� |S )z�Return a string suitable for use as an identifier
The new name is guaranteed not to conflict with other identifiers.
)�
used_names�str�next�numbers�add)r �template�namer r r
�new_namei s
zBaseFix.new_namec C s. | j r d| _ | jjd| j � | jj|� d S )NFz### In file %s ###)� first_logr �appendr )r �messager r r
� log_messaget s zBaseFix.log_messagec C s> |j � }|j� }d|_d}| j|||f � |r:| j|� dS )a Warn the user that a given chunk of code is not valid Python 3,
but that it cannot be converted automatically.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
� z Line %d: could not convert: %sN)�
get_linenoZclone�prefixr& )r r �reason�linenoZ
for_output�msgr r r
�cannot_convertz s zBaseFix.cannot_convertc C s |j � }| jd||f � dS )z�Used for warning the user about possible uncertainty in the
translation.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
z Line %d: %sN)r( r& )r r r* r+ r r r
�warning� s zBaseFix.warningc C s( |j | _ | j|� tjd�| _d| _dS )z�Some fixers need to maintain tree-wide state.
This method is called once, at the start of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
r TN)r r � itertools�countr r# )r �treer r r r
�
start_tree� s
zBaseFix.start_treec C s dS )z�Some fixers need to maintain tree-wide state.
This method is called once, at the conclusion of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
Nr )r r1 r r r r
� finish_tree� s zBaseFix.finish_tree)r )N)"�__name__�
__module__� __qualname__�__doc__r r r r r r/ r0 r �setr �orderZexplicitZ run_orderZ _accept_typeZkeep_line_orderZ
BM_compatibler Zpython_symbolsZsymsr r
r r r r" r& r- r. r2 r3 r r r r
r s4
r c s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�ConditionalFixz@ Base class for fixers which not execute if an import is found. Nc s t t| �j|� d | _d S )N)�superr: r2 � _should_skip)r �args)� __class__r r
r2 � s zConditionalFix.start_treec C sJ | j d k r| j S | jjd�}|d }dj|d d� �}t|||�| _ | j S )N�.r ���r@ )r< �skip_on�split�joinr )r r Zpkgr! r r r
� should_skip� s
zConditionalFix.should_skip)r4 r5 r6 r7 rA r2 rD �
__classcell__r r )r> r
r: � s r: ) r7 r/ Zpatcompr r' r Z
fixer_utilr �objectr r: r r r r
�<module> s __pycache__/btm_matcher.cpython-36.pyc 0000644 00000011506 15053244155 0013676 0 ustar 00 3
\� � @ sl d Z dZddlZddlZddlmZ ddlmZ ddlm Z G dd � d e
�Z G d
d � d e
�Z i a
d d
� ZdS )a� A bottom-up tree matching algorithm implementation meant to speed
up 2to3's matching process. After the tree patterns are reduced to
their rarest linear path, a linear Aho-Corasick automaton is
created. The linear automaton traverses the linear paths from the
leaves to the root of the AST and returns a set of nodes for further
matching. This reduces significantly the number of candidate nodes.z+George Boutsioukis <gboutsioukis@gmail.com>� N)� defaultdict� )�pytree)� reduce_treec @ s e Zd ZdZej� Zdd� ZdS )�BMNodez?Class for a node of the Aho-Corasick automaton used in matchingc C s" i | _ g | _ttj�| _d| _d S )N� )�transition_table�fixers�nextr �count�id�content)�self� r �+/usr/lib64/python3.6/lib2to3/btm_matcher.py�__init__ s zBMNode.__init__N)�__name__�
__module__� __qualname__�__doc__� itertoolsr r r r r r r s r c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd S )
�
BottomMatcherzgThe main matcher class. After instantiating the patterns should
be added using the add_fixer methodc C s0 t � | _t� | _| jg| _g | _tjd�| _d S )NZRefactoringTool) �set�matchr �rootZnodesr �loggingZ getLoggerZlogger)r r r r r s
zBottomMatcher.__init__c C sL | j j|� t|j�}|j� }| j|| jd�}x|D ]}|j j|� q4W dS )z�Reduces a fixer's pattern tree to a linear path and adds it
to the matcher(a common Aho-Corasick automaton). The fixer is
appended on the matching states and called when they are
reached)�startN)r �appendr Z pattern_treeZget_linear_subpattern�addr )r �fixerZtreeZlinear� match_nodesZ
match_noder r r � add_fixer% s
zBottomMatcher.add_fixerc C s� |s
|gS t |d t�rhg }xF|d D ]:}| j||d�}x&|D ] }|j| j|dd� |�� q>W q&W |S |d |jkr�t� }||j|d < n|j|d }|dd� r�| j|dd� |d�}n|g}|S dS )z5Recursively adds a linear pattern to the AC automatonr )r r N)�
isinstance�tupler �extendr r )r �patternr r � alternativeZ end_nodes�endZ next_noder r r r 1 s"
" zBottomMatcher.addc C s0 | j }tt�}�x|D �]}|}�x|�r&d|_x,|jD ]"}t|tj�r8|jdkr8d|_P q8W |j dkrp|j}n|j }||j
kr�|j
| }x�|j D ]"}||kr�g ||< || j |� q�W nd| j }|j
dk r�|j
jr�P ||j
k�r |j
| }x2|j D ](}||j� k�r g ||< || j |� q�W |j
}q$W qW |S )au The main interface with the bottom matcher. The tree is
traversed from the bottom using the constructed
automaton. Nodes are only checked once as the tree is
retraversed. When the automaton fails, we give it one more
shot(in case the above tree matches as a whole with the
rejected leaf), then we break for the next leaf. There is the
special case of multiple arguments(see code comments) where we
recheck the nodes
Args:
The leaves of the AST tree to be matched
Returns:
A dictionary of node matches with fixers as the keys
T�;Fr N)r r �listZ was_checkedZchildrenr" r ZLeaf�value�typer r r �parent�keys) r ZleavesZcurrent_ac_nodeZresultsZleafZcurrent_ast_nodeZchildZ
node_tokenr r r r �runS s>
zBottomMatcher.runc s* t d� � fdd�� � | j� t d� dS )z<Prints a graphviz diagram of the BM automaton(for debugging)z
digraph g{c s^ xX| j j� D ]J}| j | }td| j|jt|�t|j�f � |dkrNt|j� � |� q W d S )Nz%d -> %d [label=%s] //%sr )r r- �printr � type_repr�strr r
)ZnodeZ subnode_keyZsubnode)�
print_noder r r2 � s
z*BottomMatcher.print_ac.<locals>.print_node�}N)r/ r )r r )r2 r �print_ac� s
zBottomMatcher.print_acN) r r r r r r! r r. r4 r r r r r s "=r c C sH t s<ddlm} x*|jj� D ] \}}t|�tkr |t |< q W t j| | �S )Nr )�python_symbols)� _type_reprsZpygramr5 �__dict__�itemsr+ �int�
setdefault)Ztype_numr5 �name�valr r r r0 � s r0 )r �
__author__r r � collectionsr r r Z btm_utilsr �objectr r r6 r0 r r r r �<module> s __pycache__/__init__.cpython-36.opt-2.pyc 0000644 00000000173 15053244155 0014106 0 ustar 00 3
\ � @ s d S )N� r r r �(/usr/lib64/python3.6/lib2to3/__init__.py�<module> s __pycache__/refactor.cpython-36.opt-2.pyc 0000644 00000040506 15053244155 0014160 0 ustar 00 3
\=m � @ s8 d Z ddlZddlZddlZddlZddlZddlZddlmZ ddl m
Z
m Z m Z ddl
mZ ddlmZmZ ddlmZ d%d
d �ZG d d
� d
e�Zdd� Zdd� Zdd� Zdd� Zejd&k r�ddl Z e j Z dd� Z dd� Z n e Z eZ eZ dd � Z!G d d � d e�Z"G d d � d e#�Z$G d!d"� d"e�Z%G d#d$� d$e$�Z&dS )'z#Guido van Rossum <guido@python.org>� N)�chain� )�driver�tokenize�token)� find_root)�pytree�pygram)� btm_matcherTc C st t | g g dg�}tjj|j�}g }xLttj|��D ]:}|jd�r2|jd�r2|rZ|dd � }|j |d d� � q2W |S )N�*�fix_z.py� � ���)
�
__import__�os�path�dirname�__file__�sorted�listdir�
startswith�endswith�append)Z fixer_pkgZ
remove_prefixZpkgZ fixer_dirZ fix_names�name� r �(/usr/lib64/python3.6/lib2to3/refactor.py�get_all_fix_names s r c @ s e Zd ZdS )�
_EveryNodeN)�__name__�
__module__� __qualname__r r r r r + s r c C s� t | tjtjf�r(| jd kr t�| jhS t | tj�rH| jrDt| j�S t�t | tj �r�t
� }x*| jD ] }x|D ]}|j t|�� qlW qbW |S t d| ��d S )Nz$Oh no! I don't understand pattern %s)
�
isinstancer Z NodePatternZ LeafPattern�typer ZNegatedPatternZcontent�_get_head_typesZWildcardPattern�set�update� Exception)Zpat�r�p�xr r r r$ / s
r$ c C s� t jt�}g }x�| D ]|}|jrjyt|j�}W n tk
rJ |j|� Y q�X xB|D ]}|| j|� qRW q|jd k r�||j j|� q|j|� qW x,tt j
j j � t j
j
�D ]}|| j|� q�W t|�S )N)� collections� defaultdict�list�patternr$ r r Z _accept_typer r �python_grammarZ
symbol2number�values�tokens�extend�dict)Z
fixer_listZ
head_nodesZevery�fixerZheadsZ node_typer r r �_get_headnode_dictK s"
r5 c s � fdd�t � d�D �S )Nc s g | ]}� d | �qS )�.r )�.0�fix_name)�pkg_namer r �
<listcomp>h s z+get_fixers_from_package.<locals>.<listcomp>F)r )r9 r )r9 r �get_fixers_from_packaged s
r; c C s | S )Nr )�objr r r � _identityk s r= r c C s | j dd�S )Nz
�
)�replace)�inputr r r �_from_system_newlinesr s rA c C s t jdkr| jdt j�S | S d S )Nr> )r �linesepr? )r@ r r r �_to_system_newlinest s
rC c sT d}t jtj| �j�� � fdd�}ttjt jtj h�}t
� }y�x�|� \}}||krVq@q@|tj krl|rfP d}q@|tj ko||dk�r,|� \}}|tj ks�|dkr�P |� \}}|tj ks�|dkr�P |� \}}|tj
kr�|dkr�|� \}}xJ|tj k�r(|j|� |� \}}|tj
k�s|d k�r P |� \}}q�W q@P q@W W n tk
�rJ Y nX t|�S )
NFc s t � �} | d | d fS )Nr r )�next)�tok)�genr r �advance� s z(_detect_future_features.<locals>.advanceT�fromZ
__future__�import�(�,)r �generate_tokens�io�StringIO�readline� frozensetr �NEWLINE�NL�COMMENTr% �STRING�NAME�OP�add�
StopIteration)�sourceZhave_docstringrG �ignore�features�tp�valuer )rF r �_detect_future_features sD
r^ c @ s e Zd ZdS )�
FixerErrorN)r r r! r r r r r_ � s r_ c @ s� e Zd Zddd�ZdZdZd4dd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d5dd�Z d6dd�Z
dd� Zd7dd�Zdd� Zd8d d �Zd d � Zd d!� Zd9d"d#�Zd:d$d%�Zd&Zd'Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Z d2d3� Z dS );�RefactoringToolF)�print_function�write_unchanged_filesZFixr Nc C s2 || _ |p g | _| jj� | _|d k r0| jj|� | jd rDtj| _ntj | _| jj
d�| _ g | _ t
jd�| _g | _d| _tj| jtj| jd�| _| j� \| _| _g | _tj� | _ g | _ g | _ xXt | j| j�D ]F}|j r�| j j!|� q�|| jkr�| j j"|� q�|| jkr�| j j"|� q�W t#| j �| _$t#| j �| _%d S )Nra rb r` F)�convert�logger)&�fixers�explicit�_default_options�copy�optionsr& r �!python_grammar_no_print_statement�grammarr/ �getrb �errors�loggingZ getLoggerrd � fixer_log�wroter ZDriverr rc �
get_fixers� pre_order�
post_order�files�bmZ
BottomMatcher�BMZ
bmi_pre_orderZbmi_post_orderr Z
BM_compatibleZ add_fixerr r5 �bmi_pre_order_heads�bmi_post_order_heads)�selfZ fixer_namesri rf r4 r r r �__init__� s<
zRefactoringTool.__init__c C s\ g }g }�x&| j D �]}t|i i dg�}|jdd�d }|j| j�rV|t| j�d � }|jd�}| jdjdd� |D �� }yt ||�}W n$ t
k
r� t d||f ��Y nX || j | j
�} | jr�| jd k r�|| jkr�| jd
|� q| jd |� | jd k�r|j| � q| jd
k�r |j| � qt d| j ��qW tjd�}
|j|
d� |j|
d� ||fS )Nr r6 r �_� c S s g | ] }|j � �qS r )�title)r7 r) r r r r: � s z.RefactoringTool.get_fixers.<locals>.<listcomp>zCan't find %s.%sTzSkipping optional fixer: %szAdding transformation: %sZpreZpostzIllegal fixer order: %rZ run_order)�key���)re r �rsplitr � FILE_PREFIX�len�split� CLASS_PREFIX�join�getattr�AttributeErrorr_ ri ro rf � log_message� log_debug�orderr �operator�
attrgetter�sort) ry Zpre_order_fixersZpost_order_fixersZ fix_mod_path�modr8 �parts�
class_nameZ fix_classr4 Zkey_funcr r r rq � s8
zRefactoringTool.get_fixersc O s � d S )Nr )ry �msg�args�kwdsr r r � log_error s zRefactoringTool.log_errorc G s |r || }| j j|� d S )N)rd �info)ry r� r� r r r r� s zRefactoringTool.log_messagec G s |r || }| j j|� d S )N)rd �debug)ry r� r� r r r r� s zRefactoringTool.log_debugc C s d S )Nr )ry �old_text�new_text�filename�equalr r r � print_output s z RefactoringTool.print_outputc C s< x6|D ].}t jj|�r&| j|||� q| j|||� qW d S )N)r r �isdir� refactor_dir�
refactor_file)ry �items�write�
doctests_onlyZ dir_or_filer r r �refactor# s
zRefactoringTool.refactorc
C s� t jd }x�t j|�D ]�\}}}| jd|� |j� |j� xH|D ]@}|jd� rBt jj|�d |krBt jj||�} | j | ||� qBW dd� |D �|d d �< qW d S )N�pyzDescending into %sr6 r c S s g | ]}|j d �s|�qS )r6 )r )r7 Zdnr r r r: > s z0RefactoringTool.refactor_dir.<locals>.<listcomp>)
r �extsep�walkr� r� r r �splitextr� r� )
ry Zdir_namer� r� Zpy_ext�dirpathZdirnames� filenamesr �fullnamer r r r� , s
z RefactoringTool.refactor_dirc C s� yt |d�}W n. tk
r< } z| jd||� dS d }~X nX ztj|j�d }W d |j� X t|d|d��}t|j � �|fS Q R X d S )N�rbzCan't open %s: %sr r( )�encoding)NN)
�open�OSErrorr� r �detect_encodingrO �close�_open_with_encodingrA �read)ry r� �f�errr� r r r �_read_python_source@ s
z#RefactoringTool._read_python_sourcec C s� | j |�\}}|d krd S |d7 }|rn| jd|� | j||�}| jsL||kr`| j|||||� q�| jd|� nH| j||�}| js�|r�|jr�| jt|�d d� |||d� n | jd|� d S )Nr> zRefactoring doctests in %szNo doctest changes in %sr )r� r� zNo changes in %sr )r� r� �refactor_docstringrb �processed_file�refactor_string� was_changed�str)ry r� r� r� r@ r� �output�treer r r r� P s z RefactoringTool.refactor_filec C s� t |�}d|krtj| j_zJy| jj|�}W n4 tk
r` } z| jd||jj |� d S d }~X nX W d | j| j_X ||_
| j d|� | j ||� |S )Nra zCan't parse %s: %s: %szRefactoring %s)
r^ r rj r rk Z parse_stringr' r� � __class__r �future_featuresr� �
refactor_tree)ry �datar r[ r� r� r r r r� g s
z RefactoringTool.refactor_stringc C s� t jj� }|rN| jd� | j|d�}| js2||krB| j|d|� q�| jd� n:| j|d�}| jsj|r~|jr~| jt |�d|� n
| jd� d S )Nz Refactoring doctests in stdinz<stdin>zNo doctest changes in stdinzNo changes in stdin)
�sys�stdinr� r� r� rb r� r� r� r� )ry r� r@ r� r� r r r �refactor_stdin� s
z RefactoringTool.refactor_stdinc
C s� x"t | j| j�D ]}|j||� qW | j| j|j� � | j| j|j� � | jj|j � �}�xvt
|j � ��rАx`| jj D �]R}||ko�|| rv|| j
tjjdd� |jr�|| j
tjjd� �x
t|| �D � ]�}||| kr�|| j|� y t|� W n tk
�r w�Y nX |j�r(||jk�r(q�|j|�}|r�|j||�}|d k r�|j|� x,|j� D ] }|j�spg |_|jj|� �q^W | jj|j � �}x2|D ]*} | |k�r�g || < || j || � �q�W q�W qvW q\W x$t | j| j�D ]}|j ||� �q�W |j S )NT)r~ �reverse)r~ ) r rr rs Z
start_tree� traverse_byrw rx rv ZrunZleaves�anyr0 re r� r ZBaseZdepthZkeep_line_orderZ
get_linenor- �remover �
ValueErrorZfixers_applied�match� transformr? r r2 Z finish_treer� )
ry r� r r4 Z match_set�node�results�newZ new_matchesZfxrr r r r� � sJ
$z RefactoringTool.refactor_treec C s^ |sd S xP|D ]H}xB||j D ]4}|j|�}|r |j||�}|d k r |j|� |}q W qW d S )N)r# r� r� r? )ry re Z traversalr� r4 r� r� r r r r� � s
zRefactoringTool.traverse_byc C s� | j j|� |d kr.| j|�d }|d kr.d S ||k}| j||||� |r`| jd|� | js`d S |rv| j||||� n | jd|� d S )Nr zNo changes to %szNot writing changes to %s)rt r r� r� r� rb �
write_file)ry r� r� r� r� r� r� r r r r� � s z RefactoringTool.processed_filec % C s� yt |d|d�}W n. tk
r@ } z| jd||� d S d }~X nX zHy|jt|�� W n0 tk
r� } z| jd||� W Y d d }~X nX W d |j� X | jd|� d| _d S )N�w)r� zCan't create %s: %szCan't write %s: %szWrote changes to %sT)r� r� r� r� rC r� r� rp )ry r� r� r� r� r� r� r r r r�
s $
zRefactoringTool.write_filez>>> z... c
C s g }d }d }d }d}x�|j dd�D ]�}|d7 }|j� j| j�r�|d k r\|j| j||||�� |}|g}|j| j�} |d | � }q"|d k r�|j|| j �s�||| jj� d kr�|j |� q"|d k r�|j| j||||�� d }d }|j |� q"W |d k �r|j| j||||�� dj
|�S )Nr T)�keependsr r> r| ) �
splitlines�lstripr �PS1r2 �refactor_doctest�find�PS2�rstripr r� )
ry r@ r� �result�blockZ block_lineno�indent�lineno�line�ir r r r� % s:
z"RefactoringTool.refactor_docstringc
s y�j ||� �}W nd tk
rv } zH�jjtj�rRx |D ]}�jd|jd�� q8W �jd|||j j
|� |S d }~X nX �j ||��r
t |�j
dd�}|d |d � ||d d � } }|d
jd�s�|d d7 < � �j |jd� g}|�r
|� �fdd �|D �7 }|S ) Nz
Source: %sr> z+Can't parse docstring in %s line %s: %s: %sT)r� r r c s g | ]}� �j | �qS r )r� )r7 r� )r� ry r r r: j s z4RefactoringTool.refactor_doctest.<locals>.<listcomp>r r )� parse_blockr' rd Z isEnabledForrn �DEBUGr� r� r� r� r r� r� r� r r� �pop)
ry r� r� r� r� r� r� r� r� Zclippedr )r� ry r r� P s$
"z RefactoringTool.refactor_doctestc C s� | j r d}nd}| js$| jd|� n&| jd|� x| jD ]}| j|� q8W | jrt| jd� x| jD ]}| j|� qbW | jr�t| j�dkr�| jd� n| jdt| j�� x&| jD ] \}}}| j|f|�|� q�W d S ) N�werez
need to bezNo files %s modified.zFiles that %s modified:z$Warnings/messages while refactoring:r zThere was 1 error:zThere were %d errors:)rp rt r� ro rm r� )ry r� �file�messager� r� r� r r r � summarizem s$
zRefactoringTool.summarizec C s" | j j| j|||��}t� |_|S )N)r Z parse_tokens� wrap_toksrP r� )ry r� r� r� r� r r r r� � s zRefactoringTool.parse_blockc c sh t j| j||�j�}xN|D ]F\}}\}}\} }
} ||d 7 }| |d 7 } ||||f| |
f| fV qW d S )Nr )r rL � gen_lines�__next__) ry r� r� r� r1 r# r] Zline0Zcol0Zline1Zcol1Z line_textr r r r� � s
zRefactoringTool.wrap_toksc c s� || j }|| j }|}xV|D ]N}|j|�r@|t|�d � V n(||j� d krXdV ntd||f ��|}q W x
dV qrW d S )Nr> zline=%r, prefix=%rr| )r� r� r r� r� �AssertionError)ry r� r� �prefix1Zprefix2�prefixr� r r r r� � s
zRefactoringTool.gen_lines)NN)FF)FF)FF)F)NFN)N) r r r! rg r� r� rz rq r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r` � s:
4(
O
+
r` c @ s e Zd ZdS )�MultiprocessingUnsupportedN)r r r! r r r r r� � s r� c sB e Zd Z� fdd�Zd � fdd� Z� fdd�Z� fd d
�Z� ZS ) �MultiprocessRefactoringToolc s" t t| �j||� d | _d | _d S )N)�superr� rz �queue� output_lock)ry r� �kwargs)r� r r rz � s z$MultiprocessRefactoringTool.__init__Fr c s |dkr t t��j|||�S y dd l� W n tk
r@ t�Y nX �jd k rTtd��� j� �_� j � �_
� �fdd�t |�D �}z.x|D ] }|j � q�W t t��j|||� W d �jj
� x t |�D ]}�jjd � q�W x |D ]}|j� r�|j
� q�W d �_X d S )Nr r z already doing multiple processesc s g | ]}� j �jd ��qS ))�target)ZProcess�_child)r7 r� )�multiprocessingry r r r: � s z8MultiprocessRefactoringTool.refactor.<locals>.<listcomp>)r� r� r� r� � ImportErrorr� r� � RuntimeErrorZ
JoinableQueueZLockr� �range�startr� �putZis_alive)ry r� r� r� Z
num_processesZ processesr) r� )r� )r� ry r r� � s2
z$MultiprocessRefactoringTool.refactorc
sR | j j� }xB|d k rL|\}}ztt| �j||� W d | j j� X | j j� }q W d S )N)r� rl r� r� r� Z task_done)ry Ztaskr� r� )r� r r r� � s
z"MultiprocessRefactoringTool._childc s2 | j d k r | j j||f� ntt| �j||�S d S )N)r� r� r� r� r� )ry r� r� )r� r r r� � s
z)MultiprocessRefactoringTool.refactor_file)FFr )r r r! rz r� r� r� �
__classcell__r r )r� r r� � s
r� )T)r r )'�
__author__r r� rn r� r+ rM � itertoolsr Zpgen2r r r Z
fixer_utilr r| r r r
ru r r' r r$ r5 r; r= � version_info�codecsr� r� rA rC r^ r_ �objectr` r� r� r r r r �<module> sD
( __pycache__/__init__.cpython-36.pyc 0000644 00000000173 15053244155 0013146 0 ustar 00 3
\ � @ s d S )N� r r r �(/usr/lib64/python3.6/lib2to3/__init__.py�<module> s __pycache__/refactor.cpython-36.opt-1.pyc 0000644 00000050426 15053244155 0014161 0 ustar 00 3
\=m � @ s< d Z dZddlZddlZddlZddlZddlZddlZddlm Z ddl
m Z m Z m
Z
ddlmZ ddlmZmZ dd lmZ d&d d �ZG d
d� de�Zdd� Zdd� Zdd� Zdd� Zej d'k r�ddl Z e j Z dd� Z dd� Z!n e Z eZ eZ!d d � Z"G d d � d e�Z#G d d!� d!e$�Z%G d"d#� d#e�Z&G d$d%� d%e%�Z'dS )(z�Refactoring framework.
Used as a main program, this can refactor any number of files and/or
recursively descend down directories. Imported as a module, this
provides infrastructure to write your own refactoring tool.
z#Guido van Rossum <guido@python.org>� N)�chain� )�driver�tokenize�token)� find_root)�pytree�pygram)� btm_matcherTc C st t | g g dg�}tjj|j�}g }xLttj|��D ]:}|jd�r2|jd�r2|rZ|dd� }|j |dd� � q2W |S )zEReturn a sorted list of all available fix names in the given package.�*�fix_z.py� N� ���)
�
__import__�os�path�dirname�__file__�sorted�listdir�
startswith�endswith�append)Z fixer_pkgZ
remove_prefixZpkgZ fixer_dirZ fix_names�name� r �(/usr/lib64/python3.6/lib2to3/refactor.py�get_all_fix_names s r c @ s e Zd ZdS )�
_EveryNodeN)�__name__�
__module__� __qualname__r r r r r + s r c C s� t | tjtjf�r(| jdkr t�| jhS t | tj�rH| jrDt| j�S t�t | tj �r�t
� }x*| jD ] }x|D ]}|j t|�� qlW qbW |S t d| ��dS )zf Accepts a pytree Pattern Node and returns a set
of the pattern types which will match first. Nz$Oh no! I don't understand pattern %s)
�
isinstancer Z NodePatternZ LeafPattern�typer ZNegatedPatternZcontent�_get_head_typesZWildcardPattern�set�update� Exception)Zpat�r�p�xr r r r$ / s
r$ c C s� t jt�}g }x�| D ]|}|jrjyt|j�}W n tk
rJ |j|� Y q�X xB|D ]}|| j|� qRW q|jdk r�||j j|� q|j|� qW x,tt j
j j � t j
j
�D ]}|| j|� q�W t|�S )z^ Accepts a list of fixers and returns a dictionary
of head node type --> fixer list. N)� collections� defaultdict�list�patternr$ r r Z _accept_typer r �python_grammarZ
symbol2number�values�tokens�extend�dict)Z
fixer_listZ
head_nodesZevery�fixerZheadsZ node_typer r r �_get_headnode_dictK s"
r5 c s � fdd�t � d�D �S )zN
Return the fully qualified names for fixers in the package pkg_name.
c s g | ]}� d | �qS )�.r )�.0�fix_name)�pkg_namer r �
<listcomp>h s z+get_fixers_from_package.<locals>.<listcomp>F)r )r9 r )r9 r �get_fixers_from_packaged s
r; c C s | S )Nr )�objr r r � _identityk s r= r c C s | j dd�S )Nz
�
)�replace)�inputr r r �_from_system_newlinesr s rA c C s t jdkr| jdt j�S | S d S )Nr> )r �linesepr? )r@ r r r �_to_system_newlinest s
rC c sT d}t jtj| �j�� � fdd�}ttjt jtj h�}t
� }y�x�|� \}}||krVq@q@|tj krl|rfP d}q@|tj ko||dk�r,|� \}}|tj ks�|dkr�P |� \}}|tj ks�|dkr�P |� \}}|tj
kr�|dkr�|� \}}xJ|tj k�r(|j|� |� \}}|tj
k�s|d k�r P |� \}}q�W q@P q@W W n tk
�rJ Y nX t|�S )
NFc s t � �} | d | d fS )Nr r )�next)�tok)�genr r �advance� s z(_detect_future_features.<locals>.advanceT�fromZ
__future__�import�(�,)r �generate_tokens�io�StringIO�readline� frozensetr �NEWLINE�NL�COMMENTr% �STRING�NAME�OP�add�
StopIteration)�sourceZhave_docstringrG �ignore�features�tp�valuer )rF r �_detect_future_features sD
r^ c @ s e Zd ZdZdS )�
FixerErrorz A fixer could not be loaded.N)r r r! �__doc__r r r r r_ � s r_ c @ s� e Zd Zddd�ZdZdZd4dd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d5dd�Z d6dd�Z
dd� Zd7dd�Zdd� Zd8d d �Zd d � Zd d!� Zd9d"d#�Zd:d$d%�Zd&Zd'Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Z d2d3� Z dS );�RefactoringToolF)�print_function�write_unchanged_filesZFixr Nc C s2 || _ |p g | _| jj� | _|dk r0| jj|� | jd rDtj| _ntj | _| jj
d�| _ g | _ t
jd�| _g | _d| _tj| jtj| jd�| _| j� \| _| _g | _tj� | _ g | _ g | _ xXt | j| j�D ]F}|j r�| j j!|� q�|| jkr�| j j"|� q�|| jkr�| j j"|� q�W t#| j �| _$t#| j �| _%dS )z�Initializer.
Args:
fixer_names: a list of fixers to import
options: a dict with configuration.
explicit: a list of fixers to run even if they are explicit.
Nrb rc ra F)�convert�logger)&�fixers�explicit�_default_options�copy�optionsr& r �!python_grammar_no_print_statement�grammarr/ �getrc �errors�loggingZ getLoggerre � fixer_log�wroter ZDriverr rd �
get_fixers� pre_order�
post_order�files�bmZ
BottomMatcher�BMZ
bmi_pre_orderZbmi_post_orderr Z
BM_compatibleZ add_fixerr r5 �bmi_pre_order_heads�bmi_post_order_heads)�selfZ fixer_namesrj rg r4 r r r �__init__� s<
zRefactoringTool.__init__c C s\ g }g }�x&| j D �]}t|i i dg�}|jdd�d }|j| j�rV|t| j�d� }|jd�}| jdjdd� |D �� }yt ||�}W n$ t
k
r� t d ||f ��Y nX || j | j
�} | jr�| jd
k r�|| jkr�| jd |� q| jd |� | jd
k�r|j| � q| jdk�r |j| � qt d| j ��qW tjd�}
|j|
d� |j|
d� ||fS )a Inspects the options to load the requested patterns and handlers.
Returns:
(pre_order, post_order), where pre_order is the list of fixers that
want a pre-order AST traversal, and post_order is the list that want
post-order traversal.
r r6 r N�_� c S s g | ] }|j � �qS r )�title)r7 r) r r r r: � s z.RefactoringTool.get_fixers.<locals>.<listcomp>zCan't find %s.%sTzSkipping optional fixer: %szAdding transformation: %sZpreZpostzIllegal fixer order: %rZ run_order)�key���)rf r �rsplitr � FILE_PREFIX�len�split� CLASS_PREFIX�join�getattr�AttributeErrorr_ rj rp rg � log_message� log_debug�orderr �operator�
attrgetter�sort) rz Zpre_order_fixersZpost_order_fixersZ fix_mod_path�modr8 �parts�
class_nameZ fix_classr4 Zkey_funcr r r rr � s8
zRefactoringTool.get_fixersc O s � dS )z Called when an error occurs.Nr )rz �msg�args�kwdsr r r � log_error s zRefactoringTool.log_errorc G s |r || }| j j|� dS )zHook to log a message.N)re �info)rz r� r� r r r r� s zRefactoringTool.log_messagec G s |r || }| j j|� d S )N)re �debug)rz r� r� r r r r� s zRefactoringTool.log_debugc C s dS )zTCalled with the old version, new version, and filename of a
refactored file.Nr )rz �old_text�new_text�filename�equalr r r � print_output s z RefactoringTool.print_outputc C s< x6|D ].}t jj|�r&| j|||� q| j|||� qW dS )z)Refactor a list of files and directories.N)r r �isdir� refactor_dir�
refactor_file)rz �items�write�
doctests_onlyZ dir_or_filer r r �refactor# s
zRefactoringTool.refactorc
C s� t jd }x�t j|�D ]�\}}}| jd|� |j� |j� xH|D ]@}|jd� rBt jj|�d |krBt jj||�} | j | ||� qBW dd� |D �|dd�< qW dS )z�Descends down a directory and refactor every Python file found.
Python files are assumed to have a .py extension.
Files and subdirectories starting with '.' are skipped.
�pyzDescending into %sr6 r c S s g | ]}|j d �s|�qS )r6 )r )r7 Zdnr r r r: > s z0RefactoringTool.refactor_dir.<locals>.<listcomp>N)
r �extsep�walkr� r� r r �splitextr� r� )
rz Zdir_namer� r� Zpy_ext�dirpathZdirnames� filenamesr �fullnamer r r r� , s
z RefactoringTool.refactor_dirc C s� yt |d�}W n. tk
r< } z| jd||� dS d}~X nX ztj|j�d }W d|j� X t|d|d��}t|j � �|fS Q R X dS )zG
Do our best to decode a Python source file correctly.
�rbzCan't open %s: %sNr r( )�encoding)NN)
�open�OSErrorr� r �detect_encodingrO �close�_open_with_encodingrA �read)rz r� �f�errr� r r r �_read_python_source@ s
z#RefactoringTool._read_python_sourcec C s� | j |�\}}|dkrdS |d7 }|rn| jd|� | j||�}| jsL||kr`| j|||||� q�| jd|� nH| j||�}| js�|r�|jr�| jt|�dd� |||d� n | jd|� dS ) zRefactors a file.Nr> zRefactoring doctests in %szNo doctest changes in %sr )r� r� zNo changes in %sr� )r� r� �refactor_docstringrc �processed_file�refactor_string� was_changed�str)rz r� r� r� r@ r� �output�treer r r r� P s z RefactoringTool.refactor_filec C s� t |�}d|krtj| j_zJy| jj|�}W n4 tk
r` } z| jd||jj |� dS d}~X nX W d| j| j_X ||_
| j d|� | j ||� |S )aF Refactor a given input string.
Args:
data: a string holding the code to be refactored.
name: a human-readable name for use in error/log messages.
Returns:
An AST corresponding to the refactored input stream; None if
there were errors during the parse.
rb zCan't parse %s: %s: %sNzRefactoring %s)
r^ r rk r rl Z parse_stringr' r� � __class__r �future_featuresr� �
refactor_tree)rz �datar r[ r� r� r r r r� g s
z RefactoringTool.refactor_stringc C s� t jj� }|rN| jd� | j|d�}| js2||krB| j|d|� q�| jd� n:| j|d�}| jsj|r~|jr~| jt |�d|� n
| jd� d S )Nz Refactoring doctests in stdinz<stdin>zNo doctest changes in stdinzNo changes in stdin)
�sys�stdinr� r� r� rc r� r� r� r� )rz r� r@ r� r� r r r �refactor_stdin� s
z RefactoringTool.refactor_stdinc
C s� x"t | j| j�D ]}|j||� qW | j| j|j� � | j| j|j� � | jj|j � �}�xvt
|j � ��rАx`| jj D �]R}||ko�|| rv|| j
tjjdd� |jr�|| j
tjjd� �x
t|| �D � ]�}||| kr�|| j|� y t|� W n tk
�r w�Y nX |j�r(||jk�r(q�|j|�}|r�|j||�}|dk r�|j|� x,|j� D ] }|j�spg |_|jj|� �q^W | jj|j � �}x2|D ]*} | |k�r�g || < || j || � �q�W q�W qvW q\W x$t | j| j�D ]}|j ||� �q�W |j S )a� Refactors a parse tree (modifying the tree in place).
For compatible patterns the bottom matcher module is
used. Otherwise the tree is traversed node-to-node for
matches.
Args:
tree: a pytree.Node instance representing the root of the tree
to be refactored.
name: a human-readable name for this tree.
Returns:
True if the tree was modified, False otherwise.
T)r �reverse)r N) r rs rt Z
start_tree� traverse_byrx ry rw ZrunZleaves�anyr0 rf r� r ZBaseZdepthZkeep_line_orderZ
get_linenor- �remover �
ValueErrorZfixers_applied�match� transformr? r r2 Z finish_treer� )
rz r� r r4 Z match_set�node�results�newZ new_matchesZfxrr r r r� � sJ
$z RefactoringTool.refactor_treec C s^ |sdS xP|D ]H}xB||j D ]4}|j|�}|r |j||�}|dk r |j|� |}q W qW dS )a Traverse an AST, applying a set of fixers to each node.
This is a helper method for refactor_tree().
Args:
fixers: a list of fixer instances.
traversal: a generator that yields AST nodes.
Returns:
None
N)r# r� r� r? )rz rf Z traversalr� r4 r� r� r r r r� � s
zRefactoringTool.traverse_byc C s� | j j|� |dkr.| j|�d }|dkr.dS ||k}| j||||� |r`| jd|� | js`dS |rv| j||||� n | jd|� dS )zR
Called when a file has been refactored and there may be changes.
Nr zNo changes to %szNot writing changes to %s)ru r r� r� r� rc �
write_file)rz r� r� r� r� r� r� r r r r� � s z RefactoringTool.processed_filec % C s� yt |d|d�}W n. tk
r@ } z| jd||� dS d}~X nX zHy|jt|�� W n0 tk
r� } z| jd||� W Y dd}~X nX W d|j� X | jd|� d| _dS )z�Writes a string to a file.
It first shows a unified diff between the old text and the new text, and
then rewrites the file; the latter is only done if the write option is
set.
�w)r� zCan't create %s: %sNzCan't write %s: %szWrote changes to %sT)r� r� r� r� rC r� r� rq )rz r� r� r� r� r� r� r r r r�
s $
zRefactoringTool.write_filez>>> z... c
C s g }d}d}d}d}x�|j dd�D ]�}|d7 }|j� j| j�r�|dk r\|j| j||||�� |}|g}|j| j�} |d| � }q"|dk r�|j|| j �s�||| jj� d kr�|j |� q"|dk r�|j| j||||�� d}d}|j |� q"W |dk �r|j| j||||�� dj
|�S )a� Refactors a docstring, looking for doctests.
This returns a modified version of the input string. It looks
for doctests, which start with a ">>>" prompt, and may be
continued with "..." prompts, as long as the "..." is indented
the same as the ">>>".
(Unfortunately we can't use the doctest module's parser,
since, like most parsers, it is not geared towards preserving
the original source.)
Nr T)�keependsr r> r} ) �
splitlines�lstripr �PS1r2 �refactor_doctest�find�PS2�rstripr r� )
rz r@ r� �result�blockZ block_lineno�indent�lineno�line�ir r r r� % s:
z"RefactoringTool.refactor_docstringc
s y�j ||� �}W nd tk
rv } zH�jjtj�rRx |D ]}�jd|jd�� q8W �jd|||j j
|� |S d}~X nX �j ||��r
t |�j
dd�}|d|d � ||d d� } }|d jd�s�|d d7 < � �j |jd� g}|�r
|� �fd d
�|D �7 }|S )
z�Refactors one doctest.
A doctest is given as a block of lines, the first of which starts
with ">>>" (possibly indented), while the remaining lines start
with "..." (identically indented).
z
Source: %sr> z+Can't parse docstring in %s line %s: %s: %sNT)r� r r c s g | ]}� �j | �qS r )r� )r7 r� )r� rz r r r: j s z4RefactoringTool.refactor_doctest.<locals>.<listcomp>r� r� )� parse_blockr' re Z isEnabledForro �DEBUGr� r� r� r� r r� r� r� r r� �pop)
rz r� r� r� r� r� r� r� r� Zclippedr )r� rz r r� P s$
"z RefactoringTool.refactor_doctestc C s� | j r d}nd}| js$| jd|� n&| jd|� x| jD ]}| j|� q8W | jrt| jd� x| jD ]}| j|� qbW | jr�t| j�dkr�| jd� n| jdt| j�� x&| jD ] \}}}| j|f|�|� q�W d S ) N�werez
need to bezNo files %s modified.zFiles that %s modified:z$Warnings/messages while refactoring:r zThere was 1 error:zThere were %d errors:)rq ru r� rp rn r� )rz r� �file�messager� r� r� r r r � summarizem s$
zRefactoringTool.summarizec C s" | j j| j|||��}t� |_|S )z�Parses a block into a tree.
This is necessary to get correct line number / offset information
in the parser diagnostics and embedded into the parse tree.
)r Z parse_tokens� wrap_toksrP r� )rz r� r� r� r� r r r r� � s zRefactoringTool.parse_blockc c sh t j| j||�j�}xN|D ]F\}}\}}\} }
} ||d 7 }| |d 7 } ||||f| |
f| fV qW dS )z;Wraps a tokenize stream to systematically modify start/end.r N)r rL � gen_lines�__next__) rz r� r� r� r1 r# r] Zline0Zcol0Zline1Zcol1Z line_textr r r r� � s
zRefactoringTool.wrap_toksc c s� || j }|| j }|}xV|D ]N}|j|�r@|t|�d� V n(||j� d krXdV ntd||f ��|}q W x
dV qrW dS )z�Generates lines as expected by tokenize from a list of lines.
This strips the first len(indent + self.PS1) characters off each line.
Nr> zline=%r, prefix=%rr} )r� r� r r� r� �AssertionError)rz r� r� �prefix1Zprefix2�prefixr� r r r r� � s
zRefactoringTool.gen_lines)NN)FF)FF)FF)F)NFN)N) r r r! rh r� r� r{ rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r ra � s:
4(
O
+
ra c @ s e Zd ZdS )�MultiprocessingUnsupportedN)r r r! r r r r r� � s r� c sB e Zd Z� fdd�Zd � fdd� Z� fdd�Z� fd d
�Z� ZS ) �MultiprocessRefactoringToolc s" t t| �j||� d | _d | _d S )N)�superr� r{ �queue� output_lock)rz r� �kwargs)r� r r r{ � s z$MultiprocessRefactoringTool.__init__Fr c s |dkr t t��j|||�S y dd l� W n tk
r@ t�Y nX �jd k rTtd��� j� �_� j � �_
� �fdd�t |�D �}z.x|D ] }|j � q�W t t��j|||� W d �jj
� x t |�D ]}�jjd � q�W x |D ]}|j� r�|j
� q�W d �_X d S )Nr r z already doing multiple processesc s g | ]}� j �jd ��qS ))�target)ZProcess�_child)r7 r� )�multiprocessingrz r r r: � s z8MultiprocessRefactoringTool.refactor.<locals>.<listcomp>)r� r� r� r� � ImportErrorr� r� � RuntimeErrorZ
JoinableQueueZLockr� �range�startr� �putZis_alive)rz r� r� r� Z
num_processesZ processesr) r� )r� )r� rz r r� � s2
z$MultiprocessRefactoringTool.refactorc
sR | j j� }xB|d k rL|\}}ztt| �j||� W d | j j� X | j j� }q W d S )N)r� rm r� r� r� Z task_done)rz Ztaskr� r� )r� r r r� � s
z"MultiprocessRefactoringTool._childc s2 | j d k r | j j||f� ntt| �j||�S d S )N)r� r� r� r� r� )rz r� r� )r� r r r� � s
z)MultiprocessRefactoringTool.refactor_file)FFr )r r r! r{ r� r� r� �
__classcell__r r )r� r r� � s
r� )T)r r )(r` �
__author__r r� ro r� r+ rM � itertoolsr Zpgen2r r r Z
fixer_utilr r} r r r
rv r r' r r$ r5 r; r= � version_info�codecsr� r� rA rC r^ r_ �objectra r� r� r r r r �<module> sF
( __pycache__/main.cpython-36.opt-1.pyc 0000644 00000020462 15053244155 0013275 0 ustar 00 3
\�- � @ s� d Z ddlmZmZ ddlZddlZddlZddlZddlZddl Z ddl
m Z dd� Z G dd � d e j
�Zd
d � Zdd d
�ZdS )z
Main program for 2to3.
� )�with_statement�print_functionN� )�refactorc C s( | j � } |j � }tj| |||dddd�S )z%Return a unified diff of two strings.z
(original)z (refactored)� )Zlineterm)�
splitlines�difflibZ unified_diff)�a�b�filename� r �$/usr/lib64/python3.6/lib2to3/main.py�
diff_texts s
r c s> e Zd ZdZd � fdd� Zdd� Z� fdd�Zd d
� Z� ZS ) �StdoutRefactoringToola2
A refactoring tool that can avoid overwriting its input files.
Prints output to stdout.
Output files can optionally be written to a different directory and or
have an extra file suffix appended to their name for use in situations
where you do not want to replace the input files.
r c sR || _ || _|r(|jtj� r(|tj7 }|| _|| _|| _tt | �j
|||� dS )aF
Args:
fixers: A list of fixers to import.
options: A dict with RefactoringTool configuration.
explicit: A list of fixers to run even if they are explicit.
nobackups: If true no backup '.bak' files will be created for those
files that are being refactored.
show_diffs: Should diffs of the refactoring be printed to stdout?
input_base_dir: The base directory for all input files. This class
will strip this path prefix off of filenames before substituting
it with output_dir. Only meaningful if output_dir is supplied.
All files processed by refactor() must start with this path.
output_dir: If supplied, all converted files will be written into
this directory tree instead of input_base_dir.
append_suffix: If supplied, all files output by this tool will have
this appended to their filename. Useful for changing .py to
.py3 for example by passing append_suffix='3'.
N) � nobackups�
show_diffs�endswith�os�sep�_input_base_dir� _output_dir�_append_suffix�superr �__init__) �selfZfixers�options�explicitr r �input_base_dir�
output_dir�
append_suffix)� __class__r r
r $ s
z StdoutRefactoringTool.__init__c O s* | j j|||f� | jj|f|�|� d S )N)�errors�append�logger�error)r �msg�args�kwargsr r r
� log_errorA s z StdoutRefactoringTool.log_errorc
! s| |}| j rH|j| j�r6tjj| j |t| j�d � �}ntd|| jf ��| jrX|| j7 }||kr�tjj |�}tjj
|� r�|r�tj |� | j d||� | j
�s4|d }tjj|�r�ytj|� W n. tk
r� } z| j d|� W Y d d }~X nX ytj||� W n2 tk
�r2 } z| j d||� W Y d d }~X nX tt| �j} | ||||� | j
�sbtj||� ||k�rxtj||� d S )Nz5filename %s does not start with the input_base_dir %szWriting converted %s to %s.z.bakzCan't remove backup %szCan't rename %s to %s)r �
startswithr r �path�join�len�
ValueErrorr �dirname�isdir�makedirs� log_messager �lexists�remove�OSError�renamer r �
write_file�shutilZcopymode)
r Znew_textr Zold_text�encodingZ
orig_filenamer Zbackup�err�write)r r r
r6 E s@
z StdoutRefactoringTool.write_filec C s� |r| j d|� n�| j d|� | jr�t|||�}yX| jd k rp| j�& x|D ] }t|� qJW tjj� W d Q R X nx|D ] }t|� qvW W n" tk
r� t d|f � d S X d S )NzNo changes to %sz
Refactored %sz+couldn't encode %s's diff for your terminal)
r1 r r Z output_lock�print�sys�stdout�flush�UnicodeEncodeError�warn)r �old�newr ZequalZ
diff_lines�liner r r
� print_outputl s"
z"StdoutRefactoringTool.print_output)r r r ) �__name__�
__module__� __qualname__�__doc__r r( r6 rD �
__classcell__r r )r r
r s
'r c C s t d| f tjd� d S )Nz WARNING: %s)�file)r; r< �stderr)r% r r r
r@ � s r@ c s t jdd�}|jddddd� |jdd d
g d d � |jd
dddddd� |jddd
g dd � |jddddd� |jdddd d� |jd d dd d� |jd dd!d� |jd"d#dd$d� |jd%d&dd'd(d � |jd)d*dd+d,d-d.� |jd/d0dd1d� |jd2dd+d,d3d.� d'}i }|j|�\}}|j�r@d4|d5< |j�s:td6� d4|_|j�r\|j �r\|j d7� |j
�rx|j �rx|j d8� |j �r�|j �r�td9� |j �r�|j�r�|j d:� |j �r�t
d;� x tj� �D ]}t
|� �q�W |�s�d<S |�s t
d=tjd>� t
d?tjd>� d@S dA|k�r4d4}|j�r4t
dBtjd>� d@S |j�rDd4|dC< |j�rRtjntj}tjdD|dE� tjdF�}ttj� ��} t� fdGdH�|jD ��}
t� } |j �r�d'} x2|j D ](}
|
dIk�r�d4} n| j � dJ |
� �q�W | �r�| j | �n| }n
| j | �}|j |
�}t j!j"|�}|�rD|j#t j$� �rDt j!j%|� �rDt j!j&|�}|j�rh|j't j$�}|j(dK|j|� t)t*|�|t*| �|j|j ||j|j
dL�}|j+�s�|�r�|j,� nBy|j||j|j-|j.� W n& tj/k
�r� t
dMtjd>� dS X |j0� t1t2|j+��S )Nz�Main program.
Args:
fixer_pkg: the name of a package where the fixers are located.
args: optional; a list of command line arguments. If omitted,
sys.argv[1:] is used.
Returns a suggested exit status (0, 1, 2).
z2to3 [options] file|dir ...)Zusagez-dz--doctests_only�
store_truezFix up doctests only)�action�helpz-fz--fixr" z1Each FIX specifies a transformation; default: all)rM �defaultrN z-jz --processesZstorer �intzRun 2to3 concurrently)rM rO �typerN z-xz--nofixz'Prevent a transformation from being runz-lz --list-fixesz List available transformationsz-pz--print-functionz0Modify the grammar so that print() is a functionz-vz --verbosezMore verbose loggingz
--no-diffsz#Don't show diffs of the refactoringz-wz--writezWrite back modified filesz-nz --nobackupsFz&Don't write backups for modified filesz-oz --output-dir�strr zXPut output files in this directory instead of overwriting the input files. Requires -n.)rM rQ rO rN z-Wz--write-unchanged-fileszYAlso write files even if no changes were required (useful with --output-dir); implies -w.z --add-suffixzuAppend this string to all output filenames. Requires -n if non-empty. ex: --add-suffix='3' will generate .py3 files.T�write_unchanged_filesz&--write-unchanged-files/-W implies -w.z%Can't use --output-dir/-o without -n.z"Can't use --add-suffix without -n.z@not writing files and not printing diffs; that's not very usefulzCan't use -n without -wz2Available transformations for the -f/--fix option:r z1At least one file or directory argument required.)rJ zUse --help to show usage.� �-zCan't write to stdin.r z%(name)s: %(message)s)�format�levelz lib2to3.mainc 3 s | ]}� d | V qdS )z.fix_Nr )�.0�fix)� fixer_pkgr r
� <genexpr>� s zmain.<locals>.<genexpr>�allz.fix_z7Output in %r will mirror the input directory %r layout.)r r r z+Sorry, -j isn't supported on this platform.)3�optparseZ OptionParserZ
add_option�
parse_argsrS r: r@ r r r$ Z
add_suffixZno_diffsZ
list_fixesr; r Zget_all_fix_namesr< rK r �verbose�logging�DEBUG�INFOZ basicConfigZ getLogger�setZget_fixers_from_packageZnofixrY �add�union�
differencer r* � commonprefixr r r/ r. �rstrip�infor �sortedr! �refactor_stdinZ
doctests_onlyZ processesZMultiprocessingUnsupportedZ summarizerP �bool)rZ r& �parserrk �flagsr ZfixnamerW r# Z avail_fixesZunwanted_fixesr Z all_presentrY Z requestedZ fixer_namesr Zrtr )rZ r
�main� s�
ro )N)rH Z
__future__r r r< r r r` r7 r] r r r ZMultiprocessRefactoringToolr r@ ro r r r r
�<module> s g __pycache__/btm_matcher.cpython-36.opt-2.pyc 0000644 00000006443 15053244155 0014642 0 ustar 00 3
\� � @ sh d Z ddlZddlZddlmZ ddlmZ ddlmZ G dd� de �Z
G d d
� d
e �Z i a d d � Z
dS )
z+George Boutsioukis <gboutsioukis@gmail.com>� N)� defaultdict� )�pytree)� reduce_treec @ s e Zd Zej� Zdd� ZdS )�BMNodec C s" i | _ g | _ttj�| _d| _d S )N� )�transition_table�fixers�nextr �count�id�content)�self� r �+/usr/lib64/python3.6/lib2to3/btm_matcher.py�__init__ s zBMNode.__init__N)�__name__�
__module__� __qualname__� itertoolsr r r r r r r s r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) �
BottomMatcherc C s0 t � | _t� | _| jg| _g | _tjd�| _d S )NZRefactoringTool) �set�matchr �rootZnodesr �loggingZ getLoggerZlogger)r r r r r s
zBottomMatcher.__init__c C sL | j j|� t|j�}|j� }| j|| jd�}x|D ]}|j j|� q4W d S )N)�start)r �appendr Z pattern_treeZget_linear_subpattern�addr )r �fixerZtreeZlinear� match_nodesZ
match_noder r r � add_fixer% s
zBottomMatcher.add_fixerc C s� |s
|gS t |d t�rhg }xF|d D ]:}| j||d�}x&|D ] }|j| j|dd � |�� q>W q&W |S |d |jkr�t� }||j|d < n|j|d }|dd � r�| j|dd � |d�}n|g}|S d S )Nr )r r )�
isinstance�tupler �extendr r )r �patternr r � alternativeZ end_nodes�endZ next_noder r r r 1 s"
" zBottomMatcher.addc C s0 | j }tt�}�x|D �]}|}�x|�r&d|_x,|jD ]"}t|tj�r8|jdkr8d|_P q8W |j dkrp|j}n|j }||j
kr�|j
| }x�|j D ]"}||kr�g ||< || j |� q�W nd| j }|j
d k r�|j
jr�P ||j
k�r |j
| }x2|j D ](}||j� k�r g ||< || j |� q�W |j
}q$W qW |S )NT�;Fr )r r �listZ was_checkedZchildrenr! r ZLeaf�value�typer r r �parent�keys) r ZleavesZcurrent_ac_nodeZresultsZleafZcurrent_ast_nodeZchildZ
node_tokenr r r r �runS s>
zBottomMatcher.runc s* t d� � fdd�� � | j� t d� d S )Nz
digraph g{c s^ xX| j j� D ]J}| j | }td| j|jt|�t|j�f � |dkrNt|j� � |� q W d S )Nz%d -> %d [label=%s] //%sr )r r, �printr � type_repr�strr r
)ZnodeZ subnode_keyZsubnode)�
print_noder r r1 � s
z*BottomMatcher.print_ac.<locals>.print_node�})r. r )r r )r1 r �print_ac� s
zBottomMatcher.print_acN)r r r r r r r- r3 r r r r r s
"=r c C sH t s<ddlm} x*|jj� D ] \}}t|�tkr |t |< q W t j| | �S )Nr )�python_symbols)� _type_reprsZpygramr4 �__dict__�itemsr* �int�
setdefault)Ztype_numr4 �name�valr r r r/ � s r/ )�
__author__r r � collectionsr r r Z btm_utilsr �objectr r r5 r/ r r r r �<module> s __pycache__/fixer_util.cpython-36.pyc 0000644 00000027406 15053244155 0013571 0 ustar 00 3
\g; �
@ s� d Z ddlmZ ddlmZmZ ddlmZ ddl m
Z
dd� Z dd � Z d
d � Z
d d
� ZdWdd�Zdd� Zdd� Zdd� Ze � e
� fdd�ZdXdd�Zdd � Zd d � ZdYd d �Zd!d"� ZdZd#d$�Zd[d%d&�Zd'd(� Zd)d*� Z d+d,� Z d-d.� Z d/d0� Z d1d2d3d4d5d6d7d8d9d:h
Z d;d<� Z!d=a"d>a#d?a$d@a%dAdB� Z&dCdD� Z'dEdF� Z(dGdH� Z)dIdJ� Z*dKdL� Z+dMdN� Z,dOdP� Z-ej.ej/hZ0d\dQdR�Z1ej/ej.ej2hZ3dSdT� Z4d]dUdV�Z5dS )^z1Utility functions, node construction macros, etc.� )�token)�Leaf�Node)�python_symbols)�patcompc C s t tj| ttjd�|g�S )N�=)r �symsZargumentr r �EQUAL)�keyword�value� r �*/usr/lib64/python3.6/lib2to3/fixer_util.py�
KeywordArg s r c C s t tjd�S )N�()r r �LPARr r r r
�LParen s r c C s t tjd�S )N�))r r �RPARr r r r
�RParen s r c C sH t | t�s| g} t |t�s&d|_|g}ttj| ttjddd�g | �S )z Build an assignment statement� r )�prefix) �
isinstance�listr r r �atomr r r )�target�sourcer r r
�Assign s
r Nc C s t tj| |d�S )zReturn a NAME leaf)r )r r �NAME)�namer r r r
�Name$ s r c C s | t tjt� |g�gS )zA node tuple for obj.attr)r r �trailer�Dot)�obj�attrr r r
�Attr( s r$ c C s t tjd�S )z A comma leaf�,)r r �COMMAr r r r
�Comma, s r' c C s t tjd�S )zA period (.) leaf�.)r r �DOTr r r r
r! 0 s r! c C s4 t tj|j� |j� g�}| r0|jdt tj| �� |S )z-A parenthesised argument list, used by Call()r )r r r �clone� insert_child�arglist)�argsZlparenZrparen�noder r r
�ArgList4 s r/ c C s& t tj| t|�g�}|dk r"||_|S )zA function callN)r r �powerr/ r )Z func_namer- r r. r r r
�Call; s r1 c C s t tjd�S )zA newline literal�
)r r �NEWLINEr r r r
�NewlineB s r4 c C s t tjd�S )z A blank line� )r r r3 r r r r
� BlankLineF s r6 c C s t tj| |d�S )N)r )r r �NUMBER)�nr r r r
�NumberJ s r9 c C s" t tjttjd�| ttjd�g�S )z A numeric or string subscript�[�])r r r r r �LBRACE�RBRACE)Z
index_noder r r
� SubscriptM s r> c C s t tj| |d�S )z
A string leaf)r )r r �STRING)�stringr r r r
�StringS s rA c C s� d| _ d|_ d|_ ttjd�}d|_ ttjd�}d|_ ||||g}|rtd|_ ttjd�}d|_ |jttj||g�� ttj| ttj |�g�}ttj
ttj d�|ttj d�g�S )zuA list comprehension of the form [xp for fp in it if test].
If test is None, the "if test" part is omitted.
r5 r �for�in�ifr: r; )
r r r r �appendr r Zcomp_ifZ listmakerZcomp_forr r< r= ) Zxp�fp�itZtestZfor_leafZin_leafZ
inner_argsZif_leaf�innerr r r
�ListCompW s$
rI c C sZ x|D ] }|j � qW ttjd�ttj| dd�ttjddd�ttj|�g}ttj|�}|S )zO Return an import statement in the form:
from package import name_leafs�fromr )r �import)�remover r r r r �import_as_names� import_from)Z package_nameZ
name_leafsZleaf�children�impr r r
�
FromImporto s
rQ c C s� |d j � }|jtjkr"|j � }nttj|j � g�}|d }|rNdd� |D �}ttjtt|d �t|d ��ttj|d j � ||d j � g�g | �}| j |_ |S ) zfReturns an import statement and calls a method
of the module:
import module
module.name()r" �afterc S s g | ] }|j � �qS r )r* )�.0r8 r r r
�
<listcomp>� s z!ImportAndCall.<locals>.<listcomp>� r ZlparZrpar)
r* �typer r, r r0 r$ r r r )r. �results�namesr" Z
newarglistrR �newr r r
�
ImportAndCall� s
DrZ c C s� t | t�r | jt� t� gkr dS t | t�o�t| j�dko�t | jd t�o�t | jd t�o�t | jd t�o�| jd jdko�| jd jdkS )z(Does the node represent a tuple literal?T� rU r � r r )r r rO r r �lenr r )r. r r r
�is_tuple� s
r^ c C sX t | t�oVt| j�dkoVt | jd t�oVt | jd t�oV| jd jdkoV| jd jdkS )z'Does the node represent a list literal?r rU r: r; ���r_ )r r r] rO r r )r. r r r
�is_list� s
r` c C s t tjt� | t� g�S )N)r r r r r )r. r r r
� parenthesize� s ra �sortedr �set�any�all�tuple�sum�min�max� enumeratec c s( t | |�}x|r"|V t ||�}q W dS )al Follow an attribute chain.
If you have a chain of objects where a.foo -> b, b.foo-> c, etc,
use this to iterate over all objects in the chain. Iteration is
terminated by getattr(x, attr) is None.
Args:
obj: the starting object
attr: the name of the chaining attribute
Yields:
Each successive object in the chain.
N)�getattr)r" r# �nextr r r
�
attr_chain� s
rm zefor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
z�
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
z`
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
Fc C sr t s&tjt�atjt�atjt�ada tttg}x<t|t| d��D ](\}}i }|j||�rB|d | krBdS qBW dS )a Returns true if node is in an environment where all that is required
of it is being iterable (ie, it doesn't matter if it returns a list
or an iterator).
See test_map_nochange in test_fixers.py for some examples and tests.
T�parentr. F) �
pats_builtr Zcompile_pattern�p0�p1�p2�ziprm �match)r. Zpatterns�patternrn rW r r r
�in_special_context� s
rv c C s� | j }|dk r |jtjkr dS | j}|jtjtjfkr:dS |jtjkrX|j d | krXdS |jtj
ks�|jtj kr�|dk r�|jtj ks�|j d | kr�dS dS )zG
Check that something isn't an attribute or function name etc.
NFrU T)
Z prev_siblingrV r r) rn r �funcdef�classdef� expr_stmtrO Z
parametersZ
typedargslistr& )r. �prevrn r r r
�is_probably_builtin� s r{ c C sN xH| dk rH| j tjkr@t| j�dkr@| jd }|j tjkr@|jS | j} qW dS )z Find the indentation of *node*.Nr\ r r5 ) rV r �suiter] rO r �INDENTr rn )r. �indentr r r
�find_indentation s
r c C s> | j tjkr| S | j� } | jd }| _ttj| g�}||_|S )N)rV r r| r* rn r )r. rn r| r r r
�
make_suite s r� c C s( x"| j tjkr"| j} | std��qW | S )z Find the top level namespace.z,root found before file_input node was found.)rV r Z
file_inputrn �
ValueError)r. r r r
� find_root& s
r� c C s t |t|�| �}t|�S )z� Returns true if name is imported from package at the
top level of the tree which node belongs to.
To cover the case of an import like 'import foo', use
None for the package and 'foo' for the name. )� find_bindingr� �bool)�packager r. Zbindingr r r
�does_tree_import/ s r� c C s | j tjtjfkS )z0Returns true if the node is an import statement.)rV r � import_namerN )r. r r r
� is_import7 s r� c C s4 dd� }t |�}t| ||�r dS d }}xTt|j�D ]F\}}||�sFq4x(t|j|d� �D ]\}}||�sZP qZW || }P q4W |dkr�xDt|j�D ]6\}}|jtjkr�|jr�|jd jtjkr�|d }P q�W | dkr�t tj
t tj d�t tj |dd�g�} nt
| t tj |dd�g�} | t� g}
|j|t tj|
�� dS ) z\ Works like `does_tree_import` but adds an import statement
if it was not imported. c S s | j tjko | jo t| jd �S )NrU )rV r � simple_stmtrO r� )r. r r r
�is_import_stmt> s z$touch_import.<locals>.is_import_stmtNrU r rK r )r )r� r� rj rO rV r r� r r? r r� r r rQ r4 r+ ) r� r r. r� �rootZ
insert_pos�offset�idxZnode2�import_rO r r r
� touch_import; s4
r� c C s� �x�|j D �]�}d}|jtjkrVt| |j d �r4|S t| t|j d �|�}|rR|}�n4|jtjtjfkr�t| t|j d �|�}|r�|}�n |jtj k�rt| t|j d �|�}|r�|}nXx�t
|j dd� �D ]@\}}|jt j ko�|j
dkr�t| t|j |d �|�}|r�|}q�W nx|jtk�r6|j d j
| k�r6|}nTt|| |��rJ|}n@|jtjk�rft| ||�}n$|jtjk�r�t| |j d ��r�|}|r
|�s�|S t|�r
|S q
W dS )
z� Returns the node which binds variable name, otherwise None.
If optional argument package is supplied, only imports will
be returned.
See test cases for examples.Nr r\ r[ �:� rU r_ r_ )rO rV r Zfor_stmt�_findr� r� Zif_stmtZ
while_stmtZtry_stmtrj r �COLONr � _def_syms�_is_import_bindingr� ry r� )r r. r� �childZretr8 �iZkidr r r
r� i sH
r� c C sX |g}xL|rR|j � }|jdkr6|jtkr6|j|j� q|jtjkr|j| kr|S qW d S )N� )�poprV � _block_syms�extendrO r r r )r r. Znodesr r r
r� � s r� c C s� | j tjkr�| r�| jd }|j tjkrvx�|jD ]@}|j tjkrV|jd j|krp| S q0|j tjkr0|j|kr0| S q0W nL|j tjkr�|jd }|j tjkr�|j|kr�| S n|j tjkr�|j|kr�| S n�| j tj k�r�|r�t
| jd �j � |kr�dS | jd }|�rt d|��rdS |j tj
k�r.t ||��r.| S |j tjk�rf|jd }|j tjk�r�|j|k�r�| S n6|j tjk�r�|j|k�r�| S |�r�|j tjk�r�| S dS )z� Will reuturn node if node will import name, or node
will import * from package. None is returned otherwise.
See test cases for examples. r r\ Nr[ �asr_ )rV r r� rO Zdotted_as_namesZdotted_as_namer r r rN �str�stripr� rM Zimport_as_name�STAR)r. r r� rP r� Zlastr8 r r r
r� � s@
r� )N)NN)N)N)N)N)N)6�__doc__Zpgen2r Zpytreer r Zpygramr r r5 r r r r r r r$ r' r! r/ r1 r4 r6 r9 r> rA rI rQ rZ r^ r` ra Zconsuming_callsrm rp rq rr ro rv r{ r r� r� r� r� r� rx rw r� r� r r� r� r� r r r r
�<module> sZ
-
*
__pycache__/__main__.cpython-36.opt-2.pyc 0000644 00000000317 15053244155 0014067 0 ustar 00 3
\C � @ s& d dl Z ddlmZ e jed�� dS )� N� )�mainz
lib2to3.fixes)�sysr �exit� r r �(/usr/lib64/python3.6/lib2to3/__main__.py�<module> s __pycache__/pytree.cpython-36.pyc 0000644 00000061060 15053244155 0012721 0 ustar 00 3
\�m � @ s� d Z dZddlZddlZddlmZ dZi add� ZG dd � d e �Z
G d
d � d e
�Z G d d
� d
e
�Z dd� Z
G dd� de �ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�Zdd� ZdS ) z�
Python parse tree definitions.
This is a very concrete parse tree; we need to keep every token and
even the comments and whitespace between tokens.
There's also a pattern matching implementation here.
z#Guido van Rossum <guido@python.org>� N)�StringIOi���c C sH t s<ddlm} x*|jj� D ] \}}t|�tkr |t |< q W t j| | �S )N� )�python_symbols)� _type_reprsZpygramr �__dict__�items�type�int�
setdefault)Ztype_numr �name�val� r
�&/usr/lib64/python3.6/lib2to3/pytree.py� type_repr s r c @ s� e Zd ZdZdZdZf ZdZdZdd� Z dd� Z
dZ dd � Z d
d � Z
d d
� Zdd� Zdd� Zdd� Zdd� Zdd� Zedd� �Zedd� �Zd d � Zd d � Zd d!� Zejd&k r�d$d%� Z dS )'�Basez�
Abstract base class for Node and Leaf.
This provides some default functionality and boilerplate using the
template pattern.
A node may be a subnode of at most one parent.
NFc O s | t k std��tj| �S )z7Constructor that prevents Base from being instantiated.zCannot instantiate Base)r �AssertionError�object�__new__)�cls�args�kwdsr
r
r r 2 s z Base.__new__c C s | j |j k rtS | j|�S )zW
Compare two nodes for equality.
This calls the method _eq().
)� __class__�NotImplemented�_eq)�self�otherr
r
r �__eq__7 s z Base.__eq__c C s t �dS )a_
Compare two nodes for equality.
This is called by __eq__ and __ne__. It is only called if the two nodes
have the same type. This must be implemented by the concrete subclass.
Nodes should be considered equal if they have the same structure,
ignoring the prefix string and other context information.
N)�NotImplementedError)r r r
r
r r C s zBase._eqc C s t �dS )zr
Return a cloned (deep) copy of self.
This must be implemented by the concrete subclass.
N)r )r r
r
r �cloneN s z
Base.clonec C s t �dS )zx
Return a post-order iterator for the tree.
This must be implemented by the concrete subclass.
N)r )r r
r
r �
post_orderV s zBase.post_orderc C s t �dS )zw
Return a pre-order iterator for the tree.
This must be implemented by the concrete subclass.
N)r )r r
r
r � pre_order^ s zBase.pre_orderc C s� | j dk stt| ���|dk s"t�t|t�s2|g}g }d}xR| j jD ]F}|| kr�| sht| j j| |f��|dk rz|j|� d}qD|j|� qDW |s�t| j| |f��| j j� || j _x|D ] }| j |_ q�W d| _ dS )z/Replace this node with a new one in the parent.NFT) �parentr �str�
isinstance�list�children�extend�append�changed)r �newZ
l_children�found�ch�xr
r
r �replacef s&
z Base.replacec C s. | }x"t |t�s&|jsdS |jd }qW |jS )z9Return the line number which generated the invocant node.Nr )r# �Leafr% �lineno)r �noder
r
r �
get_lineno} s zBase.get_linenoc C s | j r| j j� d| _d S )NT)r! r( � was_changed)r r
r
r r( � s
z Base.changedc C sJ | j rFx>t| j j�D ].\}}|| kr| j j� | j j|= d| _ |S qW dS )z�
Remove the node from the tree. Returns the position of the node in its
parent's children before it was removed.
N)r! � enumerater% r( )r �ir0 r
r
r �remove� s
z Base.removec C sZ | j dkrdS xFt| j j�D ]6\}}|| kr y| j j|d S tk
rP dS X q W dS )z�
The node immediately following the invocant in their parent's children
list. If the invocant does not have a next sibling, it is None
Nr )r! r3 r% �
IndexError)r r4 �childr
r
r � next_sibling� s
zBase.next_siblingc C sP | j dkrdS x<t| j j�D ],\}}|| kr |dkr8dS | j j|d S q W dS )z�
The node immediately preceding the invocant in their parent's children
list. If the invocant does not have a previous sibling, it is None.
Nr r )r! r3 r% )r r4 r7 r
r
r � prev_sibling� s
zBase.prev_siblingc c s" x | j D ]}|j� E d H qW d S )N)r% �leaves)r r7 r
r
r r: � s z Base.leavesc C s | j d krdS d| j j� S )Nr r )r! �depth)r r
r
r r; � s
z
Base.depthc C s | j }|dkrdS |jS )z�
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
N� )r8 �prefix)r Znext_sibr
r
r �
get_suffix� s zBase.get_suffix� r c C s t | �jd�S )N�ascii)r" �encode)r r
r
r �__str__� s z Base.__str__)r? r ) �__name__�
__module__� __qualname__�__doc__r r! r% r2 Z was_checkedr r �__hash__r r r r r- r1 r( r5 �propertyr8 r9 r: r; r> �sys� version_inforB r
r
r
r r s0
r c @ s� e Zd ZdZd dd�Zdd� Zdd� Zejd kr4eZ d d � Z
d
d� Z dd� Z dd� Z
dd� Zdd� Zeee�Zdd� Zdd� Zdd � ZdS ) �Nodez+Concrete implementation for interior nodes.Nc C sx |dkst |��|| _t|�| _x*| jD ] }|jdksBt t|���| |_q(W |dk rZ|| _|rn|dd� | _nd| _dS )z�
Initializer.
Takes a type constant (a symbol number >= 256), a sequence of
child nodes, and an optional context keyword argument.
As a side effect, the parent pointers of the children are updated.
� N)r r r$ r% r! �reprr= �fixers_applied)r r r% �contextr= rN r+ r
r
r �__init__� s
z
Node.__init__c C s d| j jt| j�| jf S )z)Return a canonical string representation.z
%s(%s, %r))r rC r r r% )r r
r
r �__repr__� s z
Node.__repr__c C s dj tt| j��S )zk
Return a pretty string representation.
This reproduces the input source exactly.
r< )�join�mapr" r% )r r
r
r � __unicode__� s zNode.__unicode__r? r c C s | j | jf|j |jfkS )z Compare two nodes for equality.)r r% )r r r
r
r r � s zNode._eqc C s t | jdd� | jD �| jd�S )z$Return a cloned (deep) copy of self.c S s g | ] }|j � �qS r
)r )�.0r+ r
r
r �
<listcomp> s z Node.clone.<locals>.<listcomp>)rN )rK r r% rN )r r
r
r r s z
Node.clonec c s( x | j D ]}|j� E dH qW | V dS )z*Return a post-order iterator for the tree.N)r% r )r r7 r
r
r r s zNode.post_orderc c s( | V x | j D ]}|j� E dH qW dS )z)Return a pre-order iterator for the tree.N)r% r )r r7 r
r
r r
s zNode.pre_orderc C s | j s
dS | j d jS )zO
The whitespace and comments preceding this node in the input.
r< r )r% r= )r r
r
r �_prefix_getter s zNode._prefix_getterc C s | j r|| j d _d S )Nr )r% r= )r r= r
r
r �_prefix_setter s zNode._prefix_setterc C s( | |_ d| j| _ || j|< | j� dS )z�
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N)r! r% r( )r r4 r7 r
r
r � set_child! s
zNode.set_childc C s | |_ | jj||� | j� dS )z�
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N)r! r% �insertr( )r r4 r7 r
r
r � insert_child+ s zNode.insert_childc C s | |_ | jj|� | j� dS )z�
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N)r! r% r' r( )r r7 r
r
r � append_child4 s zNode.append_child)NNN)r? r )rC rD rE rF rP rQ rT rI rJ rB r r r r rW rX rH r= rY r[ r\ r
r
r
r rK � s$
rK c @ s� e Zd ZdZdZdZdZddg fdd�Zdd� Zd d
� Z e
j dkrFe Z d d
� Z
dd� Zdd� Zdd� Zdd� Zdd� Zdd� Zeee�ZdS )r. z'Concrete implementation for leaf nodes.r< r Nc C sf d| kodk n s t |��|dk r:|\| _\| _| _|| _|| _|dk rT|| _|dd� | _dS )z�
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
r rL N)r �_prefixr/ �columnr �valuerN )r r r_ rO r= rN r
r
r rP G s
z
Leaf.__init__c C s d| j j| j| jf S )z)Return a canonical string representation.z
%s(%r, %r))r rC r r_ )r r
r
r rQ Z s z
Leaf.__repr__c C s | j t| j� S )zk
Return a pretty string representation.
This reproduces the input source exactly.
)r= r" r_ )r r
r
r rT ` s zLeaf.__unicode__r? c C s | j | jf|j |jfkS )z Compare two nodes for equality.)r r_ )r r r
r
r r k s zLeaf._eqc C s$ t | j| j| j| j| jff| jd�S )z$Return a cloned (deep) copy of self.)rN )r. r r_ r= r/ r^ rN )r r
r
r r o s
z
Leaf.clonec c s
| V d S )Nr
)r r
r
r r: u s z Leaf.leavesc c s
| V dS )z*Return a post-order iterator for the tree.Nr
)r r
r
r r x s zLeaf.post_orderc c s
| V dS )z)Return a pre-order iterator for the tree.Nr
)r r
r
r r | s zLeaf.pre_orderc C s | j S )zP
The whitespace and comments preceding this token in the input.
)r] )r r
r
r rW � s zLeaf._prefix_getterc C s | j � || _d S )N)r( r] )r r= r
r
r rX � s zLeaf._prefix_setter)r? r )rC rD rE rF r] r/ r^ rP rQ rT rI rJ rB r r r: r r rW rX rH r= r
r
r
r r. > s&
r. c C sN |\}}}}|s|| j kr<t|�dkr.|d S t|||d�S t|||d�S dS )z�
Convert raw node information to a Node or Leaf instance.
This is passed to the parser driver which calls it whenever a reduction of a
grammar rule produces a new complete node, so that the tree is build
strictly bottom-up.
r r )rO N)Z
number2symbol�lenrK r. )ZgrZraw_noder r_ rO r% r
r
r �convert� s ra c @ sP e Zd ZdZdZdZdZdd� Zdd� Zdd� Z dd d
�Z
dd d �Z d
d� Z dS )� BasePatterna�
A pattern is a tree matching pattern.
It looks for a specific node type (token or symbol), and
optionally for a specific content.
This is an abstract base class. There are three concrete
subclasses:
- LeafPattern matches a single leaf node;
- NodePattern matches a single node (usually non-leaf);
- WildcardPattern matches a sequence of nodes of variable length.
Nc O s | t k std��tj| �S )z>Constructor that prevents BasePattern from being instantiated.z Cannot instantiate BasePattern)rb r r r )r r r r
r
r r � s zBasePattern.__new__c C sL t | j�| j| jg}x|r.|d d kr.|d= qW d| jjdjtt|��f S )Nr z%s(%s)z, ���rc ) r r �contentr r rC rR rS rM )r r r
r
r rQ � s
zBasePattern.__repr__c C s | S )z�
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
r
)r r
r
r �optimize� s zBasePattern.optimizec C sn | j dk r|j | j krdS | jdk rRd}|dk r4i }| j||�sDdS |rR|j|� |dk rj| jrj||| j< dS )a#
Does this pattern exactly match a node?
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
Default implementation for non-wildcard patterns.
NFT)r rd � _submatch�updater )r r0 �results�rr
r
r �match� s
zBasePattern.matchc C s t |�dkrdS | j|d |�S )z�
Does this pattern exactly match a sequence of nodes?
Default implementation for non-wildcard patterns.
r Fr )r` rj )r �nodesrh r
r
r � match_seq� s zBasePattern.match_seqc c s& i }|r"| j |d |�r"d|fV dS )z}
Generator yielding all matches for this pattern.
Default implementation for non-wildcard patterns.
r r N)rj )r rk ri r
r
r �generate_matches� s z BasePattern.generate_matches)N)N)
rC rD rE rF r rd r r rQ re rj rl rm r
r
r
r rb � s
rb c @ s* e Zd Zddd�Zd dd�Zd
dd�ZdS ) � LeafPatternNc C s\ |dk r(d| kodk n s(t |��|dk rFt|t�sFt t|���|| _|| _|| _dS )ap
Initializer. Takes optional type, content, and name.
The type, if given must be a token type (< 256). If not given,
this matches any *leaf* node; the content may still be required.
The content, if given, must be a string.
If a name is given, the matching node is stored in the results
dict under that key.
Nr rL )r r# r" rM r rd r )r r rd r r
r
r rP � s zLeafPattern.__init__c C s t |t�sdS tj| ||�S )z*Override match() to insist on a leaf node.F)r# r. rb rj )r r0 rh r
r
r rj s
zLeafPattern.matchc C s | j |jkS )a�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
)rd r_ )r r0 rh r
r
r rf s
zLeafPattern._submatch)NNN)N)N)rC rD rE rP rj rf r
r
r
r rn � s
rn c @ s$ e Zd ZdZddd�Zddd�ZdS ) � NodePatternFNc C s� |dk r|dkst |��|dk r|t|t� s8t t|���t|�}x:t|�D ].\}}t|t�sht ||f��t|t�rJd| _qJW || _ || _
|| _ dS )ad
Initializer. Takes optional type, content, and name.
The type, if given, must be a symbol type (>= 256). If the
type is None this matches *any* single node (leaf or not),
except if content is not None, in which it only matches
non-leaf nodes that also match the content pattern.
The content, if not None, must be a sequence of Patterns that
must match the node's children exactly. If the content is
given, the type must not be None.
If a name is given, the matching node is stored in the results
dict under that key.
NrL T) r r# r" rM r$ r3 rb �WildcardPattern� wildcardsr rd r )r r rd r r4 �itemr
r
r rP % s
zNodePattern.__init__c C s� | j rJx>t| j|j�D ],\}}|t|j�kr|dk r>|j|� dS qW dS t| j�t|j�krbdS x*t| j|j�D ]\}}|j||�srdS qrW dS )a�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
NTF)rq rm rd r% r` rg �ziprj )r r0 rh �cri �
subpatternr7 r
r
r rf B s
zNodePattern._submatch)NNN)N)rC rD rE rq rP rf r
r
r
r ro ! s
ro c @ s^ e Zd ZdZddedfdd�Zdd� Zddd �Zdd
d �Zd d
� Z dd� Z
dd� Z dd� Z dS )rp a
A wildcard pattern can match zero or more nodes.
This has all the flexibility needed to implement patterns like:
.* .+ .? .{m,n}
(a b c | d e | f)
(...)* (...)+ (...)? (...){m,n}
except it always uses non-greedy matching.
Nr c C s� d| ko | ko t kn s.t||f��|dk rzttt|��}t|�sXtt|���x |D ]}t|�s^tt|���q^W || _|| _|| _|| _ dS )a�
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optional minimum number of times to match, default 0
max: optional maximum number of times to match, default HUGE
name: optional name assigned to this match
[*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is
equivalent to (a b c | d e | f g h); if content is None,
this is equivalent to '.' in regular expression terms.
The min and max parameters work as follows:
min=0, max=maxint: .*
min=1, max=maxint: .+
min=0, max=1: .?
min=1, max=1: .
If content is not None, replace the dot with the parenthesized
list of alternatives, e.g. (a b c | d e | f g h)*
r N)
�HUGEr �tuplerS r` rM rd �min�maxr )r rd rx ry r �altr
r
r rP l s .
zWildcardPattern.__init__c C s� d}| j dk r<t| j �dkr<t| j d �dkr<| j d d }| jdkr�| jdkr�| j dkrft| jd�S |dk r�| j|jkr�|j� S | jdkr�t|t�r�|jdkr�| j|jkr�t|j | j|j | j|j |j�S | S )z+Optimize certain stacked wildcard patterns.Nr r )r ) rd r` rx ry ro r re r# rp )r ru r
r
r re � s
zWildcardPattern.optimizec C s | j |g|�S )z'Does this pattern exactly match a node?)rl )r r0 rh r
r
r rj � s zWildcardPattern.matchc C sR xL| j |�D ]>\}}|t|�kr |dk rF|j|� | jrFt|�|| j< dS q W dS )z4Does this pattern exactly match a sequence of nodes?NTF)rm r` rg r r$ )r rk rh rt ri r
r
r rl � s
zWildcardPattern.match_seqc c s: | j dkrXxJt| jdtt|�| j� �D ]*}i }| jrH|d|� || j< ||fV q(W n�| jdkrp| j|�V n�ttd�r�tj }t
� t_ z�y@x:| j |d�D ]*\}}| jr�|d|� || j< ||fV q�W W nR t k
�r x:| j
|�D ],\}}| j�r
|d|� || j< ||fV q�W Y nX W dttd��r4|t_ X dS )a"
Generator yielding matches for a sequence of nodes.
Args:
nodes: sequence of nodes
Yields:
(count, results) tuples where:
count: the match comprises nodes[:count];
results: dict containing named submatches.
Nr Z bare_name� getrefcountr )rd �rangerx r` ry r �_bare_name_matches�hasattrrI �stderrr �_recursive_matches� RuntimeError�_iterative_matches)r rk �countri Z save_stderrr
r
r rm � s.
"
z WildcardPattern.generate_matchesc c s t |�}d| jkr di fV g }x>| jD ]4}x.t||�D ] \}}||fV |j||f� q8W q(W x�|�rg }x�|D ]�\}} ||k rr|| jkrrxn| jD ]d}x^t|||d� �D ]H\}
} |
dkr�i }|j| � |j| � ||
|fV |j||
|f� q�W q�W qrW |}qbW dS )z(Helper to iteratively yield the matches.r N)r` rx rd rm r' ry rg ) r rk Znodelenrh rz rt ri Z new_results�c0�r0�c1�r1r
r
r r� � s*
z"WildcardPattern._iterative_matchesc C sx d}i }d}t |�}xH| r\||k r\d}x0| jD ]&}|d j|| |�r0|d7 }d}P q0W qW |d|� || j< ||fS )z(Special optimized matcher for bare_name.r FTr N)r` rd rj r )r rk r� ri �donery Zleafr
r
r r} � s
z"WildcardPattern._bare_name_matchesc c s� | j dk st�|| jkr"di fV || jk r�xr| j D ]h}xbt||�D ]T\}}xJ| j||d� |d �D ].\}}i }|j|� |j|� || |fV qfW qDW q4W dS )z(Helper to recursively yield the matches.Nr r )rd r rx ry rm r� rg ) r rk r� rz r� r� r� r� ri r
r
r r� s
"
z"WildcardPattern._recursive_matches)N)N)
rC rD rE rF rv rP re rj rl rm r� r} r� r
r
r
r rp ^ s #
- rp c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �NegatedPatternNc C s( |dk r t |t�s tt|���|| _dS )a
Initializer.
The argument is either a pattern or None. If it is None, this
only matches an empty sequence (effectively '$' in regex
lingo). If it is not None, this matches whenever the argument
pattern doesn't have any matches.
N)r# rb r rM rd )r rd r
r
r rP s zNegatedPattern.__init__c C s dS )NFr
)r r0 r
r
r rj ) s zNegatedPattern.matchc C s t |�dkS )Nr )r` )r rk r
r
r rl - s zNegatedPattern.match_seqc c sL | j d kr"t|�dkrHdi fV n&x| j j|�D ]
\}}d S W di fV d S )Nr )rd r` rm )r rk rt ri r
r
r rm 1 s
z NegatedPattern.generate_matches)N)rC rD rE rP rj rl rm r
r
r
r r� s
r� c c s� | sdi fV n�| d | dd� }}xl|j |�D ]^\}}|sJ||fV q2xDt |||d� �D ].\}}i }|j|� |j|� || |fV q^W q2W dS )aR
Generator yielding matches for a sequence of patterns and nodes.
Args:
patterns: a sequence of patterns
nodes: a sequence of nodes
Yields:
(count, results) tuples where:
count: the entire sequence of patterns matches nodes[:count];
results: dict containing named submatches.
r r N)rm rg ) Zpatternsrk �p�restr� r� r� r� ri r
r
r rm = s
rm )rF �
__author__rI �warnings�ior rv r r r r rK r. ra rb rn ro rp r� rm r
r
r
r �<module> s&
1nNV,= =# __pycache__/patcomp.cpython-36.pyc 0000644 00000012744 15053244155 0013061 0 ustar 00 3
\� � @ s� d Z dZddlZddlmZmZmZmZmZm Z ddl
m Z ddl
m Z G dd � d e
�Zd
d � ZG d d
� d
e�Zejejejdd�Zdd� Zdd� Zdd� ZdS )z�Pattern compiler.
The grammar is taken from PatternGrammar.txt.
The compiler compiles a pattern to a pytree.*Pattern instance.
z#Guido van Rossum <guido@python.org>� N� )�driver�literals�token�tokenize�parse�grammar)�pytree)�pygramc @ s e Zd ZdS )�PatternSyntaxErrorN)�__name__�
__module__� __qualname__� r r �'/usr/lib64/python3.6/lib2to3/patcomp.pyr s r c c sP t jt jt jh}tjtj| �j�}x(|D ] }|\}}}}}||kr(|V q(W dS )z6Tokenizes a string suppressing significant whitespace.N) r �NEWLINE�INDENT�DEDENTr �generate_tokens�io�StringIO�readline) �input�skip�tokensZ quintuple�type�value�start�endZ line_textr r r �tokenize_wrapper s
r c @ s: e Zd Zd
dd�Zddd�Zdd� Zdd d
�Zd d � ZdS )�PatternCompilerNc C sZ |dkrt j| _t j| _ntj|�| _t j| j�| _t j| _ t j
| _ tj | jt
d�| _dS )z^Initializer.
Takes an optional alternative filename for the pattern grammar.
N)Zconvert)r
Zpattern_grammarr Zpattern_symbols�symsr Z load_grammarZSymbolsZpython_grammarZ pygrammarZpython_symbols�pysymsZDriver�pattern_convert)�selfZ grammar_filer r r �__init__( s
zPatternCompiler.__init__Fc C sn t |�}y| jj||d�}W n0 tjk
rL } ztt|���W Y dd}~X nX |r`| j|�|fS | j|�S dS )z=Compiles a pattern string to a nested pytree.*Pattern object.)�debugN)r r Z parse_tokensr Z
ParseErrorr �str� compile_node)r$ r r& Z with_treer �root�er r r �compile_pattern7 s z PatternCompiler.compile_patternc
s� |j � jjkr|jd }|j � jjkrz� fdd�|jddd� D �}t|�dkrX|d S tjdd� |D �ddd�}|j� S |j � jj krʇ fd d�|jD �}t|�dkr�|d S tj|gddd�}|j� S |j � jj
kr�� j |jdd� �}tj |�}|j� S |j � jj
k�st�d}|j}t|�d
k�rR|d j tjk�rR|d j}|dd� }d}t|�dk�r�|d
j � jjk�r�|d }|dd� }� j ||�}|dk �r�|j � jjk�s�t�|j} | d }
|
j tjk�r�d} tj} n�|
j tjk�r�d} tj} np|
j tjk�r^| d j tjk�s t�t| �dk�s.t�� j| d � } } t| �d k�rh� j| d
�} n
d �sht�| dk�s|| dk�r�|j� }tj|gg| | d�}|dk �r�||_|j� S )zXCompiles a node, recursively.
This is one big switch on the node type.
r c s g | ]}� j |��qS r )r( )�.0�ch)r$ r r �
<listcomp>O s z0PatternCompiler.compile_node.<locals>.<listcomp>N� r c S s g | ]
}|g�qS r r )r, �ar r r r. R s )�min�maxc s g | ]}� j |��qS r )r( )r, r- )r$ r r r. V s � � F���r5 r5 r5 )r3 r4 )r r! ZMatcher�childrenZ Alternatives�lenr �WildcardPattern�optimizeZ AlternativeZ NegatedUnit�
compile_basicZNegatedPatternZUnit�AssertionErrorr �EQUALr ZRepeater�STARZHUGE�PLUS�LBRACE�RBRACE�get_int�name)
r$ �nodeZalts�pZunits�patternrB �nodes�repeatr6 Zchildr1 r2 r )r$ r r( C sh
"
z PatternCompiler.compile_nodec C sn t |�dkst�|d }|jtjkrDttj|j��}t j
t |�|�S |jtj k�r|j}|j
� r�|tkrttd| ��|dd � r�td��t j
t| �S |dkr�d }n,|jd�s�t| j|d �}|d kr�td| ��|dd � r�| j|d jd �g}nd }t j||�S nV|jdk�r | j|d �S |jd k�r\|d k�s:t�| j|d �}t j|ggddd
�S d �sjt|��d S ) Nr r zInvalid token: %rz Can't have details for token�any�_zInvalid symbol: %r�(�[)r1 r2 F)r7 r; r r �STRINGr' r Z
evalStringr r Z LeafPattern�_type_of_literal�NAME�isupper� TOKEN_MAPr �
startswith�getattrr" r( r6 Z NodePatternr8 )r$ rF rG rC r r Zcontent�
subpatternr r r r: � s<
z PatternCompiler.compile_basicc C s |j tjkst�t|j�S )N)r r �NUMBERr; �intr )r$ rC r r r rA � s zPatternCompiler.get_int)N)FF)N)r r
r r% r+ r( r: rA r r r r r & s
G
#r )rN rL rT ZTOKENc C s. | d j � rtjS | tjkr&tj| S d S d S )Nr )�isalphar rN r Zopmap)r r r r rM � s
rM c C s> |\}}}}|s|| j kr*tj|||d�S tj|||d�S dS )z9Converts raw node information to a Node or Leaf instance.)�contextN)Z
number2symbolr ZNodeZLeaf)r Z
raw_node_infor r rW r6 r r r r# � s r# c C s t � j| �S )N)r r+ )rE r r r r+ � s r+ )�__doc__�
__author__r Zpgen2r r r r r r � r r
� Exceptionr r �objectr rN rL rT rP rM r# r+ r r r r �<module> s
__pycache__/pytree.cpython-36.opt-2.pyc 0000644 00000035317 15053244155 0013667 0 ustar 00 3
\�m � @ s� d Z ddlZddlZddlmZ dZi add� ZG dd� de�Z G d d
� d
e �Z
G d d � d e �Z d
d� Z G dd� de�Z
G dd� de
�ZG dd� de
�ZG dd� de
�ZG dd� de
�Zdd� ZdS )z#Guido van Rossum <guido@python.org>� N)�StringIOi���c C sH t s<ddlm} x*|jj� D ] \}}t|�tkr |t |< q W t j| | �S )N� )�python_symbols)� _type_reprsZpygramr �__dict__�items�type�int�
setdefault)Ztype_numr �name�val� r
�&/usr/lib64/python3.6/lib2to3/pytree.py� type_repr s r c @ s� e Zd ZdZdZf ZdZdZdd� Zdd� Z dZ
dd� Z d d
� Z d d � Z
d
d� Zdd� Zdd� Zdd� Zdd� Zedd� �Zedd� �Zdd � Zd d � Zd d � Zejd%k r�d#d$� ZdS )&�BaseNFc O s
t j| �S )N)�object�__new__)�cls�args�kwdsr
r
r r 2 s z Base.__new__c C s | j |j k rtS | j|�S )N)� __class__�NotImplemented�_eq)�self�otherr
r
r �__eq__7 s z Base.__eq__c C s t �d S )N)�NotImplementedError)r r r
r
r r C s zBase._eqc C s t �d S )N)r )r r
r
r �cloneN s z
Base.clonec C s t �d S )N)r )r r
r
r �
post_orderV s zBase.post_orderc C s t �d S )N)r )r r
r
r � pre_order^ s zBase.pre_orderc C s� t |t�s|g}g }d}x:| jjD ].}|| krF|d k r@|j|� d}q"|j|� q"W | jj� || j_x|D ] }| j|_qlW d | _d S )NFT)�
isinstance�list�parent�children�extend�append�changed)r �newZ
l_children�found�ch�xr
r
r �replacef s
z Base.replacec C s. | }x"t |t�s&|jsd S |jd }qW |jS )Nr )r �Leafr# �lineno)r �noder
r
r �
get_lineno} s zBase.get_linenoc C s | j r| j j� d| _d S )NT)r" r& � was_changed)r r
r
r r& � s
z Base.changedc C sJ | j rFx>t| j j�D ].\}}|| kr| j j� | j j|= d | _ |S qW d S )N)r" � enumerater# r& )r �ir. r
r
r �remove� s
z Base.removec C sZ | j d krd S xFt| j j�D ]6\}}|| kr y| j j|d S tk
rP d S X q W d S )Nr )r" r1 r# �
IndexError)r r2 �childr
r
r � next_sibling� s
zBase.next_siblingc C sP | j d krd S x<t| j j�D ],\}}|| kr |dkr8d S | j j|d S q W d S )Nr r )r" r1 r# )r r2 r5 r
r
r � prev_sibling� s
zBase.prev_siblingc c s" x | j D ]}|j� E d H qW d S )N)r# �leaves)r r5 r
r
r r8 � s z Base.leavesc C s | j d krdS d| j j� S )Nr r )r" �depth)r r
r
r r9 � s
z
Base.depthc C s | j }|d krdS |jS )N� )r6 �prefix)r Znext_sibr
r
r �
get_suffix� s zBase.get_suffix� r c C s t | �jd�S )N�ascii)�str�encode)r r
r
r �__str__� s z Base.__str__)r= r ) �__name__�
__module__� __qualname__r r" r# r0 Z was_checkedr r �__hash__r r r r r+ r/ r& r3 �propertyr6 r7 r8 r9 r< �sys� version_inforA r
r
r
r r s.
r c @ s� e Zd Zd dd�Zdd� Zdd� Zejd kr0eZd
d � Z d d
� Z
dd� Z dd� Z dd� Z
dd� Zee
e�Zdd� Zdd� Zdd� ZdS ) �NodeNc C sR || _ t|�| _x| jD ]
}| |_qW |d k r4|| _|rH|d d � | _nd | _d S )N)r r! r# r" r; �fixers_applied)r r r# �contextr; rJ r) r
r
r �__init__� s
z
Node.__init__c C s d| j jt| j�| jf S )Nz
%s(%s, %r))r rB r r r# )r r
r
r �__repr__� s z
Node.__repr__c C s dj tt| j��S )Nr: )�join�mapr? r# )r r
r
r � __unicode__� s zNode.__unicode__r= r c C s | j | jf|j |jfkS )N)r r# )r r r
r
r r � s zNode._eqc C s t | jdd� | jD �| jd�S )Nc S s g | ] }|j � �qS r
)r )�.0r) r
r
r �
<listcomp> s z Node.clone.<locals>.<listcomp>)rJ )rI r r# rJ )r r
r
r r s z
Node.clonec c s( x | j D ]}|j� E d H qW | V d S )N)r# r )r r5 r
r
r r s zNode.post_orderc c s( | V x | j D ]}|j� E d H qW d S )N)r# r )r r5 r
r
r r
s zNode.pre_orderc C s | j s
dS | j d jS )Nr: r )r# r; )r r
r
r �_prefix_getter s zNode._prefix_getterc C s | j r|| j d _d S )Nr )r# r; )r r; r
r
r �_prefix_setter s zNode._prefix_setterc C s( | |_ d | j| _ || j|< | j� d S )N)r" r# r& )r r2 r5 r
r
r � set_child! s
zNode.set_childc C s | |_ | jj||� | j� d S )N)r" r# �insertr& )r r2 r5 r
r
r � insert_child+ s zNode.insert_childc C s | |_ | jj|� | j� d S )N)r" r# r% r& )r r5 r
r
r � append_child4 s zNode.append_child)NNN)r= r )rB rC rD rL rM rP rG rH rA r r r r rS rT rF r; rU rW rX r
r
r
r rI � s"
rI c @ s� e Zd ZdZdZdZddg fdd�Zdd� Zdd � Ze j
dkrBeZ d d � Z d
d� Z
dd� Zdd� Zdd� Zdd� Zdd� Zeee�ZdS )r, r: r Nc C sF |d k r|\| _ \| _| _|| _|| _|d k r4|| _ |d d � | _d S )N)�_prefixr- �columnr �valuerJ )r r r[ rK r; rJ r
r
r rL G s z
Leaf.__init__c C s d| j j| j| jf S )Nz
%s(%r, %r))r rB r r[ )r r
r
r rM Z s z
Leaf.__repr__c C s | j t| j� S )N)r; r? r[ )r r
r
r rP ` s zLeaf.__unicode__r= c C s | j | jf|j |jfkS )N)r r[ )r r r
r
r r k s zLeaf._eqc C s$ t | j| j| j| j| jff| jd�S )N)rJ )r, r r[ r; r- rZ rJ )r r
r
r r o s
z
Leaf.clonec c s
| V d S )Nr
)r r
r
r r8 u s z Leaf.leavesc c s
| V d S )Nr
)r r
r
r r x s zLeaf.post_orderc c s
| V d S )Nr
)r r
r
r r | s zLeaf.pre_orderc C s | j S )N)rY )r r
r
r rS � s zLeaf._prefix_getterc C s | j � || _d S )N)r& rY )r r; r
r
r rT � s zLeaf._prefix_setter)r= r )rB rC rD rY r- rZ rL rM rP rG rH rA r r r8 r r rS rT rF r; r
r
r
r r, > s$
r, c C sN |\}}}}|s|| j kr<t|�dkr.|d S t|||d�S t|||d�S d S )Nr r )rK )Z
number2symbol�lenrI r, )ZgrZraw_noder r[ rK r# r
r
r �convert� s r] c @ sL e Zd ZdZdZdZdd� Zdd� Zdd� Zddd �Z dd
d �Z
d d
� Z dS )� BasePatternNc O s
t j| �S )N)r r )r r r r
r
r r � s zBasePattern.__new__c C sL t | j�| j| jg}x|r.|d d kr.|d= qW d| jjdjtt|��f S )Nr z%s(%s)z, ���r_ ) r r �contentr r rB rN rO �repr)r r r
r
r rM � s
zBasePattern.__repr__c C s | S )Nr
)r r
r
r �optimize� s zBasePattern.optimizec C sn | j d k r|j | j krdS | jd k rRd }|d k r4i }| j||�sDdS |rR|j|� |d k rj| jrj||| j< dS )NFT)r r` � _submatch�updater )r r. �results�rr
r
r �match� s
zBasePattern.matchc C s t |�dkrdS | j|d |�S )Nr Fr )r\ rg )r �nodesre r
r
r � match_seq� s zBasePattern.match_seqc c s& i }|r"| j |d |�r"d|fV d S )Nr r )rg )r rh rf r
r
r �generate_matches� s z BasePattern.generate_matches)N)N) rB rC rD r r` r r rM rb rg ri rj r
r
r
r r^ � s
r^ c @ s* e Zd Zddd�Zd dd�Zd
dd�ZdS ) � LeafPatternNc C s& |d k r|d k r|| _ || _|| _d S )N)r r` r )r r r` r r
r
r rL � s
zLeafPattern.__init__c C s t |t�sdS tj| ||�S )NF)r r, r^ rg )r r. re r
r
r rg s
zLeafPattern.matchc C s | j |jkS )N)r` r[ )r r. re r
r
r rc s
zLeafPattern._submatch)NNN)N)N)rB rC rD rL rg rc r
r
r
r rk � s
rk c @ s$ e Zd ZdZddd�Zddd�ZdS ) � NodePatternFNc C sT |d k r|d k r>t |�}x$t|�D ]\}}t|t�r"d| _q"W || _|| _|| _d S )NT)r! r1 r �WildcardPattern� wildcardsr r` r )r r r` r r2 �itemr
r
r rL % s
zNodePattern.__init__c C s� | j rJx>t| j|j�D ],\}}|t|j�kr|d k r>|j|� dS qW dS t| j�t|j�krbdS x*t| j|j�D ]\}}|j||�srdS qrW dS )NTF)rn rj r` r# r\ rd �ziprg )r r. re �crf �
subpatternr5 r
r
r rc B s
zNodePattern._submatch)NNN)N)rB rC rD rn rL rc r
r
r
r rl ! s
rl c @ sZ e Zd Zddedfdd�Zdd� Zddd�Zdd d
�Zd d � Zd
d� Z dd� Z
dd� Z dS )rm Nr c C s@ |d k r$t tt |��}x |D ]}q W || _|| _|| _|| _d S )N)�tuplerO r` �min�maxr )r r` rt ru r �altr
r
r rL l s
zWildcardPattern.__init__c C s� d }| j d k r<t| j �dkr<t| j d �dkr<| j d d }| jdkr�| jdkr�| j d krft| jd�S |d k r�| j|jkr�|j� S | jdkr�t|t�r�|jdkr�| j|jkr�t|j | j|j | j|j |j�S | S )Nr r )r ) r` r\ rt ru rl r rb r rm )r rr r
r
r rb � s
zWildcardPattern.optimizec C s | j |g|�S )N)ri )r r. re r
r
r rg � s zWildcardPattern.matchc C sR xL| j |�D ]>\}}|t|�kr |d k rF|j|� | jrFt|�|| j< dS q W dS )NTF)rj r\ rd r r! )r rh re rq rf r
r
r ri � s
zWildcardPattern.match_seqc c s: | j d krXxJt| jdtt|�| j� �D ]*}i }| jrH|d |� || j< ||fV q(W n�| jdkrp| j|�V n�ttd�r�tj }t
� t_ z�y@x:| j |d�D ]*\}}| jr�|d |� || j< ||fV q�W W nR t k
�r x:| j
|�D ],\}}| j�r
|d |� || j< ||fV q�W Y nX W d ttd��r4|t_ X d S )Nr Z bare_name� getrefcountr )r` �rangert r\ ru r �_bare_name_matches�hasattrrG �stderrr �_recursive_matches� RuntimeError�_iterative_matches)r rh �countrf Z save_stderrr
r
r rj � s.
"
z WildcardPattern.generate_matchesc c s t |�}d| jkr di fV g }x>| jD ]4}x.t||�D ] \}}||fV |j||f� q8W q(W x�|�rg }x�|D ]�\}} ||k rr|| jkrrxn| jD ]d}x^t|||d � �D ]H\}
} |
dkr�i }|j| � |j| � ||
|fV |j||
|f� q�W q�W qrW |}qbW d S )Nr )r\ rt r` rj r% ru rd ) r rh Znodelenre rv rq rf Z new_results�c0�r0�c1�r1r
r
r r~ � s*
z"WildcardPattern._iterative_matchesc C sx d}i }d}t |�}xH| r\||k r\d}x0| jD ]&}|d j|| |�r0|d7 }d}P q0W qW |d |� || j< ||fS )Nr FTr )r\ r` rg r )r rh r rf �doneru Zleafr
r
r ry � s
z"WildcardPattern._bare_name_matchesc c s� || j krdi fV || jk r�xr| jD ]h}xbt||�D ]T\}}xJ| j||d � |d �D ].\}}i }|j|� |j|� || |fV qXW q6W q&W d S )Nr r )rt ru r` rj r| rd ) r rh r rv r� r� r� r� rf r
r
r r| s
"
z"WildcardPattern._recursive_matches)N)N) rB rC rD �HUGErL rb rg ri rj r~ ry r| r
r
r
r rm ^ s #
- rm c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �NegatedPatternNc C s |d k r|| _ d S )N)r` )r r` r
r
r rL s zNegatedPattern.__init__c C s dS )NFr
)r r. r
r
r rg ) s zNegatedPattern.matchc C s t |�dkS )Nr )r\ )r rh r
r
r ri - s zNegatedPattern.match_seqc c sL | j d kr"t|�dkrHdi fV n&x| j j|�D ]
\}}d S W di fV d S )Nr )r` r\ rj )r rh rq rf r
r
r rj 1 s
z NegatedPattern.generate_matches)N)rB rC rD rL rg ri rj r
r
r
r r� s
r� c c s� | sdi fV n�| d | dd � }}xl|j |�D ]^\}}|sJ||fV q2xDt |||d � �D ].\}}i }|j|� |j|� || |fV q^W q2W d S )Nr r )rj rd ) Zpatternsrh �p�restr� r� r� r� rf r
r
r rj = s
rj )�
__author__rG �warnings�ior r� r r r r rI r, r] r^ rk rl rm r� rj r
r
r
r �<module>
s$
1nNV,= =# __pycache__/pygram.cpython-36.opt-2.pyc 0000644 00000001715 15053244155 0013651 0 ustar 00 3
\� � @ s� d dl Z ddlmZ ddlmZ ddlmZ e jje jje �d�Z
e jje jje �d�Z G dd � d e �Z
ejd
e
�Ze
e�Zej� Zejd = ejd
e �Ze
e�ZdS ) � N� )�token)�driver)�pytreez Grammar.txtzPatternGrammar.txtc @ s e Zd Zdd� ZdS )�Symbolsc C s( x"|j j� D ]\}}t| ||� q W d S )N)Z
symbol2number�items�setattr)�selfZgrammar�nameZsymbol� r �&/usr/lib64/python3.6/lib2to3/pygram.py�__init__ s zSymbols.__init__N)�__name__�
__module__� __qualname__r
r r r r r s r Zlib2to3�print)�osZpgen2r r � r �path�join�dirname�__file__Z
_GRAMMAR_FILEZ_PATTERN_GRAMMAR_FILE�objectr Zload_packaged_grammarZpython_grammarZpython_symbols�copyZ!python_grammar_no_print_statement�keywordsZpattern_grammarZpattern_symbolsr r r r �<module> s __pycache__/fixer_util.cpython-36.opt-1.pyc 0000644 00000027406 15053244155 0014530 0 ustar 00 3
\g; �
@ s� d Z ddlmZ ddlmZmZ ddlmZ ddl m
Z
dd� Z dd � Z d
d � Z
d d
� ZdWdd�Zdd� Zdd� Zdd� Ze � e
� fdd�ZdXdd�Zdd � Zd d � ZdYd d �Zd!d"� ZdZd#d$�Zd[d%d&�Zd'd(� Zd)d*� Z d+d,� Z d-d.� Z d/d0� Z d1d2d3d4d5d6d7d8d9d:h
Z d;d<� Z!d=a"d>a#d?a$d@a%dAdB� Z&dCdD� Z'dEdF� Z(dGdH� Z)dIdJ� Z*dKdL� Z+dMdN� Z,dOdP� Z-ej.ej/hZ0d\dQdR�Z1ej/ej.ej2hZ3dSdT� Z4d]dUdV�Z5dS )^z1Utility functions, node construction macros, etc.� )�token)�Leaf�Node)�python_symbols)�patcompc C s t tj| ttjd�|g�S )N�=)r �symsZargumentr r �EQUAL)�keyword�value� r �*/usr/lib64/python3.6/lib2to3/fixer_util.py�
KeywordArg s r c C s t tjd�S )N�()r r �LPARr r r r
�LParen s r c C s t tjd�S )N�))r r �RPARr r r r
�RParen s r c C sH t | t�s| g} t |t�s&d|_|g}ttj| ttjddd�g | �S )z Build an assignment statement� r )�prefix) �
isinstance�listr r r �atomr r r )�target�sourcer r r
�Assign s
r Nc C s t tj| |d�S )zReturn a NAME leaf)r )r r �NAME)�namer r r r
�Name$ s r c C s | t tjt� |g�gS )zA node tuple for obj.attr)r r �trailer�Dot)�obj�attrr r r
�Attr( s r$ c C s t tjd�S )z A comma leaf�,)r r �COMMAr r r r
�Comma, s r' c C s t tjd�S )zA period (.) leaf�.)r r �DOTr r r r
r! 0 s r! c C s4 t tj|j� |j� g�}| r0|jdt tj| �� |S )z-A parenthesised argument list, used by Call()r )r r r �clone� insert_child�arglist)�argsZlparenZrparen�noder r r
�ArgList4 s r/ c C s& t tj| t|�g�}|dk r"||_|S )zA function callN)r r �powerr/ r )Z func_namer- r r. r r r
�Call; s r1 c C s t tjd�S )zA newline literal�
)r r �NEWLINEr r r r
�NewlineB s r4 c C s t tjd�S )z A blank line� )r r r3 r r r r
� BlankLineF s r6 c C s t tj| |d�S )N)r )r r �NUMBER)�nr r r r
�NumberJ s r9 c C s" t tjttjd�| ttjd�g�S )z A numeric or string subscript�[�])r r r r r �LBRACE�RBRACE)Z
index_noder r r
� SubscriptM s r> c C s t tj| |d�S )z
A string leaf)r )r r �STRING)�stringr r r r
�StringS s rA c C s� d| _ d|_ d|_ ttjd�}d|_ ttjd�}d|_ ||||g}|rtd|_ ttjd�}d|_ |jttj||g�� ttj| ttj |�g�}ttj
ttj d�|ttj d�g�S )zuA list comprehension of the form [xp for fp in it if test].
If test is None, the "if test" part is omitted.
r5 r �for�in�ifr: r; )
r r r r �appendr r Zcomp_ifZ listmakerZcomp_forr r< r= ) Zxp�fp�itZtestZfor_leafZin_leafZ
inner_argsZif_leaf�innerr r r
�ListCompW s$
rI c C sZ x|D ] }|j � qW ttjd�ttj| dd�ttjddd�ttj|�g}ttj|�}|S )zO Return an import statement in the form:
from package import name_leafs�fromr )r �import)�remover r r r r �import_as_names� import_from)Z package_nameZ
name_leafsZleaf�children�impr r r
�
FromImporto s
rQ c C s� |d j � }|jtjkr"|j � }nttj|j � g�}|d }|rNdd� |D �}ttjtt|d �t|d ��ttj|d j � ||d j � g�g | �}| j |_ |S ) zfReturns an import statement and calls a method
of the module:
import module
module.name()r" �afterc S s g | ] }|j � �qS r )r* )�.0r8 r r r
�
<listcomp>� s z!ImportAndCall.<locals>.<listcomp>� r ZlparZrpar)
r* �typer r, r r0 r$ r r r )r. �results�namesr" Z
newarglistrR �newr r r
�
ImportAndCall� s
DrZ c C s� t | t�r | jt� t� gkr dS t | t�o�t| j�dko�t | jd t�o�t | jd t�o�t | jd t�o�| jd jdko�| jd jdkS )z(Does the node represent a tuple literal?T� rU r � r r )r r rO r r �lenr r )r. r r r
�is_tuple� s
r^ c C sX t | t�oVt| j�dkoVt | jd t�oVt | jd t�oV| jd jdkoV| jd jdkS )z'Does the node represent a list literal?r rU r: r; ���r_ )r r r] rO r r )r. r r r
�is_list� s
r` c C s t tjt� | t� g�S )N)r r r r r )r. r r r
� parenthesize� s ra �sortedr �set�any�all�tuple�sum�min�max� enumeratec c s( t | |�}x|r"|V t ||�}q W dS )al Follow an attribute chain.
If you have a chain of objects where a.foo -> b, b.foo-> c, etc,
use this to iterate over all objects in the chain. Iteration is
terminated by getattr(x, attr) is None.
Args:
obj: the starting object
attr: the name of the chaining attribute
Yields:
Each successive object in the chain.
N)�getattr)r" r# �nextr r r
�
attr_chain� s
rm zefor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
z�
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
z`
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
Fc C sr t s&tjt�atjt�atjt�ada tttg}x<t|t| d��D ](\}}i }|j||�rB|d | krBdS qBW dS )a Returns true if node is in an environment where all that is required
of it is being iterable (ie, it doesn't matter if it returns a list
or an iterator).
See test_map_nochange in test_fixers.py for some examples and tests.
T�parentr. F) �
pats_builtr Zcompile_pattern�p0�p1�p2�ziprm �match)r. Zpatterns�patternrn rW r r r
�in_special_context� s
rv c C s� | j }|dk r |jtjkr dS | j}|jtjtjfkr:dS |jtjkrX|j d | krXdS |jtj
ks�|jtj kr�|dk r�|jtj ks�|j d | kr�dS dS )zG
Check that something isn't an attribute or function name etc.
NFrU T)
Z prev_siblingrV r r) rn r �funcdef�classdef� expr_stmtrO Z
parametersZ
typedargslistr& )r. �prevrn r r r
�is_probably_builtin� s r{ c C sN xH| dk rH| j tjkr@t| j�dkr@| jd }|j tjkr@|jS | j} qW dS )z Find the indentation of *node*.Nr\ r r5 ) rV r �suiter] rO r �INDENTr rn )r. �indentr r r
�find_indentation s
r c C s> | j tjkr| S | j� } | jd }| _ttj| g�}||_|S )N)rV r r| r* rn r )r. rn r| r r r
�
make_suite s r� c C s( x"| j tjkr"| j} | std��qW | S )z Find the top level namespace.z,root found before file_input node was found.)rV r Z
file_inputrn �
ValueError)r. r r r
� find_root& s
r� c C s t |t|�| �}t|�S )z� Returns true if name is imported from package at the
top level of the tree which node belongs to.
To cover the case of an import like 'import foo', use
None for the package and 'foo' for the name. )� find_bindingr� �bool)�packager r. Zbindingr r r
�does_tree_import/ s r� c C s | j tjtjfkS )z0Returns true if the node is an import statement.)rV r � import_namerN )r. r r r
� is_import7 s r� c C s4 dd� }t |�}t| ||�r dS d }}xTt|j�D ]F\}}||�sFq4x(t|j|d� �D ]\}}||�sZP qZW || }P q4W |dkr�xDt|j�D ]6\}}|jtjkr�|jr�|jd jtjkr�|d }P q�W | dkr�t tj
t tj d�t tj |dd�g�} nt
| t tj |dd�g�} | t� g}
|j|t tj|
�� dS ) z\ Works like `does_tree_import` but adds an import statement
if it was not imported. c S s | j tjko | jo t| jd �S )NrU )rV r � simple_stmtrO r� )r. r r r
�is_import_stmt> s z$touch_import.<locals>.is_import_stmtNrU r rK r )r )r� r� rj rO rV r r� r r? r r� r r rQ r4 r+ ) r� r r. r� �rootZ
insert_pos�offset�idxZnode2�import_rO r r r
� touch_import; s4
r� c C s� �x�|j D �]�}d}|jtjkrVt| |j d �r4|S t| t|j d �|�}|rR|}�n4|jtjtjfkr�t| t|j d �|�}|r�|}�n |jtj k�rt| t|j d �|�}|r�|}nXx�t
|j dd� �D ]@\}}|jt j ko�|j
dkr�t| t|j |d �|�}|r�|}q�W nx|jtk�r6|j d j
| k�r6|}nTt|| |��rJ|}n@|jtjk�rft| ||�}n$|jtjk�r�t| |j d ��r�|}|r
|�s�|S t|�r
|S q
W dS )
z� Returns the node which binds variable name, otherwise None.
If optional argument package is supplied, only imports will
be returned.
See test cases for examples.Nr r\ r[ �:� rU r_ r_ )rO rV r Zfor_stmt�_findr� r� Zif_stmtZ
while_stmtZtry_stmtrj r �COLONr � _def_syms�_is_import_bindingr� ry r� )r r. r� �childZretr8 �iZkidr r r
r� i sH
r� c C sX |g}xL|rR|j � }|jdkr6|jtkr6|j|j� q|jtjkr|j| kr|S qW d S )N� )�poprV � _block_syms�extendrO r r r )r r. Znodesr r r
r� � s r� c C s� | j tjkr�| r�| jd }|j tjkrvx�|jD ]@}|j tjkrV|jd j|krp| S q0|j tjkr0|j|kr0| S q0W nL|j tjkr�|jd }|j tjkr�|j|kr�| S n|j tjkr�|j|kr�| S n�| j tj k�r�|r�t
| jd �j � |kr�dS | jd }|�rt d|��rdS |j tj
k�r.t ||��r.| S |j tjk�rf|jd }|j tjk�r�|j|k�r�| S n6|j tjk�r�|j|k�r�| S |�r�|j tjk�r�| S dS )z� Will reuturn node if node will import name, or node
will import * from package. None is returned otherwise.
See test cases for examples. r r\ Nr[ �asr_ )rV r r� rO Zdotted_as_namesZdotted_as_namer r r rN �str�stripr� rM Zimport_as_name�STAR)r. r r� rP r� Zlastr8 r r r
r� � s@
r� )N)NN)N)N)N)N)N)6�__doc__Zpgen2r Zpytreer r Zpygramr r r5 r r r r r r r$ r' r! r/ r1 r4 r6 r9 r> rA rI rQ rZ r^ r` ra Zconsuming_callsrm rp rq rr ro rv r{ r r� r� r� r� r� rx rw r� r� r r� r� r� r r r r
�<module> sZ
-
*
__pycache__/btm_utils.cpython-36.pyc 0000644 00000013765 15053244155 0013424 0 ustar 00 3
\�& � @ s| d Z ddlmZ ddlmZmZ ddlmZmZ eZ eZ
ej Z eZ
dZdZdZG dd� de�Zdd
d �Zd d
� Zdd� Zd S )z0Utility functions used by the btm_matcher module� )�pytree)�grammar�token)�pattern_symbols�python_symbols� � c @ s: e Zd ZdZd
dd�Zdd� Zdd� Zd d
� Zd d � ZdS )�MinNodez�This class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatternsNc C s. || _ || _g | _d| _d | _g | _g | _d S )NF)�type�name�children�leaf�parent� alternatives�group)�selfr
r � r �)/usr/lib64/python3.6/lib2to3/btm_utils.py�__init__ s zMinNode.__init__c C s t | j�d t | j� S )N� )�strr
r )r r r r �__repr__ s zMinNode.__repr__c C s� | }g }x�|r�|j tkr`|jj|� t|j�t|j�krTt|j�g}g |_|j}q
n |j}d}P |j tkr�|j j|� t|j �t|j�kr�t
|j �}g |_ |j}q
n |j}d}P |j t j kr�|j
r�|j|j
� n |j|j � |j}q
W |S )z�Internal method. Returns a characteristic path of the
pattern tree. This method must be run for all leaves until the
linear subpatterns are merged into a singleN)r
�TYPE_ALTERNATIVESr �append�lenr �tupler �
TYPE_GROUPr � get_characteristic_subpattern� token_labels�NAMEr )r �node�subpr r r � leaf_to_root! s8
zMinNode.leaf_to_rootc C s& x | j � D ]}|j� }|r
|S q
W dS )a� Drives the leaf_to_root method. The reason that
leaf_to_root must be run multiple times is because we need to
reject 'group' matches; for example the alternative form
(a | b c) creates a group [b c] that needs to be matched. Since
matching multiple linear patterns overcomes the automaton's
capabilities, leaf_to_root merges each group into a single
choice based on 'characteristic'ity,
i.e. (a|b c) -> (a|b) if b more characteristic than c
Returns: The most 'characteristic'(as defined by
get_characteristic_subpattern) path for the compiled pattern
tree.
N)�leavesr" )r �lr! r r r �get_linear_subpatternK s z MinNode.get_linear_subpatternc c s. x | j D ]}|j� E dH qW | j s*| V dS )z-Generator that returns the leaves of the treeN)r r# )r �childr r r r# ` s zMinNode.leaves)NN) �__name__�
__module__� __qualname__�__doc__r r r" r% r# r r r r r s
*r Nc
C s� d}| j tjkr| jd } | j tjkr�t| j�dkrFt| jd |�}nJttd�}x>| jD ]4}| jj |�d rnqXt||�}|dk rX|jj
|� qXW �n| j tj k�rt| j�dkr�tt d�}x(| jD ] }t||�}|r�|jj
|� q�W |js�d}nt| jd |�}�n�| j tj
k�r�t| jd tj��rH| jd jdk�rHt| jd |�S t| jd tj��rn| jd jdk�s�t| j�dk�r�t| jd d��r�| jd jdk�r�dS d }d}d}d
}d} d
}
xn| jD ]d}|j tjk�r�d
}|}n*|j tjk�r�d }|} n|j tjk�r |}t|d��r�|jd k�r�d }
�q�W |
�rb| jd } t| d��rl| jdk�rl| jd } n
| jd } | j tjk�r�| jd
k�r�ttd�}n4tt| j��r�ttt| j�d�}nttt| j�d�}n\| j tjk�r | jjd�} | t k�r�tt | d�}nttj| d�}n| j tjk�r$t||�}|�rZ| jd jdk�rBd}n| jd jdk�rVnt �|�r�|dk �r�x8|jdd� D ]&}t||�}|dk �rz|jj
|� �qzW |�r�||_ |S )z�
Internal function. Reduces a compiled pattern tree to an
intermediate representation suitable for feeding the
automaton. This also trims off any optional pattern elements(like
[a], a*).
N� r )r
r �(�[�valueTF�=r �any�')r
r �*�+���) r
�symsZMatcherr Z Alternativesr � reduce_treer r �indexr Z Alternativer ZUnit�
isinstancer ZLeafr. �hasattrZDetailsZRepeaterr r �TYPE_ANY�getattr�pysyms�STRING�strip�tokens�NotImplementedErrorr )
r r Znew_noder& Zreducedr
Z details_nodeZalternatives_nodeZ has_repeaterZ
repeater_nodeZhas_variable_nameZ name_leafr r r r r6 g s�
r6 c s� t | t�s| S t| �dkr"| d S g }g }dddddg�g }d� xl| D ]d}tt|d d
� ��rFtt|� fd d
���r~|j|� qFtt|�fd d
���r�|j|� qF|j|� qFW |r�|} n|r�|} n|r�|} t| td
�S )z�Picks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
r r+ �in�for�if�not�Nonez[]().,:c S s t | �tkS )N)r
r )�xr r r �<lambda>� s z/get_characteristic_subpattern.<locals>.<lambda>c s t | t�o| � kS )N)r8 r )rF )� common_charsr r rG s c s t | t�o| � kS )N)r8 r )rF )� common_namesr r rG s )�key)r8 �listr r0 �rec_testr �max)Z subpatternsZsubpatterns_with_namesZ subpatterns_with_common_namesZ subpatterns_with_common_chars�
subpatternr )rH rI r r � s2
r c c s< x6| D ].}t |ttf�r*t||�E dH q||�V qW dS )zPTests test_func on all items of sequence and items of included
sub-iterablesN)r8 rK r rL )ZsequenceZ test_funcrF r r r rL s
rL r4 ������)N)r* � r Zpgen2r r Zpygramr r r5 r< Zopmapr? r r: r r �objectr r6 r rL r r r r �<module> s W
% __pycache__/btm_utils.cpython-36.opt-1.pyc 0000644 00000013765 15053244155 0014363 0 ustar 00 3
\�& � @ s| d Z ddlmZ ddlmZmZ ddlmZmZ eZ eZ
ej Z eZ
dZdZdZG dd� de�Zdd
d �Zd d
� Zdd� Zd S )z0Utility functions used by the btm_matcher module� )�pytree)�grammar�token)�pattern_symbols�python_symbols� � c @ s: e Zd ZdZd
dd�Zdd� Zdd� Zd d
� Zd d � ZdS )�MinNodez�This class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatternsNc C s. || _ || _g | _d| _d | _g | _g | _d S )NF)�type�name�children�leaf�parent� alternatives�group)�selfr
r � r �)/usr/lib64/python3.6/lib2to3/btm_utils.py�__init__ s zMinNode.__init__c C s t | j�d t | j� S )N� )�strr
r )r r r r �__repr__ s zMinNode.__repr__c C s� | }g }x�|r�|j tkr`|jj|� t|j�t|j�krTt|j�g}g |_|j}q
n |j}d}P |j tkr�|j j|� t|j �t|j�kr�t
|j �}g |_ |j}q
n |j}d}P |j t j kr�|j
r�|j|j
� n |j|j � |j}q
W |S )z�Internal method. Returns a characteristic path of the
pattern tree. This method must be run for all leaves until the
linear subpatterns are merged into a singleN)r
�TYPE_ALTERNATIVESr �append�lenr �tupler �
TYPE_GROUPr � get_characteristic_subpattern� token_labels�NAMEr )r �node�subpr r r � leaf_to_root! s8
zMinNode.leaf_to_rootc C s& x | j � D ]}|j� }|r
|S q
W dS )a� Drives the leaf_to_root method. The reason that
leaf_to_root must be run multiple times is because we need to
reject 'group' matches; for example the alternative form
(a | b c) creates a group [b c] that needs to be matched. Since
matching multiple linear patterns overcomes the automaton's
capabilities, leaf_to_root merges each group into a single
choice based on 'characteristic'ity,
i.e. (a|b c) -> (a|b) if b more characteristic than c
Returns: The most 'characteristic'(as defined by
get_characteristic_subpattern) path for the compiled pattern
tree.
N)�leavesr" )r �lr! r r r �get_linear_subpatternK s z MinNode.get_linear_subpatternc c s. x | j D ]}|j� E dH qW | j s*| V dS )z-Generator that returns the leaves of the treeN)r r# )r �childr r r r# ` s zMinNode.leaves)NN) �__name__�
__module__� __qualname__�__doc__r r r" r% r# r r r r r s
*r Nc
C s� d}| j tjkr| jd } | j tjkr�t| j�dkrFt| jd |�}nJttd�}x>| jD ]4}| jj |�d rnqXt||�}|dk rX|jj
|� qXW �n| j tj k�rt| j�dkr�tt d�}x(| jD ] }t||�}|r�|jj
|� q�W |js�d}nt| jd |�}�n�| j tj
k�r�t| jd tj��rH| jd jdk�rHt| jd |�S t| jd tj��rn| jd jdk�s�t| j�dk�r�t| jd d��r�| jd jdk�r�dS d }d}d}d
}d} d
}
xn| jD ]d}|j tjk�r�d
}|}n*|j tjk�r�d }|} n|j tjk�r |}t|d��r�|jd k�r�d }
�q�W |
�rb| jd } t| d��rl| jdk�rl| jd } n
| jd } | j tjk�r�| jd
k�r�ttd�}n4tt| j��r�ttt| j�d�}nttt| j�d�}n\| j tjk�r | jjd�} | t k�r�tt | d�}nttj| d�}n| j tjk�r$t||�}|�rZ| jd jdk�rBd}n| jd jdk�rVnt �|�r�|dk �r�x8|jdd� D ]&}t||�}|dk �rz|jj
|� �qzW |�r�||_ |S )z�
Internal function. Reduces a compiled pattern tree to an
intermediate representation suitable for feeding the
automaton. This also trims off any optional pattern elements(like
[a], a*).
N� r )r
r �(�[�valueTF�=r �any�')r
r �*�+���) r
�symsZMatcherr Z Alternativesr � reduce_treer r �indexr Z Alternativer ZUnit�
isinstancer ZLeafr. �hasattrZDetailsZRepeaterr r �TYPE_ANY�getattr�pysyms�STRING�strip�tokens�NotImplementedErrorr )
r r Znew_noder& Zreducedr
Z details_nodeZalternatives_nodeZ has_repeaterZ
repeater_nodeZhas_variable_nameZ name_leafr r r r r6 g s�
r6 c s� t | t�s| S t| �dkr"| d S g }g }dddddg�g }d� xl| D ]d}tt|d d
� ��rFtt|� fd d
���r~|j|� qFtt|�fd d
���r�|j|� qF|j|� qFW |r�|} n|r�|} n|r�|} t| td
�S )z�Picks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
r r+ �in�for�if�not�Nonez[]().,:c S s t | �tkS )N)r
r )�xr r r �<lambda>� s z/get_characteristic_subpattern.<locals>.<lambda>c s t | t�o| � kS )N)r8 r )rF )� common_charsr r rG s c s t | t�o| � kS )N)r8 r )rF )� common_namesr r rG s )�key)r8 �listr r0 �rec_testr �max)Z subpatternsZsubpatterns_with_namesZ subpatterns_with_common_namesZ subpatterns_with_common_chars�
subpatternr )rH rI r r � s2
r c c s< x6| D ].}t |ttf�r*t||�E dH q||�V qW dS )zPTests test_func on all items of sequence and items of included
sub-iterablesN)r8 rK r rL )ZsequenceZ test_funcrF r r r rL s
rL r4 ������)N)r* � r Zpgen2r r Zpygramr r r5 r< Zopmapr? r r: r r �objectr r6 r rL r r r r �<module> s W
% __pycache__/fixer_base.cpython-36.opt-2.pyc 0000644 00000006610 15053244155 0014460 0 ustar 00 3
\" � @ sP d dl Z ddlmZ ddlmZ ddlmZ G dd� de�ZG dd � d e�Z dS )
� N� )�PatternCompiler)�pygram)�does_tree_importc @ s� e Zd ZdZdZdZdZdZej d�Z
e � Z dZ
dZdZdZdZdZejZdd� Zdd � Zd
d � Zd d
� Zdd� Zd dd�Zdd� Z d dd�Z dd� Z dd� Z dd � Z dS ) �BaseFixNr ZpostF� c C s || _ || _| j� d S )N)�options�log�compile_pattern)�selfr r � r �*/usr/lib64/python3.6/lib2to3/fixer_base.py�__init__/ s zBaseFix.__init__c C s, | j d k r(t� }|j| j dd�\| _| _d S )NT)Z with_tree)�PATTERNr r
�pattern� pattern_tree)r �PCr r r
r
; s
zBaseFix.compile_patternc C s
|| _ d S )N)�filename)r r r r r
� set_filenameF s zBaseFix.set_filenamec C s d|i}| j j||�o|S )N�node)r �match)r r �resultsr r r
r M s z
BaseFix.matchc C s
t � �d S )N)�NotImplementedError)r r r r r r
� transformY s zBaseFix.transform�xxx_todo_changemec C s6 |}x || j kr$|tt| j�� }qW | j j|� |S )N)�
used_names�str�next�numbers�add)r �template�namer r r
�new_namei s
zBaseFix.new_namec C s. | j r d| _ | jjd| j � | jj|� d S )NFz### In file %s ###)� first_logr �appendr )r �messager r r
� log_messaget s zBaseFix.log_messagec C s> |j � }|j� }d|_d}| j|||f � |r:| j|� d S )N� z Line %d: could not convert: %s)�
get_linenoZclone�prefixr& )r r �reason�linenoZ
for_output�msgr r r
�cannot_convertz s zBaseFix.cannot_convertc C s |j � }| jd||f � d S )Nz Line %d: %s)r( r& )r r r* r+ r r r
�warning� s zBaseFix.warningc C s( |j | _ | j|� tjd�| _d| _d S )Nr T)r r � itertools�countr r# )r �treer r r r
�
start_tree� s
zBaseFix.start_treec C s d S )Nr )r r1 r r r r
� finish_tree� s zBaseFix.finish_tree)r )N)!�__name__�
__module__� __qualname__r r r r r r/ r0 r �setr �orderZexplicitZ run_orderZ _accept_typeZkeep_line_orderZ
BM_compatibler Zpython_symbolsZsymsr r
r r r r" r& r- r. r2 r3 r r r r
r s2
r c s( e Zd ZdZ� fdd�Zdd� Z� ZS )�ConditionalFixNc s t t| �j|� d | _d S )N)�superr9 r2 � _should_skip)r �args)� __class__r r
r2 � s zConditionalFix.start_treec C sJ | j d k r| j S | jjd�}|d }dj|d d� �}t|||�| _ | j S )N�.r ���r? )r; �skip_on�split�joinr )r r Zpkgr! r r r
� should_skip� s
zConditionalFix.should_skip)r4 r5 r6 r@ r2 rC �
__classcell__r r )r= r
r9 � s r9 )
r/ Zpatcompr r' r Z
fixer_utilr �objectr r9 r r r r
�<module> s __pycache__/btm_matcher.cpython-36.opt-1.pyc 0000644 00000011506 15053244155 0014635 0 ustar 00 3
\� � @ sl d Z dZddlZddlZddlmZ ddlmZ ddlm Z G dd � d e
�Z G d
d � d e
�Z i a
d d
� ZdS )a� A bottom-up tree matching algorithm implementation meant to speed
up 2to3's matching process. After the tree patterns are reduced to
their rarest linear path, a linear Aho-Corasick automaton is
created. The linear automaton traverses the linear paths from the
leaves to the root of the AST and returns a set of nodes for further
matching. This reduces significantly the number of candidate nodes.z+George Boutsioukis <gboutsioukis@gmail.com>� N)� defaultdict� )�pytree)� reduce_treec @ s e Zd ZdZej� Zdd� ZdS )�BMNodez?Class for a node of the Aho-Corasick automaton used in matchingc C s" i | _ g | _ttj�| _d| _d S )N� )�transition_table�fixers�nextr �count�id�content)�self� r �+/usr/lib64/python3.6/lib2to3/btm_matcher.py�__init__ s zBMNode.__init__N)�__name__�
__module__� __qualname__�__doc__� itertoolsr r r r r r r s r c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd S )
�
BottomMatcherzgThe main matcher class. After instantiating the patterns should
be added using the add_fixer methodc C s0 t � | _t� | _| jg| _g | _tjd�| _d S )NZRefactoringTool) �set�matchr �rootZnodesr �loggingZ getLoggerZlogger)r r r r r s
zBottomMatcher.__init__c C sL | j j|� t|j�}|j� }| j|| jd�}x|D ]}|j j|� q4W dS )z�Reduces a fixer's pattern tree to a linear path and adds it
to the matcher(a common Aho-Corasick automaton). The fixer is
appended on the matching states and called when they are
reached)�startN)r �appendr Z pattern_treeZget_linear_subpattern�addr )r �fixerZtreeZlinear� match_nodesZ
match_noder r r � add_fixer% s
zBottomMatcher.add_fixerc C s� |s
|gS t |d t�rhg }xF|d D ]:}| j||d�}x&|D ] }|j| j|dd� |�� q>W q&W |S |d |jkr�t� }||j|d < n|j|d }|dd� r�| j|dd� |d�}n|g}|S dS )z5Recursively adds a linear pattern to the AC automatonr )r r N)�
isinstance�tupler �extendr r )r �patternr r � alternativeZ end_nodes�endZ next_noder r r r 1 s"
" zBottomMatcher.addc C s0 | j }tt�}�x|D �]}|}�x|�r&d|_x,|jD ]"}t|tj�r8|jdkr8d|_P q8W |j dkrp|j}n|j }||j
kr�|j
| }x�|j D ]"}||kr�g ||< || j |� q�W nd| j }|j
dk r�|j
jr�P ||j
k�r |j
| }x2|j D ](}||j� k�r g ||< || j |� q�W |j
}q$W qW |S )au The main interface with the bottom matcher. The tree is
traversed from the bottom using the constructed
automaton. Nodes are only checked once as the tree is
retraversed. When the automaton fails, we give it one more
shot(in case the above tree matches as a whole with the
rejected leaf), then we break for the next leaf. There is the
special case of multiple arguments(see code comments) where we
recheck the nodes
Args:
The leaves of the AST tree to be matched
Returns:
A dictionary of node matches with fixers as the keys
T�;Fr N)r r �listZ was_checkedZchildrenr" r ZLeaf�value�typer r r �parent�keys) r ZleavesZcurrent_ac_nodeZresultsZleafZcurrent_ast_nodeZchildZ
node_tokenr r r r �runS s>
zBottomMatcher.runc s* t d� � fdd�� � | j� t d� dS )z<Prints a graphviz diagram of the BM automaton(for debugging)z
digraph g{c s^ xX| j j� D ]J}| j | }td| j|jt|�t|j�f � |dkrNt|j� � |� q W d S )Nz%d -> %d [label=%s] //%sr )r r- �printr � type_repr�strr r
)ZnodeZ subnode_keyZsubnode)�
print_noder r r2 � s
z*BottomMatcher.print_ac.<locals>.print_node�}N)r/ r )r r )r2 r �print_ac� s
zBottomMatcher.print_acN) r r r r r r! r r. r4 r r r r r s "=r c C sH t s<ddlm} x*|jj� D ] \}}t|�tkr |t |< q W t j| | �S )Nr )�python_symbols)� _type_reprsZpygramr5 �__dict__�itemsr+ �int�
setdefault)Ztype_numr5 �name�valr r r r0 � s r0 )r �
__author__r r � collectionsr r r Z btm_utilsr �objectr r r6 r0 r r r r �<module> s __pycache__/fixer_base.cpython-36.opt-1.pyc 0000644 00000014121 15053244155 0014453 0 ustar 00 3
\" � @ sT d Z ddlZddlmZ ddlmZ ddlmZ G dd� de�Z G d d
� d
e �Z
dS ) z2Base class for fixers (optional, but recommended).� N� )�PatternCompiler)�pygram)�does_tree_importc @ s� e Zd ZdZdZdZdZdZdZe j
d�Z e � Z
dZdZdZdZdZdZejZdd� Zd d
� Zd d � Zd
d� Zdd� Zd dd�Z dd� Z d dd�Z dd� Z dd� Z d d � Z!dS ) �BaseFixa Optional base class for fixers.
The subclass name must be FixFooBar where FooBar is the result of
removing underscores and capitalizing the words of the fix name.
For example, the class name for a fixer named 'has_key' should be
FixHasKey.
Nr ZpostF� c C s || _ || _| j� dS )a Initializer. Subclass may override.
Args:
options: a dict containing the options passed to RefactoringTool
that could be used to customize the fixer through the command line.
log: a list to append warnings and other messages to.
N)�options�log�compile_pattern)�selfr r � r �*/usr/lib64/python3.6/lib2to3/fixer_base.py�__init__/ s zBaseFix.__init__c C s, | j dk r(t� }|j| j dd�\| _| _dS )z�Compiles self.PATTERN into self.pattern.
Subclass may override if it doesn't want to use
self.{pattern,PATTERN} in .match().
NT)Z with_tree)�PATTERNr r
�pattern� pattern_tree)r �PCr r r
r
; s
zBaseFix.compile_patternc C s
|| _ dS )zOSet the filename.
The main refactoring tool should call this.
N)�filename)r r r r r
� set_filenameF s zBaseFix.set_filenamec C s d|i}| j j||�o|S )a Returns match for a given parse tree node.
Should return a true or false object (not necessarily a bool).
It may return a non-empty dict of matching sub-nodes as
returned by a matching pattern.
Subclass may override.
�node)r �match)r r �resultsr r r
r M s z
BaseFix.matchc C s
t � �dS )a� Returns the transformation for a given parse tree node.
Args:
node: the root of the parse tree that matched the fixer.
results: a dict mapping symbolic names to part of the match.
Returns:
None, or a node that is a modified copy of the
argument node. The node argument may also be modified in-place to
effect the same change.
Subclass *must* override.
N)�NotImplementedError)r r r r r r
� transformY s zBaseFix.transform�xxx_todo_changemec C s6 |}x || j kr$|tt| j�� }qW | j j|� |S )z�Return a string suitable for use as an identifier
The new name is guaranteed not to conflict with other identifiers.
)�
used_names�str�next�numbers�add)r �template�namer r r
�new_namei s
zBaseFix.new_namec C s. | j r d| _ | jjd| j � | jj|� d S )NFz### In file %s ###)� first_logr �appendr )r �messager r r
� log_messaget s zBaseFix.log_messagec C s> |j � }|j� }d|_d}| j|||f � |r:| j|� dS )a Warn the user that a given chunk of code is not valid Python 3,
but that it cannot be converted automatically.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
� z Line %d: could not convert: %sN)�
get_linenoZclone�prefixr& )r r �reason�linenoZ
for_output�msgr r r
�cannot_convertz s zBaseFix.cannot_convertc C s |j � }| jd||f � dS )z�Used for warning the user about possible uncertainty in the
translation.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
z Line %d: %sN)r( r& )r r r* r+ r r r
�warning� s zBaseFix.warningc C s( |j | _ | j|� tjd�| _d| _dS )z�Some fixers need to maintain tree-wide state.
This method is called once, at the start of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
r TN)r r � itertools�countr r# )r �treer r r r
�
start_tree� s
zBaseFix.start_treec C s dS )z�Some fixers need to maintain tree-wide state.
This method is called once, at the conclusion of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
Nr )r r1 r r r r
� finish_tree� s zBaseFix.finish_tree)r )N)"�__name__�
__module__� __qualname__�__doc__r r r r r r/ r0 r �setr �orderZexplicitZ run_orderZ _accept_typeZkeep_line_orderZ
BM_compatibler Zpython_symbolsZsymsr r
r r r r" r& r- r. r2 r3 r r r r
r s4
r c s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�ConditionalFixz@ Base class for fixers which not execute if an import is found. Nc s t t| �j|� d | _d S )N)�superr: r2 � _should_skip)r �args)� __class__r r
r2 � s zConditionalFix.start_treec C sJ | j d k r| j S | jjd�}|d }dj|d d� �}t|||�| _ | j S )N�.r ���r@ )r< �skip_on�split�joinr )r r Zpkgr! r r r
� should_skip� s
zConditionalFix.should_skip)r4 r5 r6 r7 rA r2 rD �
__classcell__r r )r> r
r: � s r: ) r7 r/ Zpatcompr r' r Z
fixer_utilr �objectr r: r r r r
�<module> s __pycache__/fixer_util.cpython-36.opt-2.pyc 0000644 00000023216 15053244155 0014524 0 ustar 00 3
\g; �
@ s� d dl mZ d dlmZmZ d dlmZ d dlm Z dd� Z
dd� Z d d
� Z d d � Z
dVdd�Zdd� Zdd� Zdd� Ze � e � fdd�ZdWdd�Zdd� Zd d � ZdXd d �Zd d!� ZdYd"d#�ZdZd$d%�Zd&d'� Zd(d)� Zd*d+� Z d,d-� Z d.d/� Z d0d1d2d3d4d5d6d7d8d9h
Z d:d;� Z d<a!d=a"d>a#d?a$d@dA� Z%dBdC� Z&dDdE� Z'dFdG� Z(dHdI� Z)dJdK� Z*dLdM� Z+dNdO� Z,ej-ej.hZ/d[dPdQ�Z0ej.ej-ej1hZ2dRdS� Z3d\dTdU�Z4d
S )]� )�token)�Leaf�Node)�python_symbols)�patcompc C s t tj| ttjd�|g�S )N�=)r �symsZargumentr r �EQUAL)�keyword�value� r �*/usr/lib64/python3.6/lib2to3/fixer_util.py�
KeywordArg s r c C s t tjd�S )N�()r r �LPARr r r r
�LParen s r c C s t tjd�S )N�))r r �RPARr r r r
�RParen s r c C sH t | t�s| g} t |t�s&d|_|g}ttj| ttjddd�g | �S )N� r )�prefix) �
isinstance�listr r r �atomr r r )�target�sourcer r r
�Assign s
r Nc C s t tj| |d�S )N)r )r r �NAME)�namer r r r
�Name$ s r c C s | t tjt� |g�gS )N)r r �trailer�Dot)�obj�attrr r r
�Attr( s r$ c C s t tjd�S )N�,)r r �COMMAr r r r
�Comma, s r' c C s t tjd�S )N�.)r r �DOTr r r r
r! 0 s r! c C s4 t tj|j� |j� g�}| r0|jdt tj| �� |S )Nr )r r r �clone� insert_child�arglist)�argsZlparenZrparen�noder r r
�ArgList4 s r/ c C s& t tj| t|�g�}|d k r"||_|S )N)r r �powerr/ r )Z func_namer- r r. r r r
�Call; s r1 c C s t tjd�S )N�
)r r �NEWLINEr r r r
�NewlineB s r4 c C s t tjd�S )N� )r r r3 r r r r
� BlankLineF s r6 c C s t tj| |d�S )N)r )r r �NUMBER)�nr r r r
�NumberJ s r9 c C s" t tjttjd�| ttjd�g�S )N�[�])r r r r r �LBRACE�RBRACE)Z
index_noder r r
� SubscriptM s r> c C s t tj| |d�S )N)r )r r �STRING)�stringr r r r
�StringS s rA c C s� d| _ d|_ d|_ ttjd�}d|_ ttjd�}d|_ ||||g}|rtd|_ ttjd�}d|_ |jttj||g�� ttj| ttj |�g�}ttj
ttj d�|ttj d�g�S )Nr5 r �for�in�ifr: r; )
r r r r �appendr r Zcomp_ifZ listmakerZcomp_forr r< r= ) Zxp�fp�itZtestZfor_leafZin_leafZ
inner_argsZif_leaf�innerr r r
�ListCompW s$
rI c C sZ x|D ] }|j � qW ttjd�ttj| dd�ttjddd�ttj|�g}ttj|�}|S )N�fromr )r �import)�remover r r r r �import_as_names� import_from)Z package_nameZ
name_leafsZleaf�children�impr r r
�
FromImporto s
rQ c C s� |d j � }|jtjkr"|j � }nttj|j � g�}|d }|rNdd� |D �}ttjtt|d �t|d ��ttj|d j � ||d j � g�g | �}| j |_ |S ) Nr" �afterc S s g | ] }|j � �qS r )r* )�.0r8 r r r
�
<listcomp>� s z!ImportAndCall.<locals>.<listcomp>� r ZlparZrpar)
r* �typer r, r r0 r$ r r r )r. �results�namesr" Z
newarglistrR �newr r r
�
ImportAndCall� s
DrZ c C s� t | t�r | jt� t� gkr dS t | t�o�t| j�dko�t | jd t�o�t | jd t�o�t | jd t�o�| jd jdko�| jd jdkS )NT� rU r � r r )r r rO r r �lenr r )r. r r r
�is_tuple� s
r^ c C sX t | t�oVt| j�dkoVt | jd t�oVt | jd t�oV| jd jdkoV| jd jdkS )Nr rU r: r; ���r_ )r r r] rO r r )r. r r r
�is_list� s
r` c C s t tjt� | t� g�S )N)r r r r r )r. r r r
� parenthesize� s ra �sortedr �set�any�all�tuple�sum�min�max� enumeratec c s( t | |�}x|r"|V t ||�}q W d S )N)�getattr)r" r# �nextr r r
�
attr_chain� s
rm zefor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
z�
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
z`
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
Fc C sr t s&tjt�atjt�atjt�ada tttg}x<t|t| d��D ](\}}i }|j||�rB|d | krBdS qBW dS )NT�parentr. F) �
pats_builtr Zcompile_pattern�p0�p1�p2�ziprm �match)r. Zpatterns�patternrn rW r r r
�in_special_context� s
rv c C s� | j }|d k r |jtjkr dS | j}|jtjtjfkr:dS |jtjkrX|j d | krXdS |jtj
ks�|jtj kr�|d k r�|jtj ks�|j d | kr�dS dS )NFrU T)
Z prev_siblingrV r r) rn r �funcdef�classdef� expr_stmtrO Z
parametersZ
typedargslistr& )r. �prevrn r r r
�is_probably_builtin� s r{ c C sN xH| d k rH| j tjkr@t| j�dkr@| jd }|j tjkr@|jS | j} qW dS )Nr\ r r5 ) rV r �suiter] rO r �INDENTr rn )r. �indentr r r
�find_indentation s
r c C s> | j tjkr| S | j� } | jd }| _ttj| g�}||_|S )N)rV r r| r* rn r )r. rn r| r r r
�
make_suite s r� c C s( x"| j tjkr"| j} | std��qW | S )Nz,root found before file_input node was found.)rV r Z
file_inputrn �
ValueError)r. r r r
� find_root& s
r� c C s t |t|�| �}t|�S )N)� find_bindingr� �bool)�packager r. Zbindingr r r
�does_tree_import/ s r� c C s | j tjtjfkS )N)rV r � import_namerN )r. r r r
� is_import7 s r� c C s4 dd� }t |�}t| ||�r d S d }}xTt|j�D ]F\}}||�sFq4x(t|j|d � �D ]\}}||�sZP qZW || }P q4W |dkr�xDt|j�D ]6\}}|jtjkr�|jr�|jd jtjkr�|d }P q�W | d kr�t tj
t tj d�t tj |dd�g�} nt
| t tj |dd�g�} | t� g}
|j|t tj|
�� d S )Nc S s | j tjko | jo t| jd �S )NrU )rV r � simple_stmtrO r� )r. r r r
�is_import_stmt> s z$touch_import.<locals>.is_import_stmtrU r rK r )r )r� r� rj rO rV r r� r r? r r� r r rQ r4 r+ ) r� r r. r� �rootZ
insert_pos�offset�idxZnode2�import_rO r r r
� touch_import; s4
r� c C s� �x�|j D �]�}d }|jtjkrVt| |j d �r4|S t| t|j d �|�}|rR|}�n4|jtjtjfkr�t| t|j d �|�}|r�|}�n |jtj k�rt| t|j d �|�}|r�|}nXx�t
|j dd � �D ]@\}}|jt j ko�|j
dkr�t| t|j |d �|�}|r�|}q�W nx|jtk�r6|j d j
| k�r6|}nTt|| |��rJ|}n@|jtjk�rft| ||�}n$|jtjk�r�t| |j d ��r�|}|r
|�s�|S t|�r
|S q
W d S ) Nr r\ r[ �:� rU r_ r_ )rO rV r Zfor_stmt�_findr� r� Zif_stmtZ
while_stmtZtry_stmtrj r �COLONr � _def_syms�_is_import_bindingr� ry r� )r r. r� �childZretr8 �iZkidr r r
r� i sH
r� c C sX |g}xL|rR|j � }|jdkr6|jtkr6|j|j� q|jtjkr|j| kr|S qW d S )N� )�poprV � _block_syms�extendrO r r r )r r. Znodesr r r
r� � s r� c C s� | j tjkr�| r�| jd }|j tjkrvx�|jD ]@}|j tjkrV|jd j|krp| S q0|j tjkr0|j|kr0| S q0W nL|j tjkr�|jd }|j tjkr�|j|kr�| S n|j tjkr�|j|kr�| S n�| j tj k�r�|r�t
| jd �j � |kr�d S | jd }|�rt d|��rd S |j tj
k�r.t ||��r.| S |j tjk�rf|jd }|j tjk�r�|j|k�r�| S n6|j tjk�r�|j|k�r�| S |�r�|j tjk�r�| S d S )Nr r\ r[ �asr_ )rV r r� rO Zdotted_as_namesZdotted_as_namer r r rN �str�stripr� rM Zimport_as_name�STAR)r. r r� rP r� Zlastr8 r r r
r� � s@
r� )N)NN)N)N)N)N)N)5Zpgen2r Zpytreer r Zpygramr r r5 r r r r r r r$ r' r! r/ r1 r4 r6 r9 r> rA rI rQ rZ r^ r` ra Zconsuming_callsrm rp rq rr ro rv r{ r r� r� r� r� r� rx rw r� r� r r� r� r� r r r r
�<module> sX
-
*
pytree.py 0000644 00000066624 15053244155 0006450 0 ustar 00 # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""
Python parse tree definitions.
This is a very concrete parse tree; we need to keep every token and
even the comments and whitespace between tokens.
There's also a pattern matching implementation here.
"""
__author__ = "Guido van Rossum <guido@python.org>"
import sys
import warnings
from io import StringIO
HUGE = 0x7FFFFFFF # maximum repeat count, default max
_type_reprs = {}
def type_repr(type_num):
global _type_reprs
if not _type_reprs:
from .pygram import python_symbols
# printing tokens is possible but not as useful
# from .pgen2 import token // token.__dict__.items():
for name, val in python_symbols.__dict__.items():
if type(val) == int: _type_reprs[val] = name
return _type_reprs.setdefault(type_num, type_num)
class Base(object):
"""
Abstract base class for Node and Leaf.
This provides some default functionality and boilerplate using the
template pattern.
A node may be a subnode of at most one parent.
"""
# Default values for instance variables
type = None # int: token number (< 256) or symbol number (>= 256)
parent = None # Parent node pointer, or None
children = () # Tuple of subnodes
was_changed = False
was_checked = False
def __new__(cls, *args, **kwds):
"""Constructor that prevents Base from being instantiated."""
assert cls is not Base, "Cannot instantiate Base"
return object.__new__(cls)
def __eq__(self, other):
"""
Compare two nodes for equality.
This calls the method _eq().
"""
if self.__class__ is not other.__class__:
return NotImplemented
return self._eq(other)
__hash__ = None # For Py3 compatibility.
def _eq(self, other):
"""
Compare two nodes for equality.
This is called by __eq__ and __ne__. It is only called if the two nodes
have the same type. This must be implemented by the concrete subclass.
Nodes should be considered equal if they have the same structure,
ignoring the prefix string and other context information.
"""
raise NotImplementedError
def clone(self):
"""
Return a cloned (deep) copy of self.
This must be implemented by the concrete subclass.
"""
raise NotImplementedError
def post_order(self):
"""
Return a post-order iterator for the tree.
This must be implemented by the concrete subclass.
"""
raise NotImplementedError
def pre_order(self):
"""
Return a pre-order iterator for the tree.
This must be implemented by the concrete subclass.
"""
raise NotImplementedError
def replace(self, new):
"""Replace this node with a new one in the parent."""
assert self.parent is not None, str(self)
assert new is not None
if not isinstance(new, list):
new = [new]
l_children = []
found = False
for ch in self.parent.children:
if ch is self:
assert not found, (self.parent.children, self, new)
if new is not None:
l_children.extend(new)
found = True
else:
l_children.append(ch)
assert found, (self.children, self, new)
self.parent.changed()
self.parent.children = l_children
for x in new:
x.parent = self.parent
self.parent = None
def get_lineno(self):
"""Return the line number which generated the invocant node."""
node = self
while not isinstance(node, Leaf):
if not node.children:
return
node = node.children[0]
return node.lineno
def changed(self):
if self.parent:
self.parent.changed()
self.was_changed = True
def remove(self):
"""
Remove the node from the tree. Returns the position of the node in its
parent's children before it was removed.
"""
if self.parent:
for i, node in enumerate(self.parent.children):
if node is self:
self.parent.changed()
del self.parent.children[i]
self.parent = None
return i
@property
def next_sibling(self):
"""
The node immediately following the invocant in their parent's children
list. If the invocant does not have a next sibling, it is None
"""
if self.parent is None:
return None
# Can't use index(); we need to test by identity
for i, child in enumerate(self.parent.children):
if child is self:
try:
return self.parent.children[i+1]
except IndexError:
return None
@property
def prev_sibling(self):
"""
The node immediately preceding the invocant in their parent's children
list. If the invocant does not have a previous sibling, it is None.
"""
if self.parent is None:
return None
# Can't use index(); we need to test by identity
for i, child in enumerate(self.parent.children):
if child is self:
if i == 0:
return None
return self.parent.children[i-1]
def leaves(self):
for child in self.children:
yield from child.leaves()
def depth(self):
if self.parent is None:
return 0
return 1 + self.parent.depth()
def get_suffix(self):
"""
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
"""
next_sib = self.next_sibling
if next_sib is None:
return ""
return next_sib.prefix
if sys.version_info < (3, 0):
def __str__(self):
return str(self).encode("ascii")
class Node(Base):
"""Concrete implementation for interior nodes."""
def __init__(self,type, children,
context=None,
prefix=None,
fixers_applied=None):
"""
Initializer.
Takes a type constant (a symbol number >= 256), a sequence of
child nodes, and an optional context keyword argument.
As a side effect, the parent pointers of the children are updated.
"""
assert type >= 256, type
self.type = type
self.children = list(children)
for ch in self.children:
assert ch.parent is None, repr(ch)
ch.parent = self
if prefix is not None:
self.prefix = prefix
if fixers_applied:
self.fixers_applied = fixers_applied[:]
else:
self.fixers_applied = None
def __repr__(self):
"""Return a canonical string representation."""
return "%s(%s, %r)" % (self.__class__.__name__,
type_repr(self.type),
self.children)
def __unicode__(self):
"""
Return a pretty string representation.
This reproduces the input source exactly.
"""
return "".join(map(str, self.children))
if sys.version_info > (3, 0):
__str__ = __unicode__
def _eq(self, other):
"""Compare two nodes for equality."""
return (self.type, self.children) == (other.type, other.children)
def clone(self):
"""Return a cloned (deep) copy of self."""
return Node(self.type, [ch.clone() for ch in self.children],
fixers_applied=self.fixers_applied)
def post_order(self):
"""Return a post-order iterator for the tree."""
for child in self.children:
yield from child.post_order()
yield self
def pre_order(self):
"""Return a pre-order iterator for the tree."""
yield self
for child in self.children:
yield from child.pre_order()
def _prefix_getter(self):
"""
The whitespace and comments preceding this node in the input.
"""
if not self.children:
return ""
return self.children[0].prefix
def _prefix_setter(self, prefix):
if self.children:
self.children[0].prefix = prefix
prefix = property(_prefix_getter, _prefix_setter)
def set_child(self, i, child):
"""
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
"""
child.parent = self
self.children[i].parent = None
self.children[i] = child
self.changed()
def insert_child(self, i, child):
"""
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
"""
child.parent = self
self.children.insert(i, child)
self.changed()
def append_child(self, child):
"""
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
"""
child.parent = self
self.children.append(child)
self.changed()
class Leaf(Base):
"""Concrete implementation for leaf nodes."""
# Default values for instance variables
_prefix = "" # Whitespace and comments preceding this token in the input
lineno = 0 # Line where this token starts in the input
column = 0 # Column where this token tarts in the input
def __init__(self, type, value,
context=None,
prefix=None,
fixers_applied=[]):
"""
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
"""
assert 0 <= type < 256, type
if context is not None:
self._prefix, (self.lineno, self.column) = context
self.type = type
self.value = value
if prefix is not None:
self._prefix = prefix
self.fixers_applied = fixers_applied[:]
def __repr__(self):
"""Return a canonical string representation."""
return "%s(%r, %r)" % (self.__class__.__name__,
self.type,
self.value)
def __unicode__(self):
"""
Return a pretty string representation.
This reproduces the input source exactly.
"""
return self.prefix + str(self.value)
if sys.version_info > (3, 0):
__str__ = __unicode__
def _eq(self, other):
"""Compare two nodes for equality."""
return (self.type, self.value) == (other.type, other.value)
def clone(self):
"""Return a cloned (deep) copy of self."""
return Leaf(self.type, self.value,
(self.prefix, (self.lineno, self.column)),
fixers_applied=self.fixers_applied)
def leaves(self):
yield self
def post_order(self):
"""Return a post-order iterator for the tree."""
yield self
def pre_order(self):
"""Return a pre-order iterator for the tree."""
yield self
def _prefix_getter(self):
"""
The whitespace and comments preceding this token in the input.
"""
return self._prefix
def _prefix_setter(self, prefix):
self.changed()
self._prefix = prefix
prefix = property(_prefix_getter, _prefix_setter)
def convert(gr, raw_node):
"""
Convert raw node information to a Node or Leaf instance.
This is passed to the parser driver which calls it whenever a reduction of a
grammar rule produces a new complete node, so that the tree is build
strictly bottom-up.
"""
type, value, context, children = raw_node
if children or type in gr.number2symbol:
# If there's exactly one child, return that child instead of
# creating a new node.
if len(children) == 1:
return children[0]
return Node(type, children, context=context)
else:
return Leaf(type, value, context=context)
class BasePattern(object):
"""
A pattern is a tree matching pattern.
It looks for a specific node type (token or symbol), and
optionally for a specific content.
This is an abstract base class. There are three concrete
subclasses:
- LeafPattern matches a single leaf node;
- NodePattern matches a single node (usually non-leaf);
- WildcardPattern matches a sequence of nodes of variable length.
"""
# Defaults for instance variables
type = None # Node type (token if < 256, symbol if >= 256)
content = None # Optional content matching pattern
name = None # Optional name used to store match in results dict
def __new__(cls, *args, **kwds):
"""Constructor that prevents BasePattern from being instantiated."""
assert cls is not BasePattern, "Cannot instantiate BasePattern"
return object.__new__(cls)
def __repr__(self):
args = [type_repr(self.type), self.content, self.name]
while args and args[-1] is None:
del args[-1]
return "%s(%s)" % (self.__class__.__name__, ", ".join(map(repr, args)))
def optimize(self):
"""
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
"""
return self
def match(self, node, results=None):
"""
Does this pattern exactly match a node?
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
Default implementation for non-wildcard patterns.
"""
if self.type is not None and node.type != self.type:
return False
if self.content is not None:
r = None
if results is not None:
r = {}
if not self._submatch(node, r):
return False
if r:
results.update(r)
if results is not None and self.name:
results[self.name] = node
return True
def match_seq(self, nodes, results=None):
"""
Does this pattern exactly match a sequence of nodes?
Default implementation for non-wildcard patterns.
"""
if len(nodes) != 1:
return False
return self.match(nodes[0], results)
def generate_matches(self, nodes):
"""
Generator yielding all matches for this pattern.
Default implementation for non-wildcard patterns.
"""
r = {}
if nodes and self.match(nodes[0], r):
yield 1, r
class LeafPattern(BasePattern):
def __init__(self, type=None, content=None, name=None):
"""
Initializer. Takes optional type, content, and name.
The type, if given must be a token type (< 256). If not given,
this matches any *leaf* node; the content may still be required.
The content, if given, must be a string.
If a name is given, the matching node is stored in the results
dict under that key.
"""
if type is not None:
assert 0 <= type < 256, type
if content is not None:
assert isinstance(content, str), repr(content)
self.type = type
self.content = content
self.name = name
def match(self, node, results=None):
"""Override match() to insist on a leaf node."""
if not isinstance(node, Leaf):
return False
return BasePattern.match(self, node, results)
def _submatch(self, node, results=None):
"""
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
"""
return self.content == node.value
class NodePattern(BasePattern):
wildcards = False
def __init__(self, type=None, content=None, name=None):
"""
Initializer. Takes optional type, content, and name.
The type, if given, must be a symbol type (>= 256). If the
type is None this matches *any* single node (leaf or not),
except if content is not None, in which it only matches
non-leaf nodes that also match the content pattern.
The content, if not None, must be a sequence of Patterns that
must match the node's children exactly. If the content is
given, the type must not be None.
If a name is given, the matching node is stored in the results
dict under that key.
"""
if type is not None:
assert type >= 256, type
if content is not None:
assert not isinstance(content, str), repr(content)
content = list(content)
for i, item in enumerate(content):
assert isinstance(item, BasePattern), (i, item)
if isinstance(item, WildcardPattern):
self.wildcards = True
self.type = type
self.content = content
self.name = name
def _submatch(self, node, results=None):
"""
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
"""
if self.wildcards:
for c, r in generate_matches(self.content, node.children):
if c == len(node.children):
if results is not None:
results.update(r)
return True
return False
if len(self.content) != len(node.children):
return False
for subpattern, child in zip(self.content, node.children):
if not subpattern.match(child, results):
return False
return True
class WildcardPattern(BasePattern):
"""
A wildcard pattern can match zero or more nodes.
This has all the flexibility needed to implement patterns like:
.* .+ .? .{m,n}
(a b c | d e | f)
(...)* (...)+ (...)? (...){m,n}
except it always uses non-greedy matching.
"""
def __init__(self, content=None, min=0, max=HUGE, name=None):
"""
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optional minimum number of times to match, default 0
max: optional maximum number of times to match, default HUGE
name: optional name assigned to this match
[*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is
equivalent to (a b c | d e | f g h); if content is None,
this is equivalent to '.' in regular expression terms.
The min and max parameters work as follows:
min=0, max=maxint: .*
min=1, max=maxint: .+
min=0, max=1: .?
min=1, max=1: .
If content is not None, replace the dot with the parenthesized
list of alternatives, e.g. (a b c | d e | f g h)*
"""
assert 0 <= min <= max <= HUGE, (min, max)
if content is not None:
content = tuple(map(tuple, content)) # Protect against alterations
# Check sanity of alternatives
assert len(content), repr(content) # Can't have zero alternatives
for alt in content:
assert len(alt), repr(alt) # Can have empty alternatives
self.content = content
self.min = min
self.max = max
self.name = name
def optimize(self):
"""Optimize certain stacked wildcard patterns."""
subpattern = None
if (self.content is not None and
len(self.content) == 1 and len(self.content[0]) == 1):
subpattern = self.content[0][0]
if self.min == 1 and self.max == 1:
if self.content is None:
return NodePattern(name=self.name)
if subpattern is not None and self.name == subpattern.name:
return subpattern.optimize()
if (self.min <= 1 and isinstance(subpattern, WildcardPattern) and
subpattern.min <= 1 and self.name == subpattern.name):
return WildcardPattern(subpattern.content,
self.min*subpattern.min,
self.max*subpattern.max,
subpattern.name)
return self
def match(self, node, results=None):
"""Does this pattern exactly match a node?"""
return self.match_seq([node], results)
def match_seq(self, nodes, results=None):
"""Does this pattern exactly match a sequence of nodes?"""
for c, r in self.generate_matches(nodes):
if c == len(nodes):
if results is not None:
results.update(r)
if self.name:
results[self.name] = list(nodes)
return True
return False
def generate_matches(self, nodes):
"""
Generator yielding matches for a sequence of nodes.
Args:
nodes: sequence of nodes
Yields:
(count, results) tuples where:
count: the match comprises nodes[:count];
results: dict containing named submatches.
"""
if self.content is None:
# Shortcut for special case (see __init__.__doc__)
for count in range(self.min, 1 + min(len(nodes), self.max)):
r = {}
if self.name:
r[self.name] = nodes[:count]
yield count, r
elif self.name == "bare_name":
yield self._bare_name_matches(nodes)
else:
# The reason for this is that hitting the recursion limit usually
# results in some ugly messages about how RuntimeErrors are being
# ignored. We only have to do this on CPython, though, because other
# implementations don't have this nasty bug in the first place.
if hasattr(sys, "getrefcount"):
save_stderr = sys.stderr
sys.stderr = StringIO()
try:
for count, r in self._recursive_matches(nodes, 0):
if self.name:
r[self.name] = nodes[:count]
yield count, r
except RuntimeError:
# We fall back to the iterative pattern matching scheme if the recursive
# scheme hits the recursion limit.
for count, r in self._iterative_matches(nodes):
if self.name:
r[self.name] = nodes[:count]
yield count, r
finally:
if hasattr(sys, "getrefcount"):
sys.stderr = save_stderr
def _iterative_matches(self, nodes):
"""Helper to iteratively yield the matches."""
nodelen = len(nodes)
if 0 >= self.min:
yield 0, {}
results = []
# generate matches that use just one alt from self.content
for alt in self.content:
for c, r in generate_matches(alt, nodes):
yield c, r
results.append((c, r))
# for each match, iterate down the nodes
while results:
new_results = []
for c0, r0 in results:
# stop if the entire set of nodes has been matched
if c0 < nodelen and c0 <= self.max:
for alt in self.content:
for c1, r1 in generate_matches(alt, nodes[c0:]):
if c1 > 0:
r = {}
r.update(r0)
r.update(r1)
yield c0 + c1, r
new_results.append((c0 + c1, r))
results = new_results
def _bare_name_matches(self, nodes):
"""Special optimized matcher for bare_name."""
count = 0
r = {}
done = False
max = len(nodes)
while not done and count < max:
done = True
for leaf in self.content:
if leaf[0].match(nodes[count], r):
count += 1
done = False
break
r[self.name] = nodes[:count]
return count, r
def _recursive_matches(self, nodes, count):
"""Helper to recursively yield the matches."""
assert self.content is not None
if count >= self.min:
yield 0, {}
if count < self.max:
for alt in self.content:
for c0, r0 in generate_matches(alt, nodes):
for c1, r1 in self._recursive_matches(nodes[c0:], count+1):
r = {}
r.update(r0)
r.update(r1)
yield c0 + c1, r
class NegatedPattern(BasePattern):
def __init__(self, content=None):
"""
Initializer.
The argument is either a pattern or None. If it is None, this
only matches an empty sequence (effectively '$' in regex
lingo). If it is not None, this matches whenever the argument
pattern doesn't have any matches.
"""
if content is not None:
assert isinstance(content, BasePattern), repr(content)
self.content = content
def match(self, node):
# We never match a node in its entirety
return False
def match_seq(self, nodes):
# We only match an empty sequence of nodes in its entirety
return len(nodes) == 0
def generate_matches(self, nodes):
if self.content is None:
# Return a match if there is an empty sequence
if len(nodes) == 0:
yield 0, {}
else:
# Return a match if the argument pattern has no matches
for c, r in self.content.generate_matches(nodes):
return
yield 0, {}
def generate_matches(patterns, nodes):
"""
Generator yielding matches for a sequence of patterns and nodes.
Args:
patterns: a sequence of patterns
nodes: a sequence of nodes
Yields:
(count, results) tuples where:
count: the entire sequence of patterns matches nodes[:count];
results: dict containing named submatches.
"""
if not patterns:
yield 0, {}
else:
p, rest = patterns[0], patterns[1:]
for c0, r0 in p.generate_matches(nodes):
if not rest:
yield c0, r0
else:
for c1, r1 in generate_matches(rest, nodes[c0:]):
r = {}
r.update(r0)
r.update(r1)
yield c0 + c1, r
__main__.py 0000644 00000000103 15053244155 0006634 0 ustar 00 import sys
from .main import main
sys.exit(main("lib2to3.fixes"))
main.py 0000644 00000026605 15053244155 0006057 0 ustar 00 """
Main program for 2to3.
"""
from __future__ import with_statement, print_function
import sys
import os
import difflib
import logging
import shutil
import optparse
from . import refactor
def diff_texts(a, b, filename):
"""Return a unified diff of two strings."""
a = a.splitlines()
b = b.splitlines()
return difflib.unified_diff(a, b, filename, filename,
"(original)", "(refactored)",
lineterm="")
class StdoutRefactoringTool(refactor.MultiprocessRefactoringTool):
"""
A refactoring tool that can avoid overwriting its input files.
Prints output to stdout.
Output files can optionally be written to a different directory and or
have an extra file suffix appended to their name for use in situations
where you do not want to replace the input files.
"""
def __init__(self, fixers, options, explicit, nobackups, show_diffs,
input_base_dir='', output_dir='', append_suffix=''):
"""
Args:
fixers: A list of fixers to import.
options: A dict with RefactoringTool configuration.
explicit: A list of fixers to run even if they are explicit.
nobackups: If true no backup '.bak' files will be created for those
files that are being refactored.
show_diffs: Should diffs of the refactoring be printed to stdout?
input_base_dir: The base directory for all input files. This class
will strip this path prefix off of filenames before substituting
it with output_dir. Only meaningful if output_dir is supplied.
All files processed by refactor() must start with this path.
output_dir: If supplied, all converted files will be written into
this directory tree instead of input_base_dir.
append_suffix: If supplied, all files output by this tool will have
this appended to their filename. Useful for changing .py to
.py3 for example by passing append_suffix='3'.
"""
self.nobackups = nobackups
self.show_diffs = show_diffs
if input_base_dir and not input_base_dir.endswith(os.sep):
input_base_dir += os.sep
self._input_base_dir = input_base_dir
self._output_dir = output_dir
self._append_suffix = append_suffix
super(StdoutRefactoringTool, self).__init__(fixers, options, explicit)
def log_error(self, msg, *args, **kwargs):
self.errors.append((msg, args, kwargs))
self.logger.error(msg, *args, **kwargs)
def write_file(self, new_text, filename, old_text, encoding):
orig_filename = filename
if self._output_dir:
if filename.startswith(self._input_base_dir):
filename = os.path.join(self._output_dir,
filename[len(self._input_base_dir):])
else:
raise ValueError('filename %s does not start with the '
'input_base_dir %s' % (
filename, self._input_base_dir))
if self._append_suffix:
filename += self._append_suffix
if orig_filename != filename:
output_dir = os.path.dirname(filename)
if not os.path.isdir(output_dir) and output_dir:
os.makedirs(output_dir)
self.log_message('Writing converted %s to %s.', orig_filename,
filename)
if not self.nobackups:
# Make backup
backup = filename + ".bak"
if os.path.lexists(backup):
try:
os.remove(backup)
except OSError as err:
self.log_message("Can't remove backup %s", backup)
try:
os.rename(filename, backup)
except OSError as err:
self.log_message("Can't rename %s to %s", filename, backup)
# Actually write the new file
write = super(StdoutRefactoringTool, self).write_file
write(new_text, filename, old_text, encoding)
if not self.nobackups:
shutil.copymode(backup, filename)
if orig_filename != filename:
# Preserve the file mode in the new output directory.
shutil.copymode(orig_filename, filename)
def print_output(self, old, new, filename, equal):
if equal:
self.log_message("No changes to %s", filename)
else:
self.log_message("Refactored %s", filename)
if self.show_diffs:
diff_lines = diff_texts(old, new, filename)
try:
if self.output_lock is not None:
with self.output_lock:
for line in diff_lines:
print(line)
sys.stdout.flush()
else:
for line in diff_lines:
print(line)
except UnicodeEncodeError:
warn("couldn't encode %s's diff for your terminal" %
(filename,))
return
def warn(msg):
print("WARNING: %s" % (msg,), file=sys.stderr)
def main(fixer_pkg, args=None):
"""Main program.
Args:
fixer_pkg: the name of a package where the fixers are located.
args: optional; a list of command line arguments. If omitted,
sys.argv[1:] is used.
Returns a suggested exit status (0, 1, 2).
"""
# Set up option parser
parser = optparse.OptionParser(usage="2to3 [options] file|dir ...")
parser.add_option("-d", "--doctests_only", action="store_true",
help="Fix up doctests only")
parser.add_option("-f", "--fix", action="append", default=[],
help="Each FIX specifies a transformation; default: all")
parser.add_option("-j", "--processes", action="store", default=1,
type="int", help="Run 2to3 concurrently")
parser.add_option("-x", "--nofix", action="append", default=[],
help="Prevent a transformation from being run")
parser.add_option("-l", "--list-fixes", action="store_true",
help="List available transformations")
parser.add_option("-p", "--print-function", action="store_true",
help="Modify the grammar so that print() is a function")
parser.add_option("-v", "--verbose", action="store_true",
help="More verbose logging")
parser.add_option("--no-diffs", action="store_true",
help="Don't show diffs of the refactoring")
parser.add_option("-w", "--write", action="store_true",
help="Write back modified files")
parser.add_option("-n", "--nobackups", action="store_true", default=False,
help="Don't write backups for modified files")
parser.add_option("-o", "--output-dir", action="store", type="str",
default="", help="Put output files in this directory "
"instead of overwriting the input files. Requires -n.")
parser.add_option("-W", "--write-unchanged-files", action="store_true",
help="Also write files even if no changes were required"
" (useful with --output-dir); implies -w.")
parser.add_option("--add-suffix", action="store", type="str", default="",
help="Append this string to all output filenames."
" Requires -n if non-empty. "
"ex: --add-suffix='3' will generate .py3 files.")
# Parse command line arguments
refactor_stdin = False
flags = {}
options, args = parser.parse_args(args)
if options.write_unchanged_files:
flags["write_unchanged_files"] = True
if not options.write:
warn("--write-unchanged-files/-W implies -w.")
options.write = True
# If we allowed these, the original files would be renamed to backup names
# but not replaced.
if options.output_dir and not options.nobackups:
parser.error("Can't use --output-dir/-o without -n.")
if options.add_suffix and not options.nobackups:
parser.error("Can't use --add-suffix without -n.")
if not options.write and options.no_diffs:
warn("not writing files and not printing diffs; that's not very useful")
if not options.write and options.nobackups:
parser.error("Can't use -n without -w")
if options.list_fixes:
print("Available transformations for the -f/--fix option:")
for fixname in refactor.get_all_fix_names(fixer_pkg):
print(fixname)
if not args:
return 0
if not args:
print("At least one file or directory argument required.", file=sys.stderr)
print("Use --help to show usage.", file=sys.stderr)
return 2
if "-" in args:
refactor_stdin = True
if options.write:
print("Can't write to stdin.", file=sys.stderr)
return 2
if options.print_function:
flags["print_function"] = True
# Set up logging handler
level = logging.DEBUG if options.verbose else logging.INFO
logging.basicConfig(format='%(name)s: %(message)s', level=level)
logger = logging.getLogger('lib2to3.main')
# Initialize the refactoring tool
avail_fixes = set(refactor.get_fixers_from_package(fixer_pkg))
unwanted_fixes = set(fixer_pkg + ".fix_" + fix for fix in options.nofix)
explicit = set()
if options.fix:
all_present = False
for fix in options.fix:
if fix == "all":
all_present = True
else:
explicit.add(fixer_pkg + ".fix_" + fix)
requested = avail_fixes.union(explicit) if all_present else explicit
else:
requested = avail_fixes.union(explicit)
fixer_names = requested.difference(unwanted_fixes)
input_base_dir = os.path.commonprefix(args)
if (input_base_dir and not input_base_dir.endswith(os.sep)
and not os.path.isdir(input_base_dir)):
# One or more similar names were passed, their directory is the base.
# os.path.commonprefix() is ignorant of path elements, this corrects
# for that weird API.
input_base_dir = os.path.dirname(input_base_dir)
if options.output_dir:
input_base_dir = input_base_dir.rstrip(os.sep)
logger.info('Output in %r will mirror the input directory %r layout.',
options.output_dir, input_base_dir)
rt = StdoutRefactoringTool(
sorted(fixer_names), flags, sorted(explicit),
options.nobackups, not options.no_diffs,
input_base_dir=input_base_dir,
output_dir=options.output_dir,
append_suffix=options.add_suffix)
# Refactor all files and directories passed as arguments
if not rt.errors:
if refactor_stdin:
rt.refactor_stdin()
else:
try:
rt.refactor(args, options.write, options.doctests_only,
options.processes)
except refactor.MultiprocessingUnsupported:
assert options.processes > 1
print("Sorry, -j isn't supported on this platform.",
file=sys.stderr)
return 1
rt.summarize()
# Return error status (0 if rt.errors is zero)
return int(bool(rt.errors))
pgen2/literals.py 0000644 00000003117 15053244155 0007756 0 ustar 00 # Copyright 2004-2005 Elemental Security, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Safely evaluate Python string literals without using eval()."""
import re
simple_escapes = {"a": "\a",
"b": "\b",
"f": "\f",
"n": "\n",
"r": "\r",
"t": "\t",
"v": "\v",
"'": "'",
'"': '"',
"\\": "\\"}
def escape(m):
all, tail = m.group(0, 1)
assert all.startswith("\\")
esc = simple_escapes.get(tail)
if esc is not None:
return esc
if tail.startswith("x"):
hexes = tail[1:]
if len(hexes) < 2:
raise ValueError("invalid hex string escape ('\\%s')" % tail)
try:
i = int(hexes, 16)
except ValueError:
raise ValueError("invalid hex string escape ('\\%s')" % tail)
else:
try:
i = int(tail, 8)
except ValueError:
raise ValueError("invalid octal string escape ('\\%s')" % tail)
return chr(i)
def evalString(s):
assert s.startswith("'") or s.startswith('"'), repr(s[:1])
q = s[0]
if s[:3] == q*3:
q = q*3
assert s.endswith(q), repr(s[-len(q):])
assert len(s) >= 2*len(q)
s = s[len(q):-len(q)]
return re.sub(r"\\(\'|\"|\\|[abfnrtv]|x.{0,2}|[0-7]{1,3})", escape, s)
def test():
for i in range(256):
c = chr(i)
s = repr(c)
e = evalString(s)
if e != c:
print(i, c, s, e)
if __name__ == "__main__":
test()
pgen2/token.py 0000755 00000002416 15053244155 0007263 0 ustar 00 #! /usr/libexec/platform-python
"""Token constants (from "token.h")."""
# Taken from Python (r53757) and modified to include some tokens
# originally monkeypatched in by pgen2.tokenize
#--start constants--
ENDMARKER = 0
NAME = 1
NUMBER = 2
STRING = 3
NEWLINE = 4
INDENT = 5
DEDENT = 6
LPAR = 7
RPAR = 8
LSQB = 9
RSQB = 10
COLON = 11
COMMA = 12
SEMI = 13
PLUS = 14
MINUS = 15
STAR = 16
SLASH = 17
VBAR = 18
AMPER = 19
LESS = 20
GREATER = 21
EQUAL = 22
DOT = 23
PERCENT = 24
BACKQUOTE = 25
LBRACE = 26
RBRACE = 27
EQEQUAL = 28
NOTEQUAL = 29
LESSEQUAL = 30
GREATEREQUAL = 31
TILDE = 32
CIRCUMFLEX = 33
LEFTSHIFT = 34
RIGHTSHIFT = 35
DOUBLESTAR = 36
PLUSEQUAL = 37
MINEQUAL = 38
STAREQUAL = 39
SLASHEQUAL = 40
PERCENTEQUAL = 41
AMPEREQUAL = 42
VBAREQUAL = 43
CIRCUMFLEXEQUAL = 44
LEFTSHIFTEQUAL = 45
RIGHTSHIFTEQUAL = 46
DOUBLESTAREQUAL = 47
DOUBLESLASH = 48
DOUBLESLASHEQUAL = 49
AT = 50
ATEQUAL = 51
OP = 52
COMMENT = 53
NL = 54
RARROW = 55
AWAIT = 56
ASYNC = 57
ERRORTOKEN = 58
N_TOKENS = 59
NT_OFFSET = 256
#--end constants--
tok_name = {}
for _name, _value in list(globals().items()):
if type(_value) is type(0):
tok_name[_value] = _name
def ISTERMINAL(x):
return x < NT_OFFSET
def ISNONTERMINAL(x):
return x >= NT_OFFSET
def ISEOF(x):
return x == ENDMARKER
pgen2/__pycache__/tokenize.cpython-36.opt-1.pyc 0000644 00000035722 15053244155 0015221 0 ustar 00 3
\NX � = @ s� d Z dZdZddlZddlZddlmZmZ ddlT ddl m
Z
d d
� e e
�D �d d d
g Z [
ye
W n ek
r~ eZ
Y nX dd� Zdd� Zdd� ZdZdZeede � ee� ZdZdZdZdZedd �Zeeeee�Zd Z ed d �ee � Z d e Z ee e �Z ed!e d" �Z ee e e�Z!d#Z"d$Z#d%Z$d&Z%d'Z&ee&d( e&d) �Z'ee&d* e&d+ �Z(ed,d-d.d/d0d1d2d3d4� Z)d5Z*ed6d7�Z+ee)e*e+�Z,ee!e,e(e�Z-ee- Z.ee&d8 ed9d� e&d: ed;d� �Z/edee'�Z0eee0e!e,e/e� Z1e2e3ej4e.e1e$e%f��\Z5Z6Z7Z8ej4e"�ej4e#�e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8ddddddddd<�4Z9i Z:xd�D ]Z;e;e:e;< �q�W i Z<xd�D ]Z;e;e<e;< �q�W d�Z=G d�d�� d�e>�Z?G d�d�� d�e>�Z@d�d�� ZAeAfd�d �ZBd�d�� ZCG d�d�� d��ZDej4d�ejE�ZFej4d�ejE�ZGd�d�� ZHd�d�� ZId�d
� ZJd�d � ZKeLd�k�r�ddlMZMeNeMjO�dk�r|eBePeMjOd �jQ� n eBeMjRjQ� dS )�a� Tokenization help for Python programs.
generate_tokens(readline) is a generator that breaks a stream of
text into Python tokens. It accepts a readline-like method which is called
repeatedly to get the next line of input (or "" for EOF). It generates
5-tuples with these members:
the token type (see token.py)
the token (a string)
the starting (row, column) indices of the token (a 2-tuple of ints)
the ending (row, column) indices of the token (a 2-tuple of ints)
the original line (string)
It is designed to match the working of the Python tokenizer exactly, except
that it produces COMMENT tokens for comments and gives type OP for all
operators
Older entry points
tokenize_loop(readline, tokeneater)
tokenize(readline, tokeneater=printtoken)
are the same, except instead of generating tokens, tokeneater is a callback
function to which the 5 fields described above are passed as 5 arguments,
each time a new token is found.zKa-Ping Yee <ping@lfw.org>z@GvR, ESR, Tim Peters, Thomas Wouters, Fred Drake, Skip Montanaro� N)�BOM_UTF8�lookup)�*� )�tokenc C s g | ]}|d dkr|�qS )r �_� )�.0�xr r �./usr/lib64/python3.6/lib2to3/pgen2/tokenize.py�
<listcomp>% s r �tokenize�generate_tokens�
untokenizec G s ddj | � d S )N�(�|�))�join)�choicesr r r �group0 s r c G s t | � d S )Nr )r )r r r r �any1 s r c G s t | � d S )N�?)r )r r r r �maybe2 s r z[ \f\t]*z #[^\r\n]*z\\\r?\nz [a-zA-Z_]\w*z0[bB]_?[01]+(?:_[01]+)*z(0[xX]_?[\da-fA-F]+(?:_[\da-fA-F]+)*[lL]?z 0[oO]?_?[0-7]+(?:_[0-7]+)*[lL]?z[1-9]\d*(?:_\d+)*[lL]?z0[lL]?z[eE][-+]?\d+(?:_\d+)*z \d+(?:_\d+)*\.(?:\d+(?:_\d+)*)?z\.\d+(?:_\d+)*z \d+(?:_\d+)*z\d+(?:_\d+)*[jJ]z[jJ]z[^'\\]*(?:\\.[^'\\]*)*'z[^"\\]*(?:\\.[^"\\]*)*"z%[^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''z%[^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""z#(?:[uUrRbBfF]|[rR][bB]|[bBuU][rR])?�'''�"""z '[^\n'\\]*(?:\\.[^\n'\\]*)*'z "[^\n"\\]*(?:\\.[^\n"\\]*)*"z\*\*=?z>>=?z<<=?z<>z!=z//=?z->z[+\-*/%&@|^=<>]=?�~z[][(){}]z\r?\nz[:;.,`@]z'[^\n'\\]*(?:\\.[^\n'\\]*)*�'z"[^\n"\\]*(?:\\.[^\n"\\]*)*�")4r r z'''z"""zr'''zr"""zu'''zu"""zb'''zb"""zf'''zf"""zur'''zur"""zbr'''zbr"""zrb'''zrb"""zR'''zR"""zU'''zU"""zB'''zB"""zF'''zF"""zuR'''zuR"""zUr'''zUr"""zUR'''zUR"""zbR'''zbR"""zBr'''zBr"""zBR'''zBR"""zrB'''zrB"""zRb'''zRb"""zRB'''zRB"""�r�R�u�U�f�F�b�B�r'''�r"""�R'''�R"""�u'''�u"""�U'''�U"""�b'''�b"""�B'''�B"""�f'''�f"""�F'''�F"""�ur'''�ur"""�Ur'''�Ur"""�uR'''�uR"""�UR'''�UR"""�br'''�br"""�Br'''�Br"""�bR'''�bR"""�BR'''�BR"""�rb'''�rb"""�Rb'''�Rb"""�rB'''�rB"""�RB'''�RB"""�r'�r"�R'�R"�u'�u"�U'�U"�b'�b"�B'�B"�f'�f"�F'�F"�ur'�ur"�Ur'�Ur"�uR'�uR"�UR'�UR"�br'�br"�Br'�Br"�bR'�bR"�BR'�BR"�rb'�rb"�Rb'�Rb"�rB'�rB"�RB'�RB"� c @ s e Zd ZdS )�
TokenErrorN)�__name__�
__module__� __qualname__r r r r rw � s rw c @ s e Zd ZdS )�StopTokenizingN)rx ry rz r r r r r{ � s r{ c C s4 |\}}|\}}t d||||t| t|�f � d S )Nz%d,%d-%d,%d: %s %s)�print�tok_name�repr) �typer Zxxx_todo_changemeZxxx_todo_changeme1�lineZsrowZscolZerowZecolr r r �
printtoken� s r� c C s( yt | |� W n tk
r" Y nX dS )a:
The tokenize() function accepts two parameters: one representing the
input stream, and one providing an output mechanism for tokenize().
The first parameter, readline, must be a callable object which provides
the same interface as the readline() method of built-in file objects.
Each call to the function should return one line of input as a string.
The second parameter, tokeneater, must also be a callable object. It is
called once for each token, with five arguments, corresponding to the
tuples generated by generate_tokens().
N)�
tokenize_loopr{ )�readline�
tokeneaterr r r r
� s
c C s xt | �D ] }||� q
W d S )N)r )r� r� Z
token_infor r r r� � s r� c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� Untokenizerc C s g | _ d| _d| _d S )Nr r )�tokens�prev_row�prev_col)�selfr r r �__init__� s zUntokenizer.__init__c C s* |\}}|| j }|r&| jjd| � d S )N� )r� r� �append)r� �start�row�col�
col_offsetr r r �add_whitespace� s
zUntokenizer.add_whitespacec C s� xv|D ]n}t |�dkr$| j||� P |\}}}}}| j|� | jj|� |\| _| _|ttfkr| jd7 _d| _qW dj | j�S )N� r r � )
�len�compatr� r� r� r� r� �NEWLINE�NLr )r� �iterable�t�tok_typer r� �endr� r r r r � s
zUntokenizer.untokenizec C s� d}g }| j j}|\}}|ttfkr,|d7 }|ttfkr<d}x�|D ]�}|d d� \}}|ttttfkrn|d7 }|tkr�|j|� qBn>|t kr�|j
� qBn*|ttfkr�d}n|r�|r�||d � d}||� qBW d S )NFr� Tr� r ���) r� r� �NAME�NUMBERr� r� �ASYNC�AWAIT�INDENT�DEDENT�pop) r� r r� � startline�indents� toks_append�toknum�tokval�tokr r r r� � s0
zUntokenizer.compatN)rx ry rz r� r� r r� r r r r r� � s r� z&^[ \t\f]*#.*?coding[:=][ \t]*([-\w.]+)s ^[ \t\f]*(?:[#\r\n]|$)c C sH | dd� j � jdd�}|dks*|jd�r.dS |d
ks@|jd�rDdS | S )z(Imitates get_normal_name in tokenizer.c.N� r �-zutf-8zutf-8-�latin-1�
iso-8859-1� iso-latin-1�latin-1-� iso-8859-1-� iso-latin-1-)r� r� r� )r� r� r� )�lower�replace�
startswith)�orig_enc�encr r r �_get_normal_name s
r� c s� d� d}d}�fdd�}� fdd�}|� }|j t�rHd� |d d� }d
}|sT|g fS ||�}|rj||gfS tj|�s~||gfS |� }|s�||gfS ||�}|r�|||gfS |||gfS ) a
The detect_encoding() function is used to detect the encoding that should
be used to decode a Python source file. It requires one argument, readline,
in the same way as the tokenize() generator.
It will call readline a maximum of twice, and return the encoding used
(as a string) and a list of any lines (left as bytes) it has read
in.
It detects the encoding from the presence of a utf-8 bom or an encoding
cookie as specified in pep-0263. If both a bom and a cookie are present, but
disagree, a SyntaxError will be raised. If the encoding cookie is an invalid
charset, raise a SyntaxError. Note that if a utf-8 bom is found,
'utf-8-sig' is returned.
If no encoding is specified, then the default of 'utf-8' will be returned.
FNzutf-8c s" y� � S t k
r t� S X d S )N)�
StopIteration�bytesr )r� r r � read_or_stop s z%detect_encoding.<locals>.read_or_stopc s� y| j d�}W n tk
r" d S X tj|�}|s6d S t|jd��}y t|�}W n tk
rp td| ��Y nX � r�|j dkr�td��|d7 }|S )N�asciir zunknown encoding: zutf-8zencoding problem: utf-8z-sig)
�decode�UnicodeDecodeError� cookie_re�matchr� r r � LookupError� SyntaxError�name)r� � line_stringr� �encoding�codec)� bom_foundr r � find_cookie& s"
z$detect_encoding.<locals>.find_cookieT� z utf-8-sig)r� r �blank_rer� )r� r� �defaultr� r� �first�secondr )r� r� r �detect_encoding s0
r� c C s t � }|j| �S )a� Transform tokens back into Python source code.
Each element returned by the iterable must be a token sequence
with at least two elements, a token number and token value. If
only two tokens are passed, the resulting output is poor.
Round-trip invariant for full input:
Untokenized source will match input source exactly
Round-trip invariant for limited intput:
# Output text will tokenize the back to the input
t1 = [tok[:2] for tok in generate_tokens(f.readline)]
newcode = untokenize(t1)
readline = iter(newcode.splitlines(1)).next
t2 = [tok[:2] for tokin generate_tokens(readline)]
assert t1 == t2
)r� r )r� �utr r r r T s c ! c s� d } }}t jd d }}d \}}d}dg} d}
d} d} d}
�x�y
| � }W n tk
rd d}Y nX |d }dt|� }}|�rF|s�td|��|j|�}|r�|jd� }}t||d|� |||f|| fV d!\}}d}nd|�r0|d"d� d
k�r0|d#d� d k�r0t|| ||t|�f|fV d}d}qBn|| }|| }qB�nF|dk�rt| �rt|�s`P d}xf||k �r�|| d
k�r�|d }n6|| dk�r�|t d t }n|| dk�r�d}nP |d }�qfW ||k�r�P |
�r�|
V d}
|| dk�r�|| dk�rh||d� j
d�}|t|� }t |||f||t|� f|fV t ||d� ||f|t|�f|fV qBt t f|| dk ||d� ||f|t|�f|fV qB|| d$ k�r�| j
|� t|d|� |df||f|fV xt|| d% k �rJ|| k�rtdd|||f��| dd&� } | �r.| | d' k�r.d} d}
d} td||f||f|fV �q�W | �r�|
�r�| | d( k�r�d} d}
d} n|�s�td|df��d}�x�||k �r8tj||�}|�r |jd�\}}||f||f| }}}|||� || } } | |k�s| dk�r| dk�rt| |||fV �q4| dk�rft} |dk�r8t } n
| �rBd}
|
�rR|
V d}
| | |||fV �q4| dk�r�|
�r�|
V d}
t | |||fV �q4| tk�rt| }|j||�}|�r�|jd�}|||� } |
�r�|
V d}
t| |||f|fV n||f}||d� }|}P �q4| tk�s@| dd � tk�s@| dd � tk�r�| d) dk�r�||f}t| �pxt| d �pxt| d }||d� d }}|}P n |
�r�|
V d}
t| |||fV �q4| |k�r�| d*k�r�| �r�| dk�r�tnt| |||fV �q�t| |||f} | dk�r |
�r | }
�q�| dk�rx|
�rx|
d tk�rx|
d dk�rxd} | d+ } t|
d |
d |
d |
d fV d}
|
�r�|
V d}
| V nz| d k�r�|
�r�|
V d}
t | |||f|fV d}nF| d k�r�|d }n| d k�r�|d }|
�r�|
V d}
t| |||fV n(t|| ||f||d f|fV |d }�q�W qBW |
�rN|
V d}
x.| dd� D ] } td|df|dfdfV �q\W t d|df|dfdfV dS ),aT
The generate_tokens() generator requires one argument, readline, which
must be a callable object which provides the same interface as the
readline() method of built-in file objects. Each call to the function
should return one line of input as a string. Alternately, readline
can be a callable function terminating with StopIteration:
readline = open(myfile).next # Example of alternate readline
The generator produces 5-tuples with these members: the token type; the
token string; a 2-tuple (srow, scol) of ints specifying the row and
column where the token begins in the source; a 2-tuple (erow, ecol) of
ints specifying the row and column where the token ends in the source;
and the line on which the token was found. The line passed is the
logical line; continuation lines are included.
r r �
0123456789r� NFr zEOF in multi-line stringr� z\
r� z\
r� � � z#
�#z
z3unindent does not match any outer indentation levelz
<tokenize>zEOF in multi-line statement�.T�
�async�await�def� �\z([{z)]})r� r )r� r ������r� r� r� r� r� r� )r� r� r� ) �stringZ
ascii_lettersr� r� rw r� r� �STRING�
ERRORTOKEN�tabsize�rstrip�COMMENTr� r� r� �IndentationErrorr� �
pseudoprog�spanr� r� �
triple_quoted�endprogs�
single_quotedr� r� r� �OP� ENDMARKER)!r� �lnum�parenlev� continuedZ namechars�numchars�contstr�needcont�contliner� �stashed� async_def�async_def_indent� async_def_nlr� �pos�max�strstart�endprog�endmatchr� �column�
comment_token�nl_pos� pseudomatchr� �spos�eposr �initial�newliner� �indentr r r r i sp
*
�__main__)*r r r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM )*r r rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru )S�__doc__�
__author__� __credits__r� �re�codecsr r Zlib2to3.pgen2.tokenr� r �dir�__all__r� � NameError�strr r r �
Whitespace�Comment�Ignore�Name� Binnumber� Hexnumber� Octnumber� Decnumber� Intnumber�Exponent�
Pointfloat�Expfloat� Floatnumber�
Imagnumber�Number�Single�Double�Single3�Double3Z
_litprefix�Triple�String�Operator�Bracket�Special�Funny�
PlainToken�Token�ContStr� PseudoExtras� PseudoToken�list�map�compileZ tokenprogr� Z single3progZ double3progr� r� r� r� r� � Exceptionrw r{ r� r
r� r� �ASCIIr� r� r� r� r r rx �sysr� �argv�openr� �stdinr r r r �<module> s�
8 I c
pgen2/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000237 15053244155 0015121 0 ustar 00 3
\� � @ s d Z dS )zThe pgen2 package.N)�__doc__� r r �./usr/lib64/python3.6/lib2to3/pgen2/__init__.py�<module> s pgen2/__pycache__/tokenize.cpython-36.opt-2.pyc 0000644 00000026167 15053244155 0015225 0 ustar 00 3
\NX � = @ s� d Z dZddlZddlZddlmZmZ ddlT ddlm Z dd � e
e �D �d
d d g Z [ ye W n e
k
rz eZ Y nX d
d� Zdd� Zdd� ZdZdZeede � ee� ZdZdZdZdZedd�Zeeeee�Zd Zed d �ee� Z d e Z ee e �Z ed e d! �Z ee e e�Z d"Z!d#Z"d$Z#d%Z$d&Z%ee%d' e%d( �Z&ee%d) e%d* �Z'ed+d,d-d.d/d0d1d2d3� Z(d4Z)ed5d6�Z*ee(e)e*�Z+ee e+e'e�Z,ee, Z-ee%d7 ed8d� e%d9 ed:d� �Z.edee&�Z/eee/e e+e.e� Z0e1e2ej3e-e0e#e$f��\Z4Z5Z6Z7ej3e!�ej3e"�e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7e6e7ddddddddd;�4Z8i Z9xd�D ]Z:e:e9e:< �q�W i Z;xd�D ]Z:e:e;e:< �q�W d�Z<G d�d�� d�e=�Z>G d�d�� d�e=�Z?d�d�� Z@e@fd�d
�ZAd�d�� ZBG d�d�� d��ZCej3d�ejD�ZEej3d�ejD�ZFd�d�� ZGd�d�� ZHd�d � ZId�d � ZJeKd�k�r�ddlLZLeMeLjN�dk�rxeAeOeLjNd �jP� n eAeLjQjP� dS )�zKa-Ping Yee <ping@lfw.org>z@GvR, ESR, Tim Peters, Thomas Wouters, Fred Drake, Skip Montanaro� N)�BOM_UTF8�lookup)�*� )�tokenc C s g | ]}|d dkr|�qS )r �_� )�.0�xr r �./usr/lib64/python3.6/lib2to3/pgen2/tokenize.py�
<listcomp>% s r �tokenize�generate_tokens�
untokenizec G s ddj | � d S )N�(�|�))�join)�choicesr r r �group0 s r c G s t | � d S )Nr )r )r r r r �any1 s r c G s t | � d S )N�?)r )r r r r �maybe2 s r z[ \f\t]*z #[^\r\n]*z\\\r?\nz [a-zA-Z_]\w*z0[bB]_?[01]+(?:_[01]+)*z(0[xX]_?[\da-fA-F]+(?:_[\da-fA-F]+)*[lL]?z 0[oO]?_?[0-7]+(?:_[0-7]+)*[lL]?z[1-9]\d*(?:_\d+)*[lL]?z0[lL]?z[eE][-+]?\d+(?:_\d+)*z \d+(?:_\d+)*\.(?:\d+(?:_\d+)*)?z\.\d+(?:_\d+)*z \d+(?:_\d+)*z\d+(?:_\d+)*[jJ]z[jJ]z[^'\\]*(?:\\.[^'\\]*)*'z[^"\\]*(?:\\.[^"\\]*)*"z%[^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''z%[^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""z#(?:[uUrRbBfF]|[rR][bB]|[bBuU][rR])?�'''�"""z '[^\n'\\]*(?:\\.[^\n'\\]*)*'z "[^\n"\\]*(?:\\.[^\n"\\]*)*"z\*\*=?z>>=?z<<=?z<>z!=z//=?z->z[+\-*/%&@|^=<>]=?�~z[][(){}]z\r?\nz[:;.,`@]z'[^\n'\\]*(?:\\.[^\n'\\]*)*�'z"[^\n"\\]*(?:\\.[^\n"\\]*)*�")4r r z'''z"""zr'''zr"""zu'''zu"""zb'''zb"""zf'''zf"""zur'''zur"""zbr'''zbr"""zrb'''zrb"""zR'''zR"""zU'''zU"""zB'''zB"""zF'''zF"""zuR'''zuR"""zUr'''zUr"""zUR'''zUR"""zbR'''zbR"""zBr'''zBr"""zBR'''zBR"""zrB'''zrB"""zRb'''zRb"""zRB'''zRB"""�r�R�u�U�f�F�b�B�r'''�r"""�R'''�R"""�u'''�u"""�U'''�U"""�b'''�b"""�B'''�B"""�f'''�f"""�F'''�F"""�ur'''�ur"""�Ur'''�Ur"""�uR'''�uR"""�UR'''�UR"""�br'''�br"""�Br'''�Br"""�bR'''�bR"""�BR'''�BR"""�rb'''�rb"""�Rb'''�Rb"""�rB'''�rB"""�RB'''�RB"""�r'�r"�R'�R"�u'�u"�U'�U"�b'�b"�B'�B"�f'�f"�F'�F"�ur'�ur"�Ur'�Ur"�uR'�uR"�UR'�UR"�br'�br"�Br'�Br"�bR'�bR"�BR'�BR"�rb'�rb"�Rb'�Rb"�rB'�rB"�RB'�RB"� c @ s e Zd ZdS )�
TokenErrorN)�__name__�
__module__� __qualname__r r r r rw � s rw c @ s e Zd ZdS )�StopTokenizingN)rx ry rz r r r r r{ � s r{ c C s4 |\}}|\}}t d||||t| t|�f � d S )Nz%d,%d-%d,%d: %s %s)�print�tok_name�repr) �typer Zxxx_todo_changemeZxxx_todo_changeme1�lineZsrowZscolZerowZecolr r r �
printtoken� s r� c C s( yt | |� W n tk
r" Y nX d S )N)�
tokenize_loopr{ )�readline�
tokeneaterr r r r
� s
c C s xt | �D ] }||� q
W d S )N)r )r� r� Z
token_infor r r r� � s r� c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� Untokenizerc C s g | _ d| _d| _d S )Nr r )�tokens�prev_row�prev_col)�selfr r r �__init__� s zUntokenizer.__init__c C s* |\}}|| j }|r&| jjd| � d S )N� )r� r� �append)r� �start�row�col�
col_offsetr r r �add_whitespace� s
zUntokenizer.add_whitespacec C s� xv|D ]n}t |�dkr$| j||� P |\}}}}}| j|� | jj|� |\| _| _|ttfkr| jd7 _d| _qW dj | j�S )N� r r � )
�len�compatr� r� r� r� r� �NEWLINE�NLr )r� �iterable�t�tok_typer r� �endr� r r r r � s
zUntokenizer.untokenizec C s� d}g }| j j}|\}}|ttfkr,|d7 }|ttfkr<d}x�|D ]�}|d d� \}}|ttttfkrn|d7 }|tkr�|j|� qBn>|t kr�|j
� qBn*|ttfkr�d}n|r�|r�||d � d}||� qBW d S )NFr� Tr� r ���) r� r� �NAME�NUMBERr� r� �ASYNC�AWAIT�INDENT�DEDENT�pop) r� r r� � startline�indents� toks_append�toknum�tokval�tokr r r r� � s0
zUntokenizer.compatN)rx ry rz r� r� r r� r r r r r� � s r� z&^[ \t\f]*#.*?coding[:=][ \t]*([-\w.]+)s ^[ \t\f]*(?:[#\r\n]|$)c C sH | d d� j � jdd�}|dks*|jd�r.dS |d ks@|jd
�rDdS | S )N� r �-zutf-8zutf-8-�latin-1�
iso-8859-1� iso-latin-1�latin-1-� iso-8859-1-� iso-latin-1-)r� r� r� )r� r� r� )�lower�replace�
startswith)�orig_enc�encr r r �_get_normal_name s
r� c s� d� d }d}�fdd�}� fdd�}|� }|j t�rHd� |dd � }d }|sT|g fS ||�}|rj||gfS tj|�s~||gfS |� }|s�||gfS ||�}|r�|||gfS |||gfS )
NFzutf-8c s" y� � S t k
r t� S X d S )N)�
StopIteration�bytesr )r� r r � read_or_stop s z%detect_encoding.<locals>.read_or_stopc s� y| j d�}W n tk
r" d S X tj|�}|s6d S t|jd��}y t|�}W n tk
rp td| ��Y nX � r�|j dkr�td��|d7 }|S )N�asciir zunknown encoding: zutf-8zencoding problem: utf-8z-sig)
�decode�UnicodeDecodeError� cookie_re�matchr� r r � LookupError� SyntaxError�name)r� � line_stringr� �encoding�codec)� bom_foundr r � find_cookie& s"
z$detect_encoding.<locals>.find_cookieT� z utf-8-sig)r� r �blank_rer� )r� r� �defaultr� r� �first�secondr )r� r� r �detect_encoding s0
r� c C s t � }|j| �S )N)r� r )r� �utr r r r T s c ! c s� d } }}t jd d }}d \}}d }dg} d }
d} d} d}
�x�y
| � }W n tk
rd d}Y nX |d }dt|� }}|�rF|s�td|��|j|�}|r�|jd� }}t||d |� |||f|| fV d \}}d }nd|�r0|d!d � d k�r0|d"d � d k�r0t|| ||t|�f|fV d}d }qBn|| }|| }qB�nF|dk�rt| �rt|�s`P d}xf||k �r�|| d k�r�|d }n6|| d
k�r�|t d t }n|| dk�r�d}nP |d }�qfW ||k�r�P |
�r�|
V d }
|| dk�r�|| dk�rh||d � j
d�}|t|� }t |||f||t|� f|fV t ||d � ||f|t|�f|fV qBt t f|| dk ||d � ||f|t|�f|fV qB|| d# k�r�| j
|� t|d |� |df||f|fV xt|| d$ k �rJ|| k�rtdd|||f��| d d%� } | �r.| | d& k�r.d} d}
d} td||f||f|fV �q�W | �r�|
�r�| | d' k�r�d} d}
d} n|�s�td|df��d}�x�||k �r8tj||�}|�r |jd�\}}||f||f| }}}|||� || } } | |k�s| dk�r| dk�rt| |||fV �q4| dk�rft} |dk�r8t } n
| �rBd}
|
�rR|
V d }
| | |||fV �q4| dk�r�|
�r�|
V d }
t | |||fV �q4| tk�rt| }|j||�}|�r�|jd�}|||� } |
�r�|
V d }
t| |||f|fV n||f}||d � }|}P �q4| tk�s@| d d� tk�s@| d d
� tk�r�| d( dk�r�||f}t| �pxt| d �pxt| d }||d � d }}|}P n |
�r�|
V d }
t| |||fV �q4| |k�r�| d)k�r�| �r�| dk�r�tnt| |||fV �q�t| |||f} | dk�r |
�r | }
�q�| dk�rx|
�rx|
d tk�rx|
d dk�rxd} | d* } t|
d |
d |
d
|
d fV d }
|
�r�|
V d }
| V nz| d k�r�|
�r�|
V d }
t | |||f|fV d}nF| d k�r�|d }n| d k�r�|d }|
�r�|
V d }
t| |||fV n(t|| ||f||d f|fV |d }�q�W qBW |
�rN|
V d }
x.| dd � D ] } td|df|dfdfV �q\W t d|df|dfdfV d S )+Nr r �
0123456789r� Fr zEOF in multi-line stringr� z\
r� z\
r� � � z#
�#z
z3unindent does not match any outer indentation levelz
<tokenize>zEOF in multi-line statement�.T�
�async�await�def� �\z([{z)]})r� r )r� r ������r� r� r� r� r� r� )r� r� r� ) �stringZ
ascii_lettersr� r� rw r� r� �STRING�
ERRORTOKEN�tabsize�rstrip�COMMENTr� r� r� �IndentationErrorr� �
pseudoprog�spanr� r� �
triple_quoted�endprogs�
single_quotedr� r� r� �OP� ENDMARKER)!r� �lnum�parenlev� continuedZ namechars�numchars�contstr�needcont�contliner� �stashed� async_def�async_def_indent� async_def_nlr� �pos�max�strstart�endprog�endmatchr� �column�
comment_token�nl_pos� pseudomatchr� �spos�eposr �initial�newliner� �indentr r r r i sp
*
�__main__)*r r r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM )*r r rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru )R�
__author__� __credits__r� �re�codecsr r Zlib2to3.pgen2.tokenr� r �dir�__all__r� � NameError�strr r r �
Whitespace�Comment�Ignore�Name� Binnumber� Hexnumber� Octnumber� Decnumber� Intnumber�Exponent�
Pointfloat�Expfloat� Floatnumber�
Imagnumber�Number�Single�Double�Single3�Double3Z
_litprefix�Triple�String�Operator�Bracket�Special�Funny�
PlainToken�Token�ContStr� PseudoExtras� PseudoToken�list�map�compileZ tokenprogr� Z single3progZ double3progr� r� r� r� r� � Exceptionrw r{ r� r
r� r� �ASCIIr� r� r� r� r r rx �sysr� �argv�openr� �stdinr r r r �<module> s�
8 I c
pgen2/__pycache__/literals.cpython-36.opt-1.pyc 0000644 00000002502 15053244155 0015176 0 ustar 00 3
\O � @ sP d Z ddlZddddddd d
d d d
�
Zdd� Zdd� Zdd� ZedkrLe� dS )z<Safely evaluate Python string literals without using eval().� N��� �
�
� � �'�"�\)
�a�b�f�n�r�t�vr r
r c C s� | j dd�\}}tj|�}|d k r&|S |jd�r�|dd � }t|�dk rTtd| ��yt|d�}W q� tk
r� td| ��Y q�X n0yt|d�}W n tk
r� td| ��Y nX t|�S ) Nr � �x� z!invalid hex string escape ('\%s')� � z#invalid octal string escape ('\%s'))�group�simple_escapes�get�
startswith�len�
ValueError�int�chr)�m�all�tail�escZhexes�i� r% �./usr/lib64/python3.6/lib2to3/pgen2/literals.py�escape s"
r' c C sH | d }| d d� |d kr$|d }| t |�t |� � } tjdt| �S )Nr � z)\\(\'|\"|\\|[abfnrtv]|x.{0,2}|[0-7]{1,3}))r �re�subr' )�s�qr% r% r& �
evalString( s
r- c C sD x>t d�D ]2} t| �}t|�}t|�}||kr
t| |||� q
W d S )N� )�ranger �reprr- �print)r$ �cr+ �er% r% r& �test2 s r4 �__main__)�__doc__r) r r' r- r4 �__name__r% r% r% r& �<module> s
pgen2/__pycache__/pgen.cpython-36.opt-2.pyc 0000644 00000022165 15053244155 0014320 0 ustar 00 3
\�5 � @ sd d dl mZmZmZ G dd� dej�ZG dd� de�ZG dd� de�ZG dd � d e�Z dd d �Z
d
S )� )�grammar�token�tokenizec @ s e Zd ZdS )� PgenGrammarN)�__name__�
__module__� __qualname__� r r �*/usr/lib64/python3.6/lib2to3/pgen2/pgen.pyr s r c @ s� e Zd Zd&dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd'd d!�Zd"d#� Zd$d%� ZdS )(�ParserGeneratorNc C sl d }|d krt |�}|j}|| _|| _tj|j�| _| j� | j � \| _
| _ |d k rZ|� i | _ | j
� d S )N)�open�close�filename�streamr �generate_tokens�readline� generator�gettoken�parse�dfas� startsymbol�first� addfirstsets)�selfr r Z close_streamr r r
�__init__ s zParserGenerator.__init__c C s* t � }t| jj� �}|j� |j| j� |jd| j� x.|D ]&}dt|j � }||j |< ||j
|< q<W x�|D ]�}| j| }g }xl|D ]d}g }x6t |j j
� �D ]$\} }
|j| j|| �|j|
�f� q�W |jr�|jd|j|�f� |j|� q�W |jj|� || j||�f|j|j | < qlW |j | j |_|S )N� � )r �listr �keys�sort�remover �insert�len�
symbol2numberZ
number2symbol�sorted�arcs�items�append�
make_label�index�isfinal�states�
make_first�start) r �c�names�name�i�dfar+ �stater% �label�nextr r r
� make_grammar s.
z ParserGenerator.make_grammarc C s8 | j | }i }x$t|�D ]}| j||�}d||< qW |S )Nr )r r$ r( )r r. r0 Zrawfirstr r4 �ilabelr r r
r, 4 s
zParserGenerator.make_firstc C s& t |j�}|d j� r�||jkrZ||jkr4|j| S |jj|j| d f� ||j|< |S n>tt|d �}||jkrz|j| S |jj|d f� ||j|< |S n�t |�}|d j� r�||j
kr�|j
| S |jjtj |f� ||j
|< |S n>t j
| }||jk�r|j| S |jj|d f� ||j|< |S d S )Nr )r" Zlabels�isalphar# Z symbol2labelr' �getattrr �tokens�eval�keywords�NAMEr Zopmap)r r. r4 r7 Zitoken�valuer r r
r( = s6
zParserGenerator.make_labelc C s< t | jj� �}|j� x |D ]}|| jkr | j|� q W d S )N)r r r r r � calcfirst)r r/ r0 r r r
r k s
z ParserGenerator.addfirstsetsc C s
| j | }d | j|< |d }i }i }x�|jj� D ]x\}}|| j kr�|| jkrl| j| }|d kr�td| ��n| j|� | j| }|j|� |||< q0d||< |di||< q0W i } xJ|j� D ]>\}}
x4|
D ],} | | kr�td|| || | f ��|| | < q�W q�W || j|< d S )Nr zrecursion for rule %rr zArule %s is ambiguous; %s is in the first sets of %s as well as %s)r r r% r& �
ValueErrorr? �update) r r0 r2 r3 ZtotalsetZ overlapcheckr4 r5 �fsetZinverseZitsfirstZsymbolr r r
r? s s2
zParserGenerator.calcfirstc C s� i }d }x�| j tjkr�x| j tjkr.| j� qW | jtj�}| jtjd� | j� \}}| jtj� | j ||�}t
|�}| j |� t
|�}|||< |d kr
|}q
W ||fS )N�:) �typer � ENDMARKER�NEWLINEr �expectr= �OP� parse_rhs�make_dfar" � simplify_dfa) r r r r0 �a�zr2 ZoldlenZnewlenr r r
r � s"
zParserGenerator.parsec s� � fdd�}� fdd�� t ||�|�g}x�|D ]�}i }x<|jD ]2}x,|jD ]"\}} |d k rJ� | |j|i �� qJW q>W xRt|j� �D ]B\}}
x,|D ]} | j|
kr�P q�W t |
|�} |j| � |j| |� q�W q.W |S )Nc s i }� | |� |S )Nr )r3 �base)�
addclosurer r
�closure� s
z)ParserGenerator.make_dfa.<locals>.closurec s> | |kr d S d|| < x$| j D ]\}}|d kr � ||� q W d S )Nr )r% )r3 rN r4 r5 )rO r r
rO � s z,ParserGenerator.make_dfa.<locals>.addclosure)�DFAState�nfasetr% �
setdefaultr$ r& r' �addarc) r r- �finishrP r+ r3 r% Znfastater4 r5 rR �str )rO r
rJ � s"
zParserGenerator.make_dfac
C s� t d|� |g}x�t|�D ]�\}}t d|||kr4dp6d� x^|jD ]T\}}||kr^|j|�} nt|�} |j|� |d kr�t d| � qBt d|| f � qBW qW d S )NzDump of NFA forz Statez(final)� z -> %dz %s -> %d)�print� enumerater% r) r" r' )
r r0 r- rU Ztodor1 r3 r4 r5 �jr r r
�dump_nfa� s
zParserGenerator.dump_nfac C sl t d|� x\t|�D ]P\}}t d||jr,dp.d� x0t|jj� �D ] \}}t d||j|�f � qBW qW d S )NzDump of DFA forz Statez(final)rW z %s -> %d)rX rY r* r$ r% r& r) )r r0 r2 r1 r3 r4 r5 r r r
�dump_dfa� s
zParserGenerator.dump_dfac C s~ d}xt|rxd}xft |�D ]Z\}}xPt|d t|��D ]:}|| }||kr4||= x|D ]}|j||� qTW d}P q4W qW qW d S )NTFr )rY �ranger" �
unifystate)r r2 Zchangesr1 Zstate_irZ Zstate_jr3 r r r
rK � s
z ParserGenerator.simplify_dfac C s� | j � \}}| jdkr ||fS t� }t� }|j|� |j|� x6| jdkrt| j� | j � \}}|j|� |j|� q@W ||fS d S )N�|)� parse_altr> �NFAStaterT r )r rL rM ZaaZzzr r r
rI � s
zParserGenerator.parse_rhsc C sP | j � \}}x:| jdks*| jtjtjfkrF| j � \}}|j|� |}qW ||fS )N�(�[)rb rc )�
parse_itemr> rD r r= �STRINGrT )r rL �br. �dr r r
r`
s
zParserGenerator.parse_altc C s� | j dkr>| j� | j� \}}| jtjd� |j|� ||fS | j� \}}| j }|dkr`||fS | j� |j|� |dkr�||fS ||fS d S )Nrc �]�+�*)ri rj )r> r rI rG r rH rT �
parse_atom)r rL rM r> r r r
rd s
zParserGenerator.parse_itemc C s� | j dkr4| j� | j� \}}| jtjd� ||fS | jtjtjfkrpt � }t � }|j
|| j � | j� ||fS | j d| j| j � d S )Nrb �)z+expected (...) or NAME or STRING, got %s/%s) r> r rI rG r rH rD r= re ra rT � raise_error)r rL rM r r r
rk ( s
zParserGenerator.parse_atomc C sD | j |ks |d k r2| j|kr2| jd||| j | j� | j}| j� |S )Nzexpected %s/%s, got %s/%s)rD r> rm r )r rD r> r r r
rG 9 s zParserGenerator.expectc C sJ t | j�}x"|d tjtjfkr,t | j�}q W |\| _| _| _| _| _ d S )Nr )
r5 r r �COMMENT�NLrD r> Zbegin�end�line)r �tupr r r
r A s
zParserGenerator.gettokenc G s^ |r8y || }W n& dj |gttt|�� �}Y nX t|| j| jd | jd | jf��d S )N� r r )�joinr �map�str� SyntaxErrorr rp rq )r �msg�argsr r r
rm H s zParserGenerator.raise_error)N)N)r r r r r6 r, r( r r? r rJ r[ r\ rK rI r` rd rk rG r rm r r r r
r
s$
. $
r c @ s e Zd Zdd� Zddd�ZdS )ra c C s
g | _ d S )N)r% )r r r r
r S s zNFAState.__init__Nc C s | j j||f� d S )N)r% r' )r r5 r4 r r r
rT V s zNFAState.addarc)N)r r r r rT r r r r
ra Q s ra c @ s0 e Zd Zdd� Zdd� Zdd� Zdd� Zd Zd S )
rQ c C s || _ ||k| _i | _d S )N)rR r* r% )r rR �finalr r r
r ] s
zDFAState.__init__c C s || j |< d S )N)r% )r r5 r4 r r r
rT e s zDFAState.addarcc C s. x(| j j� D ]\}}||kr || j |< q W d S )N)r% r& )r �old�newr4 r5 r r r
r^ k s zDFAState.unifystatec C sX | j |j krdS t| j�t|j�kr(dS x*| jj� D ] \}}||jj|�k r4dS q4W dS )NFT)r* r" r% r& �get)r �otherr4 r5 r r r
�__eq__p s zDFAState.__eq__N)r r r r rT r^ r �__hash__r r r r
rQ [ s
rQ � Grammar.txtc C s t | �}|j� S )N)r r6 )r �pr r r
�generate_grammar� s r� N)r� ) rW r r r ZGrammarr �objectr ra rQ r� r r r r
�<module> s I
% pgen2/__pycache__/parse.cpython-36.opt-2.pyc 0000644 00000006006 15053244155 0014475 0 ustar 00 3
\u � @ s0 d dl mZ G dd� de�ZG dd� de�ZdS )� )�tokenc @ s e Zd Zdd� ZdS )�
ParseErrorc C s4 t j| d||||f � || _|| _|| _|| _d S )Nz!%s: type=%r, value=%r, context=%r)� Exception�__init__�msg�type�value�context)�selfr r r r � r �+/usr/lib64/python3.6/lib2to3/pgen2/parse.pyr s zParseError.__init__N)�__name__�
__module__� __qualname__r r r r r r s r c @ sH e Zd Zddd�Zddd�Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dS )�ParserNc C s || _ |pdd� | _d S )Nc S s |S )Nr )�grammar�noder r r �<lambda>W s z!Parser.__init__.<locals>.<lambda>)r �convert)r
r r r r r r 9 s zParser.__init__c C sH |d kr| j j}|d d g f}| j j| d|f}|g| _d | _t� | _d S )N� )r �start�dfas�stack�rootnode�set�
used_names)r
r �newnodeZ
stackentryr r r �setupY s
z Parser.setupc C s: | j |||�}�x$| jd \}}}|\}} || }
� x�|
D ]�\} } | jj| \}
}|| kr�| j||| |� | }x@|| d|fgkr�| j� | js�dS | jd \}}}|\}} qpW dS |
dkr:| jj|
}|\}}||kr:| j|
| jj|
| |� P q:W d|f|
k�r$| j� | j�s2td|||��qtd|||��qW d S )
Nr r TF� ztoo much inputz bad input���r ) �classifyr r Zlabels�shift�popr �pushr )r
r r r �ilabel�dfa�stater Zstates�firstZarcs�i�newstate�t�vZitsdfaZ itsstatesZitsfirstr r r �addtokenq s: zParser.addtokenc C sX |t jkr0| jj|� | jjj|�}|d k r0|S | jjj|�}|d krTtd|||��|S )Nz bad token) r �NAMEr �addr �keywords�get�tokensr )r
r r r r$ r r r r � s
zParser.classifyc C sT | j d \}}}|||d f}| j| j|�}|d k r@|d j|� |||f| j d< d S )Nr r r r )r r r �append) r
r r r) r r% r& r r r r r r! � s z Parser.shiftc C sB | j d \}}}|d |g f}|||f| j d< | j j|d|f� d S )Nr r r r )r r2 ) r
r Znewdfar) r r% r& r r r r r r# � s z Parser.pushc C s` | j j� \}}}| j| j|�}|d k r\| j rL| j d \}}}|d j|� n|| _| j| j_d S )Nr r r )r r" r r r2 r r )r
ZpopdfaZpopstateZpopnoder r% r& r r r r r" � s z
Parser.pop)N)N)
r
r r r r r, r r! r# r" r r r r r s
0 r N)� r r r �objectr r r r r �<module> s pgen2/__pycache__/token.cpython-36.opt-2.pyc 0000644 00000003412 15053244155 0014501 0 ustar 00 3
\ � @ sL d Z dZdZdZdZdZdZdZdZd Z d
Z
d Z d Z d
Z
dZdZdZdZdZdZdZdZdZdZdZdZdZdZd Z d Z d Z d Z d Z d!Z!d"Z"d#Z#d$Z$d%Z%d&Z&d'Z'd(Z(d)Z)d*Z*d+Z+d,Z,d-Z-d.Z.d/Z/d0Z0d1Z1d2Z2d3Z3d4Z4d5Z5d6Z6d7Z7d8Z8d9Z9d:Z:d;Z;d<Z<i Z=x6e>e?� j@� �D ]$\ZAZBeCeB�eCd �k�reAe=eB< �qW d=d>� ZDd?d@� ZEdAdB� ZFdCS )D� � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; � c C s | t k S )N)� NT_OFFSET)�x� r@ �+/usr/lib64/python3.6/lib2to3/pgen2/token.py�
ISTERMINALN s rB c C s | t kS )N)r> )r? r@ r@ rA �
ISNONTERMINALQ s rC c C s | t kS )N)� ENDMARKER)r? r@ r@ rA �ISEOFT s rE N)GrD �NAME�NUMBER�STRING�NEWLINE�INDENT�DEDENT�LPAR�RPAR�LSQB�RSQB�COLON�COMMA�SEMI�PLUS�MINUS�STAR�SLASH�VBAR�AMPER�LESS�GREATER�EQUAL�DOT�PERCENTZ BACKQUOTE�LBRACE�RBRACE�EQEQUAL�NOTEQUAL� LESSEQUAL� GREATEREQUAL�TILDE�
CIRCUMFLEX� LEFTSHIFT�
RIGHTSHIFT�
DOUBLESTAR� PLUSEQUAL�MINEQUAL� STAREQUAL�
SLASHEQUAL� PERCENTEQUAL�
AMPEREQUAL� VBAREQUAL�CIRCUMFLEXEQUAL�LEFTSHIFTEQUAL�RIGHTSHIFTEQUAL�DOUBLESTAREQUAL� DOUBLESLASH�DOUBLESLASHEQUAL�AT�ATEQUAL�OP�COMMENT�NL�RARROW�AWAIT�ASYNC�
ERRORTOKEN�N_TOKENSr> �tok_name�list�globals�items�_nameZ_value�typerB rC rE r@ r@ r@ rA �<module> s� pgen2/__pycache__/conv.cpython-36.opt-1.pyc 0000644 00000014004 15053244155 0014324 0 ustar 00 3
\�% � @ s2 d Z ddlZddlmZmZ G dd� dej�ZdS )a� Convert graminit.[ch] spit out by pgen to Python code.
Pgen is the Python parser generator. It is useful to quickly create a
parser from a grammar file in Python's grammar notation. But I don't
want my parsers to be written in C (yet), so I'm translating the
parsing tables to Python data structures and writing a Python parse
engine.
Note that the token numbers are constants determined by the standard
Python tokenizer. The standard token module defines these numbers and
their names (the names are not used much). The token numbers are
hardcoded into the Python tokenizer and into pgen. A Python
implementation of the Python tokenizer is also available, in the
standard tokenize module.
On the other hand, symbol numbers (representing the grammar's
non-terminals) are assigned by pgen based on the actual grammar
input.
Note: this module is pretty much obsolete; the pgen module generates
equivalent grammar tables directly from the Grammar.txt input file
without having to invoke the Python pgen C program.
� N)�grammar�tokenc @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) � Convertera2 Grammar subclass that reads classic pgen output files.
The run() method reads the tables as produced by the pgen parser
generator, typically contained in two C files, graminit.h and
graminit.c. The other methods are for internal use only.
See the base class for more documentation.
c C s | j |� | j|� | j� dS )z<Load the grammar tables from the text files written by pgen.N)�parse_graminit_h�parse_graminit_c�
finish_off)�selfZ
graminit_hZ
graminit_c� r �*/usr/lib64/python3.6/lib2to3/pgen2/conv.py�run/ s
z
Converter.runc C s� y t |�}W n0 tk
r< } ztd||f � dS d}~X nX i | _i | _d}xn|D ]f}|d7 }tjd|�}| r�|j� r�td|||j� f � qT|j� \}}t |�}|| j|< || j|< qTW dS ) z�Parse the .h file written by pgen. (Internal)
This file is a sequence of #define statements defining the
nonterminals of the grammar as numbers. We build two tables
mapping the numbers to names and back.
zCan't open %s: %sFNr � z^#define\s+(\w+)\s+(\d+)$z%s(%s): can't parse %sT)
�open�OSError�printZ
symbol2numberZ
number2symbol�re�match�strip�groups�int) r �filename�f�err�lineno�line�mo�symbol�numberr r r
r 5 s&
zConverter.parse_graminit_hc ! C s� y t |�}W n0 tk
r< } ztd||f � dS d}~X nX d}|d t|� }}|d t|� }}|d t|� }}i }g }�x�|jd��rx�|jd��rLtjd|�}ttt |j
� ��\} }
} g } xRt | �D ]F}
|d t|� }}tjd|�}ttt |j
� ��\}}| j ||f� q�W |d t|� }}| || |
f< |d t|� }}q�W tjd |�}ttt |j
� ��\}}g }x^t |�D ]R}
|d t|� }}tjd
|�}ttt |j
� ��\} } }
|| |
f } |j | � �q~W |j |� |d t|� }}|d t|� }}q�W || _
i }tjd |�}t |jd��}x�t |�D ]�}|d t|� }}tjd |�}|jd
�}ttt |jdddd���\}}}}|| }|d t|� }}tjd|�}i }t|jd��}xPt|�D ]D\}} t| �} x0t d�D ]$}| d|> @ �r�d||d | < �q�W �q�W ||f||< �q4W |d t|� }}|| _g } |d t|� }}tjd|�}t |jd��} xjt | �D ]^}|d t|� }}tjd|�}|j
� \}}t |�}|dk�r�d}nt|�}| j ||f� �qpW |d t|� }}| | _|d t|� }}|d t|� }}tjd|�}t |jd��}|d t|� }}|d t|� }}tjd|�}t |jd��} |d t|� }}tjd|�}t |jd��} | | _|d t|� }}y|d t|� }}W n tk
�r� Y nX dS )a� Parse the .c file written by pgen. (Internal)
The file looks as follows. The first two lines are always this:
#include "pgenheaders.h"
#include "grammar.h"
After that come four blocks:
1) one or more state definitions
2) a table defining dfas
3) a table defining labels
4) a struct defining the grammar
A state definition has the following form:
- one or more arc arrays, each of the form:
static arc arcs_<n>_<m>[<k>] = {
{<i>, <j>},
...
};
- followed by a state array, of the form:
static state states_<s>[<t>] = {
{<k>, arcs_<n>_<m>},
...
};
zCan't open %s: %sFNr r z static arc z)static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$z\s+{(\d+), (\d+)},$z'static state states_(\d+)\[(\d+)\] = {$z \s+{(\d+), arcs_(\d+)_(\d+)},$z static dfa dfas\[(\d+)\] = {$z0\s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$� � � � z\s+("(?:\\\d\d\d)*")},$� z!static label labels\[(\d+)\] = {$z\s+{(\d+), (0|"\w+")},$�0z
\s+(\d+),$z\s+{(\d+), labels},$z \s+(\d+)$)r
r r �next�
startswithr r �list�mapr r �range�append�states�group�eval� enumerate�ord�dfas�labels�start�
StopIteration)!r r r r r r Zallarcsr) r �n�m�kZarcs�_�i�j�s�t�stater. Zndfasr r �x�y�z�firstZ rawbitset�cZbyter/ Znlabelsr0 r r r
r T s�
"
zConverter.parse_graminit_cc C s\ i | _ i | _xJt| j�D ]<\}\}}|tjkrB|dk rB|| j |< q|dkr|| j|< qW dS )z1Create additional useful structures. (Internal).N)�keywords�tokensr, r/ r �NAME)r Zilabel�type�valuer r r
r � s zConverter.finish_offN)�__name__�
__module__� __qualname__�__doc__r r r r r r r r
r $ s &r )rH r Zpgen2r r ZGrammarr r r r r
�<module> s pgen2/__pycache__/pgen.cpython-36.pyc 0000644 00000023071 15053244155 0013355 0 ustar 00 3
\�5 � @ sd d dl mZmZmZ G dd� dej�ZG dd� de�ZG dd� de�ZG dd � d e�Z dd d �Z
d
S )� )�grammar�token�tokenizec @ s e Zd ZdS )� PgenGrammarN)�__name__�
__module__� __qualname__� r r �*/usr/lib64/python3.6/lib2to3/pgen2/pgen.pyr s r c @ s� e Zd Zd&dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd'd d!�Zd"d#� Zd$d%� ZdS )(�ParserGeneratorNc C sl d }|d krt |�}|j}|| _|| _tj|j�| _| j� | j � \| _
| _ |d k rZ|� i | _ | j
� d S )N)�open�close�filename�streamr �generate_tokens�readline� generator�gettoken�parse�dfas� startsymbol�first� addfirstsets)�selfr r Z close_streamr r r
�__init__ s zParserGenerator.__init__c C s* t � }t| jj� �}|j� |j| j� |jd| j� x.|D ]&}dt|j � }||j |< ||j
|< q<W x�|D ]�}| j| }g }xl|D ]d}g }x6t |j j
� �D ]$\} }
|j| j|| �|j|
�f� q�W |jr�|jd|j|�f� |j|� q�W |jj|� || j||�f|j|j | < qlW |j | j |_|S )N� � )r �listr �keys�sort�remover �insert�len�
symbol2numberZ
number2symbol�sorted�arcs�items�append�
make_label�index�isfinal�states�
make_first�start) r �c�names�name�i�dfar+ �stater% �label�nextr r r
� make_grammar s.
z ParserGenerator.make_grammarc C s8 | j | }i }x$t|�D ]}| j||�}d||< qW |S )Nr )r r$ r( )r r. r0 Zrawfirstr r4 �ilabelr r r
r, 4 s
zParserGenerator.make_firstc C sb t |j�}|d j� r�||jkrZ||jkr4|j| S |jj|j| d f� ||j|< |S nbtt|d �}t|t �sxt
|��|tj ks�t
|��||j kr�|j | S |jj|d f� ||j |< |S n�|d dks�t
|��t
|�}|d j� �r ||jk� r�|j| S |jjtj|f� ||j|< |S n>tj| }||j k�r@|j | S |jj|d f� ||j |< |S d S )Nr �"�')r8 r9 )r" Zlabels�isalphar# Z symbol2labelr' �getattrr �
isinstance�int�AssertionError�tok_name�tokens�eval�keywords�NAMEr Zopmap)r r. r4 r7 Zitoken�valuer r r
r( = s<
zParserGenerator.make_labelc C s< t | jj� �}|j� x |D ]}|| jkr | j|� q W d S )N)r r r r r � calcfirst)r r/ r0 r r r
r k s
z ParserGenerator.addfirstsetsc C s
| j | }d | j|< |d }i }i }x�|jj� D ]x\}}|| j kr�|| jkrl| j| }|d kr�td| ��n| j|� | j| }|j|� |||< q0d||< |di||< q0W i } xJ|j� D ]>\}}
x4|
D ],} | | kr�td|| || | f ��|| | < q�W q�W || j|< d S )Nr zrecursion for rule %rr zArule %s is ambiguous; %s is in the first sets of %s as well as %s)r r r% r& �
ValueErrorrE �update) r r0 r2 r3 ZtotalsetZ overlapcheckr4 r5 �fsetZinverseZitsfirstZsymbolr r r
rE s s2
zParserGenerator.calcfirstc C s� i }d }x�| j tjkr�x| j tjkr.| j� qW | jtj�}| jtjd� | j� \}}| jtj� | j ||�}t
|�}| j |� t
|�}|||< |d kr
|}q
W ||fS )N�:) �typer � ENDMARKER�NEWLINEr �expectrC �OP� parse_rhs�make_dfar" � simplify_dfa) r r r r0 �a�zr2 ZoldlenZnewlenr r r
r � s"
zParserGenerator.parsec s� t |t�st�t |t�s t�� fdd�}� fdd�� t||�|�g}x�|D ]�}i }x<|jD ]2}x,|jD ]"\}} |d k rf� | |j|i �� qfW qZW xRt|j� �D ]B\}}
x,|D ]} | j|
kr�P q�W t|
|�} |j | � |j
| |� q�W qJW |S )Nc s i }� | |� |S )Nr )r3 �base)�
addclosurer r
�closure� s
z)ParserGenerator.make_dfa.<locals>.closurec sL t | t�st�| |krd S d|| < x$| jD ]\}}|d kr*� ||� q*W d S )Nr )r< �NFAStater> r% )r3 rT r4 r5 )rU r r
rU � s z,ParserGenerator.make_dfa.<locals>.addclosure) r< rW r> �DFAState�nfasetr% �
setdefaultr$ r& r' �addarc) r r- �finishrV r+ r3 r% Znfastater4 r5 rY �str )rU r
rP � s&
zParserGenerator.make_dfac
C s� t d|� |g}x�t|�D ]�\}}t d|||kr4dp6d� x^|jD ]T\}}||kr^|j|�} nt|�} |j|� |d kr�t d| � qBt d|| f � qBW qW d S )NzDump of NFA forz Statez(final)� z -> %dz %s -> %d)�print� enumerater% r) r" r' )
r r0 r- r\ Ztodor1 r3 r4 r5 �jr r r
�dump_nfa� s
zParserGenerator.dump_nfac C sl t d|� x\t|�D ]P\}}t d||jr,dp.d� x0t|jj� �D ] \}}t d||j|�f � qBW qW d S )NzDump of DFA forz Statez(final)r^ z %s -> %d)r_ r` r* r$ r% r& r) )r r0 r2 r1 r3 r4 r5 r r r
�dump_dfa� s
zParserGenerator.dump_dfac C s~ d}xt|rxd}xft |�D ]Z\}}xPt|d t|��D ]:}|| }||kr4||= x|D ]}|j||� qTW d}P q4W qW qW d S )NTFr )r` �ranger" �
unifystate)r r2 Zchangesr1 Zstate_ira Zstate_jr3 r r r
rQ � s
z ParserGenerator.simplify_dfac C s� | j � \}}| jdkr ||fS t� }t� }|j|� |j|� x6| jdkrt| j� | j � \}}|j|� |j|� q@W ||fS d S )N�|)� parse_altrD rW r[ r )r rR rS ZaaZzzr r r
rO � s
zParserGenerator.parse_rhsc C sP | j � \}}x:| jdks*| jtjtjfkrF| j � \}}|j|� |}qW ||fS )N�(�[)rh ri )�
parse_itemrD rJ r rC �STRINGr[ )r rR �br. �dr r r
rg
s
zParserGenerator.parse_altc C s� | j dkr>| j� | j� \}}| jtjd� |j|� ||fS | j� \}}| j }|dkr`||fS | j� |j|� |dkr�||fS ||fS d S )Nri �]�+�*)ro rp )rD r rO rM r rN r[ �
parse_atom)r rR rS rD r r r
rj s
zParserGenerator.parse_itemc C s� | j dkr4| j� | j� \}}| jtjd� ||fS | jtjtjfkrpt � }t � }|j
|| j � | j� ||fS | j d| j| j � d S )Nrh �)z+expected (...) or NAME or STRING, got %s/%s) rD r rO rM r rN rJ rC rk rW r[ � raise_error)r rR rS r r r
rq ( s
zParserGenerator.parse_atomc C sD | j |ks |d k r2| j|kr2| jd||| j | j� | j}| j� |S )Nzexpected %s/%s, got %s/%s)rJ rD rs r )r rJ rD r r r
rM 9 s zParserGenerator.expectc C sJ t | j�}x"|d tjtjfkr,t | j�}q W |\| _| _| _| _| _ d S )Nr )
r5 r r �COMMENT�NLrJ rD Zbegin�end�line)r �tupr r r
r A s
zParserGenerator.gettokenc G s^ |r8y || }W n& dj |gttt|�� �}Y nX t|| j| jd | jd | jf��d S )N� r r )�joinr �map�str� SyntaxErrorr rv rw )r �msg�argsr r r
rs H s zParserGenerator.raise_error)N)N)r r r r r6 r, r( r rE r rP rb rc rQ rO rg rj rq rM r rs r r r r
r
s$
. $
r c @ s e Zd Zdd� Zddd�ZdS )rW c C s
g | _ d S )N)r% )r r r r
r S s zNFAState.__init__Nc C s8 |d kst |t�st�t |t�s$t�| jj||f� d S )N)r< r| r> rW r% r' )r r5 r4 r r r
r[ V s zNFAState.addarc)N)r r r r r[ r r r r
rW Q s rW c @ s0 e Zd Zdd� Zdd� Zdd� Zdd� Zd Zd S )
rX c C sL t |t�st�t tt|��t�s$t�t |t�s2t�|| _||k| _i | _d S )N) r< �dictr> r5 �iterrW rY r* r% )r rY �finalr r r
r ] s
zDFAState.__init__c C s8 t |t�st�|| jks t�t |t�s*t�|| j|< d S )N)r< r| r> r% rX )r r5 r4 r r r
r[ e s zDFAState.addarcc C s. x(| j j� D ]\}}||kr || j |< q W d S )N)r% r& )r �old�newr4 r5 r r r
re k s zDFAState.unifystatec C sf t |t�st�| j|jkr dS t| j�t|j�kr6dS x*| jj� D ] \}}||jj|�k rBdS qBW dS )NFT)r< rX r> r* r" r% r& �get)r �otherr4 r5 r r r
�__eq__p s zDFAState.__eq__N)r r r r r[ re r� �__hash__r r r r
rX [ s
rX � Grammar.txtc C s t | �}|j� S )N)r r6 )r �pr r r
�generate_grammar� s r� N)r� ) r^ r r r ZGrammarr �objectr rW rX r� r r r r
�<module> s I
% pgen2/__pycache__/literals.cpython-36.pyc 0000644 00000002776 15053244155 0014254 0 ustar 00 3
\O � @ sP d Z ddlZddddddd d
d d d
�
Zdd� Zdd� Zdd� ZedkrLe� dS )z<Safely evaluate Python string literals without using eval().� N��� �
�
� � �'�"�\)
�a�b�f�n�r�t�vr r
r c C s� | j dd�\}}|jd�s t�tj|�}|d k r4|S |jd�r�|dd � }t|�dk rbtd| ��yt|d�}W q� tk
r� td| ��Y q�X n0yt|d�}W n tk
r� td | ��Y nX t|�S )
Nr � r �x� z!invalid hex string escape ('\%s')� � z#invalid octal string escape ('\%s')) �group�
startswith�AssertionError�simple_escapes�get�len�
ValueError�int�chr)�m�all�tail�escZhexes�i� r& �./usr/lib64/python3.6/lib2to3/pgen2/literals.py�escape s$
r( c C s� | j d�s(| j d�s(tt| d d� ���| d }| d d� |d krL|d }| j|�sptt| t|� d � ���t| �dt|� ks�t�| t|�t|� � } tjdt| �S )Nr r
r r � r z)\\(\'|\"|\\|[abfnrtv]|x.{0,2}|[0-7]{1,3}))r r �repr�endswithr �re�subr( )�s�qr& r& r' �
evalString( s ($r0 c C sD x>t d�D ]2} t| �}t|�}t|�}||kr
t| |||� q
W d S )N� )�ranger r* r0 �print)r% �cr. �er& r& r' �test2 s r6 �__main__)�__doc__r, r r( r0 r6 �__name__r& r& r& r' �<module> s
pgen2/__pycache__/parse.cpython-36.pyc 0000644 00000014271 15053244155 0013540 0 ustar 00 3
\u � @ s4 d Z ddlmZ G dd� de�ZG dd� de�ZdS )z�Parser engine for the grammar tables generated by pgen.
The grammar table must be loaded first.
See Parser/parser.c in the Python distribution for additional info on
how this parsing engine works.
� )�tokenc @ s e Zd ZdZdd� ZdS )�
ParseErrorz(Exception to signal the parser is stuck.c C s4 t j| d||||f � || _|| _|| _|| _d S )Nz!%s: type=%r, value=%r, context=%r)� Exception�__init__�msg�type�value�context)�selfr r r r � r �+/usr/lib64/python3.6/lib2to3/pgen2/parse.pyr s zParseError.__init__N)�__name__�
__module__� __qualname__�__doc__r r r r r r s r c @ sL e Zd ZdZddd�Zddd�Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )�Parsera5 Parser engine.
The proper usage sequence is:
p = Parser(grammar, [converter]) # create instance
p.setup([start]) # prepare for parsing
<for each input token>:
if p.addtoken(...): # parse a token; may raise ParseError
break
root = p.rootnode # root of abstract syntax tree
A Parser instance may be reused by calling setup() repeatedly.
A Parser instance contains state pertaining to the current token
sequence, and should not be used concurrently by different threads
to parse separate token sequences.
See driver.py for how to get input tokens by tokenizing a file or
string.
Parsing is complete when addtoken() returns True; the root of the
abstract syntax tree can then be retrieved from the rootnode
instance variable. When a syntax error occurs, addtoken() raises
the ParseError exception. There is no error recovery; the parser
cannot be used after a syntax error was reported (but it can be
reinitialized by calling setup()).
Nc C s || _ |pdd� | _dS )a� Constructor.
The grammar argument is a grammar.Grammar instance; see the
grammar module for more information.
The parser is not ready yet for parsing; you must call the
setup() method to get it started.
The optional convert argument is a function mapping concrete
syntax tree nodes to abstract syntax tree nodes. If not
given, no conversion is done and the syntax tree produced is
the concrete syntax tree. If given, it must be a function of
two arguments, the first being the grammar (a grammar.Grammar
instance), and the second being the concrete syntax tree node
to be converted. The syntax tree is converted from the bottom
up.
A concrete syntax tree node is a (type, value, context, nodes)
tuple, where type is the node type (a token or symbol number),
value is None for symbols and a string for tokens, context is
None or an opaque value used for error reporting (typically a
(lineno, offset) pair), and nodes is a list of children for
symbols, and None for tokens.
An abstract syntax tree node may be anything; this is entirely
up to the converter function.
c S s |S )Nr )�grammar�noder r r �<lambda>W s z!Parser.__init__.<locals>.<lambda>N)r �convert)r
r r r r r r 9 s zParser.__init__c C sH |dkr| j j}|ddg f}| j j| d|f}|g| _d| _t� | _dS )a� Prepare for parsing.
This *must* be called before starting to parse.
The optional argument is an alternative start symbol; it
defaults to the grammar's start symbol.
You can use a Parser instance to parse any number of programs;
each time you call setup() the parser is reset to an initial
state determined by the (implicit or explicit) start symbol.
N� )r �start�dfas�stack�rootnode�set�
used_names)r
r �newnodeZ
stackentryr r r �setupY s
z Parser.setupc C sF | j |||�}�x0| jd \}}}|\}} || }
�x|
D ]�\} } | jj| \}
}|| kr�|
dk sft�| j||| |� | }x@|| d|fgkr�| j� | js�dS | jd
\}}}|\}} q|W dS |
dkr:| jj|
}|\}}||kr:| j|
| jj|
| |� P q:W d|f|
k�r0| j� | j�s>t d|||��qt d|||��qW dS ) z<Add a token; return True iff this is the end of the program.r � r TFztoo much inputz bad inputN���r )
�classifyr r Zlabels�AssertionError�shift�popr �pushr )r
r r r �ilabel�dfa�stater Zstates�firstZarcs�i�newstate�t�vZitsdfaZ itsstatesZitsfirstr r r �addtokenq s< zParser.addtokenc C sX |t jkr0| jj|� | jjj|�}|dk r0|S | jjj|�}|dkrTtd|||��|S )z&Turn a token into a label. (Internal)Nz bad token) r �NAMEr �addr �keywords�get�tokensr )r
r r r r& r r r r! � s
zParser.classifyc C sT | j d \}}}|||df}| j| j|�}|dk r@|d j|� |||f| j d< dS )zShift a token. (Internal)r Nr r r )r r r �append) r
r r r+ r r' r( r r r r r r# � s z Parser.shiftc C sB | j d \}}}|d|g f}|||f| j d< | j j|d|f� dS )z Push a nonterminal. (Internal)r Nr r r )r r4 ) r
r Znewdfar+ r r' r( r r r r r r% � s z Parser.pushc C s` | j j� \}}}| j| j|�}|dk r\| j rL| j d \}}}|d j|� n|| _| j| j_dS )z Pop a nonterminal. (Internal)Nr r r )r r$ r r r4 r r )r
ZpopdfaZpopstateZpopnoder r' r( r r r r r$ � s z
Parser.pop)N)N) r
r r r r r r. r! r# r% r$ r r r r r s
0 r N)r � r r r �objectr r r r r �<module> s pgen2/__pycache__/__init__.cpython-36.opt-2.pyc 0000644 00000000203 15053244155 0015113 0 ustar 00 3
\� � @ s d S )N� r r r �./usr/lib64/python3.6/lib2to3/pgen2/__init__.py�<module> s pgen2/__pycache__/conv.cpython-36.opt-2.pyc 0000644 00000007120 15053244155 0014326 0 ustar 00 3
\�% � @ s. d dl Z d dlmZmZ G dd� dej�ZdS )� N)�grammar�tokenc @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� Converterc C s | j |� | j|� | j� d S )N)�parse_graminit_h�parse_graminit_c�
finish_off)�selfZ
graminit_hZ
graminit_c� r �*/usr/lib64/python3.6/lib2to3/pgen2/conv.py�run/ s
z
Converter.runc C s� y t |�}W n0 tk
r< } ztd||f � dS d }~X nX i | _i | _d}xn|D ]f}|d7 }tjd|�}| r�|j� r�td|||j� f � qT|j� \}}t |�}|| j|< || j|< qTW dS )NzCan't open %s: %sFr � z^#define\s+(\w+)\s+(\d+)$z%s(%s): can't parse %sT)
�open�OSError�printZ
symbol2numberZ
number2symbol�re�match�strip�groups�int) r �filename�f�err�lineno�line�mo�symbol�numberr r r
r 5 s&
zConverter.parse_graminit_hc ! C s� y t |�}W n0 tk
r< } ztd||f � dS d }~X nX d}|d t|� }}|d t|� }}|d t|� }}i }g }�x�|jd��rx�|jd��rLtjd|�}ttt |j
� ��\} }
} g } xRt | �D ]F}
|d t|� }}tjd|�}ttt |j
� ��\}}| j ||f� q�W |d t|� }}| || |
f< |d t|� }}q�W tjd|�}ttt |j
� ��\}}g }x^t |�D ]R}
|d t|� }}tjd |�}ttt |j
� ��\} } }
|| |
f } |j | � �q~W |j |� |d t|� }}|d t|� }}q�W || _
i }tjd
|�}t |jd��}x�t |�D ]�}|d t|� }}tjd |�}|jd �}ttt |jdd
dd���\}}}}|| }|d t|� }}tjd|�}i }t|jd��}xPt|�D ]D\}} t| �} x0t d�D ]$}| d|> @ �r�d||d | < �q�W �q�W ||f||< �q4W |d t|� }}|| _g } |d t|� }}tjd|�}t |jd��} xjt | �D ]^}|d t|� }}tjd|�}|j
� \}}t |�}|dk�r�d }nt|�}| j ||f� �qpW |d t|� }}| | _|d t|� }}|d t|� }}tjd|�}t |jd��}|d t|� }}|d t|� }}tjd|�}t |jd��} |d t|� }}tjd|�}t |jd��} | | _|d t|� }}y|d t|� }}W n tk
�r� Y nX d S )NzCan't open %s: %sFr r z static arc z)static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$z\s+{(\d+), (\d+)},$z'static state states_(\d+)\[(\d+)\] = {$z \s+{(\d+), arcs_(\d+)_(\d+)},$z static dfa dfas\[(\d+)\] = {$z0\s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$� � � � z\s+("(?:\\\d\d\d)*")},$� z!static label labels\[(\d+)\] = {$z\s+{(\d+), (0|"\w+")},$�0z
\s+(\d+),$z\s+{(\d+), labels},$z \s+(\d+)$)r
r r �next�
startswithr r �list�mapr r �range�append�states�group�eval� enumerate�ord�dfas�labels�start�
StopIteration)!r r r r r r Zallarcsr) r �n�m�kZarcs�_�i�j�s�t�stater. Zndfasr r �x�y�z�firstZ rawbitset�cZbyter/ Znlabelsr0 r r r
r T s�
"
zConverter.parse_graminit_cc C s\ i | _ i | _xJt| j�D ]<\}\}}|tjkrB|d k rB|| j |< q|d kr|| j|< qW d S )N)�keywords�tokensr, r/ r �NAME)r Zilabel�type�valuer r r
r � s zConverter.finish_offN)�__name__�
__module__� __qualname__r r r r r r r r
r $ s
&r )r Zpgen2r r ZGrammarr r r r r
�<module> s pgen2/__pycache__/grammar.cpython-36.opt-2.pyc 0000644 00000006253 15053244155 0015015 0 ustar 00 3
\� � @ st d dl Z d dlZddlmZmZ G dd� de�Zdd� ZdZi Z x.ej
� D ]"Z e rJe j � \Z
Zeee�e e
< qJW dS ) � N� )�token�tokenizec @ s< e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
S )�Grammarc C s< i | _ i | _g | _i | _dg| _i | _i | _i | _d| _d S )Nr �EMPTY� )r r ) �
symbol2number�
number2symbol�states�dfas�labels�keywords�tokens� symbol2label�start)�self� r �-/usr/lib64/python3.6/lib2to3/pgen2/grammar.py�__init__M s zGrammar.__init__c C s2 t |d�� }t| j�}tj||d� W d Q R X d S )N�wb� )�open�_make_deterministic�__dict__�pickle�dump)r �filename�f�dr r r r X s
z Grammar.dumpc C s0 t |d��}tj|�}W d Q R X | jj|� d S )N�rb)r r �loadr �update)r r r r r r r r i s z Grammar.loadc C s | j jtj|�� d S )N)r r! r �loads)r Zpklr r r r" o s z
Grammar.loadsc C sX | j � }x"dD ]}t||t| |�j� � qW | jd d � |_| jd d � |_| j|_|S )Nr r r r
r r )r r r r
r r )� __class__�setattr�getattr�copyr r
r )r �newZ dict_attrr r r r& s s z Grammar.copyc C sv ddl m } td� || j� td� || j� td� || j� td� || j� td� || j� td| j� d S ) Nr )�pprintZs2nZn2sr
r r r )r( �printr r r
r r r )r r( r r r �report� s
zGrammar.reportN) �__name__�
__module__� __qualname__r r r r" r& r* r r r r r s 6
r c C s^ t | t�r&tjtdd� | j� D ���S t | t�r>dd� | D �S t | t�rZtdd� | D ��S | S )Nc s s | ]\}}|t |�fV qd S )N)r )�.0�k�vr r r � <genexpr>� s z&_make_deterministic.<locals>.<genexpr>c S s g | ] }t |��qS r )r )r. �er r r �
<listcomp>� s z'_make_deterministic.<locals>.<listcomp>c s s | ]}t |�V qd S )N)r )r. r2 r r r r1 � s )�
isinstance�dict� collections� OrderedDict�sorted�items�list�tuple)�topr r r r � s
r a
( LPAR
) RPAR
[ LSQB
] RSQB
: COLON
, COMMA
; SEMI
+ PLUS
- MINUS
* STAR
/ SLASH
| VBAR
& AMPER
< LESS
> GREATER
= EQUAL
. DOT
% PERCENT
` BACKQUOTE
{ LBRACE
} RBRACE
@ AT
@= ATEQUAL
== EQEQUAL
!= NOTEQUAL
<> NOTEQUAL
<= LESSEQUAL
>= GREATEREQUAL
~ TILDE
^ CIRCUMFLEX
<< LEFTSHIFT
>> RIGHTSHIFT
** DOUBLESTAR
+= PLUSEQUAL
-= MINEQUAL
*= STAREQUAL
/= SLASHEQUAL
%= PERCENTEQUAL
&= AMPEREQUAL
|= VBAREQUAL
^= CIRCUMFLEXEQUAL
<<= LEFTSHIFTEQUAL
>>= RIGHTSHIFTEQUAL
**= DOUBLESTAREQUAL
// DOUBLESLASH
//= DOUBLESLASHEQUAL
-> RARROW
)r6 r � r r �objectr r Z opmap_rawZopmap�
splitlines�line�split�op�namer% r r r r �<module> s y= pgen2/__pycache__/__init__.cpython-36.pyc 0000644 00000000237 15053244155 0014162 0 ustar 00 3
\� � @ s d Z dS )zThe pgen2 package.N)�__doc__� r r �./usr/lib64/python3.6/lib2to3/pgen2/__init__.py�<module> s pgen2/__pycache__/parse.cpython-36.opt-1.pyc 0000644 00000014233 15053244155 0014475 0 ustar 00 3
\u � @ s4 d Z ddlmZ G dd� de�ZG dd� de�ZdS )z�Parser engine for the grammar tables generated by pgen.
The grammar table must be loaded first.
See Parser/parser.c in the Python distribution for additional info on
how this parsing engine works.
� )�tokenc @ s e Zd ZdZdd� ZdS )�
ParseErrorz(Exception to signal the parser is stuck.c C s4 t j| d||||f � || _|| _|| _|| _d S )Nz!%s: type=%r, value=%r, context=%r)� Exception�__init__�msg�type�value�context)�selfr r r r � r �+/usr/lib64/python3.6/lib2to3/pgen2/parse.pyr s zParseError.__init__N)�__name__�
__module__� __qualname__�__doc__r r r r r r s r c @ sL e Zd ZdZddd�Zddd�Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )�Parsera5 Parser engine.
The proper usage sequence is:
p = Parser(grammar, [converter]) # create instance
p.setup([start]) # prepare for parsing
<for each input token>:
if p.addtoken(...): # parse a token; may raise ParseError
break
root = p.rootnode # root of abstract syntax tree
A Parser instance may be reused by calling setup() repeatedly.
A Parser instance contains state pertaining to the current token
sequence, and should not be used concurrently by different threads
to parse separate token sequences.
See driver.py for how to get input tokens by tokenizing a file or
string.
Parsing is complete when addtoken() returns True; the root of the
abstract syntax tree can then be retrieved from the rootnode
instance variable. When a syntax error occurs, addtoken() raises
the ParseError exception. There is no error recovery; the parser
cannot be used after a syntax error was reported (but it can be
reinitialized by calling setup()).
Nc C s || _ |pdd� | _dS )a� Constructor.
The grammar argument is a grammar.Grammar instance; see the
grammar module for more information.
The parser is not ready yet for parsing; you must call the
setup() method to get it started.
The optional convert argument is a function mapping concrete
syntax tree nodes to abstract syntax tree nodes. If not
given, no conversion is done and the syntax tree produced is
the concrete syntax tree. If given, it must be a function of
two arguments, the first being the grammar (a grammar.Grammar
instance), and the second being the concrete syntax tree node
to be converted. The syntax tree is converted from the bottom
up.
A concrete syntax tree node is a (type, value, context, nodes)
tuple, where type is the node type (a token or symbol number),
value is None for symbols and a string for tokens, context is
None or an opaque value used for error reporting (typically a
(lineno, offset) pair), and nodes is a list of children for
symbols, and None for tokens.
An abstract syntax tree node may be anything; this is entirely
up to the converter function.
c S s |S )Nr )�grammar�noder r r �<lambda>W s z!Parser.__init__.<locals>.<lambda>N)r �convert)r
r r r r r r 9 s zParser.__init__c C sH |dkr| j j}|ddg f}| j j| d|f}|g| _d| _t� | _dS )a� Prepare for parsing.
This *must* be called before starting to parse.
The optional argument is an alternative start symbol; it
defaults to the grammar's start symbol.
You can use a Parser instance to parse any number of programs;
each time you call setup() the parser is reset to an initial
state determined by the (implicit or explicit) start symbol.
N� )r �start�dfas�stack�rootnode�set�
used_names)r
r �newnodeZ
stackentryr r r �setupY s
z Parser.setupc C s: | j |||�}�x$| jd \}}}|\}} || }
� x�|
D ]�\} } | jj| \}
}|| kr�| j||| |� | }x@|| d|fgkr�| j� | js�dS | jd
\}}}|\}} qpW dS |
dkr:| jj|
}|\}}||kr:| j|
| jj|
| |� P q:W d|f|
k�r$| j� | j�s2td|||��qtd|||��qW dS ) z<Add a token; return True iff this is the end of the program.r r TF� ztoo much inputz bad inputN���r ) �classifyr r Zlabels�shift�popr �pushr )r
r r r �ilabel�dfa�stater Zstates�firstZarcs�i�newstate�t�vZitsdfaZ itsstatesZitsfirstr r r �addtokenq s: zParser.addtokenc C sX |t jkr0| jj|� | jjj|�}|dk r0|S | jjj|�}|dkrTtd|||��|S )z&Turn a token into a label. (Internal)Nz bad token) r �NAMEr �addr �keywords�get�tokensr )r
r r r r% r r r r! � s
zParser.classifyc C sT | j d \}}}|||df}| j| j|�}|dk r@|d j|� |||f| j d< dS )zShift a token. (Internal)r Nr r r )r r r �append) r
r r r* r r& r' r r r r r r" � s z Parser.shiftc C sB | j d \}}}|d|g f}|||f| j d< | j j|d|f� dS )z Push a nonterminal. (Internal)r Nr r r )r r3 ) r
r Znewdfar* r r& r' r r r r r r$ � s z Parser.pushc C s` | j j� \}}}| j| j|�}|dk r\| j rL| j d \}}}|d j|� n|| _| j| j_dS )z Pop a nonterminal. (Internal)Nr r r )r r# r r r3 r r )r
ZpopdfaZpopstateZpopnoder r& r' r r r r r# � s z
Parser.pop)N)N) r
r r r r r r- r! r" r$ r# r r r r r s
0 r N)r � r r r �objectr r r r r �<module> s pgen2/__pycache__/tokenize.cpython-36.pyc 0000644 00000036032 15053244155 0014255 0 ustar 00 3
\NX � = @ s� d Z dZdZddlZddlZddlmZmZ ddlT ddl m
Z
d d
� e e
�D �d d d
g Z [
ye
W n ek
r~ eZ
Y nX dd� Zdd� Zdd� ZdZdZeede � ee� ZdZdZdZdZedd �Zeeeee�Zd Z ed d �ee � Z d e Z ee e �Z ed!e d" �Z ee e e�Z!d#Z"d$Z#d%Z$d&Z%d'Z&ee&d( e&d) �Z'ee&d* e&d+ �Z(ed,d-d.d/d0d1d2d3d4� Z)d5Z*ed6d7�Z+ee)e*e+�Z,ee!e,e(e�Z-ee- Z.ee&d8 ed9d� e&d: ed;d� �Z/edee'�Z0eee0e!e,e/e� Z1e2e3ej4e.e1e$e%f��\Z5Z6Z7Z8ej4e"�ej4e#�e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8e7e8ddddddddd<�4Z9i Z:xd�D ]Z;e;e:e;< �q�W i Z<xd�D ]Z;e;e<e;< �q�W d�Z=G d�d�� d�e>�Z?G d�d�� d�e>�Z@d�d�� ZAeAfd�d �ZBd�d�� ZCG d�d�� d��ZDej4d�ejE�ZFej4d�ejE�ZGd�d�� ZHd�d�� ZId�d
� ZJd�d � ZKeLd�k�r�ddlMZMeNeMjO�dk�r|eBePeMjOd �jQ� n eBeMjRjQ� dS )�a� Tokenization help for Python programs.
generate_tokens(readline) is a generator that breaks a stream of
text into Python tokens. It accepts a readline-like method which is called
repeatedly to get the next line of input (or "" for EOF). It generates
5-tuples with these members:
the token type (see token.py)
the token (a string)
the starting (row, column) indices of the token (a 2-tuple of ints)
the ending (row, column) indices of the token (a 2-tuple of ints)
the original line (string)
It is designed to match the working of the Python tokenizer exactly, except
that it produces COMMENT tokens for comments and gives type OP for all
operators
Older entry points
tokenize_loop(readline, tokeneater)
tokenize(readline, tokeneater=printtoken)
are the same, except instead of generating tokens, tokeneater is a callback
function to which the 5 fields described above are passed as 5 arguments,
each time a new token is found.zKa-Ping Yee <ping@lfw.org>z@GvR, ESR, Tim Peters, Thomas Wouters, Fred Drake, Skip Montanaro� N)�BOM_UTF8�lookup)�*� )�tokenc C s g | ]}|d dkr|�qS )r �_� )�.0�xr r �./usr/lib64/python3.6/lib2to3/pgen2/tokenize.py�
<listcomp>% s r �tokenize�generate_tokens�
untokenizec G s ddj | � d S )N�(�|�))�join)�choicesr r r �group0 s r c G s t | � d S )Nr )r )r r r r �any1 s r c G s t | � d S )N�?)r )r r r r �maybe2 s r z[ \f\t]*z #[^\r\n]*z\\\r?\nz [a-zA-Z_]\w*z0[bB]_?[01]+(?:_[01]+)*z(0[xX]_?[\da-fA-F]+(?:_[\da-fA-F]+)*[lL]?z 0[oO]?_?[0-7]+(?:_[0-7]+)*[lL]?z[1-9]\d*(?:_\d+)*[lL]?z0[lL]?z[eE][-+]?\d+(?:_\d+)*z \d+(?:_\d+)*\.(?:\d+(?:_\d+)*)?z\.\d+(?:_\d+)*z \d+(?:_\d+)*z\d+(?:_\d+)*[jJ]z[jJ]z[^'\\]*(?:\\.[^'\\]*)*'z[^"\\]*(?:\\.[^"\\]*)*"z%[^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''z%[^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""z#(?:[uUrRbBfF]|[rR][bB]|[bBuU][rR])?�'''�"""z '[^\n'\\]*(?:\\.[^\n'\\]*)*'z "[^\n"\\]*(?:\\.[^\n"\\]*)*"z\*\*=?z>>=?z<<=?z<>z!=z//=?z->z[+\-*/%&@|^=<>]=?�~z[][(){}]z\r?\nz[:;.,`@]z'[^\n'\\]*(?:\\.[^\n'\\]*)*�'z"[^\n"\\]*(?:\\.[^\n"\\]*)*�")4r r z'''z"""zr'''zr"""zu'''zu"""zb'''zb"""zf'''zf"""zur'''zur"""zbr'''zbr"""zrb'''zrb"""zR'''zR"""zU'''zU"""zB'''zB"""zF'''zF"""zuR'''zuR"""zUr'''zUr"""zUR'''zUR"""zbR'''zbR"""zBr'''zBr"""zBR'''zBR"""zrB'''zrB"""zRb'''zRb"""zRB'''zRB"""�r�R�u�U�f�F�b�B�r'''�r"""�R'''�R"""�u'''�u"""�U'''�U"""�b'''�b"""�B'''�B"""�f'''�f"""�F'''�F"""�ur'''�ur"""�Ur'''�Ur"""�uR'''�uR"""�UR'''�UR"""�br'''�br"""�Br'''�Br"""�bR'''�bR"""�BR'''�BR"""�rb'''�rb"""�Rb'''�Rb"""�rB'''�rB"""�RB'''�RB"""�r'�r"�R'�R"�u'�u"�U'�U"�b'�b"�B'�B"�f'�f"�F'�F"�ur'�ur"�Ur'�Ur"�uR'�uR"�UR'�UR"�br'�br"�Br'�Br"�bR'�bR"�BR'�BR"�rb'�rb"�Rb'�Rb"�rB'�rB"�RB'�RB"� c @ s e Zd ZdS )�
TokenErrorN)�__name__�
__module__� __qualname__r r r r rw � s rw c @ s e Zd ZdS )�StopTokenizingN)rx ry rz r r r r r{ � s r{ c C s4 |\}}|\}}t d||||t| t|�f � d S )Nz%d,%d-%d,%d: %s %s)�print�tok_name�repr) �typer Zxxx_todo_changemeZxxx_todo_changeme1�lineZsrowZscolZerowZecolr r r �
printtoken� s r� c C s( yt | |� W n tk
r" Y nX dS )a:
The tokenize() function accepts two parameters: one representing the
input stream, and one providing an output mechanism for tokenize().
The first parameter, readline, must be a callable object which provides
the same interface as the readline() method of built-in file objects.
Each call to the function should return one line of input as a string.
The second parameter, tokeneater, must also be a callable object. It is
called once for each token, with five arguments, corresponding to the
tuples generated by generate_tokens().
N)�
tokenize_loopr{ )�readline�
tokeneaterr r r r
� s
c C s xt | �D ] }||� q
W d S )N)r )r� r� Z
token_infor r r r� � s r� c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� Untokenizerc C s g | _ d| _d| _d S )Nr r )�tokens�prev_row�prev_col)�selfr r r �__init__� s zUntokenizer.__init__c C s8 |\}}|| j kst�|| j }|r4| jjd| � d S )N� )r� �AssertionErrorr� r� �append)r� �start�row�col�
col_offsetr r r �add_whitespace� s
zUntokenizer.add_whitespacec C s� xv|D ]n}t |�dkr$| j||� P |\}}}}}| j|� | jj|� |\| _| _|ttfkr| jd7 _d| _qW dj | j�S )N� r r � )
�len�compatr� r� r� r� r� �NEWLINE�NLr )r� �iterable�t�tok_typer r� �endr� r r r r � s
zUntokenizer.untokenizec C s� d}g }| j j}|\}}|ttfkr,|d7 }|ttfkr<d}x�|D ]�}|d d� \}}|ttttfkrn|d7 }|tkr�|j|� qBn>|t kr�|j
� qBn*|ttfkr�d}n|r�|r�||d � d}||� qBW d S )NFr� Tr� r ���) r� r� �NAME�NUMBERr� r� �ASYNC�AWAIT�INDENT�DEDENT�pop) r� r r� � startline�indents� toks_append�toknum�tokval�tokr r r r� � s0
zUntokenizer.compatN)rx ry rz r� r� r r� r r r r r� � s r� z&^[ \t\f]*#.*?coding[:=][ \t]*([-\w.]+)s ^[ \t\f]*(?:[#\r\n]|$)c C sH | dd� j � jdd�}|dks*|jd�r.dS |d
ks@|jd�rDdS | S )z(Imitates get_normal_name in tokenizer.c.N� r �-zutf-8zutf-8-�latin-1�
iso-8859-1� iso-latin-1�latin-1-� iso-8859-1-� iso-latin-1-)r� r� r� )r� r� r� )�lower�replace�
startswith)�orig_enc�encr r r �_get_normal_name s
r� c s� d� d}d}�fdd�}� fdd�}|� }|j t�rHd� |d d� }d
}|sT|g fS ||�}|rj||gfS tj|�s~||gfS |� }|s�||gfS ||�}|r�|||gfS |||gfS ) a
The detect_encoding() function is used to detect the encoding that should
be used to decode a Python source file. It requires one argument, readline,
in the same way as the tokenize() generator.
It will call readline a maximum of twice, and return the encoding used
(as a string) and a list of any lines (left as bytes) it has read
in.
It detects the encoding from the presence of a utf-8 bom or an encoding
cookie as specified in pep-0263. If both a bom and a cookie are present, but
disagree, a SyntaxError will be raised. If the encoding cookie is an invalid
charset, raise a SyntaxError. Note that if a utf-8 bom is found,
'utf-8-sig' is returned.
If no encoding is specified, then the default of 'utf-8' will be returned.
FNzutf-8c s" y� � S t k
r t� S X d S )N)�
StopIteration�bytesr )r� r r � read_or_stop s z%detect_encoding.<locals>.read_or_stopc s� y| j d�}W n tk
r" d S X tj|�}|s6d S t|jd��}y t|�}W n tk
rp td| ��Y nX � r�|j dkr�td��|d7 }|S )N�asciir zunknown encoding: zutf-8zencoding problem: utf-8z-sig)
�decode�UnicodeDecodeError� cookie_re�matchr� r r � LookupError� SyntaxError�name)r� � line_stringr� �encoding�codec)� bom_foundr r � find_cookie& s"
z$detect_encoding.<locals>.find_cookieT� z utf-8-sig)r� r �blank_rer� )r� r� �defaultr� r� �first�secondr )r� r� r �detect_encoding s0
r� c C s t � }|j| �S )a� Transform tokens back into Python source code.
Each element returned by the iterable must be a token sequence
with at least two elements, a token number and token value. If
only two tokens are passed, the resulting output is poor.
Round-trip invariant for full input:
Untokenized source will match input source exactly
Round-trip invariant for limited intput:
# Output text will tokenize the back to the input
t1 = [tok[:2] for tok in generate_tokens(f.readline)]
newcode = untokenize(t1)
readline = iter(newcode.splitlines(1)).next
t2 = [tok[:2] for tokin generate_tokens(readline)]
assert t1 == t2
)r� r )r� �utr r r r T s c ! c s� d } }}t jd d }}d \}}d}dg} d}
d} d} d}
�xy
| � }W n tk
rd d}Y nX |d }dt|� }}|�rF|s�td|��|j|�}|r�|jd� }}t||d|� |||f|| fV d!\}}d}nd|�r0|d"d� d
k�r0|d#d� d k�r0t|| ||t|�f|fV d}d}qBn|| }|| }qB�nF|dk�rt| �rt|�s`P d}xf||k �r�|| d
k�r�|d }n6|| dk�r�|t d t }n|| dk�r�d}nP |d }�qfW ||k�r�P |
�r�|
V d}
|| dk�r�|| dk�rh||d� j
d�}|t|� }t |||f||t|� f|fV t ||d� ||f|t|�f|fV qBt t f|| dk ||d� ||f|t|�f|fV qB|| d$ k�r�| j
|� t|d|� |df||f|fV xt|| d% k �rJ|| k�rtdd|||f��| dd&� } | �r.| | d' k�r.d} d}
d} td||f||f|fV �q�W | �r�|
�r�| | d( k�r�d} d}
d} n|�s�td|df��d}�x�||k �rJtj||�}|�r |jd�\}}||f||f| }}}|||� || } } | |k�s| dk�r| dk�rt| |||fV �qF| dk�rft} |dk�r8t } n
| �rBd}
|
�rR|
V d}
| | |||fV �qF| dk�r�| jd� �s�t�|
�r�|
V d}
t | |||fV �qF| tk�r$t| }|j||�}|�r|jd�}|||� } |
�r�|
V d}
t| |||f|fV n||f}||d� }|}P �qF| tk�sR| dd � tk�sR| dd � tk�r�| d) dk�r�||f}t| �p�t| d �p�t| d }||d� d }}|}P n |
�r�|
V d}
t| |||fV �qF| |k�r�| d*k�r| �r| dk�r�tnt| |||fV �q�t | |||f} | dk�r.|
�r.| }
�q�| dk�r�|
�r�|
d t k�r�|
d dk�r�d} | d+ } t|
d |
d |
d |
d fV d}
|
�r�|
V d}
| V nz| d k�r�|
�r�|
V d}
t | |||f|fV d}nF| d k�r�|d }n| d k�r�|d }|
�r |
V d}
t | |||fV n(t|| ||f||d f|fV |d }�q�W qBW |
�r`|
V d}
x.| dd� D ] } td|df|dfdfV �qnW t d|df|dfdfV dS ),aT
The generate_tokens() generator requires one argument, readline, which
must be a callable object which provides the same interface as the
readline() method of built-in file objects. Each call to the function
should return one line of input as a string. Alternately, readline
can be a callable function terminating with StopIteration:
readline = open(myfile).next # Example of alternate readline
The generator produces 5-tuples with these members: the token type; the
token string; a 2-tuple (srow, scol) of ints specifying the row and
column where the token begins in the source; a 2-tuple (erow, ecol) of
ints specifying the row and column where the token ends in the source;
and the line on which the token was found. The line passed is the
logical line; continuation lines are included.
r r �
0123456789r� NFr zEOF in multi-line stringr� z\
r� z\
r� � � z#
�#z
z3unindent does not match any outer indentation levelz
<tokenize>zEOF in multi-line statement�.T�
�async�await�def� �\z([{z)]})r� r )r� r ������r� r� r� r� r� r� )r� r� r� ) �stringZ
ascii_lettersr� r� rw r� r� �STRING�
ERRORTOKEN�tabsize�rstrip�COMMENTr� r� r� �IndentationErrorr� �
pseudoprog�spanr� r� �endswithr� �
triple_quoted�endprogs�
single_quotedr� r� r� �OP� ENDMARKER)!r� �lnum�parenlev� continuedZ namechars�numchars�contstr�needcont�contliner� �stashed� async_def�async_def_indent� async_def_nlr� �pos�max�strstart�endprog�endmatchr� �column�
comment_token�nl_pos� pseudomatchr� �spos�eposr �initial�newliner� �indentr r r r i sr
*
�__main__)*r r r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM )*r r rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru )S�__doc__�
__author__� __credits__r� �re�codecsr r Zlib2to3.pgen2.tokenr� r �dir�__all__r� � NameError�strr r r �
Whitespace�Comment�Ignore�Name� Binnumber� Hexnumber� Octnumber� Decnumber� Intnumber�Exponent�
Pointfloat�Expfloat� Floatnumber�
Imagnumber�Number�Single�Double�Single3�Double3Z
_litprefix�Triple�String�Operator�Bracket�Special�Funny�
PlainToken�Token�ContStr� PseudoExtras� PseudoToken�list�map�compileZ tokenprogr� Z single3progZ double3progr� r� r� r� r� � Exceptionrw r{ r� r
r� r� �ASCIIr� r� r� r� r r rx �sysr� �argv�openr� �stdinr r r r �<module> s�
8 I c
pgen2/__pycache__/pgen.cpython-36.opt-1.pyc 0000644 00000022165 15053244155 0014317 0 ustar 00 3
\�5 � @ sd d dl mZmZmZ G dd� dej�ZG dd� de�ZG dd� de�ZG dd � d e�Z dd d �Z
d
S )� )�grammar�token�tokenizec @ s e Zd ZdS )� PgenGrammarN)�__name__�
__module__� __qualname__� r r �*/usr/lib64/python3.6/lib2to3/pgen2/pgen.pyr s r c @ s� e Zd Zd&dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd'd d!�Zd"d#� Zd$d%� ZdS )(�ParserGeneratorNc C sl d }|d krt |�}|j}|| _|| _tj|j�| _| j� | j � \| _
| _ |d k rZ|� i | _ | j
� d S )N)�open�close�filename�streamr �generate_tokens�readline� generator�gettoken�parse�dfas� startsymbol�first� addfirstsets)�selfr r Z close_streamr r r
�__init__ s zParserGenerator.__init__c C s* t � }t| jj� �}|j� |j| j� |jd| j� x.|D ]&}dt|j � }||j |< ||j
|< q<W x�|D ]�}| j| }g }xl|D ]d}g }x6t |j j
� �D ]$\} }
|j| j|| �|j|
�f� q�W |jr�|jd|j|�f� |j|� q�W |jj|� || j||�f|j|j | < qlW |j | j |_|S )N� � )r �listr �keys�sort�remover �insert�len�
symbol2numberZ
number2symbol�sorted�arcs�items�append�
make_label�index�isfinal�states�
make_first�start) r �c�names�name�i�dfar+ �stater% �label�nextr r r
� make_grammar s.
z ParserGenerator.make_grammarc C s8 | j | }i }x$t|�D ]}| j||�}d||< qW |S )Nr )r r$ r( )r r. r0 Zrawfirstr r4 �ilabelr r r
r, 4 s
zParserGenerator.make_firstc C s& t |j�}|d j� r�||jkrZ||jkr4|j| S |jj|j| d f� ||j|< |S n>tt|d �}||jkrz|j| S |jj|d f� ||j|< |S n�t |�}|d j� r�||j
kr�|j
| S |jjtj |f� ||j
|< |S n>t j
| }||jk�r|j| S |jj|d f� ||j|< |S d S )Nr )r" Zlabels�isalphar# Z symbol2labelr' �getattrr �tokens�eval�keywords�NAMEr Zopmap)r r. r4 r7 Zitoken�valuer r r
r( = s6
zParserGenerator.make_labelc C s< t | jj� �}|j� x |D ]}|| jkr | j|� q W d S )N)r r r r r � calcfirst)r r/ r0 r r r
r k s
z ParserGenerator.addfirstsetsc C s
| j | }d | j|< |d }i }i }x�|jj� D ]x\}}|| j kr�|| jkrl| j| }|d kr�td| ��n| j|� | j| }|j|� |||< q0d||< |di||< q0W i } xJ|j� D ]>\}}
x4|
D ],} | | kr�td|| || | f ��|| | < q�W q�W || j|< d S )Nr zrecursion for rule %rr zArule %s is ambiguous; %s is in the first sets of %s as well as %s)r r r% r& �
ValueErrorr? �update) r r0 r2 r3 ZtotalsetZ overlapcheckr4 r5 �fsetZinverseZitsfirstZsymbolr r r
r? s s2
zParserGenerator.calcfirstc C s� i }d }x�| j tjkr�x| j tjkr.| j� qW | jtj�}| jtjd� | j� \}}| jtj� | j ||�}t
|�}| j |� t
|�}|||< |d kr
|}q
W ||fS )N�:) �typer � ENDMARKER�NEWLINEr �expectr= �OP� parse_rhs�make_dfar" � simplify_dfa) r r r r0 �a�zr2 ZoldlenZnewlenr r r
r � s"
zParserGenerator.parsec s� � fdd�}� fdd�� t ||�|�g}x�|D ]�}i }x<|jD ]2}x,|jD ]"\}} |d k rJ� | |j|i �� qJW q>W xRt|j� �D ]B\}}
x,|D ]} | j|
kr�P q�W t |
|�} |j| � |j| |� q�W q.W |S )Nc s i }� | |� |S )Nr )r3 �base)�
addclosurer r
�closure� s
z)ParserGenerator.make_dfa.<locals>.closurec s> | |kr d S d|| < x$| j D ]\}}|d kr � ||� q W d S )Nr )r% )r3 rN r4 r5 )rO r r
rO � s z,ParserGenerator.make_dfa.<locals>.addclosure)�DFAState�nfasetr% �
setdefaultr$ r& r' �addarc) r r- �finishrP r+ r3 r% Znfastater4 r5 rR �str )rO r
rJ � s"
zParserGenerator.make_dfac
C s� t d|� |g}x�t|�D ]�\}}t d|||kr4dp6d� x^|jD ]T\}}||kr^|j|�} nt|�} |j|� |d kr�t d| � qBt d|| f � qBW qW d S )NzDump of NFA forz Statez(final)� z -> %dz %s -> %d)�print� enumerater% r) r" r' )
r r0 r- rU Ztodor1 r3 r4 r5 �jr r r
�dump_nfa� s
zParserGenerator.dump_nfac C sl t d|� x\t|�D ]P\}}t d||jr,dp.d� x0t|jj� �D ] \}}t d||j|�f � qBW qW d S )NzDump of DFA forz Statez(final)rW z %s -> %d)rX rY r* r$ r% r& r) )r r0 r2 r1 r3 r4 r5 r r r
�dump_dfa� s
zParserGenerator.dump_dfac C s~ d}xt|rxd}xft |�D ]Z\}}xPt|d t|��D ]:}|| }||kr4||= x|D ]}|j||� qTW d}P q4W qW qW d S )NTFr )rY �ranger" �
unifystate)r r2 Zchangesr1 Zstate_irZ Zstate_jr3 r r r
rK � s
z ParserGenerator.simplify_dfac C s� | j � \}}| jdkr ||fS t� }t� }|j|� |j|� x6| jdkrt| j� | j � \}}|j|� |j|� q@W ||fS d S )N�|)� parse_altr> �NFAStaterT r )r rL rM ZaaZzzr r r
rI � s
zParserGenerator.parse_rhsc C sP | j � \}}x:| jdks*| jtjtjfkrF| j � \}}|j|� |}qW ||fS )N�(�[)rb rc )�
parse_itemr> rD r r= �STRINGrT )r rL �br. �dr r r
r`
s
zParserGenerator.parse_altc C s� | j dkr>| j� | j� \}}| jtjd� |j|� ||fS | j� \}}| j }|dkr`||fS | j� |j|� |dkr�||fS ||fS d S )Nrc �]�+�*)ri rj )r> r rI rG r rH rT �
parse_atom)r rL rM r> r r r
rd s
zParserGenerator.parse_itemc C s� | j dkr4| j� | j� \}}| jtjd� ||fS | jtjtjfkrpt � }t � }|j
|| j � | j� ||fS | j d| j| j � d S )Nrb �)z+expected (...) or NAME or STRING, got %s/%s) r> r rI rG r rH rD r= re ra rT � raise_error)r rL rM r r r
rk ( s
zParserGenerator.parse_atomc C sD | j |ks |d k r2| j|kr2| jd||| j | j� | j}| j� |S )Nzexpected %s/%s, got %s/%s)rD r> rm r )r rD r> r r r
rG 9 s zParserGenerator.expectc C sJ t | j�}x"|d tjtjfkr,t | j�}q W |\| _| _| _| _| _ d S )Nr )
r5 r r �COMMENT�NLrD r> Zbegin�end�line)r �tupr r r
r A s
zParserGenerator.gettokenc G s^ |r8y || }W n& dj |gttt|�� �}Y nX t|| j| jd | jd | jf��d S )N� r r )�joinr �map�str� SyntaxErrorr rp rq )r �msg�argsr r r
rm H s zParserGenerator.raise_error)N)N)r r r r r6 r, r( r r? r rJ r[ r\ rK rI r` rd rk rG r rm r r r r
r
s$
. $
r c @ s e Zd Zdd� Zddd�ZdS )ra c C s
g | _ d S )N)r% )r r r r
r S s zNFAState.__init__Nc C s | j j||f� d S )N)r% r' )r r5 r4 r r r
rT V s zNFAState.addarc)N)r r r r rT r r r r
ra Q s ra c @ s0 e Zd Zdd� Zdd� Zdd� Zdd� Zd Zd S )
rQ c C s || _ ||k| _i | _d S )N)rR r* r% )r rR �finalr r r
r ] s
zDFAState.__init__c C s || j |< d S )N)r% )r r5 r4 r r r
rT e s zDFAState.addarcc C s. x(| j j� D ]\}}||kr || j |< q W d S )N)r% r& )r �old�newr4 r5 r r r
r^ k s zDFAState.unifystatec C sX | j |j krdS t| j�t|j�kr(dS x*| jj� D ] \}}||jj|�k r4dS q4W dS )NFT)r* r" r% r& �get)r �otherr4 r5 r r r
�__eq__p s zDFAState.__eq__N)r r r r rT r^ r �__hash__r r r r
rQ [ s
rQ � Grammar.txtc C s t | �}|j� S )N)r r6 )r �pr r r
�generate_grammar� s r� N)r� ) rW r r r ZGrammarr �objectr ra rQ r� r r r r
�<module> s I
% pgen2/__pycache__/driver.cpython-36.opt-1.pyc 0000644 00000011730 15053244155 0014655 0 ustar 00 3
\� � @ s� d Z dZddgZddlZddlZddlZddlZddlZddlZddl m
Z
m Z m Z m
Z
mZ G dd� de�Zd d
� Zddd�Zdd� Zdd� Zdd� Zedkr�ejee� �� dS )zZParser driver.
This provides a high-level interface to parse a file into a syntax tree.
z#Guido van Rossum <guido@python.org>�Driver� load_grammar� N� )�grammar�parse�token�tokenize�pgenc @ sH e Zd Zddd�Zddd�Zddd�Zdd d
�Zdd d �Zdd
d�ZdS )r Nc C s& || _ |d krtj� }|| _|| _d S )N)r �logging� getLogger�logger�convert)�selfr r
r � r �,/usr/lib64/python3.6/lib2to3/pgen2/driver.py�__init__ s
zDriver.__init__Fc C sv t j| j| j�}|j� d}d}d } } } } }
d} �x4|D �]} | \}}}} }
|||fkr�|\}
}||
k r�| d|
| 7 } |
}d}||k r�| |
||� 7 } |}|tjtjfkr�| |7 } | \}}|jd�r@|d7 }d}q@|t j
kr�tj | }|�r| j j
dt j| || � |j||| |f��r6|�r4| j j
d� P d} | \}}|jd�r@|d7 }d}q@W t jd||| |f��|jS ) z4Parse a series of tokens and return the syntax tree.r r N� �
z%s %r (prefix=%r)zStop.zincomplete input)r ZParserr r
Zsetupr �COMMENT�NL�endswithr �OPZopmapr �debug�tok_nameZaddtokenZ
ParseErrorZrootnode)r �tokensr �p�lineno�column�type�value�start�endZ line_text�prefixZ quintupleZs_linenoZs_columnr r r � parse_tokens' sR
zDriver.parse_tokensc C s t j|j�}| j||�S )z*Parse a stream and return the syntax tree.)r �generate_tokens�readliner# )r �streamr r r r r �parse_stream_rawW s zDriver.parse_stream_rawc C s | j ||�S )z*Parse a stream and return the syntax tree.)r' )r r& r r r r � parse_stream\ s zDriver.parse_streamc
C s* t j|d|�}z | j||�S |j� X dS )z(Parse a file and return the syntax tree.�rN)�codecs�openr( �close)r �filename�encodingr r& r r r �
parse_file` s zDriver.parse_filec C s t jtj|�j�}| j||�S )z*Parse a string and return the syntax tree.)r r$ �io�StringIOr% r# )r �textr r r r r � parse_stringh s zDriver.parse_string)NN)F)F)F)NF)F) �__name__�
__module__� __qualname__r r# r' r( r/ r3 r r r r r s
0
c C s: t jj| �\}}|dkr d}|| djtttj�� d S )Nz.txtr �.z.pickle)�os�path�splitext�join�map�str�sys� version_info)�gt�head�tailr r r �_generate_pickle_namen s rC � Grammar.txtTFc C s� |dkrt j� }|dkr t| �n|}|s4t|| � r�|jd| � tj| �}|r�|jd|� y|j|� W q� tk
r� } z|jd|� W Y dd}~X q�X nt j
� }|j |� |S )z'Load the grammar (maybe from a pickle).Nz!Generating grammar tables from %sz Writing grammar tables to %szWriting failed: %s) r
r rC �_newer�infor Zgenerate_grammar�dump�OSErrorr �Grammar�load)r@ Zgp�save�forcer �g�er r r r u s
c C s8 t jj| �sdS t jj|�s dS t jj| �t jj|�kS )z0Inquire whether file a was written since file b.FT)r8 r9 �exists�getmtime)�a�br r r rE � s
rE c C sF t jj|�rt|�S tt jj|��}tj| |�}tj � }|j
|� |S )a� Normally, loads a pickled grammar by doing
pkgutil.get_data(package, pickled_grammar)
where *pickled_grammar* is computed from *grammar_source* by adding the
Python version and using a ``.pickle`` extension.
However, if *grammar_source* is an extant file, load_grammar(grammar_source)
is called instead. This facilitates using a packaged grammar file when needed
but preserves load_grammar's automatic regeneration behavior when possible.
) r8 r9 �isfiler rC �basename�pkgutil�get_datar rI �loads)�packageZgrammar_sourceZ pickled_name�datarM r r r �load_packaged_grammar� s
rZ c G sF | st jdd� } tjtjt jdd� x| D ]}t|ddd� q,W dS )z�Main program, when run as a script: produce grammar pickle files.
Calls load_grammar for each argument, a path to a grammar text file.
r Nz %(message)s)�levelr& �formatT)rK rL )r> �argvr
Z basicConfig�INFO�stdoutr )�argsr@ r r r �main� s
ra �__main__)rD NTFN)�__doc__�
__author__�__all__r* r0 r8 r
rU r> r r r r r r �objectr rC r rE rZ ra r4 �exit�intr r r r �<module> s$ P
pgen2/__pycache__/token.cpython-36.pyc 0000644 00000003474 15053244155 0013551 0 ustar 00 3
\ � @ sP d Z dZdZdZdZdZdZdZdZd Z d
Z
d Z d Z d
Z
dZdZdZdZdZdZdZdZdZdZdZdZdZdZd Z d Z d Z d Z d Z d!Z!d"Z"d#Z#d$Z$d%Z%d&Z&d'Z'd(Z(d)Z)d*Z*d+Z+d,Z,d-Z-d.Z.d/Z/d0Z0d1Z1d2Z2d3Z3d4Z4d5Z5d6Z6d7Z7d8Z8d9Z9d:Z:d;Z;d<Z<d=Z=i Z>x6e?e@� jA� �D ]$\ZBZCeDeC�eDd�k�r eBe>eC< �q W d>d?� ZEd@dA� ZFdBdC� ZGdDS )Ez!Token constants (from "token.h").� � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; � c C s | t k S )N)� NT_OFFSET)�x� r@ �+/usr/lib64/python3.6/lib2to3/pgen2/token.py�
ISTERMINALN s rB c C s | t kS )N)r> )r? r@ r@ rA �
ISNONTERMINALQ s rC c C s | t kS )N)� ENDMARKER)r? r@ r@ rA �ISEOFT s rE N)H�__doc__rD �NAME�NUMBER�STRING�NEWLINE�INDENT�DEDENT�LPAR�RPAR�LSQB�RSQB�COLON�COMMA�SEMI�PLUS�MINUS�STAR�SLASH�VBAR�AMPER�LESS�GREATER�EQUAL�DOT�PERCENTZ BACKQUOTE�LBRACE�RBRACE�EQEQUAL�NOTEQUAL� LESSEQUAL� GREATEREQUAL�TILDE�
CIRCUMFLEX� LEFTSHIFT�
RIGHTSHIFT�
DOUBLESTAR� PLUSEQUAL�MINEQUAL� STAREQUAL�
SLASHEQUAL� PERCENTEQUAL�
AMPEREQUAL� VBAREQUAL�CIRCUMFLEXEQUAL�LEFTSHIFTEQUAL�RIGHTSHIFTEQUAL�DOUBLESTAREQUAL� DOUBLESLASH�DOUBLESLASHEQUAL�AT�ATEQUAL�OP�COMMENT�NL�RARROW�AWAIT�ASYNC�
ERRORTOKEN�N_TOKENSr> �tok_name�list�globals�items�_nameZ_value�typerB rC rE r@ r@ r@ rA �<module> s� pgen2/__pycache__/literals.cpython-36.opt-2.pyc 0000644 00000002365 15053244155 0015206 0 ustar 00 3
\O � @ sL d dl Z dddddddd d
d d �
Zd
d� Zdd� Zdd� ZedkrHe� dS )� N��� �
�
� � �'�"�\)
�a�b�f�n�r�t�vr r
r c C s� | j dd�\}}tj|�}|d k r&|S |jd�r�|dd � }t|�dk rTtd| ��yt|d�}W q� tk
r� td| ��Y q�X n0yt|d�}W n tk
r� td| ��Y nX t|�S ) Nr � �x� z!invalid hex string escape ('\%s')� � z#invalid octal string escape ('\%s'))�group�simple_escapes�get�
startswith�len�
ValueError�int�chr)�m�all�tail�escZhexes�i� r% �./usr/lib64/python3.6/lib2to3/pgen2/literals.py�escape s"
r' c C sH | d }| d d� |d kr$|d }| t |�t |� � } tjdt| �S )Nr � z)\\(\'|\"|\\|[abfnrtv]|x.{0,2}|[0-7]{1,3}))r �re�subr' )�s�qr% r% r& �
evalString( s
r- c C sD x>t d�D ]2} t| �}t|�}t|�}||kr
t| |||� q
W d S )N� )�ranger �reprr- �print)r$ �cr+ �er% r% r& �test2 s r4 �__main__)r) r r' r- r4 �__name__r% r% r% r& �<module> s
pgen2/__pycache__/driver.cpython-36.opt-2.pyc 0000644 00000007703 15053244155 0014663 0 ustar 00 3
\� � @ s� d Z ddgZddlZddlZddlZddlZddlZddlZddlm Z m
Z
m Z m Z m
Z
G dd� de�Zdd � Zdd
d�Zdd� Zdd� Zdd� Zedkr�ejee� �� dS )z#Guido van Rossum <guido@python.org>�Driver� load_grammar� N� )�grammar�parse�token�tokenize�pgenc @ sH e Zd Zddd�Zddd�Zddd�Zdd d
�Zdd d �Zdd
d�ZdS )r Nc C s& || _ |d krtj� }|| _|| _d S )N)r �logging� getLogger�logger�convert)�selfr r
r � r �,/usr/lib64/python3.6/lib2to3/pgen2/driver.py�__init__ s
zDriver.__init__Fc C sv t j| j| j�}|j� d}d}d } } } } }
d} �x4|D �]} | \}}}} }
|||fkr�|\}
}||
k r�| d|
| 7 } |
}d}||k r�| |
||� 7 } |}|tjtjfkr�| |7 } | \}}|jd�r@|d7 }d}q@|t j
kr�tj | }|�r| j j
dt j| || � |j||| |f��r6|�r4| j j
d� P d} | \}}|jd�r@|d7 }d}q@W t jd||| |f��|jS )Nr r � �
z%s %r (prefix=%r)zStop.zincomplete input)r ZParserr r
Zsetupr �COMMENT�NL�endswithr �OPZopmapr �debug�tok_nameZaddtokenZ
ParseErrorZrootnode)r �tokensr �p�lineno�column�type�value�start�endZ line_text�prefixZ quintupleZs_linenoZs_columnr r r � parse_tokens' sR
zDriver.parse_tokensc C s t j|j�}| j||�S )N)r �generate_tokens�readliner# )r �streamr r r r r �parse_stream_rawW s zDriver.parse_stream_rawc C s | j ||�S )N)r' )r r& r r r r � parse_stream\ s zDriver.parse_streamc
C s* t j|d|�}z | j||�S |j� X d S )N�r)�codecs�openr( �close)r �filename�encodingr r& r r r �
parse_file` s zDriver.parse_filec C s t jtj|�j�}| j||�S )N)r r$ �io�StringIOr% r# )r �textr r r r r � parse_stringh s zDriver.parse_string)NN)F)F)F)NF)F) �__name__�
__module__� __qualname__r r# r' r( r/ r3 r r r r r s
0
c C s: t jj| �\}}|dkr d}|| djtttj�� d S )Nz.txtr �.z.pickle)�os�path�splitext�join�map�str�sys� version_info)�gt�head�tailr r r �_generate_pickle_namen s rC � Grammar.txtTFc C s� |d krt j� }|d kr t| �n|}|s4t|| � r�|jd| � tj| �}|r�|jd|� y|j|� W q� tk
r� } z|jd|� W Y d d }~X q�X nt j
� }|j |� |S )Nz!Generating grammar tables from %sz Writing grammar tables to %szWriting failed: %s) r
r rC �_newer�infor Zgenerate_grammar�dump�OSErrorr �Grammar�load)r@ Zgp�save�forcer �g�er r r r u s
c C s8 t jj| �sdS t jj|�s dS t jj| �t jj|�kS )NFT)r8 r9 �exists�getmtime)�a�br r r rE � s
rE c C sF t jj|�rt|�S tt jj|��}tj| |�}tj � }|j
|� |S )N) r8 r9 �isfiler rC �basename�pkgutil�get_datar rI �loads)�packageZgrammar_sourceZ pickled_name�datarM r r r �load_packaged_grammar� s
rZ c G sF | st jdd � } tjtjt jdd� x| D ]}t|ddd� q,W dS )Nr z %(message)s)�levelr& �formatT)rK rL )r> �argvr
Z basicConfig�INFO�stdoutr )�argsr@ r r r �main� s
ra �__main__)rD NTFN)�
__author__�__all__r* r0 r8 r
rU r> r r r r r r �objectr rC r rE rZ ra r4 �exit�intr r r r �<module> s" P
pgen2/__pycache__/token.cpython-36.opt-1.pyc 0000644 00000003474 15053244155 0014510 0 ustar 00 3
\ � @ sP d Z dZdZdZdZdZdZdZdZd Z d
Z
d Z d Z d
Z
dZdZdZdZdZdZdZdZdZdZdZdZdZdZd Z d Z d Z d Z d Z d!Z!d"Z"d#Z#d$Z$d%Z%d&Z&d'Z'd(Z(d)Z)d*Z*d+Z+d,Z,d-Z-d.Z.d/Z/d0Z0d1Z1d2Z2d3Z3d4Z4d5Z5d6Z6d7Z7d8Z8d9Z9d:Z:d;Z;d<Z<d=Z=i Z>x6e?e@� jA� �D ]$\ZBZCeDeC�eDd�k�r eBe>eC< �q W d>d?� ZEd@dA� ZFdBdC� ZGdDS )Ez!Token constants (from "token.h").� � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; � c C s | t k S )N)� NT_OFFSET)�x� r@ �+/usr/lib64/python3.6/lib2to3/pgen2/token.py�
ISTERMINALN s rB c C s | t kS )N)r> )r? r@ r@ rA �
ISNONTERMINALQ s rC c C s | t kS )N)� ENDMARKER)r? r@ r@ rA �ISEOFT s rE N)H�__doc__rD �NAME�NUMBER�STRING�NEWLINE�INDENT�DEDENT�LPAR�RPAR�LSQB�RSQB�COLON�COMMA�SEMI�PLUS�MINUS�STAR�SLASH�VBAR�AMPER�LESS�GREATER�EQUAL�DOT�PERCENTZ BACKQUOTE�LBRACE�RBRACE�EQEQUAL�NOTEQUAL� LESSEQUAL� GREATEREQUAL�TILDE�
CIRCUMFLEX� LEFTSHIFT�
RIGHTSHIFT�
DOUBLESTAR� PLUSEQUAL�MINEQUAL� STAREQUAL�
SLASHEQUAL� PERCENTEQUAL�
AMPEREQUAL� VBAREQUAL�CIRCUMFLEXEQUAL�LEFTSHIFTEQUAL�RIGHTSHIFTEQUAL�DOUBLESTAREQUAL� DOUBLESLASH�DOUBLESLASHEQUAL�AT�ATEQUAL�OP�COMMENT�NL�RARROW�AWAIT�ASYNC�
ERRORTOKEN�N_TOKENSr> �tok_name�list�globals�items�_nameZ_value�typerB rC rE r@ r@ r@ rA �<module> s� pgen2/__pycache__/grammar.cpython-36.pyc 0000644 00000015621 15053244155 0014054 0 ustar 00 3
\� � @ sx d Z ddlZddlZddlmZmZ G dd� de�Zdd� Zd Z i Z
x.e j � D ]"Z e rNe j
� \ZZeee�e
e< qNW dS )
a� This module defines the data structures used to represent a grammar.
These are a bit arcane because they are derived from the data
structures used by Python's 'pgen' parser generator.
There's also a table here mapping operators to their names in the
token module; the Python tokenize module reports all operators as the
fallback token code OP, but the parser needs the actual token code.
� N� )�token�tokenizec @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )�Grammara� Pgen parsing tables conversion class.
Once initialized, this class supplies the grammar tables for the
parsing engine implemented by parse.py. The parsing engine
accesses the instance variables directly. The class here does not
provide initialization of the tables; several subclasses exist to
do this (see the conv and pgen modules).
The load() method reads the tables from a pickle file, which is
much faster than the other ways offered by subclasses. The pickle
file is written by calling dump() (after loading the grammar
tables using a subclass). The report() method prints a readable
representation of the tables to stdout, for debugging.
The instance variables are as follows:
symbol2number -- a dict mapping symbol names to numbers. Symbol
numbers are always 256 or higher, to distinguish
them from token numbers, which are between 0 and
255 (inclusive).
number2symbol -- a dict mapping numbers to symbol names;
these two are each other's inverse.
states -- a list of DFAs, where each DFA is a list of
states, each state is a list of arcs, and each
arc is a (i, j) pair where i is a label and j is
a state number. The DFA number is the index into
this list. (This name is slightly confusing.)
Final states are represented by a special arc of
the form (0, j) where j is its own state number.
dfas -- a dict mapping symbol numbers to (DFA, first)
pairs, where DFA is an item from the states list
above, and first is a set of tokens that can
begin this grammar rule (represented by a dict
whose values are always 1).
labels -- a list of (x, y) pairs where x is either a token
number or a symbol number, and y is either None
or a string; the strings are keywords. The label
number is the index in this list; label numbers
are used to mark state transitions (arcs) in the
DFAs.
start -- the number of the grammar's start symbol.
keywords -- a dict mapping keyword strings to arc labels.
tokens -- a dict mapping token numbers to arc labels.
c C s< i | _ i | _g | _i | _dg| _i | _i | _i | _d| _d S )Nr �EMPTY� )r r ) �
symbol2number�
number2symbol�states�dfas�labels�keywords�tokens� symbol2label�start)�self� r �-/usr/lib64/python3.6/lib2to3/pgen2/grammar.py�__init__M s zGrammar.__init__c C s2 t |d�� }t| j�}tj||d� W dQ R X dS )a� Dump the grammar tables to a pickle file.
dump() recursively changes all dict to OrderedDict, so the pickled file
is not exactly the same as what was passed in to dump(). load() uses the
pickled file to create the tables, but only changes OrderedDict to dict
at the top level; it does not recursively change OrderedDict to dict.
So, the loaded tables are different from the original tables that were
passed to load() in that some of the OrderedDict (from the pickled file)
are not changed back to dict. For parsing, this has no effect on
performance because OrderedDict uses dict's __getitem__ with nothing in
between.
�wb� N)�open�_make_deterministic�__dict__�pickle�dump)r �filename�f�dr r r r X s
z Grammar.dumpc C s0 t |d��}tj|�}W dQ R X | jj|� dS )z+Load the grammar tables from a pickle file.�rbN)r r �loadr �update)r r r r r r r r i s z Grammar.loadc C s | j jtj|�� dS )z3Load the grammar tables from a pickle bytes object.N)r r! r �loads)r Zpklr r r r" o s z
Grammar.loadsc C sX | j � }x"dD ]}t||t| |�j� � qW | jdd� |_| jdd� |_| j|_|S ) z#
Copy the grammar.
r r r r
r r N)r r r r
r r )� __class__�setattr�getattr�copyr r
r )r �newZ dict_attrr r r r& s s z Grammar.copyc C sv ddl m } td� || j� td� || j� td� || j� td� || j� td� || j� td| j� d S )
z:Dump the grammar tables to standard output, for debugging.r )�pprintZs2nZn2sr
r r r N)r( �printr r r
r r r )r r( r r r �report� s
zGrammar.reportN)
�__name__�
__module__� __qualname__�__doc__r r r r" r& r* r r r r r s 4
r c C s^ t | t�r&tjtdd� | j� D ���S t | t�r>dd� | D �S t | t�rZtdd� | D ��S | S )Nc s s | ]\}}|t |�fV qd S )N)r )�.0�k�vr r r � <genexpr>� s z&_make_deterministic.<locals>.<genexpr>c S s g | ] }t |��qS r )r )r/ �er r r �
<listcomp>� s z'_make_deterministic.<locals>.<listcomp>c s s | ]}t |�V qd S )N)r )r/ r3 r r r r2 � s )�
isinstance�dict� collections� OrderedDict�sorted�items�list�tuple)�topr r r r � s
r a
( LPAR
) RPAR
[ LSQB
] RSQB
: COLON
, COMMA
; SEMI
+ PLUS
- MINUS
* STAR
/ SLASH
| VBAR
& AMPER
< LESS
> GREATER
= EQUAL
. DOT
% PERCENT
` BACKQUOTE
{ LBRACE
} RBRACE
@ AT
@= ATEQUAL
== EQEQUAL
!= NOTEQUAL
<> NOTEQUAL
<= LESSEQUAL
>= GREATEREQUAL
~ TILDE
^ CIRCUMFLEX
<< LEFTSHIFT
>> RIGHTSHIFT
** DOUBLESTAR
+= PLUSEQUAL
-= MINEQUAL
*= STAREQUAL
/= SLASHEQUAL
%= PERCENTEQUAL
&= AMPEREQUAL
|= VBAREQUAL
^= CIRCUMFLEXEQUAL
<<= LEFTSHIFTEQUAL
>>= RIGHTSHIFTEQUAL
**= DOUBLESTAREQUAL
// DOUBLESLASH
//= DOUBLESLASHEQUAL
-> RARROW
)r. r7 r � r r �objectr r Z opmap_rawZopmap�
splitlines�line�split�op�namer% r r r r �<module>
s y= pgen2/__pycache__/driver.cpython-36.pyc 0000644 00000012010 15053244155 0013706 0 ustar 00 3
\� � @ s� d Z dZddgZddlZddlZddlZddlZddlZddlZddl m
Z
m Z m Z m
Z
mZ G dd� de�Zd d
� Zddd�Zdd� Zdd� Zdd� Zedkr�ejee� �� dS )zZParser driver.
This provides a high-level interface to parse a file into a syntax tree.
z#Guido van Rossum <guido@python.org>�Driver� load_grammar� N� )�grammar�parse�token�tokenize�pgenc @ sH e Zd Zddd�Zddd�Zddd�Zdd d
�Zdd d �Zdd
d�ZdS )r Nc C s& || _ |d krtj� }|| _|| _d S )N)r �logging� getLogger�logger�convert)�selfr r
r � r �,/usr/lib64/python3.6/lib2to3/pgen2/driver.py�__init__ s
zDriver.__init__Fc C s� t j| j| j�}|j� d}d}d } } } } }
d} �xR|D �]4} | \}}}} }
|||fkr�||f|ks|t||f|f��|\}
}||
k r�| d|
| 7 } |
}d}||k r�| |
||� 7 } |}|tjtjfkr�| |7 } | \}}|j d�r@|d7 }d}q@|t
j k�rtj | }|�r,| j
jdt
j| || � |j||| |f��rT|�rR| j
jd� P d} | \}}|j d�r@|d7 }d}q@W t jd||| |f��|jS ) z4Parse a series of tokens and return the syntax tree.r r N� �
z%s %r (prefix=%r)zStop.zincomplete input)r ZParserr r
Zsetup�AssertionErrorr �COMMENT�NL�endswithr �OPZopmapr �debug�tok_nameZaddtokenZ
ParseErrorZrootnode)r �tokensr �p�lineno�column�type�value�start�endZ line_text�prefixZ quintupleZs_linenoZs_columnr r r � parse_tokens' sT
zDriver.parse_tokensc C s t j|j�}| j||�S )z*Parse a stream and return the syntax tree.)r �generate_tokens�readliner$ )r �streamr r r r r �parse_stream_rawW s zDriver.parse_stream_rawc C s | j ||�S )z*Parse a stream and return the syntax tree.)r( )r r' r r r r � parse_stream\ s zDriver.parse_streamc
C s* t j|d|�}z | j||�S |j� X dS )z(Parse a file and return the syntax tree.�rN)�codecs�openr) �close)r �filename�encodingr r' r r r �
parse_file` s zDriver.parse_filec C s t jtj|�j�}| j||�S )z*Parse a string and return the syntax tree.)r r% �io�StringIOr& r$ )r �textr r r r r � parse_stringh s zDriver.parse_string)NN)F)F)F)NF)F) �__name__�
__module__� __qualname__r r$ r( r) r0 r4 r r r r r s
0
c C s: t jj| �\}}|dkr d}|| djtttj�� d S )Nz.txtr �.z.pickle)�os�path�splitext�join�map�str�sys� version_info)�gt�head�tailr r r �_generate_pickle_namen s rD � Grammar.txtTFc C s� |dkrt j� }|dkr t| �n|}|s4t|| � r�|jd| � tj| �}|r�|jd|� y|j|� W q� tk
r� } z|jd|� W Y dd}~X q�X nt j
� }|j |� |S )z'Load the grammar (maybe from a pickle).Nz!Generating grammar tables from %sz Writing grammar tables to %szWriting failed: %s) r
r rD �_newer�infor Zgenerate_grammar�dump�OSErrorr �Grammar�load)rA Zgp�save�forcer �g�er r r r u s
c C s8 t jj| �sdS t jj|�s dS t jj| �t jj|�kS )z0Inquire whether file a was written since file b.FT)r9 r: �exists�getmtime)�a�br r r rF � s
rF c C sF t jj|�rt|�S tt jj|��}tj| |�}tj � }|j
|� |S )a� Normally, loads a pickled grammar by doing
pkgutil.get_data(package, pickled_grammar)
where *pickled_grammar* is computed from *grammar_source* by adding the
Python version and using a ``.pickle`` extension.
However, if *grammar_source* is an extant file, load_grammar(grammar_source)
is called instead. This facilitates using a packaged grammar file when needed
but preserves load_grammar's automatic regeneration behavior when possible.
) r9 r: �isfiler rD �basename�pkgutil�get_datar rJ �loads)�packageZgrammar_sourceZ pickled_name�datarN r r r �load_packaged_grammar� s
r[ c G sF | st jdd� } tjtjt jdd� x| D ]}t|ddd� q,W dS )z�Main program, when run as a script: produce grammar pickle files.
Calls load_grammar for each argument, a path to a grammar text file.
r Nz %(message)s)�levelr' �formatT)rL rM )r? �argvr
Z basicConfig�INFO�stdoutr )�argsrA r r r �main� s
rb �__main__)rE NTFN)�__doc__�
__author__�__all__r+ r1 r9 r
rV r? r r r r r r �objectr rD r rF r[ rb r5 �exit�intr r r r �<module> s$ P
pgen2/__pycache__/grammar.cpython-36.opt-1.pyc 0000644 00000015621 15053244155 0015013 0 ustar 00 3
\� � @ sx d Z ddlZddlZddlmZmZ G dd� de�Zdd� Zd Z i Z
x.e j � D ]"Z e rNe j
� \ZZeee�e
e< qNW dS )
a� This module defines the data structures used to represent a grammar.
These are a bit arcane because they are derived from the data
structures used by Python's 'pgen' parser generator.
There's also a table here mapping operators to their names in the
token module; the Python tokenize module reports all operators as the
fallback token code OP, but the parser needs the actual token code.
� N� )�token�tokenizec @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )�Grammara� Pgen parsing tables conversion class.
Once initialized, this class supplies the grammar tables for the
parsing engine implemented by parse.py. The parsing engine
accesses the instance variables directly. The class here does not
provide initialization of the tables; several subclasses exist to
do this (see the conv and pgen modules).
The load() method reads the tables from a pickle file, which is
much faster than the other ways offered by subclasses. The pickle
file is written by calling dump() (after loading the grammar
tables using a subclass). The report() method prints a readable
representation of the tables to stdout, for debugging.
The instance variables are as follows:
symbol2number -- a dict mapping symbol names to numbers. Symbol
numbers are always 256 or higher, to distinguish
them from token numbers, which are between 0 and
255 (inclusive).
number2symbol -- a dict mapping numbers to symbol names;
these two are each other's inverse.
states -- a list of DFAs, where each DFA is a list of
states, each state is a list of arcs, and each
arc is a (i, j) pair where i is a label and j is
a state number. The DFA number is the index into
this list. (This name is slightly confusing.)
Final states are represented by a special arc of
the form (0, j) where j is its own state number.
dfas -- a dict mapping symbol numbers to (DFA, first)
pairs, where DFA is an item from the states list
above, and first is a set of tokens that can
begin this grammar rule (represented by a dict
whose values are always 1).
labels -- a list of (x, y) pairs where x is either a token
number or a symbol number, and y is either None
or a string; the strings are keywords. The label
number is the index in this list; label numbers
are used to mark state transitions (arcs) in the
DFAs.
start -- the number of the grammar's start symbol.
keywords -- a dict mapping keyword strings to arc labels.
tokens -- a dict mapping token numbers to arc labels.
c C s< i | _ i | _g | _i | _dg| _i | _i | _i | _d| _d S )Nr �EMPTY� )r r ) �
symbol2number�
number2symbol�states�dfas�labels�keywords�tokens� symbol2label�start)�self� r �-/usr/lib64/python3.6/lib2to3/pgen2/grammar.py�__init__M s zGrammar.__init__c C s2 t |d�� }t| j�}tj||d� W dQ R X dS )a� Dump the grammar tables to a pickle file.
dump() recursively changes all dict to OrderedDict, so the pickled file
is not exactly the same as what was passed in to dump(). load() uses the
pickled file to create the tables, but only changes OrderedDict to dict
at the top level; it does not recursively change OrderedDict to dict.
So, the loaded tables are different from the original tables that were
passed to load() in that some of the OrderedDict (from the pickled file)
are not changed back to dict. For parsing, this has no effect on
performance because OrderedDict uses dict's __getitem__ with nothing in
between.
�wb� N)�open�_make_deterministic�__dict__�pickle�dump)r �filename�f�dr r r r X s
z Grammar.dumpc C s0 t |d��}tj|�}W dQ R X | jj|� dS )z+Load the grammar tables from a pickle file.�rbN)r r �loadr �update)r r r r r r r r i s z Grammar.loadc C s | j jtj|�� dS )z3Load the grammar tables from a pickle bytes object.N)r r! r �loads)r Zpklr r r r" o s z
Grammar.loadsc C sX | j � }x"dD ]}t||t| |�j� � qW | jdd� |_| jdd� |_| j|_|S ) z#
Copy the grammar.
r r r r
r r N)r r r r
r r )� __class__�setattr�getattr�copyr r
r )r �newZ dict_attrr r r r& s s z Grammar.copyc C sv ddl m } td� || j� td� || j� td� || j� td� || j� td� || j� td| j� d S )
z:Dump the grammar tables to standard output, for debugging.r )�pprintZs2nZn2sr
r r r N)r( �printr r r
r r r )r r( r r r �report� s
zGrammar.reportN)
�__name__�
__module__� __qualname__�__doc__r r r r" r& r* r r r r r s 4
r c C s^ t | t�r&tjtdd� | j� D ���S t | t�r>dd� | D �S t | t�rZtdd� | D ��S | S )Nc s s | ]\}}|t |�fV qd S )N)r )�.0�k�vr r r � <genexpr>� s z&_make_deterministic.<locals>.<genexpr>c S s g | ] }t |��qS r )r )r/ �er r r �
<listcomp>� s z'_make_deterministic.<locals>.<listcomp>c s s | ]}t |�V qd S )N)r )r/ r3 r r r r2 � s )�
isinstance�dict� collections� OrderedDict�sorted�items�list�tuple)�topr r r r � s
r a
( LPAR
) RPAR
[ LSQB
] RSQB
: COLON
, COMMA
; SEMI
+ PLUS
- MINUS
* STAR
/ SLASH
| VBAR
& AMPER
< LESS
> GREATER
= EQUAL
. DOT
% PERCENT
` BACKQUOTE
{ LBRACE
} RBRACE
@ AT
@= ATEQUAL
== EQEQUAL
!= NOTEQUAL
<> NOTEQUAL
<= LESSEQUAL
>= GREATEREQUAL
~ TILDE
^ CIRCUMFLEX
<< LEFTSHIFT
>> RIGHTSHIFT
** DOUBLESTAR
+= PLUSEQUAL
-= MINEQUAL
*= STAREQUAL
/= SLASHEQUAL
%= PERCENTEQUAL
&= AMPEREQUAL
|= VBAREQUAL
^= CIRCUMFLEXEQUAL
<<= LEFTSHIFTEQUAL
>>= RIGHTSHIFTEQUAL
**= DOUBLESTAREQUAL
// DOUBLESLASH
//= DOUBLESLASHEQUAL
-> RARROW
)r. r7 r � r r �objectr r Z opmap_rawZopmap�
splitlines�line�split�op�namer% r r r r �<module>
s y= pgen2/__pycache__/conv.cpython-36.pyc 0000644 00000015570 15053244155 0013376 0 ustar 00 3
\�% � @ s2 d Z ddlZddlmZmZ G dd� dej�ZdS )a� Convert graminit.[ch] spit out by pgen to Python code.
Pgen is the Python parser generator. It is useful to quickly create a
parser from a grammar file in Python's grammar notation. But I don't
want my parsers to be written in C (yet), so I'm translating the
parsing tables to Python data structures and writing a Python parse
engine.
Note that the token numbers are constants determined by the standard
Python tokenizer. The standard token module defines these numbers and
their names (the names are not used much). The token numbers are
hardcoded into the Python tokenizer and into pgen. A Python
implementation of the Python tokenizer is also available, in the
standard tokenize module.
On the other hand, symbol numbers (representing the grammar's
non-terminals) are assigned by pgen based on the actual grammar
input.
Note: this module is pretty much obsolete; the pgen module generates
equivalent grammar tables directly from the Grammar.txt input file
without having to invoke the Python pgen C program.
� N)�grammar�tokenc @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) � Convertera2 Grammar subclass that reads classic pgen output files.
The run() method reads the tables as produced by the pgen parser
generator, typically contained in two C files, graminit.h and
graminit.c. The other methods are for internal use only.
See the base class for more documentation.
c C s | j |� | j|� | j� dS )z<Load the grammar tables from the text files written by pgen.N)�parse_graminit_h�parse_graminit_c�
finish_off)�selfZ
graminit_hZ
graminit_c� r �*/usr/lib64/python3.6/lib2to3/pgen2/conv.py�run/ s
z
Converter.runc C s� y t |�}W n0 tk
r< } ztd||f � dS d}~X nX i | _i | _d}x�|D ]�}|d7 }tjd|�}| r�|j� r�td|||j� f � qT|j� \}}t |�}|| jks�t
�|| jks�t
�|| j|< || j|< qTW dS ) z�Parse the .h file written by pgen. (Internal)
This file is a sequence of #define statements defining the
nonterminals of the grammar as numbers. We build two tables
mapping the numbers to names and back.
zCan't open %s: %sFNr � z^#define\s+(\w+)\s+(\d+)$z%s(%s): can't parse %sT) �open�OSError�print�
symbol2number�
number2symbol�re�match�strip�groups�int�AssertionError) r �filename�f�err�lineno�line�mo�symbol�numberr r r
r 5 s*
zConverter.parse_graminit_hc ! C sp y t |�}W n0 tk
r< } ztd||f � dS d}~X nX d}|d t|� }}|dksht||f��|d t|� }}|dks�t||f��|d t|� }}i }g }�x*|jd��r�x�|jd��r�tjd |�}|s�t||f��tt t
|j � ��\} }
} g } xft | �D ]Z}
|d t|� }}tjd
|�}|�s<t||f��tt t
|j � ��\}}| j
||f� �qW |d t|� }}|d k�s�t||f��| || |
f< |d t|� }}q�W tjd |�}|�s�t||f��tt t
|j � ��\}}|t|�k�s�t||f��g }x�t |�D ]~}
|d t|� }}tjd
|�}|�s@t||f��tt t
|j � ��\} } }
|| |
f } | t| �k�s~t||f��|j
| � �q W |j
|� |d t|� }}|d k�s�t||f��|d t|� }}q�W || _i }tjd|�}|�s�t||f��t
|jd��}�x�t |�D �]r}|d t|� }}tjd|�}|�sNt||f��|jd�}tt t
|jdddd���\}}}}| j| |k�s�t||f��| j| |k�s�t||f��|dk�s�t||f��|| }|t|�k�s�t||f��|d t|� }}tjd|�}|�st||f��i }t|jd��}xPt|�D ]D\}} t| �} x0t d�D ]$}| d|> @ �rPd||d | < �qPW �q6W ||f||< �qW |d t|� }}|d k�s�t||f��|| _g } |d t|� }}tjd|�}|�s�t||f��t
|jd��} x|t | �D ]p}|d t|� }}tjd|�}|�s>t||f��|j � \}}t
|�}|dk�rbd}nt|�}| j
||f� �q
W |d t|� }}|d k�s�t||f��| | _|d t|� }}|dk�s�t||f��|d t|� }}tjd|�}|�st||f��t
|jd��}|t| j�k�s&t�|d t|� }}|dk�sNt||f��|d t|� }}tjd |�}|�s~t||f��t
|jd��} | t| j�k�s�t||f��|d t|� }}tjd |�}|�s�t||f��t
|jd��} | | jk�s�t||f��| | _|d t|� }}|d k�s,t||f��y|d t|� }}W n tk
�rX Y nX d�slt||f��dS ) a� Parse the .c file written by pgen. (Internal)
The file looks as follows. The first two lines are always this:
#include "pgenheaders.h"
#include "grammar.h"
After that come four blocks:
1) one or more state definitions
2) a table defining dfas
3) a table defining labels
4) a struct defining the grammar
A state definition has the following form:
- one or more arc arrays, each of the form:
static arc arcs_<n>_<m>[<k>] = {
{<i>, <j>},
...
};
- followed by a state array, of the form:
static state states_<s>[<t>] = {
{<k>, arcs_<n>_<m>},
...
};
zCan't open %s: %sFNr r z#include "pgenheaders.h"
z#include "grammar.h"
z static arc z)static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$z\s+{(\d+), (\d+)},$z};
z'static state states_(\d+)\[(\d+)\] = {$z \s+{(\d+), arcs_(\d+)_(\d+)},$z static dfa dfas\[(\d+)\] = {$z0\s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$� � � � z\s+("(?:\\\d\d\d)*")},$� z!static label labels\[(\d+)\] = {$z\s+{(\d+), (0|"\w+")},$�0z grammar _PyParser_Grammar = {
z
\s+(\d+),$z dfas,
z\s+{(\d+), labels},$z \s+(\d+)$)r
r r �nextr �
startswithr r �list�mapr r �range�append�len�states�groupr r �eval� enumerate�ord�dfas�labels�start�
StopIteration)!r r r r r r Zallarcsr- r �n�m�kZarcs�_�i�j�s�t�stater2 Zndfasr r �x�y�z�firstZ rawbitset�cZbyter3 Znlabelsr4 r r r
r T s�
"
zConverter.parse_graminit_cc C s\ i | _ i | _xJt| j�D ]<\}\}}|tjkrB|dk rB|| j |< q|dkr|| j|< qW dS )z1Create additional useful structures. (Internal).N)�keywords�tokensr0 r3 r �NAME)r Zilabel�type�valuer r r
r � s zConverter.finish_offN)�__name__�
__module__� __qualname__�__doc__r r r r r r r r
r $ s &r )rL r Zpgen2r r ZGrammarr r r r r
�<module> s pgen2/pgen.py 0000644 00000032764 15053244155 0007102 0 ustar 00 # Copyright 2004-2005 Elemental Security, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
# Pgen imports
from . import grammar, token, tokenize
class PgenGrammar(grammar.Grammar):
pass
class ParserGenerator(object):
def __init__(self, filename, stream=None):
close_stream = None
if stream is None:
stream = open(filename)
close_stream = stream.close
self.filename = filename
self.stream = stream
self.generator = tokenize.generate_tokens(stream.readline)
self.gettoken() # Initialize lookahead
self.dfas, self.startsymbol = self.parse()
if close_stream is not None:
close_stream()
self.first = {} # map from symbol name to set of tokens
self.addfirstsets()
def make_grammar(self):
c = PgenGrammar()
names = list(self.dfas.keys())
names.sort()
names.remove(self.startsymbol)
names.insert(0, self.startsymbol)
for name in names:
i = 256 + len(c.symbol2number)
c.symbol2number[name] = i
c.number2symbol[i] = name
for name in names:
dfa = self.dfas[name]
states = []
for state in dfa:
arcs = []
for label, next in sorted(state.arcs.items()):
arcs.append((self.make_label(c, label), dfa.index(next)))
if state.isfinal:
arcs.append((0, dfa.index(state)))
states.append(arcs)
c.states.append(states)
c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name))
c.start = c.symbol2number[self.startsymbol]
return c
def make_first(self, c, name):
rawfirst = self.first[name]
first = {}
for label in sorted(rawfirst):
ilabel = self.make_label(c, label)
##assert ilabel not in first # XXX failed on <> ... !=
first[ilabel] = 1
return first
def make_label(self, c, label):
# XXX Maybe this should be a method on a subclass of converter?
ilabel = len(c.labels)
if label[0].isalpha():
# Either a symbol name or a named token
if label in c.symbol2number:
# A symbol name (a non-terminal)
if label in c.symbol2label:
return c.symbol2label[label]
else:
c.labels.append((c.symbol2number[label], None))
c.symbol2label[label] = ilabel
return ilabel
else:
# A named token (NAME, NUMBER, STRING)
itoken = getattr(token, label, None)
assert isinstance(itoken, int), label
assert itoken in token.tok_name, label
if itoken in c.tokens:
return c.tokens[itoken]
else:
c.labels.append((itoken, None))
c.tokens[itoken] = ilabel
return ilabel
else:
# Either a keyword or an operator
assert label[0] in ('"', "'"), label
value = eval(label)
if value[0].isalpha():
# A keyword
if value in c.keywords:
return c.keywords[value]
else:
c.labels.append((token.NAME, value))
c.keywords[value] = ilabel
return ilabel
else:
# An operator (any non-numeric token)
itoken = grammar.opmap[value] # Fails if unknown token
if itoken in c.tokens:
return c.tokens[itoken]
else:
c.labels.append((itoken, None))
c.tokens[itoken] = ilabel
return ilabel
def addfirstsets(self):
names = list(self.dfas.keys())
names.sort()
for name in names:
if name not in self.first:
self.calcfirst(name)
#print name, self.first[name].keys()
def calcfirst(self, name):
dfa = self.dfas[name]
self.first[name] = None # dummy to detect left recursion
state = dfa[0]
totalset = {}
overlapcheck = {}
for label, next in state.arcs.items():
if label in self.dfas:
if label in self.first:
fset = self.first[label]
if fset is None:
raise ValueError("recursion for rule %r" % name)
else:
self.calcfirst(label)
fset = self.first[label]
totalset.update(fset)
overlapcheck[label] = fset
else:
totalset[label] = 1
overlapcheck[label] = {label: 1}
inverse = {}
for label, itsfirst in overlapcheck.items():
for symbol in itsfirst:
if symbol in inverse:
raise ValueError("rule %s is ambiguous; %s is in the"
" first sets of %s as well as %s" %
(name, symbol, label, inverse[symbol]))
inverse[symbol] = label
self.first[name] = totalset
def parse(self):
dfas = {}
startsymbol = None
# MSTART: (NEWLINE | RULE)* ENDMARKER
while self.type != token.ENDMARKER:
while self.type == token.NEWLINE:
self.gettoken()
# RULE: NAME ':' RHS NEWLINE
name = self.expect(token.NAME)
self.expect(token.OP, ":")
a, z = self.parse_rhs()
self.expect(token.NEWLINE)
#self.dump_nfa(name, a, z)
dfa = self.make_dfa(a, z)
#self.dump_dfa(name, dfa)
oldlen = len(dfa)
self.simplify_dfa(dfa)
newlen = len(dfa)
dfas[name] = dfa
#print name, oldlen, newlen
if startsymbol is None:
startsymbol = name
return dfas, startsymbol
def make_dfa(self, start, finish):
# To turn an NFA into a DFA, we define the states of the DFA
# to correspond to *sets* of states of the NFA. Then do some
# state reduction. Let's represent sets as dicts with 1 for
# values.
assert isinstance(start, NFAState)
assert isinstance(finish, NFAState)
def closure(state):
base = {}
addclosure(state, base)
return base
def addclosure(state, base):
assert isinstance(state, NFAState)
if state in base:
return
base[state] = 1
for label, next in state.arcs:
if label is None:
addclosure(next, base)
states = [DFAState(closure(start), finish)]
for state in states: # NB states grows while we're iterating
arcs = {}
for nfastate in state.nfaset:
for label, next in nfastate.arcs:
if label is not None:
addclosure(next, arcs.setdefault(label, {}))
for label, nfaset in sorted(arcs.items()):
for st in states:
if st.nfaset == nfaset:
break
else:
st = DFAState(nfaset, finish)
states.append(st)
state.addarc(st, label)
return states # List of DFAState instances; first one is start
def dump_nfa(self, name, start, finish):
print("Dump of NFA for", name)
todo = [start]
for i, state in enumerate(todo):
print(" State", i, state is finish and "(final)" or "")
for label, next in state.arcs:
if next in todo:
j = todo.index(next)
else:
j = len(todo)
todo.append(next)
if label is None:
print(" -> %d" % j)
else:
print(" %s -> %d" % (label, j))
def dump_dfa(self, name, dfa):
print("Dump of DFA for", name)
for i, state in enumerate(dfa):
print(" State", i, state.isfinal and "(final)" or "")
for label, next in sorted(state.arcs.items()):
print(" %s -> %d" % (label, dfa.index(next)))
def simplify_dfa(self, dfa):
# This is not theoretically optimal, but works well enough.
# Algorithm: repeatedly look for two states that have the same
# set of arcs (same labels pointing to the same nodes) and
# unify them, until things stop changing.
# dfa is a list of DFAState instances
changes = True
while changes:
changes = False
for i, state_i in enumerate(dfa):
for j in range(i+1, len(dfa)):
state_j = dfa[j]
if state_i == state_j:
#print " unify", i, j
del dfa[j]
for state in dfa:
state.unifystate(state_j, state_i)
changes = True
break
def parse_rhs(self):
# RHS: ALT ('|' ALT)*
a, z = self.parse_alt()
if self.value != "|":
return a, z
else:
aa = NFAState()
zz = NFAState()
aa.addarc(a)
z.addarc(zz)
while self.value == "|":
self.gettoken()
a, z = self.parse_alt()
aa.addarc(a)
z.addarc(zz)
return aa, zz
def parse_alt(self):
# ALT: ITEM+
a, b = self.parse_item()
while (self.value in ("(", "[") or
self.type in (token.NAME, token.STRING)):
c, d = self.parse_item()
b.addarc(c)
b = d
return a, b
def parse_item(self):
# ITEM: '[' RHS ']' | ATOM ['+' | '*']
if self.value == "[":
self.gettoken()
a, z = self.parse_rhs()
self.expect(token.OP, "]")
a.addarc(z)
return a, z
else:
a, z = self.parse_atom()
value = self.value
if value not in ("+", "*"):
return a, z
self.gettoken()
z.addarc(a)
if value == "+":
return a, z
else:
return a, a
def parse_atom(self):
# ATOM: '(' RHS ')' | NAME | STRING
if self.value == "(":
self.gettoken()
a, z = self.parse_rhs()
self.expect(token.OP, ")")
return a, z
elif self.type in (token.NAME, token.STRING):
a = NFAState()
z = NFAState()
a.addarc(z, self.value)
self.gettoken()
return a, z
else:
self.raise_error("expected (...) or NAME or STRING, got %s/%s",
self.type, self.value)
def expect(self, type, value=None):
if self.type != type or (value is not None and self.value != value):
self.raise_error("expected %s/%s, got %s/%s",
type, value, self.type, self.value)
value = self.value
self.gettoken()
return value
def gettoken(self):
tup = next(self.generator)
while tup[0] in (tokenize.COMMENT, tokenize.NL):
tup = next(self.generator)
self.type, self.value, self.begin, self.end, self.line = tup
#print token.tok_name[self.type], repr(self.value)
def raise_error(self, msg, *args):
if args:
try:
msg = msg % args
except:
msg = " ".join([msg] + list(map(str, args)))
raise SyntaxError(msg, (self.filename, self.end[0],
self.end[1], self.line))
class NFAState(object):
def __init__(self):
self.arcs = [] # list of (label, NFAState) pairs
def addarc(self, next, label=None):
assert label is None or isinstance(label, str)
assert isinstance(next, NFAState)
self.arcs.append((label, next))
class DFAState(object):
def __init__(self, nfaset, final):
assert isinstance(nfaset, dict)
assert isinstance(next(iter(nfaset)), NFAState)
assert isinstance(final, NFAState)
self.nfaset = nfaset
self.isfinal = final in nfaset
self.arcs = {} # map from label to DFAState
def addarc(self, next, label):
assert isinstance(label, str)
assert label not in self.arcs
assert isinstance(next, DFAState)
self.arcs[label] = next
def unifystate(self, old, new):
for label, next in self.arcs.items():
if next is old:
self.arcs[label] = new
def __eq__(self, other):
# Equality test -- ignore the nfaset instance variable
assert isinstance(other, DFAState)
if self.isfinal != other.isfinal:
return False
# Can't just return self.arcs == other.arcs, because that
# would invoke this method recursively, with cycles...
if len(self.arcs) != len(other.arcs):
return False
for label, next in self.arcs.items():
if next is not other.arcs.get(label):
return False
return True
__hash__ = None # For Py3 compatibility.
def generate_grammar(filename="Grammar.txt"):
p = ParserGenerator(filename)
return p.make_grammar()
pgen2/tokenize.py 0000644 00000054116 15053244155 0007774 0 ustar 00 # Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006 Python Software Foundation.
# All rights reserved.
"""Tokenization help for Python programs.
generate_tokens(readline) is a generator that breaks a stream of
text into Python tokens. It accepts a readline-like method which is called
repeatedly to get the next line of input (or "" for EOF). It generates
5-tuples with these members:
the token type (see token.py)
the token (a string)
the starting (row, column) indices of the token (a 2-tuple of ints)
the ending (row, column) indices of the token (a 2-tuple of ints)
the original line (string)
It is designed to match the working of the Python tokenizer exactly, except
that it produces COMMENT tokens for comments and gives type OP for all
operators
Older entry points
tokenize_loop(readline, tokeneater)
tokenize(readline, tokeneater=printtoken)
are the same, except instead of generating tokens, tokeneater is a callback
function to which the 5 fields described above are passed as 5 arguments,
each time a new token is found."""
__author__ = 'Ka-Ping Yee <ping@lfw.org>'
__credits__ = \
'GvR, ESR, Tim Peters, Thomas Wouters, Fred Drake, Skip Montanaro'
import string, re
from codecs import BOM_UTF8, lookup
from lib2to3.pgen2.token import *
from . import token
__all__ = [x for x in dir(token) if x[0] != '_'] + ["tokenize",
"generate_tokens", "untokenize"]
del token
try:
bytes
except NameError:
# Support bytes type in Python <= 2.5, so 2to3 turns itself into
# valid Python 3 code.
bytes = str
def group(*choices): return '(' + '|'.join(choices) + ')'
def any(*choices): return group(*choices) + '*'
def maybe(*choices): return group(*choices) + '?'
Whitespace = r'[ \f\t]*'
Comment = r'#[^\r\n]*'
Ignore = Whitespace + any(r'\\\r?\n' + Whitespace) + maybe(Comment)
Name = r'[a-zA-Z_]\w*'
Binnumber = r'0[bB]_?[01]+(?:_[01]+)*'
Hexnumber = r'0[xX]_?[\da-fA-F]+(?:_[\da-fA-F]+)*[lL]?'
Octnumber = r'0[oO]?_?[0-7]+(?:_[0-7]+)*[lL]?'
Decnumber = group(r'[1-9]\d*(?:_\d+)*[lL]?', '0[lL]?')
Intnumber = group(Binnumber, Hexnumber, Octnumber, Decnumber)
Exponent = r'[eE][-+]?\d+(?:_\d+)*'
Pointfloat = group(r'\d+(?:_\d+)*\.(?:\d+(?:_\d+)*)?', r'\.\d+(?:_\d+)*') + maybe(Exponent)
Expfloat = r'\d+(?:_\d+)*' + Exponent
Floatnumber = group(Pointfloat, Expfloat)
Imagnumber = group(r'\d+(?:_\d+)*[jJ]', Floatnumber + r'[jJ]')
Number = group(Imagnumber, Floatnumber, Intnumber)
# Tail end of ' string.
Single = r"[^'\\]*(?:\\.[^'\\]*)*'"
# Tail end of " string.
Double = r'[^"\\]*(?:\\.[^"\\]*)*"'
# Tail end of ''' string.
Single3 = r"[^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''"
# Tail end of """ string.
Double3 = r'[^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""'
_litprefix = r"(?:[uUrRbBfF]|[rR][bB]|[bBuU][rR])?"
Triple = group(_litprefix + "'''", _litprefix + '"""')
# Single-line ' or " string.
String = group(_litprefix + r"'[^\n'\\]*(?:\\.[^\n'\\]*)*'",
_litprefix + r'"[^\n"\\]*(?:\\.[^\n"\\]*)*"')
# Because of leftmost-then-longest match semantics, be sure to put the
# longest operators first (e.g., if = came before ==, == would get
# recognized as two instances of =).
Operator = group(r"\*\*=?", r">>=?", r"<<=?", r"<>", r"!=",
r"//=?", r"->",
r"[+\-*/%&@|^=<>]=?",
r"~")
Bracket = '[][(){}]'
Special = group(r'\r?\n', r'[:;.,`@]')
Funny = group(Operator, Bracket, Special)
PlainToken = group(Number, Funny, String, Name)
Token = Ignore + PlainToken
# First (or only) line of ' or " string.
ContStr = group(_litprefix + r"'[^\n'\\]*(?:\\.[^\n'\\]*)*" +
group("'", r'\\\r?\n'),
_litprefix + r'"[^\n"\\]*(?:\\.[^\n"\\]*)*' +
group('"', r'\\\r?\n'))
PseudoExtras = group(r'\\\r?\n', Comment, Triple)
PseudoToken = Whitespace + group(PseudoExtras, Number, Funny, ContStr, Name)
tokenprog, pseudoprog, single3prog, double3prog = list(map(
re.compile, (Token, PseudoToken, Single3, Double3)))
endprogs = {"'": re.compile(Single), '"': re.compile(Double),
"'''": single3prog, '"""': double3prog,
"r'''": single3prog, 'r"""': double3prog,
"u'''": single3prog, 'u"""': double3prog,
"b'''": single3prog, 'b"""': double3prog,
"f'''": single3prog, 'f"""': double3prog,
"ur'''": single3prog, 'ur"""': double3prog,
"br'''": single3prog, 'br"""': double3prog,
"rb'''": single3prog, 'rb"""': double3prog,
"R'''": single3prog, 'R"""': double3prog,
"U'''": single3prog, 'U"""': double3prog,
"B'''": single3prog, 'B"""': double3prog,
"F'''": single3prog, 'F"""': double3prog,
"uR'''": single3prog, 'uR"""': double3prog,
"Ur'''": single3prog, 'Ur"""': double3prog,
"UR'''": single3prog, 'UR"""': double3prog,
"bR'''": single3prog, 'bR"""': double3prog,
"Br'''": single3prog, 'Br"""': double3prog,
"BR'''": single3prog, 'BR"""': double3prog,
"rB'''": single3prog, 'rB"""': double3prog,
"Rb'''": single3prog, 'Rb"""': double3prog,
"RB'''": single3prog, 'RB"""': double3prog,
'r': None, 'R': None,
'u': None, 'U': None,
'f': None, 'F': None,
'b': None, 'B': None}
triple_quoted = {}
for t in ("'''", '"""',
"r'''", 'r"""', "R'''", 'R"""',
"u'''", 'u"""', "U'''", 'U"""',
"b'''", 'b"""', "B'''", 'B"""',
"f'''", 'f"""', "F'''", 'F"""',
"ur'''", 'ur"""', "Ur'''", 'Ur"""',
"uR'''", 'uR"""', "UR'''", 'UR"""',
"br'''", 'br"""', "Br'''", 'Br"""',
"bR'''", 'bR"""', "BR'''", 'BR"""',
"rb'''", 'rb"""', "Rb'''", 'Rb"""',
"rB'''", 'rB"""', "RB'''", 'RB"""',):
triple_quoted[t] = t
single_quoted = {}
for t in ("'", '"',
"r'", 'r"', "R'", 'R"',
"u'", 'u"', "U'", 'U"',
"b'", 'b"', "B'", 'B"',
"f'", 'f"', "F'", 'F"',
"ur'", 'ur"', "Ur'", 'Ur"',
"uR'", 'uR"', "UR'", 'UR"',
"br'", 'br"', "Br'", 'Br"',
"bR'", 'bR"', "BR'", 'BR"',
"rb'", 'rb"', "Rb'", 'Rb"',
"rB'", 'rB"', "RB'", 'RB"',):
single_quoted[t] = t
tabsize = 8
class TokenError(Exception): pass
class StopTokenizing(Exception): pass
def printtoken(type, token, xxx_todo_changeme, xxx_todo_changeme1, line): # for testing
(srow, scol) = xxx_todo_changeme
(erow, ecol) = xxx_todo_changeme1
print("%d,%d-%d,%d:\t%s\t%s" % \
(srow, scol, erow, ecol, tok_name[type], repr(token)))
def tokenize(readline, tokeneater=printtoken):
"""
The tokenize() function accepts two parameters: one representing the
input stream, and one providing an output mechanism for tokenize().
The first parameter, readline, must be a callable object which provides
the same interface as the readline() method of built-in file objects.
Each call to the function should return one line of input as a string.
The second parameter, tokeneater, must also be a callable object. It is
called once for each token, with five arguments, corresponding to the
tuples generated by generate_tokens().
"""
try:
tokenize_loop(readline, tokeneater)
except StopTokenizing:
pass
# backwards compatible interface
def tokenize_loop(readline, tokeneater):
for token_info in generate_tokens(readline):
tokeneater(*token_info)
class Untokenizer:
def __init__(self):
self.tokens = []
self.prev_row = 1
self.prev_col = 0
def add_whitespace(self, start):
row, col = start
assert row <= self.prev_row
col_offset = col - self.prev_col
if col_offset:
self.tokens.append(" " * col_offset)
def untokenize(self, iterable):
for t in iterable:
if len(t) == 2:
self.compat(t, iterable)
break
tok_type, token, start, end, line = t
self.add_whitespace(start)
self.tokens.append(token)
self.prev_row, self.prev_col = end
if tok_type in (NEWLINE, NL):
self.prev_row += 1
self.prev_col = 0
return "".join(self.tokens)
def compat(self, token, iterable):
startline = False
indents = []
toks_append = self.tokens.append
toknum, tokval = token
if toknum in (NAME, NUMBER):
tokval += ' '
if toknum in (NEWLINE, NL):
startline = True
for tok in iterable:
toknum, tokval = tok[:2]
if toknum in (NAME, NUMBER, ASYNC, AWAIT):
tokval += ' '
if toknum == INDENT:
indents.append(tokval)
continue
elif toknum == DEDENT:
indents.pop()
continue
elif toknum in (NEWLINE, NL):
startline = True
elif startline and indents:
toks_append(indents[-1])
startline = False
toks_append(tokval)
cookie_re = re.compile(r'^[ \t\f]*#.*?coding[:=][ \t]*([-\w.]+)', re.ASCII)
blank_re = re.compile(br'^[ \t\f]*(?:[#\r\n]|$)', re.ASCII)
def _get_normal_name(orig_enc):
"""Imitates get_normal_name in tokenizer.c."""
# Only care about the first 12 characters.
enc = orig_enc[:12].lower().replace("_", "-")
if enc == "utf-8" or enc.startswith("utf-8-"):
return "utf-8"
if enc in ("latin-1", "iso-8859-1", "iso-latin-1") or \
enc.startswith(("latin-1-", "iso-8859-1-", "iso-latin-1-")):
return "iso-8859-1"
return orig_enc
def detect_encoding(readline):
"""
The detect_encoding() function is used to detect the encoding that should
be used to decode a Python source file. It requires one argument, readline,
in the same way as the tokenize() generator.
It will call readline a maximum of twice, and return the encoding used
(as a string) and a list of any lines (left as bytes) it has read
in.
It detects the encoding from the presence of a utf-8 bom or an encoding
cookie as specified in pep-0263. If both a bom and a cookie are present, but
disagree, a SyntaxError will be raised. If the encoding cookie is an invalid
charset, raise a SyntaxError. Note that if a utf-8 bom is found,
'utf-8-sig' is returned.
If no encoding is specified, then the default of 'utf-8' will be returned.
"""
bom_found = False
encoding = None
default = 'utf-8'
def read_or_stop():
try:
return readline()
except StopIteration:
return bytes()
def find_cookie(line):
try:
line_string = line.decode('ascii')
except UnicodeDecodeError:
return None
match = cookie_re.match(line_string)
if not match:
return None
encoding = _get_normal_name(match.group(1))
try:
codec = lookup(encoding)
except LookupError:
# This behaviour mimics the Python interpreter
raise SyntaxError("unknown encoding: " + encoding)
if bom_found:
if codec.name != 'utf-8':
# This behaviour mimics the Python interpreter
raise SyntaxError('encoding problem: utf-8')
encoding += '-sig'
return encoding
first = read_or_stop()
if first.startswith(BOM_UTF8):
bom_found = True
first = first[3:]
default = 'utf-8-sig'
if not first:
return default, []
encoding = find_cookie(first)
if encoding:
return encoding, [first]
if not blank_re.match(first):
return default, [first]
second = read_or_stop()
if not second:
return default, [first]
encoding = find_cookie(second)
if encoding:
return encoding, [first, second]
return default, [first, second]
def untokenize(iterable):
"""Transform tokens back into Python source code.
Each element returned by the iterable must be a token sequence
with at least two elements, a token number and token value. If
only two tokens are passed, the resulting output is poor.
Round-trip invariant for full input:
Untokenized source will match input source exactly
Round-trip invariant for limited intput:
# Output text will tokenize the back to the input
t1 = [tok[:2] for tok in generate_tokens(f.readline)]
newcode = untokenize(t1)
readline = iter(newcode.splitlines(1)).next
t2 = [tok[:2] for tokin generate_tokens(readline)]
assert t1 == t2
"""
ut = Untokenizer()
return ut.untokenize(iterable)
def generate_tokens(readline):
"""
The generate_tokens() generator requires one argument, readline, which
must be a callable object which provides the same interface as the
readline() method of built-in file objects. Each call to the function
should return one line of input as a string. Alternately, readline
can be a callable function terminating with StopIteration:
readline = open(myfile).next # Example of alternate readline
The generator produces 5-tuples with these members: the token type; the
token string; a 2-tuple (srow, scol) of ints specifying the row and
column where the token begins in the source; a 2-tuple (erow, ecol) of
ints specifying the row and column where the token ends in the source;
and the line on which the token was found. The line passed is the
logical line; continuation lines are included.
"""
lnum = parenlev = continued = 0
namechars, numchars = string.ascii_letters + '_', '0123456789'
contstr, needcont = '', 0
contline = None
indents = [0]
# 'stashed' and 'async_*' are used for async/await parsing
stashed = None
async_def = False
async_def_indent = 0
async_def_nl = False
while 1: # loop over lines in stream
try:
line = readline()
except StopIteration:
line = ''
lnum = lnum + 1
pos, max = 0, len(line)
if contstr: # continued string
if not line:
raise TokenError("EOF in multi-line string", strstart)
endmatch = endprog.match(line)
if endmatch:
pos = end = endmatch.end(0)
yield (STRING, contstr + line[:end],
strstart, (lnum, end), contline + line)
contstr, needcont = '', 0
contline = None
elif needcont and line[-2:] != '\\\n' and line[-3:] != '\\\r\n':
yield (ERRORTOKEN, contstr + line,
strstart, (lnum, len(line)), contline)
contstr = ''
contline = None
continue
else:
contstr = contstr + line
contline = contline + line
continue
elif parenlev == 0 and not continued: # new statement
if not line: break
column = 0
while pos < max: # measure leading whitespace
if line[pos] == ' ': column = column + 1
elif line[pos] == '\t': column = (column//tabsize + 1)*tabsize
elif line[pos] == '\f': column = 0
else: break
pos = pos + 1
if pos == max: break
if stashed:
yield stashed
stashed = None
if line[pos] in '#\r\n': # skip comments or blank lines
if line[pos] == '#':
comment_token = line[pos:].rstrip('\r\n')
nl_pos = pos + len(comment_token)
yield (COMMENT, comment_token,
(lnum, pos), (lnum, pos + len(comment_token)), line)
yield (NL, line[nl_pos:],
(lnum, nl_pos), (lnum, len(line)), line)
else:
yield ((NL, COMMENT)[line[pos] == '#'], line[pos:],
(lnum, pos), (lnum, len(line)), line)
continue
if column > indents[-1]: # count indents or dedents
indents.append(column)
yield (INDENT, line[:pos], (lnum, 0), (lnum, pos), line)
while column < indents[-1]:
if column not in indents:
raise IndentationError(
"unindent does not match any outer indentation level",
("<tokenize>", lnum, pos, line))
indents = indents[:-1]
if async_def and async_def_indent >= indents[-1]:
async_def = False
async_def_nl = False
async_def_indent = 0
yield (DEDENT, '', (lnum, pos), (lnum, pos), line)
if async_def and async_def_nl and async_def_indent >= indents[-1]:
async_def = False
async_def_nl = False
async_def_indent = 0
else: # continued statement
if not line:
raise TokenError("EOF in multi-line statement", (lnum, 0))
continued = 0
while pos < max:
pseudomatch = pseudoprog.match(line, pos)
if pseudomatch: # scan for tokens
start, end = pseudomatch.span(1)
spos, epos, pos = (lnum, start), (lnum, end), end
token, initial = line[start:end], line[start]
if initial in numchars or \
(initial == '.' and token != '.'): # ordinary number
yield (NUMBER, token, spos, epos, line)
elif initial in '\r\n':
newline = NEWLINE
if parenlev > 0:
newline = NL
elif async_def:
async_def_nl = True
if stashed:
yield stashed
stashed = None
yield (newline, token, spos, epos, line)
elif initial == '#':
assert not token.endswith("\n")
if stashed:
yield stashed
stashed = None
yield (COMMENT, token, spos, epos, line)
elif token in triple_quoted:
endprog = endprogs[token]
endmatch = endprog.match(line, pos)
if endmatch: # all on one line
pos = endmatch.end(0)
token = line[start:pos]
if stashed:
yield stashed
stashed = None
yield (STRING, token, spos, (lnum, pos), line)
else:
strstart = (lnum, start) # multiple lines
contstr = line[start:]
contline = line
break
elif initial in single_quoted or \
token[:2] in single_quoted or \
token[:3] in single_quoted:
if token[-1] == '\n': # continued string
strstart = (lnum, start)
endprog = (endprogs[initial] or endprogs[token[1]] or
endprogs[token[2]])
contstr, needcont = line[start:], 1
contline = line
break
else: # ordinary string
if stashed:
yield stashed
stashed = None
yield (STRING, token, spos, epos, line)
elif initial in namechars: # ordinary name
if token in ('async', 'await'):
if async_def:
yield (ASYNC if token == 'async' else AWAIT,
token, spos, epos, line)
continue
tok = (NAME, token, spos, epos, line)
if token == 'async' and not stashed:
stashed = tok
continue
if token == 'def':
if (stashed
and stashed[0] == NAME
and stashed[1] == 'async'):
async_def = True
async_def_indent = indents[-1]
yield (ASYNC, stashed[1],
stashed[2], stashed[3],
stashed[4])
stashed = None
if stashed:
yield stashed
stashed = None
yield tok
elif initial == '\\': # continued stmt
# This yield is new; needed for better idempotency:
if stashed:
yield stashed
stashed = None
yield (NL, token, spos, (lnum, pos), line)
continued = 1
else:
if initial in '([{': parenlev = parenlev + 1
elif initial in ')]}': parenlev = parenlev - 1
if stashed:
yield stashed
stashed = None
yield (OP, token, spos, epos, line)
else:
yield (ERRORTOKEN, line[pos],
(lnum, pos), (lnum, pos+1), line)
pos = pos + 1
if stashed:
yield stashed
stashed = None
for indent in indents[1:]: # pop remaining indent levels
yield (DEDENT, '', (lnum, 0), (lnum, 0), '')
yield (ENDMARKER, '', (lnum, 0), (lnum, 0), '')
if __name__ == '__main__': # testing
import sys
if len(sys.argv) > 1: tokenize(open(sys.argv[1]).readline)
else: tokenize(sys.stdin.readline)
pgen2/grammar.py 0000644 00000014675 15053244155 0007600 0 ustar 00 # Copyright 2004-2005 Elemental Security, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""This module defines the data structures used to represent a grammar.
These are a bit arcane because they are derived from the data
structures used by Python's 'pgen' parser generator.
There's also a table here mapping operators to their names in the
token module; the Python tokenize module reports all operators as the
fallback token code OP, but the parser needs the actual token code.
"""
# Python imports
import collections
import pickle
# Local imports
from . import token, tokenize
class Grammar(object):
"""Pgen parsing tables conversion class.
Once initialized, this class supplies the grammar tables for the
parsing engine implemented by parse.py. The parsing engine
accesses the instance variables directly. The class here does not
provide initialization of the tables; several subclasses exist to
do this (see the conv and pgen modules).
The load() method reads the tables from a pickle file, which is
much faster than the other ways offered by subclasses. The pickle
file is written by calling dump() (after loading the grammar
tables using a subclass). The report() method prints a readable
representation of the tables to stdout, for debugging.
The instance variables are as follows:
symbol2number -- a dict mapping symbol names to numbers. Symbol
numbers are always 256 or higher, to distinguish
them from token numbers, which are between 0 and
255 (inclusive).
number2symbol -- a dict mapping numbers to symbol names;
these two are each other's inverse.
states -- a list of DFAs, where each DFA is a list of
states, each state is a list of arcs, and each
arc is a (i, j) pair where i is a label and j is
a state number. The DFA number is the index into
this list. (This name is slightly confusing.)
Final states are represented by a special arc of
the form (0, j) where j is its own state number.
dfas -- a dict mapping symbol numbers to (DFA, first)
pairs, where DFA is an item from the states list
above, and first is a set of tokens that can
begin this grammar rule (represented by a dict
whose values are always 1).
labels -- a list of (x, y) pairs where x is either a token
number or a symbol number, and y is either None
or a string; the strings are keywords. The label
number is the index in this list; label numbers
are used to mark state transitions (arcs) in the
DFAs.
start -- the number of the grammar's start symbol.
keywords -- a dict mapping keyword strings to arc labels.
tokens -- a dict mapping token numbers to arc labels.
"""
def __init__(self):
self.symbol2number = {}
self.number2symbol = {}
self.states = []
self.dfas = {}
self.labels = [(0, "EMPTY")]
self.keywords = {}
self.tokens = {}
self.symbol2label = {}
self.start = 256
def dump(self, filename):
"""Dump the grammar tables to a pickle file.
dump() recursively changes all dict to OrderedDict, so the pickled file
is not exactly the same as what was passed in to dump(). load() uses the
pickled file to create the tables, but only changes OrderedDict to dict
at the top level; it does not recursively change OrderedDict to dict.
So, the loaded tables are different from the original tables that were
passed to load() in that some of the OrderedDict (from the pickled file)
are not changed back to dict. For parsing, this has no effect on
performance because OrderedDict uses dict's __getitem__ with nothing in
between.
"""
with open(filename, "wb") as f:
d = _make_deterministic(self.__dict__)
pickle.dump(d, f, 2)
def load(self, filename):
"""Load the grammar tables from a pickle file."""
with open(filename, "rb") as f:
d = pickle.load(f)
self.__dict__.update(d)
def loads(self, pkl):
"""Load the grammar tables from a pickle bytes object."""
self.__dict__.update(pickle.loads(pkl))
def copy(self):
"""
Copy the grammar.
"""
new = self.__class__()
for dict_attr in ("symbol2number", "number2symbol", "dfas", "keywords",
"tokens", "symbol2label"):
setattr(new, dict_attr, getattr(self, dict_attr).copy())
new.labels = self.labels[:]
new.states = self.states[:]
new.start = self.start
return new
def report(self):
"""Dump the grammar tables to standard output, for debugging."""
from pprint import pprint
print("s2n")
pprint(self.symbol2number)
print("n2s")
pprint(self.number2symbol)
print("states")
pprint(self.states)
print("dfas")
pprint(self.dfas)
print("labels")
pprint(self.labels)
print("start", self.start)
def _make_deterministic(top):
if isinstance(top, dict):
return collections.OrderedDict(
sorted(((k, _make_deterministic(v)) for k, v in top.items())))
if isinstance(top, list):
return [_make_deterministic(e) for e in top]
if isinstance(top, tuple):
return tuple(_make_deterministic(e) for e in top)
return top
# Map from operator to number (since tokenize doesn't do this)
opmap_raw = """
( LPAR
) RPAR
[ LSQB
] RSQB
: COLON
, COMMA
; SEMI
+ PLUS
- MINUS
* STAR
/ SLASH
| VBAR
& AMPER
< LESS
> GREATER
= EQUAL
. DOT
% PERCENT
` BACKQUOTE
{ LBRACE
} RBRACE
@ AT
@= ATEQUAL
== EQEQUAL
!= NOTEQUAL
<> NOTEQUAL
<= LESSEQUAL
>= GREATEREQUAL
~ TILDE
^ CIRCUMFLEX
<< LEFTSHIFT
>> RIGHTSHIFT
** DOUBLESTAR
+= PLUSEQUAL
-= MINEQUAL
*= STAREQUAL
/= SLASHEQUAL
%= PERCENTEQUAL
&= AMPEREQUAL
|= VBAREQUAL
^= CIRCUMFLEXEQUAL
<<= LEFTSHIFTEQUAL
>>= RIGHTSHIFTEQUAL
**= DOUBLESTAREQUAL
// DOUBLESLASH
//= DOUBLESLASHEQUAL
-> RARROW
"""
opmap = {}
for line in opmap_raw.splitlines():
if line:
op, name = line.split()
opmap[op] = getattr(token, name)
pgen2/parse.py 0000644 00000017565 15053244155 0007265 0 ustar 00 # Copyright 2004-2005 Elemental Security, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Parser engine for the grammar tables generated by pgen.
The grammar table must be loaded first.
See Parser/parser.c in the Python distribution for additional info on
how this parsing engine works.
"""
# Local imports
from . import token
class ParseError(Exception):
"""Exception to signal the parser is stuck."""
def __init__(self, msg, type, value, context):
Exception.__init__(self, "%s: type=%r, value=%r, context=%r" %
(msg, type, value, context))
self.msg = msg
self.type = type
self.value = value
self.context = context
class Parser(object):
"""Parser engine.
The proper usage sequence is:
p = Parser(grammar, [converter]) # create instance
p.setup([start]) # prepare for parsing
<for each input token>:
if p.addtoken(...): # parse a token; may raise ParseError
break
root = p.rootnode # root of abstract syntax tree
A Parser instance may be reused by calling setup() repeatedly.
A Parser instance contains state pertaining to the current token
sequence, and should not be used concurrently by different threads
to parse separate token sequences.
See driver.py for how to get input tokens by tokenizing a file or
string.
Parsing is complete when addtoken() returns True; the root of the
abstract syntax tree can then be retrieved from the rootnode
instance variable. When a syntax error occurs, addtoken() raises
the ParseError exception. There is no error recovery; the parser
cannot be used after a syntax error was reported (but it can be
reinitialized by calling setup()).
"""
def __init__(self, grammar, convert=None):
"""Constructor.
The grammar argument is a grammar.Grammar instance; see the
grammar module for more information.
The parser is not ready yet for parsing; you must call the
setup() method to get it started.
The optional convert argument is a function mapping concrete
syntax tree nodes to abstract syntax tree nodes. If not
given, no conversion is done and the syntax tree produced is
the concrete syntax tree. If given, it must be a function of
two arguments, the first being the grammar (a grammar.Grammar
instance), and the second being the concrete syntax tree node
to be converted. The syntax tree is converted from the bottom
up.
A concrete syntax tree node is a (type, value, context, nodes)
tuple, where type is the node type (a token or symbol number),
value is None for symbols and a string for tokens, context is
None or an opaque value used for error reporting (typically a
(lineno, offset) pair), and nodes is a list of children for
symbols, and None for tokens.
An abstract syntax tree node may be anything; this is entirely
up to the converter function.
"""
self.grammar = grammar
self.convert = convert or (lambda grammar, node: node)
def setup(self, start=None):
"""Prepare for parsing.
This *must* be called before starting to parse.
The optional argument is an alternative start symbol; it
defaults to the grammar's start symbol.
You can use a Parser instance to parse any number of programs;
each time you call setup() the parser is reset to an initial
state determined by the (implicit or explicit) start symbol.
"""
if start is None:
start = self.grammar.start
# Each stack entry is a tuple: (dfa, state, node).
# A node is a tuple: (type, value, context, children),
# where children is a list of nodes or None, and context may be None.
newnode = (start, None, None, [])
stackentry = (self.grammar.dfas[start], 0, newnode)
self.stack = [stackentry]
self.rootnode = None
self.used_names = set() # Aliased to self.rootnode.used_names in pop()
def addtoken(self, type, value, context):
"""Add a token; return True iff this is the end of the program."""
# Map from token to label
ilabel = self.classify(type, value, context)
# Loop until the token is shifted; may raise exceptions
while True:
dfa, state, node = self.stack[-1]
states, first = dfa
arcs = states[state]
# Look for a state with this label
for i, newstate in arcs:
t, v = self.grammar.labels[i]
if ilabel == i:
# Look it up in the list of labels
assert t < 256
# Shift a token; we're done with it
self.shift(type, value, newstate, context)
# Pop while we are in an accept-only state
state = newstate
while states[state] == [(0, state)]:
self.pop()
if not self.stack:
# Done parsing!
return True
dfa, state, node = self.stack[-1]
states, first = dfa
# Done with this token
return False
elif t >= 256:
# See if it's a symbol and if we're in its first set
itsdfa = self.grammar.dfas[t]
itsstates, itsfirst = itsdfa
if ilabel in itsfirst:
# Push a symbol
self.push(t, self.grammar.dfas[t], newstate, context)
break # To continue the outer while loop
else:
if (0, state) in arcs:
# An accepting state, pop it and try something else
self.pop()
if not self.stack:
# Done parsing, but another token is input
raise ParseError("too much input",
type, value, context)
else:
# No success finding a transition
raise ParseError("bad input", type, value, context)
def classify(self, type, value, context):
"""Turn a token into a label. (Internal)"""
if type == token.NAME:
# Keep a listing of all used names
self.used_names.add(value)
# Check for reserved words
ilabel = self.grammar.keywords.get(value)
if ilabel is not None:
return ilabel
ilabel = self.grammar.tokens.get(type)
if ilabel is None:
raise ParseError("bad token", type, value, context)
return ilabel
def shift(self, type, value, newstate, context):
"""Shift a token. (Internal)"""
dfa, state, node = self.stack[-1]
newnode = (type, value, context, None)
newnode = self.convert(self.grammar, newnode)
if newnode is not None:
node[-1].append(newnode)
self.stack[-1] = (dfa, newstate, node)
def push(self, type, newdfa, newstate, context):
"""Push a nonterminal. (Internal)"""
dfa, state, node = self.stack[-1]
newnode = (type, None, context, [])
self.stack[-1] = (dfa, newstate, node)
self.stack.append((newdfa, 0, newnode))
def pop(self):
"""Pop a nonterminal. (Internal)"""
popdfa, popstate, popnode = self.stack.pop()
newnode = self.convert(self.grammar, popnode)
if newnode is not None:
if self.stack:
dfa, state, node = self.stack[-1]
node[-1].append(newnode)
else:
self.rootnode = newnode
self.rootnode.used_names = self.used_names
pgen2/driver.py 0000644 00000013614 15053244155 0007435 0 ustar 00 # Copyright 2004-2005 Elemental Security, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
# Modifications:
# Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Parser driver.
This provides a high-level interface to parse a file into a syntax tree.
"""
__author__ = "Guido van Rossum <guido@python.org>"
__all__ = ["Driver", "load_grammar"]
# Python imports
import codecs
import io
import os
import logging
import pkgutil
import sys
# Pgen imports
from . import grammar, parse, token, tokenize, pgen
class Driver(object):
def __init__(self, grammar, convert=None, logger=None):
self.grammar = grammar
if logger is None:
logger = logging.getLogger()
self.logger = logger
self.convert = convert
def parse_tokens(self, tokens, debug=False):
"""Parse a series of tokens and return the syntax tree."""
# XXX Move the prefix computation into a wrapper around tokenize.
p = parse.Parser(self.grammar, self.convert)
p.setup()
lineno = 1
column = 0
type = value = start = end = line_text = None
prefix = ""
for quintuple in tokens:
type, value, start, end, line_text = quintuple
if start != (lineno, column):
assert (lineno, column) <= start, ((lineno, column), start)
s_lineno, s_column = start
if lineno < s_lineno:
prefix += "\n" * (s_lineno - lineno)
lineno = s_lineno
column = 0
if column < s_column:
prefix += line_text[column:s_column]
column = s_column
if type in (tokenize.COMMENT, tokenize.NL):
prefix += value
lineno, column = end
if value.endswith("\n"):
lineno += 1
column = 0
continue
if type == token.OP:
type = grammar.opmap[value]
if debug:
self.logger.debug("%s %r (prefix=%r)",
token.tok_name[type], value, prefix)
if p.addtoken(type, value, (prefix, start)):
if debug:
self.logger.debug("Stop.")
break
prefix = ""
lineno, column = end
if value.endswith("\n"):
lineno += 1
column = 0
else:
# We never broke out -- EOF is too soon (how can this happen???)
raise parse.ParseError("incomplete input",
type, value, (prefix, start))
return p.rootnode
def parse_stream_raw(self, stream, debug=False):
"""Parse a stream and return the syntax tree."""
tokens = tokenize.generate_tokens(stream.readline)
return self.parse_tokens(tokens, debug)
def parse_stream(self, stream, debug=False):
"""Parse a stream and return the syntax tree."""
return self.parse_stream_raw(stream, debug)
def parse_file(self, filename, encoding=None, debug=False):
"""Parse a file and return the syntax tree."""
stream = codecs.open(filename, "r", encoding)
try:
return self.parse_stream(stream, debug)
finally:
stream.close()
def parse_string(self, text, debug=False):
"""Parse a string and return the syntax tree."""
tokens = tokenize.generate_tokens(io.StringIO(text).readline)
return self.parse_tokens(tokens, debug)
def _generate_pickle_name(gt):
head, tail = os.path.splitext(gt)
if tail == ".txt":
tail = ""
return head + tail + ".".join(map(str, sys.version_info)) + ".pickle"
def load_grammar(gt="Grammar.txt", gp=None,
save=True, force=False, logger=None):
"""Load the grammar (maybe from a pickle)."""
if logger is None:
logger = logging.getLogger()
gp = _generate_pickle_name(gt) if gp is None else gp
if force or not _newer(gp, gt):
logger.info("Generating grammar tables from %s", gt)
g = pgen.generate_grammar(gt)
if save:
logger.info("Writing grammar tables to %s", gp)
try:
g.dump(gp)
except OSError as e:
logger.info("Writing failed: %s", e)
else:
g = grammar.Grammar()
g.load(gp)
return g
def _newer(a, b):
"""Inquire whether file a was written since file b."""
if not os.path.exists(a):
return False
if not os.path.exists(b):
return True
return os.path.getmtime(a) >= os.path.getmtime(b)
def load_packaged_grammar(package, grammar_source):
"""Normally, loads a pickled grammar by doing
pkgutil.get_data(package, pickled_grammar)
where *pickled_grammar* is computed from *grammar_source* by adding the
Python version and using a ``.pickle`` extension.
However, if *grammar_source* is an extant file, load_grammar(grammar_source)
is called instead. This facilitates using a packaged grammar file when needed
but preserves load_grammar's automatic regeneration behavior when possible.
"""
if os.path.isfile(grammar_source):
return load_grammar(grammar_source)
pickled_name = _generate_pickle_name(os.path.basename(grammar_source))
data = pkgutil.get_data(package, pickled_name)
g = grammar.Grammar()
g.loads(data)
return g
def main(*args):
"""Main program, when run as a script: produce grammar pickle files.
Calls load_grammar for each argument, a path to a grammar text file.
"""
if not args:
args = sys.argv[1:]
logging.basicConfig(level=logging.INFO, stream=sys.stdout,
format='%(message)s')
for gt in args:
load_grammar(gt, save=True, force=True)
return True
if __name__ == "__main__":
sys.exit(int(not main()))
pgen2/__init__.py 0000644 00000000217 15053244155 0007674 0 ustar 00 # Copyright 2004-2005 Elemental Security, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""The pgen2 package."""
pgen2/conv.py 0000644 00000022652 15053244155 0007111 0 ustar 00 # Copyright 2004-2005 Elemental Security, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Convert graminit.[ch] spit out by pgen to Python code.
Pgen is the Python parser generator. It is useful to quickly create a
parser from a grammar file in Python's grammar notation. But I don't
want my parsers to be written in C (yet), so I'm translating the
parsing tables to Python data structures and writing a Python parse
engine.
Note that the token numbers are constants determined by the standard
Python tokenizer. The standard token module defines these numbers and
their names (the names are not used much). The token numbers are
hardcoded into the Python tokenizer and into pgen. A Python
implementation of the Python tokenizer is also available, in the
standard tokenize module.
On the other hand, symbol numbers (representing the grammar's
non-terminals) are assigned by pgen based on the actual grammar
input.
Note: this module is pretty much obsolete; the pgen module generates
equivalent grammar tables directly from the Grammar.txt input file
without having to invoke the Python pgen C program.
"""
# Python imports
import re
# Local imports
from pgen2 import grammar, token
class Converter(grammar.Grammar):
"""Grammar subclass that reads classic pgen output files.
The run() method reads the tables as produced by the pgen parser
generator, typically contained in two C files, graminit.h and
graminit.c. The other methods are for internal use only.
See the base class for more documentation.
"""
def run(self, graminit_h, graminit_c):
"""Load the grammar tables from the text files written by pgen."""
self.parse_graminit_h(graminit_h)
self.parse_graminit_c(graminit_c)
self.finish_off()
def parse_graminit_h(self, filename):
"""Parse the .h file written by pgen. (Internal)
This file is a sequence of #define statements defining the
nonterminals of the grammar as numbers. We build two tables
mapping the numbers to names and back.
"""
try:
f = open(filename)
except OSError as err:
print("Can't open %s: %s" % (filename, err))
return False
self.symbol2number = {}
self.number2symbol = {}
lineno = 0
for line in f:
lineno += 1
mo = re.match(r"^#define\s+(\w+)\s+(\d+)$", line)
if not mo and line.strip():
print("%s(%s): can't parse %s" % (filename, lineno,
line.strip()))
else:
symbol, number = mo.groups()
number = int(number)
assert symbol not in self.symbol2number
assert number not in self.number2symbol
self.symbol2number[symbol] = number
self.number2symbol[number] = symbol
return True
def parse_graminit_c(self, filename):
"""Parse the .c file written by pgen. (Internal)
The file looks as follows. The first two lines are always this:
#include "pgenheaders.h"
#include "grammar.h"
After that come four blocks:
1) one or more state definitions
2) a table defining dfas
3) a table defining labels
4) a struct defining the grammar
A state definition has the following form:
- one or more arc arrays, each of the form:
static arc arcs_<n>_<m>[<k>] = {
{<i>, <j>},
...
};
- followed by a state array, of the form:
static state states_<s>[<t>] = {
{<k>, arcs_<n>_<m>},
...
};
"""
try:
f = open(filename)
except OSError as err:
print("Can't open %s: %s" % (filename, err))
return False
# The code below essentially uses f's iterator-ness!
lineno = 0
# Expect the two #include lines
lineno, line = lineno+1, next(f)
assert line == '#include "pgenheaders.h"\n', (lineno, line)
lineno, line = lineno+1, next(f)
assert line == '#include "grammar.h"\n', (lineno, line)
# Parse the state definitions
lineno, line = lineno+1, next(f)
allarcs = {}
states = []
while line.startswith("static arc "):
while line.startswith("static arc "):
mo = re.match(r"static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$",
line)
assert mo, (lineno, line)
n, m, k = list(map(int, mo.groups()))
arcs = []
for _ in range(k):
lineno, line = lineno+1, next(f)
mo = re.match(r"\s+{(\d+), (\d+)},$", line)
assert mo, (lineno, line)
i, j = list(map(int, mo.groups()))
arcs.append((i, j))
lineno, line = lineno+1, next(f)
assert line == "};\n", (lineno, line)
allarcs[(n, m)] = arcs
lineno, line = lineno+1, next(f)
mo = re.match(r"static state states_(\d+)\[(\d+)\] = {$", line)
assert mo, (lineno, line)
s, t = list(map(int, mo.groups()))
assert s == len(states), (lineno, line)
state = []
for _ in range(t):
lineno, line = lineno+1, next(f)
mo = re.match(r"\s+{(\d+), arcs_(\d+)_(\d+)},$", line)
assert mo, (lineno, line)
k, n, m = list(map(int, mo.groups()))
arcs = allarcs[n, m]
assert k == len(arcs), (lineno, line)
state.append(arcs)
states.append(state)
lineno, line = lineno+1, next(f)
assert line == "};\n", (lineno, line)
lineno, line = lineno+1, next(f)
self.states = states
# Parse the dfas
dfas = {}
mo = re.match(r"static dfa dfas\[(\d+)\] = {$", line)
assert mo, (lineno, line)
ndfas = int(mo.group(1))
for i in range(ndfas):
lineno, line = lineno+1, next(f)
mo = re.match(r'\s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$',
line)
assert mo, (lineno, line)
symbol = mo.group(2)
number, x, y, z = list(map(int, mo.group(1, 3, 4, 5)))
assert self.symbol2number[symbol] == number, (lineno, line)
assert self.number2symbol[number] == symbol, (lineno, line)
assert x == 0, (lineno, line)
state = states[z]
assert y == len(state), (lineno, line)
lineno, line = lineno+1, next(f)
mo = re.match(r'\s+("(?:\\\d\d\d)*")},$', line)
assert mo, (lineno, line)
first = {}
rawbitset = eval(mo.group(1))
for i, c in enumerate(rawbitset):
byte = ord(c)
for j in range(8):
if byte & (1<<j):
first[i*8 + j] = 1
dfas[number] = (state, first)
lineno, line = lineno+1, next(f)
assert line == "};\n", (lineno, line)
self.dfas = dfas
# Parse the labels
labels = []
lineno, line = lineno+1, next(f)
mo = re.match(r"static label labels\[(\d+)\] = {$", line)
assert mo, (lineno, line)
nlabels = int(mo.group(1))
for i in range(nlabels):
lineno, line = lineno+1, next(f)
mo = re.match(r'\s+{(\d+), (0|"\w+")},$', line)
assert mo, (lineno, line)
x, y = mo.groups()
x = int(x)
if y == "0":
y = None
else:
y = eval(y)
labels.append((x, y))
lineno, line = lineno+1, next(f)
assert line == "};\n", (lineno, line)
self.labels = labels
# Parse the grammar struct
lineno, line = lineno+1, next(f)
assert line == "grammar _PyParser_Grammar = {\n", (lineno, line)
lineno, line = lineno+1, next(f)
mo = re.match(r"\s+(\d+),$", line)
assert mo, (lineno, line)
ndfas = int(mo.group(1))
assert ndfas == len(self.dfas)
lineno, line = lineno+1, next(f)
assert line == "\tdfas,\n", (lineno, line)
lineno, line = lineno+1, next(f)
mo = re.match(r"\s+{(\d+), labels},$", line)
assert mo, (lineno, line)
nlabels = int(mo.group(1))
assert nlabels == len(self.labels), (lineno, line)
lineno, line = lineno+1, next(f)
mo = re.match(r"\s+(\d+)$", line)
assert mo, (lineno, line)
start = int(mo.group(1))
assert start in self.number2symbol, (lineno, line)
self.start = start
lineno, line = lineno+1, next(f)
assert line == "};\n", (lineno, line)
try:
lineno, line = lineno+1, next(f)
except StopIteration:
pass
else:
assert 0, (lineno, line)
def finish_off(self):
"""Create additional useful structures. (Internal)."""
self.keywords = {} # map from keyword strings to arc labels
self.tokens = {} # map from numeric token values to arc labels
for ilabel, (type, value) in enumerate(self.labels):
if type == token.NAME and value is not None:
self.keywords[value] = ilabel
elif value is None:
self.tokens[type] = ilabel
__init__.py 0000644 00000000007 15053244155 0006656 0 ustar 00 #empty
btm_matcher.py 0000644 00000015261 15053244155 0007414 0 ustar 00 """A bottom-up tree matching algorithm implementation meant to speed
up 2to3's matching process. After the tree patterns are reduced to
their rarest linear path, a linear Aho-Corasick automaton is
created. The linear automaton traverses the linear paths from the
leaves to the root of the AST and returns a set of nodes for further
matching. This reduces significantly the number of candidate nodes."""
__author__ = "George Boutsioukis <gboutsioukis@gmail.com>"
import logging
import itertools
from collections import defaultdict
from . import pytree
from .btm_utils import reduce_tree
class BMNode(object):
"""Class for a node of the Aho-Corasick automaton used in matching"""
count = itertools.count()
def __init__(self):
self.transition_table = {}
self.fixers = []
self.id = next(BMNode.count)
self.content = ''
class BottomMatcher(object):
"""The main matcher class. After instantiating the patterns should
be added using the add_fixer method"""
def __init__(self):
self.match = set()
self.root = BMNode()
self.nodes = [self.root]
self.fixers = []
self.logger = logging.getLogger("RefactoringTool")
def add_fixer(self, fixer):
"""Reduces a fixer's pattern tree to a linear path and adds it
to the matcher(a common Aho-Corasick automaton). The fixer is
appended on the matching states and called when they are
reached"""
self.fixers.append(fixer)
tree = reduce_tree(fixer.pattern_tree)
linear = tree.get_linear_subpattern()
match_nodes = self.add(linear, start=self.root)
for match_node in match_nodes:
match_node.fixers.append(fixer)
def add(self, pattern, start):
"Recursively adds a linear pattern to the AC automaton"
#print("adding pattern", pattern, "to", start)
if not pattern:
#print("empty pattern")
return [start]
if isinstance(pattern[0], tuple):
#alternatives
#print("alternatives")
match_nodes = []
for alternative in pattern[0]:
#add all alternatives, and add the rest of the pattern
#to each end node
end_nodes = self.add(alternative, start=start)
for end in end_nodes:
match_nodes.extend(self.add(pattern[1:], end))
return match_nodes
else:
#single token
#not last
if pattern[0] not in start.transition_table:
#transition did not exist, create new
next_node = BMNode()
start.transition_table[pattern[0]] = next_node
else:
#transition exists already, follow
next_node = start.transition_table[pattern[0]]
if pattern[1:]:
end_nodes = self.add(pattern[1:], start=next_node)
else:
end_nodes = [next_node]
return end_nodes
def run(self, leaves):
"""The main interface with the bottom matcher. The tree is
traversed from the bottom using the constructed
automaton. Nodes are only checked once as the tree is
retraversed. When the automaton fails, we give it one more
shot(in case the above tree matches as a whole with the
rejected leaf), then we break for the next leaf. There is the
special case of multiple arguments(see code comments) where we
recheck the nodes
Args:
The leaves of the AST tree to be matched
Returns:
A dictionary of node matches with fixers as the keys
"""
current_ac_node = self.root
results = defaultdict(list)
for leaf in leaves:
current_ast_node = leaf
while current_ast_node:
current_ast_node.was_checked = True
for child in current_ast_node.children:
# multiple statements, recheck
if isinstance(child, pytree.Leaf) and child.value == ";":
current_ast_node.was_checked = False
break
if current_ast_node.type == 1:
#name
node_token = current_ast_node.value
else:
node_token = current_ast_node.type
if node_token in current_ac_node.transition_table:
#token matches
current_ac_node = current_ac_node.transition_table[node_token]
for fixer in current_ac_node.fixers:
if not fixer in results:
results[fixer] = []
results[fixer].append(current_ast_node)
else:
#matching failed, reset automaton
current_ac_node = self.root
if (current_ast_node.parent is not None
and current_ast_node.parent.was_checked):
#the rest of the tree upwards has been checked, next leaf
break
#recheck the rejected node once from the root
if node_token in current_ac_node.transition_table:
#token matches
current_ac_node = current_ac_node.transition_table[node_token]
for fixer in current_ac_node.fixers:
if not fixer in results.keys():
results[fixer] = []
results[fixer].append(current_ast_node)
current_ast_node = current_ast_node.parent
return results
def print_ac(self):
"Prints a graphviz diagram of the BM automaton(for debugging)"
print("digraph g{")
def print_node(node):
for subnode_key in node.transition_table.keys():
subnode = node.transition_table[subnode_key]
print("%d -> %d [label=%s] //%s" %
(node.id, subnode.id, type_repr(subnode_key), str(subnode.fixers)))
if subnode_key == 1:
print(subnode.content)
print_node(subnode)
print_node(self.root)
print("}")
# taken from pytree.py for debugging; only used by print_ac
_type_reprs = {}
def type_repr(type_num):
global _type_reprs
if not _type_reprs:
from .pygram import python_symbols
# printing tokens is possible but not as useful
# from .pgen2 import token // token.__dict__.items():
for name, val in python_symbols.__dict__.items():
if type(val) == int: _type_reprs[val] = name
return _type_reprs.setdefault(type_num, type_num)
Grammar.txt 0000644 00000014642 15053244155 0006706 0 ustar 00 # Grammar for 2to3. This grammar supports Python 2.x and 3.x.
# NOTE WELL: You should also follow all the steps listed at
# https://devguide.python.org/grammar/
# Start symbols for the grammar:
# file_input is a module or sequence of commands read from an input file;
# single_input is a single interactive statement;
# eval_input is the input for the eval() and input() functions.
# NB: compound_stmt in single_input is followed by extra NEWLINE!
file_input: (NEWLINE | stmt)* ENDMARKER
single_input: NEWLINE | simple_stmt | compound_stmt NEWLINE
eval_input: testlist NEWLINE* ENDMARKER
decorator: '@' dotted_name [ '(' [arglist] ')' ] NEWLINE
decorators: decorator+
decorated: decorators (classdef | funcdef | async_funcdef)
async_funcdef: ASYNC funcdef
funcdef: 'def' NAME parameters ['->' test] ':' suite
parameters: '(' [typedargslist] ')'
typedargslist: ((tfpdef ['=' test] ',')*
('*' [tname] (',' tname ['=' test])* [',' ['**' tname [',']]] | '**' tname [','])
| tfpdef ['=' test] (',' tfpdef ['=' test])* [','])
tname: NAME [':' test]
tfpdef: tname | '(' tfplist ')'
tfplist: tfpdef (',' tfpdef)* [',']
varargslist: ((vfpdef ['=' test] ',')*
('*' [vname] (',' vname ['=' test])* [',' ['**' vname [',']]] | '**' vname [','])
| vfpdef ['=' test] (',' vfpdef ['=' test])* [','])
vname: NAME
vfpdef: vname | '(' vfplist ')'
vfplist: vfpdef (',' vfpdef)* [',']
stmt: simple_stmt | compound_stmt
simple_stmt: small_stmt (';' small_stmt)* [';'] NEWLINE
small_stmt: (expr_stmt | print_stmt | del_stmt | pass_stmt | flow_stmt |
import_stmt | global_stmt | exec_stmt | assert_stmt)
expr_stmt: testlist_star_expr (annassign | augassign (yield_expr|testlist) |
('=' (yield_expr|testlist_star_expr))*)
annassign: ':' test ['=' test]
testlist_star_expr: (test|star_expr) (',' (test|star_expr))* [',']
augassign: ('+=' | '-=' | '*=' | '@=' | '/=' | '%=' | '&=' | '|=' | '^=' |
'<<=' | '>>=' | '**=' | '//=')
# For normal and annotated assignments, additional restrictions enforced by the interpreter
print_stmt: 'print' ( [ test (',' test)* [','] ] |
'>>' test [ (',' test)+ [','] ] )
del_stmt: 'del' exprlist
pass_stmt: 'pass'
flow_stmt: break_stmt | continue_stmt | return_stmt | raise_stmt | yield_stmt
break_stmt: 'break'
continue_stmt: 'continue'
return_stmt: 'return' [testlist]
yield_stmt: yield_expr
raise_stmt: 'raise' [test ['from' test | ',' test [',' test]]]
import_stmt: import_name | import_from
import_name: 'import' dotted_as_names
import_from: ('from' ('.'* dotted_name | '.'+)
'import' ('*' | '(' import_as_names ')' | import_as_names))
import_as_name: NAME ['as' NAME]
dotted_as_name: dotted_name ['as' NAME]
import_as_names: import_as_name (',' import_as_name)* [',']
dotted_as_names: dotted_as_name (',' dotted_as_name)*
dotted_name: NAME ('.' NAME)*
global_stmt: ('global' | 'nonlocal') NAME (',' NAME)*
exec_stmt: 'exec' expr ['in' test [',' test]]
assert_stmt: 'assert' test [',' test]
compound_stmt: if_stmt | while_stmt | for_stmt | try_stmt | with_stmt | funcdef | classdef | decorated | async_stmt
async_stmt: ASYNC (funcdef | with_stmt | for_stmt)
if_stmt: 'if' test ':' suite ('elif' test ':' suite)* ['else' ':' suite]
while_stmt: 'while' test ':' suite ['else' ':' suite]
for_stmt: 'for' exprlist 'in' testlist ':' suite ['else' ':' suite]
try_stmt: ('try' ':' suite
((except_clause ':' suite)+
['else' ':' suite]
['finally' ':' suite] |
'finally' ':' suite))
with_stmt: 'with' with_item (',' with_item)* ':' suite
with_item: test ['as' expr]
with_var: 'as' expr
# NB compile.c makes sure that the default except clause is last
except_clause: 'except' [test [(',' | 'as') test]]
suite: simple_stmt | NEWLINE INDENT stmt+ DEDENT
# Backward compatibility cruft to support:
# [ x for x in lambda: True, lambda: False if x() ]
# even while also allowing:
# lambda x: 5 if x else 2
# (But not a mix of the two)
testlist_safe: old_test [(',' old_test)+ [',']]
old_test: or_test | old_lambdef
old_lambdef: 'lambda' [varargslist] ':' old_test
test: or_test ['if' or_test 'else' test] | lambdef
or_test: and_test ('or' and_test)*
and_test: not_test ('and' not_test)*
not_test: 'not' not_test | comparison
comparison: expr (comp_op expr)*
comp_op: '<'|'>'|'=='|'>='|'<='|'<>'|'!='|'in'|'not' 'in'|'is'|'is' 'not'
star_expr: '*' expr
expr: xor_expr ('|' xor_expr)*
xor_expr: and_expr ('^' and_expr)*
and_expr: shift_expr ('&' shift_expr)*
shift_expr: arith_expr (('<<'|'>>') arith_expr)*
arith_expr: term (('+'|'-') term)*
term: factor (('*'|'@'|'/'|'%'|'//') factor)*
factor: ('+'|'-'|'~') factor | power
power: [AWAIT] atom trailer* ['**' factor]
atom: ('(' [yield_expr|testlist_gexp] ')' |
'[' [listmaker] ']' |
'{' [dictsetmaker] '}' |
'`' testlist1 '`' |
NAME | NUMBER | STRING+ | '.' '.' '.')
listmaker: (test|star_expr) ( comp_for | (',' (test|star_expr))* [','] )
testlist_gexp: (test|star_expr) ( comp_for | (',' (test|star_expr))* [','] )
lambdef: 'lambda' [varargslist] ':' test
trailer: '(' [arglist] ')' | '[' subscriptlist ']' | '.' NAME
subscriptlist: subscript (',' subscript)* [',']
subscript: test | [test] ':' [test] [sliceop]
sliceop: ':' [test]
exprlist: (expr|star_expr) (',' (expr|star_expr))* [',']
testlist: test (',' test)* [',']
dictsetmaker: ( ((test ':' test | '**' expr)
(comp_for | (',' (test ':' test | '**' expr))* [','])) |
((test | star_expr)
(comp_for | (',' (test | star_expr))* [','])) )
classdef: 'class' NAME ['(' [arglist] ')'] ':' suite
arglist: argument (',' argument)* [',']
# "test '=' test" is really "keyword '=' test", but we have no such token.
# These need to be in a single rule to avoid grammar that is ambiguous
# to our LL(1) parser. Even though 'test' includes '*expr' in star_expr,
# we explicitly match '*' here, too, to give it proper precedence.
# Illegal combinations and orderings are blocked in ast.c:
# multiple (test comp_for) arguments are blocked; keyword unpackings
# that precede iterable unpackings are blocked; etc.
argument: ( test [comp_for] |
test '=' test |
'**' expr |
star_expr )
comp_iter: comp_for | comp_if
comp_for: [ASYNC] 'for' exprlist 'in' testlist_safe [comp_iter]
comp_if: 'if' old_test [comp_iter]
testlist1: test (',' test)*
# not used in grammar, but may appear in "node" passed from Parser to Compiler
encoding_decl: NAME
yield_expr: 'yield' [yield_arg]
yield_arg: 'from' test | testlist
Grammar3.8.17.final.0.pickle 0000644 00000035715 15053244165 0011250 0 ustar 00 ���; }�(�
symbol2number�}�(�
file_input�M �and_expr�M�and_test�M� annassign�M�arglist�M�argument�M�
arith_expr�M� assert_stmt�M�
async_funcdef�M�
async_stmt�M �atom�M
� augassign�M �
break_stmt�M �classdef�M
�comp_for�M�comp_if�M� comp_iter�M�comp_op�M�
comparison�M�
compound_stmt�M�
continue_stmt�M� decorated�M� decorator�M�
decorators�M�del_stmt�M� dictsetmaker�M�dotted_as_name�M�dotted_as_names�M� dotted_name�M �
encoding_decl�M �
eval_input�M �
except_clause�M � exec_stmt�M �expr�M!� expr_stmt�M"�exprlist�M#�factor�M$� flow_stmt�M%�for_stmt�M&�funcdef�M'� global_stmt�M(�if_stmt�M)�import_as_name�M*�import_as_names�M+� import_from�M,� import_name�M-� import_stmt�M.�lambdef�M/� listmaker�M0�namedexpr_test�M1�not_test�M2� old_lambdef�M3�old_test�M4�or_test�M5�
parameters�M6� pass_stmt�M7�power�M8�
print_stmt�M9�
raise_stmt�M:� return_stmt�M;�
shift_expr�M<� simple_stmt�M=� single_input�M>�sliceop�M?�
small_stmt�M@� star_expr�MA�stmt�MB� subscript�MC�
subscriptlist�MD�suite�ME�term�MF�test�MG�testlist�MH� testlist1�MI�
testlist_gexp�MJ�
testlist_safe�MK�testlist_star_expr�ML�tfpdef�MM�tfplist�MN�tname�MO�trailer�MP�try_stmt�MQ�
typedargslist�MR� varargslist�MS�vfpdef�MT�vfplist�MU�vname�MV�
while_stmt�MW� with_item�MX� with_stmt�MY�with_var�MZ�xor_expr�M[� yield_arg�M\�
yield_expr�M]�
yield_stmt�M^u�
number2symbol�}�(M hMhMhMhMhMhMh Mh
Mh M h M
h
M hM hM
hMhMhMhMhMhMhMhMhMhMhMhMh Mh Mh M h M h M h!M h"M h#M!h$M"h%M#h&M$h'M%h(M&h)M'h*M(h+M)h,M*h-M+h.M,h/M-h0M.h1M/h2M0h3M1h4M2h5M3h6M4h7M5h8M6h9M7h:M8h;M9h<M:h=M;h>M<h?M=h@M>hAM?hBM@hCMAhDMBhEMChFMDhGMEhHMFhIMGhJMHhKMIhLMJhMMKhNMLhOMMhPMNhQMOhRMPhSMQhTMRhUMShVMThWMUhXMVhYMWhZMXh[MYh\MZh]M[h^M\h_M]h`M^hau�states�]�(]�(]�(KK��KK ��KK ��e]�K K��ae]�(]�K*K��a]�(K+K ��K K��ee]�(]�K,K��a]�(K-K ��K K��ee]�(]�K.K��a]�K/K��a]�(K0K��K K��e]�K/K��a]�K K��ae]�(]�K1K��a]�(K2K��K K��e]�(K1K��K K��ee]�(]�(KK��K3K��K/K��e]�K/K��a]�(K4K��K0K��K5K��K K��e]�K K��ae]�(]�K6K��a]�(KK ��KK ��K K��ee]�(]�K K��a]�K/K��a]�(K2K��K K��e]�K/K��a]�K K��ae]�(]�K%K��a]�K7K��a]�K K��ae]�(]�K%K��a]�(K8K��K7K��K9K��e]�K K��ae]�(]�(KK��KK��K
K��K K��K#K��K'K��K(K��K)K��e]�(K:K��K;K��K<K��e]�KK ��a]�(K=K��K>K
��e]�K?K ��a]�(K@K��KAK ��e]�K K��a]�(K)K��K K��e]�K:K��a]�KK��a]�K=K��a]�K K��a]�K@K��ae]�(]�(KBK��KCK��KDK��KEK��KFK��KGK��KHK��KIK��KJK��KKK��KLK��KMK��KNK��e]�K K��ae]�(]�K
K��a]�K K��ae]�(]�KK��a]�K'K��a]�(KK��K.K��e]�(K:K��KOK��e]�KPK��a]�K.K��a]�K:K��a]�K K��ae]�(]�(KK��K%K��e]�KQK��a]�KK��a]�KRK��a]�KSK��a]�(KTK��K K��e]�K K��ae]�(]�KK��a]�KUK��a]�(KTK��K K��e]�K K��ae]�(]�(K5K��KVK��e]�K K��ae]�(]�(KWK��KXK��KYK��KWK��KZK��K[K��K\K��KRK��K]K��KK��e]�K K��a]�(KK��K K��e]�KRK��ae]�(]�K^K��a]�(K_K ��K K��ee]�(]�(K`K��KaK��KbK��K8K��K7K��KcK��KdK��KeK��K9K��e]�K K��ae]�(]�KK��a]�K K��ae]�(]�KfK��a]�(KgK��KaK��K7K��e]�K K��ae]�(]�K K��a]�KhK��a]�(KK��KK��e]�(K:K��KOK��e]�K K��a]�KK��a]�K:K��ae]�(]�KiK��a]�(KiK��K K��ee]�(]�KK��a]�KQK��a]�K K��ae]�(]�(K3K��KjK��K/K��e]�K^K��a]�(K2K��K5K��K K��e]�(K2K��K.K��K5K��K K��e]�(K2K��K5K��K K��e]�(KjK ��K/K ��K K��e]�K K��a]�K/K��a]�(K3K
��K/K ��K K��e]�(K2K��K K ��e]�K^K ��a]�K.K
��a]�(K2K��K K ��e]�K/K ��ae]�(]�KhK��a]�(KkK��K K��e]�K'K��a]�K K��ae]�(]�KlK��a]�(K2K ��K K��ee]�(]�K'K��a]�(KK ��K K��ee]�(]�K'K��a]�K K��ae]�(]�KmK��a]�(KK��KK��e]�K K��ae]�(]�KnK��a]�(K/K��K K��e]�(K2K��KkK��K K��e]�K/K��a]�K K��ae]�(]�KK��a]�K^K��a]�(KRK��K K��e]�K/K��a]�(K2K��K K��e]�K/K��a]�K K��ae]�(]�KoK��a]�(KpK ��K K��ee]�(]�KqK��a]�(K0K��KrK��KsK��K K��e]�(KqK��K<K��e]�K K��a]�(KmK��K<K��e]�(K0K��K K��ee]�(]�(K^K��KjK��e]�(K2K��K K��e]�(K^K��KjK��K K��ee]�(]�(KK��KK��K$K��KtK��e]�KuK��a]�K K��ae]�(]�(KvK��KwK��KxK��KyK��KzK��e]�K K��ae]�(]�KK��a]�KQK��a]�KRK��a]�KmK��a]�K.K��a]�KPK��a]�(K{K��K K��e]�K.K��a]�KPK ��a]�K K ��ae]�(]�KK��a]�K'K��a]�K|K��a]�(K}K��K.K��e]�K/K��a]�KPK��a]�K.K��a]�K K��ae]�(]�(KK��KK��e]�K'K��a]�(K2K��K K��ee]�(]�KK��a]�K~K��a]�K.K��a]�KPK��a]�(KK��K{K��K K��e]�K.K��a]�KPK��a]�K K��ae]�(]�K'K��a]�(KkK��K K��e]�K'K��a]�K K��ae]�(]�K�K��a]�(K2K��K K��e]�(K�K��K K��ee]�(]�KK��a]�(KK��KhK��e]�(KK��KK��KhK��e]�KK��a]�(KK��KK��K�K��e]�K�K��a]�K K��a]�K:K��ae]�(]�KK��a]�K�K��a]�K K��ae]�(]�(K�K��K�K��e]�K K��ae]�(]�KK��a]�(K.K��K�K��e]�K/K��a]�K.K��a]�K K��ae]�(]�(K~K��KjK��e]�(K2K��K5K��K K��e]�(K~K��KjK��K K��e]�K K��a]�(K2K��K K��ee]�(]�K/K��a]�(K4K��K K��e]�K/K��a]�K K��ae]�(]�(KK��K�K��e]�K,K��a]�K K��ae]�(]�KK��a]�(K.K��K�K��e]�KUK��a]�K.K��a]�K K��ae]�(]�(K�K��K�K��e]�K K��ae]�(]�K�K��a]�(K�K ��K K��ee]�(]�KK��a]�(K:K��K�K��e]�K K��a]�K:K��ae]�(]�KK��a]�K K��ae]�(]�(K&K��K�K��e]�K�K��a]�(K3K��K�K��K K��e]�KuK��a]�K K��ae]�(]�K K��a]�(K�K��K/K��K K��e]�K/K��a]�(K2K��K K��e]�(K2K��K K��e]�(K/K��K K��e]�K/K��a]�(K2K��K K��e]�(K/K��K K��ee]�(]�K K��a]�(K/K��K K��e]�(K2K��KK��K K��e]�K/K��a]�K/K��a]�(K2K��K K��e]�K K��ae]�(]�K K��a]�(KmK��K K��e]�K K��ae]�(]�K�K��a]�(K�K ��K�K ��K K��ee]�(]�K�K��a]�(K�K��KK��e]�(KK��K�K��e]�K K��ae]�(]�(KK��K�K��K�K��e]�K K��a]�KK��ae]�(]�K.K��a]�(K/K��K K��e]�K K��ae]�(]�(K�K��K�K��K�K��K�K��K�K��K�K��K�K��K�K��K�K��e]�K K��ae]�(]�KK��a]�K^K��a]�K K��ae]�(]�(K�K��K�K��e]�K K��ae]�(]�(K.K��K/K��e]�(K�K��K/K��K K��e]�(K.K��K K��e]�K K��a]�(K�K��K K��ee]�(]�K�K��a]�(K2K��K K��e]�(K�K��K K��ee]�(]�(KK��K�K��e]�K�K��a]�K K��a]�KK��a]�(K�K��KK��ee]�(]�KuK��a]�(K�K ��KK ��K�K ��K�K ��K K ��K K��ee]�(]�(K�K��K�K��e]�K K��a]�(KK��K K��e]�K�K��a]�K{K��a]�K/K��ae]�(]�K/K��a]�(K2K��K K��e]�(K/K��K K��ee]�(]�K/K��a]�(K2K ��K K��ee]�(]�(K~K��KjK��e]�(K2K��K5K��K K��e]�(K~K��KjK��K K��e]�K K��a]�(K2K��K K��ee]�(]�KUK��a]�(K2K��K K��e]�KUK��a]�(K2K��K K��e]�(KUK��K K��ee]�(]�(KjK��K/K��e]�(K2K��K K��e]�(KjK��K/K��K K��ee]�(]�(KK��K�K��e]�K�K��a]�K K��a]�K:K��ae]�(]�K�K��a]�(K2K��K K��e]�(K�K��K K��ee]�(]�K'K��a]�(K.K��K K��e]�K/K��a]�K K��ae]�(]�(KK��KK��K
K��e]�(K:K��KOK��e]�K'K��a]�K�K��a]�K K��a]�K:K��a]�K=K��ae]�(]�K K��a]�K.K��a]�KPK��a]�(K�K��K�K��e]�K.K��a]�K.K��a]�KPK��a]�KPK ��a]�K K��a]�(K{K
��K�K��K�K��K K ��e]�K.K ��a]�KPK ��a]�(K�K��K K ��ee]�(]�(KK��K3K��K�K��e]�(K2K��K�K��K K��e]�K�K��a]�(K2K��K0K��K K��e]�(K3K��K�K ��K K��e]�(K2K��K K��e]�(K2K
��K K��e]�(KK��K3K��K�K ��K�K��K K��e]�K/K ��a]�(K2K��K0K
��K K ��e]�K K
��a]�(K2K��K K ��e]�(K2K��K K ��e]�K/K��a]�(KK��K3K��K�K��K K��e]�(K2K��K�K��K K��e]�(K2K��K0K��K K��e]�(K3K��K�K��K K��e]�(K2K��K K��e]�K/K ��a]�(K2K��K0K��K K��e]�K/K��ae]�(]�(KK��K3K��K�K��e]�(K2K��K�K��K K��e]�K�K��a]�(K2K��K0K��K K��e]�(K3K��K�K ��K K��e]�(K2K��K K��e]�(K2K
��K K��e]�(KK��K3K��K�K ��K�K��K K��e]�K/K ��a]�(K2K��K0K
��K K ��e]�K K
��a]�(K2K��K K ��e]�(K2K��K K ��e]�K/K��a]�(KK��K3K��K�K��K K��e]�(K2K��K�K��K K��e]�(K2K��K0K��K K��e]�(K3K��K�K��K K��e]�(K2K��K K��e]�K/K ��a]�(K2K��K0K��K K��e]�K/K��ae]�(]�(KK��K�K��e]�K�K��a]�K K��a]�K:K��ae]�(]�K�K��a]�(K2K��K K��e]�(K�K��K K��ee]�(]�K'K��a]�K K��ae]�(]�K K��a]�K~K��a]�K.K��a]�KPK��a]�(K{K��K K��e]�K.K��a]�KPK��a]�K K��ae]�(]�K/K��a]�(KkK��K K��e]�K^K��a]�K K��ae]�(]�K!K��a]�K�K��a]�(K2K��K.K��e]�KPK��a]�K K��ae]�(]�KkK��a]�K^K��a]�K K��ae]�(]�K�K��a]�(K�K ��K K��ee]�(]�(KK��KmK��e]�K/K��a]�K K��ae]�(]�K"K��a]�(K�K��K K��e]�K K��ae]�(]�K<K��a]�K K��aee�dfas�}�(M hf}�(KKKKKKKKKKK KK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKKKKKKKKKK KK KK KK KK KK!KK"KK#KK$KK%KK&KKKK'KKKK(KK)Ku��Mhm}�(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku��Mhs}�(KKKKKKKKK
KK KKKK#KK$KK&KK'KK(KK)Ku��Mhy}�K.Ks��Mh�}�(KKKKK3KKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��Mh�}�(KKKKK3KKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��Mh�}�(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku��Mh�}�K Ks��Mh�}�K%Ks��M h�}�K%Ks��M
h�}�(KKKKK
KK KK#KK'KK(KK)Ku��M h�}�(KBKKCKKDKKEKKFKKGKKHKKIKKJKKKKKLKKMKKNKu��M h�}�K
Ks��M
h�}�KKs��Mj }�(KKK%Ku��Mj }�KKs��Mj* }�(KKKKK%Ku��Mj0 }�(KWKKXKKYKKZKK[KK\KKRKK]KKKu��MjC }�(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku��MjI }�(K KKKKKKKKKK KK KK!KK%Ku��MjV }�KKs��Mj[ }�K Ks��Mjd }�K Ks��Mju }�K Ks��Mj{ }�KKs��Mj� }�(KKKKK3KKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��Mj� }�K'Ks��Mj� }�K'Ks��M j� }�K'Ks��M j� }�K'Ks��M j� }�(KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��M j� }�KnKs��M j� }�KKs��M!j� }�(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku��M"j� }�(KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��M#j }�(KKKKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku��M$j }�(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku��M%j }�(K
KKKK KK KK"Ku��M&j' }�KKs��M'j= }�KKs��M(jO }�(KKKKu��M)jX }�KKs��M*jk }�K'Ks��M+ju }�K'Ks��M,j~ }�KKs��M-j� }�KKs��M.j� }�(KKKKu��M/j� }�KKs��M0j� }�(KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��M1j� }�(KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��M2j� }�(KKKKKKKKK
KK KKKK#KK$KK&KK'KK(KK)Ku��M3j� }�KKs��M4j� }�(KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��M5j� }�(KKKKKKKKK
KK KKKK#KK$KK&KK'KK(KK)Ku��M6j� }�KKs��M7j� }�KKs��M8j� }�(KKKKK
KK KK#KK&KK'KK(KK)Ku��M9j }�K Ks��M:j }�K Ks��M;j2 }�K Ks��M<j: }�(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku��M=jA }�(KKKKKKKKKKK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKK KK KK KK"KK#KK$KK&KK'KK(KK)Ku��M>jL }�(KKKKKKKKKKK KK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKKKKKKKKKK KK KK KK KK KK!KK"KK#KK$KK%KK&KK'KKKK(KK)Ku��M?jU }�K.Ks��M@j] }�(KKKKKKKKKKK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKK KK KK KK"KK#KK$KK&KK'KK(KK)Ku��MAjj }�KKs��MBjq }�(KKKKKKKKKKK KK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKKKKKKKKKK KK KK KK KK KK!KK"KK#KK$KK%KK&KK'KK(KK)Ku��MCjw }�(KKKKKKKKK.KK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��MDj� }�(KKKKKKKKK.KK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��MEj� }�(KKKKKKKKKKK
KK KK KK
KKKKKKKKKKKKKKKKKKKKKK KK KK KK"KK#KK$KK&KK'KKKK(KK)Ku��MFj� }�(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku��MGj� }�(KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��MHj� }�(KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��MIj� }�(KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��MJj� }�(KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��MKj� }�(KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��MLj� }�(KKKKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��MMj� }�(KKK'Ku��MNj� }�(KKK'Ku��MOj }�K'Ks��MPj }�(KKKKK
Ku��MQj }�K Ks��MRj> }�(KKKKK3KK'Ku��MSj� }�(KKKKK3KK'Ku��MTj� }�(KKK'Ku��MUj� }�(KKK'Ku��MVj� }�K'Ks��MWj� }�K Ks��MXj� }�(KKKKKKKKK
KK KKKKKK#KK$KK&KK'KK(KK)Ku��MYj }�K!Ks��MZj }�KkKs��M[j }�(KKKKKKKKK
KK KK#KK$KK&KK'KK(KK)Ku��M\j! }�(KKKKKKKKK
KK KKKKKKKK#KK$KK&KK'KK(KK)Ku��M]j) }�K"Ks��M^j1 }�K"Ks��u�labels�]�(K �EMPTY���K N��KN��MBN��KN��KN��KN��KN��KN��K2N��K N��KN��K�assert���K�break���K�class���K�continue���K�def���K�del���K�exec���K�for���K�from���K�global���K�if���K�import���K�lambda���K�nonlocal���K�not���K�pass���K�print���K�raise���K�return���K�try���K�while���K�with���K�yield���KN��K N��K9N��K8N��KN��KN��KN��M<N��KN��M2N��K�and���K N��MGN��KN��MN��K N��K$N��K;N��MN��MFN��M'N��M&N��MYN��KN��MJN��M]N��K
N��M0N��MIN��KN��MN��K)N��K*N��K/N��K'N��K%N��K&N��K1N��K(N��K-N��K.N��K3N��K,N��K+N��MN��MEN��M#N��K�in���MKN��MN��M4N��MN��K N��KN��K N��K N��KN��K N��K�is���M!N��MN��M N��M
N��MN��M)N��MQN��MWN��MN��MN��M N��MN��MAN��K�as���MN��MHN��K�except���M[N��KN��MLN��MN��M N��M8N��M$N��M N��MN��M:N��M;N��M^N��K�else���M6N��K7N��M1N��K�elif���M*N��M+N��MN��M,N��M-N��MSN��MN��M3N��M5N��MN��K�or���MRN��M
N��MPN��K#N��MN��K"N��M@N��K
N��MN��M=N��MN��MN��M N��M"N��M%N��M(N��M.N��M7N��M9N��M?N��MCN��KN��KN��KN��KN��K0N��M/N��MON��MNN��MMN��MDN��K�finally���M N��MTN��MVN��MUN��MXN��MN��K!N��M\N��e�keywords�}�(j K j K
j Kj Kj
Kj Kj Kj Kj Kj Kj Kj Kj Kj Kj! Kj# Kj% K j' K j) K j+ K j- K j/ K!j1 K"j= K-jc KRjo K]j~ Kkj� Knj� K{j� Kj� K�j� K�u�tokens�}�(K KKKKKKKKKKKKKK2K K K
KK KK#K K$K9K%K8K&KK'KK(KK)KK+K K.KK0K K2K$K3K;K4KK:K
K=KK@K)KBK*KCK/KDK'KEK%KFK&KGK1KHK(KIK-KJK.KKK3KLK,KMK+KNK KWKKXK KYK KZKK[K K\KKpK7K}K#K�K"K�K
K�KK�KK�KK�KK�K0K�K!K�u� symbol2label�}�(�stmt�K�
shift_expr�K*�not_test�K,�test�K/�argument�K1�comp_for�K5�term�K6�funcdef�K7�for_stmt�K8� with_stmt�K9�
testlist_gexp�K;�
yield_expr�K<� listmaker�K>� testlist1�K?� dictsetmaker�KA�arglist�KO�suite�KP�exprlist�KQ�
testlist_safe�KS� comp_iter�KT�old_test�KU�comp_if�KV�expr�K^�comp_op�K_�
async_stmt�K`�classdef�Ka� decorated�Kb�if_stmt�Kc�try_stmt�Kd�
while_stmt�Ke�
decorators�Kf�
async_funcdef�Kg� dotted_name�Kh� decorator�Ki� star_expr�Kj�dotted_as_name�Kl�testlist�Km�xor_expr�Ko�testlist_star_expr�Kq� annassign�Kr� augassign�Ks�power�Kt�factor�Ku�
break_stmt�Kv�
continue_stmt�Kw�
raise_stmt�Kx� return_stmt�Ky�
yield_stmt�Kz�
parameters�K|�namedexpr_test�K~�import_as_name�K��import_as_names�K��dotted_as_names�K�� import_from�K�� import_name�K�� varargslist�K��
comparison�K�� old_lambdef�K��or_test�K��and_test�K��
typedargslist�K��atom�K��trailer�K��
arith_expr�K��
small_stmt�K��
compound_stmt�K�� simple_stmt�K�� assert_stmt�K��del_stmt�K�� exec_stmt�K�� expr_stmt�K�� flow_stmt�K�� global_stmt�K�� import_stmt�K�� pass_stmt�K��
print_stmt�K��sliceop�K�� subscript�K��lambdef�K��tname�K��tfplist�K��tfpdef�K��
subscriptlist�K��
except_clause�K��vfpdef�K��vname�K��vfplist�K�� with_item�K��and_expr�K�� yield_arg�K�u�start�M u. fixes/__pycache__/fix_urllib.cpython-38.pyc 0000644 00000013552 15053244165 0014674 0 ustar 00 U
e5d� � @ s� d Z ddlmZmZ ddlmZmZmZmZm Z m
Z
m Z dddddd d
d d gfd
ddddddddddddddd gfd d gfgdd d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5gfd d6d7gfgd8�Z e d9 �
e d: d; � d<d=� ZG d>d?� d?e�Zd@S )Az�Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
� )�
alternates�
FixImports)�Name�Comma�
FromImport�Newline�find_indentation�Node�symszurllib.requestZ URLopenerZFancyURLopenerZ urlretrieveZ
_urlopenerZurlopenZ
urlcleanupZ pathname2urlZ url2pathnamez urllib.parseZquoteZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ splitattrZ splithostZ
splitnportZ splitpasswdZ splitportZ
splitqueryZsplittagZ splittypeZ splituserZ
splitvaluez urllib.errorZContentTooShortErrorZinstall_openerZ build_openerZRequestZOpenerDirectorZ BaseHandlerZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZURLErrorZ HTTPError)�urllib�urllib2r r � c c sv t � } t�� D ]b\}}|D ]T}|\}}t|�}d||f V d|||f V d| V d| V d||f V qqd S )Nz�import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
z�import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
zIimport_from< 'from' module_star=%r 'import' star='*' >
ztimport_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
zKpower< bare_with_attr=%r trailer< '.' member=%s > any* >
)�set�MAPPING�itemsr )ZbareZ
old_moduleZchanges�changeZ
new_module�members� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_urllib.py�
build_pattern0 s( �����r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) � FixUrllibc C s d� t� �S )N�|)�joinr )�selfr r r r I s zFixUrllib.build_patternc C sv |� d�}|j}g }t|j dd� D ] }|�t|d |d�t� g� q&|�tt|j d d |d�� |�|� dS )z�Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
�moduleN���r ��prefix) �getr r �value�extendr r �append�replace)r �node�resultsZ
import_mod�pref�names�namer r r �transform_importL s
zFixUrllib.transform_importc C s& |� d�}|j}|� d�}|r�t|t�r0|d }d}t|j D ] }|j|d kr>|d } q^q>|rv|�t||d�� n | �|d� �n�g }i } |d }
|
D ]�}|j t
j kr�|j d j} |j d j} n
|j} d} | d
kr�t|j D ]B}| |d kr�|d | k�r |�
|d � | �|d g ��
|� q�q�g }
t|�}d }d d
� }|D ]�}| | }g }|dd� D ]"}|�|||�� |�
t� � �q^|�||d |�� t||�}|�r�|jj�|��r�||_|
�
|� d}�qB|
�rg }|
dd� D ]}|�|t� g� �q�|�
|
d � |�|� n | �|d� dS )z�Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
�
mod_member�memberr Nr
r �!This is an invalid module elementr � �,Tc S sX | j tjkrHt| jd j|d�| jd �� | jd �� g}ttj|�gS t| j|d�gS )Nr r r
r, )�typer
�import_as_namer �childrenr Zcloner )r' r Zkidsr r r � handle_name� s �z/FixUrllib.transform_member.<locals>.handle_namer Fz All module elements are invalid)r r �
isinstance�listr r r" r �cannot_convertr. r
r/ r0 r! �
setdefaultr r r r �parent�endswithr )r r# r$ r) r% r* �new_namer �modulesZmod_dictr Zas_name� member_nameZ new_nodesZ indentation�firstr1 r Zeltsr& Zelt�newZnodesZnew_noder r r �transform_member\ sh
zFixUrllib.transform_memberc C s~ |� d�}|� d�}d}t|t�r*|d }t|j D ] }|j|d kr4|d } qTq4|rn|�t||jd�� n | �|d� dS )z.Transform for calls to module members in code.�bare_with_attrr* Nr r
r r+ ) r r2 r3 r r r" r r r4 )r r# r$ Z
module_dotr* r8 r r r r �
transform_dot� s
�
zFixUrllib.transform_dotc C sz |� d�r| �||� n^|� d�r0| �||� nF|� d�rH| �||� n.|� d�r`| �|d� n|� d�rv| �|d� d S )Nr r) r> Z module_starzCannot handle star imports.Z module_asz#This module is now multiple modules)r r( r= r? r4 )r r# r$ r r r � transform� s
zFixUrllib.transformN)�__name__�
__module__� __qualname__r r( r= r? r@ r r r r r G s
Lr N)�__doc__Zlib2to3.fixes.fix_importsr r Zlib2to3.fixer_utilr r r r r r r
r r! r r r r r r �<module> s~ $ �� ����
�����! fixes/__pycache__/fix_filter.cpython-38.pyc 0000644 00000004607 15053244165 0014671 0 ustar 00 U
e5d�
� @ sZ d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z m Z m
Z
G dd� dej�ZdS ) a� Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�ListComp�in_special_context� parenthesizec @ s e Zd ZdZdZdZdd� ZdS )� FixFilterTaV
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
[extra_trailers=trailer*]
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.filterc C sL | � |�rd S g }d|kr6|d D ]}|�|�� � q"d|kr�|�d��� }|jtjkrfd|_t|�}t |�d��� |�d��� |�d��� |�}t
tj |g| dd�}n�d|kr�t t d �t d �|d
�� t d ��}t
tj |g| dd�}nTt
|�r�d S |d �� }t
tj t d �|gdd�}t
tj t d
�t|g�g| �}d|_|j|_|S )NZextra_trailersZ
filter_lambda�xp� �fp�it)�prefixZnoneZ_f�seq�args�filter�list)Z should_skip�appendZclone�get�type�symsZtestr r r r Zpowerr r r )�selfZnodeZresultsZtrailers�tr �newr � r �0/usr/lib64/python3.8/lib2to3/fixes/fix_filter.py� transform: s@
�
� zFixFilter.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r
s r
N)�__doc__r r Zpytreer Zpygramr r Z
fixer_utilr r r r r ZConditionalFixr
r r r r �<module> s
fixes/__pycache__/fix_future.cpython-38.opt-2.pyc 0000644 00000001244 15053244165 0015650 0 ustar 00 U
e5d# � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)� BlankLinec @ s e Zd ZdZdZdZdd� ZdS )� FixFutureTz;import_from< 'from' module_name="__future__" 'import' any >�
c C s t � }|j|_|S )N)r �prefix)�selfZnodeZresults�new� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_future.py� transform s zFixFuture.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r
r s r N)� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_idioms.cpython-38.opt-1.pyc 0000644 00000007400 15053244165 0015621 0 ustar 00 U
e5d � @ sN d Z ddlmZ ddlmZmZmZmZmZm Z dZ
dZ G dd� dej �Z
dS ) a� Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
� )�
fixer_base)�Call�Comma�Name�Node� BlankLine�symsz0(n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)z(power< 'type' trailer< '(' x=any ')' > >c sP e Zd ZdZdeeeef Z� fdd�Zdd� Zdd� Z d d
� Z
d d � Z � Z S )
� FixIdiomsTa�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c s8 t t| ��|�}|r4d|kr4|d |d kr0|S d S |S )N�sortedZid1Zid2)�superr �match)�self�node�r�� __class__� �0/usr/lib64/python3.8/lib2to3/fixes/fix_idioms.pyr O s zFixIdioms.matchc C sH d|kr| � ||�S d|kr(| �||�S d|kr<| �||�S td��d S )N�
isinstance�whiler
z
Invalid match)�transform_isinstance�transform_while�transform_sort� RuntimeError)r
r �resultsr r r � transformZ s zFixIdioms.transformc C sh |d � � }|d � � }d|_d|_ttd�|t� |g�}d|kr\d|_ttjtd�|g�}|j|_|S )N�x�T� � r �n�not)�clone�prefixr r r r r Znot_test)r
r r r r Ztestr r r r d s z FixIdioms.transform_isinstancec C s |d }|� td|jd�� d S )Nr �True�r# )�replacer r# )r
r r Zoner r r r p s zFixIdioms.transform_whilec C s� |d }|d }|� d�}|� d�}|r>|�td|jd�� n8|rn|�� }d|_|�ttd�|g|jd�� ntd��|�� |j}d |kr�|r�|�d �d
|d
jf} d � | �|d
_n"t
� }
|j � |
� |�d �d
|
_d S ) N�sort�next�list�exprr
r% r z should not have reached here�
� )
�getr& r r# r" r r �remove�
rpartition�joinr �parentZ append_child) r
r r Z sort_stmtZ next_stmtZ list_callZ simple_expr�newZbtwnZ prefix_linesZend_liner r r r t s,
�
zFixIdioms.transform_sort)
�__name__�
__module__� __qualname__Zexplicit�TYPE�CMPZPATTERNr r r r r �
__classcell__r r r r r % s %
�'
r N)�__doc__r r Z
fixer_utilr r r r r r r7 r6 ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_filter.cpython-38.opt-1.pyc 0000644 00000004607 15053244165 0015630 0 ustar 00 U
e5d�
� @ sZ d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z m Z m
Z
G dd� dej�ZdS ) a� Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�ListComp�in_special_context� parenthesizec @ s e Zd ZdZdZdZdd� ZdS )� FixFilterTaV
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
[extra_trailers=trailer*]
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.filterc C sL | � |�rd S g }d|kr6|d D ]}|�|�� � q"d|kr�|�d��� }|jtjkrfd|_t|�}t |�d��� |�d��� |�d��� |�}t
tj |g| dd�}n�d|kr�t t d �t d �|d
�� t d ��}t
tj |g| dd�}nTt
|�r�d S |d �� }t
tj t d �|gdd�}t
tj t d
�t|g�g| �}d|_|j|_|S )NZextra_trailersZ
filter_lambda�xp� �fp�it)�prefixZnoneZ_f�seq�args�filter�list)Z should_skip�appendZclone�get�type�symsZtestr r r r Zpowerr r r )�selfZnodeZresultsZtrailers�tr �newr � r �0/usr/lib64/python3.8/lib2to3/fixes/fix_filter.py� transform: s@
�
� zFixFilter.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r
s r
N)�__doc__r r Zpytreer Zpygramr r Z
fixer_utilr r r r r ZConditionalFixr
r r r r �<module> s
fixes/__pycache__/fix_standarderror.cpython-38.opt-1.pyc 0000644 00000001313 15053244165 0017204 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z%Fixer for StandardError -> Exception.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�FixStandarderrorTz-
'StandardError'
c C s t d|jd�S )N� Exception)�prefix)r r )�selfZnodeZresults� r �7/usr/lib64/python3.8/lib2to3/fixes/fix_standarderror.py� transform s zFixStandarderror.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_execfile.cpython-38.pyc 0000644 00000003234 15053244165 0015163 0 ustar 00 U
e5d � @ sV d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
m Z m Z m
Z
G dd� dej�ZdS )zoFixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
� )�
fixer_base)
�Comma�Name�Call�LParen�RParen�Dot�Node�ArgList�String�symsc @ s e Zd ZdZdZdd� ZdS )� FixExecfileTz�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s. |st �|d }|�d�}|�d�}|jd jd �� }t|�� t� tdd�g|d�}ttj t
d�|g�}ttj t � t
d �g�ttj t
� t� g�g} |g| }
|�� } d| _td
d�} |
t� | t� | g }
tt
d �|
d �}|g}|d k r�|�t� |�� g� |d k �r|�t� |�� g� tt
d
�||jd�S )N�filename�globals�locals���z"rb"� )Zrparen�open�readz'exec'�compile� �exec)�prefix)�AssertionError�getZchildrenZcloner
r r r r Zpowerr Ztrailerr r r r r �extend)�selfZnodeZresultsr r r Zexecfile_parenZ open_argsZ open_callr Z open_exprZ filename_argZexec_strZ compile_argsZ compile_call�args� r �2/usr/lib64/python3.8/lib2to3/fixes/fix_execfile.py� transform s0
��
zFixExecfile.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r
N)�__doc__r r Z
fixer_utilr r r r r r r r
r r ZBaseFixr
r r r r �<module> s 0 fixes/__pycache__/fix_zip.cpython-38.opt-2.pyc 0000644 00000002337 15053244165 0015144 0 ustar 00 U
e5d � @ sN d dl mZ d dlmZ d dlmZ d dlmZm Z m
Z
G dd� dej �Z dS )� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�in_special_contextc @ s e Zd ZdZdZdZdd� ZdS )�FixZipTzN
power< 'zip' args=trailer< '(' [any] ')' > [trailers=trailer*]
>
zfuture_builtins.zipc C s� | � |�rd S t|�rd S |d �� }d|_g }d|krZdd� |d D �}|D ]
}d|_qNttjtd�|gdd�}ttjtd�t|g�g| �}|j|_|S ) N�args� �trailersc S s g | ] }|� � �qS � )�clone)�.0�nr r �-/usr/lib64/python3.8/lib2to3/fixes/fix_zip.py�
<listcomp>' s z$FixZip.transform.<locals>.<listcomp>�zip)�prefix�list) Z should_skipr r
r r �symsZpowerr r )�selfZnodeZresultsr r r �newr r r � transform s
zFixZip.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r s r N)
r
r Zpytreer Zpygramr r Z
fixer_utilr r r ZConditionalFixr r r r r �<module> s fixes/__pycache__/fix_isinstance.cpython-38.opt-1.pyc 0000644 00000003012 15053244165 0016470 0 ustar 00 U
e5dH � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )a, Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
� )�
fixer_base)�tokenc @ s e Zd ZdZdZdZdd� ZdS )�
FixIsinstanceTz�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
� c C s� t � }|d }|j}g }t|�}|D ]p\}} | jtjkrr| j|krr|t|�d k r�||d jtjkr�t |� q$q$|�
| � | jtjkr$|� | j� q$|r�|d jtjkr�|d= t|�dkr�|j }
|
j
|d _
|
�|d � n||d d �< |�� d S )N�args� ���� )�setZchildren� enumerate�typer �NAME�value�len�COMMA�next�append�add�parent�prefix�replaceZchanged) �selfZnodeZresultsZnames_insertedZtestlistr Znew_args�iterator�idx�argZatom� r �4/usr/lib64/python3.8/lib2to3/fixes/fix_isinstance.py� transform s* $
zFixIsinstance.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_dict.cpython-38.pyc 0000644 00000006402 15053244165 0014322 0 ustar 00 U
e5d� � @ sj d Z ddlmZ ddlmZ ddlmZ ddlmZmZmZ ddlmZ ej dhB Z
G dd � d ej �Z d
S ) aj Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
� )�pytree)�patcomp)�
fixer_base)�Name�Call�Dot)�
fixer_util�iterc @ s@ e Zd ZdZdZdd� ZdZe�e�Z dZ
e�e
�Z dd� Z d S )
�FixDictTa
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c
C s |d }|d d }|d }| j }|j}|�d�}|�d�} |sD| rP|dd � }|dksdtt|���d d
� |D �}d d
� |D �}| o�| �||�}
|t�|jt � t
||j d �g�|d
� � g } t�|j
| �} |
s�| s�d| _ tt
|r�dnd�| g�} |�rt�|j
| g| �} |j | _ | S )N�head�method� �tailr Zview� )�keys�items�valuesc S s g | ] }|� � �qS � ��clone��.0�nr r �./usr/lib64/python3.8/lib2to3/fixes/fix_dict.py�
<listcomp>A s z%FixDict.transform.<locals>.<listcomp>c S s g | ] }|� � �qS r r r r r r r B s )�prefixZparens� �list)�syms�value�
startswith�AssertionError�repr�in_special_contextr ZNodeZtrailerr r r r Zpowerr )
�self�node�resultsr r r r Z method_name�isiterZisviewZspecial�args�newr r r � transform6 s<
���
�zFixDict.transformz3power< func=NAME trailer< '(' node=any ')' > any* >zmfor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� |j d krdS i }|j j d k r^| j�|j j |�r^|d |kr^|rN|d jtkS |d jtjkS |sfdS | j�|j |�o�|d |kS )NFr% �func)�parent�p1�matchr � iter_exemptr �consuming_calls�p2)r$ r% r' r& r r r r# Z s
�
�zFixDict.in_special_contextN)
�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr* ZP1r Zcompile_patternr- ZP2r1 r# r r r r r
) s
r
N)
�__doc__r r r r r r r r r0 r/ ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_tuple_params.cpython-38.pyc 0000644 00000010752 15053244165 0016076 0 ustar 00 U
e5d� � @ s� d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z m Z dd� Z
G dd � d ej�Zd
d � Zd d
� Zg dfdd�Zdd� ZdS )a: Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
� )�pytree)�token)�
fixer_base)�Assign�Name�Newline�Number� Subscript�symsc C s t | tj�o | jd jtjkS )N� )�
isinstancer �Node�children�typer �STRING)�stmt� r �6/usr/lib64/python3.8/lib2to3/fixes/fix_tuple_params.py� is_docstring s �r c @ s( e Zd ZdZdZdZdd� Zdd� ZdS ) �FixTupleParams� Ta
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s� d|kr�� ||�S g �|d }|d }|d jd jtjkrZd}|d jd j}t� � nd}d}t�tjd�� d� ��fd
d � }|jt j
kr�||� n<|jt j kr�t |j�D ]$\}} | jt j
kr�|| |dkd � q��s�d S �D ]}
|d |
_
q�|} |dk�r
d
�d _n&t|d j| ��r0|�d _|d } �D ]}
|d |
_
�q4�|d j| | �< t| d | t�� d �D ]}||d j| _�qr|d �� d S )N�lambda�suite�argsr � r z; � Fc s\ t ��� �}| �� }d|_t||�� �}|r2d|_| �|� ��t�t j
|� �� g�� d S )Nr � ) r �new_name�clone�prefixr �replace�appendr r
r
Z simple_stmt)Z tuple_arg�
add_prefix�n�argr ��endZ new_lines�selfr r � handle_tupleC s
�z.FixTupleParams.transform.<locals>.handle_tuple)r" r )F)�transform_lambdar r r �INDENT�valuer r ZLeafr
ZtfpdefZ
typedargslist� enumerate�parentr r �range�lenZchanged) r' �node�resultsr r �start�indentr( �ir$ �lineZafterr r% r � transform. sF
zFixTupleParams.transformc
C s� |d }|d }t |d �}|jtjkrD|�� }d|_|�|� d S t|�}t|�}| � t
|��}t |dd�} |�| �� � |� � D ]X}
|
jtjkr�|
j
|kr�dd� ||
j
D �} t�tj| �� g| �} |
j| _|
�| � q�d S )Nr �body�innerr )r c S s g | ] }|� � �qS r )r ��.0�cr r r �
<listcomp>� s z3FixTupleParams.transform_lambda.<locals>.<listcomp>)�
simplify_argsr r �NAMEr r r � find_params� map_to_indexr �
tuple_namer Z
post_orderr+ r r
r
Zpower)
r' r0 r1 r r7 r8 ZparamsZto_indexZtup_nameZ new_paramr# Z
subscripts�newr r r r) n s*
�z FixTupleParams.transform_lambdaN)�__name__�
__module__� __qualname__Z run_orderZ
BM_compatibleZPATTERNr6 r) r r r r r s
@r c C sN | j tjtjfkr| S | j tjkr>| j tjkr:| jd } q"| S td| ��d S )Nr zReceived unexpected node %s)r r
Zvfplistr r> �vfpdefr � RuntimeError�r0 r r r r= � s r= c C s< | j tjkrt| jd �S | j tjkr,| jS dd� | jD �S )Nr c S s g | ]}|j tjkrt|��qS r )r r �COMMAr? r9 r r r r< � s z find_params.<locals>.<listcomp>)r r
rF r? r r r> r+ rH r r r r? � s
r? Nc C sZ |d kr i }t | �D ]@\}}ttt|���g}t|t�rHt|||d� q|| ||< q|S )N)�d)r, r r �strr �listr@ )�
param_listr rJ r4 �objZtrailerr r r r@ � s
r@ c C s< g }| D ](}t |t�r&|�t|�� q|�|� qd�|�S )N�_)r rL r! rA �join)rM �lrN r r r rA � s
rA )�__doc__r r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r= r? r@ rA r r r r �<module> s l fixes/__pycache__/fix_basestring.cpython-38.opt-2.pyc 0000644 00000001145 15053244165 0016477 0 ustar 00 U
e5d@ � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixBasestringTz 'basestring'c C s t d|jd�S )N�str)�prefix)r r )�selfZnodeZresults� r �4/usr/lib64/python3.8/lib2to3/fixes/fix_basestring.py� transform
s zFixBasestring.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_raise.cpython-38.opt-1.pyc 0000644 00000004310 15053244165 0015435 0 ustar 00 U
e5dn � @ sZ d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z G dd� dej �Z
dS ) a[ Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
� )�pytree)�token)�
fixer_base)�Name�Call�Attr�ArgList�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixRaiseTzB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c C sh | j }|d �� }|jtjkr2d}| �||� d S t|�r^t|�rX|jd jd �� }q:d|_d|kr�t �
|j t d�|g�}|j|_|S |d �� }t|�r�dd � |jdd
� D �}n d |_|g}d |k�rB|d �� } d | _|}
|jtj
ks�|jd
k�rt||�}
t|
t d��t| g�g } t �
|jt d�g| �}|j|_|S t j
|j t d�t||�g|jd�S d S )N�excz+Python 3 does not support string exceptions� � � �val�raisec S s g | ] }|� � �qS � )�clone)�.0�cr r �//usr/lib64/python3.8/lib2to3/fixes/fix_raise.py�
<listcomp>D s z&FixRaise.transform.<locals>.<listcomp>���� �tb�None�with_traceback)�prefix)�symsr �typer �STRINGZcannot_convertr Zchildrenr r ZNodeZ
raise_stmtr �NAME�valuer r r Z simple_stmt) �selfZnodeZresultsr r �msg�newr �argsr �eZwith_tbr r r � transform& sB
�zFixRaise.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r r r r r
s r
N)�__doc__r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r r r r �<module> s
fixes/__pycache__/fix_imports.cpython-38.opt-2.pyc 0000644 00000010346 15053244165 0016036 0 ustar 00 U
e5d4 � 1 @ s� d dl mZ d dlmZmZ dddddddd d
d d d d d
ddddddddddddddd d d d d d!d!d"d#d$d%d&d'd'd'd(d)d)d*d+d,�0Zd-d.� Zefd/d0�ZG d1d2� d2ej�Z d3S )4� )�
fixer_base)�Name�
attr_chain�io�pickle�builtins�copyregZqueueZ socketserverZ configparser�reprlibztkinter.filedialogztkinter.simpledialogztkinter.colorchooserztkinter.commondialogztkinter.dialogz tkinter.dndz tkinter.fontztkinter.messageboxztkinter.scrolledtextztkinter.constantsz tkinter.tixz tkinter.ttkZtkinterZ _markupbase�winreg�_threadZ
_dummy_threadzdbm.bsdzdbm.dumbzdbm.ndbmzdbm.gnuz
xmlrpc.clientz
xmlrpc.serverz http.clientz
html.entitiesz html.parserz http.cookieszhttp.cookiejarz http.server�
subprocess� collectionsz urllib.parsezurllib.robotparser)0�StringIOZ cStringIOZcPickleZ __builtin__Zcopy_regZQueueZ SocketServerZ ConfigParser�reprZ
FileDialogZ tkFileDialogZ SimpleDialogZtkSimpleDialogZtkColorChooserZtkCommonDialogZDialogZTkdndZtkFontZ tkMessageBoxZ ScrolledTextZ TkconstantsZTixZttkZTkinterZ
markupbase�_winreg�threadZ dummy_threadZdbhashZdumbdbmZdbmZgdbmZ xmlrpclibZDocXMLRPCServerZSimpleXMLRPCServerZhttplibZhtmlentitydefsZ
HTMLParserZCookieZ cookielibZBaseHTTPServerZSimpleHTTPServerZ
CGIHTTPServerZcommands�
UserString�UserListZurlparseZ robotparserc C s dd� tt| �� d S )N�(�|�))�join�mapr )�members� r �1/usr/lib64/python3.8/lib2to3/fixes/fix_imports.py�
alternates= s r c c sT d� dd� | D ��}t| �� �}d||f V d| V d||f V d| V d S )Nz | c S s g | ] }d | �qS )zmodule_name='%s'r )�.0�keyr r r �
<listcomp>B s z!build_pattern.<locals>.<listcomp>zyname_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
z�import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
z�import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
z3power< bare_with_attr=(%s) trailer<'.' any > any* >)r r �keys)�mappingZmod_listZ
bare_namesr r r �
build_patternA s ���r" c sT e Zd ZdZdZeZdZdd� Z� fdd�Z � fdd�Z
� fd d
�Z d d � Z � Z
S )
�
FixImportsT� c C s d� t| j��S )Nr )r r" r! ��selfr r r r" ` s zFixImports.build_patternc s | � � | _tt| ��� d S �N)r" ZPATTERN�superr# �compile_patternr% �� __class__r r r) c s
zFixImports.compile_patternc sH t t| �j� � |�}|rDd|kr@t� fdd�t|d�D ��r@dS |S dS )N�bare_with_attrc 3 s | ]}� |�V qd S r' r )r �obj��matchr r � <genexpr>q s z#FixImports.match.<locals>.<genexpr>�parentF)r( r# r/ �anyr )r& �node�resultsr* r. r r/ j s �zFixImports.matchc s t t| ��||� i | _d S r' )r( r# �
start_tree�replace)r& Ztree�filenamer* r r r5 v s zFixImports.start_treec C s� |� d�}|rh|j}| j| }|�t||jd�� d|krD|| j|< d|kr�| �|�}|r�| �||� n2|d d }| j� |j�}|r�|�t||jd�� d S )NZ module_name)�prefixZ name_importZmultiple_importsr, � )�get�valuer! r6 r r8 r/ � transform)r& r3 r4 Z
import_modZmod_name�new_nameZ bare_namer r r r< z s
zFixImports.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZkeep_line_order�MAPPINGr! Z run_orderr" r) r/ r5 r< �
__classcell__r r r* r r# U s r# N)
� r Z
fixer_utilr r rA r r" ZBaseFixr# r r r r �<module> sj �5 fixes/__pycache__/fix_input.cpython-38.opt-2.pyc 0000644 00000001554 15053244165 0015501 0 ustar 00 U
e5d� � @ sH d dl mZ d dlmZmZ d dl mZ e�d�ZG dd� dej�Z dS )� )�
fixer_base)�Call�Name)�patcompz&power< 'eval' trailer< '(' any ')' > >c @ s e Zd ZdZdZdd� ZdS )�FixInputTzL
power< 'input' args=trailer< '(' [any] ')' > >
c C s6 t �|jj�rd S |�� }d|_ttd�|g|jd�S )N� �eval)�prefix)�context�match�parentZcloner r r )�selfZnodeZresults�new� r �//usr/lib64/python3.8/lib2to3/fixes/fix_input.py� transform s
zFixInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r N)
r r Z
fixer_utilr r r Zcompile_patternr
ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_metaclass.cpython-38.pyc 0000644 00000012336 15053244165 0015356 0 ustar 00 U
e5d � @ sv d Z ddlmZ ddlmZ ddlmZmZmZ dd� Z dd� Z
d d
� Z d d � Z d
d� Z
dd� ZG dd� dej�ZdS )a� Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherits
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
� )�
fixer_base)�token)�syms�Node�Leafc C sz | j D ]n}|jtjkr"t|� S |jtjkr|j r|j d }|jtjkr|j r|j d }t|t�r|j dkr dS qdS )z� we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
� �
__metaclass__TF)
�children�typer �suite�
has_metaclass� simple_stmt� expr_stmt�
isinstancer �value)�parent�node� expr_nodeZ left_side� r �3/usr/lib64/python3.8/lib2to3/fixes/fix_metaclass.pyr s
�r c C s� | j D ]}|jtjkr dS qt| j �D ]\}}|jtjkr( qJq(td��ttjg �}| j |d d� r�| j |d }|� |�
� � |� � qV| � |� |}dS )zf one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
NzNo class suite and no ':'!� ) r r
r r � enumerater �COLON�
ValueErrorr � append_child�clone�remove)�cls_noder �ir � move_noder r r �fixup_parse_tree- s
r c
C s� t |j�D ]\}}|jtjkr
q(q
dS |�� ttjg �}ttj |g�}|j|d� rz|j| }|�
|� � � |�� qJ| � ||� |jd jd }|jd jd } | j
|_
dS )z� if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
Nr )r r r
r �SEMIr r r r r
r r � insert_child�prefix)
r r Z stmt_nodeZsemi_indr Znew_exprZnew_stmtr Z new_leaf1Z old_leaf1r r r �fixup_simple_stmtG s
r$ c C s* | j r&| j d jtjkr&| j d �� d S )N���)r r
r �NEWLINEr )r r r r �remove_trailing_newline_ s r' c c s� | j D ]}|jtjkr q$qtd��tt|j ��D ]t\}}|jtjkr2|j r2|j d }|jtjkr2|j r2|j d }t |t
�r2|j dkr2t |||� t
|� |||fV q2d S )NzNo class suite!r r )r r
r r r �listr r
r r r r r$ r' )r r r Z simple_noder Z left_noder r r �
find_metasd s
� r) c C sz | j ddd� }|r,|�� }|jtjkrq,q|rv|�� }t|t�r^|jtjkr^|jrZd|_dS |� |j ddd� � q,dS )z� If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
Nr% � )
r �popr
r �INDENTr r �DEDENTr# �extend)r Zkidsr r r r � fixup_indent{ s r/ c @ s e Zd ZdZdZdd� ZdS )� FixMetaclassTz
classdef<any*>
c C sJ t |�s d S t|� d }t|�D ]\}}}|}|�� q |jd j}t|j�dkr�|jd jtjkrp|jd }n(|jd � � } t
tj| g�}|� d|� n�t|j�dkr�t
tjg �}|� d|� nZt|j�dk�rt
tjg �}|� dt
tjd�� |� d|� |� dt
tjd�� ntd ��|jd jd }
d
|
_|
j} |j�rZ|�t
tjd �� d |
_nd
|
_|jd } | jtjk�s|t�d
| jd _d
| jd _|�|� t|� |j�s�|�� t
|d�}
| |
_|�|
� |�t
tjd�� nbt|j�dk�rF|jd jtjk�rF|jd jtjk�rFt
|d�}
|� d|
� |� dt
tjd�� d S )Nr � � � � r �)�(zUnexpected class definition� metaclass�,� r* r �pass�
���r% ) r r r) r r r
�lenr �arglistr r Z set_childr" r r �RPAR�LPARr r r# r �COMMAr �AssertionErrorr/ r& r, r- )�selfr ZresultsZlast_metaclassr r ZstmtZ text_typer> r Zmeta_txtZorig_meta_prefixr Z pass_leafr r r � transform� sd
��
zFixMetaclass.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNrD r r r r r0 � s r0 N)�__doc__r* r Zpygramr Z
fixer_utilr r r r r r$ r' r) r/ ZBaseFixr0 r r r r �<module> s fixes/__pycache__/fix_funcattrs.cpython-38.opt-1.pyc 0000644 00000001713 15053244165 0016347 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z3Fix function attribute names (f.func_x -> f.__x__).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixFuncattrsTz�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s2 |d d }|� td|jdd � |jd�� d S )N�attr� z__%s__� )�prefix)�replacer �valuer )�selfZnodeZresultsr � r �3/usr/lib64/python3.8/lib2to3/fixes/fix_funcattrs.py� transform s �zFixFuncattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_unicode.cpython-38.pyc 0000644 00000003010 15053244165 0015015 0 ustar 00 U
e5d� � @ s< d Z ddlmZ ddlmZ ddd�ZG dd� dej�Zd S )
z�Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
� )�token)�
fixer_base�chr�str)ZunichrZunicodec s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�
FixUnicodeTz STRING | 'unicode' | 'unichr'c s" t t| ��||� d|jk| _d S )N�unicode_literals)�superr �
start_treeZfuture_featuresr )�selfZtree�filename�� __class__� �1/usr/lib64/python3.8/lib2to3/fixes/fix_unicode.pyr s zFixUnicode.start_treec C s� |j tjkr$|�� }t|j |_|S |j tjkr�|j}| jsj|d dkrjd|krjd�dd� |� d�D ��}|d dkr�|dd � }||jkr�|S |�� }||_|S d S ) N� z'"�\z\\c S s g | ]}|� d d�� dd��qS )z\uz\\uz\Uz\\U)�replace)�.0�vr r r �
<listcomp> s �z(FixUnicode.transform.<locals>.<listcomp>ZuU� )
�typer �NAMEZclone�_mapping�value�STRINGr �join�split)r
ZnodeZresults�new�valr r r � transform s"
�
zFixUnicode.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r �
__classcell__r r r r r s r N)�__doc__Zpgen2r � r r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_types.cpython-38.opt-2.pyc 0000644 00000002516 15053244165 0015505 0 ustar 00 U
e5d� � @ sl d dl mZ d dlmZ dddddddd d
d d
d d
ddddddddd�Zdd� eD �ZG dd� dej�ZdS )� )�
fixer_base)�Name�bool�
memoryview�type�complex�dictztype(Ellipsis)�float�int�list�objectz
type(None)ztype(NotImplemented)�slice�bytesz(str,)�tuple�str�range)Z BooleanTypeZ
BufferTypeZ ClassTypeZ ComplexTypeZDictTypeZDictionaryTypeZ EllipsisTypeZ FloatTypeZIntTypeZListTypeZLongTypeZ
ObjectTypeZNoneTypeZNotImplementedTypeZ SliceTypeZ
StringTypeZ StringTypesZ TupleTypeZTypeTypeZ UnicodeTypeZ
XRangeTypec C s g | ] }d | �qS )z)power< 'types' trailer< '.' name='%s' > >� )�.0�tr r �//usr/lib64/python3.8/lib2to3/fixes/fix_types.py�
<listcomp>3 s r c @ s" e Zd ZdZd�e�Zdd� ZdS )�FixTypesT�|c C s& t �|d j�}|r"t||jd�S d S )N�name)�prefix)�
_TYPE_MAPPING�get�valuer r )�selfZnodeZresultsZ new_valuer r r � transform9 s zFixTypes.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�join�_patsZPATTERNr r r r r r 5 s
r N)� r Z
fixer_utilr r r$ ZBaseFixr r r r r �<module> s2 � fixes/__pycache__/fix_operator.cpython-38.pyc 0000644 00000010167 15053244165 0015235 0 ustar 00 U
e5db
� @ sN d Z ddlZddlmZ ddlmZmZmZm Z dd� Z
G dd� dej �Z dS ) a� Fixer for operator functions.
operator.isCallable(obj) -> callable(obj)
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.abc.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.abc.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
� N)�
fixer_base)�Call�Name�String� touch_importc s � fdd�}|S )Nc s
� | _ | S �N)�
invocation)�f��s� �2/usr/lib64/python3.8/lib2to3/fixes/fix_operator.py�dec s zinvocation.<locals>.decr )r r r r
r
r s r c @ s� e Zd ZdZdZdZdZdeeed� Zdd� Z e
d �d
d � �Z e
d �d
d� �Z e
d�dd� �Z
e
d�dd� �Ze
d�dd� �Ze
d�dd� �Ze
d�d d � �Zd d � Zd d!� Zd"d#� Zd$S )%� FixOperatorTZprez�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
z'(' obj=any ')'z�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
)�methods�objc C s" | � ||�}|d k r |||�S d S r )�
_check_method)�self�node�results�methodr r r
� transform+ s zFixOperator.transformzoperator.contains(%s)c C s | � ||d�S )N�contains��_handle_rename�r r r r r r
�_sequenceIncludes0 s z FixOperator._sequenceIncludesz callable(%s)c C s" |d }t td�|�� g|jd�S )Nr �callable��prefix)r r �cloner )r r r r r r r
� _isCallable4 s zFixOperator._isCallablezoperator.mul(%s)c C s | � ||d�S )N�mulr r r r r
�_repeat9 s zFixOperator._repeatzoperator.imul(%s)c C s | � ||d�S )N�imulr r r r r
�_irepeat= s zFixOperator._irepeatz(isinstance(%s, collections.abc.Sequence)c C s | � ||dd�S )N�collections.abc�Sequence��_handle_type2abcr r r r
�_isSequenceTypeA s zFixOperator._isSequenceTypez'isinstance(%s, collections.abc.Mapping)c C s | � ||dd�S )Nr& �Mappingr( r r r r
�_isMappingTypeE s zFixOperator._isMappingTypez isinstance(%s, numbers.Number)c C s | � ||dd�S )NZnumbers�Numberr( r r r r
�
_isNumberTypeI s zFixOperator._isNumberTypec C s |d d }||_ |�� d S )Nr r )�valueZchanged)r r r �namer r r r
r M s zFixOperator._handle_renamec C sF t d ||� |d }|�� tdd�||g� �g}ttd�||jd�S )Nr z, �.�
isinstancer )r r r �joinr r r )r r r �module�abcr �argsr r r
r) R s z FixOperator._handle_type2abcc C s^ t | d|d d j �}t|tjj�rZd|kr2|S t|d �f}|j| }| �|d| � d S )N�_r r r4 r zYou should use '%s' here.) �getattrr/ r2 � collectionsr5 �Callable�strr Zwarning)r r r r �subZinvocation_strr r r
r X s
zFixOperator._check_methodN)�__name__�
__module__� __qualname__Z
BM_compatible�orderr r �dictZPATTERNr r r r! r# r% r* r, r. r r) r r r r r
r s2
�
r )
�__doc__Zcollections.abcr9 Zlib2to3r Zlib2to3.fixer_utilr r r r r ZBaseFixr r r r r
�<module> s
fixes/__pycache__/fix_asserts.cpython-38.pyc 0000644 00000002372 15053244165 0015065 0 ustar 00 U
e5d� � @ sT d Z ddlmZ ddlmZ edddddd d
dddddd d d
�ZG dd� de�ZdS )z5Fixer that replaces deprecated unittest method names.� )�BaseFix)�NameZ
assertTrueZ assertEqualZassertNotEqualZassertAlmostEqualZassertNotAlmostEqualZ assertRegexZassertRaisesRegexZ assertRaisesZ assertFalse)Zassert_Z assertEqualsZassertNotEqualsZassertAlmostEqualsZassertNotAlmostEqualsZassertRegexpMatchesZassertRaisesRegexpZfailUnlessEqualZ failIfEqualZfailUnlessAlmostEqualZfailIfAlmostEqualZ
failUnlessZfailUnlessRaisesZfailIfc @ s( e Zd Zdd�eee�� Zdd� ZdS )�
FixAssertszH
power< any+ trailer< '.' meth=(%s)> any* >
�|c C s, |d d }|� ttt|� |jd�� d S )NZmeth� )�prefix)�replacer �NAMES�strr )�selfZnodeZresults�name� r
�1/usr/lib64/python3.8/lib2to3/fixes/fix_asserts.py� transform s zFixAsserts.transformN) �__name__�
__module__� __qualname__�join�map�reprr ZPATTERNr r
r
r
r r s �r N)�__doc__Z
fixer_baser Z
fixer_utilr �dictr r r
r
r
r �<module> s& � fixes/__pycache__/fix_print.cpython-38.opt-2.pyc 0000644 00000003664 15053244165 0015502 0 ustar 00 U
e5d � @ sh d dl mZ d dl mZ d dlmZ d dl mZ d dlmZmZm Z m
Z
e� d�Z G dd� dej
�Zd S )
� )�patcomp)�pytree)�token)�
fixer_base)�Name�Call�Comma�Stringz"atom< '(' [atom|STRING|NAME] ')' >c @ s$ e Zd ZdZdZdd� Zdd� ZdS )�FixPrintTzP
simple_stmt< any* bare='print' any* > | print_stmt
c
C s` |� d�}|r,|�ttd�g |jd�� d S |jdd � }t|�dkrXt�|d �rXd S d } }}|r�|d t � kr�|d d� }d}|r�|d t
� t j
d�kr�|d �� }|d d � }d
d � |D �}|r�d |d _|d k s�|d k s�|d k �rF|d k �r| �|d
tt|��� |d k �r.| �|dtt|��� |d k �rF| �|d|� ttd�|�} |j| _| S )NZbare�print)�prefix� � ���� z>>� c S s g | ] }|� � �qS � )�clone)�.0�argr r �//usr/lib64/python3.8/lib2to3/fixes/fix_print.py�
<listcomp>? s z&FixPrint.transform.<locals>.<listcomp>� �sep�end�file)�get�replacer r r Zchildren�len� parend_expr�matchr r �Leafr �
RIGHTSHIFTr � add_kwargr �repr)
�selfZnodeZresultsZ
bare_print�argsr r r Zl_argsZn_stmtr r r � transform% s:
�
zFixPrint.transformc C sN d|_ t�| jjt|�t�tjd�|f�}|r@|� t
� � d|_ |� |� d S )Nr �=r ) r r ZNodeZsymsZargumentr r! r �EQUAL�appendr )r% Zl_nodesZs_kwdZn_exprZ
n_argumentr r r r# M s
�� zFixPrint.add_kwargN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r# r r r r r
s (r
N)r r r Zpgen2r r Z
fixer_utilr r r r Zcompile_patternr ZBaseFixr
r r r r �<module> s � fixes/__pycache__/__init__.cpython-38.opt-2.pyc 0000644 00000000211 15053244165 0015220 0 ustar 00 U
e5d/ � @ s d S )N� r r r �./usr/lib64/python3.8/lib2to3/fixes/__init__.py�<module> � fixes/__pycache__/fix_intern.cpython-38.opt-2.pyc 0000644 00000002051 15053244165 0015632 0 ustar 00 U
e5dx � @ s2 d dl mZ d dlmZmZ G dd� dej�ZdS )� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixInternTZprez�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sR |r2|d }|r2|j | jjkr2|jd jdkr2d S d}t|||�}td d|� |S )N�obj� > �**�*)�sys�internr
)�typeZsymsZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_intern.py� transform s � zFixIntern.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_funcattrs.cpython-38.pyc 0000644 00000001713 15053244165 0015410 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z3Fix function attribute names (f.func_x -> f.__x__).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixFuncattrsTz�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s2 |d d }|� td|jdd � |jd�� d S )N�attr� z__%s__� )�prefix)�replacer �valuer )�selfZnodeZresultsr � r �3/usr/lib64/python3.8/lib2to3/fixes/fix_funcattrs.py� transform s �zFixFuncattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_sys_exc.cpython-38.opt-2.pyc 0000644 00000002325 15053244165 0016014 0 ustar 00 U
e5d
� @ sF d dl mZ d dlmZmZmZmZmZmZm Z G dd� dej
�Z dS )� )�
fixer_base)�Attr�Call�Name�Number� Subscript�Node�symsc @ s: e Zd ZdddgZdZdd�dd� eD �� Zd d
� Zd S ) � FixSysExc�exc_type� exc_value�
exc_tracebackTzN
power< 'sys' trailer< dot='.' attribute=(%s) > >
�|c c s | ]}d | V qdS )z'%s'N� )�.0�er r �1/usr/lib64/python3.8/lib2to3/fixes/fix_sys_exc.py� <genexpr> s zFixSysExc.<genexpr>c C st |d d }t | j�|j��}ttd�|jd�}ttd�|�}|d j|d jd _|� t
|�� t t j
||jd�S )NZ attribute� �exc_info)�prefix�sys�dot� )r r �index�valuer r r r Zchildren�appendr r r Zpower)�selfZnodeZresultsZsys_attrr Zcall�attrr r r � transform s zFixSysExc.transformN)�__name__�
__module__� __qualname__r Z
BM_compatible�joinZPATTERNr r r r r r
s
�r
N) � r Z
fixer_utilr r r r r r r ZBaseFixr
r r r r �<module> s $ fixes/__pycache__/fix_paren.cpython-38.pyc 0000644 00000002551 15053244165 0014505 0 ustar 00 U
e5d� � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )zuFixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``.� )�
fixer_base)�LParen�RParenc @ s e Zd ZdZdZdd� ZdS )�FixParenTa
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C s8 |d }t � }|j|_d|_|�d|� |�t� � d S )N�target� � )r �prefixZ insert_childZ append_childr )�selfZnodeZresultsr Zlparen� r �//usr/lib64/python3.8/lib2to3/fixes/fix_paren.py� transform% s zFixParen.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__r r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_exec.cpython-38.opt-1.pyc 0000644 00000002136 15053244165 0015262 0 ustar 00 U
e5d� � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )z�Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
� )�
fixer_base)�Comma�Name�Callc @ s e Zd ZdZdZdd� ZdS )�FixExecTzx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� | j }|d }|�d�}|�d�}|�� g}d|d _|d k rR|�t� |�� g� |d k rn|�t� |�� g� ttd�||jd�S )N�a�b�c� � �exec)�prefix)�syms�getZcloner
�extendr r r )�selfZnodeZresultsr r r r �args� r �./usr/lib64/python3.8/lib2to3/fixes/fix_exec.py� transform s
zFixExec.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) �__doc__r
r Z
fixer_utilr r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_except.cpython-38.opt-1.pyc 0000644 00000005375 15053244165 0015636 0 ustar 00 U
e5d
� @ sf d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z m Z dd� Z
G dd � d ej�Zd
S ) a� Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
� )�pytree)�token)�
fixer_base)�Assign�Attr�Name�is_tuple�is_list�symsc c sD t | �D ]6\}}|jtjkr|jd jdkr|| |d fV qd S )N� �exceptr )� enumerate�typer
�
except_clause�children�value)Znodes�i�n� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_except.py� find_excepts s r c @ s e Zd ZdZdZdd� ZdS )� FixExceptTa1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C sx | j }dd� |d D �}dd� |d D �}t|�D �]\}}t|j�dkr2|jdd� \}} }
| �tdd d
�� |
jtjk�r8t| � � d d
�} |
�
� } d | _ |
�| � | �
� } |j}
t |
�D ]\}}t
|tj�r� q�q�t|
�s�t|
�r�t| t| td ���}n
t| | �}t|
d |� �D ]}|�d
|� �q|�||� q2|
j d kr2d |
_ q2dd� |jd d� D �| | }t�|j|�S )Nc S s g | ] }|� � �qS r ��clone)�.0r r r r �
<listcomp>2 s z'FixExcept.transform.<locals>.<listcomp>�tailc S s g | ] }|� � �qS r r )r Zchr r r r 4 s Zcleanup� � �as� )�prefix� �argsr c S s g | ] }|� � �qS r r )r �cr r r r \ s � )r
r �lenr �replacer r r �NAME�new_namer r! r
�
isinstancer ZNoder r r r �reversedZ insert_child)�selfZnodeZresultsr
r Z try_cleanupr Ze_suite�EZcomma�NZnew_N�targetZ suite_stmtsr ZstmtZassignZchildr r r r � transform/ s6
zFixExcept.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr0 r r r r r $ s r N)�__doc__r" r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_apply.cpython-38.opt-1.pyc 0000644 00000003161 15053244165 0015462 0 ustar 00 U
e5d* � @ sR d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z G dd� dej
�Z dS ) zIFixer for apply().
This converts apply(func, v, k) into (func)(*v, **k).� )�pytree)�token)�
fixer_base)�Call�Comma� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixApplyTa.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C s, | j }|d }|d }|�d�}|rF|j| j jkrF|jd jdkrFd S |rl|j| j jkrl|jd jdkrld S |j}|�� }|jtj |j
fkr�|j|j ks�|jd jtj kr�t
|�}d|_|�� }d|_|d k r�|�� }d|_t�tjd �|g}|d k �r |�t� t�tj d�|g� d
|d _t|||d �S ) N�func�args�kwds� > �**�*r
���� r � )�prefix)�syms�get�typeZargumentZchildren�valuer Zcloner �NAMEZatomZpower�
DOUBLESTARr r ZLeaf�STAR�extendr r ) �selfZnodeZresultsr r r
r r Z l_newargs� r �//usr/lib64/python3.8/lib2to3/fixes/fix_apply.py� transform sF
��
��
�
zFixApply.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) �__doc__r r Zpgen2r r Z
fixer_utilr r r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_next.cpython-38.pyc 0000644 00000006006 15053244165 0014355 0 ustar 00 U
e5df � @ sn d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z dZ G dd� dej
�Zd d
� Zd d � Zd
d� ZdS )z.Fixer for it.next() -> next(it), per PEP 3114.� )�token)�python_symbols)�
fixer_base)�Name�Call� find_bindingz;Calls to builtin next() possibly shadowed by global bindingc s0 e Zd ZdZdZdZ� fdd�Zdd� Z� ZS )�FixNextTa�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
Zprec s> t t| ��||� td|�}|r4| �|t� d| _nd| _d S )N�nextTF)�superr �
start_treer �warning� bind_warning�
shadowed_next)�selfZtree�filename�n�� __class__� �./usr/lib64/python3.8/lib2to3/fixes/fix_next.pyr $ s
zFixNext.start_treec C s |st �|�d�}|�d�}|�d�}|rz| jrF|�td|jd�� n2dd� |D �}d|d _|�ttd
|jd�|�� n�|r�td|jd�}|�|� nl|r�t|�r�|d }d�d d� |D ��� � d
kr�| �
|t � d S |�td�� n d|k�r| �
|t � d| _d S )N�base�attr�name�__next__)�prefixc S s g | ] }|� � �qS r )Zclone��.0r r r r �
<listcomp>9 s z%FixNext.transform.<locals>.<listcomp>� � r �headc S s g | ] }t |��qS r )�strr r r r r E s Z __builtin__�globalT) �AssertionError�getr �replacer r r �is_assign_target�join�stripr r
)r �nodeZresultsr r r r r r r r � transform. s.
zFixNext.transform) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERN�orderr r* �
__classcell__r r r r r s
r c C sF t | �}|d krdS |jD ]&}|jtjkr0 dS t|| �r dS qdS )NFT)� find_assign�children�typer �EQUAL�
is_subtree)r) ZassignZchildr r r r& Q s
r& c C s4 | j tjkr| S | j tjks&| jd kr*d S t| j�S �N)r2 �symsZ expr_stmtZ simple_stmt�parentr0 �r) r r r r0 ] s
r0 c s$ | � kr dS t � fdd�| jD ��S )NTc 3 s | ]}t |� �V qd S r5 )r4 )r �cr8 r r � <genexpr>g s z is_subtree.<locals>.<genexpr>)�anyr1 )�rootr) r r8 r r4 d s r4 N)�__doc__Zpgen2r Zpygramr r6 r r Z
fixer_utilr r r r
ZBaseFixr r& r0 r4 r r r r �<module> s @ fixes/__pycache__/fix_imports2.cpython-38.pyc 0000644 00000001035 15053244165 0015153 0 ustar 00 U
e5d! � @ s0 d Z ddlmZ ddd�ZG dd� dej�ZdS )zTFix incompatible imports and module references that must be fixed after
fix_imports.� )� fix_importsZdbm)ZwhichdbZanydbmc @ s e Zd ZdZeZdS )� FixImports2� N)�__name__�
__module__� __qualname__Z run_order�MAPPING�mapping� r
r
�2/usr/lib64/python3.8/lib2to3/fixes/fix_imports2.pyr s r N)�__doc__� r r Z
FixImportsr r
r
r
r �<module> s
� fixes/__pycache__/fix_operator.cpython-38.opt-1.pyc 0000644 00000010167 15053244165 0016174 0 ustar 00 U
e5db
� @ sN d Z ddlZddlmZ ddlmZmZmZm Z dd� Z
G dd� dej �Z dS ) a� Fixer for operator functions.
operator.isCallable(obj) -> callable(obj)
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.abc.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.abc.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
� N)�
fixer_base)�Call�Name�String� touch_importc s � fdd�}|S )Nc s
� | _ | S �N)�
invocation)�f��s� �2/usr/lib64/python3.8/lib2to3/fixes/fix_operator.py�dec s zinvocation.<locals>.decr )r r r r
r
r s r c @ s� e Zd ZdZdZdZdZdeeed� Zdd� Z e
d �d
d � �Z e
d �d
d� �Z e
d�dd� �Z
e
d�dd� �Ze
d�dd� �Ze
d�dd� �Ze
d�d d � �Zd d � Zd d!� Zd"d#� Zd$S )%� FixOperatorTZprez�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
z'(' obj=any ')'z�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
)�methods�objc C s" | � ||�}|d k r |||�S d S r )�
_check_method)�self�node�results�methodr r r
� transform+ s zFixOperator.transformzoperator.contains(%s)c C s | � ||d�S )N�contains��_handle_rename�r r r r r r
�_sequenceIncludes0 s z FixOperator._sequenceIncludesz callable(%s)c C s" |d }t td�|�� g|jd�S )Nr �callable��prefix)r r �cloner )r r r r r r r
� _isCallable4 s zFixOperator._isCallablezoperator.mul(%s)c C s | � ||d�S )N�mulr r r r r
�_repeat9 s zFixOperator._repeatzoperator.imul(%s)c C s | � ||d�S )N�imulr r r r r
�_irepeat= s zFixOperator._irepeatz(isinstance(%s, collections.abc.Sequence)c C s | � ||dd�S )N�collections.abc�Sequence��_handle_type2abcr r r r
�_isSequenceTypeA s zFixOperator._isSequenceTypez'isinstance(%s, collections.abc.Mapping)c C s | � ||dd�S )Nr& �Mappingr( r r r r
�_isMappingTypeE s zFixOperator._isMappingTypez isinstance(%s, numbers.Number)c C s | � ||dd�S )NZnumbers�Numberr( r r r r
�
_isNumberTypeI s zFixOperator._isNumberTypec C s |d d }||_ |�� d S )Nr r )�valueZchanged)r r r �namer r r r
r M s zFixOperator._handle_renamec C sF t d ||� |d }|�� tdd�||g� �g}ttd�||jd�S )Nr z, �.�
isinstancer )r r r �joinr r r )r r r �module�abcr �argsr r r
r) R s z FixOperator._handle_type2abcc C s^ t | d|d d j �}t|tjj�rZd|kr2|S t|d �f}|j| }| �|d| � d S )N�_r r r4 r zYou should use '%s' here.) �getattrr/ r2 � collectionsr5 �Callable�strr Zwarning)r r r r �subZinvocation_strr r r
r X s
zFixOperator._check_methodN)�__name__�
__module__� __qualname__Z
BM_compatible�orderr r �dictZPATTERNr r r r! r# r% r* r, r. r r) r r r r r
r s2
�
r )
�__doc__Zcollections.abcr9 Zlib2to3r Zlib2to3.fixer_utilr r r r r ZBaseFixr r r r r
�<module> s
fixes/__pycache__/fix_paren.cpython-38.opt-1.pyc 0000644 00000002551 15053244165 0015444 0 ustar 00 U
e5d� � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )zuFixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``.� )�
fixer_base)�LParen�RParenc @ s e Zd ZdZdZdd� ZdS )�FixParenTa
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C s8 |d }t � }|j|_d|_|�d|� |�t� � d S )N�target� � )r �prefixZ insert_childZ append_childr )�selfZnodeZresultsr Zlparen� r �//usr/lib64/python3.8/lib2to3/fixes/fix_paren.py� transform% s zFixParen.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__r r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_itertools.cpython-38.opt-1.pyc 0000644 00000003011 15053244165 0016353 0 ustar 00 U
e5d � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )aT Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
� )�
fixer_base)�Namec @ s* e Zd ZdZdZde� ZdZdd� ZdS )� FixItertoolsTz7('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')z�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
� c C s� d }|d d }d|krV|j dkrV|d |d }}|j}|�� |�� |j�|� |p^|j}|�t|j dd � |d�� d S )N�func� �it)Z ifilterfalseZ izip_longest�dot� )�prefix)�valuer �remove�parent�replacer )�selfZnodeZresultsr r r r � r �3/usr/lib64/python3.8/lib2to3/fixes/fix_itertools.py� transform s �
zFixItertools.transformN) �__name__�
__module__� __qualname__Z
BM_compatibleZit_funcs�localsZPATTERNZ run_orderr r r r r r s � r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_throw.cpython-38.pyc 0000644 00000003413 15053244165 0014541 0 ustar 00 U
e5d. � @ sZ d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z G dd� dej �Z
dS ) z�Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions.� )�pytree)�token)�
fixer_base)�Name�Call�ArgList�Attr�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixThrowTz�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C s� | j }|d �� }|jtjkr.| �|d� d S |�d�}|d krDd S |�� }t|�rndd� |jdd� D �}n d|_ |g}|d }d
|kr�|d
�� }d|_ t
||�} t | t d ��t
|g�g }
|�t�|j|
�� n|�t
||�� d S ) N�excz+Python 3 does not support string exceptions�valc S s g | ] }|� � �qS � )�clone)�.0�cr
r
�//usr/lib64/python3.8/lib2to3/fixes/fix_throw.py�
<listcomp>) s z&FixThrow.transform.<locals>.<listcomp>� ���� �args�tb�with_traceback)�symsr �typer �STRINGZcannot_convert�getr Zchildren�prefixr r r r �replacer ZNodeZpower) �selfZnodeZresultsr r r r Z
throw_argsr �eZwith_tbr
r
r � transform s*
zFixThrow.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr! r
r
r
r r
s r
N)�__doc__r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r
r
r
r �<module> s
fixes/__pycache__/fix_throw.cpython-38.opt-2.pyc 0000644 00000003044 15053244165 0015501 0 ustar 00 U
e5d. � @ sV d dl mZ d dlmZ d dl mZ d dlmZmZmZm Z m
Z
G dd� dej �Z dS )� )�pytree)�token)�
fixer_base)�Name�Call�ArgList�Attr�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixThrowTz�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C s� | j }|d �� }|jtjkr.| �|d� d S |�d�}|d krDd S |�� }t|�rndd� |jdd� D �}n d|_ |g}|d }d
|kr�|d
�� }d|_ t
||�} t | t d ��t
|g�g }
|�t�|j|
�� n|�t
||�� d S ) N�excz+Python 3 does not support string exceptions�valc S s g | ] }|� � �qS � )�clone)�.0�cr
r
�//usr/lib64/python3.8/lib2to3/fixes/fix_throw.py�
<listcomp>) s z&FixThrow.transform.<locals>.<listcomp>� ���� �args�tb�with_traceback)�symsr �typer �STRINGZcannot_convert�getr Zchildren�prefixr r r r �replacer ZNodeZpower) �selfZnodeZresultsr r r r Z
throw_argsr �eZwith_tbr
r
r � transform s*
zFixThrow.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr! r
r
r
r r
s r
N)
r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r
r
r
r �<module> s fixes/__pycache__/fix_has_key.cpython-38.opt-1.pyc 0000644 00000005532 15053244165 0015764 0 ustar 00 U
e5d| � @ sB d Z ddlmZ ddlmZ ddlmZmZ G dd� dej�ZdS )a& Fixer for has_key().
Calls to .has_key() methods are expressed in terms of the 'in'
operator:
d.has_key(k) -> k in d
CAVEATS:
1) While the primary target of this fixer is dict.has_key(), the
fixer will change any has_key() method call, regardless of its
class.
2) Cases like this will not be converted:
m = d.has_key
if m(k):
...
Only *calls* to has_key() are converted. While it is possible to
convert the above to something like
m = d.__contains__
if m(k):
...
this is currently not done.
� )�pytree)�
fixer_base)�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )� FixHasKeyTa�
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
c
C s| | j }|jj|jkr&| j�|j�r&d S |�d�}|d }|j}dd� |d D �}|d �� }|�d�} | rxdd� | D �} |j|j |j|j
|j |j |j
|jfkr�t|�}t|�d kr�|d
}nt�|j|�}d |_td d d
�}
|r�tdd d
�} t�|j| |
f�}
t�|j ||
|f�} | �r8t| �} t�|j| ft| � �} |jj|j |j|j|j|j|j|j |j |jf k�rrt| �} || _| S )N�negation�anchorc S s g | ] }|� � �qS � ��clone��.0�nr r �1/usr/lib64/python3.8/lib2to3/fixes/fix_has_key.py�
<listcomp>R s z'FixHasKey.transform.<locals>.<listcomp>�before�arg�afterc S s g | ] }|� � �qS r r
r r r r r V s � � � �in)�prefix�not) �syms�parent�typeZnot_test�pattern�match�getr r Z
comparisonZand_testZor_testZtestZlambdefZargumentr �lenr ZNodeZpowerr Zcomp_op�tuple�exprZxor_exprZand_exprZ
shift_exprZ
arith_exprZtermZfactor)
�selfZnodeZresultsr r r r r r r Zn_opZn_not�newr r r � transformG sV �
�
�zFixHasKey.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr% r r r r r & s r N) �__doc__� r r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_buffer.cpython-38.opt-2.pyc 0000644 00000001336 15053244165 0015611 0 ustar 00 U
e5dN � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdZdd� ZdS )� FixBufferTzR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s |d }|� td|jd�� d S )N�name�
memoryview)�prefix)�replacer r )�selfZnodeZresultsr � r
�0/usr/lib64/python3.8/lib2to3/fixes/fix_buffer.py� transform s zFixBuffer.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s r N)� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_repr.cpython-38.opt-2.pyc 0000644 00000001410 15053244165 0015301 0 ustar 00 U
e5de � @ s6 d dl mZ d dlmZmZmZ G dd� dej�ZdS )� )�
fixer_base)�Call�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixReprTz7
atom < '`' expr=any '`' >
c C s8 |d � � }|j| jjkr"t|�}ttd�|g|jd�S )N�expr�repr)�prefix)Zclone�typeZsymsZ testlist1r r r r )�selfZnodeZresultsr � r �./usr/lib64/python3.8/lib2to3/fixes/fix_repr.py� transform s zFixRepr.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N)� r Z
fixer_utilr r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_idioms.cpython-38.opt-2.pyc 0000644 00000006420 15053244165 0015623 0 ustar 00 U
e5d � @ sJ d dl mZ d dlmZmZmZmZmZmZ dZ dZ
G dd� dej �Z dS )� )�
fixer_base)�Call�Comma�Name�Node� BlankLine�symsz0(n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)z(power< 'type' trailer< '(' x=any ')' > >c sP e Zd ZdZdeeeef Z� fdd�Zdd� Zdd� Z d d
� Z
d d � Z � Z S )
� FixIdiomsTa�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c s8 t t| ��|�}|r4d|kr4|d |d kr0|S d S |S )N�sortedZid1Zid2)�superr �match)�self�node�r�� __class__� �0/usr/lib64/python3.8/lib2to3/fixes/fix_idioms.pyr O s zFixIdioms.matchc C sH d|kr| � ||�S d|kr(| �||�S d|kr<| �||�S td��d S )N�
isinstance�whiler
z
Invalid match)�transform_isinstance�transform_while�transform_sort� RuntimeError)r
r �resultsr r r � transformZ s zFixIdioms.transformc C sh |d � � }|d � � }d|_d|_ttd�|t� |g�}d|kr\d|_ttjtd�|g�}|j|_|S )N�x�T� � r �n�not)�clone�prefixr r r r r Znot_test)r
r r r r Ztestr r r r d s z FixIdioms.transform_isinstancec C s |d }|� td|jd�� d S )Nr �True�r# )�replacer r# )r
r r Zoner r r r p s zFixIdioms.transform_whilec C s� |d }|d }|� d�}|� d�}|r>|�td|jd�� n8|rn|�� }d|_|�ttd�|g|jd�� ntd��|�� |j}d |kr�|r�|�d �d
|d
jf} d � | �|d
_n"t
� }
|j � |
� |�d �d
|
_d S ) N�sort�next�list�exprr
r% r z should not have reached here�
� )
�getr& r r# r" r r �remove�
rpartition�joinr �parentZ append_child) r
r r Z sort_stmtZ next_stmtZ list_callZ simple_expr�newZbtwnZ prefix_linesZend_liner r r r t s,
�
zFixIdioms.transform_sort)
�__name__�
__module__� __qualname__Zexplicit�TYPE�CMPZPATTERNr r r r r �
__classcell__r r r r r % s %
�'
r N)
r r Z
fixer_utilr r r r r r r7 r6 ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_map.cpython-38.opt-2.pyc 0000644 00000004370 15053244165 0015116 0 ustar 00 U
e5d8 � @ sb d dl mZ d dlmZ d dlmZmZmZmZm Z d dl
m Z d dl
mZ G dd� dej�ZdS ) � )�token)�
fixer_base)�Name�ArgList�Call�ListComp�in_special_context)�python_symbols)�Nodec @ s e Zd ZdZdZdZdd� ZdS )�FixMapTaL
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
[extra_trailers=trailer*]
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'map' args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.mapc C s� | � |�rd S g }d|kr6|d D ]}|�|�� � q"|jjtjkrr| �|d� |�� }d|_t t
d�|g�}�n&d|kr�t |d �� |d �� |d �� �}t tj
|g| dd �}n�d
|kr�|d �� }d|_n�d |k�rf|d }|jtjk�rH|jd
jtjk�rH|jd
jd jtjk�rH|jd
jd jdk�rH| �|d� d S t tj
t
d�|�� g�}d|_t|��rtd S t tj
t
d�t|g�g| �}d|_|j|_|S )NZextra_trailersz You should use a for loop here� �listZ
map_lambdaZxp�fp�it)�prefixZmap_none�arg�args� � �Nonezjcannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence�map)Z should_skip�appendZclone�parent�type�symsZ simple_stmtZwarningr r r r r
ZpowerZtrailerZchildrenZarglistr �NAME�valuer r )�selfZnodeZresultsZtrailers�t�newr � r �-/usr/lib64/python3.8/lib2to3/fixes/fix_map.py� transform@ sN
�
���
zFixMap.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr" r r r r! r s r N)Zpgen2r r r Z
fixer_utilr r r r r Zpygramr r Zpytreer
ZConditionalFixr r r r r! �<module> s
fixes/__pycache__/fix_isinstance.cpython-38.pyc 0000644 00000003012 15053244165 0015531 0 ustar 00 U
e5dH � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )a, Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
� )�
fixer_base)�tokenc @ s e Zd ZdZdZdZdd� ZdS )�
FixIsinstanceTz�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
� c C s� t � }|d }|j}g }t|�}|D ]p\}} | jtjkrr| j|krr|t|�d k r�||d jtjkr�t |� q$q$|�
| � | jtjkr$|� | j� q$|r�|d jtjkr�|d= t|�dkr�|j }
|
j
|d _
|
�|d � n||d d �< |�� d S )N�args� ���� )�setZchildren� enumerate�typer �NAME�value�len�COMMA�next�append�add�parent�prefix�replaceZchanged) �selfZnodeZresultsZnames_insertedZtestlistr Znew_args�iterator�idx�argZatom� r �4/usr/lib64/python3.8/lib2to3/fixes/fix_isinstance.py� transform s* $
zFixIsinstance.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_asserts.cpython-38.opt-2.pyc 0000644 00000002264 15053244165 0016025 0 ustar 00 U
e5d� � @ sP d dl mZ d dlmZ eddddddd dddddd
d d �ZG d
d� de�ZdS )� )�BaseFix)�NameZ
assertTrueZ assertEqualZassertNotEqualZassertAlmostEqualZassertNotAlmostEqualZ assertRegexZassertRaisesRegexZ assertRaisesZ assertFalse)Zassert_Z assertEqualsZassertNotEqualsZassertAlmostEqualsZassertNotAlmostEqualsZassertRegexpMatchesZassertRaisesRegexpZfailUnlessEqualZ failIfEqualZfailUnlessAlmostEqualZfailIfAlmostEqualZ
failUnlessZfailUnlessRaisesZfailIfc @ s( e Zd Zdd�eee�� Zdd� ZdS )�
FixAssertszH
power< any+ trailer< '.' meth=(%s)> any* >
�|c C s, |d d }|� ttt|� |jd�� d S )NZmeth� )�prefix)�replacer �NAMES�strr )�selfZnodeZresults�name� r
�1/usr/lib64/python3.8/lib2to3/fixes/fix_asserts.py� transform s zFixAsserts.transformN) �__name__�
__module__� __qualname__�join�map�reprr ZPATTERNr r
r
r
r r s �r N)Z
fixer_baser Z
fixer_utilr �dictr r r
r
r
r �<module> s$ � fixes/__pycache__/fix_buffer.cpython-38.opt-1.pyc 0000644 00000001443 15053244165 0015607 0 ustar 00 U
e5dN � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z4Fixer that changes buffer(...) into memoryview(...).� )�
fixer_base)�Namec @ s e Zd ZdZdZdZdd� ZdS )� FixBufferTzR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s |d }|� td|jd�� d S )N�name�
memoryview)�prefix)�replacer r )�selfZnodeZresultsr � r
�0/usr/lib64/python3.8/lib2to3/fixes/fix_buffer.py� transform s zFixBuffer.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_asserts.cpython-38.opt-1.pyc 0000644 00000002372 15053244165 0016024 0 ustar 00 U
e5d� � @ sT d Z ddlmZ ddlmZ edddddd d
dddddd d d
�ZG dd� de�ZdS )z5Fixer that replaces deprecated unittest method names.� )�BaseFix)�NameZ
assertTrueZ assertEqualZassertNotEqualZassertAlmostEqualZassertNotAlmostEqualZ assertRegexZassertRaisesRegexZ assertRaisesZ assertFalse)Zassert_Z assertEqualsZassertNotEqualsZassertAlmostEqualsZassertNotAlmostEqualsZassertRegexpMatchesZassertRaisesRegexpZfailUnlessEqualZ failIfEqualZfailUnlessAlmostEqualZfailIfAlmostEqualZ
failUnlessZfailUnlessRaisesZfailIfc @ s( e Zd Zdd�eee�� Zdd� ZdS )�
FixAssertszH
power< any+ trailer< '.' meth=(%s)> any* >
�|c C s, |d d }|� ttt|� |jd�� d S )NZmeth� )�prefix)�replacer �NAMES�strr )�selfZnodeZresults�name� r
�1/usr/lib64/python3.8/lib2to3/fixes/fix_asserts.py� transform s zFixAsserts.transformN) �__name__�
__module__� __qualname__�join�map�reprr ZPATTERNr r
r
r
r r s �r N)�__doc__Z
fixer_baser Z
fixer_utilr �dictr r r
r
r
r �<module> s& � fixes/__pycache__/fix_getcwdu.cpython-38.pyc 0000644 00000001417 15053244165 0015042 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z1
Fixer that changes os.getcwdu() to os.getcwd().
� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixGetcwduTzR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s |d }|� td|jd�� d S )N�name�getcwd)�prefix)�replacer r )�selfZnodeZresultsr � r
�1/usr/lib64/python3.8/lib2to3/fixes/fix_getcwdu.py� transform s zFixGetcwdu.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r
s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_numliterals.cpython-38.opt-1.pyc 0000644 00000001772 15053244165 0016702 0 ustar 00 U
e5d � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z-Fixer that turns 1L into 1, 0755 into 0o755.
� )�token)�
fixer_base)�Numberc @ s" e Zd ZejZdd� Zdd� ZdS )�FixNumliteralsc C s |j �d�p|j d dkS )N�0����Ll)�value�
startswith)�self�node� r
�5/usr/lib64/python3.8/lib2to3/fixes/fix_numliterals.py�match s zFixNumliterals.matchc C s` |j }|d dkr |d d� }n2|�d�rR|�� rRtt|��dkrRd|dd � }t||jd�S )Nr r r � Z0o)�prefix)r r
�isdigit�len�setr r )r r Zresults�valr
r
r � transform s "zFixNumliterals.transformN)�__name__�
__module__� __qualname__r �NUMBERZ _accept_typer r r
r
r
r r s r N) �__doc__Zpgen2r � r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_exec.cpython-38.pyc 0000644 00000002170 15053244165 0014321 0 ustar 00 U
e5d� � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )z�Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
� )�
fixer_base)�Comma�Name�Callc @ s e Zd ZdZdZdd� ZdS )�FixExecTzx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� |st �| j}|d }|�d�}|�d�}|�� g}d|d _|d k rZ|�t� |�� g� |d k rv|�t� |�� g� ttd�||jd�S )N�a�b�c� � �exec)�prefix) �AssertionError�syms�getZcloner
�extendr r r )�selfZnodeZresultsr r r r �args� r �./usr/lib64/python3.8/lib2to3/fixes/fix_exec.py� transform s
zFixExec.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) �__doc__r
r Z
fixer_utilr r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_buffer.cpython-38.pyc 0000644 00000001443 15053244165 0014650 0 ustar 00 U
e5dN � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z4Fixer that changes buffer(...) into memoryview(...).� )�
fixer_base)�Namec @ s e Zd ZdZdZdZdd� ZdS )� FixBufferTzR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s |d }|� td|jd�� d S )N�name�
memoryview)�prefix)�replacer r )�selfZnodeZresultsr � r
�0/usr/lib64/python3.8/lib2to3/fixes/fix_buffer.py� transform s zFixBuffer.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_long.cpython-38.pyc 0000644 00000001274 15053244165 0014340 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z/Fixer that turns 'long' into 'int' everywhere.
� )�
fixer_base)�is_probably_builtinc @ s e Zd ZdZdZdd� ZdS )�FixLongTz'long'c C s t |�rd|_|�� d S )N�int)r �valueZchanged)�selfZnodeZresults� r �./usr/lib64/python3.8/lib2to3/fixes/fix_long.py� transform s zFixLong.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_intern.cpython-38.opt-1.pyc 0000644 00000002151 15053244165 0015632 0 ustar 00 U
e5dx � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )z/Fixer for intern().
intern(s) -> sys.intern(s)� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixInternTZprez�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sR |r2|d }|r2|j | jjkr2|jd jdkr2d S d}t|||�}td d|� |S )N�obj� > �**�*)�sys�internr
)�typeZsymsZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_intern.py� transform s � zFixIntern.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)�__doc__� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_map.cpython-38.pyc 0000644 00000006024 15053244165 0014154 0 ustar 00 U
e5d8 � @ sf d Z ddlmZ ddlmZ ddlmZmZmZm Z m
Z
ddl m Z
ddlmZ G dd� dej�Zd S )
a Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
� )�token)�
fixer_base)�Name�ArgList�Call�ListComp�in_special_context)�python_symbols)�Nodec @ s e Zd ZdZdZdZdd� ZdS )�FixMapTaL
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
[extra_trailers=trailer*]
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'map' args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.mapc C s� | � |�rd S g }d|kr6|d D ]}|�|�� � q"|jjtjkrr| �|d� |�� }d|_t t
d�|g�}�n&d|kr�t |d �� |d �� |d �� �}t tj
|g| dd �}n�d
|kr�|d �� }d|_n�d |k�rf|d }|jtjk�rH|jd
jtjk�rH|jd
jd jtjk�rH|jd
jd jdk�rH| �|d� d S t tj
t
d�|�� g�}d|_t|��rtd S t tj
t
d�t|g�g| �}d|_|j|_|S )NZextra_trailersz You should use a for loop here� �listZ
map_lambdaZxp�fp�it)�prefixZmap_none�arg�args� � �Nonezjcannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence�map)Z should_skip�appendZclone�parent�type�symsZ simple_stmtZwarningr r r r r
ZpowerZtrailerZchildrenZarglistr �NAME�valuer r )�selfZnodeZresultsZtrailers�t�newr � r �-/usr/lib64/python3.8/lib2to3/fixes/fix_map.py� transform@ sN
�
���
zFixMap.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr" r r r r! r s r N)�__doc__Zpgen2r r r Z
fixer_utilr r r r r Zpygramr r Zpytreer
ZConditionalFixr r r r r! �<module> s fixes/__pycache__/fix_raw_input.cpython-38.opt-2.pyc 0000644 00000001323 15053244165 0016344 0 ustar 00 U
e5d� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixRawInputTzU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s |d }|� td|jd�� d S )N�name�input)�prefix)�replacer r )�selfZnodeZresultsr � r
�3/usr/lib64/python3.8/lib2to3/fixes/fix_raw_input.py� transform s zFixRawInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r s r N)� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_execfile.cpython-38.opt-2.pyc 0000644 00000003002 15053244165 0016114 0 ustar 00 U
e5d � @ sR d dl mZ d dlmZmZmZmZmZmZm Z m
Z
m Z m Z G dd� dej
�ZdS )� )�
fixer_base)
�Comma�Name�Call�LParen�RParen�Dot�Node�ArgList�String�symsc @ s e Zd ZdZdZdd� ZdS )� FixExecfileTz�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s& |d }|� d�}|� d�}|jd jd �� }t|�� t� tdd�g|d�}ttjt d�|g�}ttj
t � t d �g�ttj
t � t
� g�g} |g| }
|�� } d| _td
d�} |
t� | t� | g }
tt d �|
d �}|g}|d k r�|�t� |�� g� |d k �r|�t� |�� g� tt d
�||jd�S )N�filename�globals�locals���z"rb"� )Zrparen�open�readz'exec'�compile� �exec)�prefix)�getZchildrenZcloner
r r r r Zpowerr Ztrailerr r r r r �extend)�selfZnodeZresultsr r r Zexecfile_parenZ open_argsZ open_callr Z open_exprZ filename_argZexec_strZ compile_argsZ compile_call�args� r �2/usr/lib64/python3.8/lib2to3/fixes/fix_execfile.py� transform s.
��
zFixExecfile.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r
N)r r Z
fixer_utilr r r r r r r r
r r ZBaseFixr
r r r r �<module>
s 0 fixes/__pycache__/fix_except.cpython-38.opt-2.pyc 0000644 00000004477 15053244165 0015641 0 ustar 00 U
e5d
� @ sb d dl mZ d dlmZ d dl mZ d dlmZmZmZm Z m
Z
m Z dd� Z G dd� dej
�Zd S )
� )�pytree)�token)�
fixer_base)�Assign�Attr�Name�is_tuple�is_list�symsc c sD t | �D ]6\}}|jtjkr|jd jdkr|| |d fV qd S )N� �exceptr )� enumerate�typer
�
except_clause�children�value)Znodes�i�n� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_except.py� find_excepts s r c @ s e Zd ZdZdZdd� ZdS )� FixExceptTa1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C sx | j }dd� |d D �}dd� |d D �}t|�D �]\}}t|j�dkr2|jdd� \}} }
| �tdd d
�� |
jtjk�r8t| � � d d
�} |
�
� } d | _ |
�| � | �
� } |j}
t |
�D ]\}}t
|tj�r� q�q�t|
�s�t|
�r�t| t| td ���}n
t| | �}t|
d |� �D ]}|�d
|� �q|�||� q2|
j d kr2d |
_ q2dd� |jd d� D �| | }t�|j|�S )Nc S s g | ] }|� � �qS r ��clone)�.0r r r r �
<listcomp>2 s z'FixExcept.transform.<locals>.<listcomp>�tailc S s g | ] }|� � �qS r r )r Zchr r r r 4 s Zcleanup� � �as� )�prefix� �argsr c S s g | ] }|� � �qS r r )r �cr r r r \ s � )r
r �lenr �replacer r r �NAME�new_namer r! r
�
isinstancer ZNoder r r r �reversedZ insert_child)�selfZnodeZresultsr
r Z try_cleanupr Ze_suite�EZcomma�NZnew_N�targetZ suite_stmtsr ZstmtZassignZchildr r r r � transform/ s6
zFixExcept.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr0 r r r r r $ s r N)r" r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_methodattrs.cpython-38.opt-2.pyc 0000644 00000001531 15053244165 0016673 0 ustar 00 U
e5d^ � @ s: d dl mZ d dlmZ dddd�ZG dd� dej�Zd S )
� )�
fixer_base)�Name�__func__�__self__z__self__.__class__)Zim_funcZim_selfZim_classc @ s e Zd ZdZdZdd� ZdS )�FixMethodattrsTzU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C s. |d d }t |j }|�t||jd�� d S )N�attr� )�prefix)�MAP�value�replacer r )�selfZnodeZresultsr �new� r �5/usr/lib64/python3.8/lib2to3/fixes/fix_methodattrs.py� transform s
zFixMethodattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)� r Z
fixer_utilr r
ZBaseFixr r r r r �<module> s � fixes/__pycache__/fix_future.cpython-38.pyc 0000644 00000001413 15053244165 0014706 0 ustar 00 U
e5d# � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zVRemove __future__ imports
from __future__ import foo is replaced with an empty line.
� )�
fixer_base)� BlankLinec @ s e Zd ZdZdZdZdd� ZdS )� FixFutureTz;import_from< 'from' module_name="__future__" 'import' any >�
c C s t � }|j|_|S )N)r �prefix)�selfZnodeZresults�new� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_future.py� transform s zFixFuture.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r
r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_reduce.cpython-38.opt-1.pyc 0000644 00000002143 15053244165 0015603 0 ustar 00 U
e5dE � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zqFixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
� )�
fixer_base�� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReduceTZpreai
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t dd|� d S )N� functools�reducer )�selfZnodeZresults� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_reduce.py� transform" s zFixReduce.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r
r s r N)�__doc__Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_types.cpython-38.pyc 0000644 00000003450 15053244165 0014543 0 ustar 00 U
e5d� � @ sp d Z ddlmZ ddlmZ ddddddd d
d d d d
dddddddddd�Zdd� eD �ZG dd� dej�ZdS ) a� Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
� )�
fixer_base)�Name�bool�
memoryview�type�complex�dictztype(Ellipsis)�float�int�list�objectz
type(None)ztype(NotImplemented)�slice�bytesz(str,)�tuple�str�range)Z BooleanTypeZ
BufferTypeZ ClassTypeZ ComplexTypeZDictTypeZDictionaryTypeZ EllipsisTypeZ FloatTypeZIntTypeZListTypeZLongTypeZ
ObjectTypeZNoneTypeZNotImplementedTypeZ SliceTypeZ
StringTypeZ StringTypesZ TupleTypeZTypeTypeZ UnicodeTypeZ
XRangeTypec C s g | ] }d | �qS )z)power< 'types' trailer< '.' name='%s' > >� )�.0�tr r �//usr/lib64/python3.8/lib2to3/fixes/fix_types.py�
<listcomp>3 s r c @ s" e Zd ZdZd�e�Zdd� ZdS )�FixTypesT�|c C s& t �|d j�}|r"t||jd�S d S )N�name)�prefix)�
_TYPE_MAPPING�get�valuer r )�selfZnodeZresultsZ new_valuer r r � transform9 s zFixTypes.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�join�_patsZPATTERNr r r r r r 5 s
r N) �__doc__� r Z
fixer_utilr r r$ ZBaseFixr r r r r �<module> s4 � fixes/__pycache__/fix_imports2.cpython-38.opt-2.pyc 0000644 00000000670 15053244165 0016117 0 ustar 00 U
e5d! � @ s, d dl mZ ddd�ZG dd� dej�ZdS )� )� fix_importsZdbm)ZwhichdbZanydbmc @ s e Zd ZdZeZdS )� FixImports2� N)�__name__�
__module__� __qualname__Z run_order�MAPPING�mapping� r
r
�2/usr/lib64/python3.8/lib2to3/fixes/fix_imports2.pyr s r N)� r r Z
FixImportsr r
r
r
r �<module> s � fixes/__pycache__/fix_set_literal.cpython-38.opt-1.pyc 0000644 00000003216 15053244165 0016645 0 ustar 00 U
e5d� � @ s: d Z ddlmZmZ ddlmZmZ G dd� dej�ZdS )z:
Optional fixer to transform set() calls to set literals.
� )�
fixer_base�pytree)�token�symsc @ s e Zd ZdZdZdZdd� ZdS )�
FixSetLiteralTaj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s� |� d�}|r2t�tj|�� g�}|�|� |}n|d }t�tj d�g}|�
dd� |j D �� |� t�tj
d�� |jj|d _t�tj|�}|j|_t|j �dkr�|j d }|�� |j|j d _|S )
N�single�items�{c s s | ]}|� � V qd S )N)�clone)�.0�n� r
�5/usr/lib64/python3.8/lib2to3/fixes/fix_set_literal.py� <genexpr>' s z*FixSetLiteral.transform.<locals>.<genexpr>�}���� � )�getr ZNoder Z listmakerr
�replaceZLeafr �LBRACE�extendZchildren�append�RBRACEZ next_sibling�prefixZ dictsetmaker�len�remove) �selfZnodeZresultsr Zfaker �literalZmakerr r
r
r � transform s"
zFixSetLiteral.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s
r N) �__doc__Zlib2to3r r Zlib2to3.fixer_utilr r ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_unicode.cpython-38.opt-1.pyc 0000644 00000003010 15053244165 0015754 0 ustar 00 U
e5d� � @ s< d Z ddlmZ ddlmZ ddd�ZG dd� dej�Zd S )
z�Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
� )�token)�
fixer_base�chr�str)ZunichrZunicodec s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�
FixUnicodeTz STRING | 'unicode' | 'unichr'c s" t t| ��||� d|jk| _d S )N�unicode_literals)�superr �
start_treeZfuture_featuresr )�selfZtree�filename�� __class__� �1/usr/lib64/python3.8/lib2to3/fixes/fix_unicode.pyr s zFixUnicode.start_treec C s� |j tjkr$|�� }t|j |_|S |j tjkr�|j}| jsj|d dkrjd|krjd�dd� |� d�D ��}|d dkr�|dd � }||jkr�|S |�� }||_|S d S ) N� z'"�\z\\c S s g | ]}|� d d�� dd��qS )z\uz\\uz\Uz\\U)�replace)�.0�vr r r �
<listcomp> s �z(FixUnicode.transform.<locals>.<listcomp>ZuU� )
�typer �NAMEZclone�_mapping�value�STRINGr �join�split)r
ZnodeZresults�new�valr r r � transform s"
�
zFixUnicode.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r �
__classcell__r r r r r s r N)�__doc__Zpgen2r � r r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_ws_comma.cpython-38.opt-1.pyc 0000644 00000002132 15053244165 0016137 0 ustar 00 U
e5dB � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z�Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
� )�pytree)�token)�
fixer_basec @ s@ e Zd ZdZdZe�ejd�Ze�ej d�Z ee fZ
dd� Z dS )�
FixWsCommaTzH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
�,�:c C s` |� � }d}|jD ]H}|| jkrB|j}|�� r<d|kr<d|_d}q|rV|j}|sVd|_d}q|S )NF�
� T� )ZcloneZchildren�SEPS�prefix�isspace)�selfZnodeZresults�newZcommaZchildr � r �2/usr/lib64/python3.8/lib2to3/fixes/fix_ws_comma.py� transform s
zFixWsComma.transformN) �__name__�
__module__� __qualname__ZexplicitZPATTERNr ZLeafr �COMMA�COLONr r r r r r r s r N)�__doc__r r Zpgen2r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_sys_exc.cpython-38.opt-1.pyc 0000644 00000002576 15053244165 0016023 0 ustar 00 U
e5d
� @ sJ d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
G dd� dej �Z dS )z�Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
� )�
fixer_base)�Attr�Call�Name�Number� Subscript�Node�symsc @ s: e Zd ZdddgZdZdd�dd� eD �� Zd d
� Zd S ) � FixSysExc�exc_type� exc_value�
exc_tracebackTzN
power< 'sys' trailer< dot='.' attribute=(%s) > >
�|c c s | ]}d | V qdS )z'%s'N� )�.0�er r �1/usr/lib64/python3.8/lib2to3/fixes/fix_sys_exc.py� <genexpr> s zFixSysExc.<genexpr>c C st |d d }t | j�|j��}ttd�|jd�}ttd�|�}|d j|d jd _|� t
|�� t t j
||jd�S )NZ attribute� �exc_info)�prefix�sys�dot� )r r �index�valuer r r r Zchildren�appendr r r Zpower)�selfZnodeZresultsZsys_attrr Zcall�attrr r r � transform s zFixSysExc.transformN)�__name__�
__module__� __qualname__r Z
BM_compatible�joinZPATTERNr r r r r r
s
�r
N)
�__doc__� r Z
fixer_utilr r r r r r r ZBaseFixr
r r r r �<module> s
$ fixes/__pycache__/fix_itertools.cpython-38.opt-2.pyc 0000644 00000002241 15053244165 0016360 0 ustar 00 U
e5d � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s* e Zd ZdZdZde� ZdZdd� ZdS )� FixItertoolsTz7('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')z�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
� c C s� d }|d d }d|krV|j dkrV|d |d }}|j}|�� |�� |j�|� |p^|j}|�t|j dd � |d�� d S )N�func� �it)Z ifilterfalseZ izip_longest�dot� )�prefix)�valuer �remove�parent�replacer )�selfZnodeZresultsr r r r � r �3/usr/lib64/python3.8/lib2to3/fixes/fix_itertools.py� transform s �
zFixItertools.transformN) �__name__�
__module__� __qualname__Z
BM_compatibleZit_funcs�localsZPATTERNZ run_orderr r r r r r s � r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_reload.cpython-38.pyc 0000644 00000002165 15053244165 0014647 0 ustar 00 U
e5d9 � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )z5Fixer for reload().
reload(s) -> importlib.reload(s)� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReloadTZprez�
power< 'reload'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sR |r2|d }|r2|j | jjkr2|jd jdkr2d S d}t|||�}td d|� |S )N�obj� > �**�*)� importlib�reloadr
)�typeZsymsZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_reload.py� transform s � zFixReload.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)�__doc__� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_tuple_params.cpython-38.opt-2.pyc 0000644 00000010234 15053244165 0017031 0 ustar 00 U
e5d� � @ s� d dl mZ d dlmZ d dl mZ d dlmZmZmZm Z m
Z
m Z dd� Z G dd� dej
�Zd d
� Zd d � Zg d
fdd�Zdd� Zd
S )� )�pytree)�token)�
fixer_base)�Assign�Name�Newline�Number� Subscript�symsc C s t | tj�o | jd jtjkS )N� )�
isinstancer �Node�children�typer �STRING)�stmt� r �6/usr/lib64/python3.8/lib2to3/fixes/fix_tuple_params.py� is_docstring s �r c @ s( e Zd ZdZdZdZdd� Zdd� ZdS ) �FixTupleParams� Ta
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s� d|kr�� ||�S g �|d }|d }|d jd jtjkrZd}|d jd j}t� � nd}d}t�tjd�� d� ��fd
d � }|jt j
kr�||� n<|jt j kr�t |j�D ]$\}} | jt j
kr�|| |dkd � q��s�d S �D ]}
|d |
_
q�|} |dk�r
d
�d _n&t|d j| ��r0|�d _|d } �D ]}
|d |
_
�q4�|d j| | �< t| d | t�� d �D ]}||d j| _�qr|d �� d S )N�lambda�suite�argsr � r z; � Fc s\ t ��� �}| �� }d|_t||�� �}|r2d|_| �|� ��t�t j
|� �� g�� d S )Nr � ) r �new_name�clone�prefixr �replace�appendr r
r
Z simple_stmt)Z tuple_arg�
add_prefix�n�argr ��endZ new_lines�selfr r � handle_tupleC s
�z.FixTupleParams.transform.<locals>.handle_tuple)r" r )F)�transform_lambdar r r �INDENT�valuer r ZLeafr
ZtfpdefZ
typedargslist� enumerate�parentr r �range�lenZchanged) r' �node�resultsr r �start�indentr( �ir$ �lineZafterr r% r � transform. sF
zFixTupleParams.transformc
C s� |d }|d }t |d �}|jtjkrD|�� }d|_|�|� d S t|�}t|�}| � t
|��}t |dd�} |�| �� � |� � D ]X}
|
jtjkr�|
j
|kr�dd� ||
j
D �} t�tj| �� g| �} |
j| _|
�| � q�d S )Nr �body�innerr )r c S s g | ] }|� � �qS r )r ��.0�cr r r �
<listcomp>� s z3FixTupleParams.transform_lambda.<locals>.<listcomp>)�
simplify_argsr r �NAMEr r r � find_params� map_to_indexr �
tuple_namer Z
post_orderr+ r r
r
Zpower)
r' r0 r1 r r7 r8 ZparamsZto_indexZtup_nameZ new_paramr# Z
subscripts�newr r r r) n s*
�z FixTupleParams.transform_lambdaN)�__name__�
__module__� __qualname__Z run_orderZ
BM_compatibleZPATTERNr6 r) r r r r r s
@r c C sN | j tjtjfkr| S | j tjkr>| j tjkr:| jd } q"| S td| ��d S )Nr zReceived unexpected node %s)r r
Zvfplistr r> �vfpdefr � RuntimeError�r0 r r r r= � s r= c C s< | j tjkrt| jd �S | j tjkr,| jS dd� | jD �S )Nr c S s g | ]}|j tjkrt|��qS r )r r �COMMAr? r9 r r r r< � s z find_params.<locals>.<listcomp>)r r
rF r? r r r> r+ rH r r r r? � s
r? Nc C sZ |d kr i }t | �D ]@\}}ttt|���g}t|t�rHt|||d� q|| ||< q|S )N)�d)r, r r �strr �listr@ )�
param_listr rJ r4 �objZtrailerr r r r@ � s
r@ c C s< g }| D ](}t |t�r&|�t|�� q|�|� qd�|�S )N�_)r rL r! rA �join)rM �lrN r r r rA � s
rA )r r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r= r? r@ rA r r r r �<module> s l fixes/__pycache__/fix_itertools.cpython-38.pyc 0000644 00000003011 15053244165 0015414 0 ustar 00 U
e5d � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )aT Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
� )�
fixer_base)�Namec @ s* e Zd ZdZdZde� ZdZdd� ZdS )� FixItertoolsTz7('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')z�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
� c C s� d }|d d }d|krV|j dkrV|d |d }}|j}|�� |�� |j�|� |p^|j}|�t|j dd � |d�� d S )N�func� �it)Z ifilterfalseZ izip_longest�dot� )�prefix)�valuer �remove�parent�replacer )�selfZnodeZresultsr r r r � r �3/usr/lib64/python3.8/lib2to3/fixes/fix_itertools.py� transform s �
zFixItertools.transformN) �__name__�
__module__� __qualname__Z
BM_compatibleZit_funcs�localsZPATTERNZ run_orderr r r r r r s � r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_renames.cpython-38.opt-2.pyc 0000644 00000003602 15053244165 0015770 0 ustar 00 U
e5d� � @ sR d dl mZ d dlmZmZ dddiiZi Zdd� Zdd � ZG d
d � d ej �Z
d S )
� )�
fixer_base)�Name�
attr_chain�sysZmaxint�maxsizec C s dd� tt| �� d S )N�(�|�))�join�map�repr)�members� r �1/usr/lib64/python3.8/lib2to3/fixes/fix_renames.py�
alternates s r c c sZ t t�� �D ]H\} }t |�� �D ]2\}}|t| |f< d| ||f V d| |f V q q d S )Nz�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
z^
power< module_name=%r trailer< '.' attr_name=%r > any* >
)�list�MAPPING�items�LOOKUP)�module�replaceZold_attr�new_attrr r r �
build_pattern s ��r c s8 e Zd ZdZd�e� �ZdZ� fdd�Zdd� Z � Z
S )�
FixRenamesTr Zprec s@ t t| �j� � |�}|r<t� fdd�t|d�D ��r8dS |S dS )Nc 3 s | ]}� |�V qd S )Nr )�.0�obj��matchr r � <genexpr>5 s z#FixRenames.match.<locals>.<genexpr>�parentF)�superr r �anyr )�self�node�results�� __class__r r r 1 s zFixRenames.matchc C sD |� d�}|� d�}|r@|r@t|j|jf }|�t||jd�� d S )NZ module_name� attr_name)�prefix)�getr �valuer r r( )r" r# r$ Zmod_namer' r r r r � transform> s
zFixRenames.transform) �__name__�
__module__� __qualname__Z
BM_compatibler
r ZPATTERN�orderr r+ �
__classcell__r r r% r r * s
r N) � r Z
fixer_utilr r r r r r ZBaseFixr r r r r �<module>
s fixes/__pycache__/fix_imports.cpython-38.pyc 0000644 00000010446 15053244165 0015077 0 ustar 00 U
e5d4 � 1 @ s� d Z ddlmZ ddlmZmZ ddddddd d
d d d d
d
ddddddddddddddd d d d d d!d"d"d#d$d%d&d'd(d(d(d)d*d*d+d,d-�0Zd.d/� Zefd0d1�ZG d2d3� d3ej �Z
d4S )5z/Fix incompatible imports and module references.� )�
fixer_base)�Name�
attr_chain�io�pickle�builtins�copyregZqueueZ socketserverZ configparser�reprlibztkinter.filedialogztkinter.simpledialogztkinter.colorchooserztkinter.commondialogztkinter.dialogz tkinter.dndz tkinter.fontztkinter.messageboxztkinter.scrolledtextztkinter.constantsz tkinter.tixz tkinter.ttkZtkinterZ _markupbase�winreg�_threadZ
_dummy_threadzdbm.bsdzdbm.dumbzdbm.ndbmzdbm.gnuz
xmlrpc.clientz
xmlrpc.serverz http.clientz
html.entitiesz html.parserz http.cookieszhttp.cookiejarz http.server�
subprocess� collectionsz urllib.parsezurllib.robotparser)0�StringIOZ cStringIOZcPickleZ __builtin__Zcopy_regZQueueZ SocketServerZ ConfigParser�reprZ
FileDialogZ tkFileDialogZ SimpleDialogZtkSimpleDialogZtkColorChooserZtkCommonDialogZDialogZTkdndZtkFontZ tkMessageBoxZ ScrolledTextZ TkconstantsZTixZttkZTkinterZ
markupbase�_winreg�threadZ dummy_threadZdbhashZdumbdbmZdbmZgdbmZ xmlrpclibZDocXMLRPCServerZSimpleXMLRPCServerZhttplibZhtmlentitydefsZ
HTMLParserZCookieZ cookielibZBaseHTTPServerZSimpleHTTPServerZ
CGIHTTPServerZcommands�
UserString�UserListZurlparseZ robotparserc C s dd� tt| �� d S )N�(�|�))�join�mapr )�members� r �1/usr/lib64/python3.8/lib2to3/fixes/fix_imports.py�
alternates= s r c c sT d� dd� | D ��}t| �� �}d||f V d| V d||f V d| V d S )Nz | c S s g | ] }d | �qS )zmodule_name='%s'r )�.0�keyr r r �
<listcomp>B s z!build_pattern.<locals>.<listcomp>zyname_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
z�import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
z�import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
z3power< bare_with_attr=(%s) trailer<'.' any > any* >)r r �keys)�mappingZmod_listZ
bare_namesr r r �
build_patternA s ���r" c sT e Zd ZdZdZeZdZdd� Z� fdd�Z � fdd�Z
� fd d
�Z d d � Z � Z
S )
�
FixImportsT� c C s d� t| j��S )Nr )r r" r! ��selfr r r r" ` s zFixImports.build_patternc s | � � | _tt| ��� d S �N)r" ZPATTERN�superr# �compile_patternr% �� __class__r r r) c s
zFixImports.compile_patternc sH t t| �j� � |�}|rDd|kr@t� fdd�t|d�D ��r@dS |S dS )N�bare_with_attrc 3 s | ]}� |�V qd S r' r )r �obj��matchr r � <genexpr>q s z#FixImports.match.<locals>.<genexpr>�parentF)r( r# r/ �anyr )r& �node�resultsr* r. r r/ j s �zFixImports.matchc s t t| ��||� i | _d S r' )r( r# �
start_tree�replace)r& Ztree�filenamer* r r r5 v s zFixImports.start_treec C s� |� d�}|rh|j}| j| }|�t||jd�� d|krD|| j|< d|kr�| �|�}|r�| �||� n2|d d }| j� |j�}|r�|�t||jd�� d S )NZ module_name)�prefixZ name_importZmultiple_importsr, � )�get�valuer! r6 r r8 r/ � transform)r& r3 r4 Z
import_modZmod_name�new_nameZ bare_namer r r r< z s
zFixImports.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZkeep_line_order�MAPPINGr! Z run_orderr" r) r/ r5 r< �
__classcell__r r r* r r# U s r# N) �__doc__� r Z
fixer_utilr r rA r r" ZBaseFixr# r r r r �<module> sl �5 fixes/__pycache__/fix_nonzero.cpython-38.opt-1.pyc 0000644 00000001626 15053244165 0016033 0 ustar 00 U
e5dO � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z*Fixer for __nonzero__ -> __bool__ methods.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixNonzeroTz�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s$ |d }t d|jd�}|�|� d S )N�name�__bool__)�prefix)r r �replace)�selfZnodeZresultsr �new� r �1/usr/lib64/python3.8/lib2to3/fixes/fix_nonzero.py� transform s zFixNonzero.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_standarderror.cpython-38.opt-2.pyc 0000644 00000001225 15053244165 0017207 0 ustar 00 U
e5d� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�FixStandarderrorTz-
'StandardError'
c C s t d|jd�S )N� Exception)�prefix)r r )�selfZnodeZresults� r �7/usr/lib64/python3.8/lib2to3/fixes/fix_standarderror.py� transform s zFixStandarderror.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_ws_comma.cpython-38.opt-2.pyc 0000644 00000001640 15053244165 0016143 0 ustar 00 U
e5dB � @ s: d dl mZ d dlmZ d dl mZ G dd� dej�ZdS )� )�pytree)�token)�
fixer_basec @ s@ e Zd ZdZdZe�ejd�Ze�ej d�Z ee fZ
dd� Z dS )�
FixWsCommaTzH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
�,�:c C s` |� � }d}|jD ]H}|| jkrB|j}|�� r<d|kr<d|_d}q|rV|j}|sVd|_d}q|S )NF�
� T� )ZcloneZchildren�SEPS�prefix�isspace)�selfZnodeZresults�newZcommaZchildr � r �2/usr/lib64/python3.8/lib2to3/fixes/fix_ws_comma.py� transform s
zFixWsComma.transformN) �__name__�
__module__� __qualname__ZexplicitZPATTERNr ZLeafr �COMMA�COLONr r r r r r r s r N)r r Zpgen2r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_reload.cpython-38.opt-1.pyc 0000644 00000002165 15053244165 0015606 0 ustar 00 U
e5d9 � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )z5Fixer for reload().
reload(s) -> importlib.reload(s)� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReloadTZprez�
power< 'reload'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sR |r2|d }|r2|j | jjkr2|jd jdkr2d S d}t|||�}td d|� |S )N�obj� > �**�*)� importlib�reloadr
)�typeZsymsZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_reload.py� transform s � zFixReload.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)�__doc__� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_ws_comma.cpython-38.pyc 0000644 00000002132 15053244165 0015200 0 ustar 00 U
e5dB � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z�Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
� )�pytree)�token)�
fixer_basec @ s@ e Zd ZdZdZe�ejd�Ze�ej d�Z ee fZ
dd� Z dS )�
FixWsCommaTzH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
�,�:c C s` |� � }d}|jD ]H}|| jkrB|j}|�� r<d|kr<d|_d}q|rV|j}|sVd|_d}q|S )NF�
� T� )ZcloneZchildren�SEPS�prefix�isspace)�selfZnodeZresults�newZcommaZchildr � r �2/usr/lib64/python3.8/lib2to3/fixes/fix_ws_comma.py� transform s
zFixWsComma.transformN) �__name__�
__module__� __qualname__ZexplicitZPATTERNr ZLeafr �COMMA�COLONr r r r r r r s r N)�__doc__r r Zpgen2r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_imports.cpython-38.opt-1.pyc 0000644 00000010446 15053244165 0016036 0 ustar 00 U
e5d4 � 1 @ s� d Z ddlmZ ddlmZmZ ddddddd d
d d d d
d
ddddddddddddddd d d d d d!d"d"d#d$d%d&d'd(d(d(d)d*d*d+d,d-�0Zd.d/� Zefd0d1�ZG d2d3� d3ej �Z
d4S )5z/Fix incompatible imports and module references.� )�
fixer_base)�Name�
attr_chain�io�pickle�builtins�copyregZqueueZ socketserverZ configparser�reprlibztkinter.filedialogztkinter.simpledialogztkinter.colorchooserztkinter.commondialogztkinter.dialogz tkinter.dndz tkinter.fontztkinter.messageboxztkinter.scrolledtextztkinter.constantsz tkinter.tixz tkinter.ttkZtkinterZ _markupbase�winreg�_threadZ
_dummy_threadzdbm.bsdzdbm.dumbzdbm.ndbmzdbm.gnuz
xmlrpc.clientz
xmlrpc.serverz http.clientz
html.entitiesz html.parserz http.cookieszhttp.cookiejarz http.server�
subprocess� collectionsz urllib.parsezurllib.robotparser)0�StringIOZ cStringIOZcPickleZ __builtin__Zcopy_regZQueueZ SocketServerZ ConfigParser�reprZ
FileDialogZ tkFileDialogZ SimpleDialogZtkSimpleDialogZtkColorChooserZtkCommonDialogZDialogZTkdndZtkFontZ tkMessageBoxZ ScrolledTextZ TkconstantsZTixZttkZTkinterZ
markupbase�_winreg�threadZ dummy_threadZdbhashZdumbdbmZdbmZgdbmZ xmlrpclibZDocXMLRPCServerZSimpleXMLRPCServerZhttplibZhtmlentitydefsZ
HTMLParserZCookieZ cookielibZBaseHTTPServerZSimpleHTTPServerZ
CGIHTTPServerZcommands�
UserString�UserListZurlparseZ robotparserc C s dd� tt| �� d S )N�(�|�))�join�mapr )�members� r �1/usr/lib64/python3.8/lib2to3/fixes/fix_imports.py�
alternates= s r c c sT d� dd� | D ��}t| �� �}d||f V d| V d||f V d| V d S )Nz | c S s g | ] }d | �qS )zmodule_name='%s'r )�.0�keyr r r �
<listcomp>B s z!build_pattern.<locals>.<listcomp>zyname_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
z�import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
z�import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
z3power< bare_with_attr=(%s) trailer<'.' any > any* >)r r �keys)�mappingZmod_listZ
bare_namesr r r �
build_patternA s ���r" c sT e Zd ZdZdZeZdZdd� Z� fdd�Z � fdd�Z
� fd d
�Z d d � Z � Z
S )
�
FixImportsT� c C s d� t| j��S )Nr )r r" r! ��selfr r r r" ` s zFixImports.build_patternc s | � � | _tt| ��� d S �N)r" ZPATTERN�superr# �compile_patternr% �� __class__r r r) c s
zFixImports.compile_patternc sH t t| �j� � |�}|rDd|kr@t� fdd�t|d�D ��r@dS |S dS )N�bare_with_attrc 3 s | ]}� |�V qd S r' r )r �obj��matchr r � <genexpr>q s z#FixImports.match.<locals>.<genexpr>�parentF)r( r# r/ �anyr )r& �node�resultsr* r. r r/ j s �zFixImports.matchc s t t| ��||� i | _d S r' )r( r# �
start_tree�replace)r& Ztree�filenamer* r r r5 v s zFixImports.start_treec C s� |� d�}|rh|j}| j| }|�t||jd�� d|krD|| j|< d|kr�| �|�}|r�| �||� n2|d d }| j� |j�}|r�|�t||jd�� d S )NZ module_name)�prefixZ name_importZmultiple_importsr, � )�get�valuer! r6 r r8 r/ � transform)r& r3 r4 Z
import_modZmod_name�new_nameZ bare_namer r r r< z s
zFixImports.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZkeep_line_order�MAPPINGr! Z run_orderr" r) r/ r5 r< �
__classcell__r r r* r r# U s r# N) �__doc__� r Z
fixer_utilr r rA r r" ZBaseFixr# r r r r �<module> sl �5 fixes/__pycache__/fix_next.cpython-38.opt-2.pyc 0000644 00000005653 15053244165 0015324 0 ustar 00 U
e5df � @ sj d dl mZ d dlmZ d dlmZ d dlmZm Z m
Z
dZ G dd� dej �Z
dd � Zd
d � Zd d
� ZdS )� )�token)�python_symbols)�
fixer_base)�Name�Call� find_bindingz;Calls to builtin next() possibly shadowed by global bindingc s0 e Zd ZdZdZdZ� fdd�Zdd� Z� ZS )�FixNextTa�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
Zprec s> t t| ��||� td|�}|r4| �|t� d| _nd| _d S )N�nextTF)�superr �
start_treer �warning� bind_warning�
shadowed_next)�selfZtree�filename�n�� __class__� �./usr/lib64/python3.8/lib2to3/fixes/fix_next.pyr $ s
zFixNext.start_treec C s� |� d�}|� d�}|� d�}|rr| jr>|�td|jd�� q�dd� |D �}d|d _|�ttd
|jd�|�� n�|r�td|jd�}|�|� nj|r�t|�r�|d }d�d d� |D ���� d
kr�| � |t
� d S |�td�� nd|kr�| � |t
� d| _d S )N�base�attr�name�__next__)�prefixc S s g | ] }|� � �qS r )Zclone��.0r r r r �
<listcomp>9 s z%FixNext.transform.<locals>.<listcomp>� � r �headc S s g | ] }t |��qS r )�strr r r r r E s Z __builtin__�globalT) �getr �replacer r r �is_assign_target�join�stripr r
)r �nodeZresultsr r r r r r r r � transform. s,
zFixNext.transform) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERN�orderr r) �
__classcell__r r r r r s
r c C sF t | �}|d krdS |jD ]&}|jtjkr0 dS t|| �r dS qdS )NFT)� find_assign�children�typer �EQUAL�
is_subtree)r( ZassignZchildr r r r% Q s
r% c C s4 | j tjkr| S | j tjks&| jd kr*d S t| j�S �N)r1 �symsZ expr_stmtZ simple_stmt�parentr/ �r( r r r r/ ] s
r/ c s$ | � kr dS t � fdd�| jD ��S )NTc 3 s | ]}t |� �V qd S r4 )r3 )r �cr7 r r � <genexpr>g s z is_subtree.<locals>.<genexpr>)�anyr0 )�rootr( r r7 r r3 d s r3 N)Zpgen2r Zpygramr r5 r r Z
fixer_utilr r r r
ZBaseFixr r% r/ r3 r r r r �<module> s @ fixes/__pycache__/fix_dict.cpython-38.opt-2.pyc 0000644 00000004477 15053244165 0015274 0 ustar 00 U
e5d� � @ sf d dl mZ d dl mZ d dl mZ d dlmZmZmZ d dl mZ ejdhB Z G dd� dej
�Z d S )
� )�pytree)�patcomp)�
fixer_base)�Name�Call�Dot)�
fixer_util�iterc @ s@ e Zd ZdZdZdd� ZdZe�e�Z dZ
e�e
�Z dd� Z d S )
�FixDictTa
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c
C s |d }|d d }|d }| j }|j}|�d�}|�d�} |sD| rP|dd � }dd � |D �}d
d � |D �}| o|| �||�}
|t�|jt� t||j d �g�|d �
� g } t�|j | �} |
s�| s�d
| _ t t|r�dnd�| g�} |r�t�|j | g| �} |j | _ | S )N�head�method� �tailr Zview� c S s g | ] }|� � �qS � ��clone��.0�nr r �./usr/lib64/python3.8/lib2to3/fixes/fix_dict.py�
<listcomp>A s z%FixDict.transform.<locals>.<listcomp>c S s g | ] }|� � �qS r r r r r r r B s )�prefixZparens� �list)
�syms�value�
startswith�in_special_contextr ZNodeZtrailerr r r r Zpowerr )
�self�node�resultsr r r r Z method_name�isiterZisviewZspecial�args�newr r r � transform6 s:
���
�zFixDict.transformz3power< func=NAME trailer< '(' node=any ')' > any* >zmfor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� |j d krdS i }|j j d k r^| j�|j j |�r^|d |kr^|rN|d jtkS |d jtjkS |sfdS | j�|j |�o�|d |kS )NFr �func)�parent�p1�matchr � iter_exemptr �consuming_calls�p2)r r r" r! r r r r Z s
�
�zFixDict.in_special_contextN)
�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr% ZP1r Zcompile_patternr( ZP2r, r r r r r r
) s
r
N) r r r r r r r r r+ r* ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_itertools_imports.cpython-38.pyc 0000644 00000003045 15053244165 0017200 0 ustar 00 U
e5d& � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )zA Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) � )�
fixer_base)� BlankLine�syms�tokenc @ s" e Zd ZdZde� Zdd� ZdS )�FixItertoolsImportsTzT
import_from< 'from' 'itertools' 'import' imports=any >
c C sp |d }|j tjks|js"|g}n|j}|d d d� D ]�}|j tjkrR|j}|}n,|j tjkrd d S |j tjkstt�|jd }|j}|dkr�d |_|� � q6|dkr6|�
� |d dkr�dnd |_q6|jd d � p�|g}d
} |D ]*}| �r|j tj k�r|� � q�| d
N } q�|�r4|d j tj k�r4|� � � � �q |j�sJt
|d d ��rV|jd k�rl|j}
t� }|
|_|S d S )
N�imports� r )ZimapZizipZifilter)Z ifilterfalseZ izip_longest� �f� filterfalse� zip_longestT����value)�typer Zimport_as_name�childrenr �NAMEr �STAR�AssertionError�removeZchanged�COMMA�pop�getattr�parent�prefixr ) �selfZnodeZresultsr r Zchild�memberZ name_node� member_nameZ remove_comma�p� r �;/usr/lib64/python3.8/lib2to3/fixes/fix_itertools_imports.py� transform sH
�
�z FixItertoolsImports.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�localsZPATTERNr r r r r r s
�r N) �__doc__Zlib2to3r Zlib2to3.fixer_utilr r r ZBaseFixr r r r r �<module> s fixes/__pycache__/__init__.cpython-38.opt-1.pyc 0000644 00000000211 15053244165 0015217 0 ustar 00 U
e5d/ � @ s d S )N� r r r �./usr/lib64/python3.8/lib2to3/fixes/__init__.py�<module> � fixes/__pycache__/fix_intern.cpython-38.pyc 0000644 00000002151 15053244165 0014673 0 ustar 00 U
e5dx � @ s6 d Z ddlmZ ddlmZmZ G dd� dej�ZdS )z/Fixer for intern().
intern(s) -> sys.intern(s)� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixInternTZprez�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sR |r2|d }|r2|j | jjkr2|jd jdkr2d S d}t|||�}td d|� |S )N�obj� > �**�*)�sys�internr
)�typeZsymsZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_intern.py� transform s � zFixIntern.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)�__doc__� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_itertools_imports.cpython-38.opt-2.pyc 0000644 00000002653 15053244165 0020144 0 ustar 00 U
e5d& � @ s6 d dl mZ d dlmZmZmZ G dd� dej�ZdS )� )�
fixer_base)� BlankLine�syms�tokenc @ s" e Zd ZdZde� Zdd� ZdS )�FixItertoolsImportsTzT
import_from< 'from' 'itertools' 'import' imports=any >
c C sZ |d }|j tjks|js"|g}n|j}|d d d� D ]|}|j tjkrR|j}|}n |j tjkrd d S |jd }|j}|dkr�d |_|�� q6|dkr6|� � |d dkr�dnd |_q6|jd d � p�|g}d
} |D ]&}| r�|j tj
kr�|�� q�| d
N } q�|�r |d j tj
k�r |� � �� q�|j�s4t |d d ��r@|j
d k�rV|j}
t� }|
|_|S d S )
N�imports� r )ZimapZizipZifilter)Z ifilterfalseZ izip_longest� �f� filterfalse� zip_longestT����value)�typer Zimport_as_name�childrenr �NAMEr �STAR�removeZchanged�COMMA�pop�getattr�parent�prefixr ) �selfZnodeZresultsr r Zchild�memberZ name_node� member_nameZ remove_comma�p� r �;/usr/lib64/python3.8/lib2to3/fixes/fix_itertools_imports.py� transform sF
�
�z FixItertoolsImports.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�localsZPATTERNr r r r r r s
�r N)Zlib2to3r Zlib2to3.fixer_utilr r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_standarderror.cpython-38.pyc 0000644 00000001313 15053244165 0016245 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z%Fixer for StandardError -> Exception.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�FixStandarderrorTz-
'StandardError'
c C s t d|jd�S )N� Exception)�prefix)r r )�selfZnodeZresults� r �7/usr/lib64/python3.8/lib2to3/fixes/fix_standarderror.py� transform s zFixStandarderror.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_numliterals.cpython-38.pyc 0000644 00000001772 15053244165 0015743 0 ustar 00 U
e5d � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z-Fixer that turns 1L into 1, 0755 into 0o755.
� )�token)�
fixer_base)�Numberc @ s" e Zd ZejZdd� Zdd� ZdS )�FixNumliteralsc C s |j �d�p|j d dkS )N�0����Ll)�value�
startswith)�self�node� r
�5/usr/lib64/python3.8/lib2to3/fixes/fix_numliterals.py�match s zFixNumliterals.matchc C s` |j }|d dkr |d d� }n2|�d�rR|�� rRtt|��dkrRd|dd � }t||jd�S )Nr r r � Z0o)�prefix)r r
�isdigit�len�setr r )r r Zresults�valr
r
r � transform s "zFixNumliterals.transformN)�__name__�
__module__� __qualname__r �NUMBERZ _accept_typer r r
r
r
r r s r N) �__doc__Zpgen2r � r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_urllib.cpython-38.opt-2.pyc 0000644 00000012474 15053244165 0015636 0 ustar 00 U
e5d� � @ s� d dl mZmZ d dlmZmZmZmZmZm Z m
Z
ddddddd d
d gfd d
ddddddddddddddgfd d gfgddd d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4gfd d5d6gfgd7�Z e d8 � e d9 d: � d;d<� Z
G d=d>� d>e�Zd?S )@� )�
alternates�
FixImports)�Name�Comma�
FromImport�Newline�find_indentation�Node�symszurllib.requestZ URLopenerZFancyURLopenerZ urlretrieveZ
_urlopenerZurlopenZ
urlcleanupZ pathname2urlZ url2pathnamez urllib.parseZquoteZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ splitattrZ splithostZ
splitnportZ splitpasswdZ splitportZ
splitqueryZsplittagZ splittypeZ splituserZ
splitvaluez urllib.errorZContentTooShortErrorZinstall_openerZ build_openerZRequestZOpenerDirectorZ BaseHandlerZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZURLErrorZ HTTPError)�urllib�urllib2r r � c c sv t � } t�� D ]b\}}|D ]T}|\}}t|�}d||f V d|||f V d| V d| V d||f V qqd S )Nz�import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
z�import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
zIimport_from< 'from' module_star=%r 'import' star='*' >
ztimport_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
zKpower< bare_with_attr=%r trailer< '.' member=%s > any* >
)�set�MAPPING�itemsr )ZbareZ
old_moduleZchanges�changeZ
new_module�members� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_urllib.py�
build_pattern0 s( �����r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) � FixUrllibc C s d� t� �S )N�|)�joinr )�selfr r r r I s zFixUrllib.build_patternc C sv |� d�}|j}g }t|j d d� D ] }|�t|d |d�t� g� q&|�tt|j d d |d�� |�|� d S )N�module���r ��prefix) �getr r �value�extendr r �append�replace)r �node�resultsZ
import_mod�pref�names�namer r r �transform_importL s
zFixUrllib.transform_importc C s& |� d�}|j}|� d�}|r�t|t�r0|d }d }t|j D ] }|j|d kr>|d } q^q>|rv|�t||d�� n | �|d� �n�g }i } |d }
|
D ]�}|j t
j kr�|j d j} |j d j} n
|j} d } | d kr�t|j D ]B}| |d kr�|d | k�r |�
|d � | �|d g ��
|� q�q�g }
t|�}d
}d d � }|D ]�}| | }g }|d d
� D ]"}|�|||�� |�
t� � �q^|�||d
|�� t||�}|�r�|jj�|��r�||_|
�
|� d}�qB|
�rg }|
d d
� D ]}|�|t� g� �q�|�
|
d
� |�|� n | �|d� d S )N�
mod_member�memberr r
r �!This is an invalid module elementr � �,Tc S sX | j tjkrHt| jd j|d�| jd �� | jd �� g}ttj|�gS t| j|d�gS )Nr r r
r, )�typer
�import_as_namer �childrenr Zcloner )r' r Zkidsr r r � handle_name� s �z/FixUrllib.transform_member.<locals>.handle_namer Fz All module elements are invalid)r r �
isinstance�listr r r" r �cannot_convertr. r
r/ r0 r! �
setdefaultr r r r �parent�endswithr )r r# r$ r) r% r* �new_namer �modulesZmod_dictr Zas_name� member_nameZ new_nodesZ indentation�firstr1 r Zeltsr& Zelt�newZnodesZnew_noder r r �transform_member\ sh
zFixUrllib.transform_memberc C s~ |� d�}|� d�}d }t|t�r*|d }t|j D ] }|j|d kr4|d } qTq4|rn|�t||jd�� n | �|d� d S )N�bare_with_attrr* r r
r r+ ) r r2 r3 r r r" r r r4 )r r# r$ Z
module_dotr* r8 r r r r �
transform_dot� s
�
zFixUrllib.transform_dotc C sz |� d�r| �||� n^|� d�r0| �||� nF|� d�rH| �||� n.|� d�r`| �|d� n|� d�rv| �|d� d S )Nr r) r> Z module_starzCannot handle star imports.Z module_asz#This module is now multiple modules)r r( r= r? r4 )r r# r$ r r r � transform� s
zFixUrllib.transformN)�__name__�
__module__� __qualname__r r( r= r? r@ r r r r r G s
Lr N)Zlib2to3.fixes.fix_importsr r Zlib2to3.fixer_utilr r r r r r r
r r! r r r r r r �<module> s| $ �� ����
�����! fixes/__pycache__/fix_ne.cpython-38.pyc 0000644 00000001446 15053244165 0014004 0 ustar 00 U
e5d; � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z Fixer that turns <> into !=.� )�pytree)�token)�
fixer_basec @ s" e Zd ZejZdd� Zdd� ZdS )�FixNec C s
|j dkS )Nz<>)�value)�self�node� r �,/usr/lib64/python3.8/lib2to3/fixes/fix_ne.py�match s z FixNe.matchc C s t jtjd|jd�}|S )Nz!=)�prefix)r ZLeafr �NOTEQUALr )r r Zresults�newr r r
� transform s zFixNe.transformN)�__name__�
__module__� __qualname__r r
Z _accept_typer r r r r r
r s r N)�__doc__� r Zpgen2r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_set_literal.cpython-38.pyc 0000644 00000003216 15053244165 0015706 0 ustar 00 U
e5d� � @ s: d Z ddlmZmZ ddlmZmZ G dd� dej�ZdS )z:
Optional fixer to transform set() calls to set literals.
� )�
fixer_base�pytree)�token�symsc @ s e Zd ZdZdZdZdd� ZdS )�
FixSetLiteralTaj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s� |� d�}|r2t�tj|�� g�}|�|� |}n|d }t�tj d�g}|�
dd� |j D �� |� t�tj
d�� |jj|d _t�tj|�}|j|_t|j �dkr�|j d }|�� |j|j d _|S )
N�single�items�{c s s | ]}|� � V qd S )N)�clone)�.0�n� r
�5/usr/lib64/python3.8/lib2to3/fixes/fix_set_literal.py� <genexpr>' s z*FixSetLiteral.transform.<locals>.<genexpr>�}���� � )�getr ZNoder Z listmakerr
�replaceZLeafr �LBRACE�extendZchildren�append�RBRACEZ next_sibling�prefixZ dictsetmaker�len�remove) �selfZnodeZresultsr Zfaker �literalZmakerr r
r
r � transform s"
zFixSetLiteral.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s
r N) �__doc__Zlib2to3r r Zlib2to3.fixer_utilr r ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_reduce.cpython-38.opt-2.pyc 0000644 00000001741 15053244165 0015607 0 ustar 00 U
e5dE � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base�� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReduceTZpreai
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t dd|� d S )N� functools�reducer )�selfZnodeZresults� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_reduce.py� transform" s zFixReduce.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r
r s r N)Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r
�<module>
s fixes/__pycache__/fix_imports2.cpython-38.opt-1.pyc 0000644 00000001035 15053244165 0016112 0 ustar 00 U
e5d! � @ s0 d Z ddlmZ ddd�ZG dd� dej�ZdS )zTFix incompatible imports and module references that must be fixed after
fix_imports.� )� fix_importsZdbm)ZwhichdbZanydbmc @ s e Zd ZdZeZdS )� FixImports2� N)�__name__�
__module__� __qualname__Z run_order�MAPPING�mapping� r
r
�2/usr/lib64/python3.8/lib2to3/fixes/fix_imports2.pyr s r N)�__doc__� r r Z
FixImportsr r
r
r
r �<module> s
� fixes/__pycache__/fix_methodattrs.cpython-38.pyc 0000644 00000001645 15053244165 0015741 0 ustar 00 U
e5d^ � @ s> d Z ddlmZ ddlmZ dddd�ZG dd � d ej�Zd
S ) z;Fix bound method attributes (method.im_? -> method.__?__).
� )�
fixer_base)�Name�__func__�__self__z__self__.__class__)Zim_funcZim_selfZim_classc @ s e Zd ZdZdZdd� ZdS )�FixMethodattrsTzU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C s. |d d }t |j }|�t||jd�� d S )N�attr� )�prefix)�MAP�value�replacer r )�selfZnodeZresultsr �new� r �5/usr/lib64/python3.8/lib2to3/fixes/fix_methodattrs.py� transform s
zFixMethodattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)�__doc__� r Z
fixer_utilr r
ZBaseFixr r r r r �<module> s � fixes/__pycache__/fix_input.cpython-38.opt-1.pyc 0000644 00000001661 15053244165 0015477 0 ustar 00 U
e5d� � @ sL d Z ddlmZ ddlmZmZ ddlmZ e�d�ZG dd� dej �Z
dS ) z4Fixer that changes input(...) into eval(input(...)).� )�
fixer_base)�Call�Name)�patcompz&power< 'eval' trailer< '(' any ')' > >c @ s e Zd ZdZdZdd� ZdS )�FixInputTzL
power< 'input' args=trailer< '(' [any] ')' > >
c C s6 t �|jj�rd S |�� }d|_ttd�|g|jd�S )N� �eval)�prefix)�context�match�parentZcloner r r )�selfZnodeZresults�new� r �//usr/lib64/python3.8/lib2to3/fixes/fix_input.py� transform s
zFixInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r N) �__doc__r r Z
fixer_utilr r r Zcompile_patternr
ZBaseFixr r r r r �<module> s
fixes/__pycache__/__init__.cpython-38.pyc 0000644 00000000211 15053244165 0014260 0 ustar 00 U
e5d/ � @ s d S )N� r r r �./usr/lib64/python3.8/lib2to3/fixes/__init__.py�<module> � fixes/__pycache__/fix_basestring.cpython-38.opt-1.pyc 0000644 00000001222 15053244165 0016472 0 ustar 00 U
e5d@ � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z Fixer for basestring -> str.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixBasestringTz 'basestring'c C s t d|jd�S )N�str)�prefix)r r )�selfZnodeZresults� r �4/usr/lib64/python3.8/lib2to3/fixes/fix_basestring.py� transform
s zFixBasestring.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_exec.cpython-38.opt-2.pyc 0000644 00000001670 15053244165 0015265 0 ustar 00 U
e5d� � @ s6 d dl mZ d dlmZmZmZ G dd� dej�ZdS )� )�
fixer_base)�Comma�Name�Callc @ s e Zd ZdZdZdd� ZdS )�FixExecTzx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� | j }|d }|�d�}|�d�}|�� g}d|d _|d k rR|�t� |�� g� |d k rn|�t� |�� g� ttd�||jd�S )N�a�b�c� � �exec)�prefix)�syms�getZcloner
�extendr r r )�selfZnodeZresultsr r r r �args� r �./usr/lib64/python3.8/lib2to3/fixes/fix_exec.py� transform s
zFixExec.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)r
r Z
fixer_utilr r r ZBaseFixr r r r r �<module>
s fixes/__pycache__/fix_long.cpython-38.opt-1.pyc 0000644 00000001274 15053244165 0015277 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z/Fixer that turns 'long' into 'int' everywhere.
� )�
fixer_base)�is_probably_builtinc @ s e Zd ZdZdZdd� ZdS )�FixLongTz'long'c C s t |�rd|_|�� d S )N�int)r �valueZchanged)�selfZnodeZresults� r �./usr/lib64/python3.8/lib2to3/fixes/fix_long.py� transform s zFixLong.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_renames.cpython-38.pyc 0000644 00000003722 15053244165 0015033 0 ustar 00 U
e5d� � @ sV d Z ddlmZ ddlmZmZ dddiiZi Zdd� Zd d
� Z G d d � d ej
�Z d
S )z?Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
� )�
fixer_base)�Name�
attr_chain�sysZmaxint�maxsizec C s dd� tt| �� d S )N�(�|�))�join�map�repr)�members� r �1/usr/lib64/python3.8/lib2to3/fixes/fix_renames.py�
alternates s r c c sZ t t�� �D ]H\} }t |�� �D ]2\}}|t| |f< d| ||f V d| |f V q q d S )Nz�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
z^
power< module_name=%r trailer< '.' attr_name=%r > any* >
)�list�MAPPING�items�LOOKUP)�module�replaceZold_attr�new_attrr r r �
build_pattern s ��r c s8 e Zd ZdZd�e� �ZdZ� fdd�Zdd� Z � Z
S )�
FixRenamesTr Zprec s@ t t| �j� � |�}|r<t� fdd�t|d�D ��r8dS |S dS )Nc 3 s | ]}� |�V qd S )Nr )�.0�obj��matchr r � <genexpr>5 s z#FixRenames.match.<locals>.<genexpr>�parentF)�superr r �anyr )�self�node�results�� __class__r r r 1 s zFixRenames.matchc C sD |� d�}|� d�}|r@|r@t|j|jf }|�t||jd�� d S )NZ module_name� attr_name)�prefix)�getr �valuer r r( )r" r# r$ Zmod_namer' r r r r � transform> s
zFixRenames.transform) �__name__�
__module__� __qualname__Z
BM_compatibler
r ZPATTERN�orderr r+ �
__classcell__r r r% r r * s
r N) �__doc__� r Z
fixer_utilr r r r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_nonzero.cpython-38.opt-2.pyc 0000644 00000001533 15053244165 0016031 0 ustar 00 U
e5dO � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixNonzeroTz�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s$ |d }t d|jd�}|�|� d S )N�name�__bool__)�prefix)r r �replace)�selfZnodeZresultsr �new� r �1/usr/lib64/python3.8/lib2to3/fixes/fix_nonzero.py� transform s zFixNonzero.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_import.cpython-38.pyc 0000644 00000005336 15053244165 0014716 0 ustar 00 U
e5d� � @ sZ d Z ddlmZ ddlmZmZmZmZ ddlm Z m
Z
m Z dd� Z G dd � d ej
�Zd
S ) z�Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
� )�
fixer_base� )�dirname�join�exists�sep)�
FromImport�syms�tokenc c s� | g}|r�|� � }|jtjkr(|jV q|jtjkrNd�dd� |jD ��V q|jtj krl|�
|jd � q|jtj kr�|� |jddd� � qt
d��qdS )zF
Walks over all the names imported in a dotted_as_names node.
� c S s g | ]
}|j �qS � )�value)�.0Zchr r �0/usr/lib64/python3.8/lib2to3/fixes/fix_import.py�
<listcomp> s z$traverse_imports.<locals>.<listcomp>r N���zunknown node type)�pop�typer
�NAMEr
r Z dotted_namer �childrenZdotted_as_name�appendZdotted_as_names�extend�AssertionError)�namesZpending�noder r r �traverse_imports s
r c s4 e Zd ZdZdZ� fdd�Zdd� Zdd� Z� ZS ) � FixImportTzj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c s" t t| ��||� d|jk| _d S )NZabsolute_import)�superr �
start_treeZfuture_features�skip)�selfZtree�name�� __class__r r r / s zFixImport.start_treec C s� | j r
d S |d }|jtjkrVt|d�s4|jd }q | �|j�r�d|j |_|�� nZd}d}t |�D ]}| �|�rzd}qfd}qf|r�|r�| �
|d� d S t d|g�}|j |_ |S d S )N�impr
r �.FTz#absolute and local imports together)
r r r Z import_from�hasattrr �probably_a_local_importr
Zchangedr Zwarningr �prefix)r r Zresultsr$ Z
have_localZ
have_absoluteZmod_name�newr r r � transform3 s,
zFixImport.transformc C st |� d�rdS |�dd�d }t| j�}t||�}ttt|�d��sHdS dtddd d
fD ]}t|| �rX d S qXdS ) Nr% F� r z __init__.pyz.pyz.pycz.soz.slz.pydT)�
startswith�splitr �filenamer r r )r Zimp_name� base_pathZextr r r r' U s
z!FixImport.probably_a_local_import) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r* r' �
__classcell__r r r" r r & s
"r N)�__doc__r r Zos.pathr r r r Z
fixer_utilr r r
r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_apply.cpython-38.pyc 0000644 00000003213 15053244165 0014521 0 ustar 00 U
e5d* � @ sR d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z G dd� dej
�Z dS ) zIFixer for apply().
This converts apply(func, v, k) into (func)(*v, **k).� )�pytree)�token)�
fixer_base)�Call�Comma� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixApplyTa.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C s4 | j }|st�|d }|d }|�d�}|rN|j| j jkrN|jd jdkrNd S |rt|j| j jkrt|jd jdkrtd S |j}|�� }|jt j
|j fkr�|j|j ks�|jd jt j
kr�t|�}d|_|�� }d|_|d k r�|�� }d|_t�t jd �|g}|d k �r&|�t� t�t j
d�|g� d
|d _t|||d �S ) N�func�args�kwds� > �**�*r
���� r � )�prefix)�syms�AssertionError�get�typeZargumentZchildren�valuer Zcloner �NAMEZatomZpower�
DOUBLESTARr r ZLeaf�STAR�extendr r ) �selfZnodeZresultsr r r
r r Z l_newargs� r �//usr/lib64/python3.8/lib2to3/fixes/fix_apply.py� transform sH
��
��
�
zFixApply.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) �__doc__r r Zpgen2r r Z
fixer_utilr r r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_raw_input.cpython-38.opt-1.pyc 0000644 00000001426 15053244165 0016347 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z2Fixer that changes raw_input(...) into input(...).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixRawInputTzU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s |d }|� td|jd�� d S )N�name�input)�prefix)�replacer r )�selfZnodeZresultsr � r
�3/usr/lib64/python3.8/lib2to3/fixes/fix_raw_input.py� transform s zFixRawInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_itertools_imports.cpython-38.opt-1.pyc 0000644 00000002775 15053244165 0020150 0 ustar 00 U
e5d& � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )zA Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) � )�
fixer_base)� BlankLine�syms�tokenc @ s" e Zd ZdZde� Zdd� ZdS )�FixItertoolsImportsTzT
import_from< 'from' 'itertools' 'import' imports=any >
c C sZ |d }|j tjks|js"|g}n|j}|d d d� D ]|}|j tjkrR|j}|}n |j tjkrd d S |jd }|j}|dkr�d |_|�� q6|dkr6|� � |d dkr�dnd |_q6|jd d � p�|g}d
} |D ]&}| r�|j tj
kr�|�� q�| d
N } q�|�r |d j tj
k�r |� � �� q�|j�s4t |d d ��r@|j
d k�rV|j}
t� }|
|_|S d S )
N�imports� r )ZimapZizipZifilter)Z ifilterfalseZ izip_longest� �f� filterfalse� zip_longestT����value)�typer Zimport_as_name�childrenr �NAMEr �STAR�removeZchanged�COMMA�pop�getattr�parent�prefixr ) �selfZnodeZresultsr r Zchild�memberZ name_node� member_nameZ remove_comma�p� r �;/usr/lib64/python3.8/lib2to3/fixes/fix_itertools_imports.py� transform sF
�
�z FixItertoolsImports.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�localsZPATTERNr r r r r r s
�r N) �__doc__Zlib2to3r Zlib2to3.fixer_utilr r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_except.cpython-38.pyc 0000644 00000005375 15053244165 0014677 0 ustar 00 U
e5d
� @ sf d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z m Z dd� Z
G dd � d ej�Zd
S ) a� Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
� )�pytree)�token)�
fixer_base)�Assign�Attr�Name�is_tuple�is_list�symsc c sD t | �D ]6\}}|jtjkr|jd jdkr|| |d fV qd S )N� �exceptr )� enumerate�typer
�
except_clause�children�value)Znodes�i�n� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_except.py� find_excepts s r c @ s e Zd ZdZdZdd� ZdS )� FixExceptTa1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C sx | j }dd� |d D �}dd� |d D �}t|�D �]\}}t|j�dkr2|jdd� \}} }
| �tdd d
�� |
jtjk�r8t| � � d d
�} |
�
� } d | _ |
�| � | �
� } |j}
t |
�D ]\}}t
|tj�r� q�q�t|
�s�t|
�r�t| t| td ���}n
t| | �}t|
d |� �D ]}|�d
|� �q|�||� q2|
j d kr2d |
_ q2dd� |jd d� D �| | }t�|j|�S )Nc S s g | ] }|� � �qS r ��clone)�.0r r r r �
<listcomp>2 s z'FixExcept.transform.<locals>.<listcomp>�tailc S s g | ] }|� � �qS r r )r Zchr r r r 4 s Zcleanup� � �as� )�prefix� �argsr c S s g | ] }|� � �qS r r )r �cr r r r \ s � )r
r �lenr �replacer r r �NAME�new_namer r! r
�
isinstancer ZNoder r r r �reversedZ insert_child)�selfZnodeZresultsr
r Z try_cleanupr Ze_suite�EZcomma�NZnew_N�targetZ suite_stmtsr ZstmtZassignZchildr r r r � transform/ s6
zFixExcept.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr0 r r r r r $ s r N)�__doc__r" r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_reload.cpython-38.opt-2.pyc 0000644 00000002057 15053244165 0015607 0 ustar 00 U
e5d9 � @ s2 d dl mZ d dlmZmZ G dd� dej�ZdS )� )�
fixer_base)�
ImportAndCall� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReloadTZprez�
power< 'reload'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C sR |r2|d }|r2|j | jjkr2|jd jdkr2d S d}t|||�}td d|� |S )N�obj� > �**�*)� importlib�reloadr
)�typeZsymsZargumentZchildren�valuer r )�selfZnodeZresultsr �names�new� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_reload.py� transform s � zFixReload.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r r
s
r N)� r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_execfile.cpython-38.opt-1.pyc 0000644 00000003202 15053244165 0016115 0 ustar 00 U
e5d � @ sV d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
m Z m Z m
Z
G dd� dej�ZdS )zoFixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
� )�
fixer_base)
�Comma�Name�Call�LParen�RParen�Dot�Node�ArgList�String�symsc @ s e Zd ZdZdZdd� ZdS )� FixExecfileTz�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s& |d }|� d�}|� d�}|jd jd �� }t|�� t� tdd�g|d�}ttjt d�|g�}ttj
t � t d �g�ttj
t � t
� g�g} |g| }
|�� } d| _td
d�} |
t� | t� | g }
tt d �|
d �}|g}|d k r�|�t� |�� g� |d k �r|�t� |�� g� tt d
�||jd�S )N�filename�globals�locals���z"rb"� )Zrparen�open�readz'exec'�compile� �exec)�prefix)�getZchildrenZcloner
r r r r Zpowerr Ztrailerr r r r r �extend)�selfZnodeZresultsr r r Zexecfile_parenZ open_argsZ open_callr Z open_exprZ filename_argZexec_strZ compile_argsZ compile_call�args� r �2/usr/lib64/python3.8/lib2to3/fixes/fix_execfile.py� transform s.
��
zFixExecfile.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r
N)�__doc__r r Z
fixer_utilr r r r r r r r
r r ZBaseFixr
r r r r �<module> s 0 fixes/__pycache__/fix_has_key.cpython-38.pyc 0000644 00000005566 15053244165 0015034 0 ustar 00 U
e5d| � @ sB d Z ddlmZ ddlmZ ddlmZmZ G dd� dej�ZdS )a& Fixer for has_key().
Calls to .has_key() methods are expressed in terms of the 'in'
operator:
d.has_key(k) -> k in d
CAVEATS:
1) While the primary target of this fixer is dict.has_key(), the
fixer will change any has_key() method call, regardless of its
class.
2) Cases like this will not be converted:
m = d.has_key
if m(k):
...
Only *calls* to has_key() are converted. While it is possible to
convert the above to something like
m = d.__contains__
if m(k):
...
this is currently not done.
� )�pytree)�
fixer_base)�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )� FixHasKeyTa�
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
c
C s� |st �| j}|jj|jkr.| j�|j�r.d S |�d�}|d }|j}dd� |d D �}|d � � }|�d�} | r�dd� | D �} |j|j
|j|j |j |j
|j|jfkr�t|�}t|�d kr�|d
}nt�|j|�}d |_td d d
�}
|�rtdd d
�} t�|j| |
f�}
t�|j
||
|f�} | �rBt| �} t�|j| ft| � �} |jj|j
|j|j|j|j|j |j |j |jf k�r|t| �} || _| S )N�negation�anchorc S s g | ] }|� � �qS � ��clone��.0�nr r �1/usr/lib64/python3.8/lib2to3/fixes/fix_has_key.py�
<listcomp>R s z'FixHasKey.transform.<locals>.<listcomp>�before�arg�afterc S s g | ] }|� � �qS r r
r r r r r V s � � � �in)�prefix�not) �AssertionError�syms�parent�typeZnot_test�pattern�match�getr r Z
comparisonZand_testZor_testZtestZlambdefZargumentr �lenr ZNodeZpowerr Zcomp_op�tuple�exprZxor_exprZand_exprZ
shift_exprZ
arith_exprZtermZfactor)
�selfZnodeZresultsr r r r r r r Zn_opZn_not�newr r r � transformG sX �
�
�zFixHasKey.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr& r r r r r & s r N) �__doc__� r r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_import.cpython-38.opt-1.pyc 0000644 00000005336 15053244165 0015655 0 ustar 00 U
e5d� � @ sZ d Z ddlmZ ddlmZmZmZmZ ddlm Z m
Z
m Z dd� Z G dd � d ej
�Zd
S ) z�Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
� )�
fixer_base� )�dirname�join�exists�sep)�
FromImport�syms�tokenc c s� | g}|r�|� � }|jtjkr(|jV q|jtjkrNd�dd� |jD ��V q|jtj krl|�
|jd � q|jtj kr�|� |jddd� � qt
d��qdS )zF
Walks over all the names imported in a dotted_as_names node.
� c S s g | ]
}|j �qS � )�value)�.0Zchr r �0/usr/lib64/python3.8/lib2to3/fixes/fix_import.py�
<listcomp> s z$traverse_imports.<locals>.<listcomp>r N���zunknown node type)�pop�typer
�NAMEr
r Z dotted_namer �childrenZdotted_as_name�appendZdotted_as_names�extend�AssertionError)�namesZpending�noder r r �traverse_imports s
r c s4 e Zd ZdZdZ� fdd�Zdd� Zdd� Z� ZS ) � FixImportTzj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c s" t t| ��||� d|jk| _d S )NZabsolute_import)�superr �
start_treeZfuture_features�skip)�selfZtree�name�� __class__r r r / s zFixImport.start_treec C s� | j r
d S |d }|jtjkrVt|d�s4|jd }q | �|j�r�d|j |_|�� nZd}d}t |�D ]}| �|�rzd}qfd}qf|r�|r�| �
|d� d S t d|g�}|j |_ |S d S )N�impr
r �.FTz#absolute and local imports together)
r r r Z import_from�hasattrr �probably_a_local_importr
Zchangedr Zwarningr �prefix)r r Zresultsr$ Z
have_localZ
have_absoluteZmod_name�newr r r � transform3 s,
zFixImport.transformc C st |� d�rdS |�dd�d }t| j�}t||�}ttt|�d��sHdS dtddd d
fD ]}t|| �rX d S qXdS ) Nr% F� r z __init__.pyz.pyz.pycz.soz.slz.pydT)�
startswith�splitr �filenamer r r )r Zimp_name� base_pathZextr r r r' U s
z!FixImport.probably_a_local_import) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r* r' �
__classcell__r r r" r r & s
"r N)�__doc__r r Zos.pathr r r r Z
fixer_utilr r r
r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_getcwdu.cpython-38.opt-2.pyc 0000644 00000001315 15053244165 0015777 0 ustar 00 U
e5d� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixGetcwduTzR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s |d }|� td|jd�� d S )N�name�getcwd)�prefix)�replacer r )�selfZnodeZresultsr � r
�1/usr/lib64/python3.8/lib2to3/fixes/fix_getcwdu.py� transform s zFixGetcwdu.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r
s r N)� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_zip.cpython-38.pyc 0000644 00000003052 15053244165 0014177 0 ustar 00 U
e5d � @ sR d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z G dd� dej �Z
dS ) a7
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�in_special_contextc @ s e Zd ZdZdZdZdd� ZdS )�FixZipTzN
power< 'zip' args=trailer< '(' [any] ')' > [trailers=trailer*]
>
zfuture_builtins.zipc C s� | � |�rd S t|�rd S |d �� }d|_g }d|krZdd� |d D �}|D ]
}d|_qNttjtd�|gdd�}ttjtd�t|g�g| �}|j|_|S ) N�args� �trailersc S s g | ] }|� � �qS � )�clone)�.0�nr r �-/usr/lib64/python3.8/lib2to3/fixes/fix_zip.py�
<listcomp>' s z$FixZip.transform.<locals>.<listcomp>�zip)�prefix�list) Z should_skipr r
r r �symsZpowerr r )�selfZnodeZresultsr r r �newr r r � transform s
zFixZip.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r s r N)�__doc__r
r Zpytreer Zpygramr r Z
fixer_utilr r r ZConditionalFixr r r r r �<module> s
fixes/__pycache__/fix_map.cpython-38.opt-1.pyc 0000644 00000006024 15053244165 0015113 0 ustar 00 U
e5d8 � @ sf d Z ddlmZ ddlmZ ddlmZmZmZm Z m
Z
ddl m Z
ddlmZ G dd� dej�Zd S )
a Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
� )�token)�
fixer_base)�Name�ArgList�Call�ListComp�in_special_context)�python_symbols)�Nodec @ s e Zd ZdZdZdZdd� ZdS )�FixMapTaL
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
[extra_trailers=trailer*]
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'map' args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.mapc C s� | � |�rd S g }d|kr6|d D ]}|�|�� � q"|jjtjkrr| �|d� |�� }d|_t t
d�|g�}�n&d|kr�t |d �� |d �� |d �� �}t tj
|g| dd �}n�d
|kr�|d �� }d|_n�d |k�rf|d }|jtjk�rH|jd
jtjk�rH|jd
jd jtjk�rH|jd
jd jdk�rH| �|d� d S t tj
t
d�|�� g�}d|_t|��rtd S t tj
t
d�t|g�g| �}d|_|j|_|S )NZextra_trailersz You should use a for loop here� �listZ
map_lambdaZxp�fp�it)�prefixZmap_none�arg�args� � �Nonezjcannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence�map)Z should_skip�appendZclone�parent�type�symsZ simple_stmtZwarningr r r r r
ZpowerZtrailerZchildrenZarglistr �NAME�valuer r )�selfZnodeZresultsZtrailers�t�newr � r �-/usr/lib64/python3.8/lib2to3/fixes/fix_map.py� transform@ sN
�
���
zFixMap.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr" r r r r! r s r N)�__doc__Zpgen2r r r Z
fixer_utilr r r r r Zpygramr r Zpytreer
ZConditionalFixr r r r r! �<module> s fixes/__pycache__/fix_repr.cpython-38.pyc 0000644 00000001510 15053244165 0014342 0 ustar 00 U
e5de � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )z/Fixer that transforms `xyzzy` into repr(xyzzy).� )�
fixer_base)�Call�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixReprTz7
atom < '`' expr=any '`' >
c C s8 |d � � }|j| jjkr"t|�}ttd�|g|jd�S )N�expr�repr)�prefix)Zclone�typeZsymsZ testlist1r r r r )�selfZnodeZresultsr � r �./usr/lib64/python3.8/lib2to3/fixes/fix_repr.py� transform s zFixRepr.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N) �__doc__� r Z
fixer_utilr r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_tuple_params.cpython-38.opt-1.pyc 0000644 00000010752 15053244165 0017035 0 ustar 00 U
e5d� � @ s� d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z m Z dd� Z
G dd � d ej�Zd
d � Zd d
� Zg dfdd�Zdd� ZdS )a: Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
� )�pytree)�token)�
fixer_base)�Assign�Name�Newline�Number� Subscript�symsc C s t | tj�o | jd jtjkS )N� )�
isinstancer �Node�children�typer �STRING)�stmt� r �6/usr/lib64/python3.8/lib2to3/fixes/fix_tuple_params.py� is_docstring s �r c @ s( e Zd ZdZdZdZdd� Zdd� ZdS ) �FixTupleParams� Ta
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s� d|kr�� ||�S g �|d }|d }|d jd jtjkrZd}|d jd j}t� � nd}d}t�tjd�� d� ��fd
d � }|jt j
kr�||� n<|jt j kr�t |j�D ]$\}} | jt j
kr�|| |dkd � q��s�d S �D ]}
|d |
_
q�|} |dk�r
d
�d _n&t|d j| ��r0|�d _|d } �D ]}
|d |
_
�q4�|d j| | �< t| d | t�� d �D ]}||d j| _�qr|d �� d S )N�lambda�suite�argsr � r z; � Fc s\ t ��� �}| �� }d|_t||�� �}|r2d|_| �|� ��t�t j
|� �� g�� d S )Nr � ) r �new_name�clone�prefixr �replace�appendr r
r
Z simple_stmt)Z tuple_arg�
add_prefix�n�argr ��endZ new_lines�selfr r � handle_tupleC s
�z.FixTupleParams.transform.<locals>.handle_tuple)r" r )F)�transform_lambdar r r �INDENT�valuer r ZLeafr
ZtfpdefZ
typedargslist� enumerate�parentr r �range�lenZchanged) r' �node�resultsr r �start�indentr( �ir$ �lineZafterr r% r � transform. sF
zFixTupleParams.transformc
C s� |d }|d }t |d �}|jtjkrD|�� }d|_|�|� d S t|�}t|�}| � t
|��}t |dd�} |�| �� � |� � D ]X}
|
jtjkr�|
j
|kr�dd� ||
j
D �} t�tj| �� g| �} |
j| _|
�| � q�d S )Nr �body�innerr )r c S s g | ] }|� � �qS r )r ��.0�cr r r �
<listcomp>� s z3FixTupleParams.transform_lambda.<locals>.<listcomp>)�
simplify_argsr r �NAMEr r r � find_params� map_to_indexr �
tuple_namer Z
post_orderr+ r r
r
Zpower)
r' r0 r1 r r7 r8 ZparamsZto_indexZtup_nameZ new_paramr# Z
subscripts�newr r r r) n s*
�z FixTupleParams.transform_lambdaN)�__name__�
__module__� __qualname__Z run_orderZ
BM_compatibleZPATTERNr6 r) r r r r r s
@r c C sN | j tjtjfkr| S | j tjkr>| j tjkr:| jd } q"| S td| ��d S )Nr zReceived unexpected node %s)r r
Zvfplistr r> �vfpdefr � RuntimeError�r0 r r r r= � s r= c C s< | j tjkrt| jd �S | j tjkr,| jS dd� | jD �S )Nr c S s g | ]}|j tjkrt|��qS r )r r �COMMAr? r9 r r r r< � s z find_params.<locals>.<listcomp>)r r
rF r? r r r> r+ rH r r r r? � s
r? Nc C sZ |d kr i }t | �D ]@\}}ttt|���g}t|t�rHt|||d� q|| ||< q|S )N)�d)r, r r �strr �listr@ )�
param_listr rJ r4 �objZtrailerr r r r@ � s
r@ c C s< g }| D ](}t |t�r&|�t|�� q|�|� qd�|�S )N�_)r rL r! rA �join)rM �lrN r r r rA � s
rA )�__doc__r r Zpgen2r r Z
fixer_utilr r r r r r
r ZBaseFixr r= r? r@ rA r r r r �<module> s l fixes/__pycache__/fix_basestring.cpython-38.pyc 0000644 00000001222 15053244165 0015533 0 ustar 00 U
e5d@ � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z Fixer for basestring -> str.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixBasestringTz 'basestring'c C s t d|jd�S )N�str)�prefix)r r )�selfZnodeZresults� r �4/usr/lib64/python3.8/lib2to3/fixes/fix_basestring.py� transform
s zFixBasestring.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_xreadlines.cpython-38.opt-1.pyc 0000644 00000002136 15053244165 0016474 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zpFix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixXreadlinesTz�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C s@ |� d�}|r$|�td|jd�� n|�dd� |d D �� d S )N�no_call�__iter__)�prefixc S s g | ] }|� � �qS � )Zclone)�.0�xr r �4/usr/lib64/python3.8/lib2to3/fixes/fix_xreadlines.py�
<listcomp> s z+FixXreadlines.transform.<locals>.<listcomp>Zcall)�get�replacer r )�selfZnodeZresultsr r r r � transform s
zFixXreadlines.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_set_literal.cpython-38.opt-2.pyc 0000644 00000003103 15053244165 0016641 0 ustar 00 U
e5d� � @ s6 d dl mZmZ d dlmZmZ G dd� dej�ZdS )� )�
fixer_base�pytree)�token�symsc @ s e Zd ZdZdZdZdd� ZdS )�
FixSetLiteralTaj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s� |� d�}|r2t�tj|�� g�}|�|� |}n|d }t�tj d�g}|�
dd� |j D �� |� t�tj
d�� |jj|d _t�tj|�}|j|_t|j �dkr�|j d }|�� |j|j d _|S )
N�single�items�{c s s | ]}|� � V qd S )N)�clone)�.0�n� r
�5/usr/lib64/python3.8/lib2to3/fixes/fix_set_literal.py� <genexpr>' s z*FixSetLiteral.transform.<locals>.<genexpr>�}���� � )�getr ZNoder Z listmakerr
�replaceZLeafr �LBRACE�extendZchildren�append�RBRACEZ next_sibling�prefixZ dictsetmaker�len�remove) �selfZnodeZresultsr Zfaker �literalZmakerr r
r
r � transform s"
zFixSetLiteral.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZexplicitZPATTERNr r
r
r
r r s
r N)Zlib2to3r r Zlib2to3.fixer_utilr r ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_import.cpython-38.opt-2.pyc 0000644 00000004647 15053244165 0015662 0 ustar 00 U
e5d� � @ sV d dl mZ ddlmZmZmZmZ d dlmZm Z m
Z
dd� Z G dd� dej �Z
d S )
� )�
fixer_base� )�dirname�join�exists�sep)�
FromImport�syms�tokenc c s� | g}|r�|� � }|jtjkr(|jV q|jtjkrNd�dd� |jD ��V q|jtj krl|�
|jd � q|jtj kr�|� |jd d d� � qt
d��qd S )N� c S s g | ]
}|j �qS � )�value)�.0Zchr r �0/usr/lib64/python3.8/lib2to3/fixes/fix_import.py�
<listcomp> s z$traverse_imports.<locals>.<listcomp>r ���zunknown node type)�pop�typer
�NAMEr
r Z dotted_namer �childrenZdotted_as_name�appendZdotted_as_names�extend�AssertionError)�namesZpending�noder r r �traverse_imports s
r c s4 e Zd ZdZdZ� fdd�Zdd� Zdd� Z� ZS ) � FixImportTzj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c s" t t| ��||� d|jk| _d S )NZabsolute_import)�superr �
start_treeZfuture_features�skip)�selfZtree�name�� __class__r r r / s zFixImport.start_treec C s� | j r
d S |d }|jtjkrVt|d�s4|jd }q | �|j�r�d|j |_|�� nZd}d}t |�D ]}| �|�rzd}qfd}qf|r�|r�| �
|d� d S t d|g�}|j |_ |S d S )N�impr
r �.FTz#absolute and local imports together)
r r r Z import_from�hasattrr �probably_a_local_importr
Zchangedr Zwarningr �prefix)r r Zresultsr$ Z
have_localZ
have_absoluteZmod_name�newr r r � transform3 s,
zFixImport.transformc C st |� d�rdS |�dd�d }t| j�}t||�}ttt|�d��sHdS dtddd d
fD ]}t|| �rX d S qXdS ) Nr% F� r z __init__.pyz.pyz.pycz.soz.slz.pydT)�
startswith�splitr �filenamer r r )r Zimp_name� base_pathZextr r r r' U s
z!FixImport.probably_a_local_import) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r* r' �
__classcell__r r r" r r & s
"r N)r r Zos.pathr r r r Z
fixer_utilr r r
r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_nonzero.cpython-38.pyc 0000644 00000001626 15053244165 0015074 0 ustar 00 U
e5dO � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z*Fixer for __nonzero__ -> __bool__ methods.� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixNonzeroTz�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s$ |d }t d|jd�}|�|� d S )N�name�__bool__)�prefix)r r �replace)�selfZnodeZresultsr �new� r �1/usr/lib64/python3.8/lib2to3/fixes/fix_nonzero.py� transform s zFixNonzero.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_exitfunc.cpython-38.pyc 0000644 00000004375 15053244165 0015233 0 ustar 00 U
e5d� � @ sJ d Z ddlmZmZ ddlmZmZmZmZm Z m
Z
G dd� dej �Z dS )z7
Convert use of sys.exitfunc to use the atexit module.
� )�pytree�
fixer_base)�Name�Attr�Call�Comma�Newline�symsc s< e Zd ZdZdZdZ� fdd�Z� fdd�Zdd� Z� Z S ) � FixExitfuncTa�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c s t t| �j|� d S �N)�superr
�__init__)�self�args�� __class__� �2/usr/lib64/python3.8/lib2to3/fixes/fix_exitfunc.pyr
s zFixExitfunc.__init__c s t t| ��||� d | _d S r )r r
�
start_tree�
sys_import)r Ztree�filenamer r r r ! s zFixExitfunc.start_treec C s& d|kr | j d kr |d | _ d S |d �� }d|_t�tjttd�td���}t ||g|j�}|�
|� | j d kr�| � |d� d S | j j d }|j
tjkr�|�t� � |�tdd�� nj| j j}|j �| j �}|j} t�tjtd �tdd�g�}
t�tj|
g�} |�|d t� � |�|d
| � d S ) Nr �func� �atexit�registerzKCan't find sys import; Please add an atexit import at the top of your file.� � �import� )r Zclone�prefixr ZNoder Zpowerr r r �replaceZwarningZchildren�typeZdotted_as_namesZ append_childr �parent�indexZ import_nameZ simple_stmtZ insert_childr ) r ZnodeZresultsr r Zcall�namesZcontaining_stmtZpositionZstmt_containerZ
new_import�newr r r � transform% s6
�
�zFixExitfunc.transform)
�__name__�
__module__� __qualname__Zkeep_line_orderZ
BM_compatibleZPATTERNr
r r& �
__classcell__r r r r r
s r
N)
�__doc__Zlib2to3r r Zlib2to3.fixer_utilr r r r r r ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_xreadlines.cpython-38.opt-2.pyc 0000644 00000001735 15053244165 0016501 0 ustar 00 U
e5d� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixXreadlinesTz�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C s@ |� d�}|r$|�td|jd�� n|�dd� |d D �� d S )N�no_call�__iter__)�prefixc S s g | ] }|� � �qS � )Zclone)�.0�xr r �4/usr/lib64/python3.8/lib2to3/fixes/fix_xreadlines.py�
<listcomp> s z+FixXreadlines.transform.<locals>.<listcomp>Zcall)�get�replacer r )�selfZnodeZresultsr r r r � transform s
zFixXreadlines.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_future.cpython-38.opt-1.pyc 0000644 00000001413 15053244165 0015645 0 ustar 00 U
e5d# � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zVRemove __future__ imports
from __future__ import foo is replaced with an empty line.
� )�
fixer_base)� BlankLinec @ s e Zd ZdZdZdZdd� ZdS )� FixFutureTz;import_from< 'from' module_name="__future__" 'import' any >�
c C s t � }|j|_|S )N)r �prefix)�selfZnodeZresults�new� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_future.py� transform s zFixFuture.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r
r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_unicode.cpython-38.opt-2.pyc 0000644 00000002525 15053244165 0015767 0 ustar 00 U
e5d� � @ s8 d dl mZ d dlmZ ddd�ZG dd� dej�ZdS ) � )�token)�
fixer_base�chr�str)ZunichrZunicodec s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�
FixUnicodeTz STRING | 'unicode' | 'unichr'c s" t t| ��||� d|jk| _d S )N�unicode_literals)�superr �
start_treeZfuture_featuresr )�selfZtree�filename�� __class__� �1/usr/lib64/python3.8/lib2to3/fixes/fix_unicode.pyr s zFixUnicode.start_treec C s� |j tjkr$|�� }t|j |_|S |j tjkr�|j}| jsj|d dkrjd|krjd�dd� |� d�D ��}|d dkr�|dd � }||jkr�|S |�� }||_|S d S ) N� z'"�\z\\c S s g | ]}|� d d�� dd��qS )z\uz\\uz\Uz\\U)�replace)�.0�vr r r �
<listcomp> s �z(FixUnicode.transform.<locals>.<listcomp>ZuU� )
�typer �NAMEZclone�_mapping�value�STRINGr �join�split)r
ZnodeZresults�new�valr r r � transform s"
�
zFixUnicode.transform)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r �
__classcell__r r r r r s r N)Zpgen2r � r r ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_xrange.cpython-38.pyc 0000644 00000004734 15053244165 0014671 0 ustar 00 U
e5d�
� @ sF d Z ddlmZ ddlmZmZmZ ddlmZ G dd� dej�Z dS )z/Fixer that changes xrange(...) into range(...).� )�
fixer_base)�Name�Call�consuming_calls)�patcompc sh e Zd ZdZdZ� fdd�Zdd� Zdd� Zd d
� Zd d � Z d
Z
e � e
�Z
dZe � e�Zdd� Z� ZS )� FixXrangeTz�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c s t t| ��||� t� | _d S �N)�superr �
start_tree�set�transformed_xranges��selfZtree�filename�� __class__� �0/usr/lib64/python3.8/lib2to3/fixes/fix_xrange.pyr
s zFixXrange.start_treec C s
d | _ d S r )r r
r r r � finish_tree s zFixXrange.finish_treec C sD |d }|j dkr | �||�S |j dkr4| �||�S tt|���d S )N�nameZxrange�range)�value�transform_xrange�transform_range�
ValueError�repr�r �node�resultsr r r r � transform s
zFixXrange.transformc C s0 |d }|� td|jd�� | j�t|�� d S )Nr r ��prefix)�replacer r! r �add�idr r r r r $ s zFixXrange.transform_xrangec C sf t |�| jkrb| �|�sbttd�|d �� g�}ttd�|g|jd�}|d D ]}|�|� qN|S d S )Nr �args�listr �rest)r$ r �in_special_contextr r Zcloner! Z append_child)r r r Z
range_callZ list_call�nr r r r * s � � zFixXrange.transform_rangez3power< func=NAME trailer< '(' node=any ')' > any* >z�for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C sf |j d krdS i }|j j d k rJ| j�|j j |�rJ|d |krJ|d jtkS | j�|j |�od|d |kS )NFr �func)�parent�p1�matchr r �p2)r r r r r r r( ? s
�
�z FixXrange.in_special_context)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r ZP1r Zcompile_patternr, ZP2r. r( �
__classcell__r r r r r s
r N)
�__doc__� r Z
fixer_utilr r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_methodattrs.cpython-38.opt-1.pyc 0000644 00000001645 15053244165 0016700 0 ustar 00 U
e5d^ � @ s> d Z ddlmZ ddlmZ dddd�ZG dd � d ej�Zd
S ) z;Fix bound method attributes (method.im_? -> method.__?__).
� )�
fixer_base)�Name�__func__�__self__z__self__.__class__)Zim_funcZim_selfZim_classc @ s e Zd ZdZdZdd� ZdS )�FixMethodattrsTzU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C s. |d d }t |j }|�t||jd�� d S )N�attr� )�prefix)�MAP�value�replacer r )�selfZnodeZresultsr �new� r �5/usr/lib64/python3.8/lib2to3/fixes/fix_methodattrs.py� transform s
zFixMethodattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)�__doc__� r Z
fixer_utilr r
ZBaseFixr r r r r �<module> s � fixes/__pycache__/fix_paren.cpython-38.opt-2.pyc 0000644 00000002343 15053244165 0015444 0 ustar 00 U
e5d� � @ s2 d dl mZ d dlmZmZ G dd� dej�ZdS )� )�
fixer_base)�LParen�RParenc @ s e Zd ZdZdZdd� ZdS )�FixParenTa
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C s8 |d }t � }|j|_d|_|�d|� |�t� � d S )N�target� � )r �prefixZ insert_childZ append_childr )�selfZnodeZresultsr Zlparen� r �//usr/lib64/python3.8/lib2to3/fixes/fix_paren.py� transform% s zFixParen.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)r r Z
fixer_utilr r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_funcattrs.cpython-38.opt-2.pyc 0000644 00000001607 15053244165 0016352 0 ustar 00 U
e5d� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixFuncattrsTz�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s2 |d d }|� td|jdd � |jd�� d S )N�attr� z__%s__� )�prefix)�replacer �valuer )�selfZnodeZresultsr � r �3/usr/lib64/python3.8/lib2to3/fixes/fix_funcattrs.py� transform s �zFixFuncattrs.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N)� r Z
fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_numliterals.cpython-38.opt-2.pyc 0000644 00000001674 15053244165 0016704 0 ustar 00 U
e5d � @ s: d dl mZ d dlmZ d dlmZ G dd� dej�ZdS )� )�token)�
fixer_base)�Numberc @ s" e Zd ZejZdd� Zdd� ZdS )�FixNumliteralsc C s |j �d�p|j d dkS )N�0����Ll)�value�
startswith)�self�node� r
�5/usr/lib64/python3.8/lib2to3/fixes/fix_numliterals.py�match s zFixNumliterals.matchc C s` |j }|d dkr |d d� }n2|�d�rR|�� rRtt|��dkrRd|dd � }t||jd�S )Nr r r � Z0o)�prefix)r r
�isdigit�len�setr r )r r Zresults�valr
r
r � transform s "zFixNumliterals.transformN)�__name__�
__module__� __qualname__r �NUMBERZ _accept_typer r r
r
r
r r s r N)Zpgen2r � r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_metaclass.cpython-38.opt-1.pyc 0000644 00000012265 15053244165 0016316 0 ustar 00 U
e5d � @ sv d Z ddlmZ ddlmZ ddlmZmZmZ dd� Z dd� Z
d d
� Z d d � Z d
d� Z
dd� ZG dd� dej�ZdS )a� Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherits
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
� )�
fixer_base)�token)�syms�Node�Leafc C sz | j D ]n}|jtjkr"t|� S |jtjkr|j r|j d }|jtjkr|j r|j d }t|t�r|j dkr dS qdS )z� we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
� �
__metaclass__TF)
�children�typer �suite�
has_metaclass� simple_stmt� expr_stmt�
isinstancer �value)�parent�node� expr_nodeZ left_side� r �3/usr/lib64/python3.8/lib2to3/fixes/fix_metaclass.pyr s
�r c C s� | j D ]}|jtjkr dS qt| j �D ]\}}|jtjkr( qJq(td��ttjg �}| j |d d� r�| j |d }|� |�
� � |� � qV| � |� |}dS )zf one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
NzNo class suite and no ':'!� ) r r
r r � enumerater �COLON�
ValueErrorr � append_child�clone�remove)�cls_noder �ir � move_noder r r �fixup_parse_tree- s
r c
C s� t |j�D ]\}}|jtjkr
q(q
dS |�� ttjg �}ttj |g�}|j|d� rz|j| }|�
|� � � |�� qJ| � ||� |jd jd }|jd jd } | j
|_
dS )z� if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
Nr )r r r
r �SEMIr r r r r
r r � insert_child�prefix)
r r Z stmt_nodeZsemi_indr Znew_exprZnew_stmtr Z new_leaf1Z old_leaf1r r r �fixup_simple_stmtG s
r$ c C s* | j r&| j d jtjkr&| j d �� d S )N���)r r
r �NEWLINEr )r r r r �remove_trailing_newline_ s r' c c s� | j D ]}|jtjkr q$qtd��tt|j ��D ]t\}}|jtjkr2|j r2|j d }|jtjkr2|j r2|j d }t |t
�r2|j dkr2t |||� t
|� |||fV q2d S )NzNo class suite!r r )r r
r r r �listr r
r r r r r$ r' )r r r Z simple_noder Z left_noder r r �
find_metasd s
� r) c C sz | j ddd� }|r,|�� }|jtjkrq,q|rv|�� }t|t�r^|jtjkr^|jrZd|_dS |� |j ddd� � q,dS )z� If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
Nr% � )
r �popr
r �INDENTr r �DEDENTr# �extend)r Zkidsr r r r � fixup_indent{ s r/ c @ s e Zd ZdZdZdd� ZdS )� FixMetaclassTz
classdef<any*>
c C s8 t |�s d S t|� d }t|�D ]\}}}|}|�� q |jd j}t|j�dkr�|jd jtjkrp|jd }n(|jd � � } t
tj| g�}|� d|� n�t|j�dkr�t
tjg �}|� d|� nZt|j�dk�rt
tjg �}|� dt
tjd�� |� d|� |� dt
tjd�� ntd ��|jd jd }
d
|
_|
j} |j�rZ|�t
tjd �� d |
_nd
|
_|jd } d
| jd _d
| jd _|�|� t|� |j�s�|�� t
|d�}
| |
_|�|
� |�t
tjd�� nbt|j�dk�r4|jd jtjk�r4|jd jtjk�r4t
|d�}
|� d|
� |� dt
tjd�� d S )Nr � � � � r �)�(zUnexpected class definition� metaclass�,� r* r �pass�
���r% )r r r) r r r
�lenr �arglistr r Z set_childr" r r �RPAR�LPARr r r# r �COMMAr/ r& r, r- )�selfr ZresultsZlast_metaclassr r ZstmtZ text_typer> r Zmeta_txtZorig_meta_prefixr Z pass_leafr r r � transform� sb
��
zFixMetaclass.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNrC r r r r r0 � s r0 N)�__doc__r* r Zpygramr Z
fixer_utilr r r r r r$ r' r) r/ ZBaseFixr0 r r r r �<module> s fixes/__pycache__/fix_types.cpython-38.opt-1.pyc 0000644 00000003450 15053244165 0015502 0 ustar 00 U
e5d� � @ sp d Z ddlmZ ddlmZ ddddddd d
d d d d
dddddddddd�Zdd� eD �ZG dd� dej�ZdS ) a� Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
� )�
fixer_base)�Name�bool�
memoryview�type�complex�dictztype(Ellipsis)�float�int�list�objectz
type(None)ztype(NotImplemented)�slice�bytesz(str,)�tuple�str�range)Z BooleanTypeZ
BufferTypeZ ClassTypeZ ComplexTypeZDictTypeZDictionaryTypeZ EllipsisTypeZ FloatTypeZIntTypeZListTypeZLongTypeZ
ObjectTypeZNoneTypeZNotImplementedTypeZ SliceTypeZ
StringTypeZ StringTypesZ TupleTypeZTypeTypeZ UnicodeTypeZ
XRangeTypec C s g | ] }d | �qS )z)power< 'types' trailer< '.' name='%s' > >� )�.0�tr r �//usr/lib64/python3.8/lib2to3/fixes/fix_types.py�
<listcomp>3 s r c @ s" e Zd ZdZd�e�Zdd� ZdS )�FixTypesT�|c C s& t �|d j�}|r"t||jd�S d S )N�name)�prefix)�
_TYPE_MAPPING�get�valuer r )�selfZnodeZresultsZ new_valuer r r � transform9 s zFixTypes.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�join�_patsZPATTERNr r r r r r 5 s
r N) �__doc__� r Z
fixer_utilr r r$ ZBaseFixr r r r r �<module> s4 � fixes/__pycache__/fix_isinstance.cpython-38.opt-2.pyc 0000644 00000002312 15053244165 0016473 0 ustar 00 U
e5dH � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�tokenc @ s e Zd ZdZdZdZdd� ZdS )�
FixIsinstanceTz�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
� c C s� t � }|d }|j}g }t|�}|D ]p\}} | jtjkrr| j|krr|t|�d k r�||d jtjkr�t |� q$q$|�
| � | jtjkr$|� | j� q$|r�|d jtjkr�|d= t|�dkr�|j }
|
j
|d _
|
�|d � n||d d �< |�� d S )N�args� ���� )�setZchildren� enumerate�typer �NAME�value�len�COMMA�next�append�add�parent�prefix�replaceZchanged) �selfZnodeZresultsZnames_insertedZtestlistr Znew_args�iterator�idx�argZatom� r �4/usr/lib64/python3.8/lib2to3/fixes/fix_isinstance.py� transform s* $
zFixIsinstance.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZ run_orderr r r r r r s r N)� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_ne.cpython-38.opt-2.pyc 0000644 00000001371 15053244165 0014741 0 ustar 00 U
e5d; � @ s: d dl mZ d dlmZ d dl mZ G dd� dej�ZdS )� )�pytree)�token)�
fixer_basec @ s" e Zd ZejZdd� Zdd� ZdS )�FixNec C s
|j dkS )Nz<>)�value)�self�node� r �,/usr/lib64/python3.8/lib2to3/fixes/fix_ne.py�match s z FixNe.matchc C s t jtjd|jd�}|S )Nz!=)�prefix)r ZLeafr �NOTEQUALr )r r Zresults�newr r r
� transform s zFixNe.transformN)�__name__�
__module__� __qualname__r r
Z _accept_typer r r r r r
r s r N)� r Zpgen2r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_throw.cpython-38.opt-1.pyc 0000644 00000003413 15053244165 0015500 0 ustar 00 U
e5d. � @ sZ d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z G dd� dej �Z
dS ) z�Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions.� )�pytree)�token)�
fixer_base)�Name�Call�ArgList�Attr�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixThrowTz�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C s� | j }|d �� }|jtjkr.| �|d� d S |�d�}|d krDd S |�� }t|�rndd� |jdd� D �}n d|_ |g}|d }d
|kr�|d
�� }d|_ t
||�} t | t d ��t
|g�g }
|�t�|j|
�� n|�t
||�� d S ) N�excz+Python 3 does not support string exceptions�valc S s g | ] }|� � �qS � )�clone)�.0�cr
r
�//usr/lib64/python3.8/lib2to3/fixes/fix_throw.py�
<listcomp>) s z&FixThrow.transform.<locals>.<listcomp>� ���� �args�tb�with_traceback)�symsr �typer �STRINGZcannot_convert�getr Zchildren�prefixr r r r �replacer ZNodeZpower) �selfZnodeZresultsr r r r Z
throw_argsr �eZwith_tbr
r
r � transform s*
zFixThrow.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr! r
r
r
r r
s r
N)�__doc__r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r
r
r
r �<module> s
fixes/__pycache__/fix_sys_exc.cpython-38.pyc 0000644 00000002576 15053244165 0015064 0 ustar 00 U
e5d
� @ sJ d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
G dd� dej �Z dS )z�Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
� )�
fixer_base)�Attr�Call�Name�Number� Subscript�Node�symsc @ s: e Zd ZdddgZdZdd�dd� eD �� Zd d
� Zd S ) � FixSysExc�exc_type� exc_value�
exc_tracebackTzN
power< 'sys' trailer< dot='.' attribute=(%s) > >
�|c c s | ]}d | V qdS )z'%s'N� )�.0�er r �1/usr/lib64/python3.8/lib2to3/fixes/fix_sys_exc.py� <genexpr> s zFixSysExc.<genexpr>c C st |d d }t | j�|j��}ttd�|jd�}ttd�|�}|d j|d jd _|� t
|�� t t j
||jd�S )NZ attribute� �exc_info)�prefix�sys�dot� )r r �index�valuer r r r Zchildren�appendr r r Zpower)�selfZnodeZresultsZsys_attrr Zcall�attrr r r � transform s zFixSysExc.transformN)�__name__�
__module__� __qualname__r Z
BM_compatible�joinZPATTERNr r r r r r
s
�r
N)
�__doc__� r Z
fixer_utilr r r r r r r ZBaseFixr
r r r r �<module> s
$ fixes/__pycache__/fix_getcwdu.cpython-38.opt-1.pyc 0000644 00000001417 15053244165 0016001 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z1
Fixer that changes os.getcwdu() to os.getcwd().
� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixGetcwduTzR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s |d }|� td|jd�� d S )N�name�getcwd)�prefix)�replacer r )�selfZnodeZresultsr � r
�1/usr/lib64/python3.8/lib2to3/fixes/fix_getcwdu.py� transform s zFixGetcwdu.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r
s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_input.cpython-38.pyc 0000644 00000001661 15053244165 0014540 0 ustar 00 U
e5d� � @ sL d Z ddlmZ ddlmZmZ ddlmZ e�d�ZG dd� dej �Z
dS ) z4Fixer that changes input(...) into eval(input(...)).� )�
fixer_base)�Call�Name)�patcompz&power< 'eval' trailer< '(' any ')' > >c @ s e Zd ZdZdZdd� ZdS )�FixInputTzL
power< 'input' args=trailer< '(' [any] ')' > >
c C s6 t �|jj�rd S |�� }d|_ttd�|g|jd�S )N� �eval)�prefix)�context�match�parentZcloner r r )�selfZnodeZresults�new� r �//usr/lib64/python3.8/lib2to3/fixes/fix_input.py� transform s
zFixInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r
s r N) �__doc__r r Z
fixer_utilr r r Zcompile_patternr
ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_dict.cpython-38.opt-1.pyc 0000644 00000006275 15053244165 0015271 0 ustar 00 U
e5d� � @ sj d Z ddlmZ ddlmZ ddlmZ ddlmZmZmZ ddlmZ ej dhB Z
G dd � d ej �Z d
S ) aj Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
� )�pytree)�patcomp)�
fixer_base)�Name�Call�Dot)�
fixer_util�iterc @ s@ e Zd ZdZdZdd� ZdZe�e�Z dZ
e�e
�Z dd� Z d S )
�FixDictTa
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c
C s |d }|d d }|d }| j }|j}|�d�}|�d�} |sD| rP|dd � }dd � |D �}d
d � |D �}| o|| �||�}
|t�|jt� t||j d �g�|d �
� g } t�|j | �} |
s�| s�d
| _ t t|r�dnd�| g�} |r�t�|j | g| �} |j | _ | S )N�head�method� �tailr Zview� c S s g | ] }|� � �qS � ��clone��.0�nr r �./usr/lib64/python3.8/lib2to3/fixes/fix_dict.py�
<listcomp>A s z%FixDict.transform.<locals>.<listcomp>c S s g | ] }|� � �qS r r r r r r r B s )�prefixZparens� �list)
�syms�value�
startswith�in_special_contextr ZNodeZtrailerr r r r Zpowerr )
�self�node�resultsr r r r Z method_name�isiterZisviewZspecial�args�newr r r � transform6 s:
���
�zFixDict.transformz3power< func=NAME trailer< '(' node=any ')' > any* >zmfor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� |j d krdS i }|j j d k r^| j�|j j |�r^|d |kr^|rN|d jtkS |d jtjkS |sfdS | j�|j |�o�|d |kS )NFr �func)�parent�p1�matchr � iter_exemptr �consuming_calls�p2)r r r" r! r r r r Z s
�
�zFixDict.in_special_contextN)
�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr% ZP1r Zcompile_patternr( ZP2r, r r r r r r
) s
r
N)
�__doc__r r r r r r r r r+ r* ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_has_key.cpython-38.opt-2.pyc 0000644 00000004440 15053244165 0015762 0 ustar 00 U
e5d| � @ s> d dl mZ d dl mZ d dlmZmZ G dd� dej�ZdS )� )�pytree)�
fixer_base)�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )� FixHasKeyTa�
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
c
C s| | j }|jj|jkr&| j�|j�r&d S |�d�}|d }|j}dd� |d D �}|d �� }|�d�} | rxdd� | D �} |j|j |j|j
|j |j |j
|jfkr�t|�}t|�d kr�|d
}nt�|j|�}d |_td d d
�}
|r�tdd d
�} t�|j| |
f�}
t�|j ||
|f�} | �r8t| �} t�|j| ft| � �} |jj|j |j|j|j|j|j|j |j |jf k�rrt| �} || _| S )N�negation�anchorc S s g | ] }|� � �qS � ��clone��.0�nr r �1/usr/lib64/python3.8/lib2to3/fixes/fix_has_key.py�
<listcomp>R s z'FixHasKey.transform.<locals>.<listcomp>�before�arg�afterc S s g | ] }|� � �qS r r
r r r r r V s � � � �in)�prefix�not) �syms�parent�typeZnot_test�pattern�match�getr r Z
comparisonZand_testZor_testZtestZlambdefZargumentr �lenr ZNodeZpowerr Zcomp_op�tuple�exprZxor_exprZand_exprZ
shift_exprZ
arith_exprZtermZfactor)
�selfZnodeZresultsr r r r r r r Zn_opZn_not�newr r r � transformG sV �
�
�zFixHasKey.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr% r r r r r & s r N)� r r Z
fixer_utilr r ZBaseFixr r r r r �<module>! s fixes/__pycache__/fix_idioms.cpython-38.pyc 0000644 00000007514 15053244165 0014670 0 ustar 00 U
e5d � @ sN d Z ddlmZ ddlmZmZmZmZmZm Z dZ
dZ G dd� dej �Z
dS ) a� Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
� )�
fixer_base)�Call�Comma�Name�Node� BlankLine�symsz0(n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)z(power< 'type' trailer< '(' x=any ')' > >c sP e Zd ZdZdeeeef Z� fdd�Zdd� Zdd� Z d d
� Z
d d � Z � Z S )
� FixIdiomsTa�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c s8 t t| ��|�}|r4d|kr4|d |d kr0|S d S |S )N�sortedZid1Zid2)�superr �match)�self�node�r�� __class__� �0/usr/lib64/python3.8/lib2to3/fixes/fix_idioms.pyr O s zFixIdioms.matchc C sH d|kr| � ||�S d|kr(| �||�S d|kr<| �||�S td��d S )N�
isinstance�whiler
z
Invalid match)�transform_isinstance�transform_while�transform_sort� RuntimeError)r
r �resultsr r r � transformZ s zFixIdioms.transformc C sh |d � � }|d � � }d|_d|_ttd�|t� |g�}d|kr\d|_ttjtd�|g�}|j|_|S )N�x�T� � r �n�not)�clone�prefixr r r r r Znot_test)r
r r r r Ztestr r r r d s z FixIdioms.transform_isinstancec C s |d }|� td|jd�� d S )Nr �True�r# )�replacer r# )r
r r Zoner r r r p s zFixIdioms.transform_whilec C s |d }|d }|� d�}|� d�}|r>|�td|jd�� n8|rn|�� }d|_|�ttd�|g|jd�� ntd��|�� |j}d |k�r|r�|�d �d
|d
jf} d � | �|d
_nH|j
s�t �|j d ks�t �t
� }
|j
�|
� |j |
ks�t �|�d �d
|
_d S ) N�sort�next�list�exprr
r% r z should not have reached here�
� )�getr& r r# r" r r �remove�
rpartition�join�parent�AssertionErrorZ next_siblingr Z append_child) r
r r Z sort_stmtZ next_stmtZ list_callZ simple_expr�newZbtwnZ prefix_linesZend_liner r r r t s2
�
zFixIdioms.transform_sort)
�__name__�
__module__� __qualname__Zexplicit�TYPE�CMPZPATTERNr r r r r �
__classcell__r r r r r % s %
�'
r N)�__doc__r r Z
fixer_utilr r r r r r r8 r7 ZBaseFixr r r r r �<module> s
fixes/__pycache__/fix_raise.cpython-38.opt-2.pyc 0000644 00000003131 15053244165 0015436 0 ustar 00 U
e5dn � @ sV d dl mZ d dlmZ d dl mZ d dlmZmZmZm Z m
Z
G dd� dej �Z dS )� )�pytree)�token)�
fixer_base)�Name�Call�Attr�ArgList�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixRaiseTzB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c C sh | j }|d �� }|jtjkr2d}| �||� d S t|�r^t|�rX|jd jd �� }q:d|_d|kr�t �
|j t d�|g�}|j|_|S |d �� }t|�r�dd � |jdd
� D �}n d |_|g}d |k�rB|d �� } d | _|}
|jtj
ks�|jd
k�rt||�}
t|
t d��t| g�g } t �
|jt d�g| �}|j|_|S t j
|j t d�t||�g|jd�S d S )N�excz+Python 3 does not support string exceptions� � � �val�raisec S s g | ] }|� � �qS � )�clone)�.0�cr r �//usr/lib64/python3.8/lib2to3/fixes/fix_raise.py�
<listcomp>D s z&FixRaise.transform.<locals>.<listcomp>���� �tb�None�with_traceback)�prefix)�symsr �typer �STRINGZcannot_convertr Zchildrenr r ZNodeZ
raise_stmtr �NAME�valuer r r Z simple_stmt) �selfZnodeZresultsr r �msg�newr �argsr �eZwith_tbr r r � transform& sB
�zFixRaise.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r r r r r
s r
N)
r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_raw_input.cpython-38.pyc 0000644 00000001426 15053244165 0015410 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )z2Fixer that changes raw_input(...) into input(...).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )� FixRawInputTzU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s |d }|� td|jd�� d S )N�name�input)�prefix)�replacer r )�selfZnodeZresultsr � r
�3/usr/lib64/python3.8/lib2to3/fixes/fix_raw_input.py� transform s zFixRawInput.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r
r
r
r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r
r
r
r �<module> s fixes/__pycache__/fix_reduce.cpython-38.pyc 0000644 00000002143 15053244165 0014644 0 ustar 00 U
e5dE � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zqFixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
� )�
fixer_base�� touch_importc @ s e Zd ZdZdZdZdd� ZdS )� FixReduceTZpreai
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t dd|� d S )N� functools�reducer )�selfZnodeZresults� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_reduce.py� transform" s zFixReduce.transformN)�__name__�
__module__� __qualname__Z
BM_compatible�orderZPATTERNr r r r r
r s r N)�__doc__Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_metaclass.cpython-38.opt-2.pyc 0000644 00000007521 15053244165 0016316 0 ustar 00 U
e5d � @ sr d dl mZ d dlmZ d dlmZmZmZ dd� Zdd� Z dd � Z
d
d � Z d d
� Z dd� Z
G dd� dej�ZdS )� )�
fixer_base)�token)�syms�Node�Leafc C sz | j D ]n}|jtjkr"t|� S |jtjkr|j r|j d }|jtjkr|j r|j d }t|t�r|j dkr dS qdS )N� �
__metaclass__TF)
�children�typer �suite�
has_metaclass� simple_stmt� expr_stmt�
isinstancer �value)�parent�node� expr_nodeZ left_side� r �3/usr/lib64/python3.8/lib2to3/fixes/fix_metaclass.pyr s
�r c C s� | j D ]}|jtjkr d S qt| j �D ]\}}|jtjkr( qJq(td��ttjg �}| j |d d � r�| j |d }|� |�
� � |� � qV| � |� |}d S )NzNo class suite and no ':'!� ) r r
r r � enumerater �COLON�
ValueErrorr � append_child�clone�remove)�cls_noder �ir � move_noder r r �fixup_parse_tree- s
r c
C s� t |j�D ]\}}|jtjkr
q(q
d S |�� ttjg �}ttj |g�}|j|d � rz|j| }|�
|� � � |�� qJ| � ||� |jd jd }|jd jd } | j
|_
d S )Nr )r r r
r �SEMIr r r r r
r r � insert_child�prefix)
r r Z stmt_nodeZsemi_indr Znew_exprZnew_stmtr Z new_leaf1Z old_leaf1r r r �fixup_simple_stmtG s
r$ c C s* | j r&| j d jtjkr&| j d �� d S )N���)r r
r �NEWLINEr )r r r r �remove_trailing_newline_ s r' c c s� | j D ]}|jtjkr q$qtd��tt|j ��D ]t\}}|jtjkr2|j r2|j d }|jtjkr2|j r2|j d }t |t
�r2|j dkr2t |||� t
|� |||fV q2d S )NzNo class suite!r r )r r
r r r �listr r
r r r r r$ r' )r r r Z simple_noder Z left_noder r r �
find_metasd s
� r) c C sz | j d d d� }|r,|�� }|jtjkrq,q|rv|�� }t|t�r^|jtjkr^|jrZd|_d S |� |j d d d� � q,d S )Nr% � )
r �popr
r �INDENTr r �DEDENTr# �extend)r Zkidsr r r r � fixup_indent{ s r/ c @ s e Zd ZdZdZdd� ZdS )� FixMetaclassTz
classdef<any*>
c C s8 t |�s d S t|� d }t|�D ]\}}}|}|�� q |jd j}t|j�dkr�|jd jtjkrp|jd }n(|jd � � } t
tj| g�}|� d|� n�t|j�dkr�t
tjg �}|� d|� nZt|j�dk�rt
tjg �}|� dt
tjd�� |� d|� |� dt
tjd�� ntd ��|jd jd }
d
|
_|
j} |j�rZ|�t
tjd �� d |
_nd
|
_|jd } d
| jd _d
| jd _|�|� t|� |j�s�|�� t
|d�}
| |
_|�|
� |�t
tjd�� nbt|j�dk�r4|jd jtjk�r4|jd jtjk�r4t
|d�}
|� d|
� |� dt
tjd�� d S )Nr � � � � r �)�(zUnexpected class definition� metaclass�,� r* r �pass�
���r% )r r r) r r r
�lenr �arglistr r Z set_childr" r r �RPAR�LPARr r r# r �COMMAr/ r& r, r- )�selfr ZresultsZlast_metaclassr r ZstmtZ text_typer> r Zmeta_txtZorig_meta_prefixr Z pass_leafr r r � transform� sb
��
zFixMetaclass.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNrC r r r r r0 � s r0 N)r* r Zpygramr Z
fixer_utilr r r r r r$ r' r) r/ ZBaseFixr0 r r r r �<module> s fixes/__pycache__/fix_repr.cpython-38.opt-1.pyc 0000644 00000001510 15053244165 0015301 0 ustar 00 U
e5de � @ s: d Z ddlmZ ddlmZmZmZ G dd� dej�ZdS )z/Fixer that transforms `xyzzy` into repr(xyzzy).� )�
fixer_base)�Call�Name� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixReprTz7
atom < '`' expr=any '`' >
c C s8 |d � � }|j| jjkr"t|�}ttd�|g|jd�S )N�expr�repr)�prefix)Zclone�typeZsymsZ testlist1r r r r )�selfZnodeZresultsr � r �./usr/lib64/python3.8/lib2to3/fixes/fix_repr.py� transform s zFixRepr.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r
r s r N) �__doc__� r Z
fixer_utilr r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_renames.cpython-38.opt-1.pyc 0000644 00000003722 15053244165 0015772 0 ustar 00 U
e5d� � @ sV d Z ddlmZ ddlmZmZ dddiiZi Zdd� Zd d
� Z G d d � d ej
�Z d
S )z?Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
� )�
fixer_base)�Name�
attr_chain�sysZmaxint�maxsizec C s dd� tt| �� d S )N�(�|�))�join�map�repr)�members� r �1/usr/lib64/python3.8/lib2to3/fixes/fix_renames.py�
alternates s r c c sZ t t�� �D ]H\} }t |�� �D ]2\}}|t| |f< d| ||f V d| |f V q q d S )Nz�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
z^
power< module_name=%r trailer< '.' attr_name=%r > any* >
)�list�MAPPING�items�LOOKUP)�module�replaceZold_attr�new_attrr r r �
build_pattern s ��r c s8 e Zd ZdZd�e� �ZdZ� fdd�Zdd� Z � Z
S )�
FixRenamesTr Zprec s@ t t| �j� � |�}|r<t� fdd�t|d�D ��r8dS |S dS )Nc 3 s | ]}� |�V qd S )Nr )�.0�obj��matchr r � <genexpr>5 s z#FixRenames.match.<locals>.<genexpr>�parentF)�superr r �anyr )�self�node�results�� __class__r r r 1 s zFixRenames.matchc C sD |� d�}|� d�}|r@|r@t|j|jf }|�t||jd�� d S )NZ module_name� attr_name)�prefix)�getr �valuer r r( )r" r# r$ Zmod_namer' r r r r � transform> s
zFixRenames.transform) �__name__�
__module__� __qualname__Z
BM_compatibler
r ZPATTERN�orderr r+ �
__classcell__r r r% r r * s
r N) �__doc__� r Z
fixer_utilr r r r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_exitfunc.cpython-38.opt-1.pyc 0000644 00000004375 15053244165 0016172 0 ustar 00 U
e5d� � @ sJ d Z ddlmZmZ ddlmZmZmZmZm Z m
Z
G dd� dej �Z dS )z7
Convert use of sys.exitfunc to use the atexit module.
� )�pytree�
fixer_base)�Name�Attr�Call�Comma�Newline�symsc s< e Zd ZdZdZdZ� fdd�Z� fdd�Zdd� Z� Z S ) � FixExitfuncTa�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c s t t| �j|� d S �N)�superr
�__init__)�self�args�� __class__� �2/usr/lib64/python3.8/lib2to3/fixes/fix_exitfunc.pyr
s zFixExitfunc.__init__c s t t| ��||� d | _d S r )r r
�
start_tree�
sys_import)r Ztree�filenamer r r r ! s zFixExitfunc.start_treec C s& d|kr | j d kr |d | _ d S |d �� }d|_t�tjttd�td���}t ||g|j�}|�
|� | j d kr�| � |d� d S | j j d }|j
tjkr�|�t� � |�tdd�� nj| j j}|j �| j �}|j} t�tjtd �tdd�g�}
t�tj|
g�} |�|d t� � |�|d
| � d S ) Nr �func� �atexit�registerzKCan't find sys import; Please add an atexit import at the top of your file.� � �import� )r Zclone�prefixr ZNoder Zpowerr r r �replaceZwarningZchildren�typeZdotted_as_namesZ append_childr �parent�indexZ import_nameZ simple_stmtZ insert_childr ) r ZnodeZresultsr r Zcall�namesZcontaining_stmtZpositionZstmt_containerZ
new_import�newr r r � transform% s6
�
�zFixExitfunc.transform)
�__name__�
__module__� __qualname__Zkeep_line_orderZ
BM_compatibleZPATTERNr
r r& �
__classcell__r r r r r
s r
N)
�__doc__Zlib2to3r r Zlib2to3.fixer_utilr r r r r r ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_apply.cpython-38.opt-2.pyc 0000644 00000003027 15053244165 0015464 0 ustar 00 U
e5d* � @ sN d dl mZ d dlmZ d dl mZ d dlmZmZmZ G dd� dej �Z
dS )� )�pytree)�token)�
fixer_base)�Call�Comma� parenthesizec @ s e Zd ZdZdZdd� ZdS )�FixApplyTa.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C s, | j }|d }|d }|�d�}|rF|j| j jkrF|jd jdkrFd S |rl|j| j jkrl|jd jdkrld S |j}|�� }|jtj |j
fkr�|j|j ks�|jd jtj kr�t
|�}d|_|�� }d|_|d k r�|�� }d|_t�tjd �|g}|d k �r |�t� t�tj d�|g� d
|d _t|||d �S ) N�func�args�kwds� > �**�*r
���� r � )�prefix)�syms�get�typeZargumentZchildren�valuer Zcloner �NAMEZatomZpower�
DOUBLESTARr r ZLeaf�STAR�extendr r ) �selfZnodeZresultsr r r
r r Z l_newargs� r �//usr/lib64/python3.8/lib2to3/fixes/fix_apply.py� transform sF
��
��
�
zFixApply.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N) r r Zpgen2r r Z
fixer_utilr r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_exitfunc.cpython-38.opt-2.pyc 0000644 00000004265 15053244165 0016171 0 ustar 00 U
e5d� � @ sF d dl mZmZ d dlmZmZmZmZmZm Z G dd� dej
�Z dS )� )�pytree�
fixer_base)�Name�Attr�Call�Comma�Newline�symsc s< e Zd ZdZdZdZ� fdd�Z� fdd�Zdd� Z� Z S ) � FixExitfuncTa�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c s t t| �j|� d S �N)�superr
�__init__)�self�args�� __class__� �2/usr/lib64/python3.8/lib2to3/fixes/fix_exitfunc.pyr
s zFixExitfunc.__init__c s t t| ��||� d | _d S r )r r
�
start_tree�
sys_import)r Ztree�filenamer r r r ! s zFixExitfunc.start_treec C s& d|kr | j d kr |d | _ d S |d �� }d|_t�tjttd�td���}t ||g|j�}|�
|� | j d kr�| � |d� d S | j j d }|j
tjkr�|�t� � |�tdd�� nj| j j}|j �| j �}|j} t�tjtd �tdd�g�}
t�tj|
g�} |�|d t� � |�|d
| � d S ) Nr �func� �atexit�registerzKCan't find sys import; Please add an atexit import at the top of your file.� � �import� )r Zclone�prefixr ZNoder Zpowerr r r �replaceZwarningZchildren�typeZdotted_as_namesZ append_childr �parent�indexZ import_nameZ simple_stmtZ insert_childr ) r ZnodeZresultsr r Zcall�namesZcontaining_stmtZpositionZstmt_containerZ
new_import�newr r r � transform% s6
�
�zFixExitfunc.transform)
�__name__�
__module__� __qualname__Zkeep_line_orderZ
BM_compatibleZPATTERNr
r r& �
__classcell__r r r r r
s r
N) Zlib2to3r r Zlib2to3.fixer_utilr r r r r r ZBaseFixr
r r r r �<module> s fixes/__pycache__/fix_xrange.cpython-38.opt-1.pyc 0000644 00000004734 15053244165 0015630 0 ustar 00 U
e5d�
� @ sF d Z ddlmZ ddlmZmZmZ ddlmZ G dd� dej�Z dS )z/Fixer that changes xrange(...) into range(...).� )�
fixer_base)�Name�Call�consuming_calls)�patcompc sh e Zd ZdZdZ� fdd�Zdd� Zdd� Zd d
� Zd d � Z d
Z
e � e
�Z
dZe � e�Zdd� Z� ZS )� FixXrangeTz�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c s t t| ��||� t� | _d S �N)�superr �
start_tree�set�transformed_xranges��selfZtree�filename�� __class__� �0/usr/lib64/python3.8/lib2to3/fixes/fix_xrange.pyr
s zFixXrange.start_treec C s
d | _ d S r )r r
r r r � finish_tree s zFixXrange.finish_treec C sD |d }|j dkr | �||�S |j dkr4| �||�S tt|���d S )N�nameZxrange�range)�value�transform_xrange�transform_range�
ValueError�repr�r �node�resultsr r r r � transform s
zFixXrange.transformc C s0 |d }|� td|jd�� | j�t|�� d S )Nr r ��prefix)�replacer r! r �add�idr r r r r $ s zFixXrange.transform_xrangec C sf t |�| jkrb| �|�sbttd�|d �� g�}ttd�|g|jd�}|d D ]}|�|� qN|S d S )Nr �args�listr �rest)r$ r �in_special_contextr r Zcloner! Z append_child)r r r Z
range_callZ list_call�nr r r r * s � � zFixXrange.transform_rangez3power< func=NAME trailer< '(' node=any ')' > any* >z�for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C sf |j d krdS i }|j j d k rJ| j�|j j |�rJ|d |krJ|d jtkS | j�|j |�od|d |kS )NFr �func)�parent�p1�matchr r �p2)r r r r r r r( ? s
�
�z FixXrange.in_special_context)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r ZP1r Zcompile_patternr, ZP2r. r( �
__classcell__r r r r r s
r N)
�__doc__� r Z
fixer_utilr r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_urllib.cpython-38.opt-1.pyc 0000644 00000013552 15053244165 0015633 0 ustar 00 U
e5d� � @ s� d Z ddlmZmZ ddlmZmZmZmZm Z m
Z
m Z dddddd d
d d gfd
ddddddddddddddd gfd d gfgdd d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5gfd d6d7gfgd8�Z e d9 �
e d: d; � d<d=� ZG d>d?� d?e�Zd@S )Az�Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
� )�
alternates�
FixImports)�Name�Comma�
FromImport�Newline�find_indentation�Node�symszurllib.requestZ URLopenerZFancyURLopenerZ urlretrieveZ
_urlopenerZurlopenZ
urlcleanupZ pathname2urlZ url2pathnamez urllib.parseZquoteZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ splitattrZ splithostZ
splitnportZ splitpasswdZ splitportZ
splitqueryZsplittagZ splittypeZ splituserZ
splitvaluez urllib.errorZContentTooShortErrorZinstall_openerZ build_openerZRequestZOpenerDirectorZ BaseHandlerZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZURLErrorZ HTTPError)�urllib�urllib2r r � c c sv t � } t�� D ]b\}}|D ]T}|\}}t|�}d||f V d|||f V d| V d| V d||f V qqd S )Nz�import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
z�import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
zIimport_from< 'from' module_star=%r 'import' star='*' >
ztimport_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
zKpower< bare_with_attr=%r trailer< '.' member=%s > any* >
)�set�MAPPING�itemsr )ZbareZ
old_moduleZchanges�changeZ
new_module�members� r �0/usr/lib64/python3.8/lib2to3/fixes/fix_urllib.py�
build_pattern0 s( �����r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) � FixUrllibc C s d� t� �S )N�|)�joinr )�selfr r r r I s zFixUrllib.build_patternc C sv |� d�}|j}g }t|j dd� D ] }|�t|d |d�t� g� q&|�tt|j d d |d�� |�|� dS )z�Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
�moduleN���r ��prefix) �getr r �value�extendr r �append�replace)r �node�resultsZ
import_mod�pref�names�namer r r �transform_importL s
zFixUrllib.transform_importc C s& |� d�}|j}|� d�}|r�t|t�r0|d }d}t|j D ] }|j|d kr>|d } q^q>|rv|�t||d�� n | �|d� �n�g }i } |d }
|
D ]�}|j t
j kr�|j d j} |j d j} n
|j} d} | d
kr�t|j D ]B}| |d kr�|d | k�r |�
|d � | �|d g ��
|� q�q�g }
t|�}d }d d
� }|D ]�}| | }g }|dd� D ]"}|�|||�� |�
t� � �q^|�||d |�� t||�}|�r�|jj�|��r�||_|
�
|� d}�qB|
�rg }|
dd� D ]}|�|t� g� �q�|�
|
d � |�|� n | �|d� dS )z�Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
�
mod_member�memberr Nr
r �!This is an invalid module elementr � �,Tc S sX | j tjkrHt| jd j|d�| jd �� | jd �� g}ttj|�gS t| j|d�gS )Nr r r
r, )�typer
�import_as_namer �childrenr Zcloner )r' r Zkidsr r r � handle_name� s �z/FixUrllib.transform_member.<locals>.handle_namer Fz All module elements are invalid)r r �
isinstance�listr r r" r �cannot_convertr. r
r/ r0 r! �
setdefaultr r r r �parent�endswithr )r r# r$ r) r% r* �new_namer �modulesZmod_dictr Zas_name� member_nameZ new_nodesZ indentation�firstr1 r Zeltsr& Zelt�newZnodesZnew_noder r r �transform_member\ sh
zFixUrllib.transform_memberc C s~ |� d�}|� d�}d}t|t�r*|d }t|j D ] }|j|d kr4|d } qTq4|rn|�t||jd�� n | �|d� dS )z.Transform for calls to module members in code.�bare_with_attrr* Nr r
r r+ ) r r2 r3 r r r" r r r4 )r r# r$ Z
module_dotr* r8 r r r r �
transform_dot� s
�
zFixUrllib.transform_dotc C sz |� d�r| �||� n^|� d�r0| �||� nF|� d�rH| �||� n.|� d�r`| �|d� n|� d�rv| �|d� d S )Nr r) r> Z module_starzCannot handle star imports.Z module_asz#This module is now multiple modules)r r( r= r? r4 )r r# r$ r r r � transform� s
zFixUrllib.transformN)�__name__�
__module__� __qualname__r r( r= r? r@ r r r r r G s
Lr N)�__doc__Zlib2to3.fixes.fix_importsr r Zlib2to3.fixer_utilr r r r r r r
r r! r r r r r r �<module> s~ $ �� ����
�����! fixes/__pycache__/fix_xreadlines.cpython-38.pyc 0000644 00000002136 15053244165 0015535 0 ustar 00 U
e5d� � @ s2 d Z ddlmZ ddlmZ G dd� dej�ZdS )zpFix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__).� )�
fixer_base)�Namec @ s e Zd ZdZdZdd� ZdS )�
FixXreadlinesTz�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C s@ |� d�}|r$|�td|jd�� n|�dd� |d D �� d S )N�no_call�__iter__)�prefixc S s g | ] }|� � �qS � )Zclone)�.0�xr r �4/usr/lib64/python3.8/lib2to3/fixes/fix_xreadlines.py�
<listcomp> s z+FixXreadlines.transform.<locals>.<listcomp>Zcall)�get�replacer r )�selfZnodeZresultsr r r r � transform s
zFixXreadlines.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr r r r r r s r N)�__doc__� r Z
fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_operator.cpython-38.opt-2.pyc 0000644 00000007223 15053244165 0016174 0 ustar 00 U
e5db
� @ sJ d dl Zd dlmZ d dlmZmZmZmZ dd� Z G dd� dej
�Z dS )� N)�
fixer_base)�Call�Name�String� touch_importc s � fdd�}|S )Nc s
� | _ | S �N)�
invocation)�f��s� �2/usr/lib64/python3.8/lib2to3/fixes/fix_operator.py�dec s zinvocation.<locals>.decr )r r r r
r
r s r c @ s� e Zd ZdZdZdZdZdeeed� Zdd� Z e
d �d
d � �Z e
d �d
d� �Z e
d�dd� �Z
e
d�dd� �Ze
d�dd� �Ze
d�dd� �Ze
d�d d � �Zd d � Zd d!� Zd"d#� Zd$S )%� FixOperatorTZprez�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
z'(' obj=any ')'z�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
)�methods�objc C s" | � ||�}|d k r |||�S d S r )�
_check_method)�self�node�results�methodr r r
� transform+ s zFixOperator.transformzoperator.contains(%s)c C s | � ||d�S )N�contains��_handle_rename�r r r r r r
�_sequenceIncludes0 s z FixOperator._sequenceIncludesz callable(%s)c C s" |d }t td�|�� g|jd�S )Nr �callable��prefix)r r �cloner )r r r r r r r
� _isCallable4 s zFixOperator._isCallablezoperator.mul(%s)c C s | � ||d�S )N�mulr r r r r
�_repeat9 s zFixOperator._repeatzoperator.imul(%s)c C s | � ||d�S )N�imulr r r r r
�_irepeat= s zFixOperator._irepeatz(isinstance(%s, collections.abc.Sequence)c C s | � ||dd�S )N�collections.abc�Sequence��_handle_type2abcr r r r
�_isSequenceTypeA s zFixOperator._isSequenceTypez'isinstance(%s, collections.abc.Mapping)c C s | � ||dd�S )Nr& �Mappingr( r r r r
�_isMappingTypeE s zFixOperator._isMappingTypez isinstance(%s, numbers.Number)c C s | � ||dd�S )NZnumbers�Numberr( r r r r
�
_isNumberTypeI s zFixOperator._isNumberTypec C s |d d }||_ |�� d S )Nr r )�valueZchanged)r r r �namer r r r
r M s zFixOperator._handle_renamec C sF t d ||� |d }|�� tdd�||g� �g}ttd�||jd�S )Nr z, �.�
isinstancer )r r r �joinr r r )r r r �module�abcr �argsr r r
r) R s z FixOperator._handle_type2abcc C s^ t | d|d d j �}t|tjj�rZd|kr2|S t|d �f}|j| }| �|d| � d S )N�_r r r4 r zYou should use '%s' here.) �getattrr/ r2 � collectionsr5 �Callable�strr Zwarning)r r r r �subZinvocation_strr r r
r X s
zFixOperator._check_methodN)�__name__�
__module__� __qualname__Z
BM_compatible�orderr r �dictZPATTERNr r r r! r# r% r* r, r. r r) r r r r r
r s2
�
r ) Zcollections.abcr9 Zlib2to3r Zlib2to3.fixer_utilr r r r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_zip.cpython-38.opt-1.pyc 0000644 00000003052 15053244165 0015136 0 ustar 00 U
e5d � @ sR d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z G dd� dej �Z
dS ) a7
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�in_special_contextc @ s e Zd ZdZdZdZdd� ZdS )�FixZipTzN
power< 'zip' args=trailer< '(' [any] ')' > [trailers=trailer*]
>
zfuture_builtins.zipc C s� | � |�rd S t|�rd S |d �� }d|_g }d|krZdd� |d D �}|D ]
}d|_qNttjtd�|gdd�}ttjtd�t|g�g| �}|j|_|S ) N�args� �trailersc S s g | ] }|� � �qS � )�clone)�.0�nr r �-/usr/lib64/python3.8/lib2to3/fixes/fix_zip.py�
<listcomp>' s z$FixZip.transform.<locals>.<listcomp>�zip)�prefix�list) Z should_skipr r
r r �symsZpowerr r )�selfZnodeZresultsr r r �newr r r � transform s
zFixZip.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r s r N)�__doc__r
r Zpytreer Zpygramr r Z
fixer_utilr r r ZConditionalFixr r r r r �<module> s
fixes/__pycache__/fix_ne.cpython-38.opt-1.pyc 0000644 00000001446 15053244165 0014743 0 ustar 00 U
e5d; � @ s> d Z ddlmZ ddlmZ ddlmZ G dd� dej�ZdS )z Fixer that turns <> into !=.� )�pytree)�token)�
fixer_basec @ s" e Zd ZejZdd� Zdd� ZdS )�FixNec C s
|j dkS )Nz<>)�value)�self�node� r �,/usr/lib64/python3.8/lib2to3/fixes/fix_ne.py�match s z FixNe.matchc C s t jtjd|jd�}|S )Nz!=)�prefix)r ZLeafr �NOTEQUALr )r r Zresults�newr r r
� transform s zFixNe.transformN)�__name__�
__module__� __qualname__r r
Z _accept_typer r r r r r
r s r N)�__doc__� r Zpgen2r r ZBaseFixr r r r r
�<module> s fixes/__pycache__/fix_long.cpython-38.opt-2.pyc 0000644 00000001174 15053244165 0015277 0 ustar 00 U
e5d� � @ s. d dl mZ d dlmZ G dd� dej�ZdS )� )�
fixer_base)�is_probably_builtinc @ s e Zd ZdZdZdd� ZdS )�FixLongTz'long'c C s t |�rd|_|�� d S )N�int)r �valueZchanged)�selfZnodeZresults� r �./usr/lib64/python3.8/lib2to3/fixes/fix_long.py� transform s zFixLong.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r r s r N)Zlib2to3r Zlib2to3.fixer_utilr ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_xrange.cpython-38.opt-2.pyc 0000644 00000004634 15053244165 0015630 0 ustar 00 U
e5d�
� @ sB d dl mZ d dlmZmZmZ d dl mZ G dd� dej�ZdS )� )�
fixer_base)�Name�Call�consuming_calls)�patcompc sh e Zd ZdZdZ� fdd�Zdd� Zdd� Zd d
� Zd d � Z d
Z
e � e
�Z
dZe � e�Zdd� Z� ZS )� FixXrangeTz�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c s t t| ��||� t� | _d S �N)�superr �
start_tree�set�transformed_xranges��selfZtree�filename�� __class__� �0/usr/lib64/python3.8/lib2to3/fixes/fix_xrange.pyr
s zFixXrange.start_treec C s
d | _ d S r )r r
r r r � finish_tree s zFixXrange.finish_treec C sD |d }|j dkr | �||�S |j dkr4| �||�S tt|���d S )N�nameZxrange�range)�value�transform_xrange�transform_range�
ValueError�repr�r �node�resultsr r r r � transform s
zFixXrange.transformc C s0 |d }|� td|jd�� | j�t|�� d S )Nr r ��prefix)�replacer r! r �add�idr r r r r $ s zFixXrange.transform_xrangec C sf t |�| jkrb| �|�sbttd�|d �� g�}ttd�|g|jd�}|d D ]}|�|� qN|S d S )Nr �args�listr �rest)r$ r �in_special_contextr r Zcloner! Z append_child)r r r Z
range_callZ list_call�nr r r r * s � � zFixXrange.transform_rangez3power< func=NAME trailer< '(' node=any ')' > any* >z�for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C sf |j d krdS i }|j j d k rJ| j�|j j |�rJ|d |krJ|d jtkS | j�|j |�od|d |kS )NFr �func)�parent�p1�matchr r �p2)r r r r r r r( ? s
�
�z FixXrange.in_special_context)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr
r r r r ZP1r Zcompile_patternr, ZP2r. r( �
__classcell__r r r r r s
r N) � r Z
fixer_utilr r r r ZBaseFixr r r r r �<module> s fixes/__pycache__/fix_print.cpython-38.pyc 0000644 00000004442 15053244165 0014535 0 ustar 00 U
e5d � @ sl d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZm Z m
Z
m Z e� d�Z
G dd � d ej�Zd
S ) a Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
� )�patcomp)�pytree)�token)�
fixer_base)�Name�Call�Comma�Stringz"atom< '(' [atom|STRING|NAME] ')' >c @ s$ e Zd ZdZdZdd� Zdd� ZdS )�FixPrintTzP
simple_stmt< any* bare='print' any* > | print_stmt
c
C s� |st �|�d�}|r4|�ttd�g |jd�� d S |jd td�ksJt �|jdd � }t|�dkrvt� |d �rvd S d } }}|r�|d t
� kr�|d d� }d}|r�|d t � t
jd�kr�t|�d ks�t �|d �� }|d
d � }d d � |D �}|�rd
|d _|d k �s"|d k �s"|d k �rz|d k �rB| �|dtt|��� |d k �rb| �|dtt|��� |d k �rz| �|d|� ttd�|�} |j| _| S )NZbare�print)�prefix� � ���� z>>r � c S s g | ] }|� � �qS � )�clone)�.0�argr r �//usr/lib64/python3.8/lib2to3/fixes/fix_print.py�
<listcomp>? s z&FixPrint.transform.<locals>.<listcomp>� �sep�end�file)�AssertionError�get�replacer r r Zchildren�len� parend_expr�matchr r �Leafr �
RIGHTSHIFTr � add_kwargr �repr)
�selfZnodeZresultsZ
bare_print�argsr r r Zl_argsZn_stmtr r r � transform% s@
�
zFixPrint.transformc C sN d|_ t�| jjt|�t�tjd�|f�}|r@|� t
� � d|_ |� |� d S )Nr �=r ) r r ZNodeZsymsZargumentr r" r �EQUAL�appendr )r& Zl_nodesZs_kwdZn_exprZ
n_argumentr r r r$ M s
�� zFixPrint.add_kwargN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr( r$ r r r r r
s (r
N)�__doc__r r r Zpgen2r r Z
fixer_utilr r r r Zcompile_patternr ZBaseFixr
r r r r �<module> s
� fixes/__pycache__/fix_next.cpython-38.opt-1.pyc 0000644 00000005752 15053244165 0015323 0 ustar 00 U
e5df � @ sn d Z ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z dZ G dd� dej
�Zd d
� Zd d � Zd
d� ZdS )z.Fixer for it.next() -> next(it), per PEP 3114.� )�token)�python_symbols)�
fixer_base)�Name�Call� find_bindingz;Calls to builtin next() possibly shadowed by global bindingc s0 e Zd ZdZdZdZ� fdd�Zdd� Z� ZS )�FixNextTa�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
Zprec s> t t| ��||� td|�}|r4| �|t� d| _nd| _d S )N�nextTF)�superr �
start_treer �warning� bind_warning�
shadowed_next)�selfZtree�filename�n�� __class__� �./usr/lib64/python3.8/lib2to3/fixes/fix_next.pyr $ s
zFixNext.start_treec C s� |� d�}|� d�}|� d�}|rr| jr>|�td|jd�� q�dd� |D �}d|d _|�ttd
|jd�|�� n�|r�td|jd�}|�|� nj|r�t|�r�|d }d�d d� |D ���� d
kr�| � |t
� d S |�td�� nd|kr�| � |t
� d| _d S )N�base�attr�name�__next__)�prefixc S s g | ] }|� � �qS r )Zclone��.0r r r r �
<listcomp>9 s z%FixNext.transform.<locals>.<listcomp>� � r �headc S s g | ] }t |��qS r )�strr r r r r E s Z __builtin__�globalT) �getr �replacer r r �is_assign_target�join�stripr r
)r �nodeZresultsr r r r r r r r � transform. s,
zFixNext.transform) �__name__�
__module__� __qualname__Z
BM_compatibleZPATTERN�orderr r) �
__classcell__r r r r r s
r c C sF t | �}|d krdS |jD ]&}|jtjkr0 dS t|| �r dS qdS )NFT)� find_assign�children�typer �EQUAL�
is_subtree)r( ZassignZchildr r r r% Q s
r% c C s4 | j tjkr| S | j tjks&| jd kr*d S t| j�S �N)r1 �symsZ expr_stmtZ simple_stmt�parentr/ �r( r r r r/ ] s
r/ c s$ | � kr dS t � fdd�| jD ��S )NTc 3 s | ]}t |� �V qd S r4 )r3 )r �cr7 r r � <genexpr>g s z is_subtree.<locals>.<genexpr>)�anyr0 )�rootr( r r7 r r3 d s r3 N)�__doc__Zpgen2r Zpygramr r5 r r Z
fixer_utilr r r r
ZBaseFixr r% r/ r3 r r r r �<module> s @ fixes/__pycache__/fix_filter.cpython-38.opt-2.pyc 0000644 00000003673 15053244165 0015633 0 ustar 00 U
e5d�
� @ sV d dl mZ d dlmZ d dlmZ d dlmZm Z m
Z
m Z m Z G dd� dej
�ZdS )� )�
fixer_base)�Node)�python_symbols)�Name�ArgList�ListComp�in_special_context� parenthesizec @ s e Zd ZdZdZdZdd� ZdS )� FixFilterTaV
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
[extra_trailers=trailer*]
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
[extra_trailers=trailer*]
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
[extra_trailers=trailer*]
>
zfuture_builtins.filterc C sL | � |�rd S g }d|kr6|d D ]}|�|�� � q"d|kr�|�d��� }|jtjkrfd|_t|�}t |�d��� |�d��� |�d��� |�}t
tj |g| dd�}n�d|kr�t t d �t d �|d
�� t d ��}t
tj |g| dd�}nTt
|�r�d S |d �� }t
tj t d �|gdd�}t
tj t d
�t|g�g| �}d|_|j|_|S )NZextra_trailersZ
filter_lambda�xp� �fp�it)�prefixZnoneZ_f�seq�args�filter�list)Z should_skip�appendZclone�get�type�symsZtestr r r r Zpowerr r r )�selfZnodeZresultsZtrailers�tr �newr � r �0/usr/lib64/python3.8/lib2to3/fixes/fix_filter.py� transform: s@
�
� zFixFilter.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNZskip_onr r r r r r
s r
N)r r Zpytreer Zpygramr r Z
fixer_utilr r r r r ZConditionalFixr
r r r r �<module> s fixes/__pycache__/fix_print.cpython-38.opt-1.pyc 0000644 00000004323 15053244165 0015472 0 ustar 00 U
e5d � @ sl d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZm Z m
Z
m Z e� d�Z
G dd � d ej�Zd
S ) a Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
� )�patcomp)�pytree)�token)�
fixer_base)�Name�Call�Comma�Stringz"atom< '(' [atom|STRING|NAME] ')' >c @ s$ e Zd ZdZdZdd� Zdd� ZdS )�FixPrintTzP
simple_stmt< any* bare='print' any* > | print_stmt
c
C s` |� d�}|r,|�ttd�g |jd�� d S |jdd � }t|�dkrXt�|d �rXd S d } }}|r�|d t � kr�|d d� }d}|r�|d t
� t j
d�kr�|d �� }|d d � }d
d � |D �}|r�d |d _|d k s�|d k s�|d k �rF|d k �r| �|d
tt|��� |d k �r.| �|dtt|��� |d k �rF| �|d|� ttd�|�} |j| _| S )NZbare�print)�prefix� � ���� z>>� c S s g | ] }|� � �qS � )�clone)�.0�argr r �//usr/lib64/python3.8/lib2to3/fixes/fix_print.py�
<listcomp>? s z&FixPrint.transform.<locals>.<listcomp>� �sep�end�file)�get�replacer r r Zchildren�len� parend_expr�matchr r �Leafr �
RIGHTSHIFTr � add_kwargr �repr)
�selfZnodeZresultsZ
bare_print�argsr r r Zl_argsZn_stmtr r r � transform% s:
�
zFixPrint.transformc C sN d|_ t�| jjt|�t�tjd�|f�}|r@|� t
� � d|_ |� |� d S )Nr �=r ) r r ZNodeZsymsZargumentr r! r �EQUAL�appendr )r% Zl_nodesZs_kwdZn_exprZ
n_argumentr r r r# M s
�� zFixPrint.add_kwargN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r# r r r r r
s (r
N)�__doc__r r r Zpgen2r r Z
fixer_utilr r r r Zcompile_patternr ZBaseFixr
r r r r �<module> s
� fixes/__pycache__/fix_raise.cpython-38.pyc 0000644 00000004310 15053244165 0014476 0 ustar 00 U
e5dn � @ sZ d Z ddlmZ ddlmZ ddlmZ ddlmZmZm Z m
Z
m Z G dd� dej �Z
dS ) a[ Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
� )�pytree)�token)�
fixer_base)�Name�Call�Attr�ArgList�is_tuplec @ s e Zd ZdZdZdd� ZdS )�FixRaiseTzB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c C sh | j }|d �� }|jtjkr2d}| �||� d S t|�r^t|�rX|jd jd �� }q:d|_d|kr�t �
|j t d�|g�}|j|_|S |d �� }t|�r�dd � |jdd
� D �}n d |_|g}d |k�rB|d �� } d | _|}
|jtj
ks�|jd
k�rt||�}
t|
t d��t| g�g } t �
|jt d�g| �}|j|_|S t j
|j t d�t||�g|jd�S d S )N�excz+Python 3 does not support string exceptions� � � �val�raisec S s g | ] }|� � �qS � )�clone)�.0�cr r �//usr/lib64/python3.8/lib2to3/fixes/fix_raise.py�
<listcomp>D s z&FixRaise.transform.<locals>.<listcomp>���� �tb�None�with_traceback)�prefix)�symsr �typer �STRINGZcannot_convertr Zchildrenr r ZNodeZ
raise_stmtr �NAME�valuer r r Z simple_stmt) �selfZnodeZresultsr r �msg�newr �argsr �eZwith_tbr r r � transform& sB
�zFixRaise.transformN)�__name__�
__module__� __qualname__Z
BM_compatibleZPATTERNr' r r r r r
s r
N)�__doc__r r Zpgen2r r Z
fixer_utilr r r r r ZBaseFixr
r r r r �<module> s
PatternGrammar3.8.17.final.0.pickle 0000644 00000002311 15053244165 0012570 0 ustar 00 ��� }�(�
symbol2number�}�(�Matcher�M � Alternative�M� Alternatives�M�Details�M� NegatedUnit�M�Repeater�M�Unit�Mu�
number2symbol�}�(M hMhMhMhMhMhMh u�states�]�(]�(]�KK��a]�KK��a]�K K��ae]�(]�(KK��K K��e]�(KK��K K��K K��ee]�(]�K
K��a]�(K K ��K K��ee]�(]�K K��a]�KK��a]�K
K��a]�K K��ae]�(]�KK��a]�(KK��KK��KK��e]�KK��a]�(KK��K K��e]�K K��a]�KK��ae]�(]�(KK��KK��KK��e]�K K��a]�KK��a]�(KK��KK��e]�KK��a]�KK��ae]�(]�(KK��KK��KK��KK��e]�KK��a]�KK��a]�(KK��KK��KK��K K��e]�(KK��K K��e]�KK��a]�KK��a]�(KK��KK��KK ��KK��e]�K K��a]�(KK��KK��K K ��eee�dfas�}�(M h}�(KKKKKKKKKKu��Mh}�(KKKKKKKKKKu��Mh }�(KKKKKKKKKKu��Mh#}�K Ks��Mh,}�KKs��Mh<}�(KKKKKKu��MhL}�(KKKKKKKKu��u�labels�]�(K �EMPTY���MN��K N��KN��K N��K�not���KN��KN��MN��MN��MN��KN��KN��KN��MN��KN��KN��KN��KN��KN��K N��KN��KN��MN��K
N��e�keywords�}�h�Ks�tokens�}�(K KKKK KKKKKKK KK KK
KKKKKKKKKKK KKKKKK
Ku� symbol2label�}�(� Alternatives�K� NegatedUnit�K�Unit�K � Alternative�K
�Details�K�Repeater�Ku�start�M u. __pycache__/refactor.cpython-38.opt-1.pyc 0000644 00000047671 15053244165 0014174 0 ustar 00 U
e5dk � @ s d Z dZddlZddlZddlZddlZddlZddlZddlZddl m
Z
ddl m Z m
Z
mZ ddlmZ ddlmZmZ dd lmZ d!d d �ZG d
d� de�Zdd� Zdd� Zdd� Zdd� Z dd� Z G dd� de�Z G dd � d e �Z G d d � d e�Z!G d d � d e �Z"dS )"z�Refactoring framework.
Used as a main program, this can refactor any number of files and/or
recursively descend down directories. Imported as a module, this
provides infrastructure to write your own refactoring tool.
z#Guido van Rossum <guido@python.org>� N)�chain� )�driver�tokenize�token)� find_root)�pytree�pygram)� btm_matcherTc C sT t | g g dg�}g }t�|j�D ].\}}}|�d�r |rD|dd� }|�|� q |S )zEReturn a sorted list of all available fix names in the given package.�*�fix_� N)�
__import__�pkgutilZ iter_modules�__path__�
startswith�append)Z fixer_pkgZ
remove_prefixZpkgZ fix_names�finder�nameZispkg� r �(/usr/lib64/python3.8/lib2to3/refactor.py�get_all_fix_names s
r c @ s e Zd ZdS )�
_EveryNodeN��__name__�
__module__� __qualname__r r r r r + s r c C s� t | tjtjf�r(| jdkr t�| jhS t | tj�rH| jrDt| j�S t�t | tj �r�t
� }| jD ] }|D ]}|� t|�� qhq`|S t d| ��dS )zf Accepts a pytree Pattern Node and returns a set
of the pattern types which will match first. Nz$Oh no! I don't understand pattern %s)
�
isinstancer Z NodePatternZ LeafPattern�typer ZNegatedPatternZcontent�_get_head_typesZWildcardPattern�set�update� Exception)Zpat�r�p�xr r r r / s
r c C s� t �t�}g }| D ]x}|jrdzt|j�}W n tk
rH |�|� Y q�X |D ]}|| �|� qNq|jdk r�||j �|� q|�|� qtt j
j � � t j
j
�D ]}|| �|� q�t|�S )z^ Accepts a list of fixers and returns a dictionary
of head node type --> fixer list. N)� collections� defaultdict�list�patternr r r Z _accept_typer r �python_grammarZ
symbol2number�values�tokens�extend�dict)Z
fixer_listZ
head_nodesZevery�fixerZheadsZ node_typer r r �_get_headnode_dictK s$
�r0 c s � fdd�t � d�D �S )zN
Return the fully qualified names for fixers in the package pkg_name.
c s g | ]}� d | �qS ��.r )�.0�fix_name�Zpkg_namer r �
<listcomp>h s �z+get_fixers_from_package.<locals>.<listcomp>F)r r5 r r5 r �get_fixers_from_packaged s
�r7 c C s | S �Nr )�objr r r � _identityk s r: c sX d}t �t�| �j�� � fdd�}ttjt jtj h�}t
� }z�|� \}}||krTq>q>|tj krl|rf�q6d}q>|tj k�r6|dk�r6|� \}}|tj ks�|dkr��q6|� \}}|tj ks�|dkrq6|� \}}|tj
kr�|dkr�|� \}}|tj k�r4|�|� |� \}}|tj
k�s.|d k�r"�q4|� \}}q�q>�q6q>W n tk
�rN Y nX t|�S )
NFc s t � �} | d | d fS )Nr r )�next)�tok��genr r �advancer s z(_detect_future_features.<locals>.advanceT�fromZ
__future__�import�(�,)r �generate_tokens�io�StringIO�readline� frozensetr �NEWLINE�NL�COMMENTr �STRING�NAME�OP�add�
StopIteration)�sourceZhave_docstringr? �ignore�features�tp�valuer r= r �_detect_future_featureso sB
rV c @ s e Zd ZdZdS )�
FixerErrorz A fixer could not be loaded.N)r r r �__doc__r r r r rW � s rW c @ s� e Zd Zddd�ZdZdZd4dd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d5dd�Z d6dd�Z
dd� Zd7dd�Zdd� Zd8d d �Zd d � Zd d!� Zd9d"d#�Zd:d$d%�Zd&Zd'Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Z d2d3� Z dS );�RefactoringToolF)�print_function�write_unchanged_filesZFixr Nc C s. || _ |p g | _| j�� | _|dk r0| j�|� | jd rDtj| _ntj | _| j�
d�| _ g | _ t
�d�| _g | _d| _tj| jtj| jd�| _| �� \| _| _g | _t�� | _ g | _ g | _ t | j| j�D ]F}|j r�| j �!|� q�|| jkr�| j �"|� q�|| jkr�| j �"|� q�t#| j �| _$t#| j �| _%dS )z�Initializer.
Args:
fixer_names: a list of fixers to import
options: a dict with configuration.
explicit: a list of fixers to run even if they are explicit.
NrZ r[ rY F)�convert�logger)&�fixers�explicit�_default_options�copy�optionsr! r �!python_grammar_no_print_statement�grammarr* �getr[ �errors�loggingZ getLoggerr] � fixer_log�wroter ZDriverr r\ �
get_fixers� pre_order�
post_order�files�bmZ
BottomMatcher�BMZ
bmi_pre_orderZbmi_post_orderr Z
BM_compatibleZ add_fixerr r0 �bmi_pre_order_heads�bmi_post_order_heads)�selfZ fixer_namesrb r_ r/ r r r �__init__� s>
�
zRefactoringTool.__init__c C sX g }g }| j D �] }t|i i dg�}|�dd�d }|�| j�rR|t| j�d� }|�d�}| jd�dd � |D �� }zt ||�}W n& t
k
r� t d
||f �d�Y nX || j | j
�} | jr�| jd k r�|| jkr�| �d |� q| �d
|� | jdk�r|�| � q| jdk�r |�| � qt d| j ��qt�d�}
|j|
d� |j|
d� ||fS )a Inspects the options to load the requested patterns and handlers.
Returns:
(pre_order, post_order), where pre_order is the list of fixers that
want a pre-order AST traversal, and post_order is the list that want
post-order traversal.
r r2 r ���N�_� c S s g | ] }|� � �qS r )�title)r3 r$ r r r r6 � s z.RefactoringTool.get_fixers.<locals>.<listcomp>zCan't find %s.%sTzSkipping optional fixer: %szAdding transformation: %sZpreZpostzIllegal fixer order: %rZ run_order��key)r^ r �rsplitr � FILE_PREFIX�len�split� CLASS_PREFIX�join�getattr�AttributeErrorrW rb rh r_ � log_message� log_debug�orderr �operator�
attrgetter�sort) rr Zpre_order_fixersZpost_order_fixersZ fix_mod_path�modr4 �parts�
class_nameZ fix_classr/ Zkey_funcr r r rj � s:
�
zRefactoringTool.get_fixersc O s � dS )z Called when an error occurs.Nr )rr �msg�args�kwdsr r r � log_error� s zRefactoringTool.log_errorc G s |r || }| j �|� dS )zHook to log a message.N)r] �info�rr r� r� r r r r� s zRefactoringTool.log_messagec G s |r || }| j �|� d S r8 )r] �debugr� r r r r� s zRefactoringTool.log_debugc C s dS )zTCalled with the old version, new version, and filename of a
refactored file.Nr )rr �old_text�new_text�filename�equalr r r � print_output s z RefactoringTool.print_outputc C s8 |D ].}t j�|�r$| �|||� q| �|||� qdS )z)Refactor a list of files and directories.N)�os�path�isdir� refactor_dir�
refactor_file)rr �items�write�
doctests_onlyZ dir_or_filer r r �refactor s zRefactoringTool.refactorc
C s� t jd }t �|�D ]�\}}}| �d|� |�� |�� |D ]>}|�d�s>t j�|�d |kr>t j�||�} | � | ||� q>dd� |D �|dd�< qdS )z�Descends down a directory and refactor every Python file found.
Python files are assumed to have a .py extension.
Files and subdirectories starting with '.' are skipped.
�pyzDescending into %sr2 r c S s g | ]}|� d �s|�qS r1 )r )r3 Zdnr r r r6 . s
z0RefactoringTool.refactor_dir.<locals>.<listcomp>N)
r� �extsep�walkr� r� r r� �splitextr r� )
rr Zdir_namer� r� Zpy_ext�dirpathZdirnames� filenamesr �fullnamer r r r� s
�z RefactoringTool.refactor_dirc
C s� zt |d�}W n6 tk
rD } z| �d||� W Y �dS d}~X Y nX zt�|j�d }W 5 |�� X tj |d|dd��}|�� |fW 5 Q R � S Q R X dS ) zG
Do our best to decode a Python source file correctly.
�rbzCan't open %s: %s)NNNr r# rv ��encoding�newline) �open�OSErrorr� �closer �detect_encodingrG rE �read)rr r� �f�errr� r r r �_read_python_source0 s
z#RefactoringTool._read_python_sourcec C s� | � |�\}}|dkrdS |d7 }|rn| �d|� | �||�}| jsL||kr`| �|||||� q�| �d|� nH| �||�}| js�|r�|jr�| jt|�dd� |||d� n | �d|� dS )zRefactors a file.N�
zRefactoring doctests in %szNo doctest changes in %srt )r� r� zNo changes in %s)r� r� �refactor_docstringr[ �processed_file�refactor_string� was_changed�str)rr r� r� r� �inputr� �output�treer r r r� @ s" �z RefactoringTool.refactor_filec
C s� t |�}d|krtj| j_zVz| j�|�}W n@ tk
rl } z"| �d||jj |� W Y �W �dS d}~X Y nX W 5 | j| j_X ||_
| � d|� | � ||� |S )aF Refactor a given input string.
Args:
data: a string holding the code to be refactored.
name: a human-readable name for use in error/log messages.
Returns:
An AST corresponding to the refactored input stream; None if
there were errors during the parse.
rZ zCan't parse %s: %s: %sNzRefactoring %s)
rV r rc r rd Z parse_stringr" r� � __class__r �future_featuresr� �
refactor_tree)rr �datar rS r� r� r r r r� W s"
� z RefactoringTool.refactor_stringc C s� t j�� }|rN| �d� | �|d�}| js2||krB| �|d|� q�| �d� n:| �|d�}| jsj|r~|jr~| �t |�d|� n
| �d� d S )Nz Refactoring doctests in stdinz<stdin>zNo doctest changes in stdinzNo changes in stdin)
�sys�stdinr� r� r� r[ r� r� r� r� )rr r� r� r� r� r r r �refactor_stdinr s
z RefactoringTool.refactor_stdinc
C s� t | j| j�D ]}|�||� q| �| j|�� � | �| j|�� � | j�|� � �}t
|� � ��r�| jj D �]D}||krj|| rj|| j
tjjdd� |jr�|| j
tjjd� t|| �D ]�}||| kr�|| �|� z t|� W n tk
�r Y q�Y nX |j�r||jk�rq�|�|�}|r�|�||�}|dk r�|�|� |�� D ] }|j�s^g |_|j�|� �qL| j�|� � �}|D ]*} | |k�r�g || < || � || � �q�q�qjqTt | j| j�D ]}|� ||� �q�|j S )a� Refactors a parse tree (modifying the tree in place).
For compatible patterns the bottom matcher module is
used. Otherwise the tree is traversed node-to-node for
matches.
Args:
tree: a pytree.Node instance representing the root of the tree
to be refactored.
name: a human-readable name for this tree.
Returns:
True if the tree was modified, False otherwise.
T)ry �reverserx N) r rk rl Z
start_tree� traverse_byrp rq ro �runZleaves�anyr+ r^ r� r ZBaseZdepthZkeep_line_orderZ
get_linenor( �remover �
ValueErrorZfixers_applied�match� transform�replacer r- Z finish_treer� )
rr r� r r/ Z match_set�node�results�newZ new_matchesZfxrr r r r� � sJ
z RefactoringTool.refactor_treec C sV |sdS |D ]D}||j D ]4}|�|�}|r|�||�}|dk r|�|� |}qq dS )a Traverse an AST, applying a set of fixers to each node.
This is a helper method for refactor_tree().
Args:
fixers: a list of fixer instances.
traversal: a generator that yields AST nodes.
Returns:
None
N)r r� r� r� )rr r^ Z traversalr� r/ r� r� r r r r� � s
zRefactoringTool.traverse_byc C s� | j �|� |dkr.| �|�d }|dkr.dS ||k}| �||||� |r`| �d|� | js`dS |rv| �||||� n | �d|� dS )zR
Called when a file has been refactored and there may be changes.
Nr zNo changes to %szNot writing changes to %s)rm r r� r� r� r[ �
write_file)rr r� r� r� r� r� r� r r r r� � s z RefactoringTool.processed_filec C s� zt j|d|dd�}W n6 tk
rL } z| �d||� W Y �dS d}~X Y nX |�F z|�|� W n0 tk
r� } z| �d||� W 5 d}~X Y nX W 5 Q R X | �d|� d| _dS ) z�Writes a string to a file.
It first shows a unified diff between the old text and the new text, and
then rewrites the file; the latter is only done if the write option is
set.
�wrv r� zCan't create %s: %sNzCan't write %s: %szWrote changes to %sT)rE r� r� r� r� r� ri )rr r� r� r� r� �fpr� r r r r� � s * zRefactoringTool.write_filez>>> z... c
C s g }d}d}d}d}|j dd�D ]�}|d7 }|�� �| j�r~|dk rZ|�| �||||�� |}|g}|�| j�} |d| � }q |dk r�|�|| j �s�||| j�� d kr�|� |� q |dk r�|�| �||||�� d}d}|� |� q |dk �r
|�| �||||�� d�
|�S )a� Refactors a docstring, looking for doctests.
This returns a modified version of the input string. It looks
for doctests, which start with a ">>>" prompt, and may be
continued with "..." prompts, as long as the "..." is indented
the same as the ">>>".
(Unfortunately we can't use the doctest module's parser,
since, like most parsers, it is not geared towards preserving
the original source.)
Nr T��keependsr r� rv ) �
splitlines�lstripr �PS1r- �refactor_doctest�find�PS2�rstripr r )
rr r� r� �result�blockZ block_lineno�indent�lineno�line�ir r r r� sJ � �� �
�z"RefactoringTool.refactor_docstringc
s z�� ||� �}W nj tk
r| } zL�j�tj�rN|D ]}��d|�d�� q6��d|||j j
|� | W Y �S d}~X Y nX �� ||��rt |�j
dd�}|d|d � ||d d� } }|d �d�s�|d d7 < � �j |�d � g}|�r|� �fd
d �|D �7 }|S ) z�Refactors one doctest.
A doctest is given as a block of lines, the first of which starts
with ">>>" (possibly indented), while the remaining lines start
with "..." (identically indented).
z
Source: %sr� z+Can't parse docstring in %s line %s: %s: %sNTr� r rt r c s g | ]}� �j | �qS r )r� )r3 r� �r� rr r r r6 Z s z4RefactoringTool.refactor_doctest.<locals>.<listcomp>)� parse_blockr" r] Z isEnabledForrg �DEBUGr� r� r� r� r r� r� r� �endswithr� �pop)
rr r� r� r� r� r� r� r� r� Zclippedr r� r r� @ s, �"z RefactoringTool.refactor_doctestc C s� | j r d}nd}| js$| �d|� n"| �d|� | jD ]}| �|� q6| jrl| �d� | jD ]}| �|� q\| jr�t| j�dkr�| �d� n| �dt| j�� | jD ] \}}}| j|f|�|� q�d S ) N�werez
need to bezNo files %s modified.zFiles that %s modified:z$Warnings/messages while refactoring:r zThere was 1 error:zThere were %d errors:)ri rm r� rh rf r| )rr r� �file�messager� r� r� r r r � summarize] s$
zRefactoringTool.summarizec C s" | j �| �|||��}t� |_|S )z�Parses a block into a tree.
This is necessary to get correct line number / offset information
in the parser diagnostics and embedded into the parse tree.
)r Z parse_tokens� wrap_toksrH r� )rr r� r� r� r� r r r r� t s zRefactoringTool.parse_blockc c sd t �| �||�j�}|D ]F\}}\}}\} }
} ||d 7 }| |d 7 } ||||f| |
f| fV qdS )z;Wraps a tokenize stream to systematically modify start/end.r N)r rD � gen_lines�__next__) rr r� r� r� r, r rU Zline0Zcol0Zline1Zcol1Z line_textr r r r� ~ s
zRefactoringTool.wrap_toksc c sx || j }|| j }|}|D ]N}|�|�r>|t|�d� V n(||�� d krVdV ntd||f ��|}q dV qldS )z�Generates lines as expected by tokenize from a list of lines.
This strips the first len(indent + self.PS1) characters off each line.
Nr� zline=%r, prefix=%rrv )r� r� r r| r� �AssertionError)rr r� r� �prefix1Zprefix2�prefixr� r r r r� � s
zRefactoringTool.gen_lines)NN)FF)FF)FF)F)NFN)N) r r r r` r~ r{ rs rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r rY � s> �
4(
O �
+
rY c @ s e Zd ZdS )�MultiprocessingUnsupportedNr r r r r r� � s r� c sB e Zd Z� fdd�Zd � fdd� Z� fdd�Z� fd d
�Z� ZS ) �MultiprocessRefactoringToolc s" t t| �j||� d | _d | _d S r8 )�superr� rs �queue� output_lock�rr r� �kwargs�r� r r rs � s z$MultiprocessRefactoringTool.__init__Fr c
s� |dkr t t���|||�S z dd l� W n tk
r@ t�Y nX �jd k rTtd��� �� �_� � � �_
� �fdd�t |�D �}z*|D ] }|�� q�t t���|||� W 5 �j� � t |�D ]}�j�
d � q�|D ]}|�� r�|� � q�d �_X d S )Nr r z already doing multiple processesc s g | ]}� j �jd ��qS ))�target)ZProcess�_child)r3 r� ��multiprocessingrr r r r6 � s �z8MultiprocessRefactoringTool.refactor.<locals>.<listcomp>)r� r� r� r� � ImportErrorr� r� � RuntimeErrorZ
JoinableQueueZLockr� �ranger �putZis_alive�start)rr r� r� r� Z
num_processesZ processesr� r$ r� r� r r� � s<
�
�
�
z$MultiprocessRefactoringTool.refactorc sN | j �� }|d k rJ|\}}ztt| �j||� W 5 | j �� X | j �� }q
d S r8 )r� re Z task_doner� r� r� )rr Ztaskr� r� r� r r r� � s
� z"MultiprocessRefactoringTool._childc s2 | j d k r | j �||f� ntt| �j||�S d S r8 )r� r� r� r� r� r� r� r r r� � s
�z)MultiprocessRefactoringTool.refactor_file)FFr )r r r rs r� r� r� �
__classcell__r r r� r r� � s � r� )T)#rX �
__author__rE r� r r� rg r� r& � itertoolsr Zpgen2r r r Z
fixer_utilr rv r r r
rn r r" r r r0 r7 r: rV rW �objectrY r� r� r r r r �<module> s8
( __pycache__/__init__.cpython-38.opt-2.pyc 0000644 00000000203 15053244165 0014103 0 ustar 00 U
e5d � @ s d S )N� r r r �(/usr/lib64/python3.8/lib2to3/__init__.py�<module> � __pycache__/patcomp.cpython-38.opt-1.pyc 0000644 00000012427 15053244165 0014021 0 ustar 00 U
e5d� � @ s� d Z dZddlZddlmZmZmZmZmZm Z ddl
m Z ddl
m Z G dd � d e
�Zd
d � ZG d d
� d
e�Zejejejdd�Zdd� Zdd� Zdd� ZdS )z�Pattern compiler.
The grammar is taken from PatternGrammar.txt.
The compiler compiles a pattern to a pytree.*Pattern instance.
z#Guido van Rossum <guido@python.org>� N� )�driver�literals�token�tokenize�parse�grammar)�pytree)�pygramc @ s e Zd ZdS )�PatternSyntaxErrorN)�__name__�
__module__� __qualname__� r r �'/usr/lib64/python3.8/lib2to3/patcomp.pyr s r c c sL t jt jt jh}t�t�| �j�}|D ] }|\}}}}}||kr&|V q&dS )z6Tokenizes a string suppressing significant whitespace.N) r �NEWLINE�INDENT�DEDENTr �generate_tokens�io�StringIO�readline) �input�skip�tokensZ quintuple�type�value�start�endZ line_textr r r �tokenize_wrapper s r c @ s: e Zd Zd
dd�Zddd�Zdd� Zdd d
�Zd d � ZdS )�PatternCompilerNc C sZ |dkrt j| _t j| _nt�|�| _t �| j�| _t j| _ t j
| _ tj | jt
d�| _dS )z^Initializer.
Takes an optional alternative filename for the pattern grammar.
N)Zconvert)r
Zpattern_grammarr Zpattern_symbols�symsr Z load_grammarZSymbolsZpython_grammarZ pygrammarZpython_symbols�pysymsZDriver�pattern_convert)�selfZ grammar_filer r r �__init__( s
zPatternCompiler.__init__Fc
C sp t |�}z| jj||d�}W n2 tjk
rN } ztt|��d�W 5 d}~X Y nX |rb| �|�|fS | �|�S dS )z=Compiles a pattern string to a nested pytree.*Pattern object.)�debugN)r r Z parse_tokensr Z
ParseErrorr �str� compile_node)r$ r r& Z with_treer �root�er r r �compile_pattern7 s z PatternCompiler.compile_patternc
sV |j � jjkr|jd }|j � jjkrz� fdd�|jddd� D �}t|�dkrX|d S tjdd� |D �ddd�}|�� S |j � jj krʇ fd d�|jD �}t|�dkr�|d S tj|gddd�}|�� S |j � jj
kr�� � |jdd� �}t� |�}|�� S d}|j}t|�d
k�r>|d j t
jk�r>|d j}|dd� }d}t|�dk�rx|d j � jjk�rx|d }|dd � }� � ||�}|dk �r>|j} | d }
|
j t
jk�r�d} tj} nX|
j t
jk�r�d} tj} n>|
j t
jk�r� �| d � } } t| �d k�r� �| d
�} n | dk�s"| dk�r>|�� }tj|gg| | d�}|dk �rN||_|�� S )
zXCompiles a node, recursively.
This is one big switch on the node type.
r c s g | ]}� � |��qS r �r( ��.0Zch�r$ r r �
<listcomp>O s z0PatternCompiler.compile_node.<locals>.<listcomp>N� r c S s g | ]
}|g�qS r r )r. �ar r r r0 R s ��min�maxc s g | ]}� � |��qS r r, r- r/ r r r0 V s � ���� )r r! ZMatcher�childrenZ Alternatives�lenr �WildcardPattern�optimizeZ AlternativeZ NegatedUnit�
compile_basicZNegatedPatternr �EQUALr ZRepeater�STARZHUGE�PLUS�LBRACE�get_int�name)
r$ �nodeZalts�pZunits�patternrC �nodes�repeatr9 Zchildr4 r5 r r/ r r( C s^
"
z PatternCompiler.compile_nodec C s@ |d }|j tjkr4tt�|j��}t�t |�|�S |j tj
kr�|j}|� � r�|t krbt
d| ��|dd � rvt
d��t�t | �S |dkr�d }n,|�d�s�t| j|d �}|d kr�t
d| ��|dd � r�| �|d jd �g}nd }t�||�S nH|jdk�r| �|d �S |jd k�r<| �|d �}tj|ggddd
�S d S ) Nr zInvalid token: %rr z Can't have details for token�any�_zInvalid symbol: %r�(�[r3 )r r �STRINGr' r Z
evalStringr r Z LeafPattern�_type_of_literal�NAME�isupper� TOKEN_MAPr �
startswith�getattrr" r( r9 Z NodePatternr; )r$ rG rH rD r r Zcontent�
subpatternr r r r= � s8
z PatternCompiler.compile_basicc C s
t |j�S �N)�intr )r$ rD r r r rB � s zPatternCompiler.get_int)N)FF)N)r r
r r% r+ r( r= rB r r r r r & s
G
#r )rO rM �NUMBERZTOKENc C s. | d � � rtjS | tjkr&tj| S d S d S )Nr )�isalphar rO r Zopmap)r r r r rN � s
rN c C s> |\}}}}|s|| j kr*tj|||d�S tj|||d�S dS )z9Converts raw node information to a Node or Leaf instance.)�contextN)Z
number2symbolr ZNodeZLeaf)r Z
raw_node_infor r rY r9 r r r r# � s r# c C s t � �| �S rU )r r+ )rF r r r r+ � s r+ )�__doc__�
__author__r Zpgen2r r r r r r � r r
� Exceptionr r �objectr rO rM rW rQ rN r# r+ r r r r �<module> s"
� __pycache__/pygram.cpython-38.opt-2.pyc 0000644 00000002041 15053244165 0013645 0 ustar 00 U
e5d � @ s� d dl Z ddlmZ ddlmZ ddlmZ e j�e j�e �d�Z
e j�e j�e �d�Z G dd � d e �Z
e�d
e
�Ze
e�Ze�� Zejd = e�� Zejd = e�d
e �Ze
e�ZdS )
� N� )�token)�driver)�pytreez Grammar.txtzPatternGrammar.txtc @ s e Zd Zdd� ZdS )�Symbolsc C s$ |j �� D ]\}}t| ||� q
d S )N)Z
symbol2number�items�setattr)�selfZgrammar�nameZsymbol� r �&/usr/lib64/python3.8/lib2to3/pygram.py�__init__ s zSymbols.__init__N)�__name__�
__module__� __qualname__r
r r r r r s r Zlib2to3�print�exec)�osZpgen2r r � r �path�join�dirname�__file__Z
_GRAMMAR_FILEZ_PATTERN_GRAMMAR_FILE�objectr Zload_packaged_grammarZpython_grammarZpython_symbols�copyZ!python_grammar_no_print_statement�keywordsZ*python_grammar_no_print_and_exec_statementZpattern_grammarZpattern_symbolsr r r r �<module> s � __pycache__/__main__.cpython-38.opt-2.pyc 0000644 00000000327 15053244165 0014073 0 ustar 00 U
e5dC � @ s& d dl Z ddlmZ e �ed�� dS )� N� )�mainz
lib2to3.fixes)�sysr �exit� r r �(/usr/lib64/python3.8/lib2to3/__main__.py�<module> s __pycache__/refactor.cpython-38.opt-2.pyc 0000644 00000037753 15053244165 0014175 0 ustar 00 U
e5dk � @ s
d Z ddlZddlZddlZddlZddlZddlZddlZddlm Z ddl
m Z m Z m
Z
ddlmZ ddlmZmZ ddlmZ d d
d �ZG d d
� d
e�Zdd� Zdd� Zdd� Zdd� Zdd� Z G dd� de�Z G dd� de �Z G d d � d e�Z G d d � d e �Z!dS )!z#Guido van Rossum <guido@python.org>� N)�chain� )�driver�tokenize�token)� find_root)�pytree�pygram)� btm_matcherTc C sT t | g g dg�}g }t�|j�D ].\}}}|�d�r |rD|dd � }|�|� q |S )N�*�fix_� )�
__import__�pkgutilZ iter_modules�__path__�
startswith�append)Z fixer_pkgZ
remove_prefixZpkgZ fix_names�finder�nameZispkg� r �(/usr/lib64/python3.8/lib2to3/refactor.py�get_all_fix_names s
r c @ s e Zd ZdS )�
_EveryNodeN��__name__�
__module__� __qualname__r r r r r + s r c C s� t | tjtjf�r(| jd kr t�| jhS t | tj�rH| jrDt| j�S t�t | tj �r�t
� }| jD ] }|D ]}|� t|�� qhq`|S t d| ��d S )Nz$Oh no! I don't understand pattern %s)
�
isinstancer Z NodePatternZ LeafPattern�typer ZNegatedPatternZcontent�_get_head_typesZWildcardPattern�set�update� Exception)Zpat�r�p�xr r r r / s
r c C s� t �t�}g }| D ]x}|jrdzt|j�}W n tk
rH |�|� Y q�X |D ]}|| �|� qNq|jd k r�||j �|� q|�|� qtt j
j � � t j
j
�D ]}|| �|� q�t|�S �N)� collections� defaultdict�list�patternr r r Z _accept_typer r �python_grammarZ
symbol2number�values�tokens�extend�dict)Z
fixer_listZ
head_nodesZevery�fixerZheadsZ node_typer r r �_get_headnode_dictK s$
�r1 c s � fdd�t � d�D �S )Nc s g | ]}� d | �qS ��.r )�.0�fix_name�Zpkg_namer r �
<listcomp>h s �z+get_fixers_from_package.<locals>.<listcomp>F)r r6 r r6 r �get_fixers_from_packaged s
�r8 c C s | S r& r )�objr r r � _identityk s r: c sX d}t �t�| �j�� � fdd�}ttjt jtj h�}t
� }z�|� \}}||krTq>q>|tj krl|rf�q6d}q>|tj k�r6|dk�r6|� \}}|tj ks�|dkr��q6|� \}}|tj ks�|dkrq6|� \}}|tj
kr�|dkr�|� \}}|tj k�r4|�|� |� \}}|tj
k�s.|d k�r"�q4|� \}}q�q>�q6q>W n tk
�rN Y nX t|�S )
NFc s t � �} | d | d fS )Nr r )�next)�tok��genr r �advancer s z(_detect_future_features.<locals>.advanceT�fromZ
__future__�import�(�,)r �generate_tokens�io�StringIO�readline� frozensetr �NEWLINE�NL�COMMENTr �STRING�NAME�OP�add�
StopIteration)�sourceZhave_docstringr? �ignore�features�tp�valuer r= r �_detect_future_featureso sB
rV c @ s e Zd ZdS )�
FixerErrorNr r r r r rW � s rW c @ s� e Zd Zddd�ZdZdZd4dd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d5dd�Z d6dd�Z
dd� Zd7dd�Zdd� Zd8d d �Zd d � Zd d!� Zd9d"d#�Zd:d$d%�Zd&Zd'Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Z d2d3� Z dS );�RefactoringToolF)�print_function�write_unchanged_filesZFixr Nc C s. || _ |p g | _| j�� | _|d k r0| j�|� | jd rDtj| _ntj | _| j�
d�| _ g | _ t
�d�| _g | _d| _tj| jtj| jd�| _| �� \| _| _g | _t�� | _ g | _ g | _ t | j| j�D ]F}|j r�| j �!|� q�|| jkr�| j �"|� q�|| jkr�| j �"|� q�t#| j �| _$t#| j �| _%d S )NrY rZ rX F)�convert�logger)&�fixers�explicit�_default_options�copy�optionsr! r �!python_grammar_no_print_statement�grammarr+ �getrZ �errors�loggingZ getLoggerr\ � fixer_log�wroter ZDriverr r[ �
get_fixers� pre_order�
post_order�files�bmZ
BottomMatcher�BMZ
bmi_pre_orderZbmi_post_orderr Z
BM_compatibleZ add_fixerr r1 �bmi_pre_order_heads�bmi_post_order_heads)�selfZ fixer_namesra r^ r0 r r r �__init__� s>
�
zRefactoringTool.__init__c C sX g }g }| j D �] }t|i i dg�}|�dd�d }|�| j�rR|t| j�d � }|�d�}| jd�dd� |D �� }zt ||�}W n& t
k
r� t d ||f �d �Y nX || j | j
�} | jr�| jd
k r�|| jkr�| �d |� q| �d |� | jd
k�r|�| � q| jdk�r |�| � qt d| j ��qt�d�}
|j|
d� |j|
d� ||fS )Nr r3 r ����_� c S s g | ] }|� � �qS r )�title)r4 r$ r r r r7 � s z.RefactoringTool.get_fixers.<locals>.<listcomp>zCan't find %s.%sTzSkipping optional fixer: %szAdding transformation: %sZpreZpostzIllegal fixer order: %rZ run_order��key)r] r �rsplitr � FILE_PREFIX�len�split� CLASS_PREFIX�join�getattr�AttributeErrorrW ra rg r^ � log_message� log_debug�orderr �operator�
attrgetter�sort) rq Zpre_order_fixersZpost_order_fixersZ fix_mod_path�modr5 �parts�
class_nameZ fix_classr0 Zkey_funcr r r ri � s:
�
zRefactoringTool.get_fixersc O s � d S r& r )rq �msg�args�kwdsr r r � log_error� s zRefactoringTool.log_errorc G s |r || }| j �|� d S r& )r\ �info�rq r� r� r r r r� s zRefactoringTool.log_messagec G s |r || }| j �|� d S r& )r\ �debugr� r r r r� s zRefactoringTool.log_debugc C s d S r& r )rq �old_text�new_text�filename�equalr r r � print_output s z RefactoringTool.print_outputc C s8 |D ].}t j�|�r$| �|||� q| �|||� qd S r& )�os�path�isdir� refactor_dir�
refactor_file)rq �items�write�
doctests_onlyZ dir_or_filer r r �refactor s zRefactoringTool.refactorc
C s� t jd }t �|�D ]�\}}}| �d|� |�� |�� |D ]>}|�d�s>t j�|�d |kr>t j�||�} | � | ||� q>dd� |D �|d d �< qd S )N�pyzDescending into %sr3 r c S s g | ]}|� d �s|�qS r2 )r )r4 Zdnr r r r7 . s
z0RefactoringTool.refactor_dir.<locals>.<listcomp>)
r� �extsep�walkr� r� r r� �splitextr~ r� )
rq Zdir_namer� r� Zpy_ext�dirpathZdirnames� filenamesr �fullnamer r r r� s
�z RefactoringTool.refactor_dirc
C s� zt |d�}W n6 tk
rD } z| �d||� W Y �dS d }~X Y nX zt�|j�d }W 5 |�� X tj |d|dd��}|�� |fW 5 Q R � S Q R X d S )N�rbzCan't open %s: %s)NNr r# ru ��encoding�newline) �open�OSErrorr� �closer �detect_encodingrG rE �read)rq r� �f�errr� r r r �_read_python_source0 s
z#RefactoringTool._read_python_sourcec C s� | � |�\}}|d krd S |d7 }|rn| �d|� | �||�}| jsL||kr`| �|||||� q�| �d|� nH| �||�}| js�|r�|jr�| jt|�d d� |||d� n | �d|� d S )N�
zRefactoring doctests in %szNo doctest changes in %srs )r� r� zNo changes in %s)r� r� �refactor_docstringrZ �processed_file�refactor_string� was_changed�str)rq r� r� r� �inputr� �output�treer r r r� @ s" �z RefactoringTool.refactor_filec
C s� t |�}d|krtj| j_zVz| j�|�}W n@ tk
rl } z"| �d||jj |� W Y �W �d S d }~X Y nX W 5 | j| j_X ||_
| � d|� | � ||� |S )NrY zCan't parse %s: %s: %szRefactoring %s)
rV r rb r rc Z parse_stringr" r� � __class__r �future_featuresr� �
refactor_tree)rq �datar rS r� r� r r r r� W s"
� z RefactoringTool.refactor_stringc C s� t j�� }|rN| �d� | �|d�}| js2||krB| �|d|� q�| �d� n:| �|d�}| jsj|r~|jr~| �t |�d|� n
| �d� d S )Nz Refactoring doctests in stdinz<stdin>zNo doctest changes in stdinzNo changes in stdin)
�sys�stdinr� r� r� rZ r� r� r� r� )rq r� r� r� r� r r r �refactor_stdinr s
z RefactoringTool.refactor_stdinc
C s� t | j| j�D ]}|�||� q| �| j|�� � | �| j|�� � | j�|� � �}t
|� � ��r�| jj D �]D}||krj|| rj|| j
tjjdd� |jr�|| j
tjjd� t|| �D ]�}||| kr�|| �|� z t|� W n tk
�r Y q�Y nX |j�r||jk�rq�|�|�}|r�|�||�}|d k r�|�|� |�� D ] }|j�s^g |_|j�|� �qL| j�|� � �}|D ]*} | |k�r�g || < || � || � �q�q�qjqTt | j| j�D ]}|� ||� �q�|j S )NT)rx �reverserw ) r rj rk Z
start_tree� traverse_byro rp rn �runZleaves�anyr, r] r� r ZBaseZdepthZkeep_line_orderZ
get_linenor) �remover �
ValueErrorZfixers_applied�match� transform�replacer r. Z finish_treer� )
rq r� r r0 Z match_set�node�results�newZ new_matchesZfxrr r r r� � sJ
z RefactoringTool.refactor_treec C sV |sd S |D ]D}||j D ]4}|�|�}|r|�||�}|d k r|�|� |}qq d S r& )r r� r� r� )rq r] Z traversalr� r0 r� r� r r r r� � s
zRefactoringTool.traverse_byc C s� | j �|� |d kr.| �|�d }|d kr.d S ||k}| �||||� |r`| �d|� | js`d S |rv| �||||� n | �d|� d S )Nr zNo changes to %szNot writing changes to %s)rl r r� r� r� rZ �
write_file)rq r� r� r� r� r� r� r r r r� � s z RefactoringTool.processed_filec C s� zt j|d|dd�}W n6 tk
rL } z| �d||� W Y �d S d }~X Y nX |�F z|�|� W n0 tk
r� } z| �d||� W 5 d }~X Y nX W 5 Q R X | �d|� d| _d S )N�wru r� zCan't create %s: %szCan't write %s: %szWrote changes to %sT)rE r� r� r� r� r� rh )rq r� r� r� r� �fpr� r r r r� � s * zRefactoringTool.write_filez>>> z... c
C s g }d }d }d }d}|j dd�D ]�}|d7 }|�� �| j�r~|d k rZ|�| �||||�� |}|g}|�| j�} |d | � }q |d k r�|�|| j �s�||| j�� d kr�|� |� q |d k r�|�| �||||�� d }d }|� |� q |d k �r
|�| �||||�� d�
|�S )Nr T��keependsr r� ru ) �
splitlines�lstripr �PS1r. �refactor_doctest�find�PS2�rstripr r~ )
rq r� r� �result�blockZ block_lineno�indent�lineno�line�ir r r r� sJ � �� �
�z"RefactoringTool.refactor_docstringc
s z�� ||� �}W nj tk
r| } zL�j�tj�rN|D ]}��d|�d�� q6��d|||j j
|� | W Y �S d }~X Y nX �� ||��rt |�j
dd�}|d |d � ||d d � } }|d �d�s�|d d7 < � �j |�d� g}|�r|� �fd d
�|D �7 }|S ) Nz
Source: %sr� z+Can't parse docstring in %s line %s: %s: %sTr� r rs r c s g | ]}� �j | �qS r )r� )r4 r� �r� rq r r r7 Z s z4RefactoringTool.refactor_doctest.<locals>.<listcomp>)� parse_blockr" r\ Z isEnabledForrf �DEBUGr� r� r� r� r r� r� r� �endswithr� �pop)
rq r� r� r� r� r� r� r� r� Zclippedr r� r r� @ s, �"z RefactoringTool.refactor_doctestc C s� | j r d}nd}| js$| �d|� n"| �d|� | jD ]}| �|� q6| jrl| �d� | jD ]}| �|� q\| jr�t| j�dkr�| �d� n| �dt| j�� | jD ] \}}}| j|f|�|� q�d S ) N�werez
need to bezNo files %s modified.zFiles that %s modified:z$Warnings/messages while refactoring:r zThere was 1 error:zThere were %d errors:)rh rl r� rg re r{ )rq r� �file�messager� r� r� r r r � summarize] s$
zRefactoringTool.summarizec C s" | j �| �|||��}t� |_|S r& )r Z parse_tokens� wrap_toksrH r� )rq r� r� r� r� r r r r� t s zRefactoringTool.parse_blockc c sd t �| �||�j�}|D ]F\}}\}}\} }
} ||d 7 }| |d 7 } ||||f| |
f| fV qd S )Nr )r rD � gen_lines�__next__) rq r� r� r� r- r rU Zline0Zcol0Zline1Zcol1Z line_textr r r r� ~ s
zRefactoringTool.wrap_toksc c sx || j }|| j }|}|D ]N}|�|�r>|t|�d � V n(||�� d krVdV ntd||f ��|}q dV qld S )Nr� zline=%r, prefix=%rru )r� r� r r{ r� �AssertionError)rq r� r� �prefix1Zprefix2�prefixr� r r r r� � s
zRefactoringTool.gen_lines)NN)FF)FF)FF)F)NFN)N) r r r r_ r} rz rr ri r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r rX � s> �
4(
O �
+
rX c @ s e Zd ZdS )�MultiprocessingUnsupportedNr r r r r r� � s r� c sB e Zd Z� fdd�Zd � fdd� Z� fdd�Z� fd d
�Z� ZS ) �MultiprocessRefactoringToolc s" t t| �j||� d | _d | _d S r& )�superr� rr �queue� output_lock�rq r� �kwargs�r� r r rr � s z$MultiprocessRefactoringTool.__init__Fr c
s� |dkr t t���|||�S z dd l� W n tk
r@ t�Y nX �jd k rTtd��� �� �_� � � �_
� �fdd�t |�D �}z*|D ] }|�� q�t t���|||� W 5 �j� � t |�D ]}�j�
d � q�|D ]}|�� r�|� � q�d �_X d S )Nr r z already doing multiple processesc s g | ]}� j �jd ��qS ))�target)ZProcess�_child)r4 r� ��multiprocessingrq r r r7 � s �z8MultiprocessRefactoringTool.refactor.<locals>.<listcomp>)r� r� r� r� � ImportErrorr� r� � RuntimeErrorZ
JoinableQueueZLockr� �ranger~ �putZis_alive�start)rq r� r� r� Z
num_processesZ processesr� r$ r� r� r r� � s<
�
�
�
z$MultiprocessRefactoringTool.refactorc sN | j �� }|d k rJ|\}}ztt| �j||� W 5 | j �� X | j �� }q
d S r& )r� rd Z task_doner� r� r� )rq Ztaskr� r� r� r r r� � s
� z"MultiprocessRefactoringTool._childc s2 | j d k r | j �||f� ntt| �j||�S d S r& )r� r� r� r� r� r� r� r r r� � s
�z)MultiprocessRefactoringTool.refactor_file)FFr )r r r rr r� r� r� �
__classcell__r r r� r r� � s � r� )T)"�
__author__rE r� r r� rf r� r' � itertoolsr Zpgen2r r r Z
fixer_utilr ru r r r
rm r r" r r r1 r8 r: rV rW �objectrX r� r� r r r r �<module> s6
( __pycache__/pytree.cpython-38.opt-2.pyc 0000644 00000035155 15053244165 0013672 0 ustar 00 U
e5d8m � @ s� d Z ddlZddlmZ dZi add� ZG dd� de�ZG d d
� d
e�Z G d d � d e�Z
d
d� Z G dd� de�Z G dd� de �Z
G dd� de �ZG dd� de �ZG dd� de �Zdd� ZdS )z#Guido van Rossum <guido@python.org>� N)�StringIOi���c C sD t s8ddlm} |j�� D ] \}}t|�tkr|t |< qt �| | �S )N� )�python_symbols)� _type_reprsZpygramr �__dict__�items�type�int�
setdefault)Ztype_numr �name�val� r
�&/usr/lib64/python3.8/lib2to3/pytree.py� type_repr s
r c @ s� e Zd ZdZdZdZdZdZdd� Zdd� Z dZ
dd � Z d
d � Z d d
� Z
dd� Zdd� Zdd� Zdd� Zdd� Zedd� �Zedd� �Zd d � Zd d � Zd d!� Zejd"k r�d#d$� ZdS )%�BaseNr
Fc O s
t �| �S �N��object�__new__��cls�args�kwdsr
r
r r 1 s z Base.__new__c C s | j |j k rtS | �|�S r )� __class__�NotImplemented�_eq��self�otherr
r
r �__eq__6 s z Base.__eq__c C s t �d S r ��NotImplementedErrorr r
r
r r B s zBase._eqc C s t �d S r r �r r
r
r �cloneM s z
Base.clonec C s t �d S r r r" r
r
r �
post_orderU s zBase.post_orderc C s t �d S r r r" r
r
r � pre_order] s zBase.pre_orderc C s~ t |t�s|g}g }d}| jjD ].}|| krD|d k r>|�|� d}q |�|� q | j�� || j_|D ] }| j|_qfd | _d S �NFT)�
isinstance�list�parent�children�extend�append�changed)r �newZ
l_children�found�ch�xr
r
r �replacee s
z Base.replacec C s* | }t |t�s$|jsd S |jd }q|jS �Nr )r' �Leafr* �lineno�r �noder
r
r �
get_lineno| s
zBase.get_linenoc C s | j r| j �� d| _d S �NT)r) r- � was_changedr" r
r
r r- � s
z Base.changedc C sJ | j rFt| j j�D ]2\}}|| kr| j �� | j j|= d | _ | S qd S r )r) � enumerater* r- )r �ir7 r
r
r �remove� s
z Base.removec C s` | j d krd S t| j j�D ]@\}}|| krz| j j|d W S tk
rX Y d S X qd S )Nr )r) r; r* �
IndexError�r r< �childr
r
r � next_sibling� s
zBase.next_siblingc C sR | j d krd S t| j j�D ]2\}}|| kr|dkr8 d S | j j|d S qd S �Nr r )r) r; r* r? r
r
r � prev_sibling� s
zBase.prev_siblingc c s | j D ]}|�� E d H qd S r )r* �leaves�r r@ r
r
r rD � s
z Base.leavesc C s | j d krdS d| j �� S rB )r) �depthr" r
r
r rF � s
z
Base.depthc C s | j }|d krdS |jS �N� )rA �prefix)r Znext_sibr
r
r �
get_suffix� s zBase.get_suffix�� r c C s t | ��d�S )N�ascii)�str�encoder" r
r
r �__str__� s z Base.__str__) �__name__�
__module__� __qualname__r r) r* r: Z was_checkedr r �__hash__r r# r$ r% r2 r8 r- r= �propertyrA rC rD rF rJ �sys� version_inforP r
r
r
r r s2
r c @ s� e Zd Zddd�Zdd� Zdd� Zejdkr0eZd d
� Z d d � Z
d
d� Z dd� Z e
dd� �Zejdd� �Zdd� Zdd� Zdd� ZdS )�NodeNc C sN || _ t|�| _| jD ]
}| |_q|d k r0|| _|rD|d d � | _nd | _d S r )r r( r* r) rI �fixers_applied)r r r* �contextrI rY r0 r
r
r �__init__� s
z
Node.__init__c C s d| j jt| j�| jf S )Nz
%s(%s, %r))r rQ r r r* r" r
r
r �__repr__� s �z
Node.__repr__c C s d� tt| j��S rG )�join�maprN r* r" r
r
r � __unicode__� s zNode.__unicode__rK c C s | j | jf|j |jfkS r )r r* r r
r
r r � s zNode._eqc C s t | jdd� | jD �| jd�S )Nc S s g | ] }|� � �qS r
)r# )�.0r0 r
r
r �
<listcomp> s z Node.clone.<locals>.<listcomp>�rY )rX r r* rY r" r
r
r r# s �z
Node.clonec c s$ | j D ]}|�� E d H q| V d S r )r* r$ rE r
r
r r$ s
zNode.post_orderc c s$ | V | j D ]}|�� E d H q d S r )r* r% rE r
r
r r% s
zNode.pre_orderc C s | j s
dS | j d jS )NrH r �r* rI r" r
r
r rI s z Node.prefixc C s | j r|| j d _d S r3 rc �r rI r
r
r rI s c C s( | |_ d | j| _ || j|< | �� d S r )r) r* r- r? r
r
r � set_child s
zNode.set_childc C s | |_ | j�||� | �� d S r )r) r* �insertr- r? r
r
r � insert_child* s zNode.insert_childc C s | |_ | j�|� | �� d S r )r) r* r, r- rE r
r
r � append_child3 s zNode.append_child)NNN)rQ rR rS r[ r\ r_ rV rW rP r r# r$ r% rU rI �setterre rg rh r
r
r
r rX � s& �
rX c @ s� e Zd ZdZdZdZddg fdd�Zdd� Zdd � Ze j
d
krBeZ d d � Z d
d� Z
dd� Zdd� Zdd� Zedd� �Zejdd� �ZdS )r4 rH r Nc C sF |d k r|\| _ \| _| _|| _|| _|d k r4|| _ |d d � | _d S r )�_prefixr5 �columnr �valuerY )r r rl rZ rI rY r
r
r r[ F s z
Leaf.__init__c C s d| j j| j| jf S )Nz
%s(%r, %r))r rQ r rl r" r
r
r r\ Y s �z
Leaf.__repr__c C s | j t| j� S r )rI rN rl r" r
r
r r_ _ s zLeaf.__unicode__rK c C s | j | jf|j |jfkS r )r rl r r
r
r r j s zLeaf._eqc C s$ t | j| j| j| j| jff| jd�S )Nrb )r4 r rl rI r5 rk rY r" r
r
r r# n s
�z
Leaf.clonec c s
| V d S r r
r" r
r
r rD t s z Leaf.leavesc c s
| V d S r r
r" r
r
r r$ w s zLeaf.post_orderc c s
| V d S r r
r" r
r
r r% { s zLeaf.pre_orderc C s | j S r )rj r" r
r
r rI s z Leaf.prefixc C s | � � || _d S r )r- rj rd r
r
r rI � s )rQ rR rS rj r5 rk r[ r\ r_ rV rW rP r r# rD r$ r% rU rI ri r
r
r
r r4 = s( �
r4 c C sN |\}}}}|s|| j kr<t|�dkr.|d S t|||d�S t|||d�S d S )Nr r )rZ )Z
number2symbol�lenrX r4 )ZgrZraw_noder rl rZ r* r
r
r �convert� s rn c @ sL e Zd ZdZdZdZdd� Zdd� Zdd� Zddd �Z dd
d �Z
d d
� Z dS )� BasePatternNc O s
t �| �S r r r r
r
r r � s zBasePattern.__new__c C sH t | j�| j| jg}|r,|d d kr,|d= qd| jjd�tt|��f S )N���z%s(%s)z, ) r r �contentr r rQ r] r^ �repr)r r r
r
r r\ � s zBasePattern.__repr__c C s | S r r
r" r
r
r �optimize� s zBasePattern.optimizec C sn | j d k r|j | j krdS | jd k rRd }|d k r4i }| �||�sDdS |rR|�|� |d k rj| jrj||| j< dS r& )r rq � _submatch�updater )r r7 �results�rr
r
r �match� s
zBasePattern.matchc C s t |�dkrdS | �|d |�S )Nr Fr )rm rx )r �nodesrv r
r
r � match_seq� s zBasePattern.match_seqc c s& i }|r"| � |d |�r"d|fV d S rB )rx )r ry rw r
r
r �generate_matches� s z BasePattern.generate_matches)N)N) rQ rR rS r rq r r r\ rs rx rz r{ r
r
r
r ro � s
ro c @ s* e Zd Zddd�Zd dd�Zd
dd�ZdS ) � LeafPatternNc C s& |d k r|d k r|| _ || _|| _d S r )r rq r )r r rq r r
r
r r[ � s
zLeafPattern.__init__c C s t |t�sdS t�| ||�S �NF)r' r4 ro rx �r r7 rv r
r
r rx
s
zLeafPattern.matchc C s | j |jkS r )rq rl r~ r
r
r rt s
zLeafPattern._submatch)NNN)N)N)rQ rR rS r[ rx rt r
r
r
r r| � s
r| c @ s$ e Zd ZdZddd�Zddd�ZdS ) � NodePatternFNc C sP |d k r|d k r:t |�}t|�D ]\}}t|t�r d| _q || _|| _|| _d S r9 )r( r; r' �WildcardPattern� wildcardsr rq r )r r rq r r< �itemr
r
r r[ $ s
zNodePattern.__init__c C s� | j rHt| j|j�D ].\}}|t|j�kr|d k r<|�|� dS qdS t| j�t|j�kr`dS t| j|j�D ]\}}|�||�sn dS qndS �NTF)r� r{ rq r* rm ru �ziprx )r r7 rv �crw �
subpatternr@ r
r
r rt A s
zNodePattern._submatch)NNN)N)rQ rR rS r� r[ rt r
r
r
r r s
r c @ sZ e Zd Zddedfdd�Zdd� Zddd�Zdd d
�Zd d � Zd
d� Z dd� Z
dd� Z dS )r� Nr c C s< |d k r t tt |��}|D ]}q|| _|| _|| _|| _d S r )�tupler^ rq �min�maxr )r rq r� r� r �altr
r
r r[ k s zWildcardPattern.__init__c C s� d }| j d k r<t| j �dkr<t| j d �dkr<| j d d }| jdkr�| jdkr�| j d krft| jd�S |d k r�| j|jkr�|�� S | jdkr�t|t�r�|jdkr�| j|jkr�t|j | j|j | j|j |j�S | S )Nr r )r ) rq rm r� r� r r rs r' r� )r r� r
r
r rs � s.
��
�
�
�zWildcardPattern.optimizec C s | � |g|�S r )rz r~ r
r
r rx � s zWildcardPattern.matchc C sP | � |�D ]@\}}|t|�kr
|d k rD|�|� | jrDt|�|| j< dS q
dS r� )r{ rm ru r r( )r ry rv r� rw r
r
r rz � s
zWildcardPattern.match_seqc c s, | j d krTt| jdtt|�| j� �D ]*}i }| jrF|d |� || j< ||fV q&n�| jdkrl| �|�V n�ttd�r�tj }t
� t_ z�z<| � |d�D ]*\}}| jr�|d |� || j< ||fV q�W nL t k
�r | �
|�D ]*\}}| jr�|d |� || j< ||fV q�Y nX W 5 ttd��r&|t_ X d S )Nr Z bare_name� getrefcountr )rq �ranger� rm r� r �_bare_name_matches�hasattrrV �stderrr �_recursive_matches� RuntimeError�_iterative_matches)r ry �countrw Z save_stderrr
r
r r{ � s.
z WildcardPattern.generate_matchesc c s� t |�}d| jkr di fV g }| jD ]0}t||�D ] \}}||fV |�||f� q4q&|r�g }|D ]�\}} ||k rd|| jkrd| jD ]`}t|||d � �D ]H\}
} |
dkr�i }|�| � |�| � ||
|fV |�||
|f� q�q�qd|}qXd S r3 )rm r� rq r{ r, r� ru ) r ry Znodelenrv r� r� rw Z new_results�c0�r0�c1�r1r
r
r r� � s*
z"WildcardPattern._iterative_matchesc C sp d}i }d}t |�}|sV||k rVd}| jD ](}|d �|| |�r*|d7 }d} qq*q|d |� || j< ||fS )Nr FTr )rm rq rx r )r ry r� rw Zdoner� Zleafr
r
r r� � s
z"WildcardPattern._bare_name_matchesc c s� || j krdi fV || jk r�| jD ]`}t||�D ]P\}}| �||d � |d �D ].\}}i }|�|� |�|� || |fV qRq2q$d S rB )r� r� rq r{ r� ru ) r ry r� r� r� r� r� r� rw r
r
r r�
s
z"WildcardPattern._recursive_matches)N)N) rQ rR rS �HUGEr[ rs rx rz r{ r� r� r� r
r
r
r r� ] s #
- r� c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �NegatedPatternNc C s |d k r|| _ d S r )rq )r rq r
r
r r[ s zNegatedPattern.__init__c C s dS r} r
r6 r
r
r rx ( s zNegatedPattern.matchc C s t |�dkS r3 )rm )r ry r
r
r rz , s zNegatedPattern.match_seqc c sJ | j d kr"t|�dkrFdi fV n$| j �|�D ] \}} d S di fV d S r3 )rq rm r{ )r ry r� rw r
r
r r{ 0 s
z NegatedPattern.generate_matches)N)rQ rR rS r[ rx rz r{ r
r
r
r r� s
r� c c s� | sdi fV n|| d | dd � }}|� |�D ]Z\}}|sH||fV q0t |||d � �D ].\}}i }|�|� |�|� || |fV qZq0d S rB )r{ ru ) Zpatternsry �p�restr� r� r� r� rw r
r
r r{ < s
r{ )�
__author__rV �ior r� r r r r rX r4 rn ro r| r r� r� r{ r
r
r
r �<module>
s"
1nNV,= =# __pycache__/pygram.cpython-38.opt-1.pyc 0000644 00000002356 15053244165 0013655 0 ustar 00 U
e5d � @ s� d Z ddlZddlmZ ddlmZ ddlmZ ej�ej� e
�d�Z ej�ej� e
�d�Z G d d
� d
e
�Ze�d e �Zee�Ze�� Zejd = e�� Zejd
= e�d e �Zee�ZdS )z&Export the Python grammar and symbols.� N� )�token)�driver)�pytreez Grammar.txtzPatternGrammar.txtc @ s e Zd Zdd� ZdS )�Symbolsc C s$ |j �� D ]\}}t| ||� q
dS )z�Initializer.
Creates an attribute for each grammar symbol (nonterminal),
whose value is the symbol's type (an int >= 256).
N)Z
symbol2number�items�setattr)�selfZgrammar�nameZsymbol� r �&/usr/lib64/python3.8/lib2to3/pygram.py�__init__ s zSymbols.__init__N)�__name__�
__module__� __qualname__r
r r r r r s r Zlib2to3�print�exec)�__doc__�osZpgen2r r � r �path�join�dirname�__file__Z
_GRAMMAR_FILEZ_PATTERN_GRAMMAR_FILE�objectr Zload_packaged_grammarZpython_grammarZpython_symbols�copyZ!python_grammar_no_print_statement�keywordsZ*python_grammar_no_print_and_exec_statementZpattern_grammarZpattern_symbolsr r r r �<module> s" � __pycache__/fixer_base.cpython-38.pyc 0000644 00000014157 15053244165 0013530 0 ustar 00 U
e5d" � @ sT d Z ddlZddlmZ ddlmZ ddlmZ G dd� de�Z G d d
� d
e �Z
dS ) z2Base class for fixers (optional, but recommended).� N� )�PatternCompiler)�pygram)�does_tree_importc @ s� e Zd ZdZdZdZdZdZdZe �
d�Z e � Z
dZdZdZdZdZdZejZdd� Zd d
� Zd d � Zd
d� Zdd� Zd dd�Z dd� Z d dd�Z dd� Z dd� Z d d � Z!dS ) �BaseFixa Optional base class for fixers.
The subclass name must be FixFooBar where FooBar is the result of
removing underscores and capitalizing the words of the fix name.
For example, the class name for a fixer named 'has_key' should be
FixHasKey.
Nr ZpostF� c C s || _ || _| �� dS )a Initializer. Subclass may override.
Args:
options: a dict containing the options passed to RefactoringTool
that could be used to customize the fixer through the command line.
log: a list to append warnings and other messages to.
N)�options�log�compile_pattern)�selfr r � r �*/usr/lib64/python3.8/lib2to3/fixer_base.py�__init__/ s zBaseFix.__init__c C s, | j dk r(t� }|j| j dd�\| _| _dS )z�Compiles self.PATTERN into self.pattern.
Subclass may override if it doesn't want to use
self.{pattern,PATTERN} in .match().
NT)Z with_tree)�PATTERNr r
�pattern� pattern_tree)r ZPCr r r
r
; s
�zBaseFix.compile_patternc C s
|| _ dS )zOSet the filename.
The main refactoring tool should call this.
N)�filename)r r r r r
� set_filenameF s zBaseFix.set_filenamec C s d|i}| j �||�o|S )a Returns match for a given parse tree node.
Should return a true or false object (not necessarily a bool).
It may return a non-empty dict of matching sub-nodes as
returned by a matching pattern.
Subclass may override.
�node)r �match�r r Zresultsr r r
r M s z
BaseFix.matchc C s
t � �dS )a� Returns the transformation for a given parse tree node.
Args:
node: the root of the parse tree that matched the fixer.
results: a dict mapping symbolic names to part of the match.
Returns:
None, or a node that is a modified copy of the
argument node. The node argument may also be modified in-place to
effect the same change.
Subclass *must* override.
N)�NotImplementedErrorr r r r
� transformY s zBaseFix.transform�xxx_todo_changemec C s2 |}|| j kr"|tt| j�� }q| j �|� |S )z�Return a string suitable for use as an identifier
The new name is guaranteed not to conflict with other identifiers.
)�
used_names�str�next�numbers�add)r �template�namer r r
�new_namei s
zBaseFix.new_namec C s. | j r d| _ | j�d| j � | j�|� d S )NFz### In file %s ###)� first_logr �appendr )r �messager r r
� log_messaget s zBaseFix.log_messagec C s> |� � }|�� }d|_d}| �|||f � |r:| �|� dS )a Warn the user that a given chunk of code is not valid Python 3,
but that it cannot be converted automatically.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
� z Line %d: could not convert: %sN)�
get_linenoZclone�prefixr% )r r �reason�linenoZ
for_output�msgr r r
�cannot_convertz s zBaseFix.cannot_convertc C s |� � }| �d||f � dS )z�Used for warning the user about possible uncertainty in the
translation.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
z Line %d: %sN)r' r% )r r r) r* r r r
�warning� s zBaseFix.warningc C s( |j | _ | �|� t�d�| _d| _dS )z�Some fixers need to maintain tree-wide state.
This method is called once, at the start of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
r TN)r r � itertools�countr r" �r Ztreer r r r
�
start_tree� s
zBaseFix.start_treec C s dS )z�Some fixers need to maintain tree-wide state.
This method is called once, at the conclusion of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
Nr r0 r r r
� finish_tree� s zBaseFix.finish_tree)r )N)"�__name__�
__module__� __qualname__�__doc__r r r r r r. r/ r �setr �orderZexplicitZ run_orderZ _accept_typeZkeep_line_orderZ
BM_compatibler Zpython_symbolsZsymsr r
r r r r! r% r, r- r1 r2 r r r r
r s4
r c s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�ConditionalFixz@ Base class for fixers which not execute if an import is found. Nc s t t| �j|� d | _d S )N)�superr9 r1 � _should_skip)r �args�� __class__r r
r1 � s zConditionalFix.start_treec C sJ | j d k r| j S | j�d�}|d }d�|d d� �}t|||�| _ | j S )N�.���)r; �skip_on�split�joinr )r r Zpkgr r r r
� should_skip� s
zConditionalFix.should_skip)r3 r4 r5 r6 rA r1 rD �
__classcell__r r r= r
r9 � s r9 ) r6 r. Zpatcompr r& r Z
fixer_utilr �objectr r9 r r r r
�<module> s __pycache__/pytree.cpython-38.pyc 0000644 00000057430 15053244165 0012732 0 ustar 00 U
e5d8m � @ s� d Z dZddlZddlmZ dZi add� ZG dd � d e�Z G d
d � d e �Z
G d d
� d
e �Z dd� Z G dd� de�Z
G dd� de
�ZG dd� de
�ZG dd� de
�ZG dd� de
�Zdd� ZdS ) z�
Python parse tree definitions.
This is a very concrete parse tree; we need to keep every token and
even the comments and whitespace between tokens.
There's also a pattern matching implementation here.
z#Guido van Rossum <guido@python.org>� N)�StringIOi���c C sD t s8ddlm} |j�� D ] \}}t|�tkr|t |< qt �| | �S )N� )�python_symbols)� _type_reprsZpygramr �__dict__�items�type�int�
setdefault)Ztype_numr �name�val� r
�&/usr/lib64/python3.8/lib2to3/pytree.py� type_repr s
r c @ s� e Zd ZdZdZdZdZdZdZdd� Z dd� Z
dZ d d
� Z d d � Z
d
d� Zdd� Zdd� Zdd� Zdd� Zdd� Zedd� �Zedd � �Zd d � Zd d � Zd!d"� Zejd#k r�d$d%� Z dS )&�Basez�
Abstract base class for Node and Leaf.
This provides some default functionality and boilerplate using the
template pattern.
A node may be a subnode of at most one parent.
Nr
Fc O s | t k std��t�| �S )z7Constructor that prevents Base from being instantiated.zCannot instantiate Base)r �AssertionError�object�__new__��cls�args�kwdsr
r
r r 1 s z Base.__new__c C s | j |j k rtS | �|�S )zW
Compare two nodes for equality.
This calls the method _eq().
)� __class__�NotImplemented�_eq��self�otherr
r
r �__eq__6 s z Base.__eq__c C s t �dS )a_
Compare two nodes for equality.
This is called by __eq__ and __ne__. It is only called if the two nodes
have the same type. This must be implemented by the concrete subclass.
Nodes should be considered equal if they have the same structure,
ignoring the prefix string and other context information.
N��NotImplementedErrorr r
r
r r B s zBase._eqc C s t �dS )zr
Return a cloned (deep) copy of self.
This must be implemented by the concrete subclass.
Nr �r r
r
r �cloneM s z
Base.clonec C s t �dS )zx
Return a post-order iterator for the tree.
This must be implemented by the concrete subclass.
Nr r! r
r
r �
post_orderU s zBase.post_orderc C s t �dS )zw
Return a pre-order iterator for the tree.
This must be implemented by the concrete subclass.
Nr r! r
r
r � pre_order] s zBase.pre_orderc C s� | j dk stt| ���|dk s"t�t|t�s2|g}g }d}| j jD ]D}|| kr||rdt| j j| |f��|dk rv|�|� d}qB|�|� qB|s�t| j| |f��| j �� || j _|D ] }| j |_ q�d| _ dS )z/Replace this node with a new one in the parent.NFT) �parentr �str�
isinstance�list�children�extend�append�changed)r �newZ
l_children�found�ch�xr
r
r �replacee s&
z Base.replacec C s* | }t |t�s$|jsdS |jd }q|jS )z9Return the line number which generated the invocant node.Nr )r' �Leafr) �lineno�r �noder
r
r �
get_lineno| s
zBase.get_linenoc C s | j r| j �� d| _d S )NT)r% r, � was_changedr! r
r
r r, � s
z Base.changedc C sJ | j rFt| j j�D ]2\}}|| kr| j �� | j j|= d| _ | S qdS )z�
Remove the node from the tree. Returns the position of the node in its
parent's children before it was removed.
N)r% � enumerater) r, )r �ir5 r
r
r �remove� s
z Base.removec C s` | j dkrdS t| j j�D ]@\}}|| krz| j j|d W S tk
rX Y dS X qdS )z�
The node immediately following the invocant in their parent's children
list. If the invocant does not have a next sibling, it is None
Nr )r% r8 r) �
IndexError�r r9 �childr
r
r � next_sibling� s
zBase.next_siblingc C sR | j dkrdS t| j j�D ]2\}}|| kr|dkr8 dS | j j|d S qdS )z�
The node immediately preceding the invocant in their parent's children
list. If the invocant does not have a previous sibling, it is None.
Nr r )r% r8 r) r< r
r
r � prev_sibling� s
zBase.prev_siblingc c s | j D ]}|�� E d H qd S �N)r) �leaves�r r= r
r
r rA � s
z Base.leavesc C s | j d krdS d| j �� S )Nr r )r% �depthr! r
r
r rC � s
z
Base.depthc C s | j }|dkrdS |jS )z�
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
N� )r> �prefix)r Znext_sibr
r
r �
get_suffix� s zBase.get_suffix�� r c C s t | ��d�S )N�ascii)r& �encoder! r
r
r �__str__� s z Base.__str__) �__name__�
__module__� __qualname__�__doc__r r% r) r7 Z was_checkedr r �__hash__r r" r# r$ r1 r6 r, r: �propertyr> r? rA rC rF �sys� version_inforK r
r
r
r r s4
r c @ s� e Zd ZdZddd�Zdd� Zdd� Zejd kr4eZ d
d � Z
d d
� Z dd� Z dd� Z
edd� �Zejdd� �Zdd� Zdd� Zdd� ZdS ) �Nodez+Concrete implementation for interior nodes.Nc C st |dkst |��|| _t|�| _| jD ] }|jdks@t t|���| |_q&|dk rV|| _|rj|dd� | _nd| _dS )z�
Initializer.
Takes a type constant (a symbol number >= 256), a sequence of
child nodes, and an optional context keyword argument.
As a side effect, the parent pointers of the children are updated.
� N)r r r( r) r% �reprrE �fixers_applied)r r r) �contextrE rW r/ r
r
r �__init__� s
z
Node.__init__c C s d| j jt| j�| jf S )�)Return a canonical string representation.z
%s(%s, %r))r rL r r r) r! r
r
r �__repr__� s �z
Node.__repr__c C s d� tt| j��S )�k
Return a pretty string representation.
This reproduces the input source exactly.
rD )�join�mapr& r) r! r
r
r � __unicode__� s zNode.__unicode__rG c C s | j | jf|j |jfkS �z Compare two nodes for equality.)r r) r r
r
r r � s zNode._eqc C s t | jdd� | jD �| jd�S )�$Return a cloned (deep) copy of self.c S s g | ] }|� � �qS r
)r" )�.0r/ r
r
r �
<listcomp> s z Node.clone.<locals>.<listcomp>�rW )rT r r) rW r! r
r
r r" s �z
Node.clonec c s$ | j D ]}|�� E dH q| V dS �z*Return a post-order iterator for the tree.N)r) r# rB r
r
r r# s
zNode.post_orderc c s$ | V | j D ]}|�� E dH q dS �z)Return a pre-order iterator for the tree.N)r) r$ rB r
r
r r$ s
zNode.pre_orderc C s | j s
dS | j d jS )zO
The whitespace and comments preceding this node in the input.
rD r �r) rE r! r
r
r rE s z Node.prefixc C s | j r|| j d _d S �Nr rg �r rE r
r
r rE s c C s( | |_ d| j| _ || j|< | �� dS )z�
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N)r% r) r, r< r
r
r � set_child s
zNode.set_childc C s | |_ | j�||� | �� dS )z�
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N)r% r) �insertr, r< r
r
r � insert_child* s zNode.insert_childc C s | |_ | j�|� | �� dS )z�
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N)r% r) r+ r, rB r
r
r � append_child3 s zNode.append_child)NNN)rL rM rN rO rY r[ r_ rR rS rK r r" r# r$ rQ rE �setterrj rl rm r
r
r
r rT � s( �
rT c @ s� e Zd ZdZdZdZdZddg fdd�Zdd� Zd d
� Z e
j d krFe Z d d
� Z
dd� Zdd� Zdd� Zdd� Zedd� �Zejdd� �ZdS )r2 z'Concrete implementation for leaf nodes.rD r Nc C sd d| krdk s n t |��|dk r8|\| _\| _| _|| _|| _|dk rR|| _|dd� | _dS )z�
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
r rU N)r �_prefixr3 �columnr �valuerW )r r rq rX rE rW r
r
r rY F s
z
Leaf.__init__c C s d| j j| j| jf S )rZ z
%s(%r, %r))r rL r rq r! r
r
r r[ Y s �z
Leaf.__repr__c C s | j t| j� S )r\ )rE r& rq r! r
r
r r_ _ s zLeaf.__unicode__rG c C s | j | jf|j |jfkS r` )r rq r r
r
r r j s zLeaf._eqc C s$ t | j| j| j| j| jff| jd�S )ra rd )r2 r rq rE r3 rp rW r! r
r
r r" n s
�z
Leaf.clonec c s
| V d S r@ r
r! r
r
r rA t s z Leaf.leavesc c s
| V dS re r
r! r
r
r r# w s zLeaf.post_orderc c s
| V dS rf r
r! r
r
r r$ { s zLeaf.pre_orderc C s | j S )zP
The whitespace and comments preceding this token in the input.
)ro r! r
r
r rE s z Leaf.prefixc C s | � � || _d S r@ )r, ro ri r
r
r rE � s )rL rM rN rO ro r3 rp rY r[ r_ rR rS rK r r" rA r# r$ rQ rE rn r
r
r
r r2 = s* �
r2 c C sN |\}}}}|s|| j kr<t|�dkr.|d S t|||d�S t|||d�S dS )z�
Convert raw node information to a Node or Leaf instance.
This is passed to the parser driver which calls it whenever a reduction of a
grammar rule produces a new complete node, so that the tree is build
strictly bottom-up.
r r )rX N)Z
number2symbol�lenrT r2 )ZgrZraw_noder rq rX r) r
r
r �convert� s rs c @ sP e Zd ZdZdZdZdZdd� Zdd� Zdd� Z dd d
�Z
dd d �Z d
d� Z dS )� BasePatterna�
A pattern is a tree matching pattern.
It looks for a specific node type (token or symbol), and
optionally for a specific content.
This is an abstract base class. There are three concrete
subclasses:
- LeafPattern matches a single leaf node;
- NodePattern matches a single node (usually non-leaf);
- WildcardPattern matches a sequence of nodes of variable length.
Nc O s | t k std��t�| �S )z>Constructor that prevents BasePattern from being instantiated.z Cannot instantiate BasePattern)rt r r r r r
r
r r � s zBasePattern.__new__c C sH t | j�| j| jg}|r,|d d kr,|d= qd| jjd�tt|��f S )N���z%s(%s)z, ) r r �contentr r rL r] r^ rV )r r r
r
r r[ � s zBasePattern.__repr__c C s | S )z�
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
r
r! r
r
r �optimize� s zBasePattern.optimizec C sn | j dk r|j | j krdS | jdk rRd}|dk r4i }| �||�sDdS |rR|�|� |dk rj| jrj||| j< dS )a#
Does this pattern exactly match a node?
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
Default implementation for non-wildcard patterns.
NFT)r rv � _submatch�updater )r r5 �results�rr
r
r �match� s
zBasePattern.matchc C s t |�dkrdS | �|d |�S )z�
Does this pattern exactly match a sequence of nodes?
Default implementation for non-wildcard patterns.
r Fr )rr r| )r �nodesrz r
r
r � match_seq� s zBasePattern.match_seqc c s& i }|r"| � |d |�r"d|fV dS )z}
Generator yielding all matches for this pattern.
Default implementation for non-wildcard patterns.
r r N)r| )r r} r{ r
r
r �generate_matches� s z BasePattern.generate_matches)N)N)
rL rM rN rO r rv r r r[ rw r| r~ r r
r
r
r rt � s
rt c @ s* e Zd Zddd�Zd dd�Zd
dd�ZdS ) � LeafPatternNc C sZ |dk r&d| kr dk s&n t |��|dk rDt|t�sDt t|���|| _|| _|| _dS )ap
Initializer. Takes optional type, content, and name.
The type, if given must be a token type (< 256). If not given,
this matches any *leaf* node; the content may still be required.
The content, if given, must be a string.
If a name is given, the matching node is stored in the results
dict under that key.
Nr rU )r r' r& rV r rv r )r r rv r r
r
r rY � s zLeafPattern.__init__c C s t |t�sdS t�| ||�S )z*Override match() to insist on a leaf node.F)r' r2 rt r| �r r5 rz r
r
r r|
s
zLeafPattern.matchc C s | j |jkS )�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
)rv rq r� r
r
r rx s
zLeafPattern._submatch)NNN)N)N)rL rM rN rY r| rx r
r
r
r r� � s
r� c @ s$ e Zd ZdZddd�Zddd�ZdS ) � NodePatternFNc C s� |dk r|dkst |��|dk rvt|t�r6t t|���t|�}t|�D ].\}}t|t�sdt ||f��t|t�rFd| _qF|| _ || _
|| _ dS )ad
Initializer. Takes optional type, content, and name.
The type, if given, must be a symbol type (>= 256). If the
type is None this matches *any* single node (leaf or not),
except if content is not None, in which it only matches
non-leaf nodes that also match the content pattern.
The content, if not None, must be a sequence of Patterns that
must match the node's children exactly. If the content is
given, the type must not be None.
If a name is given, the matching node is stored in the results
dict under that key.
NrU T) r r' r& rV r( r8 rt �WildcardPattern� wildcardsr rv r )r r rv r r9 �itemr
r
r rY $ s
zNodePattern.__init__c C s� | j rHt| j|j�D ].\}}|t|j�kr|dk r<|�|� dS qdS t| j�t|j�kr`dS t| j|j�D ]\}}|�||�sn dS qndS )r� NTF)r� r rv r) rr ry �zipr| )r r5 rz �cr{ �
subpatternr= r
r
r rx A s
zNodePattern._submatch)NNN)N)rL rM rN r� rY rx r
r
r
r r� s
r� c @ s^ e Zd ZdZddedfdd�Zdd� Zddd �Zdd
d �Zd d
� Z dd� Z
dd� Z dd� Z dS )r� a
A wildcard pattern can match zero or more nodes.
This has all the flexibility needed to implement patterns like:
.* .+ .? .{m,n}
(a b c | d e | f)
(...)* (...)+ (...)? (...){m,n}
except it always uses non-greedy matching.
Nr c C s� d| kr | kr t ks,n t||f��|dk rtttt|��}t|�sVtt|���|D ]}t|�sZtt|���qZ|| _|| _|| _|| _ dS )a�
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optional minimum number of times to match, default 0
max: optional maximum number of times to match, default HUGE
name: optional name assigned to this match
[*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is
equivalent to (a b c | d e | f g h); if content is None,
this is equivalent to '.' in regular expression terms.
The min and max parameters work as follows:
min=0, max=maxint: .*
min=1, max=maxint: .+
min=0, max=1: .?
min=1, max=1: .
If content is not None, replace the dot with the parenthesized
list of alternatives, e.g. (a b c | d e | f g h)*
r N)
�HUGEr �tupler^ rr rV rv �min�maxr )r rv r� r� r �altr
r
r rY k s ,zWildcardPattern.__init__c C s� d}| j dk r<t| j �dkr<t| j d �dkr<| j d d }| jdkr�| jdkr�| j dkrft| jd�S |dk r�| j|jkr�|�� S | jdkr�t|t�r�|jdkr�| j|jkr�t|j | j|j | j|j |j�S | S )z+Optimize certain stacked wildcard patterns.Nr r )r ) rv rr r� r� r� r rw r' r� )r r� r
r
r rw � s.
��
�
�
�zWildcardPattern.optimizec C s | � |g|�S )z'Does this pattern exactly match a node?)r~ r� r
r
r r| � s zWildcardPattern.matchc C sP | � |�D ]@\}}|t|�kr
|dk rD|�|� | jrDt|�|| j< dS q
dS )z4Does this pattern exactly match a sequence of nodes?NTF)r rr ry r r( )r r} rz r� r{ r
r
r r~ � s
zWildcardPattern.match_seqc c s, | j dkrTt| jdtt|�| j� �D ]*}i }| jrF|d|� || j< ||fV q&n�| jdkrl| �|�V n�ttd�r�tj }t
� t_ z�z<| � |d�D ]*\}}| jr�|d|� || j< ||fV q�W nL t k
�r | �
|�D ]*\}}| jr�|d|� || j< ||fV q�Y nX W 5 ttd��r&|t_ X dS )a"
Generator yielding matches for a sequence of nodes.
Args:
nodes: sequence of nodes
Yields:
(count, results) tuples where:
count: the match comprises nodes[:count];
results: dict containing named submatches.
Nr Z bare_name� getrefcountr )rv �ranger� rr r� r �_bare_name_matches�hasattrrR �stderrr �_recursive_matches� RuntimeError�_iterative_matches)r r} �countr{ Z save_stderrr
r
r r � s.
z WildcardPattern.generate_matchesc c s� t |�}d| jkr di fV g }| jD ]0}t||�D ] \}}||fV |�||f� q4q&|r�g }|D ]�\}} ||k rd|| jkrd| jD ]`}t|||d� �D ]H\}
} |
dkr�i }|�| � |�| � ||
|fV |�||
|f� q�q�qd|}qXdS )z(Helper to iteratively yield the matches.r N)rr r� rv r r+ r� ry ) r r} Znodelenrz r� r� r{ Z new_results�c0�r0�c1�r1r
r
r r� � s*
z"WildcardPattern._iterative_matchesc C sp d}i }d}t |�}|sV||k rVd}| jD ](}|d �|| |�r*|d7 }d} qq*q|d|� || j< ||fS )z(Special optimized matcher for bare_name.r FTr N)rr rv r| r )r r} r� r{ Zdoner� Zleafr
r
r r� � s
z"WildcardPattern._bare_name_matchesc c s� | j dk st�|| jkr"di fV || jk r�| j D ]`}t||�D ]P\}}| �||d� |d �D ].\}}i }|�|� |�|� || |fV q`q@q2dS )z(Helper to recursively yield the matches.Nr r )rv r r� r� r r� ry ) r r} r� r� r� r� r� r� r{ r
r
r r�
s
z"WildcardPattern._recursive_matches)N)N)
rL rM rN rO r� rY rw r| r~ r r� r� r� r
r
r
r r� ] s #
- r� c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �NegatedPatternNc C s( |dk r t |t�s tt|���|| _dS )a
Initializer.
The argument is either a pattern or None. If it is None, this
only matches an empty sequence (effectively '$' in regex
lingo). If it is not None, this matches whenever the argument
pattern doesn't have any matches.
N)r' rt r rV rv )r rv r
r
r rY s zNegatedPattern.__init__c C s dS )NFr
r4 r
r
r r| ( s zNegatedPattern.matchc C s t |�dkS rh )rr )r r} r
r
r r~ , s zNegatedPattern.match_seqc c sJ | j d kr"t|�dkrFdi fV n$| j �|�D ] \}} d S di fV d S rh )rv rr r )r r} r� r{ r
r
r r 0 s
z NegatedPattern.generate_matches)N)rL rM rN rY r| r~ r r
r
r
r r� s
r� c c s� | sdi fV n|| d | dd� }}|� |�D ]Z\}}|sH||fV q0t |||d� �D ].\}}i }|�|� |�|� || |fV qZq0dS )aR
Generator yielding matches for a sequence of patterns and nodes.
Args:
patterns: a sequence of patterns
nodes: a sequence of nodes
Yields:
(count, results) tuples where:
count: the entire sequence of patterns matches nodes[:count];
results: dict containing named submatches.
r r N)r ry ) Zpatternsr} �p�restr� r� r� r� r{ r
r
r r < s
r )rO �
__author__rR �ior r� r r r r rT r2 rs rt r� r� r� r� r r
r
r
r �<module> s$
1nNV,= =# __pycache__/pytree.cpython-38.opt-1.pyc 0000644 00000056154 15053244165 0013673 0 ustar 00 U
e5d8m � @ s� d Z dZddlZddlmZ dZi add� ZG dd � d e�Z G d
d � d e �Z
G d d
� d
e �Z dd� Z G dd� de�Z
G dd� de
�ZG dd� de
�ZG dd� de
�ZG dd� de
�Zdd� ZdS ) z�
Python parse tree definitions.
This is a very concrete parse tree; we need to keep every token and
even the comments and whitespace between tokens.
There's also a pattern matching implementation here.
z#Guido van Rossum <guido@python.org>� N)�StringIOi���c C sD t s8ddlm} |j�� D ] \}}t|�tkr|t |< qt �| | �S )N� )�python_symbols)� _type_reprsZpygramr �__dict__�items�type�int�
setdefault)Ztype_numr �name�val� r
�&/usr/lib64/python3.8/lib2to3/pytree.py� type_repr s
r c @ s� e Zd ZdZdZdZdZdZdZdd� Z dd� Z
dZ d d
� Z d d � Z
d
d� Zdd� Zdd� Zdd� Zdd� Zdd� Zedd� �Zedd � �Zd d � Zd d � Zd!d"� Zejd#k r�d$d%� Z dS )&�Basez�
Abstract base class for Node and Leaf.
This provides some default functionality and boilerplate using the
template pattern.
A node may be a subnode of at most one parent.
Nr
Fc O s
t �| �S )z7Constructor that prevents Base from being instantiated.��object�__new__��cls�args�kwdsr
r
r r 1 s z Base.__new__c C s | j |j k rtS | �|�S )zW
Compare two nodes for equality.
This calls the method _eq().
)� __class__�NotImplemented�_eq��self�otherr
r
r �__eq__6 s z Base.__eq__c C s t �dS )a_
Compare two nodes for equality.
This is called by __eq__ and __ne__. It is only called if the two nodes
have the same type. This must be implemented by the concrete subclass.
Nodes should be considered equal if they have the same structure,
ignoring the prefix string and other context information.
N��NotImplementedErrorr r
r
r r B s zBase._eqc C s t �dS )zr
Return a cloned (deep) copy of self.
This must be implemented by the concrete subclass.
Nr �r r
r
r �cloneM s z
Base.clonec C s t �dS )zx
Return a post-order iterator for the tree.
This must be implemented by the concrete subclass.
Nr r! r
r
r �
post_orderU s zBase.post_orderc C s t �dS )zw
Return a pre-order iterator for the tree.
This must be implemented by the concrete subclass.
Nr r! r
r
r � pre_order] s zBase.pre_orderc C s~ t |t�s|g}g }d}| jjD ].}|| krD|dk r>|�|� d}q |�|� q | j�� || j_|D ] }| j|_qfd| _dS )z/Replace this node with a new one in the parent.FNT)�
isinstance�list�parent�children�extend�append�changed)r �newZ
l_children�found�ch�xr
r
r �replacee s
z Base.replacec C s* | }t |t�s$|jsdS |jd }q|jS )z9Return the line number which generated the invocant node.Nr )r% �Leafr( �lineno�r �noder
r
r �
get_lineno| s
zBase.get_linenoc C s | j r| j �� d| _d S )NT)r' r+ � was_changedr! r
r
r r+ � s
z Base.changedc C sJ | j rFt| j j�D ]2\}}|| kr| j �� | j j|= d| _ | S qdS )z�
Remove the node from the tree. Returns the position of the node in its
parent's children before it was removed.
N)r' � enumerater( r+ )r �ir4 r
r
r �remove� s
z Base.removec C s` | j dkrdS t| j j�D ]@\}}|| krz| j j|d W S tk
rX Y dS X qdS )z�
The node immediately following the invocant in their parent's children
list. If the invocant does not have a next sibling, it is None
Nr )r' r7 r( �
IndexError�r r8 �childr
r
r � next_sibling� s
zBase.next_siblingc C sR | j dkrdS t| j j�D ]2\}}|| kr|dkr8 dS | j j|d S qdS )z�
The node immediately preceding the invocant in their parent's children
list. If the invocant does not have a previous sibling, it is None.
Nr r )r' r7 r( r; r
r
r � prev_sibling� s
zBase.prev_siblingc c s | j D ]}|�� E d H qd S �N)r( �leaves�r r< r
r
r r@ � s
z Base.leavesc C s | j d krdS d| j �� S )Nr r )r' �depthr! r
r
r rB � s
z
Base.depthc C s | j }|dkrdS |jS )z�
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
N� )r= �prefix)r Znext_sibr
r
r �
get_suffix� s zBase.get_suffix�� r c C s t | ��d�S )N�ascii)�str�encoder! r
r
r �__str__� s z Base.__str__) �__name__�
__module__� __qualname__�__doc__r r' r( r6 Z was_checkedr r �__hash__r r" r# r$ r0 r5 r+ r9 �propertyr= r> r@ rB rE �sys� version_inforK r
r
r
r r s4
r c @ s� e Zd ZdZddd�Zdd� Zdd� Zejd kr4eZ d
d � Z
d d
� Z dd� Z dd� Z
edd� �Zejdd� �Zdd� Zdd� Zdd� ZdS ) �Nodez+Concrete implementation for interior nodes.Nc C sN || _ t|�| _| jD ]
}| |_q|dk r0|| _|rD|dd� | _nd| _dS )z�
Initializer.
Takes a type constant (a symbol number >= 256), a sequence of
child nodes, and an optional context keyword argument.
As a side effect, the parent pointers of the children are updated.
N)r r& r( r' rD �fixers_applied)r r r( �contextrD rU r. r
r
r �__init__� s
z
Node.__init__c C s d| j jt| j�| jf S )�)Return a canonical string representation.z
%s(%s, %r))r rL r r r( r! r
r
r �__repr__� s �z
Node.__repr__c C s d� tt| j��S )�k
Return a pretty string representation.
This reproduces the input source exactly.
rC )�join�maprI r( r! r
r
r � __unicode__� s zNode.__unicode__rF c C s | j | jf|j |jfkS �z Compare two nodes for equality.)r r( r r
r
r r � s zNode._eqc C s t | jdd� | jD �| jd�S )�$Return a cloned (deep) copy of self.c S s g | ] }|� � �qS r
)r" )�.0r. r
r
r �
<listcomp> s z Node.clone.<locals>.<listcomp>�rU )rT r r( rU r! r
r
r r" s �z
Node.clonec c s$ | j D ]}|�� E dH q| V dS �z*Return a post-order iterator for the tree.N)r( r# rA r
r
r r# s
zNode.post_orderc c s$ | V | j D ]}|�� E dH q dS �z)Return a pre-order iterator for the tree.N)r( r$ rA r
r
r r$ s
zNode.pre_orderc C s | j s
dS | j d jS )zO
The whitespace and comments preceding this node in the input.
rC r �r( rD r! r
r
r rD s z Node.prefixc C s | j r|| j d _d S �Nr re �r rD r
r
r rD s c C s( | |_ d| j| _ || j|< | �� dS )z�
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N)r' r( r+ r; r
r
r � set_child s
zNode.set_childc C s | |_ | j�||� | �� dS )z�
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N)r' r( �insertr+ r; r
r
r � insert_child* s zNode.insert_childc C s | |_ | j�|� | �� dS )z�
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N)r' r( r* r+ rA r
r
r � append_child3 s zNode.append_child)NNN)rL rM rN rO rW rY r] rR rS rK r r" r# r$ rQ rD �setterrh rj rk r
r
r
r rT � s( �
rT c @ s� e Zd ZdZdZdZdZddg fdd�Zdd� Zd d
� Z e
j d krFe Z d d
� Z
dd� Zdd� Zdd� Zdd� Zedd� �Zejdd� �ZdS )r1 z'Concrete implementation for leaf nodes.rC r Nc C sF |dk r|\| _ \| _| _|| _|| _|dk r4|| _ |dd� | _dS )z�
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
N)�_prefixr2 �columnr �valuerU )r r ro rV rD rU r
r
r rW F s z
Leaf.__init__c C s d| j j| j| jf S )rX z
%s(%r, %r))r rL r ro r! r
r
r rY Y s �z
Leaf.__repr__c C s | j t| j� S )rZ )rD rI ro r! r
r
r r] _ s zLeaf.__unicode__rF c C s | j | jf|j |jfkS r^ )r ro r r
r
r r j s zLeaf._eqc C s$ t | j| j| j| j| jff| jd�S )r_ rb )r1 r ro rD r2 rn rU r! r
r
r r" n s
�z
Leaf.clonec c s
| V d S r? r
r! r
r
r r@ t s z Leaf.leavesc c s
| V dS rc r
r! r
r
r r# w s zLeaf.post_orderc c s
| V dS rd r
r! r
r
r r$ { s zLeaf.pre_orderc C s | j S )zP
The whitespace and comments preceding this token in the input.
)rm r! r
r
r rD s z Leaf.prefixc C s | � � || _d S r? )r+ rm rg r
r
r rD � s )rL rM rN rO rm r2 rn rW rY r] rR rS rK r r" r@ r# r$ rQ rD rl r
r
r
r r1 = s* �
r1 c C sN |\}}}}|s|| j kr<t|�dkr.|d S t|||d�S t|||d�S dS )z�
Convert raw node information to a Node or Leaf instance.
This is passed to the parser driver which calls it whenever a reduction of a
grammar rule produces a new complete node, so that the tree is build
strictly bottom-up.
r r )rV N)Z
number2symbol�lenrT r1 )ZgrZraw_noder ro rV r( r
r
r �convert� s rq c @ sP e Zd ZdZdZdZdZdd� Zdd� Zdd� Z dd d
�Z
dd d �Z d
d� Z dS )� BasePatterna�
A pattern is a tree matching pattern.
It looks for a specific node type (token or symbol), and
optionally for a specific content.
This is an abstract base class. There are three concrete
subclasses:
- LeafPattern matches a single leaf node;
- NodePattern matches a single node (usually non-leaf);
- WildcardPattern matches a sequence of nodes of variable length.
Nc O s
t �| �S )z>Constructor that prevents BasePattern from being instantiated.r r r
r
r r � s zBasePattern.__new__c C sH t | j�| j| jg}|r,|d d kr,|d= qd| jjd�tt|��f S )N���z%s(%s)z, ) r r �contentr r rL r[ r\ �repr)r r r
r
r rY � s zBasePattern.__repr__c C s | S )z�
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
r
r! r
r
r �optimize� s zBasePattern.optimizec C sn | j dk r|j | j krdS | jdk rRd}|dk r4i }| �||�sDdS |rR|�|� |dk rj| jrj||| j< dS )a#
Does this pattern exactly match a node?
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
Default implementation for non-wildcard patterns.
NFT)r rt � _submatch�updater )r r4 �results�rr
r
r �match� s
zBasePattern.matchc C s t |�dkrdS | �|d |�S )z�
Does this pattern exactly match a sequence of nodes?
Default implementation for non-wildcard patterns.
r Fr )rp r{ )r �nodesry r
r
r � match_seq� s zBasePattern.match_seqc c s& i }|r"| � |d |�r"d|fV dS )z}
Generator yielding all matches for this pattern.
Default implementation for non-wildcard patterns.
r r N)r{ )r r| rz r
r
r �generate_matches� s z BasePattern.generate_matches)N)N)
rL rM rN rO r rt r r rY rv r{ r} r~ r
r
r
r rr � s
rr c @ s* e Zd Zddd�Zd dd�Zd
dd�ZdS ) � LeafPatternNc C s& |dk r|dk r|| _ || _|| _dS )ap
Initializer. Takes optional type, content, and name.
The type, if given must be a token type (< 256). If not given,
this matches any *leaf* node; the content may still be required.
The content, if given, must be a string.
If a name is given, the matching node is stored in the results
dict under that key.
N)r rt r )r r rt r r
r
r rW � s
zLeafPattern.__init__c C s t |t�sdS t�| ||�S )z*Override match() to insist on a leaf node.F)r% r1 rr r{ �r r4 ry r
r
r r{
s
zLeafPattern.matchc C s | j |jkS )�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
)rt ro r� r
r
r rw s
zLeafPattern._submatch)NNN)N)N)rL rM rN rW r{ rw r
r
r
r r � s
r c @ s$ e Zd ZdZddd�Zddd�ZdS ) � NodePatternFNc C sP |dk r|dk r:t |�}t|�D ]\}}t|t�r d| _q || _|| _|| _dS )ad
Initializer. Takes optional type, content, and name.
The type, if given, must be a symbol type (>= 256). If the
type is None this matches *any* single node (leaf or not),
except if content is not None, in which it only matches
non-leaf nodes that also match the content pattern.
The content, if not None, must be a sequence of Patterns that
must match the node's children exactly. If the content is
given, the type must not be None.
If a name is given, the matching node is stored in the results
dict under that key.
NT)r& r7 r% �WildcardPattern� wildcardsr rt r )r r rt r r8 �itemr
r
r rW $ s
zNodePattern.__init__c C s� | j rHt| j|j�D ].\}}|t|j�kr|dk r<|�|� dS qdS t| j�t|j�kr`dS t| j|j�D ]\}}|�||�sn dS qndS )r� NTF)r� r~ rt r( rp rx �zipr{ )r r4 ry �crz �
subpatternr< r
r
r rw A s
zNodePattern._submatch)NNN)N)rL rM rN r� rW rw r
r
r
r r� s
r� c @ s^ e Zd ZdZddedfdd�Zdd� Zddd �Zdd
d �Zd d
� Z dd� Z
dd� Z dd� Z dS )r� a
A wildcard pattern can match zero or more nodes.
This has all the flexibility needed to implement patterns like:
.* .+ .? .{m,n}
(a b c | d e | f)
(...)* (...)+ (...)? (...){m,n}
except it always uses non-greedy matching.
Nr c C s< |dk r t tt |��}|D ]}q|| _|| _|| _|| _dS )a�
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optional minimum number of times to match, default 0
max: optional maximum number of times to match, default HUGE
name: optional name assigned to this match
[*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is
equivalent to (a b c | d e | f g h); if content is None,
this is equivalent to '.' in regular expression terms.
The min and max parameters work as follows:
min=0, max=maxint: .*
min=1, max=maxint: .+
min=0, max=1: .?
min=1, max=1: .
If content is not None, replace the dot with the parenthesized
list of alternatives, e.g. (a b c | d e | f g h)*
N)�tupler\ rt �min�maxr )r rt r� r� r �altr
r
r rW k s zWildcardPattern.__init__c C s� d}| j dk r<t| j �dkr<t| j d �dkr<| j d d }| jdkr�| jdkr�| j dkrft| jd�S |dk r�| j|jkr�|�� S | jdkr�t|t�r�|jdkr�| j|jkr�t|j | j|j | j|j |j�S | S )z+Optimize certain stacked wildcard patterns.Nr r )r ) rt rp r� r� r� r rv r% r� )r r� r
r
r rv � s.
��
�
�
�zWildcardPattern.optimizec C s | � |g|�S )z'Does this pattern exactly match a node?)r} r� r
r
r r{ � s zWildcardPattern.matchc C sP | � |�D ]@\}}|t|�kr
|dk rD|�|� | jrDt|�|| j< dS q
dS )z4Does this pattern exactly match a sequence of nodes?NTF)r~ rp rx r r& )r r| ry r� rz r
r
r r} � s
zWildcardPattern.match_seqc c s, | j dkrTt| jdtt|�| j� �D ]*}i }| jrF|d|� || j< ||fV q&n�| jdkrl| �|�V n�ttd�r�tj }t
� t_ z�z<| � |d�D ]*\}}| jr�|d|� || j< ||fV q�W nL t k
�r | �
|�D ]*\}}| jr�|d|� || j< ||fV q�Y nX W 5 ttd��r&|t_ X dS )a"
Generator yielding matches for a sequence of nodes.
Args:
nodes: sequence of nodes
Yields:
(count, results) tuples where:
count: the match comprises nodes[:count];
results: dict containing named submatches.
Nr Z bare_name� getrefcountr )rt �ranger� rp r� r �_bare_name_matches�hasattrrR �stderrr �_recursive_matches� RuntimeError�_iterative_matches)r r| �countrz Z save_stderrr
r
r r~ � s.
z WildcardPattern.generate_matchesc c s� t |�}d| jkr di fV g }| jD ]0}t||�D ] \}}||fV |�||f� q4q&|r�g }|D ]�\}} ||k rd|| jkrd| jD ]`}t|||d� �D ]H\}
} |
dkr�i }|�| � |�| � ||
|fV |�||
|f� q�q�qd|}qXdS )z(Helper to iteratively yield the matches.r N)rp r� rt r~ r* r� rx ) r r| Znodelenry r� r� rz Z new_results�c0�r0�c1�r1r
r
r r� � s*
z"WildcardPattern._iterative_matchesc C sp d}i }d}t |�}|sV||k rVd}| jD ](}|d �|| |�r*|d7 }d} qq*q|d|� || j< ||fS )z(Special optimized matcher for bare_name.r FTr N)rp rt r{ r )r r| r� rz Zdoner� Zleafr
r
r r� � s
z"WildcardPattern._bare_name_matchesc c s� || j krdi fV || jk r�| jD ]`}t||�D ]P\}}| �||d� |d �D ].\}}i }|�|� |�|� || |fV qRq2q$dS )z(Helper to recursively yield the matches.r Nr )r� r� rt r~ r� rx ) r r| r� r� r� r� r� r� rz r
r
r r�
s
z"WildcardPattern._recursive_matches)N)N)
rL rM rN rO �HUGErW rv r{ r} r~ r� r� r� r
r
r
r r� ] s #
- r� c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �NegatedPatternNc C s |dk r|| _ dS )a
Initializer.
The argument is either a pattern or None. If it is None, this
only matches an empty sequence (effectively '$' in regex
lingo). If it is not None, this matches whenever the argument
pattern doesn't have any matches.
N)rt )r rt r
r
r rW s zNegatedPattern.__init__c C s dS )NFr
r3 r
r
r r{ ( s zNegatedPattern.matchc C s t |�dkS rf )rp )r r| r
r
r r} , s zNegatedPattern.match_seqc c sJ | j d kr"t|�dkrFdi fV n$| j �|�D ] \}} d S di fV d S rf )rt rp r~ )r r| r� rz r
r
r r~ 0 s
z NegatedPattern.generate_matches)N)rL rM rN rW r{ r} r~ r
r
r
r r� s
r� c c s� | sdi fV n|| d | dd� }}|� |�D ]Z\}}|sH||fV q0t |||d� �D ].\}}i }|�|� |�|� || |fV qZq0dS )aR
Generator yielding matches for a sequence of patterns and nodes.
Args:
patterns: a sequence of patterns
nodes: a sequence of nodes
Yields:
(count, results) tuples where:
count: the entire sequence of patterns matches nodes[:count];
results: dict containing named submatches.
r r N)r~ rx ) Zpatternsr| �p�restr� r� r� r� rz r
r
r r~ < s
r~ )rO �
__author__rR �ior r� r r r r rT r1 rq rr r r� r� r� r~ r
r
r
r �<module> s$
1nNV,= =# __pycache__/btm_matcher.cpython-38.pyc 0000644 00000011417 15053244165 0013702 0 ustar 00 U
e5d� � @ sl d Z dZddlZddlZddlmZ ddlmZ ddlm Z G dd � d e
�Z G d
d � d e
�Z i a
d d
� ZdS )a� A bottom-up tree matching algorithm implementation meant to speed
up 2to3's matching process. After the tree patterns are reduced to
their rarest linear path, a linear Aho-Corasick automaton is
created. The linear automaton traverses the linear paths from the
leaves to the root of the AST and returns a set of nodes for further
matching. This reduces significantly the number of candidate nodes.z+George Boutsioukis <gboutsioukis@gmail.com>� N)� defaultdict� )�pytree)� reduce_treec @ s e Zd ZdZe�� Zdd� ZdS )�BMNodez?Class for a node of the Aho-Corasick automaton used in matchingc C s" i | _ g | _ttj�| _d| _d S )N� )�transition_table�fixers�nextr �count�id�content��self� r �+/usr/lib64/python3.8/lib2to3/btm_matcher.py�__init__ s zBMNode.__init__N)�__name__�
__module__� __qualname__�__doc__� itertoolsr r r r r r r s r c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd S )
�
BottomMatcherzgThe main matcher class. After instantiating the patterns should
be added using the add_fixer methodc C s0 t � | _t� | _| jg| _g | _t�d�| _d S )NZRefactoringTool) �set�matchr �rootZnodesr �loggingZ getLoggerZloggerr r r r r s
zBottomMatcher.__init__c C sH | j �|� t|j�}|�� }| j|| jd�}|D ]}|j �|� q2dS )z�Reduces a fixer's pattern tree to a linear path and adds it
to the matcher(a common Aho-Corasick automaton). The fixer is
appended on the matching states and called when they are
reached��startN)r �appendr Z pattern_treeZget_linear_subpattern�addr )r �fixerZtreeZlinear� match_nodesZ
match_noder r r � add_fixer% s
zBottomMatcher.add_fixerc C s� |s
|gS t |d t�r`g }|d D ]6}| j||d�}|D ] }|�| �|dd� |�� q:q$|S |d |jkr�t� }||j|d < n|j|d }|dd� r�| j|dd� |d�}n|g}|S dS )z5Recursively adds a linear pattern to the AC automatonr r r N)�
isinstance�tupler �extendr r )r �patternr r" � alternativeZ end_nodes�endZ next_noder r r r 1 s" zBottomMatcher.addc C s� | j }tt�}|D ]�}|}|rd|_|jD ]$}t|tj�r*|jdkr*d|_ qPq*|j dkrb|j}n|j }||j
kr�|j
| }|j D ]}|| � |� q�nH| j }|j
dk r�|j
jr�q||j
kr�|j
| }|j D ]}|| � |� q�|j
}qq|S )au The main interface with the bottom matcher. The tree is
traversed from the bottom using the constructed
automaton. Nodes are only checked once as the tree is
retraversed. When the automaton fails, we give it one more
shot(in case the above tree matches as a whole with the
rejected leaf), then we break for the next leaf. There is the
special case of multiple arguments(see code comments) where we
recheck the nodes
Args:
The leaves of the AST tree to be matched
Returns:
A dictionary of node matches with fixers as the keys
T�;Fr N)r r �listZ was_checkedZchildrenr$ r ZLeaf�value�typer r r �parent) r ZleavesZcurrent_ac_nodeZresultsZleafZcurrent_ast_nodeZchildZ
node_tokenr! r r r �runS s8
�
zBottomMatcher.runc s* t d� � fdd�� � | j� t d� dS )z<Prints a graphviz diagram of the BM automaton(for debugging)z
digraph g{c sZ | j �� D ]J}| j | }td| j|jt|�t|j�f � |dkrLt|j� � |� q
d S )Nz%d -> %d [label=%s] //%sr )r �keys�printr � type_repr�strr r
)ZnodeZ subnode_keyZsubnode��
print_noder r r5 � s
�
z*BottomMatcher.print_ac.<locals>.print_node�}N)r1 r r r r4 r �print_ac� s
zBottomMatcher.print_acN) r r r r r r# r r/ r7 r r r r r s "8r c C sD t s8ddlm} |j�� D ] \}}t|�tkr|t |< qt �| | �S )Nr )�python_symbols)� _type_reprsZpygramr8 �__dict__�itemsr- �int�
setdefault)Ztype_numr8 �name�valr r r r2 � s
r2 )r �
__author__r r � collectionsr r r Z btm_utilsr �objectr r r9 r2 r r r r �<module> s __pycache__/pygram.cpython-38.pyc 0000644 00000002356 15053244165 0012716 0 ustar 00 U
e5d � @ s� d Z ddlZddlmZ ddlmZ ddlmZ ej�ej� e
�d�Z ej�ej� e
�d�Z G d d
� d
e
�Ze�d e �Zee�Ze�� Zejd = e�� Zejd
= e�d e �Zee�ZdS )z&Export the Python grammar and symbols.� N� )�token)�driver)�pytreez Grammar.txtzPatternGrammar.txtc @ s e Zd Zdd� ZdS )�Symbolsc C s$ |j �� D ]\}}t| ||� q
dS )z�Initializer.
Creates an attribute for each grammar symbol (nonterminal),
whose value is the symbol's type (an int >= 256).
N)Z
symbol2number�items�setattr)�selfZgrammar�nameZsymbol� r �&/usr/lib64/python3.8/lib2to3/pygram.py�__init__ s zSymbols.__init__N)�__name__�
__module__� __qualname__r
r r r r r s r Zlib2to3�print�exec)�__doc__�osZpgen2r r � r �path�join�dirname�__file__Z
_GRAMMAR_FILEZ_PATTERN_GRAMMAR_FILE�objectr Zload_packaged_grammarZpython_grammarZpython_symbols�copyZ!python_grammar_no_print_statement�keywordsZ*python_grammar_no_print_and_exec_statementZpattern_grammarZpattern_symbolsr r r r �<module> s" � __pycache__/patcomp.cpython-38.opt-2.pyc 0000644 00000011433 15053244165 0014016 0 ustar 00 U
e5d� � @ s� d Z ddlZddlmZmZmZmZmZmZ ddl m
Z
ddl m Z G dd� de �Z
d d
� ZG d d � d e�Zejejejdd
�Zdd� Zdd� Zdd� ZdS )z#Guido van Rossum <guido@python.org>� N� )�driver�literals�token�tokenize�parse�grammar)�pytree)�pygramc @ s e Zd ZdS )�PatternSyntaxErrorN)�__name__�
__module__� __qualname__� r r �'/usr/lib64/python3.8/lib2to3/patcomp.pyr s r c c sL t jt jt jh}t�t�| �j�}|D ] }|\}}}}}||kr&|V q&d S �N) r �NEWLINE�INDENT�DEDENTr �generate_tokens�io�StringIO�readline) �input�skip�tokensZ quintuple�type�value�start�endZ line_textr r r �tokenize_wrapper s r c @ s: e Zd Zd
dd�Zddd�Zdd� Zdd d
�Zd d � ZdS )�PatternCompilerNc C sZ |d krt j| _t j| _nt�|�| _t �| j�| _t j| _ t j
| _ tj | jt
d�| _d S )N)Zconvert)r
Zpattern_grammarr Zpattern_symbols�symsr Z load_grammarZSymbolsZpython_grammarZ pygrammarZpython_symbols�pysymsZDriver�pattern_convert)�selfZ grammar_filer r r �__init__( s
zPatternCompiler.__init__Fc
C sp t |�}z| jj||d�}W n2 tjk
rN } ztt|��d �W 5 d }~X Y nX |rb| �|�|fS | �|�S d S )N)�debug)r r Z parse_tokensr Z
ParseErrorr �str� compile_node)r% r r' Z with_treer �root�er r r �compile_pattern7 s z PatternCompiler.compile_patternc
sV |j � jjkr|jd }|j � jjkrz� fdd�|jd d d� D �}t|�dkrX|d S tjdd� |D �ddd�}|�� S |j � jj krʇ fdd�|jD �}t|�dkr�|d S tj|gddd�}|�� S |j � jj
kr�� � |jdd � �}t� |�}|�� S d }|j}t|�d k�r>|d j t
jk�r>|d j}|dd � }d }t|�dk�rx|d
j � jjk�rx|d
}|d d
� }� � ||�}|d k �r>|j} | d }
|
j t
jk�r�d} tj} nX|
j t
jk�r�d} tj} n>|
j t
jk�r� �| d � } } t| �d k�r� �| d �} n | dk�s"| dk�r>|�� }tj|gg| | d�}|d k �rN||_|�� S ) Nr c s g | ]}� � |��qS r �r) ��.0Zch�r% r r �
<listcomp>O s z0PatternCompiler.compile_node.<locals>.<listcomp>� r c S s g | ]
}|g�qS r r )r/ �ar r r r1 R s ��min�maxc s g | ]}� � |��qS r r- r. r0 r r r1 V s � ���� )r r" ZMatcher�childrenZ Alternatives�lenr �WildcardPattern�optimizeZ AlternativeZ NegatedUnit�
compile_basicZNegatedPatternr �EQUALr ZRepeater�STARZHUGE�PLUS�LBRACE�get_int�name)
r% �nodeZalts�pZunits�patternrD �nodes�repeatr: Zchildr5 r6 r r0 r r) C s^
"
z PatternCompiler.compile_nodec C s@ |d }|j tjkr4tt�|j��}t�t |�|�S |j tj
kr�|j}|� � r�|t krbt
d| ��|dd � rvt
d��t�t | �S |dkr�d }n,|�d�s�t| j|d �}|d kr�t
d| ��|dd � r�| �|d jd �g}nd }t�||�S nH|jdk�r| �|d �S |jd k�r<| �|d �}tj|ggddd
�S d S ) Nr zInvalid token: %rr z Can't have details for token�any�_zInvalid symbol: %r�(�[r4 )r r �STRINGr( r Z
evalStringr r Z LeafPattern�_type_of_literal�NAME�isupper� TOKEN_MAPr �
startswith�getattrr# r) r: Z NodePatternr< )r% rH rI rE r r Zcontent�
subpatternr r r r> � s8
z PatternCompiler.compile_basicc C s
t |j�S r )�intr )r% rE r r r rC � s zPatternCompiler.get_int)N)FF)N)r r
r r& r, r) r> rC r r r r r! & s
G
#r! )rP rN �NUMBERZTOKENc C s. | d � � rtjS | tjkr&tj| S d S d S )Nr )�isalphar rP r Zopmap)r r r r rO � s
rO c C s> |\}}}}|s|| j kr*tj|||d�S tj|||d�S d S )N)�context)Z
number2symbolr ZNodeZLeaf)r Z
raw_node_infor r rY r: r r r r$ � s r$ c C s t � �| �S r )r! r, )rG r r r r, � s r, )�
__author__r Zpgen2r r r r r r � r r
� Exceptionr r �objectr! rP rN rW rR rO r$ r, r r r r �<module> s
� __pycache__/__init__.cpython-38.opt-1.pyc 0000644 00000000203 15053244165 0014102 0 ustar 00 U
e5d � @ s d S )N� r r r �(/usr/lib64/python3.8/lib2to3/__init__.py�<module> � __pycache__/main.cpython-38.pyc 0000644 00000020642 15053244165 0012341 0 ustar 00 U
e5d�- � @ s� d Z ddlmZmZ ddlZddlZddlZddlZddlZddl Z ddl
m Z dd� Z G dd � d e j
�Zd
d � Zdd d
�ZdS )z
Main program for 2to3.
� )�with_statement�print_functionN� )�refactorc C s( | � � } |� � }tj| |||dddd�S )z%Return a unified diff of two strings.z
(original)z (refactored)� )Zlineterm)�
splitlines�difflibZ unified_diff)�a�b�filename� r �$/usr/lib64/python3.8/lib2to3/main.py�
diff_texts s �r c s> e Zd ZdZd � fdd� Zdd� Z� fdd�Zd d
� Z� ZS ) �StdoutRefactoringToola2
A refactoring tool that can avoid overwriting its input files.
Prints output to stdout.
Output files can optionally be written to a different directory and or
have an extra file suffix appended to their name for use in situations
where you do not want to replace the input files.
r c sP || _ || _|r&|�tj�s&|tj7 }|| _|| _|| _tt | ��
|||� dS )aF
Args:
fixers: A list of fixers to import.
options: A dict with RefactoringTool configuration.
explicit: A list of fixers to run even if they are explicit.
nobackups: If true no backup '.bak' files will be created for those
files that are being refactored.
show_diffs: Should diffs of the refactoring be printed to stdout?
input_base_dir: The base directory for all input files. This class
will strip this path prefix off of filenames before substituting
it with output_dir. Only meaningful if output_dir is supplied.
All files processed by refactor() must start with this path.
output_dir: If supplied, all converted files will be written into
this directory tree instead of input_base_dir.
append_suffix: If supplied, all files output by this tool will have
this appended to their filename. Useful for changing .py to
.py3 for example by passing append_suffix='3'.
N) � nobackups�
show_diffs�endswith�os�sep�_input_base_dir� _output_dir�_append_suffix�superr �__init__) �selfZfixers�options�explicitr r �input_base_dir�
output_dir�
append_suffix�� __class__r r
r $ s
z StdoutRefactoringTool.__init__c O s* | j �|||f� | jj|f|�|� d S )N)�errors�append�logger�error)r �msg�args�kwargsr r r
� log_errorA s z StdoutRefactoringTool.log_errorc
sz |}| j rH|�| j�r6tj�| j |t| j�d � �}ntd|| jf ��| jrX|| j7 }||kr�tj� |�}tj�
|�s�|r�t� |� | � d||� | j
�s2|d }tj�|�r�zt�|� W n. tk
r� } z| � d|� W 5 d }~X Y nX zt�||� W n2 tk
�r0 } z| � d||� W 5 d }~X Y nX tt| �j} | ||||� | j
�s`t�||� ||k�rvt�||� d S )Nz5filename %s does not start with the input_base_dir %szWriting converted %s to %s.z.bakzCan't remove backup %szCan't rename %s to %s)r �
startswithr r �path�join�len�
ValueErrorr �dirname�isdir�makedirs� log_messager �lexists�remove�OSError�renamer r �
write_file�shutilZcopymode)
r Znew_textr Zold_text�encodingZ
orig_filenamer Zbackup�err�writer r r
r7 E sJ
� ��
�
z StdoutRefactoringTool.write_filec C s� |r| � d|� n�| � d|� | jr�t|||�}zP| jd k rl| j�" |D ] }t|� qHtj�� W 5 Q R X n|D ] }t|� qpW n$ tk
r� t d|f � Y d S X d S )NzNo changes to %sz
Refactored %sz+couldn't encode %s's diff for your terminal)
r2 r r Z output_lock�print�sys�stdout�flush�UnicodeEncodeError�warn)r �old�newr ZequalZ
diff_lines�liner r r
� print_outputl s$
�z"StdoutRefactoringTool.print_output)r r r ) �__name__�
__module__� __qualname__�__doc__r r) r7 rE �
__classcell__r r r r
r s
� 'r c C s t d| f tjd� d S )Nz WARNING: %s��file)r< r= �stderr)r& r r r
rA � s rA c
s t jdd�}|jddddd� |jdd d
g d d � |jd
dddddd� |jddd
g dd � |jddddd� |jdddd d� |jd d dd d� |jd dd!d� |jd"d#dd$d� |jd%d&dd'd(d � |jd)d*dd+d,d-d.� |jd/d0dd1d� |jd2dd+d,d3d.� d'}i }|�|�\}}|j�r@d4|d5< |j�s:td6� d4|_|j�rZ|j�sZ|� d7� |j
�rt|j�st|� d8� |j�s�|j �r�td9� |j�s�|j�r�|� d:� |j �r�t
d;� t�� �D ]}t
|� �q�|�s�d<S |�s t
d=tjd>� t
d?tjd>� d@S dA|k�r(d4}|j�r(t
dBtjd>� d@S |j�r8d4|dC< |j�rFtjntj}tjdD|dE� t�dF�}tt�� ��} t� fdGdH�|jD ��}
t� } |j �r�d'} |j D ](}
|
dIk�r�d4} n| � � dJ |
� �q�| �r�| � | �n| }n
| � | �}|� |
�}t j!�"|�}|�r0|�#t j$��s0t j!�%|��s0t j!�&|�}|j�rT|�'t j$�}|�(dK|j|� t)t*|�|t*| �|j|j ||j|j
dL�}|j+�s�|�r�|�,� nTz|�||j|j-|j.� W n8 tj/k
�r� |j.dk�s�t0�t
dMtjd>� Y dS X |�1� t2t3|j+��S )Nz�Main program.
Args:
fixer_pkg: the name of a package where the fixers are located.
args: optional; a list of command line arguments. If omitted,
sys.argv[1:] is used.
Returns a suggested exit status (0, 1, 2).
z2to3 [options] file|dir ...)Zusagez-dz--doctests_only�
store_truezFix up doctests only)�action�helpz-fz--fixr# z1Each FIX specifies a transformation; default: all)rO �defaultrP z-jz --processesZstorer �intzRun 2to3 concurrently)rO rQ �typerP z-xz--nofixz'Prevent a transformation from being runz-lz --list-fixesz List available transformationsz-pz--print-functionz0Modify the grammar so that print() is a functionz-vz --verbosezMore verbose loggingz
--no-diffsz#Don't show diffs of the refactoringz-wz--writezWrite back modified filesz-nz --nobackupsFz&Don't write backups for modified filesz-oz --output-dir�strr zXPut output files in this directory instead of overwriting the input files. Requires -n.)rO rS rQ rP z-Wz--write-unchanged-fileszYAlso write files even if no changes were required (useful with --output-dir); implies -w.z --add-suffixzuAppend this string to all output filenames. Requires -n if non-empty. ex: --add-suffix='3' will generate .py3 files.T�write_unchanged_filesz&--write-unchanged-files/-W implies -w.z%Can't use --output-dir/-o without -n.z"Can't use --add-suffix without -n.z@not writing files and not printing diffs; that's not very usefulzCan't use -n without -wz2Available transformations for the -f/--fix option:r z1At least one file or directory argument required.rK zUse --help to show usage.� �-zCan't write to stdin.r z%(name)s: %(message)s)�format�levelz lib2to3.mainc 3 s | ]}� d | V qdS )�.fix_Nr )�.0�fix�� fixer_pkgr r
� <genexpr>� s zmain.<locals>.<genexpr>�allrZ z7Output in %r will mirror the input directory %r layout.)r r r z+Sorry, -j isn't supported on this platform.)4�optparseZ OptionParserZ
add_option�
parse_argsrU r; rA r r r% Z
add_suffixZno_diffsZ
list_fixesr< r Zget_all_fix_namesr= rM r �verbose�logging�DEBUG�INFOZ basicConfigZ getLogger�setZget_fixers_from_packageZnofixr\ �add�union�
differencer r+ � commonprefixr r r0 r/ �rstrip�infor �sortedr" �refactor_stdinZ
doctests_onlyZ processesZMultiprocessingUnsupported�AssertionErrorZ summarizerR �bool)r^ r' �parserro �flagsr ZfixnamerY r$ Z avail_fixesZunwanted_fixesr Z all_presentr\ Z requestedZ fixer_namesr Zrtr r] r
�main� s�
� � � �
�
�
��
� � �
� �
� � �
��rt )N)rI Z
__future__r r r= r r rd r8 ra r r r ZMultiprocessRefactoringToolr rA rt r r r r
�<module> s g __pycache__/__init__.cpython-38.pyc 0000644 00000000203 15053244165 0013143 0 ustar 00 U
e5d � @ s d S )N� r r r �(/usr/lib64/python3.8/lib2to3/__init__.py�<module> � __pycache__/patcomp.cpython-38.pyc 0000644 00000013011 15053244165 0013050 0 ustar 00 U
e5d� � @ s� d Z dZddlZddlmZmZmZmZmZm Z ddl
m Z ddl
m Z G dd � d e
�Zd
d � ZG d d
� d
e�Zejejejdd�Zdd� Zdd� Zdd� ZdS )z�Pattern compiler.
The grammar is taken from PatternGrammar.txt.
The compiler compiles a pattern to a pytree.*Pattern instance.
z#Guido van Rossum <guido@python.org>� N� )�driver�literals�token�tokenize�parse�grammar)�pytree)�pygramc @ s e Zd ZdS )�PatternSyntaxErrorN)�__name__�
__module__� __qualname__� r r �'/usr/lib64/python3.8/lib2to3/patcomp.pyr s r c c sL t jt jt jh}t�t�| �j�}|D ] }|\}}}}}||kr&|V q&dS )z6Tokenizes a string suppressing significant whitespace.N) r �NEWLINE�INDENT�DEDENTr �generate_tokens�io�StringIO�readline) �input�skip�tokensZ quintuple�type�value�start�endZ line_textr r r �tokenize_wrapper s r c @ s: e Zd Zd
dd�Zddd�Zdd� Zdd d
�Zd d � ZdS )�PatternCompilerNc C sZ |dkrt j| _t j| _nt�|�| _t �| j�| _t j| _ t j
| _ tj | jt
d�| _dS )z^Initializer.
Takes an optional alternative filename for the pattern grammar.
N)Zconvert)r
Zpattern_grammarr Zpattern_symbols�symsr Z load_grammarZSymbolsZpython_grammarZ pygrammarZpython_symbols�pysymsZDriver�pattern_convert)�selfZ grammar_filer r r �__init__( s
zPatternCompiler.__init__Fc
C sp t |�}z| jj||d�}W n2 tjk
rN } ztt|��d�W 5 d}~X Y nX |rb| �|�|fS | �|�S dS )z=Compiles a pattern string to a nested pytree.*Pattern object.)�debugN)r r Z parse_tokensr Z
ParseErrorr �str� compile_node)r$ r r& Z with_treer �root�er r r �compile_pattern7 s z PatternCompiler.compile_patternc
s� |j � jjkr|jd }|j � jjkrz� fdd�|jddd� D �}t|�dkrX|d S tjdd� |D �ddd�}|�� S |j � jj krʇ fd d�|jD �}t|�dkr�|d S tj|gddd�}|�� S |j � jj
kr�� � |jdd� �}t� |�}|�� S |j � jj
k�st�d}|j}t|�d
k�rR|d j tjk�rR|d j}|dd� }d}t|�dk�r�|d j � jjk�r�|d }|dd � }� � ||�}|dk �r�|j � jjk�s�t�|j} | d }
|
j tjk�r�d} tj} n�|
j tjk�r�d} tj} np|
j tjk�r^| d j tjk�s t�t| �d k�s.t�� �| d � } } t| �d
k�rh� �| d
�} n
d�sht�| dk�s|| dk�r�|�� }tj|gg| | d�}|dk �r�||_|�� S )zXCompiles a node, recursively.
This is one big switch on the node type.
r c s g | ]}� � |��qS r �r( ��.0Zch�r$ r r �
<listcomp>O s z0PatternCompiler.compile_node.<locals>.<listcomp>N� r c S s g | ]
}|g�qS r r )r. �ar r r r0 R s ��min�maxc s g | ]}� � |��qS r r, r- r/ r r r0 V s � ���)r6 � r8 F)r r! ZMatcher�childrenZ Alternatives�lenr �WildcardPattern�optimizeZ AlternativeZ NegatedUnit�
compile_basicZNegatedPatternZUnit�AssertionErrorr �EQUALr ZRepeater�STARZHUGE�PLUS�LBRACE�RBRACE�get_int�name)
r$ �nodeZalts�pZunits�patternrE �nodes�repeatr9 Zchildr4 r5 r r/ r r( C sh
"
z PatternCompiler.compile_nodec C sn t |�dkst�|d }|jtjkrDtt�|j��}t �
t |�|�S |jtj k�r|j}|�
� r�|tkrttd| ��|dd � r�td��t �
t| �S |dkr�d }n,|�d�s�t| j|d �}|d kr�td| ��|dd � r�| �|d jd �g}nd }t �||�S nV|jdk�r | �|d �S |jd k�r\|d k�s:t�| �|d �}t j|ggddd
�S d �sjt|��d S ) Nr r zInvalid token: %rz Can't have details for token�any�_zInvalid symbol: %r�(�[r3 F)r: r> r r �STRINGr' r Z
evalStringr r Z LeafPattern�_type_of_literal�NAME�isupper� TOKEN_MAPr �
startswith�getattrr" r( r9 Z NodePatternr; )r$ rI rJ rF r r Zcontent�
subpatternr r r r= � s<
z PatternCompiler.compile_basicc C s |j tjkst�t|j�S �N)r r �NUMBERr> �intr )r$ rF r r r rD � s zPatternCompiler.get_int)N)FF)N)r r
r r% r+ r( r= rD r r r r r & s
G
#r )rQ rO rX ZTOKENc C s. | d � � rtjS | tjkr&tj| S d S d S )Nr )�isalphar rQ r Zopmap)r r r r rP � s
rP c C s> |\}}}}|s|| j kr*tj|||d�S tj|||d�S dS )z9Converts raw node information to a Node or Leaf instance.)�contextN)Z
number2symbolr ZNodeZLeaf)r Z
raw_node_infor r r[ r9 r r r r# � s r# c C s t � �| �S rW )r r+ )rH r r r r+ � s r+ )�__doc__�
__author__r Zpgen2r r r r r r � r r
� Exceptionr r �objectr rQ rO rX rS rP r# r+ r r r r �<module> s"
� __pycache__/btm_utils.cpython-38.opt-1.pyc 0000644 00000014010 15053244165 0014346 0 ustar 00 U
e5d�& � @ s| d Z ddlmZ ddlmZmZ ddlmZmZ eZ eZ
ej Z eZ
dZdZdZG dd � d e�Zdd d �Zd
d� Zdd� Zd
S )z0Utility functions used by the btm_matcher module� )�pytree)�grammar�token)�pattern_symbols�python_symbols���������c @ s: e Zd ZdZd
dd�Zdd� Zdd� Zd d
� Zd d � ZdS )�MinNodez�This class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatternsNc C s. || _ || _g | _d| _d | _g | _g | _d S )NF)�type�name�children�leaf�parent� alternatives�group)�selfr r � r �)/usr/lib64/python3.8/lib2to3/btm_utils.py�__init__ s zMinNode.__init__c C s t | j�d t | j� S )N� )�strr r )r r r r �__repr__ s zMinNode.__repr__c C s� | }g }|r�|j tkr^|j�|� t|j�t|j�krRt|j�g}g |_|j}qn |j}d}q�|j tkr�|j �|� t|j �t|j�kr�t
|j �}g |_ |j}qn |j}d}q�|j t j kr�|j
r�|�|j
� n |�|j � |j}q|S )z�Internal method. Returns a characteristic path of the
pattern tree. This method must be run for all leaves until the
linear subpatterns are merged into a singleN)r �TYPE_ALTERNATIVESr �append�lenr
�tupler �
TYPE_GROUPr � get_characteristic_subpattern� token_labels�NAMEr )r �node�subpr r r � leaf_to_root! s8
zMinNode.leaf_to_rootc C s& | � � D ]}|�� }|r| S qdS )a� Drives the leaf_to_root method. The reason that
leaf_to_root must be run multiple times is because we need to
reject 'group' matches; for example the alternative form
(a | b c) creates a group [b c] that needs to be matched. Since
matching multiple linear patterns overcomes the automaton's
capabilities, leaf_to_root merges each group into a single
choice based on 'characteristic'ity,
i.e. (a|b c) -> (a|b) if b more characteristic than c
Returns: The most 'characteristic'(as defined by
get_characteristic_subpattern) path for the compiled pattern
tree.
N)�leavesr# )r �lr" r r r �get_linear_subpatternK s z MinNode.get_linear_subpatternc c s* | j D ]}|�� E dH q| j s&| V dS )z-Generator that returns the leaves of the treeN)r
r$ )r �childr r r r$ ` s
zMinNode.leaves)NN) �__name__�
__module__� __qualname__�__doc__r r r# r& r$ r r r r r
s
*r
Nc
C s� d}| j tjkr| jd } | j tjkr�t| j�dkrFt| jd |�}nFttd�}| jD ]4}| j� |�d rlqVt||�}|dk rV|j�
|� qV�n| j tj kr�t| j�dkr�tt d�}| jD ] }t||�}|r�|j�
|� q�|js�d}nt| jd |�}�n�| j tj
k�r�t| jd tj��r>| jd jdk�r>t| jd |�S t| jd tj��rd| jd jdk�s�t| j�dk�r�t| jd d��r�| jd jdk�r�dS d }d}d}d
}d} d
}
| jD ]d}|j tjk�r�d
}|}n*|j tjk�r�d }|} n|j tjk�r |}t|d��r�|jd k�r�d }
�q�|
�rT| jd } t| d��r^| jdk�r^| jd } n
| jd } | j tjk�r�| jd
k�r�ttd�}n4tt| j��r�ttt| j�d�}nttt| j�d�}n\| j tjk�r�| j�d�} | t k�r�tt | d�}nttj| d�}n| j tjk�rt||�}|�rL| jd jdk�r4d}n| jd jdk�rHnt �|�r�|dk �r�|jdd� D ]&}t||�}|dk �rj|j�
|� �qj|�r�||_ |S )z�
Internal function. Reduces a compiled pattern tree to an
intermediate representation suitable for feeding the
automaton. This also trims off any optional pattern elements(like
[a], a*).
N� � )r r �(�[�valueTF�=� �any�')r r �*�+r ) r �symsZMatcherr
Z Alternativesr � reduce_treer
r �indexr Z Alternativer ZUnit�
isinstancer ZLeafr0 �hasattrZDetailsZRepeaterr r �TYPE_ANY�getattr�pysyms�STRING�strip�tokens�NotImplementedErrorr )
r! r Znew_noder' Zreducedr Z details_nodeZalternatives_nodeZ has_repeaterZ
repeater_nodeZhas_variable_nameZ name_leafr r r r r8 g s�
�� ���
r8 c s� t | t�s| S t| �dkr"| d S g }g }dddddg�g }d� | D ]d}tt|d d
� ��rDtt|� fd d
���r||�|� qDtt|�fd d
���r�|�|� qD|�|� qD|r�|} n|r�|} n|r�|} t| td
�S )z�Picks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
r r, �in�for�if�not�Nonez[]().,:c S s t | �tkS �N)r r ��xr r r �<lambda>� � z/get_characteristic_subpattern.<locals>.<lambda>c s t | t�o| � kS rH �r: r rI )� common_charsr r rK rL c s t | t�o| � kS rH rM rI )� common_namesr r rK rL )�key)r: �listr r3 �rec_testr �max)Z subpatternsZsubpatterns_with_namesZ subpatterns_with_common_namesZ subpatterns_with_common_chars�
subpatternr )rN rO r r � s6
�
� r c c s8 | D ].}t |ttf�r(t||�E dH q||�V qdS )zPTests test_func on all items of sequence and items of included
sub-iterablesN)r: rQ r rR )ZsequenceZ test_funcrJ r r r rR s rR )N)r+ � r Zpgen2r r Zpygramr r r7 r> ZopmaprA r r< r r �objectr
r8 r rR r r r r �<module> s W
% __pycache__/refactor.cpython-38.pyc 0000644 00000047732 15053244165 0013233 0 ustar 00 U
e5dk � @ s d Z dZddlZddlZddlZddlZddlZddlZddlZddl m
Z
ddl m Z m
Z
mZ ddlmZ ddlmZmZ dd lmZ d!d d �ZG d
d� de�Zdd� Zdd� Zdd� Zdd� Z dd� Z G dd� de�Z G dd � d e �Z G d d � d e�Z!G d d � d e �Z"dS )"z�Refactoring framework.
Used as a main program, this can refactor any number of files and/or
recursively descend down directories. Imported as a module, this
provides infrastructure to write your own refactoring tool.
z#Guido van Rossum <guido@python.org>� N)�chain� )�driver�tokenize�token)� find_root)�pytree�pygram)� btm_matcherTc C sT t | g g dg�}g }t�|j�D ].\}}}|�d�r |rD|dd� }|�|� q |S )zEReturn a sorted list of all available fix names in the given package.�*�fix_� N)�
__import__�pkgutilZ iter_modules�__path__�
startswith�append)Z fixer_pkgZ
remove_prefixZpkgZ fix_names�finder�nameZispkg� r �(/usr/lib64/python3.8/lib2to3/refactor.py�get_all_fix_names s
r c @ s e Zd ZdS )�
_EveryNodeN��__name__�
__module__� __qualname__r r r r r + s r c C s� t | tjtjf�r(| jdkr t�| jhS t | tj�rH| jrDt| j�S t�t | tj �r�t
� }| jD ] }|D ]}|� t|�� qhq`|S t d| ��dS )zf Accepts a pytree Pattern Node and returns a set
of the pattern types which will match first. Nz$Oh no! I don't understand pattern %s)
�
isinstancer Z NodePatternZ LeafPattern�typer ZNegatedPatternZcontent�_get_head_typesZWildcardPattern�set�update� Exception)Zpat�r�p�xr r r r / s
r c C s� t �t�}g }| D ]x}|jrdzt|j�}W n tk
rH |�|� Y q�X |D ]}|| �|� qNq|jdk r�||j �|� q|�|� qtt j
j � � t j
j
�D ]}|| �|� q�t|�S )z^ Accepts a list of fixers and returns a dictionary
of head node type --> fixer list. N)� collections� defaultdict�list�patternr r r Z _accept_typer r �python_grammarZ
symbol2number�values�tokens�extend�dict)Z
fixer_listZ
head_nodesZevery�fixerZheadsZ node_typer r r �_get_headnode_dictK s$
�r0 c s � fdd�t � d�D �S )zN
Return the fully qualified names for fixers in the package pkg_name.
c s g | ]}� d | �qS ��.r )�.0�fix_name�Zpkg_namer r �
<listcomp>h s �z+get_fixers_from_package.<locals>.<listcomp>F)r r5 r r5 r �get_fixers_from_packaged s
�r7 c C s | S �Nr )�objr r r � _identityk s r: c sX d}t �t�| �j�� � fdd�}ttjt jtj h�}t
� }z�|� \}}||krTq>q>|tj krl|rf�q6d}q>|tj k�r6|dk�r6|� \}}|tj ks�|dkr��q6|� \}}|tj ks�|dkrq6|� \}}|tj
kr�|dkr�|� \}}|tj k�r4|�|� |� \}}|tj
k�s.|d k�r"�q4|� \}}q�q>�q6q>W n tk
�rN Y nX t|�S )
NFc s t � �} | d | d fS )Nr r )�next)�tok��genr r �advancer s z(_detect_future_features.<locals>.advanceT�fromZ
__future__�import�(�,)r �generate_tokens�io�StringIO�readline� frozensetr �NEWLINE�NL�COMMENTr �STRING�NAME�OP�add�
StopIteration)�sourceZhave_docstringr? �ignore�features�tp�valuer r= r �_detect_future_featureso sB
rV c @ s e Zd ZdZdS )�
FixerErrorz A fixer could not be loaded.N)r r r �__doc__r r r r rW � s rW c @ s� e Zd Zddd�ZdZdZd4dd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d5dd�Z d6dd�Z
dd� Zd7dd�Zdd� Zd8d d �Zd d � Zd d!� Zd9d"d#�Zd:d$d%�Zd&Zd'Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Z d2d3� Z dS );�RefactoringToolF)�print_function�write_unchanged_filesZFixr Nc C s. || _ |p g | _| j�� | _|dk r0| j�|� | jd rDtj| _ntj | _| j�
d�| _ g | _ t
�d�| _g | _d| _tj| jtj| jd�| _| �� \| _| _g | _t�� | _ g | _ g | _ t | j| j�D ]F}|j r�| j �!|� q�|| jkr�| j �"|� q�|| jkr�| j �"|� q�t#| j �| _$t#| j �| _%dS )z�Initializer.
Args:
fixer_names: a list of fixers to import
options: a dict with configuration.
explicit: a list of fixers to run even if they are explicit.
NrZ r[ rY F)�convert�logger)&�fixers�explicit�_default_options�copy�optionsr! r �!python_grammar_no_print_statement�grammarr* �getr[ �errors�loggingZ getLoggerr] � fixer_log�wroter ZDriverr r\ �
get_fixers� pre_order�
post_order�files�bmZ
BottomMatcher�BMZ
bmi_pre_orderZbmi_post_orderr Z
BM_compatibleZ add_fixerr r0 �bmi_pre_order_heads�bmi_post_order_heads)�selfZ fixer_namesrb r_ r/ r r r �__init__� s>
�
zRefactoringTool.__init__c C sX g }g }| j D �] }t|i i dg�}|�dd�d }|�| j�rR|t| j�d� }|�d�}| jd�dd � |D �� }zt ||�}W n& t
k
r� t d
||f �d�Y nX || j | j
�} | jr�| jd k r�|| jkr�| �d |� q| �d
|� | jdk�r|�| � q| jdk�r |�| � qt d| j ��qt�d�}
|j|
d� |j|
d� ||fS )a Inspects the options to load the requested patterns and handlers.
Returns:
(pre_order, post_order), where pre_order is the list of fixers that
want a pre-order AST traversal, and post_order is the list that want
post-order traversal.
r r2 r ���N�_� c S s g | ] }|� � �qS r )�title)r3 r$ r r r r6 � s z.RefactoringTool.get_fixers.<locals>.<listcomp>zCan't find %s.%sTzSkipping optional fixer: %szAdding transformation: %sZpreZpostzIllegal fixer order: %rZ run_order��key)r^ r �rsplitr � FILE_PREFIX�len�split� CLASS_PREFIX�join�getattr�AttributeErrorrW rb rh r_ � log_message� log_debug�orderr �operator�
attrgetter�sort) rr Zpre_order_fixersZpost_order_fixersZ fix_mod_path�modr4 �parts�
class_nameZ fix_classr/ Zkey_funcr r r rj � s:
�
zRefactoringTool.get_fixersc O s � dS )z Called when an error occurs.Nr )rr �msg�args�kwdsr r r � log_error� s zRefactoringTool.log_errorc G s |r || }| j �|� dS )zHook to log a message.N)r] �info�rr r� r� r r r r� s zRefactoringTool.log_messagec G s |r || }| j �|� d S r8 )r] �debugr� r r r r� s zRefactoringTool.log_debugc C s dS )zTCalled with the old version, new version, and filename of a
refactored file.Nr )rr �old_text�new_text�filename�equalr r r � print_output s z RefactoringTool.print_outputc C s8 |D ].}t j�|�r$| �|||� q| �|||� qdS )z)Refactor a list of files and directories.N)�os�path�isdir� refactor_dir�
refactor_file)rr �items�write�
doctests_onlyZ dir_or_filer r r �refactor s zRefactoringTool.refactorc
C s� t jd }t �|�D ]�\}}}| �d|� |�� |�� |D ]>}|�d�s>t j�|�d |kr>t j�||�} | � | ||� q>dd� |D �|dd�< qdS )z�Descends down a directory and refactor every Python file found.
Python files are assumed to have a .py extension.
Files and subdirectories starting with '.' are skipped.
�pyzDescending into %sr2 r c S s g | ]}|� d �s|�qS r1 )r )r3 Zdnr r r r6 . s
z0RefactoringTool.refactor_dir.<locals>.<listcomp>N)
r� �extsep�walkr� r� r r� �splitextr r� )
rr Zdir_namer� r� Zpy_ext�dirpathZdirnames� filenamesr �fullnamer r r r� s
�z RefactoringTool.refactor_dirc
C s� zt |d�}W n6 tk
rD } z| �d||� W Y �dS d}~X Y nX zt�|j�d }W 5 |�� X tj |d|dd��}|�� |fW 5 Q R � S Q R X dS ) zG
Do our best to decode a Python source file correctly.
�rbzCan't open %s: %s)NNNr r# rv ��encoding�newline) �open�OSErrorr� �closer �detect_encodingrG rE �read)rr r� �f�errr� r r r �_read_python_source0 s
z#RefactoringTool._read_python_sourcec C s� | � |�\}}|dkrdS |d7 }|rn| �d|� | �||�}| jsL||kr`| �|||||� q�| �d|� nH| �||�}| js�|r�|jr�| jt|�dd� |||d� n | �d|� dS )zRefactors a file.N�
zRefactoring doctests in %szNo doctest changes in %srt )r� r� zNo changes in %s)r� r� �refactor_docstringr[ �processed_file�refactor_string� was_changed�str)rr r� r� r� �inputr� �output�treer r r r� @ s" �z RefactoringTool.refactor_filec
C s� t |�}d|krtj| j_zVz| j�|�}W n@ tk
rl } z"| �d||jj |� W Y �W �dS d}~X Y nX W 5 | j| j_X ||_
| � d|� | � ||� |S )aF Refactor a given input string.
Args:
data: a string holding the code to be refactored.
name: a human-readable name for use in error/log messages.
Returns:
An AST corresponding to the refactored input stream; None if
there were errors during the parse.
rZ zCan't parse %s: %s: %sNzRefactoring %s)
rV r rc r rd Z parse_stringr" r� � __class__r �future_featuresr� �
refactor_tree)rr �datar rS r� r� r r r r� W s"
� z RefactoringTool.refactor_stringc C s� t j�� }|rN| �d� | �|d�}| js2||krB| �|d|� q�| �d� n:| �|d�}| jsj|r~|jr~| �t |�d|� n
| �d� d S )Nz Refactoring doctests in stdinz<stdin>zNo doctest changes in stdinzNo changes in stdin)
�sys�stdinr� r� r� r[ r� r� r� r� )rr r� r� r� r� r r r �refactor_stdinr s
z RefactoringTool.refactor_stdinc
C s� t | j| j�D ]}|�||� q| �| j|�� � | �| j|�� � | j�|� � �}t
|� � ��r�| jj D �]D}||krj|| rj|| j
tjjdd� |jr�|| j
tjjd� t|| �D ]�}||| kr�|| �|� z t|� W n tk
�r Y q�Y nX |j�r||jk�rq�|�|�}|r�|�||�}|dk r�|�|� |�� D ] }|j�s^g |_|j�|� �qL| j�|� � �}|D ]*} | |k�r�g || < || � || � �q�q�qjqTt | j| j�D ]}|� ||� �q�|j S )a� Refactors a parse tree (modifying the tree in place).
For compatible patterns the bottom matcher module is
used. Otherwise the tree is traversed node-to-node for
matches.
Args:
tree: a pytree.Node instance representing the root of the tree
to be refactored.
name: a human-readable name for this tree.
Returns:
True if the tree was modified, False otherwise.
T)ry �reverserx N) r rk rl Z
start_tree� traverse_byrp rq ro �runZleaves�anyr+ r^ r� r ZBaseZdepthZkeep_line_orderZ
get_linenor( �remover �
ValueErrorZfixers_applied�match� transform�replacer r- Z finish_treer� )
rr r� r r/ Z match_set�node�results�newZ new_matchesZfxrr r r r� � sJ
z RefactoringTool.refactor_treec C sV |sdS |D ]D}||j D ]4}|�|�}|r|�||�}|dk r|�|� |}qq dS )a Traverse an AST, applying a set of fixers to each node.
This is a helper method for refactor_tree().
Args:
fixers: a list of fixer instances.
traversal: a generator that yields AST nodes.
Returns:
None
N)r r� r� r� )rr r^ Z traversalr� r/ r� r� r r r r� � s
zRefactoringTool.traverse_byc C s� | j �|� |dkr.| �|�d }|dkr.dS ||k}| �||||� |r`| �d|� | js`dS |rv| �||||� n | �d|� dS )zR
Called when a file has been refactored and there may be changes.
Nr zNo changes to %szNot writing changes to %s)rm r r� r� r� r[ �
write_file)rr r� r� r� r� r� r� r r r r� � s z RefactoringTool.processed_filec C s� zt j|d|dd�}W n6 tk
rL } z| �d||� W Y �dS d}~X Y nX |�F z|�|� W n0 tk
r� } z| �d||� W 5 d}~X Y nX W 5 Q R X | �d|� d| _dS ) z�Writes a string to a file.
It first shows a unified diff between the old text and the new text, and
then rewrites the file; the latter is only done if the write option is
set.
�wrv r� zCan't create %s: %sNzCan't write %s: %szWrote changes to %sT)rE r� r� r� r� r� ri )rr r� r� r� r� �fpr� r r r r� � s * zRefactoringTool.write_filez>>> z... c
C s g }d}d}d}d}|j dd�D ]�}|d7 }|�� �| j�r~|dk rZ|�| �||||�� |}|g}|�| j�} |d| � }q |dk r�|�|| j �s�||| j�� d kr�|� |� q |dk r�|�| �||||�� d}d}|� |� q |dk �r
|�| �||||�� d�
|�S )a� Refactors a docstring, looking for doctests.
This returns a modified version of the input string. It looks
for doctests, which start with a ">>>" prompt, and may be
continued with "..." prompts, as long as the "..." is indented
the same as the ">>>".
(Unfortunately we can't use the doctest module's parser,
since, like most parsers, it is not geared towards preserving
the original source.)
Nr T��keependsr r� rv ) �
splitlines�lstripr �PS1r- �refactor_doctest�find�PS2�rstripr r )
rr r� r� �result�blockZ block_lineno�indent�lineno�line�ir r r r� sJ � �� �
�z"RefactoringTool.refactor_docstringc
s. z�� ||� �}W nj tk
r| } zL�j�tj�rN|D ]}��d|�d�� q6��d|||j j
|� | W Y �S d}~X Y nX �� ||��r*t |�j
dd�}|d|d � ||d d� } }| dg|d ks�t| ��|d �d�s�|d d7 < � �j |�d � g}|�r*|� �fd
d �|D �7 }|S ) z�Refactors one doctest.
A doctest is given as a block of lines, the first of which starts
with ">>>" (possibly indented), while the remaining lines start
with "..." (identically indented).
z
Source: %sr� z+Can't parse docstring in %s line %s: %s: %sNTr� r rt r c s g | ]}� �j | �qS r )r� )r3 r� �r� rr r r r6 Z s z4RefactoringTool.refactor_doctest.<locals>.<listcomp>)� parse_blockr" r] Z isEnabledForrg �DEBUGr� r� r� r� r r� r� r� �AssertionError�endswithr� �pop)
rr r� r� r� r� r� r� r� r� Zclippedr r� r r� @ s. �"z RefactoringTool.refactor_doctestc C s� | j r d}nd}| js$| �d|� n"| �d|� | jD ]}| �|� q6| jrl| �d� | jD ]}| �|� q\| jr�t| j�dkr�| �d� n| �dt| j�� | jD ] \}}}| j|f|�|� q�d S ) N�werez
need to bezNo files %s modified.zFiles that %s modified:z$Warnings/messages while refactoring:r zThere was 1 error:zThere were %d errors:)ri rm r� rh rf r| )rr r� �file�messager� r� r� r r r � summarize] s$
zRefactoringTool.summarizec C s" | j �| �|||��}t� |_|S )z�Parses a block into a tree.
This is necessary to get correct line number / offset information
in the parser diagnostics and embedded into the parse tree.
)r Z parse_tokens� wrap_toksrH r� )rr r� r� r� r� r r r r� t s zRefactoringTool.parse_blockc c sd t �| �||�j�}|D ]F\}}\}}\} }
} ||d 7 }| |d 7 } ||||f| |
f| fV qdS )z;Wraps a tokenize stream to systematically modify start/end.r N)r rD � gen_lines�__next__) rr r� r� r� r, r rU Zline0Zcol0Zline1Zcol1Z line_textr r r r� ~ s
zRefactoringTool.wrap_toksc c sx || j }|| j }|}|D ]N}|�|�r>|t|�d� V n(||�� d krVdV ntd||f ��|}q dV qldS )z�Generates lines as expected by tokenize from a list of lines.
This strips the first len(indent + self.PS1) characters off each line.
Nr� zline=%r, prefix=%rrv )r� r� r r| r� r� )rr r� r� �prefix1Zprefix2�prefixr� r r r r� � s
zRefactoringTool.gen_lines)NN)FF)FF)FF)F)NFN)N) r r r r` r~ r{ rs rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r rY � s> �
4(
O �
+
rY c @ s e Zd ZdS )�MultiprocessingUnsupportedNr r r r r r� � s r� c sB e Zd Z� fdd�Zd � fdd� Z� fdd�Z� fd d
�Z� ZS ) �MultiprocessRefactoringToolc s" t t| �j||� d | _d | _d S r8 )�superr� rs �queue� output_lock�rr r� �kwargs�r� r r rs � s z$MultiprocessRefactoringTool.__init__Fr c
s� |dkr t t���|||�S z dd l� W n tk
r@ t�Y nX �jd k rTtd��� �� �_� � � �_
� �fdd�t |�D �}z*|D ] }|�� q�t t���|||� W 5 �j� � t |�D ]}�j�
d � q�|D ]}|�� r�|� � q�d �_X d S )Nr r z already doing multiple processesc s g | ]}� j �jd ��qS ))�target)ZProcess�_child)r3 r� ��multiprocessingrr r r r6 � s �z8MultiprocessRefactoringTool.refactor.<locals>.<listcomp>)r� r� r� r� � ImportErrorr� r� � RuntimeErrorZ
JoinableQueueZLockr� �ranger �putZis_alive�start)rr r� r� r� Z
num_processesZ processesr� r$ r� r� r r� � s<
�
�
�
z$MultiprocessRefactoringTool.refactorc sN | j �� }|d k rJ|\}}ztt| �j||� W 5 | j �� X | j �� }q
d S r8 )r� re Z task_doner� r� r� )rr Ztaskr� r� r� r r r� � s
� z"MultiprocessRefactoringTool._childc s2 | j d k r | j �||f� ntt| �j||�S d S r8 )r� r� r� r� r� r� r� r r r� � s
�z)MultiprocessRefactoringTool.refactor_file)FFr )r r r rs r� r� r� �
__classcell__r r r� r r� � s � r� )T)#rX �
__author__rE r� r r� rg r� r& � itertoolsr Zpgen2r r r Z
fixer_utilr rv r r r
rn r r" r r r0 r7 r: rV rW �objectrY r� r� r r r r �<module> s8
( __pycache__/btm_matcher.cpython-38.opt-2.pyc 0000644 00000006354 15053244165 0014646 0 ustar 00 U
e5d� � @ sh d Z ddlZddlZddlmZ ddlmZ ddlmZ G dd� de �Z
G d d
� d
e �Z i a d d � Z
dS )
z+George Boutsioukis <gboutsioukis@gmail.com>� N)� defaultdict� )�pytree)� reduce_treec @ s e Zd Ze�� Zdd� ZdS )�BMNodec C s" i | _ g | _ttj�| _d| _d S )N� )�transition_table�fixers�nextr �count�id�content��self� r �+/usr/lib64/python3.8/lib2to3/btm_matcher.py�__init__ s zBMNode.__init__N)�__name__�
__module__� __qualname__� itertoolsr r r r r r r s r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) �
BottomMatcherc C s0 t � | _t� | _| jg| _g | _t�d�| _d S )NZRefactoringTool) �set�matchr �rootZnodesr �loggingZ getLoggerZloggerr r r r r s
zBottomMatcher.__init__c C sH | j �|� t|j�}|�� }| j|| jd�}|D ]}|j �|� q2d S )N��start)r �appendr Z pattern_treeZget_linear_subpattern�addr )r �fixerZtreeZlinear� match_nodesZ
match_noder r r � add_fixer% s
zBottomMatcher.add_fixerc C s� |s
|gS t |d t�r`g }|d D ]6}| j||d�}|D ] }|�| �|dd � |�� q:q$|S |d |jkr�t� }||j|d < n|j|d }|dd � r�| j|dd � |d�}n|g}|S d S )Nr r r )�
isinstance�tupler �extendr r )r �patternr r! � alternativeZ end_nodes�endZ next_noder r r r 1 s" zBottomMatcher.addc C s� | j }tt�}|D ]�}|}|rd|_|jD ]$}t|tj�r*|jdkr*d|_ qPq*|j dkrb|j}n|j }||j
kr�|j
| }|j D ]}|| � |� q�nH| j }|j
d k r�|j
jr�q||j
kr�|j
| }|j D ]}|| � |� q�|j
}qq|S )NT�;Fr )r r �listZ was_checkedZchildrenr# r ZLeaf�value�typer r r �parent) r ZleavesZcurrent_ac_nodeZresultsZleafZcurrent_ast_nodeZchildZ
node_tokenr r r r �runS s8
�
zBottomMatcher.runc s* t d� � fdd�� � | j� t d� d S )Nz
digraph g{c sZ | j �� D ]J}| j | }td| j|jt|�t|j�f � |dkrLt|j� � |� q
d S )Nz%d -> %d [label=%s] //%sr )r �keys�printr � type_repr�strr r
)ZnodeZ subnode_keyZsubnode��
print_noder r r4 � s
�
z*BottomMatcher.print_ac.<locals>.print_node�})r0 r r r r3 r �print_ac� s
zBottomMatcher.print_acN)r r r r r" r r. r6 r r r r r s
"8r c C sD t s8ddlm} |j�� D ] \}}t|�tkr|t |< qt �| | �S )Nr )�python_symbols)� _type_reprsZpygramr7 �__dict__�itemsr, �int�
setdefault)Ztype_numr7 �name�valr r r r1 � s
r1 )�
__author__r r � collectionsr r r Z btm_utilsr �objectr r r8 r1 r r r r �<module> s __pycache__/fixer_base.cpython-38.opt-1.pyc 0000644 00000014157 15053244165 0014467 0 ustar 00 U
e5d" � @ sT d Z ddlZddlmZ ddlmZ ddlmZ G dd� de�Z G d d
� d
e �Z
dS ) z2Base class for fixers (optional, but recommended).� N� )�PatternCompiler)�pygram)�does_tree_importc @ s� e Zd ZdZdZdZdZdZdZe �
d�Z e � Z
dZdZdZdZdZdZejZdd� Zd d
� Zd d � Zd
d� Zdd� Zd dd�Z dd� Z d dd�Z dd� Z dd� Z d d � Z!dS ) �BaseFixa Optional base class for fixers.
The subclass name must be FixFooBar where FooBar is the result of
removing underscores and capitalizing the words of the fix name.
For example, the class name for a fixer named 'has_key' should be
FixHasKey.
Nr ZpostF� c C s || _ || _| �� dS )a Initializer. Subclass may override.
Args:
options: a dict containing the options passed to RefactoringTool
that could be used to customize the fixer through the command line.
log: a list to append warnings and other messages to.
N)�options�log�compile_pattern)�selfr r � r �*/usr/lib64/python3.8/lib2to3/fixer_base.py�__init__/ s zBaseFix.__init__c C s, | j dk r(t� }|j| j dd�\| _| _dS )z�Compiles self.PATTERN into self.pattern.
Subclass may override if it doesn't want to use
self.{pattern,PATTERN} in .match().
NT)Z with_tree)�PATTERNr r
�pattern� pattern_tree)r ZPCr r r
r
; s
�zBaseFix.compile_patternc C s
|| _ dS )zOSet the filename.
The main refactoring tool should call this.
N)�filename)r r r r r
� set_filenameF s zBaseFix.set_filenamec C s d|i}| j �||�o|S )a Returns match for a given parse tree node.
Should return a true or false object (not necessarily a bool).
It may return a non-empty dict of matching sub-nodes as
returned by a matching pattern.
Subclass may override.
�node)r �match�r r Zresultsr r r
r M s z
BaseFix.matchc C s
t � �dS )a� Returns the transformation for a given parse tree node.
Args:
node: the root of the parse tree that matched the fixer.
results: a dict mapping symbolic names to part of the match.
Returns:
None, or a node that is a modified copy of the
argument node. The node argument may also be modified in-place to
effect the same change.
Subclass *must* override.
N)�NotImplementedErrorr r r r
� transformY s zBaseFix.transform�xxx_todo_changemec C s2 |}|| j kr"|tt| j�� }q| j �|� |S )z�Return a string suitable for use as an identifier
The new name is guaranteed not to conflict with other identifiers.
)�
used_names�str�next�numbers�add)r �template�namer r r
�new_namei s
zBaseFix.new_namec C s. | j r d| _ | j�d| j � | j�|� d S )NFz### In file %s ###)� first_logr �appendr )r �messager r r
� log_messaget s zBaseFix.log_messagec C s> |� � }|�� }d|_d}| �|||f � |r:| �|� dS )a Warn the user that a given chunk of code is not valid Python 3,
but that it cannot be converted automatically.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
� z Line %d: could not convert: %sN)�
get_linenoZclone�prefixr% )r r �reason�linenoZ
for_output�msgr r r
�cannot_convertz s zBaseFix.cannot_convertc C s |� � }| �d||f � dS )z�Used for warning the user about possible uncertainty in the
translation.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
z Line %d: %sN)r' r% )r r r) r* r r r
�warning� s zBaseFix.warningc C s( |j | _ | �|� t�d�| _d| _dS )z�Some fixers need to maintain tree-wide state.
This method is called once, at the start of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
r TN)r r � itertools�countr r" �r Ztreer r r r
�
start_tree� s
zBaseFix.start_treec C s dS )z�Some fixers need to maintain tree-wide state.
This method is called once, at the conclusion of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
Nr r0 r r r
� finish_tree� s zBaseFix.finish_tree)r )N)"�__name__�
__module__� __qualname__�__doc__r r r r r r. r/ r �setr �orderZexplicitZ run_orderZ _accept_typeZkeep_line_orderZ
BM_compatibler Zpython_symbolsZsymsr r
r r r r! r% r, r- r1 r2 r r r r
r s4
r c s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )�ConditionalFixz@ Base class for fixers which not execute if an import is found. Nc s t t| �j|� d | _d S )N)�superr9 r1 � _should_skip)r �args�� __class__r r
r1 � s zConditionalFix.start_treec C sJ | j d k r| j S | j�d�}|d }d�|d d� �}t|||�| _ | j S )N�.���)r; �skip_on�split�joinr )r r Zpkgr r r r
� should_skip� s
zConditionalFix.should_skip)r3 r4 r5 r6 rA r1 rD �
__classcell__r r r= r
r9 � s r9 ) r6 r. Zpatcompr r& r Z
fixer_utilr �objectr r9 r r r r
�<module> s __pycache__/btm_matcher.cpython-38.opt-1.pyc 0000644 00000011417 15053244165 0014641 0 ustar 00 U
e5d� � @ sl d Z dZddlZddlZddlmZ ddlmZ ddlm Z G dd � d e
�Z G d
d � d e
�Z i a
d d
� ZdS )a� A bottom-up tree matching algorithm implementation meant to speed
up 2to3's matching process. After the tree patterns are reduced to
their rarest linear path, a linear Aho-Corasick automaton is
created. The linear automaton traverses the linear paths from the
leaves to the root of the AST and returns a set of nodes for further
matching. This reduces significantly the number of candidate nodes.z+George Boutsioukis <gboutsioukis@gmail.com>� N)� defaultdict� )�pytree)� reduce_treec @ s e Zd ZdZe�� Zdd� ZdS )�BMNodez?Class for a node of the Aho-Corasick automaton used in matchingc C s" i | _ g | _ttj�| _d| _d S )N� )�transition_table�fixers�nextr �count�id�content��self� r �+/usr/lib64/python3.8/lib2to3/btm_matcher.py�__init__ s zBMNode.__init__N)�__name__�
__module__� __qualname__�__doc__� itertoolsr r r r r r r s r c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd S )
�
BottomMatcherzgThe main matcher class. After instantiating the patterns should
be added using the add_fixer methodc C s0 t � | _t� | _| jg| _g | _t�d�| _d S )NZRefactoringTool) �set�matchr �rootZnodesr �loggingZ getLoggerZloggerr r r r r s
zBottomMatcher.__init__c C sH | j �|� t|j�}|�� }| j|| jd�}|D ]}|j �|� q2dS )z�Reduces a fixer's pattern tree to a linear path and adds it
to the matcher(a common Aho-Corasick automaton). The fixer is
appended on the matching states and called when they are
reached��startN)r �appendr Z pattern_treeZget_linear_subpattern�addr )r �fixerZtreeZlinear� match_nodesZ
match_noder r r � add_fixer% s
zBottomMatcher.add_fixerc C s� |s
|gS t |d t�r`g }|d D ]6}| j||d�}|D ] }|�| �|dd� |�� q:q$|S |d |jkr�t� }||j|d < n|j|d }|dd� r�| j|dd� |d�}n|g}|S dS )z5Recursively adds a linear pattern to the AC automatonr r r N)�
isinstance�tupler �extendr r )r �patternr r" � alternativeZ end_nodes�endZ next_noder r r r 1 s" zBottomMatcher.addc C s� | j }tt�}|D ]�}|}|rd|_|jD ]$}t|tj�r*|jdkr*d|_ qPq*|j dkrb|j}n|j }||j
kr�|j
| }|j D ]}|| � |� q�nH| j }|j
dk r�|j
jr�q||j
kr�|j
| }|j D ]}|| � |� q�|j
}qq|S )au The main interface with the bottom matcher. The tree is
traversed from the bottom using the constructed
automaton. Nodes are only checked once as the tree is
retraversed. When the automaton fails, we give it one more
shot(in case the above tree matches as a whole with the
rejected leaf), then we break for the next leaf. There is the
special case of multiple arguments(see code comments) where we
recheck the nodes
Args:
The leaves of the AST tree to be matched
Returns:
A dictionary of node matches with fixers as the keys
T�;Fr N)r r �listZ was_checkedZchildrenr$ r ZLeaf�value�typer r r �parent) r ZleavesZcurrent_ac_nodeZresultsZleafZcurrent_ast_nodeZchildZ
node_tokenr! r r r �runS s8
�
zBottomMatcher.runc s* t d� � fdd�� � | j� t d� dS )z<Prints a graphviz diagram of the BM automaton(for debugging)z
digraph g{c sZ | j �� D ]J}| j | }td| j|jt|�t|j�f � |dkrLt|j� � |� q
d S )Nz%d -> %d [label=%s] //%sr )r �keys�printr � type_repr�strr r
)ZnodeZ subnode_keyZsubnode��
print_noder r r5 � s
�
z*BottomMatcher.print_ac.<locals>.print_node�}N)r1 r r r r4 r �print_ac� s
zBottomMatcher.print_acN) r r r r r r# r r/ r7 r r r r r s "8r c C sD t s8ddlm} |j�� D ] \}}t|�tkr|t |< qt �| | �S )Nr )�python_symbols)� _type_reprsZpygramr8 �__dict__�itemsr- �int�
setdefault)Ztype_numr8 �name�valr r r r2 � s
r2 )r �
__author__r r � collectionsr r r Z btm_utilsr �objectr r r9 r2 r r r r �<module> s __pycache__/main.cpython-38.opt-2.pyc 0000644 00000015247 15053244165 0013306 0 ustar 00 U
e5d�- � @ s| d dl mZmZ d dlZd dlZd dlZd dlZd dlZd dlZddl m
Z
dd� Z G dd� de
j �Z
d d
� Zd
d d �ZdS )� )�with_statement�print_functionN� )�refactorc C s( | � � } |� � }tj| |||dddd�S )Nz
(original)z (refactored)� )Zlineterm)�
splitlines�difflibZ unified_diff)�a�b�filename� r �$/usr/lib64/python3.8/lib2to3/main.py�
diff_texts s �r c s: e Zd Zd
� fdd� Zdd� Z� fdd�Zdd � Z� ZS ) �StdoutRefactoringToolr c sP || _ || _|r&|�tj�s&|tj7 }|| _|| _|| _tt | ��
|||� d S �N) � nobackups�
show_diffs�endswith�os�sep�_input_base_dir� _output_dir�_append_suffix�superr �__init__) �selfZfixers�options�explicitr r �input_base_dir�
output_dir�
append_suffix�� __class__r r
r $ s
z StdoutRefactoringTool.__init__c O s* | j �|||f� | jj|f|�|� d S r )�errors�append�logger�error)r �msg�args�kwargsr r r
� log_errorA s z StdoutRefactoringTool.log_errorc
sz |}| j rH|�| j�r6tj�| j |t| j�d � �}ntd|| jf ��| jrX|| j7 }||kr�tj� |�}tj�
|�s�|r�t� |� | � d||� | j
�s2|d }tj�|�r�zt�|� W n. tk
r� } z| � d|� W 5 d }~X Y nX zt�||� W n2 tk
�r0 } z| � d||� W 5 d }~X Y nX tt| �j} | ||||� | j
�s`t�||� ||k�rvt�||� d S )Nz5filename %s does not start with the input_base_dir %szWriting converted %s to %s.z.bakzCan't remove backup %szCan't rename %s to %s)r �
startswithr r �path�join�len�
ValueErrorr �dirname�isdir�makedirs� log_messager �lexists�remove�OSError�renamer r �
write_file�shutilZcopymode)
r Znew_textr Zold_text�encodingZ
orig_filenamer Zbackup�err�writer! r r
r8 E sJ
� ��
�
z StdoutRefactoringTool.write_filec C s� |r| � d|� n�| � d|� | jr�t|||�}zP| jd k rl| j�" |D ] }t|� qHtj�� W 5 Q R X n|D ] }t|� qpW n$ tk
r� t d|f � Y d S X d S )NzNo changes to %sz
Refactored %sz+couldn't encode %s's diff for your terminal)
r3 r r Z output_lock�print�sys�stdout�flush�UnicodeEncodeError�warn)r �old�newr ZequalZ
diff_lines�liner r r
� print_outputl s$
�z"StdoutRefactoringTool.print_output)r r r )�__name__�
__module__� __qualname__r r* r8 rF �
__classcell__r r r! r
r s � 'r c C s t d| f tjd� d S )Nz WARNING: %s��file)r= r> �stderr)r' r r r
rB � s rB c
s� t jdd�}|jddddd� |jdd d
g d d � |jd
dddddd� |jddd
g dd � |jddddd� |jdddd d� |jd d dd d� |jd dd!d� |jd"d#dd$d� |jd%d&dd'd(d � |jd)d*dd+d,d-d.� |jd/d0dd1d� |jd2dd+d,d3d.� d'}i }|�|�\}}|j�r@d4|d5< |j�s:td6� d4|_|j�rZ|j�sZ|� d7� |j
�rt|j�st|� d8� |j�s�|j �r�td9� |j�s�|j�r�|� d:� |j �r�t
d;� t�� �D ]}t
|� �q�|�s�d<S |�s t
d=tjd>� t
d?tjd>� d@S dA|k�r(d4}|j�r(t
dBtjd>� d@S |j�r8d4|dC< |j�rFtjntj}tjdD|dE� t�dF�}tt�� ��} t� fdGdH�|jD ��}
t� } |j �r�d'} |j D ](}
|
dIk�r�d4} n| � � dJ |
� �q�| �r�| � | �n| }n
| � | �}|� |
�}t j!�"|�}|�r0|�#t j$��s0t j!�%|��s0t j!�&|�}|j�rT|�'t j$�}|�(dK|j|� t)t*|�|t*| �|j|j ||j|j
dL�}|j+�s�|�r�|�,� nDz|�||j|j-|j.� W n( tj/k
�r� t
dMtjd>� Y dS X |�0� t1t2|j+��S )NNz2to3 [options] file|dir ...)Zusagez-dz--doctests_only�
store_truezFix up doctests only)�action�helpz-fz--fixr$ z1Each FIX specifies a transformation; default: all)rO �defaultrP z-jz --processesZstorer �intzRun 2to3 concurrently)rO rQ �typerP z-xz--nofixz'Prevent a transformation from being runz-lz --list-fixesz List available transformationsz-pz--print-functionz0Modify the grammar so that print() is a functionz-vz --verbosezMore verbose loggingz
--no-diffsz#Don't show diffs of the refactoringz-wz--writezWrite back modified filesz-nz --nobackupsFz&Don't write backups for modified filesz-oz --output-dir�strr zXPut output files in this directory instead of overwriting the input files. Requires -n.)rO rS rQ rP z-Wz--write-unchanged-fileszYAlso write files even if no changes were required (useful with --output-dir); implies -w.z --add-suffixzuAppend this string to all output filenames. Requires -n if non-empty. ex: --add-suffix='3' will generate .py3 files.T�write_unchanged_filesz&--write-unchanged-files/-W implies -w.z%Can't use --output-dir/-o without -n.z"Can't use --add-suffix without -n.z@not writing files and not printing diffs; that's not very usefulzCan't use -n without -wz2Available transformations for the -f/--fix option:r z1At least one file or directory argument required.rK zUse --help to show usage.� �-zCan't write to stdin.r z%(name)s: %(message)s)�format�levelz lib2to3.mainc 3 s | ]}� d | V qdS )�.fix_Nr )�.0�fix�� fixer_pkgr r
� <genexpr>� s zmain.<locals>.<genexpr>�allrZ z7Output in %r will mirror the input directory %r layout.)r r r z+Sorry, -j isn't supported on this platform.)3�optparseZ OptionParserZ
add_option�
parse_argsrU r< rB r r r& Z
add_suffixZno_diffsZ
list_fixesr= r Zget_all_fix_namesr> rM r �verbose�logging�DEBUG�INFOZ basicConfigZ getLogger�setZget_fixers_from_packageZnofixr\ �add�union�
differencer r, � commonprefixr r r1 r0 �rstrip�infor �sortedr# �refactor_stdinZ
doctests_onlyZ processesZMultiprocessingUnsupportedZ summarizerR �bool)r^ r( �parserro �flagsr ZfixnamerY r% Z avail_fixesZunwanted_fixesr Z all_presentr\ Z requestedZ fixer_namesr Zrtr r] r
�main� s�
� � � �
�
�
��
� � �
� �
� � �
��rs )N)Z
__future__r r r> r r rd r9 ra r r r ZMultiprocessRefactoringToolr rB rs r r r r
�<module> s g __pycache__/fixer_util.cpython-38.pyc 0000644 00000027650 15053244165 0013575 0 ustar 00 U
e5dg; �
@ s� d Z ddlmZ ddlmZmZ ddlmZ ddl m
Z
dd� Z dd � Z d
d � Z
d d
� ZdWdd�Zdd� Zdd� Zdd� Ze � e
� fdd�ZdXdd�Zdd � Zd d � ZdYd d �Zd!d"� ZdZd#d$�Zd[d%d&�Zd'd(� Zd)d*� Z d+d,� Z d-d.� Z d/d0� Z d1d2d3d4d5d6d7d8d9d:h
Z d;d<� Z!d=a"d>a#d?a$d@a%dAdB� Z&dCdD� Z'dEdF� Z(dGdH� Z)dIdJ� Z*dKdL� Z+dMdN� Z,dOdP� Z-ej.ej/hZ0d\dQdR�Z1ej/ej.ej2hZ3dSdT� Z4d]dUdV�Z5dS )^z1Utility functions, node construction macros, etc.� )�token)�Leaf�Node)�python_symbols)�patcompc C s t tj| ttjd�|g�S )N�=)r �symsZargumentr r �EQUAL)�keyword�value� r �*/usr/lib64/python3.8/lib2to3/fixer_util.py�
KeywordArg s �r c C s t tjd�S )N�()r r �LPARr r r r
�LParen s r c C s t tjd�S )N�))r r �RPARr r r r
�RParen s r c C sH t | t�s| g} t |t�s&d|_|g}ttj| ttjddd�g | �S )z Build an assignment statement� r ��prefix) �
isinstance�listr r r �atomr r r )�target�sourcer r r
�Assign s
�r Nc C s t tj| |d�S )zReturn a NAME leafr )r r �NAME)�namer r r r
�Name$ s r c C s | t tjt� |g�gS )zA node tuple for obj.attr)r r �trailer�Dot)�obj�attrr r r
�Attr( s r% c C s t tjd�S )z A comma leaf�,)r r �COMMAr r r r
�Comma, s r( c C s t tjd�S )zA period (.) leaf�.)r r �DOTr r r r
r" 0 s r" c C s4 t tj|�� |�� g�}| r0|�dt tj| �� |S )z-A parenthesised argument list, used by Call()r )r r r! �clone� insert_child�arglist)�argsZlparenZrparen�noder r r
�ArgList4 s r0 c C s& t tj| t|�g�}|dk r"||_|S )zA function callN)r r �powerr0 r )Z func_namer. r r/ r r r
�Call; s r2 c C s t tjd�S )zA newline literal�
�r r �NEWLINEr r r r
�NewlineB s r6 c C s t tjd�S )z A blank line� r4 r r r r
� BlankLineF s r8 c C s t tj| |d�S )Nr )r r �NUMBER)�nr r r r
�NumberJ s r; c C s" t tjttjd�| ttjd�g�S )z A numeric or string subscript�[�])r r r! r r �LBRACE�RBRACE)Z
index_noder r r
� SubscriptM s
�r@ c C s t tj| |d�S )z
A string leafr )r r �STRING)�stringr r r r
�StringS s rC c C s� d| _ d|_ d|_ ttjd�}d|_ ttjd�}d|_ ||||g}|rtd|_ ttjd�}d|_ |�ttj||g�� ttj| ttj |�g�}ttj
ttj d�|ttj d�g�S )zuA list comprehension of the form [xp for fp in it if test].
If test is None, the "if test" part is omitted.
r7 r �for�in�ifr< r= )
r r r r �appendr r Zcomp_ifZ listmakerZcomp_forr r> r? ) Zxp�fp�itZtestZfor_leafZin_leafZ
inner_argsZif_leaf�innerr r r
�ListCompW s(
��rK c C sV |D ] }|� � qttjd�ttj| dd�ttjddd�ttj|�g}ttj|�}|S )zO Return an import statement in the form:
from package import name_leafs�fromr r �import)�remover r r r r �import_as_names� import_from)Z package_nameZ
name_leafsZleaf�children�impr r r
�
FromImporto s
� rS c C s� |d � � }|jtjkr"|� � }nttj|� � g�}|d }|rNdd� |D �}ttjtt|d �t|d ��ttj|d � � ||d � � g�g | �}| j |_ |S ) zfReturns an import statement and calls a method
of the module:
import module
module.name()r# �afterc S s g | ] }|� � �qS r )r+ )�.0r: r r r
�
<listcomp>� s z!ImportAndCall.<locals>.<listcomp>� r ZlparZrpar)
r+ �typer r- r r1 r% r r! r )r/ �results�namesr# Z
newarglistrT �newr r r
�
ImportAndCall� s*
�����r\ c C s� t | t�r | jt� t� gkr dS t | t�o�t| j�dko�t | jd t�o�t | jd t�o�t | jd t�o�| jd jdko�| jd jdkS )z(Does the node represent a tuple literal?T� rW r � r r )r r rQ r r �lenr r �r/ r r r
�is_tuple� s
������ra c C sX t | t�oVt| j�dkoVt | jd t�oVt | jd t�oV| jd jdkoV| jd jdkS )z'Does the node represent a list literal?r rW ���r< r= )r r r_ rQ r r r` r r r
�is_list� s
�����rc c C s t tjt� | t� g�S �N)r r r r r r` r r r
� parenthesize� s re �sortedr �set�any�all�tuple�sum�min�max� enumeratec c s$ t | |�}|r |V t ||�}q
dS )al Follow an attribute chain.
If you have a chain of objects where a.foo -> b, b.foo-> c, etc,
use this to iterate over all objects in the chain. Iteration is
terminated by getattr(x, attr) is None.
Args:
obj: the starting object
attr: the name of the chaining attribute
Yields:
Each successive object in the chain.
N)�getattr)r# r$ �nextr r r
�
attr_chain� s
rq zefor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
z�
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
z`
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
Fc C sp t s&t�t�at�t�at�t�ada tttg}t|t| d��D ]*\}}i }|�||�r@|d | kr@ dS q@dS )a Returns true if node is in an environment where all that is required
of it is being iterable (ie, it doesn't matter if it returns a list
or an iterator).
See test_map_nochange in test_fixers.py for some examples and tests.
T�parentr/ F) �
pats_builtr Zcompile_pattern�p0�p1�p2�ziprq �match)r/ Zpatterns�patternrr rY r r r
�in_special_context� s
rz c C s� | j }|dk r |jtjkr dS | j}|jtjtjfkr:dS |jtjkrX|j d | krXdS |jtj
ks�|jtj kr�|dk r�|jtj ks�|j d | kr�dS dS )zG
Check that something isn't an attribute or function name etc.
NFrW T)
Z prev_siblingrX r r* rr r �funcdef�classdef� expr_stmtrQ Z
parametersZ
typedargslistr' )r/ �prevrr r r r
�is_probably_builtin� s&
��
� �r c C sJ | dk rF| j tjkr>t| j�dkr>| jd }|j tjkr>|jS | j} q dS )z Find the indentation of *node*.Nr^ r r7 ) rX r �suiter_ rQ r �INDENTr rr )r/ �indentr r r
�find_indentation s
r� c C s> | j tjkr| S | �� } | jd }| _ttj| g�}||_|S rd )rX r r� r+ rr r )r/ rr r� r r r
�
make_suite s r� c C s$ | j tjkr | j} | s td��q | S )z Find the top level namespace.z,root found before file_input node was found.)rX r Z
file_inputrr �
ValueErrorr` r r r
� find_root& s
r� c C s t |t|�| �}t|�S )z� Returns true if name is imported from package at the
top level of the tree which node belongs to.
To cover the case of an import like 'import foo', use
None for the package and 'foo' for the name. )� find_bindingr� �bool)�packager r/ Zbindingr r r
�does_tree_import/ s r� c C s | j tjtjfkS )z0Returns true if the node is an import statement.)rX r � import_namerP r` r r r
� is_import7 s r� c C s. dd� }t |�}t| ||�r dS d }}t|j�D ]F\}}||�sDq2t|j|d� �D ]\}}||�sV qlqV|| } qzq2|dkr�t|j�D ]8\}}|jtjkr�|jr�|jd jtjkr�|d } q�q�| dkr�t tj
t tj d�t tj |dd�g�} nt
| t tj |dd�g�} | t� g}
|�|t tj|
�� dS ) z\ Works like `does_tree_import` but adds an import statement
if it was not imported. c S s | j tjko | jo t| jd �S )NrW )rX r � simple_stmtrQ r� r` r r r
�is_import_stmt> s �z$touch_import.<locals>.is_import_stmtNrW r rM r r )r� r� rn rQ rX r r� r rA r r� r r rS r6 r, ) r� r r/ r� �rootZ
insert_pos�offset�idxZnode2�import_rQ r r r
� touch_import; s8 �
�
r� c C s� |j D �]�}d}|jtjkrVt| |j d �r4| S t| t|j d �|�}|rR|}�n0|jtjtjfkr�t| t|j d �|�}|r�|}� n�|jtj k�rt| t|j d �|�}|r�|}nTt
|j dd� �D ]@\}}|jt j kr�|j
dkr�t| t|j |d �|�}|r�|}q�nx|jtk�r2|j d j
| k�r2|}nTt|| |��rF|}n@|jtjk�rbt| ||�}n$|jtjk�r�t| |j d ��r�|}|r|�s�| S t|�r| S qdS ) z� Returns the node which binds variable name, otherwise None.
If optional argument package is supplied, only imports will
be returned.
See test cases for examples.Nr rb r^ r] �:� rW )rQ rX r Zfor_stmt�_findr� r� Zif_stmtZ
while_stmtZtry_stmtrn r �COLONr � _def_syms�_is_import_bindingr� r} r� )r r/ r� �childZretr: �iZkidr r r
r� i sH
r� c C sT |g}|rP|� � }|jdkr4|jtkr4|�|j� q|jtjkr|j| kr|S qd S )N� )�poprX � _block_syms�extendrQ r r r )r r/ Znodesr r r
r� � s r� c C s� | j tjkr�|s�| jd }|j tjkrx|jD ]H}|j tjkrV|jd j|krt| S q,|j tjkr,|j|kr,| S q,nL|j tjkr�|jd }|j tjkr�|j|kr�| S n|j tjkr�|j|kr�| S n�| j tj k�r�|r�t
| jd �� � |kr�dS | jd }|�rt d|��rdS |j tj
k�r0t ||��r0| S |j tjk�rh|jd }|j tjk�r�|j|k�r�| S n6|j tjk�r�|j|k�r�| S |�r�|j tjk�r�| S dS )z� Will reuturn node if node will import name, or node
will import * from package. None is returned otherwise.
See test cases for examples. r r^ rb Nr] �as)rX r r� rQ Zdotted_as_namesZdotted_as_namer r r rP �str�stripr� rO Zimport_as_name�STAR)r/ r r� rR r� Zlastr: r r r
r� � s@
r� )N)NN)N)N)N)N)N)6�__doc__Zpgen2r Zpytreer r Zpygramr r r7 r r r r r r r% r( r" r0 r2 r6 r8 r; r@ rC rK rS r\ ra rc re Zconsuming_callsrq rt ru rv rs rz r r� r� r� r� r� r� r| r{ r� r� r! r� r� r� r r r r
�<module> s`
� -
*
__pycache__/fixer_base.cpython-38.opt-2.pyc 0000644 00000006660 15053244165 0014470 0 ustar 00 U
e5d" � @ sP d dl Z ddlmZ ddlmZ ddlmZ G dd� de�ZG dd � d e�Z dS )
� N� )�PatternCompiler)�pygram)�does_tree_importc @ s� e Zd ZdZdZdZdZdZe� d�Z
e � Z dZ
dZdZdZdZdZejZdd� Zdd � Zd
d � Zd d
� Zdd� Zd dd�Zdd� Z d dd�Z dd� Z dd� Z dd � Z dS ) �BaseFixNr ZpostF� c C s || _ || _| �� d S �N)�options�log�compile_pattern)�selfr r
� r
�*/usr/lib64/python3.8/lib2to3/fixer_base.py�__init__/ s zBaseFix.__init__c C s, | j d k r(t� }|j| j dd�\| _| _d S )NT)Z with_tree)�PATTERNr r �pattern� pattern_tree)r ZPCr
r
r r ; s
�zBaseFix.compile_patternc C s
|| _ d S r )�filename)r r r
r
r � set_filenameF s zBaseFix.set_filenamec C s d|i}| j �||�o|S )N�node)r �match�r r Zresultsr
r
r r M s z
BaseFix.matchc C s
t � �d S r )�NotImplementedErrorr r
r
r � transformY s zBaseFix.transform�xxx_todo_changemec C s2 |}|| j kr"|tt| j�� }q| j �|� |S r )�
used_names�str�next�numbers�add)r �template�namer
r
r �new_namei s
zBaseFix.new_namec C s. | j r d| _ | j�d| j � | j�|� d S )NFz### In file %s ###)� first_logr
�appendr )r �messager
r
r � log_messaget s zBaseFix.log_messagec C s> |� � }|�� }d|_d}| �|||f � |r:| �|� d S )N� z Line %d: could not convert: %s)�
get_linenoZclone�prefixr& )r r �reason�linenoZ
for_output�msgr
r
r �cannot_convertz s zBaseFix.cannot_convertc C s |� � }| �d||f � d S )Nz Line %d: %s)r( r& )r r r* r+ r
r
r �warning� s zBaseFix.warningc C s( |j | _ | �|� t�d�| _d| _d S )Nr T)r r � itertools�countr r# �r Ztreer r
r
r �
start_tree� s
zBaseFix.start_treec C s d S r r
r1 r
r
r � finish_tree� s zBaseFix.finish_tree)r )N)!�__name__�
__module__� __qualname__r r r r r r/ r0 r �setr �orderZexplicitZ run_orderZ _accept_typeZkeep_line_orderZ
BM_compatibler Zpython_symbolsZsymsr r r r r r" r& r- r. r2 r3 r
r
r
r r s2
r c s( e Zd ZdZ� fdd�Zdd� Z� ZS )�ConditionalFixNc s t t| �j|� d | _d S r )�superr9 r2 � _should_skip)r �args�� __class__r
r r2 � s zConditionalFix.start_treec C sJ | j d k r| j S | j�d�}|d }d�|d d� �}t|||�| _ | j S )N�.���)r; �skip_on�split�joinr )r r Zpkgr! r
r
r � should_skip� s
zConditionalFix.should_skip)r4 r5 r6 rA r2 rD �
__classcell__r
r
r= r r9 � s r9 )
r/ Zpatcompr r' r Z
fixer_utilr �objectr r9 r
r
r
r �<module> s __pycache__/fixer_util.cpython-38.opt-2.pyc 0000644 00000023464 15053244165 0014534 0 ustar 00 U
e5dg; �
@ s� d dl mZ d dlmZmZ d dlmZ d dlm Z dd� Z
dd� Z d d
� Z d d � Z
dVdd�Zdd� Zdd� Zdd� Ze � e � fdd�ZdWdd�Zdd� Zd d � ZdXd d �Zd d!� ZdYd"d#�ZdZd$d%�Zd&d'� Zd(d)� Zd*d+� Z d,d-� Z d.d/� Z d0d1d2d3d4d5d6d7d8d9h
Z d:d;� Z d<a!d=a"d>a#d?a$d@dA� Z%dBdC� Z&dDdE� Z'dFdG� Z(dHdI� Z)dJdK� Z*dLdM� Z+dNdO� Z,ej-ej.hZ/d[dPdQ�Z0ej.ej-ej1hZ2dRdS� Z3d\dTdU�Z4d
S )]� )�token)�Leaf�Node)�python_symbols)�patcompc C s t tj| ttjd�|g�S )N�=)r �symsZargumentr r �EQUAL)�keyword�value� r �*/usr/lib64/python3.8/lib2to3/fixer_util.py�
KeywordArg s �r c C s t tjd�S )N�()r r �LPARr r r r
�LParen s r c C s t tjd�S )N�))r r �RPARr r r r
�RParen s r c C sH t | t�s| g} t |t�s&d|_|g}ttj| ttjddd�g | �S )N� r ��prefix) �
isinstance�listr r r �atomr r r )�target�sourcer r r
�Assign s
�r Nc C s t tj| |d�S �Nr )r r �NAME)�namer r r r
�Name$ s r! c C s | t tjt� |g�gS �N)r r �trailer�Dot)�obj�attrr r r
�Attr( s r' c C s t tjd�S )N�,)r r �COMMAr r r r
�Comma, s r* c C s t tjd�S )N�.)r r �DOTr r r r
r$ 0 s r$ c C s4 t tj|�� |�� g�}| r0|�dt tj| �� |S )Nr )r r r# �clone� insert_child�arglist)�argsZlparenZrparen�noder r r
�ArgList4 s r2 c C s& t tj| t|�g�}|d k r"||_|S r" )r r �powerr2 r )Z func_namer0 r r1 r r r
�Call; s r4 c C s t tjd�S )N�
�r r �NEWLINEr r r r
�NewlineB s r8 c C s t tjd�S )N� r6 r r r r
� BlankLineF s r: c C s t tj| |d�S r )r r �NUMBER)�nr r r r
�NumberJ s r= c C s" t tjttjd�| ttjd�g�S )N�[�])r r r# r r �LBRACE�RBRACE)Z
index_noder r r
� SubscriptM s
�rB c C s t tj| |d�S r )r r �STRING)�stringr r r r
�StringS s rE c C s� d| _ d|_ d|_ ttjd�}d|_ ttjd�}d|_ ||||g}|rtd|_ ttjd�}d|_ |�ttj||g�� ttj| ttj |�g�}ttj
ttj d�|ttj d�g�S )Nr9 r �for�in�ifr> r? )
r r r r �appendr r Zcomp_ifZ listmakerZcomp_forr r@ rA ) Zxp�fp�itZtestZfor_leafZin_leafZ
inner_argsZif_leaf�innerr r r
�ListCompW s(
��rM c C sV |D ] }|� � qttjd�ttj| dd�ttjddd�ttj|�g}ttj|�}|S )N�fromr r �import)�remover r r r r �import_as_names� import_from)Z package_nameZ
name_leafsZleaf�children�impr r r
�
FromImporto s
� rU c C s� |d � � }|jtjkr"|� � }nttj|� � g�}|d }|rNdd� |D �}ttjtt|d �t|d ��ttj|d � � ||d � � g�g | �}| j |_ |S ) Nr% �afterc S s g | ] }|� � �qS r )r- )�.0r< r r r
�
<listcomp>� s z!ImportAndCall.<locals>.<listcomp>� r ZlparZrpar)
r- �typer r/ r r3 r' r! r# r )r1 �results�namesr% Z
newarglistrV �newr r r
�
ImportAndCall� s*
�����r^ c C s� t | t�r | jt� t� gkr dS t | t�o�t| j�dko�t | jd t�o�t | jd t�o�t | jd t�o�| jd jdko�| jd jdkS )NT� rY r � r r )r r rS r r �lenr r �r1 r r r
�is_tuple� s
������rc c C sX t | t�oVt| j�dkoVt | jd t�oVt | jd t�oV| jd jdkoV| jd jdkS )Nr rY ���r> r? )r r ra rS r r rb r r r
�is_list� s
�����re c C s t tjt� | t� g�S r" )r r r r r rb r r r
� parenthesize� s rf �sortedr �set�any�all�tuple�sum�min�max� enumeratec c s$ t | |�}|r |V t ||�}q
d S r" )�getattr)r% r& �nextr r r
�
attr_chain� s
rr zefor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
z�
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
z`
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
Fc C sp t s&t�t�at�t�at�t�ada tttg}t|t| d��D ]*\}}i }|�||�r@|d | kr@ dS q@dS )NT�parentr1 F) �
pats_builtr Zcompile_pattern�p0�p1�p2�ziprr �match)r1 Zpatterns�patternrs r[ r r r
�in_special_context� s
r{ c C s� | j }|d k r |jtjkr dS | j}|jtjtjfkr:dS |jtjkrX|j d | krXdS |jtj
ks�|jtj kr�|d k r�|jtj ks�|j d | kr�dS dS )NFrY T)
Z prev_siblingrZ r r, rs r �funcdef�classdef� expr_stmtrS Z
parametersZ
typedargslistr) )r1 �prevrs r r r
�is_probably_builtin� s&
��
� �r� c C sJ | d k rF| j tjkr>t| j�dkr>| jd }|j tjkr>|jS | j} q dS )Nr` r r9 ) rZ r �suitera rS r �INDENTr rs )r1 �indentr r r
�find_indentation s
r� c C s> | j tjkr| S | �� } | jd }| _ttj| g�}||_|S r" )rZ r r� r- rs r )r1 rs r� r r r
�
make_suite s r� c C s$ | j tjkr | j} | s td��q | S )Nz,root found before file_input node was found.)rZ r Z
file_inputrs �
ValueErrorrb r r r
� find_root& s
r� c C s t |t|�| �}t|�S r" )� find_bindingr� �bool)�packager r1 Zbindingr r r
�does_tree_import/ s r� c C s | j tjtjfkS r" )rZ r � import_namerR rb r r r
� is_import7 s r� c C s. dd� }t |�}t| ||�r d S d }}t|j�D ]F\}}||�sDq2t|j|d � �D ]\}}||�sV qlqV|| } qzq2|dkr�t|j�D ]8\}}|jtjkr�|jr�|jd jtjkr�|d } q�q�| d kr�t tj
t tj d�t tj |dd�g�} nt
| t tj |dd�g�} | t� g}
|�|t tj|
�� d S )Nc S s | j tjko | jo t| jd �S )NrY )rZ r � simple_stmtrS r� rb r r r
�is_import_stmt> s �z$touch_import.<locals>.is_import_stmtrY r rO r r )r� r� ro rS rZ r r� r rC r r� r r rU r8 r. ) r� r r1 r� �rootZ
insert_pos�offset�idxZnode2�import_rS r r r
� touch_import; s8 �
�
r� c C s� |j D �]�}d }|jtjkrVt| |j d �r4| S t| t|j d �|�}|rR|}�n0|jtjtjfkr�t| t|j d �|�}|r�|}� n�|jtj k�rt| t|j d �|�}|r�|}nTt
|j dd � �D ]@\}}|jt j kr�|j
dkr�t| t|j |d �|�}|r�|}q�nx|jtk�r2|j d j
| k�r2|}nTt|| |��rF|}n@|jtjk�rbt| ||�}n$|jtjk�r�t| |j d ��r�|}|r|�s�| S t|�r| S qd S )Nr rd r` r_ �:� rY )rS rZ r Zfor_stmt�_findr� r� Zif_stmtZ
while_stmtZtry_stmtro r �COLONr � _def_syms�_is_import_bindingr� r~ r� )r r1 r� �childZretr< �iZkidr r r
r� i sH
r� c C sT |g}|rP|� � }|jdkr4|jtkr4|�|j� q|jtjkr|j| kr|S qd S )N� )�poprZ � _block_syms�extendrS r r r )r r1 Znodesr r r
r� � s r� c C s� | j tjkr�|s�| jd }|j tjkrx|jD ]H}|j tjkrV|jd j|krt| S q,|j tjkr,|j|kr,| S q,nL|j tjkr�|jd }|j tjkr�|j|kr�| S n|j tjkr�|j|kr�| S n�| j tj k�r�|r�t
| jd �� � |kr�d S | jd }|�rt d|��rd S |j tj
k�r0t ||��r0| S |j tjk�rh|jd }|j tjk�r�|j|k�r�| S n6|j tjk�r�|j|k�r�| S |�r�|j tjk�r�| S d S )Nr r` rd r_ �as)rZ r r� rS Zdotted_as_namesZdotted_as_namer r r rR �str�stripr� rQ Zimport_as_name�STAR)r1 r r� rT r� Zlastr< r r r
r� � s@
r� )N)NN)N)N)N)N)N)5Zpgen2r Zpytreer r Zpygramr r r9 r r r r r r! r' r* r$ r2 r4 r8 r: r= rB rE rM rU r^ rc re rf Zconsuming_callsrr ru rv rw rt r{ r� r� r� r� r� r� r� r} r| r� r� r# r� r� r� r r r r
�<module> s^
� -
*
__pycache__/btm_utils.cpython-38.pyc 0000644 00000014010 15053244165 0013407 0 ustar 00 U
e5d�& � @ s| d Z ddlmZ ddlmZmZ ddlmZmZ eZ eZ
ej Z eZ
dZdZdZG dd � d e�Zdd d �Zd
d� Zdd� Zd
S )z0Utility functions used by the btm_matcher module� )�pytree)�grammar�token)�pattern_symbols�python_symbols���������c @ s: e Zd ZdZd
dd�Zdd� Zdd� Zd d
� Zd d � ZdS )�MinNodez�This class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatternsNc C s. || _ || _g | _d| _d | _g | _g | _d S )NF)�type�name�children�leaf�parent� alternatives�group)�selfr r � r �)/usr/lib64/python3.8/lib2to3/btm_utils.py�__init__ s zMinNode.__init__c C s t | j�d t | j� S )N� )�strr r )r r r r �__repr__ s zMinNode.__repr__c C s� | }g }|r�|j tkr^|j�|� t|j�t|j�krRt|j�g}g |_|j}qn |j}d}q�|j tkr�|j �|� t|j �t|j�kr�t
|j �}g |_ |j}qn |j}d}q�|j t j kr�|j
r�|�|j
� n |�|j � |j}q|S )z�Internal method. Returns a characteristic path of the
pattern tree. This method must be run for all leaves until the
linear subpatterns are merged into a singleN)r �TYPE_ALTERNATIVESr �append�lenr
�tupler �
TYPE_GROUPr � get_characteristic_subpattern� token_labels�NAMEr )r �node�subpr r r � leaf_to_root! s8
zMinNode.leaf_to_rootc C s& | � � D ]}|�� }|r| S qdS )a� Drives the leaf_to_root method. The reason that
leaf_to_root must be run multiple times is because we need to
reject 'group' matches; for example the alternative form
(a | b c) creates a group [b c] that needs to be matched. Since
matching multiple linear patterns overcomes the automaton's
capabilities, leaf_to_root merges each group into a single
choice based on 'characteristic'ity,
i.e. (a|b c) -> (a|b) if b more characteristic than c
Returns: The most 'characteristic'(as defined by
get_characteristic_subpattern) path for the compiled pattern
tree.
N)�leavesr# )r �lr" r r r �get_linear_subpatternK s z MinNode.get_linear_subpatternc c s* | j D ]}|�� E dH q| j s&| V dS )z-Generator that returns the leaves of the treeN)r
r$ )r �childr r r r$ ` s
zMinNode.leaves)NN) �__name__�
__module__� __qualname__�__doc__r r r# r& r$ r r r r r
s
*r
Nc
C s� d}| j tjkr| jd } | j tjkr�t| j�dkrFt| jd |�}nFttd�}| jD ]4}| j� |�d rlqVt||�}|dk rV|j�
|� qV�n| j tj kr�t| j�dkr�tt d�}| jD ] }t||�}|r�|j�
|� q�|js�d}nt| jd |�}�n�| j tj
k�r�t| jd tj��r>| jd jdk�r>t| jd |�S t| jd tj��rd| jd jdk�s�t| j�dk�r�t| jd d��r�| jd jdk�r�dS d }d}d}d
}d} d
}
| jD ]d}|j tjk�r�d
}|}n*|j tjk�r�d }|} n|j tjk�r |}t|d��r�|jd k�r�d }
�q�|
�rT| jd } t| d��r^| jdk�r^| jd } n
| jd } | j tjk�r�| jd
k�r�ttd�}n4tt| j��r�ttt| j�d�}nttt| j�d�}n\| j tjk�r�| j�d�} | t k�r�tt | d�}nttj| d�}n| j tjk�rt||�}|�rL| jd jdk�r4d}n| jd jdk�rHnt �|�r�|dk �r�|jdd� D ]&}t||�}|dk �rj|j�
|� �qj|�r�||_ |S )z�
Internal function. Reduces a compiled pattern tree to an
intermediate representation suitable for feeding the
automaton. This also trims off any optional pattern elements(like
[a], a*).
N� � )r r �(�[�valueTF�=� �any�')r r �*�+r ) r �symsZMatcherr
Z Alternativesr � reduce_treer
r �indexr Z Alternativer ZUnit�
isinstancer ZLeafr0 �hasattrZDetailsZRepeaterr r �TYPE_ANY�getattr�pysyms�STRING�strip�tokens�NotImplementedErrorr )
r! r Znew_noder' Zreducedr Z details_nodeZalternatives_nodeZ has_repeaterZ
repeater_nodeZhas_variable_nameZ name_leafr r r r r8 g s�
�� ���
r8 c s� t | t�s| S t| �dkr"| d S g }g }dddddg�g }d� | D ]d}tt|d d
� ��rDtt|� fd d
���r||�|� qDtt|�fd d
���r�|�|� qD|�|� qD|r�|} n|r�|} n|r�|} t| td
�S )z�Picks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
r r, �in�for�if�not�Nonez[]().,:c S s t | �tkS �N)r r ��xr r r �<lambda>� � z/get_characteristic_subpattern.<locals>.<lambda>c s t | t�o| � kS rH �r: r rI )� common_charsr r rK rL c s t | t�o| � kS rH rM rI )� common_namesr r rK rL )�key)r: �listr r3 �rec_testr �max)Z subpatternsZsubpatterns_with_namesZ subpatterns_with_common_namesZ subpatterns_with_common_chars�
subpatternr )rN rO r r � s6
�
� r c c s8 | D ].}t |ttf�r(t||�E dH q||�V qdS )zPTests test_func on all items of sequence and items of included
sub-iterablesN)r: rQ r rR )ZsequenceZ test_funcrJ r r r rR s rR )N)r+ � r Zpgen2r r Zpygramr r r7 r> ZopmaprA r r< r r �objectr
r8 r rR r r r r �<module> s W
% __pycache__/btm_utils.cpython-38.opt-2.pyc 0000644 00000011040 15053244165 0014347 0 ustar 00 U
e5d�& � @ sx d dl mZ d dlmZmZ d dlmZmZ eZeZ ej
Z eZ dZ
dZdZG dd� de�Zdd
d �Zd d
� Zdd� Zd S )� )�pytree)�grammar�token)�pattern_symbols�python_symbols���������c @ s6 e Zd Zd dd�Zdd� Zdd� Zdd � Zd
d � ZdS )
�MinNodeNc C s. || _ || _g | _d| _d | _g | _g | _d S )NF)�type�name�children�leaf�parent� alternatives�group)�selfr r � r �)/usr/lib64/python3.8/lib2to3/btm_utils.py�__init__ s zMinNode.__init__c C s t | j�d t | j� S )N� )�strr r )r r r r �__repr__ s zMinNode.__repr__c C s� | }g }|r�|j tkr^|j�|� t|j�t|j�krRt|j�g}g |_|j}qn |j}d }q�|j tkr�|j �|� t|j �t|j�kr�t
|j �}g |_ |j}qn |j}d }q�|j t j kr�|j
r�|�|j
� n |�|j � |j}q|S �N)r �TYPE_ALTERNATIVESr �append�lenr
�tupler �
TYPE_GROUPr � get_characteristic_subpattern� token_labels�NAMEr )r �node�subpr r r � leaf_to_root! s8
zMinNode.leaf_to_rootc C s& | � � D ]}|�� }|r| S qd S r )�leavesr$ )r �lr# r r r �get_linear_subpatternK s z MinNode.get_linear_subpatternc c s* | j D ]}|�� E d H q| j s&| V d S r )r
r% )r �childr r r r% ` s
zMinNode.leaves)NN)�__name__�
__module__� __qualname__r r r$ r' r% r r r r r
s
*r
Nc
C s� d }| j tjkr| jd } | j tjkr�t| j�dkrFt| jd |�}nFttd�}| jD ]4}| j� |�d rlqVt||�}|d k rV|j�
|� qV�n| j tj kr�t| j�dkr�tt d�}| jD ] }t||�}|r�|j�
|� q�|js�d }nt| jd |�}�n�| j tj
k�r�t| jd tj��r>| jd jdk�r>t| jd |�S t| jd tj��rd| jd jdk�s�t| j�dk�r�t| jd d��r�| jd jdk�r�d S d}d }d }d }d } d }
| jD ]d}|j tjk�r�d }|}n*|j tjk�r�d}|} n|j tjk�r |}t|d��r�|jd
k�r�d}
�q�|
�rT| jd } t| d��r^| jdk�r^| jd } n
| jd } | j tjk�r�| jd k�r�ttd�}n4tt| j��r�ttt| j�d�}nttt| j�d�}n\| j tjk�r�| j�d
�} | t k�r�tt | d�}nttj| d�}n| j tjk�rt||�}|�rL| jd jdk�r4d }n| jd jdk�rHnt �|�r�|d k �r�|jdd� D ]&}t||�}|d k �rj|j�
|� �qj|�r�||_ |S )N� � )r r �(�[�valueTF�=� �any�')r r �*�+r ) r �symsZMatcherr
Z Alternativesr � reduce_treer
r �indexr Z Alternativer ZUnit�
isinstancer ZLeafr0 �hasattrZDetailsZRepeaterr r! �TYPE_ANY�getattr�pysyms�STRING�strip�tokens�NotImplementedErrorr )
r" r Znew_noder( Zreducedr Z details_nodeZalternatives_nodeZ has_repeaterZ
repeater_nodeZhas_variable_nameZ name_leafr r r r r8 g s�
�� ���
r8 c s� t | t�s| S t| �dkr"| d S g }g }dddddg�g }d� | D ]d}tt|d d
� ��rDtt|� fd d
���r||�|� qDtt|�fd d
���r�|�|� qD|�|� qD|r�|} n|r�|} n|r�|} t| td
�S )Nr r, �in�for�if�not�Nonez[]().,:c S s t | �tkS r )r r ��xr r r �<lambda>� � z/get_characteristic_subpattern.<locals>.<lambda>c s t | t�o| � kS r �r: r rH )� common_charsr r rJ rK c s t | t�o| � kS r rL rH )� common_namesr r rJ rK )�key)r: �listr r3 �rec_testr �max)Z subpatternsZsubpatterns_with_namesZ subpatterns_with_common_namesZ subpatterns_with_common_chars�
subpatternr )rM rN r r � s6
�
� r c c s8 | D ].}t |ttf�r(t||�E d H q||�V qd S r )r: rP r rQ )ZsequenceZ test_funcrI r r r rQ s rQ )N)� r Zpgen2r r Zpygramr r r7 r> ZopmaprA r r< r r �objectr
r8 r rQ r r r r �<module> s W
% __pycache__/__main__.cpython-38.opt-1.pyc 0000644 00000000327 15053244165 0014072 0 ustar 00 U
e5dC � @ s& d dl Z ddlmZ e �ed�� dS )� N� )�mainz
lib2to3.fixes)�sysr �exit� r r �(/usr/lib64/python3.8/lib2to3/__main__.py�<module> s __pycache__/__main__.cpython-38.pyc 0000644 00000000327 15053244165 0013133 0 ustar 00 U
e5dC � @ s& d dl Z ddlmZ e �ed�� dS )� N� )�mainz
lib2to3.fixes)�sysr �exit� r r �(/usr/lib64/python3.8/lib2to3/__main__.py�<module> s __pycache__/fixer_util.cpython-38.opt-1.pyc 0000644 00000027650 15053244165 0014534 0 ustar 00 U
e5dg; �
@ s� d Z ddlmZ ddlmZmZ ddlmZ ddl m
Z
dd� Z dd � Z d
d � Z
d d
� ZdWdd�Zdd� Zdd� Zdd� Ze � e
� fdd�ZdXdd�Zdd � Zd d � ZdYd d �Zd!d"� ZdZd#d$�Zd[d%d&�Zd'd(� Zd)d*� Z d+d,� Z d-d.� Z d/d0� Z d1d2d3d4d5d6d7d8d9d:h
Z d;d<� Z!d=a"d>a#d?a$d@a%dAdB� Z&dCdD� Z'dEdF� Z(dGdH� Z)dIdJ� Z*dKdL� Z+dMdN� Z,dOdP� Z-ej.ej/hZ0d\dQdR�Z1ej/ej.ej2hZ3dSdT� Z4d]dUdV�Z5dS )^z1Utility functions, node construction macros, etc.� )�token)�Leaf�Node)�python_symbols)�patcompc C s t tj| ttjd�|g�S )N�=)r �symsZargumentr r �EQUAL)�keyword�value� r �*/usr/lib64/python3.8/lib2to3/fixer_util.py�
KeywordArg s �r c C s t tjd�S )N�()r r �LPARr r r r
�LParen s r c C s t tjd�S )N�))r r �RPARr r r r
�RParen s r c C sH t | t�s| g} t |t�s&d|_|g}ttj| ttjddd�g | �S )z Build an assignment statement� r ��prefix) �
isinstance�listr r r �atomr r r )�target�sourcer r r
�Assign s
�r Nc C s t tj| |d�S )zReturn a NAME leafr )r r �NAME)�namer r r r
�Name$ s r c C s | t tjt� |g�gS )zA node tuple for obj.attr)r r �trailer�Dot)�obj�attrr r r
�Attr( s r% c C s t tjd�S )z A comma leaf�,)r r �COMMAr r r r
�Comma, s r( c C s t tjd�S )zA period (.) leaf�.)r r �DOTr r r r
r" 0 s r" c C s4 t tj|�� |�� g�}| r0|�dt tj| �� |S )z-A parenthesised argument list, used by Call()r )r r r! �clone� insert_child�arglist)�argsZlparenZrparen�noder r r
�ArgList4 s r0 c C s& t tj| t|�g�}|dk r"||_|S )zA function callN)r r �powerr0 r )Z func_namer. r r/ r r r
�Call; s r2 c C s t tjd�S )zA newline literal�
�r r �NEWLINEr r r r
�NewlineB s r6 c C s t tjd�S )z A blank line� r4 r r r r
� BlankLineF s r8 c C s t tj| |d�S )Nr )r r �NUMBER)�nr r r r
�NumberJ s r; c C s" t tjttjd�| ttjd�g�S )z A numeric or string subscript�[�])r r r! r r �LBRACE�RBRACE)Z
index_noder r r
� SubscriptM s
�r@ c C s t tj| |d�S )z
A string leafr )r r �STRING)�stringr r r r
�StringS s rC c C s� d| _ d|_ d|_ ttjd�}d|_ ttjd�}d|_ ||||g}|rtd|_ ttjd�}d|_ |�ttj||g�� ttj| ttj |�g�}ttj
ttj d�|ttj d�g�S )zuA list comprehension of the form [xp for fp in it if test].
If test is None, the "if test" part is omitted.
r7 r �for�in�ifr< r= )
r r r r �appendr r Zcomp_ifZ listmakerZcomp_forr r> r? ) Zxp�fp�itZtestZfor_leafZin_leafZ
inner_argsZif_leaf�innerr r r
�ListCompW s(
��rK c C sV |D ] }|� � qttjd�ttj| dd�ttjddd�ttj|�g}ttj|�}|S )zO Return an import statement in the form:
from package import name_leafs�fromr r �import)�remover r r r r �import_as_names� import_from)Z package_nameZ
name_leafsZleaf�children�impr r r
�
FromImporto s
� rS c C s� |d � � }|jtjkr"|� � }nttj|� � g�}|d }|rNdd� |D �}ttjtt|d �t|d ��ttj|d � � ||d � � g�g | �}| j |_ |S ) zfReturns an import statement and calls a method
of the module:
import module
module.name()r# �afterc S s g | ] }|� � �qS r )r+ )�.0r: r r r
�
<listcomp>� s z!ImportAndCall.<locals>.<listcomp>� r ZlparZrpar)
r+ �typer r- r r1 r% r r! r )r/ �results�namesr# Z
newarglistrT �newr r r
�
ImportAndCall� s*
�����r\ c C s� t | t�r | jt� t� gkr dS t | t�o�t| j�dko�t | jd t�o�t | jd t�o�t | jd t�o�| jd jdko�| jd jdkS )z(Does the node represent a tuple literal?T� rW r � r r )r r rQ r r �lenr r �r/ r r r
�is_tuple� s
������ra c C sX t | t�oVt| j�dkoVt | jd t�oVt | jd t�oV| jd jdkoV| jd jdkS )z'Does the node represent a list literal?r rW ���r< r= )r r r_ rQ r r r` r r r
�is_list� s
�����rc c C s t tjt� | t� g�S �N)r r r r r r` r r r
� parenthesize� s re �sortedr �set�any�all�tuple�sum�min�max� enumeratec c s$ t | |�}|r |V t ||�}q
dS )al Follow an attribute chain.
If you have a chain of objects where a.foo -> b, b.foo-> c, etc,
use this to iterate over all objects in the chain. Iteration is
terminated by getattr(x, attr) is None.
Args:
obj: the starting object
attr: the name of the chaining attribute
Yields:
Each successive object in the chain.
N)�getattr)r# r$ �nextr r r
�
attr_chain� s
rq zefor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
z�
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
z`
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
Fc C sp t s&t�t�at�t�at�t�ada tttg}t|t| d��D ]*\}}i }|�||�r@|d | kr@ dS q@dS )a Returns true if node is in an environment where all that is required
of it is being iterable (ie, it doesn't matter if it returns a list
or an iterator).
See test_map_nochange in test_fixers.py for some examples and tests.
T�parentr/ F) �
pats_builtr Zcompile_pattern�p0�p1�p2�ziprq �match)r/ Zpatterns�patternrr rY r r r
�in_special_context� s
rz c C s� | j }|dk r |jtjkr dS | j}|jtjtjfkr:dS |jtjkrX|j d | krXdS |jtj
ks�|jtj kr�|dk r�|jtj ks�|j d | kr�dS dS )zG
Check that something isn't an attribute or function name etc.
NFrW T)
Z prev_siblingrX r r* rr r �funcdef�classdef� expr_stmtrQ Z
parametersZ
typedargslistr' )r/ �prevrr r r r
�is_probably_builtin� s&
��
� �r c C sJ | dk rF| j tjkr>t| j�dkr>| jd }|j tjkr>|jS | j} q dS )z Find the indentation of *node*.Nr^ r r7 ) rX r �suiter_ rQ r �INDENTr rr )r/ �indentr r r
�find_indentation s
r� c C s> | j tjkr| S | �� } | jd }| _ttj| g�}||_|S rd )rX r r� r+ rr r )r/ rr r� r r r
�
make_suite s r� c C s$ | j tjkr | j} | s td��q | S )z Find the top level namespace.z,root found before file_input node was found.)rX r Z
file_inputrr �
ValueErrorr` r r r
� find_root& s
r� c C s t |t|�| �}t|�S )z� Returns true if name is imported from package at the
top level of the tree which node belongs to.
To cover the case of an import like 'import foo', use
None for the package and 'foo' for the name. )� find_bindingr� �bool)�packager r/ Zbindingr r r
�does_tree_import/ s r� c C s | j tjtjfkS )z0Returns true if the node is an import statement.)rX r � import_namerP r` r r r
� is_import7 s r� c C s. dd� }t |�}t| ||�r dS d }}t|j�D ]F\}}||�sDq2t|j|d� �D ]\}}||�sV qlqV|| } qzq2|dkr�t|j�D ]8\}}|jtjkr�|jr�|jd jtjkr�|d } q�q�| dkr�t tj
t tj d�t tj |dd�g�} nt
| t tj |dd�g�} | t� g}
|�|t tj|
�� dS ) z\ Works like `does_tree_import` but adds an import statement
if it was not imported. c S s | j tjko | jo t| jd �S )NrW )rX r � simple_stmtrQ r� r` r r r
�is_import_stmt> s �z$touch_import.<locals>.is_import_stmtNrW r rM r r )r� r� rn rQ rX r r� r rA r r� r r rS r6 r, ) r� r r/ r� �rootZ
insert_pos�offset�idxZnode2�import_rQ r r r
� touch_import; s8 �
�
r� c C s� |j D �]�}d}|jtjkrVt| |j d �r4| S t| t|j d �|�}|rR|}�n0|jtjtjfkr�t| t|j d �|�}|r�|}� n�|jtj k�rt| t|j d �|�}|r�|}nTt
|j dd� �D ]@\}}|jt j kr�|j
dkr�t| t|j |d �|�}|r�|}q�nx|jtk�r2|j d j
| k�r2|}nTt|| |��rF|}n@|jtjk�rbt| ||�}n$|jtjk�r�t| |j d ��r�|}|r|�s�| S t|�r| S qdS ) z� Returns the node which binds variable name, otherwise None.
If optional argument package is supplied, only imports will
be returned.
See test cases for examples.Nr rb r^ r] �:� rW )rQ rX r Zfor_stmt�_findr� r� Zif_stmtZ
while_stmtZtry_stmtrn r �COLONr � _def_syms�_is_import_bindingr� r} r� )r r/ r� �childZretr: �iZkidr r r
r� i sH
r� c C sT |g}|rP|� � }|jdkr4|jtkr4|�|j� q|jtjkr|j| kr|S qd S )N� )�poprX � _block_syms�extendrQ r r r )r r/ Znodesr r r
r� � s r� c C s� | j tjkr�|s�| jd }|j tjkrx|jD ]H}|j tjkrV|jd j|krt| S q,|j tjkr,|j|kr,| S q,nL|j tjkr�|jd }|j tjkr�|j|kr�| S n|j tjkr�|j|kr�| S n�| j tj k�r�|r�t
| jd �� � |kr�dS | jd }|�rt d|��rdS |j tj
k�r0t ||��r0| S |j tjk�rh|jd }|j tjk�r�|j|k�r�| S n6|j tjk�r�|j|k�r�| S |�r�|j tjk�r�| S dS )z� Will reuturn node if node will import name, or node
will import * from package. None is returned otherwise.
See test cases for examples. r r^ rb Nr] �as)rX r r� rQ Zdotted_as_namesZdotted_as_namer r r rP �str�stripr� rO Zimport_as_name�STAR)r/ r r� rR r� Zlastr: r r r
r� � s@
r� )N)NN)N)N)N)N)N)6�__doc__Zpgen2r Zpytreer r Zpygramr r r7 r r r r r r r% r( r" r0 r2 r6 r8 r; r@ rC rK rS r\ ra rc re Zconsuming_callsrq rt ru rv rs rz r r� r� r� r� r� r� r| r{ r� r� r! r� r� r� r r r r
�<module> s`
� -
*
__pycache__/main.cpython-38.opt-1.pyc 0000644 00000020600 15053244165 0013272 0 ustar 00 U
e5d�- � @ s� d Z ddlmZmZ ddlZddlZddlZddlZddlZddl Z ddl
m Z dd� Z G dd � d e j
�Zd
d � Zdd d
�ZdS )z
Main program for 2to3.
� )�with_statement�print_functionN� )�refactorc C s( | � � } |� � }tj| |||dddd�S )z%Return a unified diff of two strings.z
(original)z (refactored)� )Zlineterm)�
splitlines�difflibZ unified_diff)�a�b�filename� r �$/usr/lib64/python3.8/lib2to3/main.py�
diff_texts s �r c s> e Zd ZdZd � fdd� Zdd� Z� fdd�Zd d
� Z� ZS ) �StdoutRefactoringToola2
A refactoring tool that can avoid overwriting its input files.
Prints output to stdout.
Output files can optionally be written to a different directory and or
have an extra file suffix appended to their name for use in situations
where you do not want to replace the input files.
r c sP || _ || _|r&|�tj�s&|tj7 }|| _|| _|| _tt | ��
|||� dS )aF
Args:
fixers: A list of fixers to import.
options: A dict with RefactoringTool configuration.
explicit: A list of fixers to run even if they are explicit.
nobackups: If true no backup '.bak' files will be created for those
files that are being refactored.
show_diffs: Should diffs of the refactoring be printed to stdout?
input_base_dir: The base directory for all input files. This class
will strip this path prefix off of filenames before substituting
it with output_dir. Only meaningful if output_dir is supplied.
All files processed by refactor() must start with this path.
output_dir: If supplied, all converted files will be written into
this directory tree instead of input_base_dir.
append_suffix: If supplied, all files output by this tool will have
this appended to their filename. Useful for changing .py to
.py3 for example by passing append_suffix='3'.
N) � nobackups�
show_diffs�endswith�os�sep�_input_base_dir� _output_dir�_append_suffix�superr �__init__) �selfZfixers�options�explicitr r �input_base_dir�
output_dir�
append_suffix�� __class__r r
r $ s
z StdoutRefactoringTool.__init__c O s* | j �|||f� | jj|f|�|� d S )N)�errors�append�logger�error)r �msg�args�kwargsr r r
� log_errorA s z StdoutRefactoringTool.log_errorc
sz |}| j rH|�| j�r6tj�| j |t| j�d � �}ntd|| jf ��| jrX|| j7 }||kr�tj� |�}tj�
|�s�|r�t� |� | � d||� | j
�s2|d }tj�|�r�zt�|� W n. tk
r� } z| � d|� W 5 d }~X Y nX zt�||� W n2 tk
�r0 } z| � d||� W 5 d }~X Y nX tt| �j} | ||||� | j
�s`t�||� ||k�rvt�||� d S )Nz5filename %s does not start with the input_base_dir %szWriting converted %s to %s.z.bakzCan't remove backup %szCan't rename %s to %s)r �
startswithr r �path�join�len�
ValueErrorr �dirname�isdir�makedirs� log_messager �lexists�remove�OSError�renamer r �
write_file�shutilZcopymode)
r Znew_textr Zold_text�encodingZ
orig_filenamer Zbackup�err�writer r r
r7 E sJ
� ��
�
z StdoutRefactoringTool.write_filec C s� |r| � d|� n�| � d|� | jr�t|||�}zP| jd k rl| j�" |D ] }t|� qHtj�� W 5 Q R X n|D ] }t|� qpW n$ tk
r� t d|f � Y d S X d S )NzNo changes to %sz
Refactored %sz+couldn't encode %s's diff for your terminal)
r2 r r Z output_lock�print�sys�stdout�flush�UnicodeEncodeError�warn)r �old�newr ZequalZ
diff_lines�liner r r
� print_outputl s$
�z"StdoutRefactoringTool.print_output)r r r ) �__name__�
__module__� __qualname__�__doc__r r) r7 rE �
__classcell__r r r r
r s
� 'r c C s t d| f tjd� d S )Nz WARNING: %s��file)r< r= �stderr)r& r r r
rA � s rA c
s� t jdd�}|jddddd� |jdd d
g d d � |jd
dddddd� |jddd
g dd � |jddddd� |jdddd d� |jd d dd d� |jd dd!d� |jd"d#dd$d� |jd%d&dd'd(d � |jd)d*dd+d,d-d.� |jd/d0dd1d� |jd2dd+d,d3d.� d'}i }|�|�\}}|j�r@d4|d5< |j�s:td6� d4|_|j�rZ|j�sZ|� d7� |j
�rt|j�st|� d8� |j�s�|j �r�td9� |j�s�|j�r�|� d:� |j �r�t
d;� t�� �D ]}t
|� �q�|�s�d<S |�s t
d=tjd>� t
d?tjd>� d@S dA|k�r(d4}|j�r(t
dBtjd>� d@S |j�r8d4|dC< |j�rFtjntj}tjdD|dE� t�dF�}tt�� ��} t� fdGdH�|jD ��}
t� } |j �r�d'} |j D ](}
|
dIk�r�d4} n| � � dJ |
� �q�| �r�| � | �n| }n
| � | �}|� |
�}t j!�"|�}|�r0|�#t j$��s0t j!�%|��s0t j!�&|�}|j�rT|�'t j$�}|�(dK|j|� t)t*|�|t*| �|j|j ||j|j
dL�}|j+�s�|�r�|�,� nDz|�||j|j-|j.� W n( tj/k
�r� t
dMtjd>� Y dS X |�0� t1t2|j+��S )Nz�Main program.
Args:
fixer_pkg: the name of a package where the fixers are located.
args: optional; a list of command line arguments. If omitted,
sys.argv[1:] is used.
Returns a suggested exit status (0, 1, 2).
z2to3 [options] file|dir ...)Zusagez-dz--doctests_only�
store_truezFix up doctests only)�action�helpz-fz--fixr# z1Each FIX specifies a transformation; default: all)rO �defaultrP z-jz --processesZstorer �intzRun 2to3 concurrently)rO rQ �typerP z-xz--nofixz'Prevent a transformation from being runz-lz --list-fixesz List available transformationsz-pz--print-functionz0Modify the grammar so that print() is a functionz-vz --verbosezMore verbose loggingz
--no-diffsz#Don't show diffs of the refactoringz-wz--writezWrite back modified filesz-nz --nobackupsFz&Don't write backups for modified filesz-oz --output-dir�strr zXPut output files in this directory instead of overwriting the input files. Requires -n.)rO rS rQ rP z-Wz--write-unchanged-fileszYAlso write files even if no changes were required (useful with --output-dir); implies -w.z --add-suffixzuAppend this string to all output filenames. Requires -n if non-empty. ex: --add-suffix='3' will generate .py3 files.T�write_unchanged_filesz&--write-unchanged-files/-W implies -w.z%Can't use --output-dir/-o without -n.z"Can't use --add-suffix without -n.z@not writing files and not printing diffs; that's not very usefulzCan't use -n without -wz2Available transformations for the -f/--fix option:r z1At least one file or directory argument required.rK zUse --help to show usage.� �-zCan't write to stdin.r z%(name)s: %(message)s)�format�levelz lib2to3.mainc 3 s | ]}� d | V qdS )�.fix_Nr )�.0�fix�� fixer_pkgr r
� <genexpr>� s zmain.<locals>.<genexpr>�allrZ z7Output in %r will mirror the input directory %r layout.)r r r z+Sorry, -j isn't supported on this platform.)3�optparseZ OptionParserZ
add_option�
parse_argsrU r; rA r r r% Z
add_suffixZno_diffsZ
list_fixesr< r Zget_all_fix_namesr= rM r �verbose�logging�DEBUG�INFOZ basicConfigZ getLogger�setZget_fixers_from_packageZnofixr\ �add�union�
differencer r+ � commonprefixr r r0 r/ �rstrip�infor �sortedr" �refactor_stdinZ
doctests_onlyZ processesZMultiprocessingUnsupportedZ summarizerR �bool)r^ r' �parserro �flagsr ZfixnamerY r$ Z avail_fixesZunwanted_fixesr Z all_presentr\ Z requestedZ fixer_namesr Zrtr r] r
�main� s�
� � � �
�
�
��
� � �
� �
� � �
��rs )N)rI Z
__future__r r r= r r rd r8 ra r r r ZMultiprocessRefactoringToolr rA rs r r r r
�<module> s g pgen2/__pycache__/grammar.cpython-38.opt-2.pyc 0000644 00000004724 15053244165 0015021 0 ustar 00 U
e5d� � @ s\ d dl Z ddlmZ G dd� de�ZdZi Ze�� D ]"Zer4e� � \Z
Z e ee �ee
< q4dS )� N� )�tokenc @ s< e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
S )�Grammarc C s< i | _ i | _g | _i | _dg| _i | _i | _i | _d| _d S )N)r ZEMPTY� ) �
symbol2number�
number2symbol�states�dfas�labels�keywords�tokens� symbol2label�start)�self� r �-/usr/lib64/python3.8/lib2to3/pgen2/grammar.py�__init__L s zGrammar.__init__c C s, t |d��}t�| j|tj� W 5 Q R X d S )N�wb)�open�pickle�dump�__dict__ZHIGHEST_PROTOCOL)r �filename�fr r r r W s z Grammar.dumpc C s0 t |d��}t�|�}W 5 Q R X | j�|� d S )N�rb)r r �loadr �update)r r r �dr r r r \ s z Grammar.loadc C s | j �t�|�� d S )N)r r r �loads)r Zpklr r r r b s z
Grammar.loadsc C sT | � � }dD ]}t||t| |��� � q | jd d � |_| jd d � |_| j|_|S )N)r r r r r r
)� __class__�setattr�getattr�copyr
r r )r �newZ dict_attrr r r r" f s z Grammar.copyc C sv ddl m } td� || j� td� || j� td� || j� td� || j� td� || j� td| j� d S ) Nr )�pprintZs2nZn2sr r r
r )r$ �printr r r r r
r )r r$ r r r �reports s
zGrammar.reportN) �__name__�
__module__� __qualname__r r r r r" r& r r r r r s 6
r a
( LPAR
) RPAR
[ LSQB
] RSQB
: COLON
, COMMA
; SEMI
+ PLUS
- MINUS
* STAR
/ SLASH
| VBAR
& AMPER
< LESS
> GREATER
= EQUAL
. DOT
% PERCENT
` BACKQUOTE
{ LBRACE
} RBRACE
@ AT
@= ATEQUAL
== EQEQUAL
!= NOTEQUAL
<> NOTEQUAL
<= LESSEQUAL
>= GREATEREQUAL
~ TILDE
^ CIRCUMFLEX
<< LEFTSHIFT
>> RIGHTSHIFT
** DOUBLESTAR
+= PLUSEQUAL
-= MINEQUAL
*= STAREQUAL
/= SLASHEQUAL
%= PERCENTEQUAL
&= AMPEREQUAL
|= VBAREQUAL
^= CIRCUMFLEXEQUAL
<<= LEFTSHIFTEQUAL
>>= RIGHTSHIFTEQUAL
**= DOUBLESTAREQUAL
// DOUBLESLASH
//= DOUBLESLASHEQUAL
-> RARROW
:= COLONEQUAL
)
r � r �objectr Z opmap_rawZopmap�
splitlines�line�split�op�namer! r r r r �<module> s o3 pgen2/__pycache__/parse.cpython-38.opt-1.pyc 0000644 00000014506 15053244165 0014503 0 ustar 00 U
e5d� � @ s4 d Z ddlmZ G dd� de�ZG dd� de�ZdS )z�Parser engine for the grammar tables generated by pgen.
The grammar table must be loaded first.
See Parser/parser.c in the Python distribution for additional info on
how this parsing engine works.
� )�tokenc @ s e Zd ZdZdd� Zdd� ZdS )�
ParseErrorz(Exception to signal the parser is stuck.c C s4 t �| d||||f � || _|| _|| _|| _d S )Nz!%s: type=%r, value=%r, context=%r)� Exception�__init__�msg�type�value�context)�selfr r r r � r �+/usr/lib64/python3.8/lib2to3/pgen2/parse.pyr s
�zParseError.__init__c C s t | �| j| j | j| jffS �N)r r r r )r
r r r �
__reduce__ s zParseError.__reduce__N)�__name__�
__module__� __qualname__�__doc__r r r r r r r s r c @ sL e Zd ZdZddd�Zddd�Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )�Parsera5 Parser engine.
The proper usage sequence is:
p = Parser(grammar, [converter]) # create instance
p.setup([start]) # prepare for parsing
<for each input token>:
if p.addtoken(...): # parse a token; may raise ParseError
break
root = p.rootnode # root of abstract syntax tree
A Parser instance may be reused by calling setup() repeatedly.
A Parser instance contains state pertaining to the current token
sequence, and should not be used concurrently by different threads
to parse separate token sequences.
See driver.py for how to get input tokens by tokenizing a file or
string.
Parsing is complete when addtoken() returns True; the root of the
abstract syntax tree can then be retrieved from the rootnode
instance variable. When a syntax error occurs, addtoken() raises
the ParseError exception. There is no error recovery; the parser
cannot be used after a syntax error was reported (but it can be
reinitialized by calling setup()).
Nc C s || _ |pdd� | _dS )a� Constructor.
The grammar argument is a grammar.Grammar instance; see the
grammar module for more information.
The parser is not ready yet for parsing; you must call the
setup() method to get it started.
The optional convert argument is a function mapping concrete
syntax tree nodes to abstract syntax tree nodes. If not
given, no conversion is done and the syntax tree produced is
the concrete syntax tree. If given, it must be a function of
two arguments, the first being the grammar (a grammar.Grammar
instance), and the second being the concrete syntax tree node
to be converted. The syntax tree is converted from the bottom
up.
A concrete syntax tree node is a (type, value, context, nodes)
tuple, where type is the node type (a token or symbol number),
value is None for symbols and a string for tokens, context is
None or an opaque value used for error reporting (typically a
(lineno, offset) pair), and nodes is a list of children for
symbols, and None for tokens.
An abstract syntax tree node may be anything; this is entirely
up to the converter function.
c S s |S r
r )�grammar�noder r r �<lambda>Z � z!Parser.__init__.<locals>.<lambda>N)r �convert)r
r r r r r r < s zParser.__init__c C sH |dkr| j j}|ddg f}| j j| d|f}|g| _d| _t� | _dS )a� Prepare for parsing.
This *must* be called before starting to parse.
The optional argument is an alternative start symbol; it
defaults to the grammar's start symbol.
You can use a Parser instance to parse any number of programs;
each time you call setup() the parser is reset to an initial
state determined by the (implicit or explicit) start symbol.
N� )r �start�dfas�stack�rootnode�set�
used_names)r
r �newnodeZ
stackentryr r r �setup\ s
z Parser.setupc C s0 | � |||�}| jd \}}}|\}} || }
|
D ]�\} } | jj| \}
}|| kr�| �||| |� | }|| d|fgkr�| �� | js� dS | jd \}}}|\}} qf dS |
dkr2| jj|
}|\}}||kr2| �|
| jj|
| |� qq2d|f|
k�r | �� | j�s*td|||��qtd|||��qdS ) z<Add a token; return True iff this is the end of the program.���r TF� ztoo much inputz bad inputN) �classifyr r �labels�shift�popr �pushr )r
r r r �ilabel�dfa�stater Zstates�firstZarcs�i�newstate�t�vZitsdfaZ itsstatesZitsfirstr r r �addtokent s>
�zParser.addtokenc C sX |t jkr0| j�|� | jj�|�}|dk r0|S | jj�|�}|dkrTtd|||��|S )z&Turn a token into a label. (Internal)Nz bad token) r �NAMEr �addr �keywords�get�tokensr )r
r r r r) r r r r$ � s
zParser.classifyc C sT | j d \}}}|||df}| �| j|�}|dk r@|d �|� |||f| j d< dS )zShift a token. (Internal)r" N)r r r �append) r
r r r. r r* r+ r r r r r r& � s z Parser.shiftc C sB | j d \}}}|d|g f}|||f| j d< | j �|d|f� dS )z Push a nonterminal. (Internal)r" Nr )r r7 ) r
r Znewdfar. r r* r+ r r r r r r( � s z Parser.pushc C s` | j �� \}}}| �| j|�}|dk r\| j rL| j d \}}}|d �|� n|| _| j| j_dS )z Pop a nonterminal. (Internal)Nr" )r r' r r r7 r r )r
ZpopdfaZpopstateZpopnoder r* r+ r r r r r' � s z
Parser.pop)N)N) r r r r r r! r1 r$ r& r( r' r r r r r s
0 r N)r � r r r �objectr r r r r �<module> s
pgen2/__pycache__/grammar.cpython-38.pyc 0000644 00000013043 15053244165 0014053 0 ustar 00 U
e5d� � @ s` d Z ddlZddlmZ G dd� de�ZdZi Ze�� D ]"Z e r8e �
� \Z Z e
ee �ee < q8dS )a� This module defines the data structures used to represent a grammar.
These are a bit arcane because they are derived from the data
structures used by Python's 'pgen' parser generator.
There's also a table here mapping operators to their names in the
token module; the Python tokenize module reports all operators as the
fallback token code OP, but the parser needs the actual token code.
� N� )�tokenc @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )�Grammara� Pgen parsing tables conversion class.
Once initialized, this class supplies the grammar tables for the
parsing engine implemented by parse.py. The parsing engine
accesses the instance variables directly. The class here does not
provide initialization of the tables; several subclasses exist to
do this (see the conv and pgen modules).
The load() method reads the tables from a pickle file, which is
much faster than the other ways offered by subclasses. The pickle
file is written by calling dump() (after loading the grammar
tables using a subclass). The report() method prints a readable
representation of the tables to stdout, for debugging.
The instance variables are as follows:
symbol2number -- a dict mapping symbol names to numbers. Symbol
numbers are always 256 or higher, to distinguish
them from token numbers, which are between 0 and
255 (inclusive).
number2symbol -- a dict mapping numbers to symbol names;
these two are each other's inverse.
states -- a list of DFAs, where each DFA is a list of
states, each state is a list of arcs, and each
arc is a (i, j) pair where i is a label and j is
a state number. The DFA number is the index into
this list. (This name is slightly confusing.)
Final states are represented by a special arc of
the form (0, j) where j is its own state number.
dfas -- a dict mapping symbol numbers to (DFA, first)
pairs, where DFA is an item from the states list
above, and first is a set of tokens that can
begin this grammar rule (represented by a dict
whose values are always 1).
labels -- a list of (x, y) pairs where x is either a token
number or a symbol number, and y is either None
or a string; the strings are keywords. The label
number is the index in this list; label numbers
are used to mark state transitions (arcs) in the
DFAs.
start -- the number of the grammar's start symbol.
keywords -- a dict mapping keyword strings to arc labels.
tokens -- a dict mapping token numbers to arc labels.
c C s< i | _ i | _g | _i | _dg| _i | _i | _i | _d| _d S )N)r ZEMPTY� ) �
symbol2number�
number2symbol�states�dfas�labels�keywords�tokens� symbol2label�start)�self� r �-/usr/lib64/python3.8/lib2to3/pgen2/grammar.py�__init__L s zGrammar.__init__c C s, t |d��}t�| j|tj� W 5 Q R X dS )z)Dump the grammar tables to a pickle file.�wbN)�open�pickle�dump�__dict__ZHIGHEST_PROTOCOL)r �filename�fr r r r W s z Grammar.dumpc C s0 t |d��}t�|�}W 5 Q R X | j�|� dS )z+Load the grammar tables from a pickle file.�rbN)r r �loadr �update)r r r �dr r r r \ s z Grammar.loadc C s | j �t�|�� dS )z3Load the grammar tables from a pickle bytes object.N)r r r �loads)r Zpklr r r r b s z
Grammar.loadsc C sT | � � }dD ]}t||t| |��� � q | jdd� |_| jdd� |_| j|_|S )z#
Copy the grammar.
)r r r r r r
N)� __class__�setattr�getattr�copyr
r r )r �newZ dict_attrr r r r" f s z Grammar.copyc C sv ddl m } td� || j� td� || j� td� || j� td� || j� td� || j� td| j� d S )
z:Dump the grammar tables to standard output, for debugging.r )�pprintZs2nZn2sr r r
r N)r$ �printr r r r r
r )r r$ r r r �reports s
zGrammar.reportN)
�__name__�
__module__� __qualname__�__doc__r r r r r" r& r r r r r s 5
r a
( LPAR
) RPAR
[ LSQB
] RSQB
: COLON
, COMMA
; SEMI
+ PLUS
- MINUS
* STAR
/ SLASH
| VBAR
& AMPER
< LESS
> GREATER
= EQUAL
. DOT
% PERCENT
` BACKQUOTE
{ LBRACE
} RBRACE
@ AT
@= ATEQUAL
== EQEQUAL
!= NOTEQUAL
<> NOTEQUAL
<= LESSEQUAL
>= GREATEREQUAL
~ TILDE
^ CIRCUMFLEX
<< LEFTSHIFT
>> RIGHTSHIFT
** DOUBLESTAR
+= PLUSEQUAL
-= MINEQUAL
*= STAREQUAL
/= SLASHEQUAL
%= PERCENTEQUAL
&= AMPEREQUAL
|= VBAREQUAL
^= CIRCUMFLEXEQUAL
<<= LEFTSHIFTEQUAL
>>= RIGHTSHIFTEQUAL
**= DOUBLESTAREQUAL
// DOUBLESLASH
//= DOUBLESLASHEQUAL
-> RARROW
:= COLONEQUAL
)r* r � r �objectr Z opmap_rawZopmap�
splitlines�line�split�op�namer! r r r r �<module> s o3 pgen2/__pycache__/__init__.cpython-38.opt-2.pyc 0000644 00000000213 15053244165 0015117 0 ustar 00 U
e5d� � @ s d S )N� r r r �./usr/lib64/python3.8/lib2to3/pgen2/__init__.py�<module> s pgen2/__pycache__/driver.cpython-38.pyc 0000644 00000012027 15053244165 0013721 0 ustar 00 U
e5dQ � @ s� d Z dZddgZddlZddlZddlZddlZddlZddlm Z m
Z
m Z m Z m
Z
G dd� de�Zd d
� Zddd�Zdd� Zdd� Zdd� Zedkr�e�ee� �� dS )zZParser driver.
This provides a high-level interface to parse a file into a syntax tree.
z#Guido van Rossum <guido@python.org>�Driver� load_grammar� N� )�grammar�parse�token�tokenize�pgenc @ sH e Zd Zddd�Zddd�Zddd�Zdd d
�Zdd d �Zdd
d�ZdS )r Nc C s& || _ |d krt�� }|| _|| _d S )N)r �logging� getLogger�logger�convert)�selfr r
r � r �,/usr/lib64/python3.8/lib2to3/pgen2/driver.py�__init__ s
zDriver.__init__Fc C s� t �| j| j�}|�� d}d}d } } } } }
d} |D �]8} | \}}}} }
|||fkr�||f|ksxt||f|f��|\}
}||
k r�| d|
| 7 } |
}d}||k r�| |
||� 7 } |}|tjtjfkr�| |7 } | \}}|� d�r<|d7 }d}q<|t
j k�r
tj | }|�r(| j
�dt
j| || � |�||| |f��rT|�rN| j
�d� �q�d} | \}}|� d�r<|d7 }d}q<t �d||| |f��|jS ) z4Parse a series of tokens and return the syntax tree.r r N� �
z%s %r (prefix=%r)zStop.zincomplete input)r ZParserr r
Zsetup�AssertionErrorr �COMMENT�NL�endswithr �OPZopmapr �debug�tok_nameZaddtokenZ
ParseErrorZrootnode)r �tokensr �p�lineno�column�type�value�start�endZ line_text�prefixZ quintupleZs_linenoZs_columnr r r � parse_tokens& s`
�
�zDriver.parse_tokensc C s t �|j�}| �||�S �z*Parse a stream and return the syntax tree.)r �generate_tokens�readliner$ )r �streamr r r r r �parse_stream_rawV s zDriver.parse_stream_rawc C s | � ||�S r% )r) )r r( r r r r � parse_stream[ s zDriver.parse_streamc
C s4 t j|d|d��}| �||�W 5 Q R � S Q R X dS )z(Parse a file and return the syntax tree.�r)�encodingN)�io�openr* )r �filenamer, r r( r r r �
parse_file_ s zDriver.parse_filec C s t �t�|�j�}| �||�S )z*Parse a string and return the syntax tree.)r r& r- �StringIOr' r$ )r �textr r r r r � parse_stringd s zDriver.parse_string)NN)F)F)F)NF)F) �__name__�
__module__� __qualname__r r$ r) r* r0 r3 r r r r r s
0
c C s: t j�| �\}}|dkr d}|| d�tttj�� d S )Nz.txtr �.z.pickle)�os�path�splitext�join�map�str�sys� version_info)�gt�head�tailr r r �_generate_pickle_namej s rC � Grammar.txtTFc
C s� |dkrt �� }|dkr t| �n|}|s2t|| �s�|�d| � t�| �}|r�|�d|� z|�|� W q� tk
r� } z|�d|� W 5 d}~X Y q�X nt �
� }|� |� |S )z'Load the grammar (maybe from a pickle).Nz!Generating grammar tables from %sz Writing grammar tables to %szWriting failed: %s) r
r rC �_newer�infor Zgenerate_grammar�dump�OSErrorr �Grammar�load)r@ Zgp�save�forcer �g�er r r r q s
c C s8 t j�| �sdS t j�|�s dS t j�| �t j�|�kS )z0Inquire whether file a was written since file b.FT)r8 r9 �exists�getmtime)�a�br r r rE � s
rE c C sF t j�|�rt|�S tt j�|��}t�| |�}t� � }|�
|� |S )a� Normally, loads a pickled grammar by doing
pkgutil.get_data(package, pickled_grammar)
where *pickled_grammar* is computed from *grammar_source* by adding the
Python version and using a ``.pickle`` extension.
However, if *grammar_source* is an extant file, load_grammar(grammar_source)
is called instead. This facilitates using a packaged grammar file when needed
but preserves load_grammar's automatic regeneration behavior when possible.
) r8 r9 �isfiler rC �basename�pkgutil�get_datar rI �loads)�packageZgrammar_sourceZ pickled_name�datarM r r r �load_packaged_grammar� s
rZ c G sB | st jdd� } tjtjt jdd� | D ]}t|ddd� q*dS )z�Main program, when run as a script: produce grammar pickle files.
Calls load_grammar for each argument, a path to a grammar text file.
r Nz %(message)s)�levelr( �formatT)rK rL )r> �argvr
Z basicConfig�INFO�stdoutr )�argsr@ r r r �main� s �ra �__main__)rD NTFN)�__doc__�
__author__�__all__r- r8 r
rU r> r r r r r r �objectr rC r rE rZ ra r4 �exit�intr r r r �<module> s( M �
pgen2/__pycache__/pgen.cpython-38.opt-1.pyc 0000644 00000022161 15053244165 0014316 0 ustar 00 U
e5d�5 � @ sd d dl mZmZmZ G dd� dej�ZG dd� de�ZG dd� de�ZG dd � d e�Z dd d �Z
d
S )� )�grammar�token�tokenizec @ s e Zd ZdS )� PgenGrammarN)�__name__�
__module__� __qualname__� r r �*/usr/lib64/python3.8/lib2to3/pgen2/pgen.pyr s r c @ s� e Zd Zd&dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd'd d!�Zd"d#� Zd$d%� ZdS )(�ParserGeneratorNc C sl d }|d krt |�}|j}|| _|| _t�|j�| _| �� | � � \| _
| _ |d k rZ|� i | _ | �
� d S �N)�open�close�filename�streamr �generate_tokens�readline� generator�gettoken�parse�dfas� startsymbol�first� addfirstsets)�selfr r Z close_streamr r r
�__init__ s zParserGenerator.__init__c C s t � }t| j�� �}|�� |�| j� |�d| j� |D ]&}dt|j � }||j |< ||j
|< q:|D ]�}| j| }g }|D ]`}g }t |j �
� �D ]$\} }
|�| �|| �|�|
�f� q�|jr�|�d|�|�f� |�|� q||j�|� || �||�f|j|j | < qf|j | j |_|S )N� � )r �listr �keys�sort�remover �insert�len�
symbol2numberZ
number2symbol�sorted�arcs�items�append�
make_label�index�isfinal�states�
make_first�start) r �c�names�name�i�dfar, �stater& �label�nextr r r
� make_grammar s.
z ParserGenerator.make_grammarc C s4 | j | }i }t|�D ]}| �||�}d||< q|S �Nr )r r% r) )r r/ r1 Zrawfirstr r5 �ilabelr r r
r- 4 s
zParserGenerator.make_firstc C s& t |j�}|d �� r�||jkrZ||jkr4|j| S |j�|j| d f� ||j|< |S n>tt|d �}||jkrz|j| S |j�|d f� ||j|< |S n�t |�}|d �� r�||j
kr�|j
| S |j�tj |f� ||j
|< |S n>t j
| }||jk�r|j| S |j�|d f� ||j|< |S d S �Nr )r# �labels�isalphar$ Z symbol2labelr( �getattrr �tokens�eval�keywords�NAMEr Zopmap)r r/ r5 r9 Zitoken�valuer r r
r) = s6
zParserGenerator.make_labelc C s8 t | j�� �}|�� |D ]}|| jkr| �|� qd S r )r r r r r � calcfirst)r r0 r1 r r r
r k s
z ParserGenerator.addfirstsetsc C s� | j | }d | j|< |d }i }i }|j�� D ]x\}}|| j kr�|| jkrj| j| }|d kr~td| ��n| �|� | j| }|�|� |||< q.d||< |di||< q.i } |�� D ]:\}}
|
D ],} | | kr�td|| || | f ��|| | < q�q�|| j|< d S )Nr zrecursion for rule %rr zArule %s is ambiguous; %s is in the first sets of %s as well as %s)r r r& r' �
ValueErrorrC �update) r r1 r3 r4 ZtotalsetZ overlapcheckr5 r6 �fsetZinverseZitsfirstZsymbolr r r
rC s s4
� zParserGenerator.calcfirstc C s� i }d }| j tjkr�| j tjkr*| �� q| �tj�}| �tjd� | �� \}}| �tj� | � ||�}t
|�}| � |� t
|�}|||< |d kr|}q||fS )N�:) �typer � ENDMARKER�NEWLINEr �expectrA �OP� parse_rhs�make_dfar# � simplify_dfa) r r r r1 �a�zr3 ZoldlenZnewlenr r r
r � s"
zParserGenerator.parsec s� � fdd�}� fdd�� t ||�|�g}|D ]�}i }|jD ].}|jD ]"\}} |d k rD� | |�|i �� qDq:t|�� �D ]@\}}
|D ]} | j|
kr� q�q�t |
|�} |�| � |�| |� qvq,|S )Nc s i }� | |� |S r r )r4 �base��
addclosurer r
�closure� s
z)ParserGenerator.make_dfa.<locals>.closurec s: | |kr d S d|| < | j D ]\}}|d kr� ||� qd S r8 �r& )r4 rR r5 r6 rS r r
rT � s z,ParserGenerator.make_dfa.<locals>.addclosure)�DFAState�nfasetr& �
setdefaultr% r' r( �addarc) r r. �finishrU r, r4 r& Znfastater5 r6 rX �str rS r
rN � s"
zParserGenerator.make_dfac
C s� t d|� |g}t|�D ]|\}}t d|||kr2dp4d� |jD ]T\}}||krZ|�|�} nt|�} |�|� |d kr�t d| � q>t d|| f � q>qd S )NzDump of NFA for� State�(final)� z -> %d� %s -> %d)�print� enumerater& r* r# r( )
r r1 r. r[ Ztodor2 r4 r5 r6 �jr r r
�dump_nfa� s
zParserGenerator.dump_nfac C sd t d|� t|�D ]L\}}t d||jr*dp,d� t|j�� �D ] \}}t d||�|�f � q>qd S )NzDump of DFA forr] r^ r_ r` )ra rb r+ r% r& r' r* )r r1 r3 r2 r4 r5 r6 r r r
�dump_dfa� s
zParserGenerator.dump_dfac C sp d}|rld}t |�D ]T\}}t|d t|��D ]8}|| }||kr.||= |D ]}|�||� qLd} qq.qqd S )NTFr )rb �ranger# �
unifystate)r r3 Zchangesr2 Zstate_irc Zstate_jr4 r r r
rO � s z ParserGenerator.simplify_dfac C s~ | � � \}}| jdkr ||fS t� }t� }|�|� |�|� | jdkrr| �� | � � \}}|�|� |�|� q>||fS d S )N�|)� parse_altrB �NFAStaterZ r )r rP rQ ZaaZzzr r r
rM � s
zParserGenerator.parse_rhsc C sL | � � \}}| jdks(| jtjtjfkrD| � � \}}|�|� |}q ||fS )N)�(�[)�
parse_itemrB rH r rA �STRINGrZ )r rP �br/ �dr r r
ri
s
�
zParserGenerator.parse_altc C s� | j dkr>| �� | �� \}}| �tjd� |�|� ||fS | �� \}}| j }|dkr`||fS | �� |�|� |dkr�||fS ||fS d S )Nrl �])�+�*rr )rB r rM rK r rL rZ �
parse_atom)r rP rQ rB r r r
rm s
zParserGenerator.parse_itemc C s� | j dkr4| �� | �� \}}| �tjd� ||fS | jtjtjfkrpt � }t � }|�
|| j � | �� ||fS | � d| j| j � d S )Nrk �)z+expected (...) or NAME or STRING, got %s/%s) rB r rM rK r rL rH rA rn rj rZ � raise_error)r rP rQ r r r
rt ( s
�zParserGenerator.parse_atomc C sD | j |ks |d k r2| j|kr2| �d||| j | j� | j}| �� |S )Nzexpected %s/%s, got %s/%s)rH rB rv r )r rH rB r r r
rK 9 s �zParserGenerator.expectc C sF t | j�}|d tjtjfkr*t | j�}q
|\| _| _| _| _| _ d S r: )
r6 r r �COMMENT�NLrH rB Zbegin�end�line)r �tupr r r
r A s
zParserGenerator.gettokenc
G s^ |r8z || }W n& d� |gttt|�� �}Y nX t|| j| jd | jd | jf��d S )N� r r )�joinr �map�str� SyntaxErrorr ry rz )r �msg�argsr r r
rv H s �zParserGenerator.raise_error)N)N)r r r r r7 r- r) r rC r rN rd re rO rM ri rm rt rK r rv r r r r
r
s$
. $
r c @ s e Zd Zdd� Zddd�ZdS )rj c C s
g | _ d S r rV )r r r r
r S s zNFAState.__init__Nc C s | j �||f� d S r )r& r( �r r6 r5 r r r
rZ V s zNFAState.addarc)N)r r r r rZ r r r r
rj Q s rj c @ s0 e Zd Zdd� Zdd� Zdd� Zdd� Zd Zd S )
rW c C s || _ ||k| _i | _d S r )rX r+ r& )r rX �finalr r r
r ] s
zDFAState.__init__c C s || j |< d S r rV r� r r r
rZ e s zDFAState.addarcc C s* | j �� D ]\}}||kr
|| j |< q
d S r )r& r' )r �old�newr5 r6 r r r
rg k s zDFAState.unifystatec C sV | j |j krdS t| j�t|j�kr(dS | j�� D ] \}}||j�|�k r2 dS q2dS )NFT)r+ r# r& r' �get)r �otherr5 r6 r r r
�__eq__p s zDFAState.__eq__N)r r r r rZ rg r� �__hash__r r r r
rW [ s
rW � Grammar.txtc C s t | �}|�� S r )r r7 )r �pr r r
�generate_grammar� s r� N)r� ) r_ r r r ZGrammarr �objectr rj rW r� r r r r
�<module> s I
% pgen2/__pycache__/literals.cpython-38.opt-1.pyc 0000644 00000002530 15053244165 0015202 0 ustar 00 U
e5dc � @ sP d Z ddlZddddddd d
d d d
�
Zdd� Zdd� Zdd� ZedkrLe� dS )z<Safely evaluate Python string literals without using eval().� N��� �
�
� � �'�"�\)
�a�b�f�n�r�t�vr r
r c C s� | � dd�\}}t�|�}|d k r&|S |�d�r�|dd � }t|�dk rTtd| ��zt|d�}W q� tk
r� td| �d �Y q�X n2zt|d�}W n" tk
r� td| �d �Y nX t|�S ) Nr � �x� z!invalid hex string escape ('\%s')� � z#invalid octal string escape ('\%s'))�group�simple_escapes�get�
startswith�len�
ValueError�int�chr)�m�all�tailZescZhexes�i� r$ �./usr/lib64/python3.8/lib2to3/pgen2/literals.py�escape s"
r& c C sH | d }| d d� |d kr$|d }| t |�t |� � } t�dt| �S )Nr � z)\\(\'|\"|\\|[abfnrtv]|x.{0,2}|[0-7]{1,3}))r �re�subr& )�s�qr$ r$ r% �
evalString( s
r, c C s@ t d�D ]2} t| �}t|�}t|�}||krt| |||� qd S )N� )�ranger �reprr, �print)r# �cr* �er$ r$ r% �test2 s r3 �__main__)�__doc__r( r r& r, r3 �__name__r$ r$ r$ r% �<module> s" �
pgen2/__pycache__/literals.cpython-38.pyc 0000644 00000003024 15053244165 0014242 0 ustar 00 U
e5dc � @ sP d Z ddlZddddddd d
d d d
�
Zdd� Zdd� Zdd� ZedkrLe� dS )z<Safely evaluate Python string literals without using eval().� N��� �
�
� � �'�"�\)
�a�b�f�n�r�t�vr r
r c C s� | � dd�\}}|�d�s t�t�|�}|d k r4|S |�d�r�|dd � }t|�dk rbtd| ��zt|d�}W q� tk
r� td| �d �Y q�X n2zt|d�}W n" tk
r� td | �d �Y nX t|�S )
Nr � r �x� z!invalid hex string escape ('\%s')� � z#invalid octal string escape ('\%s')) �group�
startswith�AssertionError�simple_escapes�get�len�
ValueError�int�chr)�m�all�tailZescZhexes�i� r% �./usr/lib64/python3.8/lib2to3/pgen2/literals.py�escape s$
r' c C s� | � d�s(| � d�s(tt| d d� ���| d }| d d� |d krL|d }| �|�sptt| t|� d � ���t| �dt|� ks�t�| t|�t|� � } t�dt| �S )Nr r
r r � r z)\\(\'|\"|\\|[abfnrtv]|x.{0,2}|[0-7]{1,3}))r r �repr�endswithr �re�subr' )�s�qr% r% r& �
evalString( s ($r/ c C s@ t d�D ]2} t| �}t|�}t|�}||krt| |||� qd S )N� )�ranger r) r/ �print)r$ �cr- �er% r% r& �test2 s r5 �__main__)�__doc__r+ r r' r/ r5 �__name__r% r% r% r& �<module> s" �
pgen2/__pycache__/pgen.cpython-38.pyc 0000644 00000023062 15053244165 0013360 0 ustar 00 U
e5d�5 � @ sd d dl mZmZmZ G dd� dej�ZG dd� de�ZG dd� de�ZG dd � d e�Z dd d �Z
d
S )� )�grammar�token�tokenizec @ s e Zd ZdS )� PgenGrammarN)�__name__�
__module__� __qualname__� r r �*/usr/lib64/python3.8/lib2to3/pgen2/pgen.pyr s r c @ s� e Zd Zd&dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd'd d!�Zd"d#� Zd$d%� ZdS )(�ParserGeneratorNc C sl d }|d krt |�}|j}|| _|| _t�|j�| _| �� | � � \| _
| _ |d k rZ|� i | _ | �
� d S �N)�open�close�filename�streamr �generate_tokens�readline� generator�gettoken�parse�dfas� startsymbol�first� addfirstsets)�selfr r Z close_streamr r r
�__init__ s zParserGenerator.__init__c C s t � }t| j�� �}|�� |�| j� |�d| j� |D ]&}dt|j � }||j |< ||j
|< q:|D ]�}| j| }g }|D ]`}g }t |j �
� �D ]$\} }
|�| �|| �|�|
�f� q�|jr�|�d|�|�f� |�|� q||j�|� || �||�f|j|j | < qf|j | j |_|S )N� � )r �listr �keys�sort�remover �insert�len�
symbol2numberZ
number2symbol�sorted�arcs�items�append�
make_label�index�isfinal�states�
make_first�start) r �c�names�name�i�dfar, �stater& �label�nextr r r
� make_grammar s.
z ParserGenerator.make_grammarc C s4 | j | }i }t|�D ]}| �||�}d||< q|S �Nr )r r% r) )r r/ r1 Zrawfirstr r5 �ilabelr r r
r- 4 s
zParserGenerator.make_firstc C sb t |j�}|d �� r�||jkrZ||jkr4|j| S |j�|j| d f� ||j|< |S nbtt|d �}t|t �sxt
|��|tj ks�t
|��||j kr�|j | S |j�|d f� ||j |< |S n�|d dks�t
|��t
|�}|d �� �r ||jk� r�|j| S |j�tj|f� ||j|< |S n>tj| }||j k�r@|j | S |j�|d f� ||j |< |S d S )Nr )�"�')r# �labels�isalphar$ Z symbol2labelr( �getattrr �
isinstance�int�AssertionError�tok_name�tokens�eval�keywords�NAMEr Zopmap)r r/ r5 r9 Zitoken�valuer r r
r) = s<
zParserGenerator.make_labelc C s8 t | j�� �}|�� |D ]}|| jkr| �|� qd S r )r r r r r � calcfirst)r r0 r1 r r r
r k s
z ParserGenerator.addfirstsetsc C s� | j | }d | j|< |d }i }i }|j�� D ]x\}}|| j kr�|| jkrj| j| }|d kr~td| ��n| �|� | j| }|�|� |||< q.d||< |di||< q.i } |�� D ]:\}}
|
D ],} | | kr�td|| || | f ��|| | < q�q�|| j|< d S )Nr zrecursion for rule %rr zArule %s is ambiguous; %s is in the first sets of %s as well as %s)r r r& r' �
ValueErrorrH �update) r r1 r3 r4 ZtotalsetZ overlapcheckr5 r6 �fsetZinverseZitsfirstZsymbolr r r
rH s s4
� zParserGenerator.calcfirstc C s� i }d }| j tjkr�| j tjkr*| �� q| �tj�}| �tjd� | �� \}}| �tj� | � ||�}t
|�}| � |� t
|�}|||< |d kr|}q||fS )N�:) �typer � ENDMARKER�NEWLINEr �expectrF �OP� parse_rhs�make_dfar# � simplify_dfa) r r r r1 �a�zr3 ZoldlenZnewlenr r r
r � s"
zParserGenerator.parsec s� t |t�st�t |t�s t�� fdd�}� fdd�� t||�|�g}|D ]�}i }|jD ].}|jD ]"\}} |d k r`� | |�|i �� q`qVt|�� �D ]@\}}
|D ]} | j|
kr� q�q�t|
|�} |� | � |�
| |� q�qH|S )Nc s i }� | |� |S r r )r4 �base��
addclosurer r
�closure� s
z)ParserGenerator.make_dfa.<locals>.closurec sH t | t�st�| |krd S d|| < | jD ]\}}|d kr(� ||� q(d S r8 )r? �NFAStaterA r& )r4 rW r5 r6 rX r r
rY � s z,ParserGenerator.make_dfa.<locals>.addclosure) r? r[ rA �DFAState�nfasetr& �
setdefaultr% r' r( �addarc) r r. �finishrZ r, r4 r& Znfastater5 r6 r] �str rX r
rS � s&
zParserGenerator.make_dfac
C s� t d|� |g}t|�D ]|\}}t d|||kr2dp4d� |jD ]T\}}||krZ|�|�} nt|�} |�|� |d kr�t d| � q>t d|| f � q>qd S )NzDump of NFA for� State�(final)� z -> %d� %s -> %d)�print� enumerater& r* r# r( )
r r1 r. r` Ztodor2 r4 r5 r6 �jr r r
�dump_nfa� s
zParserGenerator.dump_nfac C sd t d|� t|�D ]L\}}t d||jr*dp,d� t|j�� �D ] \}}t d||�|�f � q>qd S )NzDump of DFA forrb rc rd re )rf rg r+ r% r& r' r* )r r1 r3 r2 r4 r5 r6 r r r
�dump_dfa� s
zParserGenerator.dump_dfac C sp d}|rld}t |�D ]T\}}t|d t|��D ]8}|| }||kr.||= |D ]}|�||� qLd} qq.qqd S )NTFr )rg �ranger# �
unifystate)r r3 Zchangesr2 Zstate_irh Zstate_jr4 r r r
rT � s z ParserGenerator.simplify_dfac C s~ | � � \}}| jdkr ||fS t� }t� }|�|� |�|� | jdkrr| �� | � � \}}|�|� |�|� q>||fS d S )N�|)� parse_altrG r[ r_ r )r rU rV ZaaZzzr r r
rR � s
zParserGenerator.parse_rhsc C sL | � � \}}| jdks(| jtjtjfkrD| � � \}}|�|� |}q ||fS )N)�(�[)�
parse_itemrG rM r rF �STRINGr_ )r rU �br/ �dr r r
rn
s
�
zParserGenerator.parse_altc C s� | j dkr>| �� | �� \}}| �tjd� |�|� ||fS | �� \}}| j }|dkr`||fS | �� |�|� |dkr�||fS ||fS d S )Nrp �])�+�*rv )rG r rR rP r rQ r_ �
parse_atom)r rU rV rG r r r
rq s
zParserGenerator.parse_itemc C s� | j dkr4| �� | �� \}}| �tjd� ||fS | jtjtjfkrpt � }t � }|�
|| j � | �� ||fS | � d| j| j � d S )Nro �)z+expected (...) or NAME or STRING, got %s/%s) rG r rR rP r rQ rM rF rr r[ r_ � raise_error)r rU rV r r r
rx ( s
�zParserGenerator.parse_atomc C sD | j |ks |d k r2| j|kr2| �d||| j | j� | j}| �� |S )Nzexpected %s/%s, got %s/%s)rM rG rz r )r rM rG r r r
rP 9 s �zParserGenerator.expectc C sF t | j�}|d tjtjfkr*t | j�}q
|\| _| _| _| _| _ d S )Nr )
r6 r r �COMMENT�NLrM rG Zbegin�end�line)r �tupr r r
r A s
zParserGenerator.gettokenc
G s^ |r8z || }W n& d� |gttt|�� �}Y nX t|| j| jd | jd | jf��d S )N� r r )�joinr �map�str� SyntaxErrorr r} r~ )r �msg�argsr r r
rz H s �zParserGenerator.raise_error)N)N)r r r r r7 r- r) r rH r rS ri rj rT rR rn rq rx rP r rz r r r r
r
s$
. $
r c @ s e Zd Zdd� Zddd�ZdS )r[ c C s
g | _ d S r )r& )r r r r
r S s zNFAState.__init__Nc C s8 |d kst |t�st�t |t�s$t�| j�||f� d S r )r? r� rA r[ r& r( �r r6 r5 r r r
r_ V s zNFAState.addarc)N)r r r r r_ r r r r
r[ Q s r[ c @ s0 e Zd Zdd� Zdd� Zdd� Zdd� Zd Zd S )
r\ c C sL t |t�st�t tt|��t�s$t�t |t�s2t�|| _||k| _i | _d S r ) r? �dictrA r6 �iterr[ r] r+ r& )r r] �finalr r r
r ] s
zDFAState.__init__c C s8 t |t�st�|| jks t�t |t�s*t�|| j|< d S r )r? r� rA r& r\ r� r r r
r_ e s zDFAState.addarcc C s* | j �� D ]\}}||kr
|| j |< q
d S r )r& r' )r �old�newr5 r6 r r r
rl k s zDFAState.unifystatec C sd t |t�st�| j|jkr dS t| j�t|j�kr6dS | j�� D ] \}}||j�|�k r@ dS q@dS )NFT)r? r\ rA r+ r# r& r' �get)r �otherr5 r6 r r r
�__eq__p s zDFAState.__eq__N)r r r r r_ rl r� �__hash__r r r r
r\ [ s
r\ � Grammar.txtc C s t | �}|�� S r )r r7 )r �pr r r
�generate_grammar� s r� N)r� ) rd r r r ZGrammarr �objectr r[ r\ r� r r r r
�<module> s I
% pgen2/__pycache__/token.cpython-38.opt-1.pyc 0000644 00000003541 15053244165 0014506 0 ustar 00 U
e5d � @ sP d Z dZdZdZdZdZdZdZdZd Z d
Z
d Z d Z d
Z
dZdZdZdZdZdZdZdZdZdZdZdZdZdZd Z d Z d Z d Z d Z d!Z!d"Z"d#Z#d$Z$d%Z%d&Z&d'Z'd(Z(d)Z)d*Z*d+Z+d,Z,d-Z-d.Z.d/Z/d0Z0d1Z1d2Z2d3Z3d4Z4d5Z5d6Z6d7Z7d8Z8d9Z9d:Z:d;Z;d<Z<d=Z=d>Z>i Z?e@eA� �B� �D ]$\ZCZDeEeD�eEd�k�reCe?eD< �qd?d@� ZFdAdB� ZGdCdD� ZHdES )Fz!Token constants (from "token.h").� � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; �< � c C s | t k S �N�� NT_OFFSET��x� rD �+/usr/lib64/python3.8/lib2to3/pgen2/token.py�
ISTERMINALO s rF c C s | t kS r? r@ rB rD rD rE �
ISNONTERMINALR s rG c C s | t kS r? )� ENDMARKERrB rD rD rE �ISEOFU s rI N)I�__doc__rH �NAME�NUMBER�STRING�NEWLINE�INDENT�DEDENT�LPAR�RPAR�LSQB�RSQB�COLON�COMMA�SEMI�PLUS�MINUS�STAR�SLASH�VBAR�AMPER�LESS�GREATER�EQUAL�DOT�PERCENTZ BACKQUOTE�LBRACE�RBRACE�EQEQUAL�NOTEQUAL� LESSEQUAL� GREATEREQUAL�TILDE�
CIRCUMFLEX� LEFTSHIFT�
RIGHTSHIFT�
DOUBLESTAR� PLUSEQUAL�MINEQUAL� STAREQUAL�
SLASHEQUAL� PERCENTEQUAL�
AMPEREQUAL� VBAREQUAL�CIRCUMFLEXEQUAL�LEFTSHIFTEQUAL�RIGHTSHIFTEQUAL�DOUBLESTAREQUAL� DOUBLESLASH�DOUBLESLASHEQUAL�AT�ATEQUAL�OP�COMMENT�NL�RARROW�AWAIT�ASYNC�
ERRORTOKEN�
COLONEQUAL�N_TOKENSrA �tok_name�list�globals�items�_nameZ_value�typerF rG rI rD rD rD rE �<module> s� pgen2/__pycache__/driver.cpython-38.opt-1.pyc 0000644 00000011747 15053244165 0014670 0 ustar 00 U
e5dQ � @ s� d Z dZddgZddlZddlZddlZddlZddlZddlm Z m
Z
m Z m Z m
Z
G dd� de�Zd d
� Zddd�Zdd� Zdd� Zdd� Zedkr�e�ee� �� dS )zZParser driver.
This provides a high-level interface to parse a file into a syntax tree.
z#Guido van Rossum <guido@python.org>�Driver� load_grammar� N� )�grammar�parse�token�tokenize�pgenc @ sH e Zd Zddd�Zddd�Zddd�Zdd d
�Zdd d �Zdd
d�ZdS )r Nc C s& || _ |d krt�� }|| _|| _d S )N)r �logging� getLogger�logger�convert)�selfr r
r � r �,/usr/lib64/python3.8/lib2to3/pgen2/driver.py�__init__ s
zDriver.__init__Fc C st t �| j| j�}|�� d}d}d } } } } }
d} |D �]} | \}}}} }
|||fkr�|\}
}||
k r�| d|
| 7 } |
}d}||k r�| |
||� 7 } |}|tjtjfkr�| |7 } | \}}|�d�r<|d7 }d}q<|t j
kr�tj | }|�r
| j �
dt j| || � |�||| |f��r6|�r0| j �
d� �qnd} | \}}|�d�r<|d7 }d}q<t �d||| |f��|jS ) z4Parse a series of tokens and return the syntax tree.r r N� �
z%s %r (prefix=%r)zStop.zincomplete input)r ZParserr r
Zsetupr �COMMENT�NL�endswithr �OPZopmapr �debug�tok_nameZaddtokenZ
ParseErrorZrootnode)r �tokensr �p�lineno�column�type�value�start�endZ line_text�prefixZ quintupleZs_linenoZs_columnr r r � parse_tokens& s^
�
�zDriver.parse_tokensc C s t �|j�}| �||�S �z*Parse a stream and return the syntax tree.)r �generate_tokens�readliner# )r �streamr r r r r �parse_stream_rawV s zDriver.parse_stream_rawc C s | � ||�S r$ )r( )r r' r r r r � parse_stream[ s zDriver.parse_streamc
C s4 t j|d|d��}| �||�W 5 Q R � S Q R X dS )z(Parse a file and return the syntax tree.�r)�encodingN)�io�openr) )r �filenamer+ r r' r r r �
parse_file_ s zDriver.parse_filec C s t �t�|�j�}| �||�S )z*Parse a string and return the syntax tree.)r r% r, �StringIOr& r# )r �textr r r r r � parse_stringd s zDriver.parse_string)NN)F)F)F)NF)F) �__name__�
__module__� __qualname__r r# r( r) r/ r2 r r r r r s
0
c C s: t j�| �\}}|dkr d}|| d�tttj�� d S )Nz.txtr �.z.pickle)�os�path�splitext�join�map�str�sys� version_info)�gt�head�tailr r r �_generate_pickle_namej s rB � Grammar.txtTFc
C s� |dkrt �� }|dkr t| �n|}|s2t|| �s�|�d| � t�| �}|r�|�d|� z|�|� W q� tk
r� } z|�d|� W 5 d}~X Y q�X nt �
� }|� |� |S )z'Load the grammar (maybe from a pickle).Nz!Generating grammar tables from %sz Writing grammar tables to %szWriting failed: %s) r
r rB �_newer�infor Zgenerate_grammar�dump�OSErrorr �Grammar�load)r? Zgp�save�forcer �g�er r r r q s
c C s8 t j�| �sdS t j�|�s dS t j�| �t j�|�kS )z0Inquire whether file a was written since file b.FT)r7 r8 �exists�getmtime)�a�br r r rD � s
rD c C sF t j�|�rt|�S tt j�|��}t�| |�}t� � }|�
|� |S )a� Normally, loads a pickled grammar by doing
pkgutil.get_data(package, pickled_grammar)
where *pickled_grammar* is computed from *grammar_source* by adding the
Python version and using a ``.pickle`` extension.
However, if *grammar_source* is an extant file, load_grammar(grammar_source)
is called instead. This facilitates using a packaged grammar file when needed
but preserves load_grammar's automatic regeneration behavior when possible.
) r7 r8 �isfiler rB �basename�pkgutil�get_datar rH �loads)�packageZgrammar_sourceZ pickled_name�datarL r r r �load_packaged_grammar� s
rY c G sB | st jdd� } tjtjt jdd� | D ]}t|ddd� q*dS )z�Main program, when run as a script: produce grammar pickle files.
Calls load_grammar for each argument, a path to a grammar text file.
r Nz %(message)s)�levelr' �formatT)rJ rK )r= �argvr
Z basicConfig�INFO�stdoutr )�argsr? r r r �main� s �r` �__main__)rC NTFN)�__doc__�
__author__�__all__r, r7 r
rT r= r r r r r r �objectr rB r rD rY r` r3 �exit�intr r r r �<module> s( M �
pgen2/__pycache__/__init__.cpython-38.opt-1.pyc 0000644 00000000247 15053244165 0015125 0 ustar 00 U
e5d� � @ s d Z dS )zThe pgen2 package.N)�__doc__� r r �./usr/lib64/python3.8/lib2to3/pgen2/__init__.py�<module> � pgen2/__pycache__/__init__.cpython-38.pyc 0000644 00000000247 15053244165 0014166 0 ustar 00 U
e5d� � @ s d Z dS )zThe pgen2 package.N)�__doc__� r r �./usr/lib64/python3.8/lib2to3/pgen2/__init__.py�<module> � pgen2/__pycache__/tokenize.cpython-38.pyc 0000644 00000035652 15053244165 0014267 0 ustar 00 U
e5d?R �
@ s� d Z dZdZddlZddlZddlmZmZ ddlT ddl m
Z
d d
� e e
�D �d d d
g Z [
ze
W n ek
r~ eZ
Y nX dd� Zdd� Zdd� Zdd� ZdZdZeede � ee� ZdZdZdZd Zed d �Zeeeee�Z d Z ed d!�ee � Z d"e Z ee e �Z ed#e d$ �Z!ee!e e �Z"d%Z#d&Z$d'Z%d(Z&d)Z'ee'd* e'd+ �Z(ee'd, e'd- �Z)ed.d/d0d1d2d3d4d5d6� Z*d7Z+ed8d9d:�Z,ee*e+e,�Z-ee"e-e)e�Z.ee. Z/ee'd; ed<d� e'd= ed>d� �Z0edee(�Z1eee1e"e-e0e� Z2e3ej4e/e2e%e&f�\Z5Z6Z7Z8ed?d@dAdB�ed?d@dCdD�B dEdFdGdHdIdJhB Z9e�4e#�e�4e$�e7e8dK�dLdM� e9D �dNdM� e9D �dOdM� e9D ��Z:d*d+hdPdQ� e9D �B dRdQ� e9D �B Z;d<d>hdSdQ� e9D �B dTdQ� e9D �B Z<dUZ=G dVdW� dWe>�Z?G dXdY� dYe>�Z@dZd[� ZAeAfd\d �ZBd]d^� ZCG d_d`� d`�ZDe�4daejE�ZFe�4dbejE�ZGdcdd� ZHdedf� ZIdgd
� ZJdhd � ZKeLdik�r�ddlMZMeNeMjO�dk�r�eBePeMjOd �jQ� n eBeMjRjQ� dS )ja� Tokenization help for Python programs.
generate_tokens(readline) is a generator that breaks a stream of
text into Python tokens. It accepts a readline-like method which is called
repeatedly to get the next line of input (or "" for EOF). It generates
5-tuples with these members:
the token type (see token.py)
the token (a string)
the starting (row, column) indices of the token (a 2-tuple of ints)
the ending (row, column) indices of the token (a 2-tuple of ints)
the original line (string)
It is designed to match the working of the Python tokenizer exactly, except
that it produces COMMENT tokens for comments and gives type OP for all
operators
Older entry points
tokenize_loop(readline, tokeneater)
tokenize(readline, tokeneater=printtoken)
are the same, except instead of generating tokens, tokeneater is a callback
function to which the 5 fields described above are passed as 5 arguments,
each time a new token is found.zKa-Ping Yee <ping@lfw.org>z@GvR, ESR, Tim Peters, Thomas Wouters, Fred Drake, Skip Montanaro� N)�BOM_UTF8�lookup)�*� )�tokenc C s g | ]}|d dkr|�qS )r �_� )�.0�xr r �./usr/lib64/python3.8/lib2to3/pgen2/tokenize.py�
<listcomp>% s r �tokenize�generate_tokens�
untokenizec G s dd� | � d S )N�(�|�))�join��choicesr r r �group0 � r c G s t | � d S )Nr �r r r r r �any1 r r c G s t | � d S )N�?r r r r r �maybe2 r r c s t � fdd�� D ��S )Nc 3 s4 | ],}� d D ] }|� � |� � kr|| V qqdS ))� N)�casefold)r r
�y��lr r � <genexpr>4 s
z _combinations.<locals>.<genexpr>)�setr r r r �
_combinations3 s �r# z[ \f\t]*z #[^\r\n]*z\\\r?\nz\w+z0[bB]_?[01]+(?:_[01]+)*z(0[xX]_?[\da-fA-F]+(?:_[\da-fA-F]+)*[lL]?z 0[oO]?_?[0-7]+(?:_[0-7]+)*[lL]?z[1-9]\d*(?:_\d+)*[lL]?z0[lL]?z[eE][-+]?\d+(?:_\d+)*z \d+(?:_\d+)*\.(?:\d+(?:_\d+)*)?z\.\d+(?:_\d+)*z \d+(?:_\d+)*z\d+(?:_\d+)*[jJ]z[jJ]z[^'\\]*(?:\\.[^'\\]*)*'z[^"\\]*(?:\\.[^"\\]*)*"z%[^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''z%[^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""z'(?:[uUrRbBfF]|[rR][fFbB]|[fFbBuU][rR])?�'''�"""z '[^\n'\\]*(?:\\.[^\n'\\]*)*'z "[^\n"\\]*(?:\\.[^\n"\\]*)*"z\*\*=?z>>=?z<<=?z<>z!=z//=?z->z[+\-*/%&@|^=<>]=?�~z[][(){}]z\r?\nz:=z[:;.,`@]z'[^\n'\\]*(?:\\.[^\n'\\]*)*�'z"[^\n"\\]*(?:\\.[^\n"\\]*)*�"�r�R�f�F�b�B�u�UZurZuRZUrZUR)r' r( r$ r% c C s i | ]}|� d �t �qS �r$ )� single3prog�r �prefixr r r �
<dictcomp>y s r5 c C s i | ]}|� d �t �qS �r% )� double3progr3 r r r r5 z s c C s i | ]
}|d �qS �Nr r3 r r r r5 { s c C s h | ]}|� d ��qS r1 r r3 r r r � <setcomp> s r9 c C s h | ]}|� d ��qS r6 r r3 r r r r9 � s c C s h | ]}|� d ��qS )r' r r3 r r r r9 � s c C s h | ]}|� d ��qS )r( r r3 r r r r9 � s � c @ s e Zd ZdS )�
TokenErrorN��__name__�
__module__� __qualname__r r r r r; � s r; c @ s e Zd ZdS )�StopTokenizingNr< r r r r r@ � s r@ c C s4 |\}}|\}}t d||||t| t|�f � d S )Nz%d,%d-%d,%d: %s %s)�print�tok_name�repr) �typer Zxxx_todo_changemeZxxx_todo_changeme1�lineZsrowZscolZerowZecolr r r �
printtoken� s
�rF c C s( zt | |� W n tk
r" Y nX dS )a:
The tokenize() function accepts two parameters: one representing the
input stream, and one providing an output mechanism for tokenize().
The first parameter, readline, must be a callable object which provides
the same interface as the readline() method of built-in file objects.
Each call to the function should return one line of input as a string.
The second parameter, tokeneater, must also be a callable object. It is
called once for each token, with five arguments, corresponding to the
tuples generated by generate_tokens().
N)�
tokenize_loopr@ )�readline�
tokeneaterr r r r
� s
c C s t | �D ] }||� qd S r8 )r )rH rI Z
token_infor r r rG � s rG c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� Untokenizerc C s g | _ d| _d| _d S )Nr r )�tokens�prev_row�prev_col)�selfr r r �__init__� s zUntokenizer.__init__c C s8 |\}}|| j kst�|| j }|r4| j�d| � d S )N� )rL �AssertionErrorrM rK �append)rN �start�row�col�
col_offsetr r r �add_whitespace� s
zUntokenizer.add_whitespacec C s� |D ]p}t |�dkr$| �||� qv|\}}}}}| �|� | j�|� |\| _| _|ttfkr| jd7 _d| _qd� | j�S )N� r r r )
�len�compatrW rK rR rL rM �NEWLINE�NLr )rN �iterable�t�tok_typer rS �endrE r r r r � s
zUntokenizer.untokenizec C s� d}g }| j j}|\}}|ttfkr,|d7 }|ttfkr<d}|D ]�}|d d� \}}|ttttfkrl|d7 }|tkr�|�|� q@n>|t kr�|�
� q@n*|ttfkr�d}n|r�|r�||d � d}||� q@d S )NFrP TrX ���) rK rR �NAME�NUMBERr[ r\ �ASYNC�AWAIT�INDENT�DEDENT�pop) rN r r] � startline�indents� toks_append�toknum�tokval�tokr r r rZ � s0
zUntokenizer.compatN)r= r> r? rO rW r rZ r r r r rJ � s rJ z&^[ \t\f]*#.*?coding[:=][ \t]*([-\w.]+)s ^[ \t\f]*(?:[#\r\n]|$)c C sH | dd� � � �dd�}|dks*|�d�r.dS |dks@|�d�rDd S | S )
z(Imitates get_normal_name in tokenizer.c.N� r �-�utf-8zutf-8-)zlatin-1�
iso-8859-1z iso-latin-1)zlatin-1-z iso-8859-1-z iso-latin-1-rr )�lower�replace�
startswith)�orig_enc�encr r r �_get_normal_name� s �rx c s� d� d}d}�fdd�}� fdd�}|� }|� t�rHd� |d d� }d
}|sT|g fS ||�}|rj||gfS t�|�s~||gfS |� }|s�||gfS ||�}|r�|||gfS |||gfS ) a
The detect_encoding() function is used to detect the encoding that should
be used to decode a Python source file. It requires one argument, readline,
in the same way as the tokenize() generator.
It will call readline a maximum of twice, and return the encoding used
(as a string) and a list of any lines (left as bytes) it has read
in.
It detects the encoding from the presence of a utf-8 bom or an encoding
cookie as specified in pep-0263. If both a bom and a cookie are present, but
disagree, a SyntaxError will be raised. If the encoding cookie is an invalid
charset, raise a SyntaxError. Note that if a utf-8 bom is found,
'utf-8-sig' is returned.
If no encoding is specified, then the default of 'utf-8' will be returned.
FNrq c s( z� � W S t k
r" t� Y S X d S r8 )�
StopIteration�bytesr )rH r r � read_or_stop s z%detect_encoding.<locals>.read_or_stopc s� z| � d�}W n tk
r$ Y d S X t�|�}|s8d S t|�d��}z t|�}W n tk
rr td| ��Y nX � r�|j dkr�td��|d7 }|S )N�asciir zunknown encoding: rq zencoding problem: utf-8z-sig)
�decode�UnicodeDecodeError� cookie_re�matchrx r r � LookupError� SyntaxError�name)rE � line_stringr� �encoding�codec)� bom_foundr r � find_cookie s"
z$detect_encoding.<locals>.find_cookieT� z utf-8-sig)ru r �blank_rer� )rH r� �defaultr{ r� �first�secondr )r� rH r �detect_encoding� s0
r� c C s t � }|�| �S )a� Transform tokens back into Python source code.
Each element returned by the iterable must be a token sequence
with at least two elements, a token number and token value. If
only two tokens are passed, the resulting output is poor.
Round-trip invariant for full input:
Untokenized source will match input source exactly
Round-trip invariant for limited input:
# Output text will tokenize the back to the input
t1 = [tok[:2] for tok in generate_tokens(f.readline)]
newcode = untokenize(t1)
readline = iter(newcode.splitlines(1)).next
t2 = [tok[:2] for tokin generate_tokens(readline)]
assert t1 == t2
)rJ r )r] �utr r r r : s c c s� d } }}d\}}d}dg}d}d} d}
d} z
| � } W n t k
rP d} Y nX |d }dt| � }
}|�r2| s|td|��|�| �}|r�|�d� }
}t|| d|� |||f|| fV d\}}d}nd|�r | dd� d k�r | d
d� d k�r t|| ||t| �f|fV d}d}q.n|| }|| }q.�nB|dk�r\|�s\| �sL�q,d}|
|k �r�| |
d k�rr|d }n8| |
d
k�r�|t d t }n| |
dk�r�d}n�q�|
d }
�qP|
|k�rĐq,|�r�|V d}| |
dk�r�| |
dk�rT| |
d� �d�}|
t|� }t |||
f||
t|� f| fV t
| |d� ||f|t| �f| fV q.t
t f| |
dk | |
d� ||
f|t| �f| fV q.||d k�r�|� |� t | d|
� |df||
f| fV ||d k �r4||k�r�t
dd||
| f��|dd� }| �r|
|d k�rd} d} d}
td||
f||
f| fV �q�| �rt| �rt|
|d k�rtd} d} d}
n| �sptd|df��d}|
|k r.t�| |
�}|�r�|�d�\}}||f||f| }}}
| ||� | | }}|tjk�s�|dk�r�|dk�r�t|||| fV �q&|dk�rJt} |dk�r t
} n
| �r&d} |�r6|V d}| |||| fV �q&|dk�r�|�d��rdt�|�rt|V d}t |||| fV �q&|tk�rt| }|�| |
�}|�r�|�d�}
| ||
� }|�r�|V d}t||||
f| fV n||f}| |d� }| }q.�q&|tk�s4|dd� tk�s4|dd� tk�r�|d dk�r�||f}t| �plt|d �plt|d }| |d� d }}| }q.n |�r�|V d}t|||| fV �q&|�� �r�|dk�r�| �r�|d k�r�tnt |||| fV �qtt |||| f} |d k�r|�s| }�qt|d k�rj|�rj|d t k�rj|d d k�rjd} |d }
t|d |d |d |d fV d}|�rz|V d}| V nz|d k�r�|�r�|V d}t
||||
f| fV d}nF|d k�r�|d }n|d!k�r�|d }|�r�|V d}t |||| fV n(t| |
||
f||
d f| fV |
d }
�qtq.|�r<|V d}|dd� D ] } td|df|dfdfV �qHt d|df|dfdfV dS )"a4
The generate_tokens() generator requires one argument, readline, which
must be a callable object which provides the same interface as the
readline() method of built-in file objects. Each call to the function
should return one line of input as a string. Alternately, readline
can be a callable function terminating with StopIteration:
readline = open(myfile).next # Example of alternate readline
The generator produces 5-tuples with these members: the token type; the
token string; a 2-tuple (srow, scol) of ints specifying the row and
column where the token begins in the source; a 2-tuple (erow, ecol) of
ints specifying the row and column where the token ends in the source;
and the line on which the token was found. The line passed is the
physical line.
r )r r NFr r zEOF in multi-line string���z\
���z\
rP � � z#
�#z
ra z3unindent does not match any outer indentation levelz
<tokenize>zEOF in multi-line statement�.T�
rX r� )�async�awaitr� �def� �\z([{z)]}) ry rY r; r� r` �STRING�
ERRORTOKEN�tabsize�rstrip�COMMENTr\ rR rf �IndentationErrorrg �
pseudoprog�span�stringZdigitsrc r[ �endswithrQ �
triple_quoted�endprogs�
single_quoted� isidentifierrd re rb �OP� ENDMARKER) rH �lnum�parenlev� continued�contstr�needcont�contlinerj ZstashedZ async_defZasync_def_indentZ async_def_nlrE �pos�max�strstart�endprog�endmatchr` �column�
comment_tokenZnl_pos� pseudomatchrS �spos�eposr �initial�newlinern �indentr r r r O s�
�*
�
�
�
�
� ��
��
�
�
�
� �
� �__main__)S�__doc__�
__author__� __credits__r� �re�codecsr r Zlib2to3.pgen2.tokenr r �dir�__all__rz � NameError�strr r r r# �
Whitespace�Comment�Ignore�Name� Binnumber� Hexnumber� Octnumber� Decnumber� Intnumber�Exponent�
Pointfloat�Expfloat� Floatnumber�
Imagnumber�Number�Single�Double�Single3�Double3Z
_litprefix�Triple�StringZOperatorZBracket�Special�Funny�
PlainToken�Token�ContStr� PseudoExtras� PseudoToken�map�compileZ tokenprogr� r2 r7 Z _strprefixesr� r� r� r� � Exceptionr; r@ rF r
rG rJ �ASCIIr r� rx r� r r r= �sysrY �argv�openrH �stdinr r r r �<module> s� � �
� � ���
� ��� � � � �� � �� 8 I b
pgen2/__pycache__/conv.cpython-38.opt-2.pyc 0000644 00000007112 15053244165 0014332 0 ustar 00 U
e5d�% � @ s. d dl Z d dlmZmZ G dd� dej�ZdS )� N)�grammar�tokenc @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� Converterc C s | � |� | �|� | �� d S �N)�parse_graminit_h�parse_graminit_c�
finish_off)�selfZ
graminit_hZ
graminit_c� r
�*/usr/lib64/python3.8/lib2to3/pgen2/conv.py�run/ s
z
Converter.runc
C s� z t |�}W n8 tk
rD } ztd||f � W Y �dS d }~X Y nX i | _i | _d}|D ]d}|d7 }t�d|�}|s�|�� r�td|||�� f � qZ|�� \}}t |�}|| j|< || j|< qZdS )N�Can't open %s: %sFr � z^#define\s+(\w+)\s+(\d+)$z%s(%s): can't parse %sT)
�open�OSError�printZ
symbol2numberZ
number2symbol�re�match�strip�groups�int) r �filename�f�err�lineno�line�mo�symbol�numberr
r
r r 5 s( �
zConverter.parse_graminit_hc !
C s� z t |�}W n8 tk
rD } ztd||f � W Y �dS d }~X Y nX d}|d t|� }}|d t|� }}|d t|� }}i }g }|�d��r�|�d��rJt�d|�}ttt |�
� ��\} }
} g } t | �D ]F}
|d t|� }}t�d|�}ttt |�
� ��\}}| � ||f� q�|d t|� }}| || |
f< |d t|� }}q�t�d|�}ttt |�
� ��\}}g }t |�D ]R}
|d t|� }}t�d |�}ttt |�
� ��\} } }
|| |
f } |� | � �qx|� |� |d t|� }}|d t|� }}q�|| _
i }t�d
|�}t |�d��}t |�D ]�}|d t|� }}t�d |�}|�d �}ttt |�dd
dd���\}}}}|| }|d t|� }}t�d|�}i }t|�d��}t|�D ]@\}} t| �} t d�D ]$}| d|> @ �r�d||d | < �qΐq�||f||< �q(|d t|� }}|| _g } |d t|� }}t�d|�}t |�d��} t | �D ]^}|d t|� }}t�d|�}|�
� \}}t |�}|dk�r�d }nt|�}| � ||f� �qX|d t|� }}| | _|d t|� }}|d t|� }}t�d|�}t |�d��}|d t|� }}|d t|� }}t�d|�}t |�d��} |d t|� }}t�d|�}t |�d��} | | _|d t|� }}z|d t|� }}W n tk
�r� Y nX d S )Nr
Fr r z static arc z)static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$z\s+{(\d+), (\d+)},$z'static state states_(\d+)\[(\d+)\] = {$z \s+{(\d+), arcs_(\d+)_(\d+)},$z static dfa dfas\[(\d+)\] = {$z0\s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$� � � � z\s+("(?:\\\d\d\d)*")},$� z!static label labels\[(\d+)\] = {$z\s+{(\d+), (0|"\w+")},$�0z
\s+(\d+),$z\s+{(\d+), labels},$z \s+(\d+)$)r r r �next�
startswithr r �list�mapr r �range�append�states�group�eval� enumerate�ord�dfas�labels�start�
StopIteration)!r r r r r r Zallarcsr+ r �n�m�kZarcs�_�i�j�s�t�stater0 Zndfasr r �x�y�z�firstZ rawbitset�cZbyter1 Znlabelsr2 r
r
r r T s� �
�
"
zConverter.parse_graminit_cc C sX i | _ i | _t| j�D ]<\}\}}|tjkr@|d k r@|| j |< q|d kr|| j|< qd S r )�keywords�tokensr. r1 r �NAME)r Zilabel�type�valuer
r
r r � s zConverter.finish_offN)�__name__�
__module__� __qualname__r r r r r
r
r
r r $ s
&r )r Zpgen2r r ZGrammarr r
r
r
r �<module> s pgen2/__pycache__/grammar.cpython-38.opt-1.pyc 0000644 00000013043 15053244165 0015012 0 ustar 00 U
e5d� � @ s` d Z ddlZddlmZ G dd� de�ZdZi Ze�� D ]"Z e r8e �
� \Z Z e
ee �ee < q8dS )a� This module defines the data structures used to represent a grammar.
These are a bit arcane because they are derived from the data
structures used by Python's 'pgen' parser generator.
There's also a table here mapping operators to their names in the
token module; the Python tokenize module reports all operators as the
fallback token code OP, but the parser needs the actual token code.
� N� )�tokenc @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )�Grammara� Pgen parsing tables conversion class.
Once initialized, this class supplies the grammar tables for the
parsing engine implemented by parse.py. The parsing engine
accesses the instance variables directly. The class here does not
provide initialization of the tables; several subclasses exist to
do this (see the conv and pgen modules).
The load() method reads the tables from a pickle file, which is
much faster than the other ways offered by subclasses. The pickle
file is written by calling dump() (after loading the grammar
tables using a subclass). The report() method prints a readable
representation of the tables to stdout, for debugging.
The instance variables are as follows:
symbol2number -- a dict mapping symbol names to numbers. Symbol
numbers are always 256 or higher, to distinguish
them from token numbers, which are between 0 and
255 (inclusive).
number2symbol -- a dict mapping numbers to symbol names;
these two are each other's inverse.
states -- a list of DFAs, where each DFA is a list of
states, each state is a list of arcs, and each
arc is a (i, j) pair where i is a label and j is
a state number. The DFA number is the index into
this list. (This name is slightly confusing.)
Final states are represented by a special arc of
the form (0, j) where j is its own state number.
dfas -- a dict mapping symbol numbers to (DFA, first)
pairs, where DFA is an item from the states list
above, and first is a set of tokens that can
begin this grammar rule (represented by a dict
whose values are always 1).
labels -- a list of (x, y) pairs where x is either a token
number or a symbol number, and y is either None
or a string; the strings are keywords. The label
number is the index in this list; label numbers
are used to mark state transitions (arcs) in the
DFAs.
start -- the number of the grammar's start symbol.
keywords -- a dict mapping keyword strings to arc labels.
tokens -- a dict mapping token numbers to arc labels.
c C s< i | _ i | _g | _i | _dg| _i | _i | _i | _d| _d S )N)r ZEMPTY� ) �
symbol2number�
number2symbol�states�dfas�labels�keywords�tokens� symbol2label�start)�self� r �-/usr/lib64/python3.8/lib2to3/pgen2/grammar.py�__init__L s zGrammar.__init__c C s, t |d��}t�| j|tj� W 5 Q R X dS )z)Dump the grammar tables to a pickle file.�wbN)�open�pickle�dump�__dict__ZHIGHEST_PROTOCOL)r �filename�fr r r r W s z Grammar.dumpc C s0 t |d��}t�|�}W 5 Q R X | j�|� dS )z+Load the grammar tables from a pickle file.�rbN)r r �loadr �update)r r r �dr r r r \ s z Grammar.loadc C s | j �t�|�� dS )z3Load the grammar tables from a pickle bytes object.N)r r r �loads)r Zpklr r r r b s z
Grammar.loadsc C sT | � � }dD ]}t||t| |��� � q | jdd� |_| jdd� |_| j|_|S )z#
Copy the grammar.
)r r r r r r
N)� __class__�setattr�getattr�copyr
r r )r �newZ dict_attrr r r r" f s z Grammar.copyc C sv ddl m } td� || j� td� || j� td� || j� td� || j� td� || j� td| j� d S )
z:Dump the grammar tables to standard output, for debugging.r )�pprintZs2nZn2sr r r
r N)r$ �printr r r r r
r )r r$ r r r �reports s
zGrammar.reportN)
�__name__�
__module__� __qualname__�__doc__r r r r r" r& r r r r r s 5
r a
( LPAR
) RPAR
[ LSQB
] RSQB
: COLON
, COMMA
; SEMI
+ PLUS
- MINUS
* STAR
/ SLASH
| VBAR
& AMPER
< LESS
> GREATER
= EQUAL
. DOT
% PERCENT
` BACKQUOTE
{ LBRACE
} RBRACE
@ AT
@= ATEQUAL
== EQEQUAL
!= NOTEQUAL
<> NOTEQUAL
<= LESSEQUAL
>= GREATEREQUAL
~ TILDE
^ CIRCUMFLEX
<< LEFTSHIFT
>> RIGHTSHIFT
** DOUBLESTAR
+= PLUSEQUAL
-= MINEQUAL
*= STAREQUAL
/= SLASHEQUAL
%= PERCENTEQUAL
&= AMPEREQUAL
|= VBAREQUAL
^= CIRCUMFLEXEQUAL
<<= LEFTSHIFTEQUAL
>>= RIGHTSHIFTEQUAL
**= DOUBLESTAREQUAL
// DOUBLESLASH
//= DOUBLESLASHEQUAL
-> RARROW
:= COLONEQUAL
)r* r � r �objectr Z opmap_rawZopmap�
splitlines�line�split�op�namer! r r r r �<module> s o3 pgen2/__pycache__/token.cpython-38.opt-2.pyc 0000644 00000003457 15053244165 0014515 0 ustar 00 U
e5d � @ sL d Z dZdZdZdZdZdZdZdZd Z d
Z
d Z d Z d
Z
dZdZdZdZdZdZdZdZdZdZdZdZdZdZd Z d Z d Z d Z d Z d!Z!d"Z"d#Z#d$Z$d%Z%d&Z&d'Z'd(Z(d)Z)d*Z*d+Z+d,Z,d-Z-d.Z.d/Z/d0Z0d1Z1d2Z2d3Z3d4Z4d5Z5d6Z6d7Z7d8Z8d9Z9d:Z:d;Z;d<Z<d=Z=i Z>e?e@� �A� �D ]$\ZBZCeDeC�eDd �k�r
eBe>eC< �q
d>d?� ZEd@dA� ZFdBdC� ZGdDS )E� � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; �< � c C s | t k S �N�� NT_OFFSET��x� rD �+/usr/lib64/python3.8/lib2to3/pgen2/token.py�
ISTERMINALO s rF c C s | t kS r? r@ rB rD rD rE �
ISNONTERMINALR s rG c C s | t kS r? )� ENDMARKERrB rD rD rE �ISEOFU s rI N)HrH �NAME�NUMBER�STRING�NEWLINE�INDENT�DEDENT�LPAR�RPAR�LSQB�RSQB�COLON�COMMA�SEMI�PLUS�MINUS�STAR�SLASH�VBAR�AMPER�LESS�GREATER�EQUAL�DOT�PERCENTZ BACKQUOTE�LBRACE�RBRACE�EQEQUAL�NOTEQUAL� LESSEQUAL� GREATEREQUAL�TILDE�
CIRCUMFLEX� LEFTSHIFT�
RIGHTSHIFT�
DOUBLESTAR� PLUSEQUAL�MINEQUAL� STAREQUAL�
SLASHEQUAL� PERCENTEQUAL�
AMPEREQUAL� VBAREQUAL�CIRCUMFLEXEQUAL�LEFTSHIFTEQUAL�RIGHTSHIFTEQUAL�DOUBLESTAREQUAL� DOUBLESLASH�DOUBLESLASHEQUAL�AT�ATEQUAL�OP�COMMENT�NL�RARROW�AWAIT�ASYNC�
ERRORTOKEN�
COLONEQUAL�N_TOKENSrA �tok_name�list�globals�items�_nameZ_value�typerF rG rI rD rD rD rE �<module> s� pgen2/__pycache__/driver.cpython-38.opt-2.pyc 0000644 00000010003 15053244165 0014651 0 ustar 00 U
e5dQ � @ s� d Z ddgZddlZddlZddlZddlZddlZddlmZm Z m
Z
m Z m Z G dd� de
�Zdd � Zdd
d�Zdd� Zdd� Zdd� Zedkr�e�ee� �� dS )z#Guido van Rossum <guido@python.org>�Driver� load_grammar� N� )�grammar�parse�token�tokenize�pgenc @ sH e Zd Zddd�Zddd�Zddd�Zdd d
�Zdd d �Zdd
d�ZdS )r Nc C s& || _ |d krt�� }|| _|| _d S �N)r �logging� getLogger�logger�convert)�selfr r r
� r �,/usr/lib64/python3.8/lib2to3/pgen2/driver.py�__init__ s
zDriver.__init__Fc C st t �| j| j�}|�� d}d}d } } } } }
d} |D �]} | \}}}} }
|||fkr�|\}
}||
k r�| d|
| 7 } |
}d}||k r�| |
||� 7 } |}|tjtjfkr�| |7 } | \}}|�d�r<|d7 }d}q<|t j
kr�tj | }|�r
| j �
dt j| || � |�||| |f��r6|�r0| j �
d� �qnd} | \}}|�d�r<|d7 }d}q<t �d||| |f��|jS )Nr r � �
z%s %r (prefix=%r)zStop.zincomplete input)r ZParserr r Zsetupr �COMMENT�NL�endswithr �OPZopmapr
�debug�tok_nameZaddtokenZ
ParseErrorZrootnode)r �tokensr �p�lineno�column�type�value�start�endZ line_text�prefixZ quintupleZs_linenoZs_columnr r r � parse_tokens& s^
�
�zDriver.parse_tokensc C s t �|j�}| �||�S r
)r �generate_tokens�readliner$ )r �streamr r r r r �parse_stream_rawV s zDriver.parse_stream_rawc C s | � ||�S r
)r( )r r' r r r r � parse_stream[ s zDriver.parse_streamc
C s4 t j|d|d��}| �||�W 5 Q R � S Q R X d S )N�r)�encoding)�io�openr) )r �filenamer+ r r' r r r �
parse_file_ s zDriver.parse_filec C s t �t�|�j�}| �||�S r
)r r% r, �StringIOr& r$ )r �textr r r r r � parse_stringd s zDriver.parse_string)NN)F)F)F)NF)F) �__name__�
__module__� __qualname__r r$ r( r) r/ r2 r r r r r s
0
c C s: t j�| �\}}|dkr d}|| d�tttj�� d S )Nz.txtr �.z.pickle)�os�path�splitext�join�map�str�sys� version_info)�gt�head�tailr r r �_generate_pickle_namej s rB � Grammar.txtTFc
C s� |d krt �� }|d kr t| �n|}|s2t|| �s�|�d| � t�| �}|r�|�d|� z|�|� W q� tk
r� } z|�d|� W 5 d }~X Y q�X nt �
� }|� |� |S )Nz!Generating grammar tables from %sz Writing grammar tables to %szWriting failed: %s) r r rB �_newer�infor Zgenerate_grammar�dump�OSErrorr �Grammar�load)r? Zgp�save�forcer
�g�er r r r q s
c C s8 t j�| �sdS t j�|�s dS t j�| �t j�|�kS )NFT)r7 r8 �exists�getmtime)�a�br r r rD � s
rD c C sF t j�|�rt|�S tt j�|��}t�| |�}t� � }|�
|� |S r
) r7 r8 �isfiler rB �basename�pkgutil�get_datar rH �loads)�packageZgrammar_sourceZ pickled_name�datarL r r r �load_packaged_grammar� s
rY c G sB | st jdd � } tjtjt jdd� | D ]}t|ddd� q*dS )Nr z %(message)s)�levelr' �formatT)rJ rK )r= �argvr Z basicConfig�INFO�stdoutr )�argsr? r r r �main� s �r` �__main__)rC NTFN)�
__author__�__all__r, r7 r rT r= r r r r r r �objectr rB r rD rY r` r3 �exit�intr r r r �<module> s& M �
pgen2/__pycache__/literals.cpython-38.opt-2.pyc 0000644 00000002413 15053244165 0015203 0 ustar 00 U
e5dc � @ sL d dl Z dddddddd d
d d �
Zd
d� Zdd� Zdd� ZedkrHe� dS )� N��� �
�
� � �'�"�\)
�a�b�f�n�r�t�vr r
r c C s� | � dd�\}}t�|�}|d k r&|S |�d�r�|dd � }t|�dk rTtd| ��zt|d�}W q� tk
r� td| �d �Y q�X n2zt|d�}W n" tk
r� td| �d �Y nX t|�S ) Nr � �x� z!invalid hex string escape ('\%s')� � z#invalid octal string escape ('\%s'))�group�simple_escapes�get�
startswith�len�
ValueError�int�chr)�m�all�tailZescZhexes�i� r$ �./usr/lib64/python3.8/lib2to3/pgen2/literals.py�escape s"
r& c C sH | d }| d d� |d kr$|d }| t |�t |� � } t�dt| �S )Nr � z)\\(\'|\"|\\|[abfnrtv]|x.{0,2}|[0-7]{1,3}))r �re�subr& )�s�qr$ r$ r% �
evalString( s
r, c C s@ t d�D ]2} t| �}t|�}t|�}||krt| |||� qd S )N� )�ranger �reprr, �print)r# �cr* �er$ r$ r% �test2 s r3 �__main__)r( r r& r, r3 �__name__r$ r$ r$ r% �<module> s �
pgen2/__pycache__/parse.cpython-38.pyc 0000644 00000014544 15053244165 0013546 0 ustar 00 U
e5d� � @ s4 d Z ddlmZ G dd� de�ZG dd� de�ZdS )z�Parser engine for the grammar tables generated by pgen.
The grammar table must be loaded first.
See Parser/parser.c in the Python distribution for additional info on
how this parsing engine works.
� )�tokenc @ s e Zd ZdZdd� Zdd� ZdS )�
ParseErrorz(Exception to signal the parser is stuck.c C s4 t �| d||||f � || _|| _|| _|| _d S )Nz!%s: type=%r, value=%r, context=%r)� Exception�__init__�msg�type�value�context)�selfr r r r � r �+/usr/lib64/python3.8/lib2to3/pgen2/parse.pyr s
�zParseError.__init__c C s t | �| j| j | j| jffS �N)r r r r )r
r r r �
__reduce__ s zParseError.__reduce__N)�__name__�
__module__� __qualname__�__doc__r r r r r r r s r c @ sL e Zd ZdZddd�Zddd�Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )�Parsera5 Parser engine.
The proper usage sequence is:
p = Parser(grammar, [converter]) # create instance
p.setup([start]) # prepare for parsing
<for each input token>:
if p.addtoken(...): # parse a token; may raise ParseError
break
root = p.rootnode # root of abstract syntax tree
A Parser instance may be reused by calling setup() repeatedly.
A Parser instance contains state pertaining to the current token
sequence, and should not be used concurrently by different threads
to parse separate token sequences.
See driver.py for how to get input tokens by tokenizing a file or
string.
Parsing is complete when addtoken() returns True; the root of the
abstract syntax tree can then be retrieved from the rootnode
instance variable. When a syntax error occurs, addtoken() raises
the ParseError exception. There is no error recovery; the parser
cannot be used after a syntax error was reported (but it can be
reinitialized by calling setup()).
Nc C s || _ |pdd� | _dS )a� Constructor.
The grammar argument is a grammar.Grammar instance; see the
grammar module for more information.
The parser is not ready yet for parsing; you must call the
setup() method to get it started.
The optional convert argument is a function mapping concrete
syntax tree nodes to abstract syntax tree nodes. If not
given, no conversion is done and the syntax tree produced is
the concrete syntax tree. If given, it must be a function of
two arguments, the first being the grammar (a grammar.Grammar
instance), and the second being the concrete syntax tree node
to be converted. The syntax tree is converted from the bottom
up.
A concrete syntax tree node is a (type, value, context, nodes)
tuple, where type is the node type (a token or symbol number),
value is None for symbols and a string for tokens, context is
None or an opaque value used for error reporting (typically a
(lineno, offset) pair), and nodes is a list of children for
symbols, and None for tokens.
An abstract syntax tree node may be anything; this is entirely
up to the converter function.
c S s |S r
r )�grammar�noder r r �<lambda>Z � z!Parser.__init__.<locals>.<lambda>N)r �convert)r
r r r r r r < s zParser.__init__c C sH |dkr| j j}|ddg f}| j j| d|f}|g| _d| _t� | _dS )a� Prepare for parsing.
This *must* be called before starting to parse.
The optional argument is an alternative start symbol; it
defaults to the grammar's start symbol.
You can use a Parser instance to parse any number of programs;
each time you call setup() the parser is reset to an initial
state determined by the (implicit or explicit) start symbol.
N� )r �start�dfas�stack�rootnode�set�
used_names)r
r �newnodeZ
stackentryr r r �setup\ s
z Parser.setupc C s< | � |||�}| jd \}}}|\}} || }
|
D ]�\} } | jj| \}
}|| kr�|
dk s^t�| �||| |� | }|| d|fgkr�| �� | js� dS | jd \}}}|\}} qr dS |
dkr2| jj|
}|\}}||kr2| �|
| jj|
| |� qq2d|f|
k�r(| �� | j�s6t d|||��qt d|||��qdS ) z<Add a token; return True iff this is the end of the program.���� r TFztoo much inputz bad inputN)
�classifyr r �labels�AssertionError�shift�popr �pushr )r
r r r �ilabel�dfa�stater Zstates�firstZarcs�i�newstate�t�vZitsdfaZ itsstatesZitsfirstr r r �addtokent s@
�zParser.addtokenc C sX |t jkr0| j�|� | jj�|�}|dk r0|S | jj�|�}|dkrTtd|||��|S )z&Turn a token into a label. (Internal)Nz bad token) r �NAMEr �addr �keywords�get�tokensr )r
r r r r* r r r r$ � s
zParser.classifyc C sT | j d \}}}|||df}| �| j|�}|dk r@|d �|� |||f| j d< dS )zShift a token. (Internal)r" N)r r r �append) r
r r r/ r r+ r, r r r r r r' � s z Parser.shiftc C sB | j d \}}}|d|g f}|||f| j d< | j �|d|f� dS )z Push a nonterminal. (Internal)r" Nr )r r8 ) r
r Znewdfar/ r r+ r, r r r r r r) � s z Parser.pushc C s` | j �� \}}}| �| j|�}|dk r\| j rL| j d \}}}|d �|� n|| _| j| j_dS )z Pop a nonterminal. (Internal)Nr" )r r( r r r8 r r )r
ZpopdfaZpopstateZpopnoder r+ r, r r r r r( � s z
Parser.pop)N)N) r r r r r r! r2 r$ r' r) r( r r r r r s
0 r N)r � r r r �objectr r r r r �<module> s
pgen2/__pycache__/conv.cpython-38.opt-1.pyc 0000644 00000013774 15053244165 0014344 0 ustar 00 U
e5d�% � @ s2 d Z ddlZddlmZmZ G dd� dej�ZdS )a� Convert graminit.[ch] spit out by pgen to Python code.
Pgen is the Python parser generator. It is useful to quickly create a
parser from a grammar file in Python's grammar notation. But I don't
want my parsers to be written in C (yet), so I'm translating the
parsing tables to Python data structures and writing a Python parse
engine.
Note that the token numbers are constants determined by the standard
Python tokenizer. The standard token module defines these numbers and
their names (the names are not used much). The token numbers are
hardcoded into the Python tokenizer and into pgen. A Python
implementation of the Python tokenizer is also available, in the
standard tokenize module.
On the other hand, symbol numbers (representing the grammar's
non-terminals) are assigned by pgen based on the actual grammar
input.
Note: this module is pretty much obsolete; the pgen module generates
equivalent grammar tables directly from the Grammar.txt input file
without having to invoke the Python pgen C program.
� N)�grammar�tokenc @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) � Convertera2 Grammar subclass that reads classic pgen output files.
The run() method reads the tables as produced by the pgen parser
generator, typically contained in two C files, graminit.h and
graminit.c. The other methods are for internal use only.
See the base class for more documentation.
c C s | � |� | �|� | �� dS )z<Load the grammar tables from the text files written by pgen.N)�parse_graminit_h�parse_graminit_c�
finish_off)�selfZ
graminit_hZ
graminit_c� r �*/usr/lib64/python3.8/lib2to3/pgen2/conv.py�run/ s
z
Converter.runc
C s� z t |�}W n8 tk
rD } ztd||f � W Y �dS d}~X Y nX i | _i | _d}|D ]d}|d7 }t�d|�}|s�|�� r�td|||�� f � qZ|�� \}}t |�}|| j|< || j|< qZdS ) z�Parse the .h file written by pgen. (Internal)
This file is a sequence of #define statements defining the
nonterminals of the grammar as numbers. We build two tables
mapping the numbers to names and back.
�Can't open %s: %sFNr � z^#define\s+(\w+)\s+(\d+)$z%s(%s): can't parse %sT)
�open�OSError�printZ
symbol2numberZ
number2symbol�re�match�strip�groups�int) r �filename�f�err�lineno�line�mo�symbol�numberr r r
r 5 s( �
zConverter.parse_graminit_hc !
C s� z t |�}W n8 tk
rD } ztd||f � W Y �dS d}~X Y nX d}|d t|� }}|d t|� }}|d t|� }}i }g }|�d��r�|�d��rJt�d|�}ttt |�
� ��\} }
} g } t | �D ]F}
|d t|� }}t�d|�}ttt |�
� ��\}}| � ||f� q�|d t|� }}| || |
f< |d t|� }}q�t�d |�}ttt |�
� ��\}}g }t |�D ]R}
|d t|� }}t�d
|�}ttt |�
� ��\} } }
|| |
f } |� | � �qx|� |� |d t|� }}|d t|� }}q�|| _
i }t�d |�}t |�d��}t |�D ]�}|d t|� }}t�d |�}|�d
�}ttt |�dddd���\}}}}|| }|d t|� }}t�d|�}i }t|�d��}t|�D ]@\}} t| �} t d�D ]$}| d|> @ �r�d||d | < �qΐq�||f||< �q(|d t|� }}|| _g } |d t|� }}t�d|�}t |�d��} t | �D ]^}|d t|� }}t�d|�}|�
� \}}t |�}|dk�r�d}nt|�}| � ||f� �qX|d t|� }}| | _|d t|� }}|d t|� }}t�d|�}t |�d��}|d t|� }}|d t|� }}t�d|�}t |�d��} |d t|� }}t�d|�}t |�d��} | | _|d t|� }}z|d t|� }}W n tk
�r� Y nX dS )a� Parse the .c file written by pgen. (Internal)
The file looks as follows. The first two lines are always this:
#include "pgenheaders.h"
#include "grammar.h"
After that come four blocks:
1) one or more state definitions
2) a table defining dfas
3) a table defining labels
4) a struct defining the grammar
A state definition has the following form:
- one or more arc arrays, each of the form:
static arc arcs_<n>_<m>[<k>] = {
{<i>, <j>},
...
};
- followed by a state array, of the form:
static state states_<s>[<t>] = {
{<k>, arcs_<n>_<m>},
...
};
r FNr r
z static arc z)static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$z\s+{(\d+), (\d+)},$z'static state states_(\d+)\[(\d+)\] = {$z \s+{(\d+), arcs_(\d+)_(\d+)},$z static dfa dfas\[(\d+)\] = {$z0\s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$� � � � z\s+("(?:\\\d\d\d)*")},$� z!static label labels\[(\d+)\] = {$z\s+{(\d+), (0|"\w+")},$�0z
\s+(\d+),$z\s+{(\d+), labels},$z \s+(\d+)$)r r r �next�
startswithr r �list�mapr r �range�append�states�group�eval� enumerate�ord�dfas�labels�start�
StopIteration)!r r r r r r Zallarcsr* r �n�m�kZarcs�_�i�j�s�t�stater/ Zndfasr r �x�y�z�firstZ rawbitset�cZbyter0 Znlabelsr1 r r r
r T s� �
�
"
zConverter.parse_graminit_cc C sX i | _ i | _t| j�D ]<\}\}}|tjkr@|dk r@|| j |< q|dkr|| j|< qdS )z1Create additional useful structures. (Internal).N)�keywords�tokensr- r0 r �NAME)r Zilabel�type�valuer r r
r � s zConverter.finish_offN)�__name__�
__module__� __qualname__�__doc__r r r r r r r r
r $ s
&r )rI r Zpgen2r r ZGrammarr r r r r
�<module> s pgen2/__pycache__/tokenize.cpython-38.opt-2.pyc 0000644 00000026056 15053244165 0015225 0 ustar 00 U
e5d?R �
@ s� d Z dZddlZddlZddlmZmZ ddlT ddlm Z dd � e
e �D �d
d d g Z [ ze W n e
k
rz eZ Y nX d
d� Zdd� Zdd� Zdd� ZdZdZeede � ee� ZdZdZdZdZed d �Zeeeee�Zd Z ed d �ee � Z d!e Z ee e �Z ed"e d# �Z ee e e�Z!d$Z"d%Z#d&Z$d'Z%d(Z&ee&d) e&d* �Z'ee&d+ e&d, �Z(ed-d.d/d0d1d2d3d4d5� Z)d6Z*ed7d8d9�Z+ee)e*e+�Z,ee!e,e(e�Z-ee- Z.ee&d: ed;d� e&d< ed=d� �Z/edee'�Z0eee0e!e,e/e� Z1e2ej3e.e1e$e%f�\Z4Z5Z6Z7ed>d?d@dA�ed>d?dBdC�B dDdEdFdGdHdIhB Z8e�3e"�e�3e#�e6e7dJ�dKdL� e8D �dMdL� e8D �dNdL� e8D ��Z9d)d*hdOdP� e8D �B dQdP� e8D �B Z:d;d=hdRdP� e8D �B dSdP� e8D �B Z;dTZ<G dUdV� dVe=�Z>G dWdX� dXe=�Z?dYdZ� Z@e@fd[d
�ZAd\d]� ZBG d^d_� d_�ZCe�3d`ejD�ZEe�3daejD�ZFdbdc� ZGddde� ZHdfd � ZIdgd � ZJeKdhk�r�ddlLZLeMeLjN�dk�r�eAeOeLjNd �jP� n eAeLjQjP� dS )izKa-Ping Yee <ping@lfw.org>z@GvR, ESR, Tim Peters, Thomas Wouters, Fred Drake, Skip Montanaro� N)�BOM_UTF8�lookup)�*� )�tokenc C s g | ]}|d dkr|�qS )r �_� )�.0�xr r �./usr/lib64/python3.8/lib2to3/pgen2/tokenize.py�
<listcomp>% s r �tokenize�generate_tokens�
untokenizec G s dd� | � d S )N�(�|�))�join��choicesr r r �group0 � r c G s t | � d S )Nr �r r r r r �any1 r r c G s t | � d S )N�?r r r r r �maybe2 r r c s t � fdd�� D ��S )Nc 3 s4 | ],}� d D ] }|� � |� � kr|| V qqdS ))� N)�casefold)r r
�y��lr r � <genexpr>4 s
z _combinations.<locals>.<genexpr>)�setr r r r �
_combinations3 s �r# z[ \f\t]*z #[^\r\n]*z\\\r?\nz\w+z0[bB]_?[01]+(?:_[01]+)*z(0[xX]_?[\da-fA-F]+(?:_[\da-fA-F]+)*[lL]?z 0[oO]?_?[0-7]+(?:_[0-7]+)*[lL]?z[1-9]\d*(?:_\d+)*[lL]?z0[lL]?z[eE][-+]?\d+(?:_\d+)*z \d+(?:_\d+)*\.(?:\d+(?:_\d+)*)?z\.\d+(?:_\d+)*z \d+(?:_\d+)*z\d+(?:_\d+)*[jJ]z[jJ]z[^'\\]*(?:\\.[^'\\]*)*'z[^"\\]*(?:\\.[^"\\]*)*"z%[^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''z%[^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""z'(?:[uUrRbBfF]|[rR][fFbB]|[fFbBuU][rR])?�'''�"""z '[^\n'\\]*(?:\\.[^\n'\\]*)*'z "[^\n"\\]*(?:\\.[^\n"\\]*)*"z\*\*=?z>>=?z<<=?z<>z!=z//=?z->z[+\-*/%&@|^=<>]=?�~z[][(){}]z\r?\nz:=z[:;.,`@]z'[^\n'\\]*(?:\\.[^\n'\\]*)*�'z"[^\n"\\]*(?:\\.[^\n"\\]*)*�"�r�R�f�F�b�B�u�UZurZuRZUrZUR)r' r( r$ r% c C s i | ]}|� d �t �qS �r$ )� single3prog�r �prefixr r r �
<dictcomp>y s r5 c C s i | ]}|� d �t �qS �r% )� double3progr3 r r r r5 z s c C s i | ]
}|d �qS �Nr r3 r r r r5 { s c C s h | ]}|� d ��qS r1 r r3 r r r � <setcomp> s r9 c C s h | ]}|� d ��qS r6 r r3 r r r r9 � s c C s h | ]}|� d ��qS )r' r r3 r r r r9 � s c C s h | ]}|� d ��qS )r( r r3 r r r r9 � s � c @ s e Zd ZdS )�
TokenErrorN��__name__�
__module__� __qualname__r r r r r; � s r; c @ s e Zd ZdS )�StopTokenizingNr< r r r r r@ � s r@ c C s4 |\}}|\}}t d||||t| t|�f � d S )Nz%d,%d-%d,%d: %s %s)�print�tok_name�repr) �typer Zxxx_todo_changemeZxxx_todo_changeme1�lineZsrowZscolZerowZecolr r r �
printtoken� s
�rF c C s( zt | |� W n tk
r" Y nX d S r8 )�
tokenize_loopr@ )�readline�
tokeneaterr r r r
� s
c C s t | �D ] }||� qd S r8 )r )rH rI Z
token_infor r r rG � s rG c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� Untokenizerc C s g | _ d| _d| _d S )Nr r )�tokens�prev_row�prev_col)�selfr r r �__init__� s zUntokenizer.__init__c C s* |\}}|| j }|r&| j�d| � d S )N� )rM rK �append)rN �start�row�col�
col_offsetr r r �add_whitespace� s
zUntokenizer.add_whitespacec C s� |D ]p}t |�dkr$| �||� qv|\}}}}}| �|� | j�|� |\| _| _|ttfkr| jd7 _d| _qd� | j�S )N� r r r )
�len�compatrV rK rQ rL rM �NEWLINE�NLr )rN �iterable�t�tok_typer rR �endrE r r r r � s
zUntokenizer.untokenizec C s� d}g }| j j}|\}}|ttfkr,|d7 }|ttfkr<d}|D ]�}|d d� \}}|ttttfkrl|d7 }|tkr�|�|� q@n>|t kr�|�
� q@n*|ttfkr�d}n|r�|r�||d � d}||� q@d S )NFrP TrW ���) rK rQ �NAME�NUMBERrZ r[ �ASYNC�AWAIT�INDENT�DEDENT�pop) rN r r\ � startline�indents� toks_append�toknum�tokval�tokr r r rY � s0
zUntokenizer.compatN)r= r> r? rO rV r rY r r r r rJ � s rJ z&^[ \t\f]*#.*?coding[:=][ \t]*([-\w.]+)s ^[ \t\f]*(?:[#\r\n]|$)c C sH | d d� � � �dd�}|dks*|�d�r.dS |dks@|�d�rDdS | S ) N� r �-�utf-8zutf-8-)zlatin-1�
iso-8859-1z iso-latin-1)zlatin-1-z iso-8859-1-z iso-latin-1-rq )�lower�replace�
startswith)�orig_enc�encr r r �_get_normal_name� s �rw c s� d� d }d}�fdd�}� fdd�}|� }|� t�rHd� |dd � }d }|sT|g fS ||�}|rj||gfS t�|�s~||gfS |� }|s�||gfS ||�}|r�|||gfS |||gfS )
NFrp c s( z� � W S t k
r" t� Y S X d S r8 )�
StopIteration�bytesr )rH r r � read_or_stop s z%detect_encoding.<locals>.read_or_stopc s� z| � d�}W n tk
r$ Y d S X t�|�}|s8d S t|�d��}z t|�}W n tk
rr td| ��Y nX � r�|j dkr�td��|d7 }|S )N�asciir zunknown encoding: rp zencoding problem: utf-8z-sig)
�decode�UnicodeDecodeError� cookie_re�matchrw r r � LookupError� SyntaxError�name)rE � line_stringr �encoding�codec)� bom_foundr r � find_cookie s"
z$detect_encoding.<locals>.find_cookieT� z utf-8-sig)rt r �blank_rer )rH r� �defaultrz r� �first�secondr )r� rH r �detect_encoding� s0
r� c C s t � }|�| �S r8 )rJ r )r\ �utr r r r : s c c st d } }}d\}}d }dg}d }d} d}
d} z
| � } W n t k
rP d} Y nX |d }dt| � }
}|�r2| s|td|��|�| �}|r�|�d� }
}t|| d |� |||f|| fV d\}}d }nd|�r | dd � dk�r | d d � d
k�r t|| ||t| �f|fV d}d }q.n|| }|| }q.�nB|dk�r\|�s\| �sL�q d}|
|k �r�| |
d k�rr|d }n8| |
d k�r�|t d t }n| |
d
k�r�d}n�q�|
d }
�qP|
|k�rĐq |�r�|V d }| |
dk�r�| |
dk�rT| |
d � �d�}|
t|� }t |||
f||
t|� f| fV t
| |d � ||f|t| �f| fV q.t
t f| |
dk | |
d � ||
f|t| �f| fV q.||d k�r�|� |� t | d |
� |df||
f| fV ||d k �r4||k�r�t
dd||
| f��|d d� }| �r|
|d k�rd} d} d}
td||
f||
f| fV �q�| �rt| �rt|
|d k�rtd} d} d}
n| �sptd|df��d}|
|k r.t�| |
�}|�r�|�d�\}}||f||f| }}}
| ||� | | }}|tjk�s�|dk�r�|dk�r�t|||| fV �q|dk�rJt} |dk�r t
} n
| �r&d} |�r6|V d }| |||| fV �q|dk�rx|�rd|V d }t |||| fV �q|tk�r�t| }|�| |
�}|�r�|�d�}
| ||
� }|�r�|V d }t||||
f| fV n||f}| |d � }| }q.�q|tk�s$|d d� tk�s$|d d� tk�r�|d dk�rx||f}t| �p\t|d �p\t|d }| |d � d }}| }q.n |�r�|V d }t|||| fV �q|�� �rr|dk�r�| �r�|dk�r�tnt|||| fV �qtt|||| f} |dk�r�|�s�| }�qt|d k�rZ|�rZ|d tk�rZ|d dk�rZd} |d }
t|d |d |d |d fV d }|�rj|V d }| V nz|d k�r�|�r�|V d }t
||||
f| fV d}nF|d k�r�|d }n|d k�r�|d }|�r�|V d }t |||| fV n(t| |
||
f||
d f| fV |
d }
�qtq.|�r,|V d }|dd � D ] } td|df|dfdfV �q8t d|df|dfdfV d S )!Nr )r r Fr r zEOF in multi-line string���z\
���z\
rP � � z#
�#z
r` z3unindent does not match any outer indentation levelz
<tokenize>zEOF in multi-line statement�.TrW r� �
)�async�awaitr� �def� �\z([{z)]}) rx rX r; r r_ �STRING�
ERRORTOKEN�tabsize�rstrip�COMMENTr[ rQ re �IndentationErrorrf �
pseudoprog�span�stringZdigitsrb rZ �
triple_quoted�endprogs�
single_quoted� isidentifierrc rd ra �OP� ENDMARKER) rH �lnum�parenlev� continued�contstr�needcont�contlineri ZstashedZ async_defZasync_def_indentZ async_def_nlrE �pos�max�strstart�endprog�endmatchr_ �column�
comment_tokenZnl_pos� pseudomatchrR �spos�eposr �initial�newlinerm �indentr r r r O s�
�*
�
�
�
�
� ��
��
�
�
�
� �
� �__main__)R�
__author__� __credits__r� �re�codecsr r Zlib2to3.pgen2.tokenr r �dir�__all__ry � NameError�strr r r r# �
Whitespace�Comment�Ignore�Name� Binnumber� Hexnumber� Octnumber� Decnumber� Intnumber�Exponent�
Pointfloat�Expfloat� Floatnumber�
Imagnumber�Number�Single�Double�Single3�Double3Z
_litprefix�Triple�StringZOperatorZBracket�Special�Funny�
PlainToken�Token�ContStr� PseudoExtras� PseudoToken�map�compileZ tokenprogr� r2 r7 Z _strprefixesr� r� r� r� � Exceptionr; r@ rF r
rG rJ �ASCIIr~ r� rw r� r r r= �sysrX �argv�openrH �stdinr r r r �<module> s� � �
� � ���
� ��� � � � �� � �� 8 I b
pgen2/__pycache__/pgen.cpython-38.opt-2.pyc 0000644 00000022161 15053244165 0014317 0 ustar 00 U
e5d�5 � @ sd d dl mZmZmZ G dd� dej�ZG dd� de�ZG dd� de�ZG dd � d e�Z dd d �Z
d
S )� )�grammar�token�tokenizec @ s e Zd ZdS )� PgenGrammarN)�__name__�
__module__� __qualname__� r r �*/usr/lib64/python3.8/lib2to3/pgen2/pgen.pyr s r c @ s� e Zd Zd&dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd'd d!�Zd"d#� Zd$d%� ZdS )(�ParserGeneratorNc C sl d }|d krt |�}|j}|| _|| _t�|j�| _| �� | � � \| _
| _ |d k rZ|� i | _ | �
� d S �N)�open�close�filename�streamr �generate_tokens�readline� generator�gettoken�parse�dfas� startsymbol�first� addfirstsets)�selfr r Z close_streamr r r
�__init__ s zParserGenerator.__init__c C s t � }t| j�� �}|�� |�| j� |�d| j� |D ]&}dt|j � }||j |< ||j
|< q:|D ]�}| j| }g }|D ]`}g }t |j �
� �D ]$\} }
|�| �|| �|�|
�f� q�|jr�|�d|�|�f� |�|� q||j�|� || �||�f|j|j | < qf|j | j |_|S )N� � )r �listr �keys�sort�remover �insert�len�
symbol2numberZ
number2symbol�sorted�arcs�items�append�
make_label�index�isfinal�states�
make_first�start) r �c�names�name�i�dfar, �stater& �label�nextr r r
� make_grammar s.
z ParserGenerator.make_grammarc C s4 | j | }i }t|�D ]}| �||�}d||< q|S �Nr )r r% r) )r r/ r1 Zrawfirstr r5 �ilabelr r r
r- 4 s
zParserGenerator.make_firstc C s& t |j�}|d �� r�||jkrZ||jkr4|j| S |j�|j| d f� ||j|< |S n>tt|d �}||jkrz|j| S |j�|d f� ||j|< |S n�t |�}|d �� r�||j
kr�|j
| S |j�tj |f� ||j
|< |S n>t j
| }||jk�r|j| S |j�|d f� ||j|< |S d S �Nr )r# �labels�isalphar$ Z symbol2labelr( �getattrr �tokens�eval�keywords�NAMEr Zopmap)r r/ r5 r9 Zitoken�valuer r r
r) = s6
zParserGenerator.make_labelc C s8 t | j�� �}|�� |D ]}|| jkr| �|� qd S r )r r r r r � calcfirst)r r0 r1 r r r
r k s
z ParserGenerator.addfirstsetsc C s� | j | }d | j|< |d }i }i }|j�� D ]x\}}|| j kr�|| jkrj| j| }|d kr~td| ��n| �|� | j| }|�|� |||< q.d||< |di||< q.i } |�� D ]:\}}
|
D ],} | | kr�td|| || | f ��|| | < q�q�|| j|< d S )Nr zrecursion for rule %rr zArule %s is ambiguous; %s is in the first sets of %s as well as %s)r r r& r' �
ValueErrorrC �update) r r1 r3 r4 ZtotalsetZ overlapcheckr5 r6 �fsetZinverseZitsfirstZsymbolr r r
rC s s4
� zParserGenerator.calcfirstc C s� i }d }| j tjkr�| j tjkr*| �� q| �tj�}| �tjd� | �� \}}| �tj� | � ||�}t
|�}| � |� t
|�}|||< |d kr|}q||fS )N�:) �typer � ENDMARKER�NEWLINEr �expectrA �OP� parse_rhs�make_dfar# � simplify_dfa) r r r r1 �a�zr3 ZoldlenZnewlenr r r
r � s"
zParserGenerator.parsec s� � fdd�}� fdd�� t ||�|�g}|D ]�}i }|jD ].}|jD ]"\}} |d k rD� | |�|i �� qDq:t|�� �D ]@\}}
|D ]} | j|
kr� q�q�t |
|�} |�| � |�| |� qvq,|S )Nc s i }� | |� |S r r )r4 �base��
addclosurer r
�closure� s
z)ParserGenerator.make_dfa.<locals>.closurec s: | |kr d S d|| < | j D ]\}}|d kr� ||� qd S r8 �r& )r4 rR r5 r6 rS r r
rT � s z,ParserGenerator.make_dfa.<locals>.addclosure)�DFAState�nfasetr& �
setdefaultr% r' r( �addarc) r r. �finishrU r, r4 r& Znfastater5 r6 rX �str rS r
rN � s"
zParserGenerator.make_dfac
C s� t d|� |g}t|�D ]|\}}t d|||kr2dp4d� |jD ]T\}}||krZ|�|�} nt|�} |�|� |d kr�t d| � q>t d|| f � q>qd S )NzDump of NFA for� State�(final)� z -> %d� %s -> %d)�print� enumerater& r* r# r( )
r r1 r. r[ Ztodor2 r4 r5 r6 �jr r r
�dump_nfa� s
zParserGenerator.dump_nfac C sd t d|� t|�D ]L\}}t d||jr*dp,d� t|j�� �D ] \}}t d||�|�f � q>qd S )NzDump of DFA forr] r^ r_ r` )ra rb r+ r% r& r' r* )r r1 r3 r2 r4 r5 r6 r r r
�dump_dfa� s
zParserGenerator.dump_dfac C sp d}|rld}t |�D ]T\}}t|d t|��D ]8}|| }||kr.||= |D ]}|�||� qLd} qq.qqd S )NTFr )rb �ranger# �
unifystate)r r3 Zchangesr2 Zstate_irc Zstate_jr4 r r r
rO � s z ParserGenerator.simplify_dfac C s~ | � � \}}| jdkr ||fS t� }t� }|�|� |�|� | jdkrr| �� | � � \}}|�|� |�|� q>||fS d S )N�|)� parse_altrB �NFAStaterZ r )r rP rQ ZaaZzzr r r
rM � s
zParserGenerator.parse_rhsc C sL | � � \}}| jdks(| jtjtjfkrD| � � \}}|�|� |}q ||fS )N)�(�[)�
parse_itemrB rH r rA �STRINGrZ )r rP �br/ �dr r r
ri
s
�
zParserGenerator.parse_altc C s� | j dkr>| �� | �� \}}| �tjd� |�|� ||fS | �� \}}| j }|dkr`||fS | �� |�|� |dkr�||fS ||fS d S )Nrl �])�+�*rr )rB r rM rK r rL rZ �
parse_atom)r rP rQ rB r r r
rm s
zParserGenerator.parse_itemc C s� | j dkr4| �� | �� \}}| �tjd� ||fS | jtjtjfkrpt � }t � }|�
|| j � | �� ||fS | � d| j| j � d S )Nrk �)z+expected (...) or NAME or STRING, got %s/%s) rB r rM rK r rL rH rA rn rj rZ � raise_error)r rP rQ r r r
rt ( s
�zParserGenerator.parse_atomc C sD | j |ks |d k r2| j|kr2| �d||| j | j� | j}| �� |S )Nzexpected %s/%s, got %s/%s)rH rB rv r )r rH rB r r r
rK 9 s �zParserGenerator.expectc C sF t | j�}|d tjtjfkr*t | j�}q
|\| _| _| _| _| _ d S r: )
r6 r r �COMMENT�NLrH rB Zbegin�end�line)r �tupr r r
r A s
zParserGenerator.gettokenc
G s^ |r8z || }W n& d� |gttt|�� �}Y nX t|| j| jd | jd | jf��d S )N� r r )�joinr �map�str� SyntaxErrorr ry rz )r �msg�argsr r r
rv H s �zParserGenerator.raise_error)N)N)r r r r r7 r- r) r rC r rN rd re rO rM ri rm rt rK r rv r r r r
r
s$
. $
r c @ s e Zd Zdd� Zddd�ZdS )rj c C s
g | _ d S r rV )r r r r
r S s zNFAState.__init__Nc C s | j �||f� d S r )r& r( �r r6 r5 r r r
rZ V s zNFAState.addarc)N)r r r r rZ r r r r
rj Q s rj c @ s0 e Zd Zdd� Zdd� Zdd� Zdd� Zd Zd S )
rW c C s || _ ||k| _i | _d S r )rX r+ r& )r rX �finalr r r
r ] s
zDFAState.__init__c C s || j |< d S r rV r� r r r
rZ e s zDFAState.addarcc C s* | j �� D ]\}}||kr
|| j |< q
d S r )r& r' )r �old�newr5 r6 r r r
rg k s zDFAState.unifystatec C sV | j |j krdS t| j�t|j�kr(dS | j�� D ] \}}||j�|�k r2 dS q2dS )NFT)r+ r# r& r' �get)r �otherr5 r6 r r r
�__eq__p s zDFAState.__eq__N)r r r r rZ rg r� �__hash__r r r r
rW [ s
rW � Grammar.txtc C s t | �}|�� S r )r r7 )r �pr r r
�generate_grammar� s r� N)r� ) r_ r r r ZGrammarr �objectr rj rW r� r r r r
�<module> s I
% pgen2/__pycache__/parse.cpython-38.opt-2.pyc 0000644 00000006256 15053244165 0014507 0 ustar 00 U
e5d� � @ s0 d dl mZ G dd� de�ZG dd� de�ZdS )� )�tokenc @ s e Zd Zdd� Zdd� ZdS )�
ParseErrorc C s4 t �| d||||f � || _|| _|| _|| _d S )Nz!%s: type=%r, value=%r, context=%r)� Exception�__init__�msg�type�value�context)�selfr r r r � r �+/usr/lib64/python3.8/lib2to3/pgen2/parse.pyr s
�zParseError.__init__c C s t | �| j| j | j| jffS �N)r r r r )r
r r r �
__reduce__ s zParseError.__reduce__N)�__name__�
__module__� __qualname__r r r r r r r s r c @ sH e Zd Zddd�Zddd�Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dS )�ParserNc C s || _ |pdd� | _d S )Nc S s |S r
r )�grammar�noder r r �<lambda>Z � z!Parser.__init__.<locals>.<lambda>)r �convert)r
r r r r r r < s zParser.__init__c C sH |d kr| j j}|d d g f}| j j| d|f}|g| _d | _t� | _d S )N� )r �start�dfas�stack�rootnode�set�
used_names)r
r �newnodeZ
stackentryr r r �setup\ s
z Parser.setupc C s0 | � |||�}| jd \}}}|\}} || }
|
D ]�\} } | jj| \}
}|| kr�| �||| |� | }|| d|fgkr�| �� | js� dS | jd \}}}|\}} qf dS |
dkr2| jj|
}|\}}||kr2| �|
| jj|
| |� qq2d|f|
k�r | �� | j�s*td|||��qtd|||��qd S )N���r TF� ztoo much inputz bad input) �classifyr r �labels�shift�popr �pushr )r
r r r �ilabel�dfa�stater Zstates�firstZarcs�i�newstate�t�vZitsdfaZ itsstatesZitsfirstr r r �addtokent s>
�zParser.addtokenc C sX |t jkr0| j�|� | jj�|�}|d k r0|S | jj�|�}|d krTtd|||��|S )Nz bad token) r �NAMEr �addr �keywords�get�tokensr )r
r r r r( r r r r# � s
zParser.classifyc C sT | j d \}}}|||d f}| �| j|�}|d k r@|d �|� |||f| j d< d S �Nr! )r r r �append) r
r r r- r r) r* r r r r r r% � s z Parser.shiftc C sB | j d \}}}|d |g f}|||f| j d< | j �|d|f� d S )Nr! r )r r7 ) r
r Znewdfar- r r) r* r r r r r r' � s z Parser.pushc C s` | j �� \}}}| �| j|�}|d k r\| j rL| j d \}}}|d �|� n|| _| j| j_d S r6 )r r& r r r7 r r )r
ZpopdfaZpopstateZpopnoder r) r* r r r r r& � s z
Parser.pop)N)N)
r r r r r r0 r# r% r' r& r r r r r s
0 r N)� r r r �objectr r r r r �<module> s pgen2/__pycache__/tokenize.cpython-38.opt-1.pyc 0000644 00000035544 15053244165 0015226 0 ustar 00 U
e5d?R �
@ s� d Z dZdZddlZddlZddlmZmZ ddlT ddl m
Z
d d
� e e
�D �d d d
g Z [
ze
W n ek
r~ eZ
Y nX dd� Zdd� Zdd� Zdd� ZdZdZeede � ee� ZdZdZdZd Zed d �Zeeeee�Z d Z ed d!�ee � Z d"e Z ee e �Z ed#e d$ �Z!ee!e e �Z"d%Z#d&Z$d'Z%d(Z&d)Z'ee'd* e'd+ �Z(ee'd, e'd- �Z)ed.d/d0d1d2d3d4d5d6� Z*d7Z+ed8d9d:�Z,ee*e+e,�Z-ee"e-e)e�Z.ee. Z/ee'd; ed<d� e'd= ed>d� �Z0edee(�Z1eee1e"e-e0e� Z2e3ej4e/e2e%e&f�\Z5Z6Z7Z8ed?d@dAdB�ed?d@dCdD�B dEdFdGdHdIdJhB Z9e�4e#�e�4e$�e7e8dK�dLdM� e9D �dNdM� e9D �dOdM� e9D ��Z:d*d+hdPdQ� e9D �B dRdQ� e9D �B Z;d<d>hdSdQ� e9D �B dTdQ� e9D �B Z<dUZ=G dVdW� dWe>�Z?G dXdY� dYe>�Z@dZd[� ZAeAfd\d �ZBd]d^� ZCG d_d`� d`�ZDe�4daejE�ZFe�4dbejE�ZGdcdd� ZHdedf� ZIdgd
� ZJdhd � ZKeLdik�r�ddlMZMeNeMjO�dk�r�eBePeMjOd �jQ� n eBeMjRjQ� dS )ja� Tokenization help for Python programs.
generate_tokens(readline) is a generator that breaks a stream of
text into Python tokens. It accepts a readline-like method which is called
repeatedly to get the next line of input (or "" for EOF). It generates
5-tuples with these members:
the token type (see token.py)
the token (a string)
the starting (row, column) indices of the token (a 2-tuple of ints)
the ending (row, column) indices of the token (a 2-tuple of ints)
the original line (string)
It is designed to match the working of the Python tokenizer exactly, except
that it produces COMMENT tokens for comments and gives type OP for all
operators
Older entry points
tokenize_loop(readline, tokeneater)
tokenize(readline, tokeneater=printtoken)
are the same, except instead of generating tokens, tokeneater is a callback
function to which the 5 fields described above are passed as 5 arguments,
each time a new token is found.zKa-Ping Yee <ping@lfw.org>z@GvR, ESR, Tim Peters, Thomas Wouters, Fred Drake, Skip Montanaro� N)�BOM_UTF8�lookup)�*� )�tokenc C s g | ]}|d dkr|�qS )r �_� )�.0�xr r �./usr/lib64/python3.8/lib2to3/pgen2/tokenize.py�
<listcomp>% s r �tokenize�generate_tokens�
untokenizec G s dd� | � d S )N�(�|�))�join��choicesr r r �group0 � r c G s t | � d S )Nr �r r r r r �any1 r r c G s t | � d S )N�?r r r r r �maybe2 r r c s t � fdd�� D ��S )Nc 3 s4 | ],}� d D ] }|� � |� � kr|| V qqdS ))� N)�casefold)r r
�y��lr r � <genexpr>4 s
z _combinations.<locals>.<genexpr>)�setr r r r �
_combinations3 s �r# z[ \f\t]*z #[^\r\n]*z\\\r?\nz\w+z0[bB]_?[01]+(?:_[01]+)*z(0[xX]_?[\da-fA-F]+(?:_[\da-fA-F]+)*[lL]?z 0[oO]?_?[0-7]+(?:_[0-7]+)*[lL]?z[1-9]\d*(?:_\d+)*[lL]?z0[lL]?z[eE][-+]?\d+(?:_\d+)*z \d+(?:_\d+)*\.(?:\d+(?:_\d+)*)?z\.\d+(?:_\d+)*z \d+(?:_\d+)*z\d+(?:_\d+)*[jJ]z[jJ]z[^'\\]*(?:\\.[^'\\]*)*'z[^"\\]*(?:\\.[^"\\]*)*"z%[^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''z%[^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""z'(?:[uUrRbBfF]|[rR][fFbB]|[fFbBuU][rR])?�'''�"""z '[^\n'\\]*(?:\\.[^\n'\\]*)*'z "[^\n"\\]*(?:\\.[^\n"\\]*)*"z\*\*=?z>>=?z<<=?z<>z!=z//=?z->z[+\-*/%&@|^=<>]=?�~z[][(){}]z\r?\nz:=z[:;.,`@]z'[^\n'\\]*(?:\\.[^\n'\\]*)*�'z"[^\n"\\]*(?:\\.[^\n"\\]*)*�"�r�R�f�F�b�B�u�UZurZuRZUrZUR)r' r( r$ r% c C s i | ]}|� d �t �qS �r$ )� single3prog�r �prefixr r r �
<dictcomp>y s r5 c C s i | ]}|� d �t �qS �r% )� double3progr3 r r r r5 z s c C s i | ]
}|d �qS �Nr r3 r r r r5 { s c C s h | ]}|� d ��qS r1 r r3 r r r � <setcomp> s r9 c C s h | ]}|� d ��qS r6 r r3 r r r r9 � s c C s h | ]}|� d ��qS )r' r r3 r r r r9 � s c C s h | ]}|� d ��qS )r( r r3 r r r r9 � s � c @ s e Zd ZdS )�
TokenErrorN��__name__�
__module__� __qualname__r r r r r; � s r; c @ s e Zd ZdS )�StopTokenizingNr< r r r r r@ � s r@ c C s4 |\}}|\}}t d||||t| t|�f � d S )Nz%d,%d-%d,%d: %s %s)�print�tok_name�repr) �typer Zxxx_todo_changemeZxxx_todo_changeme1�lineZsrowZscolZerowZecolr r r �
printtoken� s
�rF c C s( zt | |� W n tk
r" Y nX dS )a:
The tokenize() function accepts two parameters: one representing the
input stream, and one providing an output mechanism for tokenize().
The first parameter, readline, must be a callable object which provides
the same interface as the readline() method of built-in file objects.
Each call to the function should return one line of input as a string.
The second parameter, tokeneater, must also be a callable object. It is
called once for each token, with five arguments, corresponding to the
tuples generated by generate_tokens().
N)�
tokenize_loopr@ )�readline�
tokeneaterr r r r
� s
c C s t | �D ] }||� qd S r8 )r )rH rI Z
token_infor r r rG � s rG c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� Untokenizerc C s g | _ d| _d| _d S )Nr r )�tokens�prev_row�prev_col)�selfr r r �__init__� s zUntokenizer.__init__c C s* |\}}|| j }|r&| j�d| � d S )N� )rM rK �append)rN �start�row�col�
col_offsetr r r �add_whitespace� s
zUntokenizer.add_whitespacec C s� |D ]p}t |�dkr$| �||� qv|\}}}}}| �|� | j�|� |\| _| _|ttfkr| jd7 _d| _qd� | j�S )N� r r r )
�len�compatrV rK rQ rL rM �NEWLINE�NLr )rN �iterable�t�tok_typer rR �endrE r r r r � s
zUntokenizer.untokenizec C s� d}g }| j j}|\}}|ttfkr,|d7 }|ttfkr<d}|D ]�}|d d� \}}|ttttfkrl|d7 }|tkr�|�|� q@n>|t kr�|�
� q@n*|ttfkr�d}n|r�|r�||d � d}||� q@d S )NFrP TrW ���) rK rQ �NAME�NUMBERrZ r[ �ASYNC�AWAIT�INDENT�DEDENT�pop) rN r r\ � startline�indents� toks_append�toknum�tokval�tokr r r rY � s0
zUntokenizer.compatN)r= r> r? rO rV r rY r r r r rJ � s rJ z&^[ \t\f]*#.*?coding[:=][ \t]*([-\w.]+)s ^[ \t\f]*(?:[#\r\n]|$)c C sH | dd� � � �dd�}|dks*|�d�r.dS |dks@|�d�rDd S | S )
z(Imitates get_normal_name in tokenizer.c.N� r �-�utf-8zutf-8-)zlatin-1�
iso-8859-1z iso-latin-1)zlatin-1-z iso-8859-1-z iso-latin-1-rq )�lower�replace�
startswith)�orig_enc�encr r r �_get_normal_name� s �rw c s� d� d}d}�fdd�}� fdd�}|� }|� t�rHd� |d d� }d
}|sT|g fS ||�}|rj||gfS t�|�s~||gfS |� }|s�||gfS ||�}|r�|||gfS |||gfS ) a
The detect_encoding() function is used to detect the encoding that should
be used to decode a Python source file. It requires one argument, readline,
in the same way as the tokenize() generator.
It will call readline a maximum of twice, and return the encoding used
(as a string) and a list of any lines (left as bytes) it has read
in.
It detects the encoding from the presence of a utf-8 bom or an encoding
cookie as specified in pep-0263. If both a bom and a cookie are present, but
disagree, a SyntaxError will be raised. If the encoding cookie is an invalid
charset, raise a SyntaxError. Note that if a utf-8 bom is found,
'utf-8-sig' is returned.
If no encoding is specified, then the default of 'utf-8' will be returned.
FNrp c s( z� � W S t k
r" t� Y S X d S r8 )�
StopIteration�bytesr )rH r r � read_or_stop s z%detect_encoding.<locals>.read_or_stopc s� z| � d�}W n tk
r$ Y d S X t�|�}|s8d S t|�d��}z t|�}W n tk
rr td| ��Y nX � r�|j dkr�td��|d7 }|S )N�asciir zunknown encoding: rp zencoding problem: utf-8z-sig)
�decode�UnicodeDecodeError� cookie_re�matchrw r r � LookupError� SyntaxError�name)rE � line_stringr �encoding�codec)� bom_foundr r � find_cookie s"
z$detect_encoding.<locals>.find_cookieT� z utf-8-sig)rt r �blank_rer )rH r� �defaultrz r� �first�secondr )r� rH r �detect_encoding� s0
r� c C s t � }|�| �S )a� Transform tokens back into Python source code.
Each element returned by the iterable must be a token sequence
with at least two elements, a token number and token value. If
only two tokens are passed, the resulting output is poor.
Round-trip invariant for full input:
Untokenized source will match input source exactly
Round-trip invariant for limited input:
# Output text will tokenize the back to the input
t1 = [tok[:2] for tok in generate_tokens(f.readline)]
newcode = untokenize(t1)
readline = iter(newcode.splitlines(1)).next
t2 = [tok[:2] for tokin generate_tokens(readline)]
assert t1 == t2
)rJ r )r\ �utr r r r : s c c st d } }}d\}}d}dg}d}d} d}
d} z
| � } W n t k
rP d} Y nX |d }dt| � }
}|�r2| s|td|��|�| �}|r�|�d� }
}t|| d|� |||f|| fV d\}}d}nd|�r | dd� d k�r | d
d� d k�r t|| ||t| �f|fV d}d}q.n|| }|| }q.�nB|dk�r\|�s\| �sL�q d}|
|k �r�| |
d k�rr|d }n8| |
d
k�r�|t d t }n| |
dk�r�d}n�q�|
d }
�qP|
|k�rĐq |�r�|V d}| |
dk�r�| |
dk�rT| |
d� �d�}|
t|� }t |||
f||
t|� f| fV t
| |d� ||f|t| �f| fV q.t
t f| |
dk | |
d� ||
f|t| �f| fV q.||d k�r�|� |� t | d|
� |df||
f| fV ||d k �r4||k�r�t
dd||
| f��|dd� }| �r|
|d k�rd} d} d}
td||
f||
f| fV �q�| �rt| �rt|
|d k�rtd} d} d}
n| �sptd|df��d}|
|k r.t�| |
�}|�r�|�d�\}}||f||f| }}}
| ||� | | }}|tjk�s�|dk�r�|dk�r�t|||| fV �q|dk�rJt} |dk�r t
} n
| �r&d} |�r6|V d}| |||| fV �q|dk�rx|�rd|V d}t |||| fV �q|tk�r�t| }|�| |
�}|�r�|�d�}
| ||
� }|�r�|V d}t||||
f| fV n||f}| |d� }| }q.�q|tk�s$|dd� tk�s$|dd� tk�r�|d dk�rx||f}t| �p\t|d �p\t|d }| |d� d }}| }q.n |�r�|V d}t|||| fV �q|�� �rr|dk�r�| �r�|d k�r�tnt|||| fV �qtt|||| f} |d k�r�|�s�| }�qt|d k�rZ|�rZ|d tk�rZ|d d k�rZd} |d }
t|d |d |d |d fV d}|�rj|V d}| V nz|d k�r�|�r�|V d}t
||||
f| fV d}nF|d k�r�|d }n|d!k�r�|d }|�r�|V d}t |||| fV n(t| |
||
f||
d f| fV |
d }
�qtq.|�r,|V d}|dd� D ] } td|df|dfdfV �q8t d|df|dfdfV dS )"a4
The generate_tokens() generator requires one argument, readline, which
must be a callable object which provides the same interface as the
readline() method of built-in file objects. Each call to the function
should return one line of input as a string. Alternately, readline
can be a callable function terminating with StopIteration:
readline = open(myfile).next # Example of alternate readline
The generator produces 5-tuples with these members: the token type; the
token string; a 2-tuple (srow, scol) of ints specifying the row and
column where the token begins in the source; a 2-tuple (erow, ecol) of
ints specifying the row and column where the token ends in the source;
and the line on which the token was found. The line passed is the
physical line.
r )r r NFr r zEOF in multi-line string���z\
���z\
rP � � z#
�#z
r` z3unindent does not match any outer indentation levelz
<tokenize>zEOF in multi-line statement�.TrW r� �
)�async�awaitr� �def� �\z([{z)]}) rx rX r; r r_ �STRING�
ERRORTOKEN�tabsize�rstrip�COMMENTr[ rQ re �IndentationErrorrf �
pseudoprog�span�stringZdigitsrb rZ �
triple_quoted�endprogs�
single_quoted� isidentifierrc rd ra �OP� ENDMARKER) rH �lnum�parenlev� continued�contstr�needcont�contlineri ZstashedZ async_defZasync_def_indentZ async_def_nlrE �pos�max�strstart�endprog�endmatchr_ �column�
comment_tokenZnl_pos� pseudomatchrR �spos�eposr �initial�newlinerm �indentr r r r O s�
�*
�
�
�
�
� ��
��
�
�
�
� �
� �__main__)S�__doc__�
__author__� __credits__r� �re�codecsr r Zlib2to3.pgen2.tokenr r �dir�__all__ry � NameError�strr r r r# �
Whitespace�Comment�Ignore�Name� Binnumber� Hexnumber� Octnumber� Decnumber� Intnumber�Exponent�
Pointfloat�Expfloat� Floatnumber�
Imagnumber�Number�Single�Double�Single3�Double3Z
_litprefix�Triple�StringZOperatorZBracket�Special�Funny�
PlainToken�Token�ContStr� PseudoExtras� PseudoToken�map�compileZ tokenprogr� r2 r7 Z _strprefixesr� r� r� r� � Exceptionr; r@ rF r
rG rJ �ASCIIr~ r� rw r� r r r= �sysrX �argv�openrH �stdinr r r r �<module> s� � �
� � ���
� ��� � � � �� � �� 8 I b
pgen2/__pycache__/token.cpython-38.pyc 0000644 00000003541 15053244165 0013547 0 ustar 00 U
e5d � @ sP d Z dZdZdZdZdZdZdZdZd Z d
Z
d Z d Z d
Z
dZdZdZdZdZdZdZdZdZdZdZdZdZdZd Z d Z d Z d Z d Z d!Z!d"Z"d#Z#d$Z$d%Z%d&Z&d'Z'd(Z(d)Z)d*Z*d+Z+d,Z,d-Z-d.Z.d/Z/d0Z0d1Z1d2Z2d3Z3d4Z4d5Z5d6Z6d7Z7d8Z8d9Z9d:Z:d;Z;d<Z<d=Z=d>Z>i Z?e@eA� �B� �D ]$\ZCZDeEeD�eEd�k�reCe?eD< �qd?d@� ZFdAdB� ZGdCdD� ZHdES )Fz!Token constants (from "token.h").� � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; �< � c C s | t k S �N�� NT_OFFSET��x� rD �+/usr/lib64/python3.8/lib2to3/pgen2/token.py�
ISTERMINALO s rF c C s | t kS r? r@ rB rD rD rE �
ISNONTERMINALR s rG c C s | t kS r? )� ENDMARKERrB rD rD rE �ISEOFU s rI N)I�__doc__rH �NAME�NUMBER�STRING�NEWLINE�INDENT�DEDENT�LPAR�RPAR�LSQB�RSQB�COLON�COMMA�SEMI�PLUS�MINUS�STAR�SLASH�VBAR�AMPER�LESS�GREATER�EQUAL�DOT�PERCENTZ BACKQUOTE�LBRACE�RBRACE�EQEQUAL�NOTEQUAL� LESSEQUAL� GREATEREQUAL�TILDE�
CIRCUMFLEX� LEFTSHIFT�
RIGHTSHIFT�
DOUBLESTAR� PLUSEQUAL�MINEQUAL� STAREQUAL�
SLASHEQUAL� PERCENTEQUAL�
AMPEREQUAL� VBAREQUAL�CIRCUMFLEXEQUAL�LEFTSHIFTEQUAL�RIGHTSHIFTEQUAL�DOUBLESTAREQUAL� DOUBLESLASH�DOUBLESLASHEQUAL�AT�ATEQUAL�OP�COMMENT�NL�RARROW�AWAIT�ASYNC�
ERRORTOKEN�
COLONEQUAL�N_TOKENSrA �tok_name�list�globals�items�_nameZ_value�typerF rG rI rD rD rD rE �<module> s� pgen2/__pycache__/conv.cpython-38.pyc 0000644 00000015556 15053244165 0013405 0 ustar 00 U
e5d�% � @ s2 d Z ddlZddlmZmZ G dd� dej�ZdS )a� Convert graminit.[ch] spit out by pgen to Python code.
Pgen is the Python parser generator. It is useful to quickly create a
parser from a grammar file in Python's grammar notation. But I don't
want my parsers to be written in C (yet), so I'm translating the
parsing tables to Python data structures and writing a Python parse
engine.
Note that the token numbers are constants determined by the standard
Python tokenizer. The standard token module defines these numbers and
their names (the names are not used much). The token numbers are
hardcoded into the Python tokenizer and into pgen. A Python
implementation of the Python tokenizer is also available, in the
standard tokenize module.
On the other hand, symbol numbers (representing the grammar's
non-terminals) are assigned by pgen based on the actual grammar
input.
Note: this module is pretty much obsolete; the pgen module generates
equivalent grammar tables directly from the Grammar.txt input file
without having to invoke the Python pgen C program.
� N)�grammar�tokenc @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) � Convertera2 Grammar subclass that reads classic pgen output files.
The run() method reads the tables as produced by the pgen parser
generator, typically contained in two C files, graminit.h and
graminit.c. The other methods are for internal use only.
See the base class for more documentation.
c C s | � |� | �|� | �� dS )z<Load the grammar tables from the text files written by pgen.N)�parse_graminit_h�parse_graminit_c�
finish_off)�selfZ
graminit_hZ
graminit_c� r �*/usr/lib64/python3.8/lib2to3/pgen2/conv.py�run/ s
z
Converter.runc
C s� z t |�}W n8 tk
rD } ztd||f � W Y �dS d}~X Y nX i | _i | _d}|D ]�}|d7 }t�d|�}|s�|�� r�td|||�� f � qZ|�� \}}t |�}|| jks�t
�|| jks�t
�|| j|< || j|< qZdS ) z�Parse the .h file written by pgen. (Internal)
This file is a sequence of #define statements defining the
nonterminals of the grammar as numbers. We build two tables
mapping the numbers to names and back.
�Can't open %s: %sFNr � z^#define\s+(\w+)\s+(\d+)$z%s(%s): can't parse %sT) �open�OSError�print�
symbol2number�
number2symbol�re�match�strip�groups�int�AssertionError) r �filename�f�err�lineno�line�mo�symbol�numberr r r
r 5 s, �
zConverter.parse_graminit_hc !
C sT z t |�}W n8 tk
rD } ztd||f � W Y �dS d}~X Y nX d}|d t|� }}|dkspt||f��|d t|� }}|dks�t||f��|d t|� }}i }g }|�d��r�|�d��r�t�d |�}|s�t||f��tt t
|� � ��\} }
} g } t | �D ]Z}
|d t|� }}t�d
|�}|�s<t||f��tt t
|� � ��\}}| �
||f� �q|d t|� }}|d k�s�t||f��| || |
f< |d t|� }}q�t�d |�}|�s�t||f��tt t
|� � ��\}}|t|�k�s�t||f��g }t |�D ]~}
|d t|� }}t�d
|�}|�s:t||f��tt t
|� � ��\} } }
|| |
f } | t| �k�sxt||f��|�
| � �q|�
|� |d t|� }}|d k�s�t||f��|d t|� }}q�|| _i }t�d|�}|�s�t||f��t
|�d��}t |�D �]j}|d t|� }}t�d|�}|�s@t||f��|�d�}tt t
|�dddd���\}}}}| j| |k�s�t||f��| j| |k�s�t||f��|dk�s�t||f��|| }|t|�k�s�t||f��|d t|� }}t�d|�}|�s t||f��i }t|�d��}t|�D ]@\}} t| �} t d�D ]$}| d|> @ �r>d||d | < �q>�q&||f||< �q
|d t|� }}|d k�s�t||f��|| _g } |d t|� }}t�d|�}|�s�t||f��t
|�d��} t | �D ]p}|d t|� }}t�d|�}|�s$t||f��|� � \}}t
|�}|dk�rHd}nt|�}| �
||f� �q�|d t|� }}|d k�s�t||f��| | _|d t|� }}|dk�s�t||f��|d t|� }}t�d|�}|�s�t||f��t
|�d��}|t| j�k�s
t�|d t|� }}|dk�s2t||f��|d t|� }}t�d |�}|�sbt||f��t
|�d��} | t| j�k�s�t||f��|d t|� }}t�d |�}|�s�t||f��t
|�d��} | | jk�s�t||f��| | _|d t|� }}|d k�st||f��z|d t|� }}W n tk
�r< Y nX d�sPt||f��dS ) a� Parse the .c file written by pgen. (Internal)
The file looks as follows. The first two lines are always this:
#include "pgenheaders.h"
#include "grammar.h"
After that come four blocks:
1) one or more state definitions
2) a table defining dfas
3) a table defining labels
4) a struct defining the grammar
A state definition has the following form:
- one or more arc arrays, each of the form:
static arc arcs_<n>_<m>[<k>] = {
{<i>, <j>},
...
};
- followed by a state array, of the form:
static state states_<s>[<t>] = {
{<k>, arcs_<n>_<m>},
...
};
r FNr r
z#include "pgenheaders.h"
z#include "grammar.h"
z static arc z)static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$z\s+{(\d+), (\d+)},$z};
z'static state states_(\d+)\[(\d+)\] = {$z \s+{(\d+), arcs_(\d+)_(\d+)},$z static dfa dfas\[(\d+)\] = {$z0\s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$� � � � z\s+("(?:\\\d\d\d)*")},$� z!static label labels\[(\d+)\] = {$z\s+{(\d+), (0|"\w+")},$�0z grammar _PyParser_Grammar = {
z
\s+(\d+),$z dfas,
z\s+{(\d+), labels},$z \s+(\d+)$)r r r �nextr �
startswithr r �list�mapr r �range�append�len�states�groupr r �eval� enumerate�ord�dfas�labels�start�
StopIteration)!r r r r r r Zallarcsr. r �n�m�kZarcs�_�i�j�s�t�stater3 Zndfasr r �x�y�z�firstZ rawbitset�cZbyter4 Znlabelsr5 r r r
r T s� �
�
"
zConverter.parse_graminit_cc C sX i | _ i | _t| j�D ]<\}\}}|tjkr@|dk r@|| j |< q|dkr|| j|< qdS )z1Create additional useful structures. (Internal).N)�keywords�tokensr1 r4 r �NAME)r Zilabel�type�valuer r r
r � s zConverter.finish_offN)�__name__�
__module__� __qualname__�__doc__r r r r r r r r
r $ s
&r )rM r Zpgen2r r ZGrammarr r r r r
�<module> s fixer_base.pyo 0000644 00000016022 15053244255 0007412 0 ustar 00 �
{ fc @ sr d Z d d l Z d d l m Z d d l m Z d d l m Z d e f d � � YZ d e f d
� � YZ
d S( s2 Base class for fixers (optional, but recommended).i����Ni ( t PatternCompiler( t pygram( t does_tree_importt BaseFixc B s� e Z d Z d Z d Z d Z d Z d Z d Z e
j d � Z e
� Z d Z e Z d Z d Z e Z e Z e j Z d � Z d � Z d � Z d � Z d � Z d d
� Z d � Z d d � Z d
� Z! d � Z" d � Z# RS( s Optional base class for fixers.
The subclass name must be FixFooBar where FooBar is the result of
removing underscores and capitalizing the words of the fix name.
For example, the class name for a fixer named 'has_key' should be
FixHasKey.
i t posti c C s | | _ | | _ | j � d S( s Initializer. Subclass may override.
Args:
options: a dict containing the options passed to RefactoringTool
that could be used to customize the fixer through the command line.
log: a list to append warnings and other messages to.
N( t optionst logt compile_pattern( t selfR R ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt __init__0 s c C sC | j d k r? t � } | j | j d t �\ | _ | _ n d S( s� Compiles self.PATTERN into self.pattern.
Subclass may override if it doesn't want to use
self.{pattern,PATTERN} in .match().
t with_treeN( t PATTERNt NoneR R t Truet patternt pattern_tree( R t PC( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR < s c C s
| | _ d S( sm Set the filename, and a logger derived from it.
The main refactoring tool should call this.
N( t filename( R R ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt set_filenameG s c C s& i | d 6} | j j | | � o% | S( s Returns match for a given parse tree node.
Should return a true or false object (not necessarily a bool).
It may return a non-empty dict of matching sub-nodes as
returned by a matching pattern.
Subclass may override.
t node( R t match( R R t results( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR N s
c C s
t � � d S( s� Returns the transformation for a given parse tree node.
Args:
node: the root of the parse tree that matched the fixer.
results: a dict mapping symbolic names to part of the match.
Returns:
None, or a node that is a modified copy of the
argument node. The node argument may also be modified in-place to
effect the same change.
Subclass *must* override.
N( t NotImplementedError( R R R ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt transformZ s u xxx_todo_changemec C sI | } x, | | j k r4 | t | j j � � } q W| j j | � | S( s� Return a string suitable for use as an identifier
The new name is guaranteed not to conflict with other identifiers.
( t
used_namest unicodet numberst nextt add( R t templatet name( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt new_namej s
c C s@ | j r, t | _ | j j d | j � n | j j | � d S( Ns ### In file %s ###( t first_logt FalseR t appendR ( R t message( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt log_messageu s c C sX | j � } | j � } d | _ d } | j | | | f � | rT | j | � n d S( s Warn the user that a given chunk of code is not valid Python 3,
but that it cannot be converted automatically.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
u s Line %d: could not convert: %sN( t
get_linenot clonet prefixR$ ( R R t reasont linenot
for_outputt msg( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt cannot_convert{ s c C s' | j � } | j d | | f � d S( s� Used for warning the user about possible uncertainty in the
translation.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
s Line %d: %sN( R% R$ ( R R R( R) ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt warning� s c C s8 | j | _ | j | � t j d � | _ t | _ d S( s� Some fixers need to maintain tree-wide state.
This method is called once, at the start of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
i N( R R t itertoolst countR R
R ( R t treeR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt
start_tree� s
c C s d S( s� Some fixers need to maintain tree-wide state.
This method is called once, at the conclusion of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
N( ( R R0 R ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt finish_tree� s N($ t __name__t
__module__t __doc__R R R R R R t loggerR. R/ R t setR t orderR! t explicitt run_ordert _accept_typet keep_line_ordert
BM_compatibleR t python_symbolst symsR R R R R R R$ R, R- R1 R2 ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR s6
t ConditionalFixc B s& e Z d Z d Z d � Z d � Z RS( s@ Base class for fixers which not execute if an import is found. c G s# t t | � j | � d | _ d S( N( t superR@ R1 R t _should_skip( R t args( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR1 � s c C sa | j d k r | j S| j j d � } | d } d j | d � } t | | | � | _ | j S( Nt .i����( RB R t skip_ont splitt joinR ( R R t pkgR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt should_skip� s
N( R3 R4 R5 R RE R1 RI ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR@ � s ( R5 R. t patcompR t R t
fixer_utilR t objectR R@ ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt <module> s � patcomp.pyc 0000644 00000014711 15053244255 0006735 0 ustar 00 �
{ fc @ s� d Z d Z d d l Z d d l m Z m Z m Z m Z m Z m Z d d l
m Z d d l
m Z d e
f d � � YZ d
� Z d e f d � � YZ i e j d
6e j d 6e j d 6d d 6Z d � Z d � Z d � Z d S( s� Pattern compiler.
The grammar is taken from PatternGrammar.txt.
The compiler compiles a pattern to a pytree.*Pattern instance.
s# Guido van Rossum <guido@python.org>i����Ni ( t drivert literalst tokent tokenizet parset grammar( t pytree( t pygramt PatternSyntaxErrorc B s e Z RS( ( t __name__t
__module__( ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR s c c sw t t j t j t j f � } t j t j | � j � } x7 | D]/ } | \ } } } } } | | k r@ | Vq@ q@ Wd S( s6 Tokenizes a string suppressing significant whitespace.N( t setR t NEWLINEt INDENTt DEDENTR t generate_tokenst StringIOt readline( t inputt skipt tokenst quintuplet typet valuet startt endt line_text( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyt tokenize_wrapper s
t PatternCompilerc B sA e Z d d � Z e e d � Z d � Z d d � Z d � Z RS( c C s� | d k r' t j | _ t j | _ n' t j | � | _ t j | j � | _ t j | _
t j | _ t j
| j d t �| _ d S( s^ Initializer.
Takes an optional alternative filename for the pattern grammar.
t convertN( t NoneR t pattern_grammarR t pattern_symbolst symsR t load_grammart Symbolst python_grammart pygrammart python_symbolst pysymst Drivert pattern_convert( t selft grammar_file( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyt __init__( s c C s} t | � } y | j j | d | �} Wn( t j k
rR } t t | � � � n X| rl | j | � | f S| j | � Sd S( s= Compiles a pattern string to a nested pytree.*Pattern object.t debugN( R R t parse_tokensR t
ParseErrorR t strt compile_node( R* R R- t with_treeR t roott e( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyt compile_pattern7 s c C s� | j | j j k r% | j d } n | j | j j k r� g | j d d d � D] } | j | � ^ qQ } t | � d k r� | d St j g | D] } | g ^ q� d d d d �} | j � S| j | j j
k r=g | j D] } | j | � ^ q� } t | � d k r| d St j | g d d d d �} | j � S| j | j j k r�| j | j d � } t j
| � } | j � S| j | j j k s�t � d } | j } t | � d k r�| d j t j k r�| d j } | d } n d }
t | � d k r5| d j | j j k r5| d }
| d } n | j | |
� } |
d k r�|
j | j j k snt � |
j } | d } | j t j k r�d }
t j } n� | j t j k r�d }
t j } n� | j t j k rQ| d j t j k s�t � t | � d
k st � | j | d � }
} t | � d k r]| j | d � } q]n t s]t � |
d k su| d k r�| j � } t j | g g d |
d | �} q�n | d k r�| | _ n | j � S( sX Compiles a node, recursively.
This is one big switch on the node type.
i Ni i t mint maxi i����i ( i i ( R R! t Matchert childrent AlternativesR1 t lenR t WildcardPatternt optimizet Alternativet NegatedUnitt
compile_basict NegatedPatternt Unitt AssertionErrorR R t EQUALR t Repeatert STARt HUGEt PLUSt LBRACEt RBRACEt get_intt Falset name( R* t nodet cht altst at pt unitst patternRM t nodest repeatR9 t childR6 R7 ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR1 C sh 21
%
(
+
' c C s� t | � d k s t � | d } | j t j k rb t t j | j � � } t j
t | � | � S| j t j k rp| j } | j
� r� | t k r� t d | � � n | d r� t d � � n t j
t | � S| d k r� d } nF | j d � s-t | j | d � } | d k r-t d | � � q-n | d rW| j | d j d � g } n d } t j | | � Sns | j d k r�| j | d � S| j d k r�| d k s�t � | j | d � } t j | g g d
d d d �St s�t | � � d S( Ni i s Invalid token: %rs Can't have details for tokent anyt _s Invalid symbol: %rt (t [R6 R7 ( R; RC R R t STRINGt unicodeR t
evalStringR R t LeafPatternt _type_of_literalt NAMEt isuppert TOKEN_MAPR R t
startswitht getattrR' R1 R9 t NodePatternR< RL ( R* RU RV RN R R t contentt
subpattern( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR@ � s<
c C s% | j t j k s t � t | j � S( N( R R t NUMBERRC t intR ( R* RN ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyRK � s N( R R
R R, RL R5 R1 R@ RK ( ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR & s
G #Ra R\ Ri t TOKENc C s9 | d j � r t j S| t j k r1 t j | Sd Sd S( Ni ( t isalphaR Ra R t opmapR ( R ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR` � s
c C sW | \ } } } } | s' | | j k r= t j | | d | �St j | | d | �Sd S( s9 Converts raw node information to a Node or Leaf instance.t contextN( t
number2symbolR t Nodet Leaf( R t
raw_node_infoR R Rn R9 ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR) � s c C s t � j | � S( N( R R5 ( RT ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR5 � s ( t __doc__t
__author__R t pgen2R R R R R R t R R t ExceptionR R t objectR Ra R\ Ri R Rc R` R) R5 ( ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyt <module> s .
�
fixer_util.pyc 0000644 00000034533 15053244255 0007450 0 ustar 00 �
{ fc @ s d Z d d l m Z d d l m Z d d l m Z m Z d d l m Z
d d l m Z d � Z
d � Z d
� Z d � Z d5 d � Z d
� Z d � Z d � Z e � e � d � Z d5 d5 d � Z d � Z d � Z d5 d � Z d � Z d5 d � Z d5 d � Z d � Z d � Z d � Z d � Z! e" d d d d d d! d" d# d$ d% g
� Z# d& � Z$ d' a% d( a& d) a' e( a) d* � Z* d+ � Z+ d, � Z, d- � Z- d. � Z. d/ � Z/ d0 � Z0 d1 � Z1 e" e
j2 e
j3 g � Z4 d5 d2 � Z5 e" e
j3 e
j2 e
j6 g � Z7 d3 � Z8 d5 d4 � Z9 d5 S(6 s1 Utility functions, node construction macros, etc.i����( t islicei ( t token( t Leaft Node( t python_symbols( t patcompc C s% t t j | t t j d � | g � S( Nu =( R t symst argumentR R t EQUAL( t keywordt value( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt
KeywordArg s c C s t t j d � S( Nu (( R R t LPAR( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt LParen s c C s t t j d � S( Nu )( R R t RPAR( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt RParen s c C sl t | t � s | g } n t | t � s? d | _ | g } n t t j | t t j d d d �g | � S( s Build an assignment statementu u =t prefix( t
isinstancet listR R R t atomR R R ( t targett source( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Assign s c C s t t j | d | �S( s Return a NAME leafR ( R R t NAME( t nameR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Name& s c C s | t t j t � | g � g S( s A node tuple for obj.attr( R R t trailert Dot( t objt attr( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Attr* s c C s t t j d � S( s A comma leafu ,( R R t COMMA( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Comma. s c C s t t j d � S( s A period (.) leafu .( R R t DOT( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyR 2 s c C sM t t j | j � | j � g � } | rI | j d t t j | � � n | S( s- A parenthesised argument list, used by Call()i ( R R R t clonet insert_childt arglist( t argst lparent rparent node( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt ArgList6 s $ c C s: t t j | t | � g � } | d k r6 | | _ n | S( s A function callN( R R t powerR) t NoneR ( t func_nameR% R R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Call= s c C s t t j d � S( s A newline literalu
( R R t NEWLINE( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt NewlineD s c C s t t j d � S( s A blank lineu ( R R R. ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt BlankLineH s c C s t t j | d | �S( NR ( R R t NUMBER( t nR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt NumberL s c C s1 t t j t t j d � | t t j d � g � S( s A numeric or string subscriptu [u ]( R R R R R t LBRACEt RBRACE( t
index_node( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt SubscriptO s c C s t t j | d | �S( s
A string leafR ( R R t STRING( t stringR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt StringU s c C s d | _ d | _ d | _ t t j d � } d | _ t t j d � } d | _ | | | | g } | r� d | _ t t j d � } d | _ | j t t j | | g � � n t t j | t t j | � g � } t t j
t t j d � | t t j d � g � S( su A list comprehension of the form [xp for fp in it if test].
If test is None, the "if test" part is omitted.
u u u foru inu ifu [u ](
R R R R t appendR R t comp_ift listmakert comp_forR R4 R5 ( t xpt fpt itt testt for_leaft in_leaft
inner_argst if_leaft inner( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt ListCompY s$ "$ c C s x | D] } | j � q Wt t j d � t t j | d d �t t j d d d �t t j | � g } t t j | � } | S( sO Return an import statement in the form:
from package import name_leafsu fromR u u import( t removeR R R R R t import_as_namest import_from( t package_namet
name_leafst leaft childrent imp( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt
FromImportq s
c C s� t | t � r. | j t � t � g k r. t St | t � o� t | j � d k o� t | j d t � o� t | j d t � o� t | j d t � o� | j d j d k o� | j d j d k S( s( Does the node represent a tuple literal?i i i i u (u )( R R RO R
R t Truet lenR R
( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_tuple� s *c C sz t | t � oy t | j � d k oy t | j d t � oy t | j d t � oy | j d j d k oy | j d j d k S( s' Does the node represent a list literal?i i i����u [u ]( R R RS RO R R
( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_list� s c C s t t j t � | t � g � S( N( R R R R
R ( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt parenthesize� s t sortedR t sett anyt allt tuplet sumt mint maxt enumeratec c s4 t | | � } x | r/ | Vt | | � } q Wd S( sl Follow an attribute chain.
If you have a chain of objects where a.foo -> b, b.foo-> c, etc,
use this to iterate over all objects in the chain. Iteration is
terminated by getattr(x, attr) is None.
Args:
obj: the starting object
attr: the name of the chaining attribute
Yields:
Each successive object in the chain.
N( t getattr( R R t next( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt
attr_chain� s se for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
s�
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
s`
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
c C s� t s< t j t � a t j t � a t j t � a t a n t t t g } xR t | t | d � � D]8 \ } } i } | j | | � rd | d | k rd t Sqd Wt
S( s Returns true if node is in an environment where all that is required
of it is being iterable (ie, it doesn't matter if it returns a list
or an iterator).
See test_map_nochange in test_fixers.py for some examples and tests.
t parentR( ( t
pats_builtR t compile_patternt p0t p1t p2RR t zipRb t matcht False( R( t patternst patternRc t results( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt in_special_context� s %"c C s� | j } | d k r+ | j t j k r+ t S| j } | j t j t j f k rS t S| j t j
k r| | j d | k r| t S| j t j k s� | j t j
k r� | d k r� | j t j k s� | j d | k r� t St S( sG
Check that something isn't an attribute or function name etc.
i N( t prev_siblingR+ t typeR R! Rk Rc R t funcdeft classdeft expr_stmtRO t
parameterst
typedargslistR RR ( R( t prevRc ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_probably_builtin� s % c C sp xi | d k rk | j t j k r_ t | j � d k r_ | j d } | j t j k r_ | j Sn | j } q Wd S( s Find the indentation of *node*.i i u N(
R+ Rq R t suiteRS RO R t INDENTR
Rc ( R( t indent( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt find_indentation� s '
c C sW | j t j k r | S| j � } | j d } | _ t t j | g � } | | _ | S( N( Rq R Ry R" Rc R+ R ( R( Rc Ry ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt
make_suite s c C s; x4 | j t j k r6 | j } | s t d � � q q W| S( s Find the top level namespace.s, root found before file_input node was found.( Rq R t
file_inputRc t
ValueError( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt find_root s
c C s" t | t | � | � } t | � S( s� Returns true if name is imported from package at the
top level of the tree which node belongs to.
To cover the case of an import like 'import foo', use
None for the package and 'foo' for the name. ( t find_bindingR� t bool( t packageR R( t binding( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt does_tree_import s c C s | j t j t j f k S( s0 Returns true if the node is an import statement.( Rq R t import_nameRK ( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_import" s c C s� d � } t | � } t | | | � r+ d Sd } } xn t | j � D]] \ } } | | � sc qE n x1 t | j | � D] \ } } | | � sw Pqw qw W| | } PqE W| d k rxb t | j � D]N \ } } | j t j k r� | j r� | j d j t j k r� | d } Pq� q� Wn | d k r\t
t j t t j
d � t t j
| d d �g � } n$ t | t t j
| d d �g � } | t � g }
| j | t
t j |
� � d S( s\ Works like `does_tree_import` but adds an import statement
if it was not imported. c S s, | j t j k o+ | j o+ t | j d � S( Ni ( Rq R t simple_stmtRO R� ( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_import_stmt) s Ni i u importR u ( R� R� R_ RO Rq R R� R R8 R+ R R� R R RQ R/ R# ( R� R R( R� t roott
insert_post offsett idxt node2t import_RO ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt touch_import& s4
!$c C sK xD| j D]9} d } | j t j k rs t | | j d � rB | St | t | j d � | � } | r | } q n�| j t j t j f k r� t | t | j d � | � } | r | } q na| j t j
k r|t | t | j d � | � } | r� | } q x t | j d � D]b \ } } | j t j
k r| j d k rt | t | j | d � | � } | ru| } quqqWn� | j t k r�| j d j | k r�| } nv t | | | � r�| } n[ | j t j k r�t | | | � } n4 | j t j k r t | | j d � r | } q n | r
| s0| St | � rC| Sq
q
Wd S( s� Returns the node which binds variable name, otherwise None.
If optional argument package is supplied, only imports will
be returned.
See test cases for examples.i i����i i t :i i N( RO R+ Rq R t for_stmtt _findR� R} t if_stmtt
while_stmtt try_stmtR_ R t COLONR
t _def_symst _is_import_bindingR� Rt R� ( R R( R� t childt retR2 t it kid( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyR� T sH !# % c C s| | g } xl | rw | j � } | j d k rO | j t k rO | j | j � q | j t j k r | j | k r | Sq Wd S( Ni ( t popRq t _block_symst extendRO R R R
R+ ( R R( t nodes( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyR� s !c C s' | j t j k r| r| j d } | j t j k r� x� | j D]Z } | j t j k rw | j d j | k r� | SqB | j t j k rB | j | k rB | SqB Wq#| j t j k r� | j d } | j t j k r| j | k r| Sq#| j t j k r#| j | k r#| Sn| j t j k r#| rMt
| j d � j � | k rMd S| j d } | rst
d | � rsd S| j t j k r�t
| | � r�| S| j t j k r�| j d } | j t j k r | j | k r | Sq#| j t j k r| j | k r| S| r#| j t j k r#| Sn d S( s� Will reuturn node if node will import name, or node
will import * from package. None is returned otherwise.
See test cases for examples. i i i����i u asN( Rq R R� RO t dotted_as_namest dotted_as_nameR
R R RK t unicodet stripR+ R� RJ t import_as_namet STAR( R( R R� RP R� t lastR2 ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyR� � s@
!
!!%
!
!!N(: t __doc__t itertoolsR t pgen2R t pytreeR R t pygramR R t R R R
R R R+ R R R R R) R- R/ R0 R3 R7 R: RH RQ RT RU RV RX t consuming_callsRb Rf Rg Rh Rk Rd Ro Rx R| R} R� R� R� R� Rs Rr R� R� R R� R� R� ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt <module> sZ - *
fixer_base.pyc 0000644 00000016022 15053244255 0007376 0 ustar 00 �
{ fc @ sr d Z d d l Z d d l m Z d d l m Z d d l m Z d e f d � � YZ d e f d
� � YZ
d S( s2 Base class for fixers (optional, but recommended).i����Ni ( t PatternCompiler( t pygram( t does_tree_importt BaseFixc B s� e Z d Z d Z d Z d Z d Z d Z d Z e
j d � Z e
� Z d Z e Z d Z d Z e Z e Z e j Z d � Z d � Z d � Z d � Z d � Z d d
� Z d � Z d d � Z d
� Z! d � Z" d � Z# RS( s Optional base class for fixers.
The subclass name must be FixFooBar where FooBar is the result of
removing underscores and capitalizing the words of the fix name.
For example, the class name for a fixer named 'has_key' should be
FixHasKey.
i t posti c C s | | _ | | _ | j � d S( s Initializer. Subclass may override.
Args:
options: a dict containing the options passed to RefactoringTool
that could be used to customize the fixer through the command line.
log: a list to append warnings and other messages to.
N( t optionst logt compile_pattern( t selfR R ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt __init__0 s c C sC | j d k r? t � } | j | j d t �\ | _ | _ n d S( s� Compiles self.PATTERN into self.pattern.
Subclass may override if it doesn't want to use
self.{pattern,PATTERN} in .match().
t with_treeN( t PATTERNt NoneR R t Truet patternt pattern_tree( R t PC( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR < s c C s
| | _ d S( sm Set the filename, and a logger derived from it.
The main refactoring tool should call this.
N( t filename( R R ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt set_filenameG s c C s& i | d 6} | j j | | � o% | S( s Returns match for a given parse tree node.
Should return a true or false object (not necessarily a bool).
It may return a non-empty dict of matching sub-nodes as
returned by a matching pattern.
Subclass may override.
t node( R t match( R R t results( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR N s
c C s
t � � d S( s� Returns the transformation for a given parse tree node.
Args:
node: the root of the parse tree that matched the fixer.
results: a dict mapping symbolic names to part of the match.
Returns:
None, or a node that is a modified copy of the
argument node. The node argument may also be modified in-place to
effect the same change.
Subclass *must* override.
N( t NotImplementedError( R R R ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt transformZ s u xxx_todo_changemec C sI | } x, | | j k r4 | t | j j � � } q W| j j | � | S( s� Return a string suitable for use as an identifier
The new name is guaranteed not to conflict with other identifiers.
( t
used_namest unicodet numberst nextt add( R t templatet name( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt new_namej s
c C s@ | j r, t | _ | j j d | j � n | j j | � d S( Ns ### In file %s ###( t first_logt FalseR t appendR ( R t message( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt log_messageu s c C sX | j � } | j � } d | _ d } | j | | | f � | rT | j | � n d S( s Warn the user that a given chunk of code is not valid Python 3,
but that it cannot be converted automatically.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
u s Line %d: could not convert: %sN( t
get_linenot clonet prefixR$ ( R R t reasont linenot
for_outputt msg( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt cannot_convert{ s c C s' | j � } | j d | | f � d S( s� Used for warning the user about possible uncertainty in the
translation.
First argument is the top-level node for the code in question.
Optional second argument is why it can't be converted.
s Line %d: %sN( R% R$ ( R R R( R) ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt warning� s c C s8 | j | _ | j | � t j d � | _ t | _ d S( s� Some fixers need to maintain tree-wide state.
This method is called once, at the start of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
i N( R R t itertoolst countR R
R ( R t treeR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt
start_tree� s
c C s d S( s� Some fixers need to maintain tree-wide state.
This method is called once, at the conclusion of tree fix-up.
tree - the root node of the tree to be processed.
filename - the name of the file the tree came from.
N( ( R R0 R ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt finish_tree� s N($ t __name__t
__module__t __doc__R R R R R R t loggerR. R/ R t setR t orderR! t explicitt run_ordert _accept_typet keep_line_ordert
BM_compatibleR t python_symbolst symsR R R R R R R$ R, R- R1 R2 ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR s6
t ConditionalFixc B s& e Z d Z d Z d � Z d � Z RS( s@ Base class for fixers which not execute if an import is found. c G s# t t | � j | � d | _ d S( N( t superR@ R1 R t _should_skip( R t args( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR1 � s c C sa | j d k r | j S| j j d � } | d } d j | d � } t | | | � | _ | j S( Nt .i����( RB R t skip_ont splitt joinR ( R R t pkgR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt should_skip� s
N( R3 R4 R5 R RE R1 RI ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyR@ � s ( R5 R. t patcompR t R t
fixer_utilR t objectR R@ ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_base.pyt <module> s � main.pyc 0000644 00000023147 15053244255 0006221 0 ustar 00 �
{ fc @� s� d Z d d l m Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l m
Z
d � Z d e
j f d � � YZ
d � Z d d
� Z d S( s
Main program for 2to3.
i����( t with_statementNi ( t refactorc C� s: | j � } | j � } t j | | | | d d d d �S( s% Return a unified diff of two strings.s
(original)s (refactored)t linetermt ( t
splitlinest difflibt unified_diff( t at bt filename( ( s$ /usr/lib64/python2.7/lib2to3/main.pyt
diff_texts s
t StdoutRefactoringToolc B� s; e Z d Z d d d d � Z d � Z d � Z d � Z RS( s2
A refactoring tool that can avoid overwriting its input files.
Prints output to stdout.
Output files can optionally be written to a different directory and or
have an extra file suffix appended to their name for use in situations
where you do not want to replace the input files.
R c C� sv | | _ | | _ | r; | j t j � r; | t j 7} n | | _ | | _ | | _ t t | � j
| | | � d S( sF
Args:
fixers: A list of fixers to import.
options: A dict with RefactoringTool configuration.
explicit: A list of fixers to run even if they are explicit.
nobackups: If true no backup '.bak' files will be created for those
files that are being refactored.
show_diffs: Should diffs of the refactoring be printed to stdout?
input_base_dir: The base directory for all input files. This class
will strip this path prefix off of filenames before substituting
it with output_dir. Only meaningful if output_dir is supplied.
All files processed by refactor() must start with this path.
output_dir: If supplied, all converted files will be written into
this directory tree instead of input_base_dir.
append_suffix: If supplied, all files output by this tool will have
this appended to their filename. Useful for changing .py to
.py3 for example by passing append_suffix='3'.
N( t nobackupst
show_diffst endswitht ost sept _input_base_dirt _output_dirt _append_suffixt superR t __init__( t selft fixerst optionst explicitR R
t input_base_dirt
output_dirt
append_suffix( ( s$ /usr/lib64/python2.7/lib2to3/main.pyR $ s c O� s3 | j j | | | f � | j j | | | � d S( N( t errorst appendt loggert error( R t msgt argst kwargs( ( s$ /usr/lib64/python2.7/lib2to3/main.pyt log_errorA s c
C� s� | } | j re | j | j � rI t j j | j | t | j � � } qe t d | | j f � � n | j r~ | | j 7} n | | k r� t j j | � } t j j
| � s� t j | � n | j d | | � n | j
sy| d } t j j | � r6y t j | � Wq6t j k
r2} | j d | � q6Xn y t j | | � Wqyt j k
ru} | j d | | � qyXn t t | � j } | | | | | � | j
s�t j | | � n | | k r�t j | | � n d S( Ns5 filename %s does not start with the input_base_dir %ss Writing converted %s to %s.s .baks Can't remove backup %ss Can't rename %s to %s( R t
startswithR R t patht joint lent
ValueErrorR t dirnamet isdirt makedirst log_messageR t lexistst removeR t renameR R t
write_filet shutilt copymode(
R t new_textR t old_textt encodingt
orig_filenameR t backupt errt write( ( s$ /usr/lib64/python2.7/lib2to3/main.pyR1 E s@
c C� s� | r | j d | � n� | j d | � | j r� t | | | � } y_ | j d k r� | j �( x | D] } | GHqg Wt j j � Wd QXn x | D] } | GHq� WWq� t k
r� t d | f � d SXn d S( Ns No changes to %ss
Refactored %ss+ couldn't encode %s's diff for your terminal(
R- R
R
t output_lockt Nonet syst stdoutt flusht UnicodeEncodeErrort warn( R t oldt newR t equalt
diff_linest line( ( s$ /usr/lib64/python2.7/lib2to3/main.pyt print_outputl s"
( t __name__t
__module__t __doc__R R$ R1 RG ( ( ( s$ /usr/lib64/python2.7/lib2to3/main.pyR s
'c C� s t j d | f IJd S( Ns WARNING: %s( R= t stderr( R! ( ( s$ /usr/lib64/python2.7/lib2to3/main.pyRA � s c � s� t j d d � } | j d d d d d d �| j d d
d d d g d d
�| j d d d d d d d d d d �| j d d d d d g d d �| j d d d d d d �| j d d d d d d �| j d d d d d d �| j d! d d d d" �| j d# d$ d d d d% �| j d& d' d d d t d d( �| j d) d* d d d d+ d d, d d- �| j d. d/ d d d d0 �| j d1 d d d d+ d d, d d2 �t } i } | j | � \ } } | j rt | d3 <| j s�t d4 � n t | _ n | j r'| j
r'| j d5 � n | j rJ| j
rJ| j d6 � n | j rj| j
rjt d7 � n | j r�| j
r�| j d8 � n | j r�d9 GHx t j � � D] } | GHq�W| s�d: Sn | s�t j d; IJt j d< IJd= Sd> | k rt } | j rt j d? IJd= Sn | j r0t | d@ <n | j rBt j n t j } t j dA dB dC | � t j dD � } t t j � � � } t � f dE � | j D� � }
t � } | j rt } x; | j D]0 }
|
dF k r�t } q�| j � dG |
� q�W| r| j | � n | } n | j | � } | j |
� } t! j" j# | � } | r�| j$ t! j% � r�t! j" j& | � r�t! j" j' | � } n | j r�| j( t! j% � } | j) dH | j | � n t* t+ | � | t+ | � | j
| j
dI | dJ | j dK | j �} | j, s�| r | j- � n] y# | j | | j | j. | j/ � Wn7 t j0 k
rx| j/ d k sgt1 � t j dL IJd SX| j2 � n t3 t4 | j, � � S(M s� Main program.
Args:
fixer_pkg: the name of a package where the fixers are located.
args: optional; a list of command line arguments. If omitted,
sys.argv[1:] is used.
Returns a suggested exit status (0, 1, 2).
t usages 2to3 [options] file|dir ...s -ds --doctests_onlyt actiont
store_truet helps Fix up doctests onlys -fs --fixR t defaults1 Each FIX specifies a transformation; default: alls -js --processest storei t typet ints Run 2to3 concurrentlys -xs --nofixs' Prevent a transformation from being runs -ls --list-fixess List available transformationss -ps --print-functions0 Modify the grammar so that print() is a functions -vs --verboses More verbose loggings
--no-diffss# Don't show diffs of the refactorings -ws --writes Write back modified filess -ns --nobackupss& Don't write backups for modified filess -os --output-dirt strR sX Put output files in this directory instead of overwriting the input files. Requires -n.s -Ws --write-unchanged-filessY Also write files even if no changes were required (useful with --output-dir); implies -w.s --add-suffixsu Append this string to all output filenames. Requires -n if non-empty. ex: --add-suffix='3' will generate .py3 files.t write_unchanged_filess& --write-unchanged-files/-W implies -w.s% Can't use --output-dir/-o without -n.s" Can't use --add-suffix without -n.s@ not writing files and not printing diffs; that's not very usefuls Can't use -n without -ws2 Available transformations for the -f/--fix option:i s1 At least one file or directory argument required.s Use --help to show usage.i t -s Can't write to stdin.t print_functiont formats %(name)s: %(message)st levels lib2to3.mainc 3� s | ] } � d | Vq d S( s .fix_N( ( t .0t fix( t fixer_pkg( s$ /usr/lib64/python2.7/lib2to3/main.pys <genexpr>� s t alls .fix_s7 Output in %r will mirror the input directory %r layout.R R R s+ Sorry, -j isn't supported on this platform.(5 t optparset OptionParsert
add_optiont Falset
parse_argsRU t TrueR: RA R R R t
add_suffixt no_diffst
list_fixesR t get_all_fix_namesR= RK RW t verboset loggingt DEBUGt INFOt basicConfigt getLoggert sett get_fixers_from_packaget nofixR[ t addt uniont
differenceR R& t commonprefixR R R+ R* t rstript infoR t sortedR t refactor_stdint
doctests_onlyt processest MultiprocessingUnsupportedt AssertionErrort summarizeRS t bool( R\ R" t parserRx t flagsR t fixnameRY R t avail_fixest unwanted_fixesR t all_presentR[ t requestedt fixer_namesR t rt( ( R\ s$ /usr/lib64/python2.7/lib2to3/main.pyt main� s�
( RJ t
__future__R R= R R Ri R2 R^ R R R
t MultiprocessRefactoringToolR RA R< R� ( ( ( s$ /usr/lib64/python2.7/lib2to3/main.pyt <module> s h __main__.pyc 0000644 00000000362 15053244255 0007007 0 ustar 00 �
{ fc @ s3 d d l Z d d l m Z e j e d � � d S( i����Ni ( t mains
lib2to3.fixes( t sysR t exit( ( ( s( /usr/lib64/python2.7/lib2to3/__main__.pyt <module> s btm_matcher.pyc 0000644 00000013306 15053244255 0007556 0 ustar 00 �
{ fc @ s� d Z d Z d d l Z d d l Z d d l m Z d d l m Z d d l m Z d e
f d � � YZ d
e
f d � � YZ i a
d � Z d S(
s� A bottom-up tree matching algorithm implementation meant to speed
up 2to3's matching process. After the tree patterns are reduced to
their rarest linear path, a linear Aho-Corasick automaton is
created. The linear automaton traverses the linear paths from the
leaves to the root of the AST and returns a set of nodes for further
matching. This reduces significantly the number of candidate nodes.s+ George Boutsioukis <gboutsioukis@gmail.com>i����N( t defaultdicti ( t pytree( t reduce_treet BMNodec B s# e Z d Z e j � Z d � Z RS( s? Class for a node of the Aho-Corasick automaton used in matchingc C s1 i | _ g | _ t t j � | _ d | _ d S( Nt ( t transition_tablet fixerst nextR t countt idt content( t self( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt __init__ s ( t __name__t
__module__t __doc__t itertoolsR R ( ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR s t
BottomMatcherc B s; e Z d Z d � Z d � Z d � Z d � Z d � Z RS( sg The main matcher class. After instantiating the patterns should
be added using the add_fixer methodc C sF t � | _ t � | _ | j g | _ g | _ t j d � | _ d S( Nt RefactoringTool( t sett matchR t roott nodesR t loggingt getLoggert logger( R ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR s
c C sh | j j | � t | j � } | j � } | j | d | j �} x | D] } | j j | � qJ Wd S( s� Reduces a fixer's pattern tree to a linear path and adds it
to the matcher(a common Aho-Corasick automaton). The fixer is
appended on the matching states and called when they are
reachedt startN( R t appendR t pattern_treet get_linear_subpatternt addR ( R t fixert treet lineart match_nodest
match_node( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt add_fixer% s
c C s� | s
| g St | d t � r� g } xU | d D]I } | j | d | �} x+ | D]# } | j | j | d | � � qS Wq1 W| S| d | j k r� t � } | | j | d <n | j | d } | d r� | j | d d | �} n | g } | Sd S( s5 Recursively adds a linear pattern to the AC automatoni R i N( t
isinstancet tupleR t extendR R ( R t patternR R" t alternativet end_nodest endt next_node( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR 1 s"
%
c C s� | j } t t � } x�| D]y} | } xj| r�t | _ x? | j D]4 } t | t j � rD | j d k rD t
| _ PqD qD W| j d k r� | j } n | j } | | j k r� | j | } x� | j
D]0 } | | k r� g | | <n | | j | � q� Wn� | j } | j d k r%| j j r%Pn | | j k r�| j | } xD | j
D]6 } | | j � k rpg | | <n | | j | � qKWn | j } q+ Wq W| S( su The main interface with the bottom matcher. The tree is
traversed from the bottom using the constructed
automaton. Nodes are only checked once as the tree is
retraversed. When the automaton fails, we give it one more
shot(in case the above tree matches as a whole with the
rejected leaf), then we break for the next leaf. There is the
special case of multiple arguments(see code comments) where we
recheck the nodes
Args:
The leaves of the AST tree to be matched
Returns:
A dictionary of node matches with fixers as the keys
u ;i N( R R t listt Truet was_checkedt childrenR% R t Leaft valuet Falset typeR R R t parentt Nonet keys( R t leavest current_ac_nodet resultst leaft current_ast_nodet childt
node_tokenR ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt runS s>
!
c s* d GH� f d � � � | j � d GHd S( s< Prints a graphviz diagram of the BM automaton(for debugging)s
digraph g{c sv xo | j j � D]^ } | j | } d | j | j t | � t | j � f GH| d k rd | j GHn � | � q Wd S( Ns %d -> %d [label=%s] //%si ( R R7 R t type_reprt strR R
( t nodet subnode_keyt subnode( t
print_node( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyRE � s
' t }N( R ( R ( ( RE s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt print_ac� s
( R
R R R R$ R R? RG ( ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR s " =c C sh t sX d d l m } x? | j j � D]+ \ } } t | � t k r& | t | <q& q& Wn t j | | � S( Ni ( t python_symbols( t _type_reprst pygramRH t __dict__t itemsR4 t intt
setdefault( t type_numRH t namet val( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR@ � s ( R t
__author__R R t collectionsR R R t btm_utilsR t objectR R RI R@ ( ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt <module> s � btm_matcher.pyo 0000644 00000013306 15053244255 0007572 0 ustar 00 �
{ fc @ s� d Z d Z d d l Z d d l Z d d l m Z d d l m Z d d l m Z d e
f d � � YZ d
e
f d � � YZ i a
d � Z d S(
s� A bottom-up tree matching algorithm implementation meant to speed
up 2to3's matching process. After the tree patterns are reduced to
their rarest linear path, a linear Aho-Corasick automaton is
created. The linear automaton traverses the linear paths from the
leaves to the root of the AST and returns a set of nodes for further
matching. This reduces significantly the number of candidate nodes.s+ George Boutsioukis <gboutsioukis@gmail.com>i����N( t defaultdicti ( t pytree( t reduce_treet BMNodec B s# e Z d Z e j � Z d � Z RS( s? Class for a node of the Aho-Corasick automaton used in matchingc C s1 i | _ g | _ t t j � | _ d | _ d S( Nt ( t transition_tablet fixerst nextR t countt idt content( t self( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt __init__ s ( t __name__t
__module__t __doc__t itertoolsR R ( ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR s t
BottomMatcherc B s; e Z d Z d � Z d � Z d � Z d � Z d � Z RS( sg The main matcher class. After instantiating the patterns should
be added using the add_fixer methodc C sF t � | _ t � | _ | j g | _ g | _ t j d � | _ d S( Nt RefactoringTool( t sett matchR t roott nodesR t loggingt getLoggert logger( R ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR s
c C sh | j j | � t | j � } | j � } | j | d | j �} x | D] } | j j | � qJ Wd S( s� Reduces a fixer's pattern tree to a linear path and adds it
to the matcher(a common Aho-Corasick automaton). The fixer is
appended on the matching states and called when they are
reachedt startN( R t appendR t pattern_treet get_linear_subpatternt addR ( R t fixert treet lineart match_nodest
match_node( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt add_fixer% s
c C s� | s
| g St | d t � r� g } xU | d D]I } | j | d | �} x+ | D]# } | j | j | d | � � qS Wq1 W| S| d | j k r� t � } | | j | d <n | j | d } | d r� | j | d d | �} n | g } | Sd S( s5 Recursively adds a linear pattern to the AC automatoni R i N( t
isinstancet tupleR t extendR R ( R t patternR R" t alternativet end_nodest endt next_node( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR 1 s"
%
c C s� | j } t t � } x�| D]y} | } xj| r�t | _ x? | j D]4 } t | t j � rD | j d k rD t
| _ PqD qD W| j d k r� | j } n | j } | | j k r� | j | } x� | j
D]0 } | | k r� g | | <n | | j | � q� Wn� | j } | j d k r%| j j r%Pn | | j k r�| j | } xD | j
D]6 } | | j � k rpg | | <n | | j | � qKWn | j } q+ Wq W| S( su The main interface with the bottom matcher. The tree is
traversed from the bottom using the constructed
automaton. Nodes are only checked once as the tree is
retraversed. When the automaton fails, we give it one more
shot(in case the above tree matches as a whole with the
rejected leaf), then we break for the next leaf. There is the
special case of multiple arguments(see code comments) where we
recheck the nodes
Args:
The leaves of the AST tree to be matched
Returns:
A dictionary of node matches with fixers as the keys
u ;i N( R R t listt Truet was_checkedt childrenR% R t Leaft valuet Falset typeR R R t parentt Nonet keys( R t leavest current_ac_nodet resultst leaft current_ast_nodet childt
node_tokenR ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt runS s>
!
c s* d GH� f d � � � | j � d GHd S( s< Prints a graphviz diagram of the BM automaton(for debugging)s
digraph g{c sv xo | j j � D]^ } | j | } d | j | j t | � t | j � f GH| d k rd | j GHn � | � q Wd S( Ns %d -> %d [label=%s] //%si ( R R7 R t type_reprt strR R
( t nodet subnode_keyt subnode( t
print_node( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyRE � s
' t }N( R ( R ( ( RE s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt print_ac� s
( R
R R R R$ R R? RG ( ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR s " =c C sh t sX d d l m } x? | j j � D]+ \ } } t | � t k r& | t | <q& q& Wn t j | | � S( Ni ( t python_symbols( t _type_reprst pygramRH t __dict__t itemsR4 t intt
setdefault( t type_numRH t namet val( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR@ � s ( R t
__author__R R t collectionsR R R t btm_utilsR t objectR R RI R@ ( ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt <module> s � pytree.pyo 0000644 00000071354 15053244255 0006624 0 ustar 00 �
{ fc @ s d Z d Z d d l Z d d l Z d d l m Z d Z i a d � Z d e f d � � YZ d e f d
� � YZ
d e f d � � YZ d
� Z d e f d � � YZ
d e
f d � � YZ d e
f d � � YZ d e
f d � � YZ d e
f d � � YZ d � Z d S( s�
Python parse tree definitions.
This is a very concrete parse tree; we need to keep every token and
even the comments and whitespace between tokens.
There's also a pattern matching implementation here.
s# Guido van Rossum <guido@python.org>i����N( t StringIOi���c C sh t sX d d l m } x? | j j � D]+ \ } } t | � t k r& | t | <q& q& Wn t j | | � S( Ni ( t python_symbols( t _type_reprst pygramR t __dict__t itemst typet intt
setdefault( t type_numR t namet val( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt type_repr s t Basec B s� e Z d Z d Z d Z d Z e Z e Z d � Z
d � Z d Z d � Z
d � Z d � Z d � Z d � Z d � Z d � Z d
� Z d � Z d � Z d
� Z e d � � Z e d � � Z d � Z d � Z d � Z e j d k r� d � Z n RS( s�
Abstract base class for Node and Leaf.
This provides some default functionality and boilerplate using the
template pattern.
A node may be a subnode of at most one parent.
c O s
t j | � S( s7 Constructor that prevents Base from being instantiated.( t objectt __new__( t clst argst kwds( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR 2 s c C s# | j | j k r t S| j | � S( sW
Compare two nodes for equality.
This calls the method _eq().
( t __class__t NotImplementedt _eq( t selft other( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __eq__7 s c C s$ | j | j k r t S| j | � S( sY
Compare two nodes for inequality.
This calls the method _eq().
( R R R ( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __ne__C s c C s
t � d S( s_
Compare two nodes for equality.
This is called by __eq__ and __ne__. It is only called if the two nodes
have the same type. This must be implemented by the concrete subclass.
Nodes should be considered equal if they have the same structure,
ignoring the prefix string and other context information.
N( t NotImplementedError( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR M s c C s
t � d S( sr
Return a cloned (deep) copy of self.
This must be implemented by the concrete subclass.
N( R ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt cloneX s c C s
t � d S( sx
Return a post-order iterator for the tree.
This must be implemented by the concrete subclass.
N( R ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
post_order` s c C s
t � d S( sw
Return a pre-order iterator for the tree.
This must be implemented by the concrete subclass.
N( R ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt pre_orderh s c C s# t j d t d d �| | _ d S( sv
Set the prefix for the node (see Leaf class).
DEPRECATED; use the prefix property directly.
s3 set_prefix() is deprecated; use the prefix propertyt
stackleveli N( t warningst warnt DeprecationWarningt prefix( R R" ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
set_prefixp s
c C s t j d t d d �| j S( sy
Return the prefix for the node (see Leaf class).
DEPRECATED; use the prefix property directly.
s3 get_prefix() is deprecated; use the prefix propertyR i ( R R R! R" ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
get_prefixz s
c C s� t | t � s | g } n g } t } xR | j j D]D } | | k rk | d k rb | j | � n t } q4 | j | � q4 W| j j � | | j _ x | D] } | j | _ q� Wd | _ d S( s/ Replace this node with a new one in the parent.N(
t
isinstancet listt Falset parentt childrent Nonet extendt Truet appendt changed( R t newt
l_childrent foundt cht x( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt replace� s
c C s= | } x- t | t � s5 | j s% d S| j d } q W| j S( s9 Return the line number which generated the invocant node.Ni ( R% t LeafR) t lineno( R t node( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
get_lineno� s c C s& | j r | j j � n t | _ d S( N( R( R. R, t was_changed( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR. � s c C sf | j rb xV t | j j � D]? \ } } | | k r | j j � | j j | =d | _ | Sq Wn d S( s�
Remove the node from the tree. Returns the position of the node in its
parent's children before it was removed.
N( R( t enumerateR) R. R* ( R t iR7 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt remove� s
c C st | j d k r d SxZ t | j j � D]F \ } } | | k r& y | j j | d SWql t k
rh d SXq& q& Wd S( s�
The node immediately following the invocant in their parent's children
list. If the invocant does not have a next sibling, it is None
i N( R( R* R: R) t
IndexError( R R; t child( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt next_sibling� s
c C sh | j d k r d SxN t | j j � D]: \ } } | | k r& | d k rN d S| j j | d Sq& Wd S( s�
The node immediately preceding the invocant in their parent's children
list. If the invocant does not have a previous sibling, it is None.
i i N( R( R* R: R) ( R R; R> ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt prev_sibling� s c c s4 x- | j D]" } x | j � D] } | Vq Wq
Wd S( N( R) t leaves( R R> R3 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRA � s c C s$ | j d k r d Sd | j j � S( Ni i ( R( R* t depth( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRB � s c C s | j } | d k r d S| j S( s�
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
u N( R? R* R" ( R t next_sib( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
get_suffix� s i i c C s t | � j d � S( Nt ascii( t unicodet encode( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __str__� s N( ( i i (! t __name__t
__module__t __doc__R* R R( R) R' R9 t was_checkedR R t __hash__R R R R R R# R$ R4 R8 R. R< t propertyR? R@ RA RB RD t syst version_infoRH ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR
s6
t Nodec B s� e Z d Z d d d d � Z d � Z d � Z e j d k rH e Z n d � Z
d � Z d � Z d � Z
d
� Z d � Z e e e � Z d � Z d
� Z d � Z RS( s+ Concrete implementation for interior nodes.c C sm | | _ t | � | _ x | j D] } | | _ q" W| d k rM | | _ n | r` | | _ n d | _ d S( s�
Initializer.
Takes a type constant (a symbol number >= 256), a sequence of
child nodes, and an optional context keyword argument.
As a side effect, the parent pointers of the children are updated.
N( R R& R) R( R* R" t fixers_applied( R R R) t contextR" RR R2 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __init__� s
c C s# d | j j t | j � | j f S( s) Return a canonical string representation.s
%s(%s, %r)( R RI R R R) ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __repr__ s c C s d j t t | j � � S( sk
Return a pretty string representation.
This reproduces the input source exactly.
u ( t joint mapRF R) ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __unicode__ s i i c C s" | j | j f | j | j f k S( s Compare two nodes for equality.( R R) ( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR s c C s5 t | j g | j D] } | j � ^ q d | j �S( s$ Return a cloned (deep) copy of self.RR ( RQ R R) R RR ( R R2 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR ! s +c c s9 x- | j D]" } x | j � D] } | Vq Wq
W| Vd S( s* Return a post-order iterator for the tree.N( R) R ( R R> R7 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR & s
c c s9 | Vx- | j D]" } x | j � D] } | Vq" Wq Wd S( s) Return a pre-order iterator for the tree.N( R) R ( R R> R7 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR - s c C s | j s
d S| j d j S( sO
The whitespace and comments preceding this node in the input.
t i ( R) R" ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt _prefix_getter4 s c C s | j r | | j d _ n d S( Ni ( R) R" ( R R" ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt _prefix_setter< s c C s4 | | _ d | j | _ | | j | <| j � d S( s�
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N( R( R* R) R. ( R R; R> ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt set_childB s
c C s* | | _ | j j | | � | j � d S( s�
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N( R( R) t insertR. ( R R; R> ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt insert_childL s c C s' | | _ | j j | � | j � d S( s�
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N( R( R) R- R. ( R R> ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt append_childU s N( i i ( RI RJ RK R* RT RU RX RO RP RH R R R R RZ R[ RN R" R\ R^ R_ ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRQ � s$
R5 c B s� e Z d Z d Z d Z d Z d d g d � Z d � Z d � Z e
j d k rZ e Z n d � Z
d � Z d � Z d
� Z d � Z d � Z d
� Z e e e � Z RS( s' Concrete implementation for leaf nodes.RY i c C sb | d k r* | \ | _ \ | _ | _ n | | _ | | _ | d k rT | | _ n | | _ d S( s�
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
N( R* t _prefixR6 t columnR t valueRR ( R R Rb RS R" RR ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRT h s c C s d | j j | j | j f S( s) Return a canonical string representation.s
%s(%r, %r)( R RI R Rb ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRU { s c C s | j t | j � S( sk
Return a pretty string representation.
This reproduces the input source exactly.
( R" RF Rb ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRX � s i c C s" | j | j f | j | j f k S( s Compare two nodes for equality.( R Rb ( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c C s4 t | j | j | j | j | j f f d | j �S( s$ Return a cloned (deep) copy of self.RR ( R5 R Rb R" R6 Ra RR ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c c s | Vd S( N( ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRA � s c c s | Vd S( s* Return a post-order iterator for the tree.N( ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c c s | Vd S( s) Return a pre-order iterator for the tree.N( ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c C s | j S( sP
The whitespace and comments preceding this token in the input.
( R` ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRZ � s c C s | j � | | _ d S( N( R. R` ( R R" ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR[ � s
N( i i ( RI RJ RK R` R6 Ra R* RT RU RX RO RP RH R R RA R R RZ R[ RN R" ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR5 _ s& c C sk | \ } } } } | s' | | j k rT t | � d k rA | d St | | d | �St | | d | �Sd S( s�
Convert raw node information to a Node or Leaf instance.
This is passed to the parser driver which calls it whenever a reduction of a
grammar rule produces a new complete node, so that the tree is build
strictly bottom-up.
i i RS N( t
number2symbolt lenRQ R5 ( t grt raw_nodeR Rb RS R) ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt convert� s t BasePatternc B s\ e Z d Z d Z d Z d Z d � Z d � Z d � Z d d � Z
d d � Z d � Z RS( s�
A pattern is a tree matching pattern.
It looks for a specific node type (token or symbol), and
optionally for a specific content.
This is an abstract base class. There are three concrete
subclasses:
- LeafPattern matches a single leaf node;
- NodePattern matches a single node (usually non-leaf);
- WildcardPattern matches a sequence of nodes of variable length.
c O s
t j | � S( s> Constructor that prevents BasePattern from being instantiated.( R R ( R R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c C sh t | j � | j | j g } x! | rA | d d k rA | d =q! Wd | j j d j t t | � � f S( Ni����s %s(%s)s , (
R R t contentR
R* R RI RV RW t repr( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRU � s c C s | S( s�
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
( ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt optimize� s c C s� | j d k r% | j | j k r% t S| j d k r~ d } | d k rO i } n | j | | � se t S| r~ | j | � q~ n | d k r� | j r� | | | j <n t S( s#
Does this pattern exactly match a node?
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
Default implementation for non-wildcard patterns.
N( R R* R' Ri t _submatcht updateR
R, ( R R7 t resultst r( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt match� s ! c C s* t | � d k r t S| j | d | � S( s�
Does this pattern exactly match a sequence of nodes?
Default implementation for non-wildcard patterns.
i i ( Rd R' Rp ( R t nodesRn ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt match_seq s c c s4 i } | r0 | j | d | � r0 d | f Vn d S( s}
Generator yielding all matches for this pattern.
Default implementation for non-wildcard patterns.
i i N( Rp ( R Rq Ro ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt generate_matches s N(
RI RJ RK R* R Ri R
R RU Rk Rp Rr Rs ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRh � s
t LeafPatternc B s2 e Z d d d d � Z d d � Z d d � Z RS( c C s= | d k r n | d k r n | | _ | | _ | | _ d S( sp
Initializer. Takes optional type, content, and name.
The type, if given must be a token type (< 256). If not given,
this matches any *leaf* node; the content may still be required.
The content, if given, must be a string.
If a name is given, the matching node is stored in the results
dict under that key.
N( R* R Ri R
( R R Ri R
( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRT s c C s& t | t � s t St j | | | � S( s* Override match() to insist on a leaf node.( R% R5 R' Rh Rp ( R R7 Rn ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRp , s c C s | j | j k S( s�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
( Ri Rb ( R R7 Rn ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRl 2 s
N( RI RJ R* RT Rp Rl ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRt s t NodePatternc B s, e Z e Z d d d d � Z d d � Z RS( c C s� | d k r n | d k rb t | � } x8 t | � D]' \ } } t | t � r4 t | _ q4 q4 Wn | | _ | | _ | | _ d S( sd
Initializer. Takes optional type, content, and name.
The type, if given, must be a symbol type (>= 256). If the
type is None this matches *any* single node (leaf or not),
except if content is not None, in which it only matches
non-leaf nodes that also match the content pattern.
The content, if not None, must be a sequence of Patterns that
must match the node's children exactly. If the content is
given, the type must not be None.
If a name is given, the matching node is stored in the results
dict under that key.
N(
R* R& R: R% t WildcardPatternR, t wildcardsR Ri R
( R R Ri R
R; t item( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRT F s c C s� | j rh xX t | j | j � D]A \ } } | t | j � k r | d k r\ | j | � n t Sq Wt St | j � t | j � k r� t Sx9 t | j | j � D]" \ } } | j
| | � s� t Sq� Wt S( s�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
N( Rw Rs Ri R) Rd R* Rm R, R' t zipRp ( R R7 Rn t cRo t
subpatternR> ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRl c s
" "N( RI RJ R' Rw R* RT Rl ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRu B s Rv c B sh e Z d Z d
d e d
d � Z d � Z d
d � Z d
d � Z d � Z d � Z
d � Z d � Z RS( s
A wildcard pattern can match zero or more nodes.
This has all the flexibility needed to implement patterns like:
.* .+ .? .{m,n}
(a b c | d e | f)
(...)* (...)+ (...)? (...){m,n}
except it always uses non-greedy matching.
i c C s] | d k r5 t t t | � � } x | D] } q( Wn | | _ | | _ | | _ | | _ d S( s�
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optional minimum number of times to match, default 0
max: optional maximum number of times to match, default HUGE
name: optional name assigned to this match
[*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is
equivalent to (a b c | d e | f g h); if content is None,
this is equivalent to '.' in regular expression terms.
The min and max parameters work as follows:
min=0, max=maxint: .*
min=1, max=maxint: .+
min=0, max=1: .?
min=1, max=1: .
If content is not None, replace the dot with the parenthesized
list of alternatives, e.g. (a b c | d e | f g h)*
N( R* t tupleRW Ri t mint maxR
( R Ri R} R~ R
t alt( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRT � s
c C s/ d } | j d k rW t | j � d k rW t | j d � d k rW | j d d } n | j d k r� | j d k r� | j d k r� t d | j � S| d k r� | j | j k r� | j � Sn | j d k r+t | t � r+| j d k r+| j | j k r+t | j | j | j | j | j | j � S| S( s+ Optimize certain stacked wildcard patterns.i i R
N(
R* Ri Rd R} R~ Ru R
Rk R% Rv ( R R{ ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRk � s .
!
c C s | j | g | � S( s' Does this pattern exactly match a node?( Rr ( R R7 Rn ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRp � s c C su xn | j | � D]] \ } } | t | � k r | d k ri | j | � | j ri t | � | | j <qi n t Sq Wt S( s4 Does this pattern exactly match a sequence of nodes?N( Rs Rd R* Rm R
R& R, R' ( R Rq Rn Rz Ro ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRr � s
c c s� | j d k rs xvt | j d t t | � | j � � D]4 } i } | j ra | | | | j <n | | f Vq8 Wn| j d k r� | j | � Vn� t t d � r� t j
} t � t _
n z� yO xH | j | d � D]4 \ } } | j r� | | | | j <n | | f Vq� WWnY t
k
rgxI | j | � D]4 \ } } | j rU| | | | j <n | | f Vq,Wn XWd t t d � r�| t _
n Xd S( s"
Generator yielding matches for a sequence of nodes.
Args:
nodes: sequence of nodes
Yields:
(count, results) tuples where:
count: the match comprises nodes[:count];
results: dict containing named submatches.
i t bare_namet getrefcounti N( Ri R* t xrangeR} Rd R~ R
t _bare_name_matchest hasattrRO t stderrR t _recursive_matchest RuntimeErrort _iterative_matches( R Rq t countRo t save_stderr( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRs � s0 /
c c s` t | � } d | j k r) d i f Vn g } xO | j D]D } x; t | | � D]* \ } } | | f V| j | | f � qO Wq9 Wx� | r[g } x� | D]� \ } } | | k r� | | j k r� x� | j D] } xv t | | | � D]a \ }
} |
d k r� i } | j | � | j | � | |
| f V| j | |
| f � q� q� Wq� Wq� q� W| } q� Wd S( s( Helper to iteratively yield the matches.i N( Rd R} Ri Rs R- R~ Rm ( R Rq t nodelenRn R Rz Ro t new_resultst c0t r0t c1t r1( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR� � s*
)c C s� d } i } t } t | � } x_ | r | | k r t } x? | j D]4 } | d j | | | � rD | d 7} t } PqD qD Wq! W| | | | j <| | f S( s( Special optimized matcher for bare_name.i i ( R' Rd R, Ri Rp R
( R Rq R� Ro t doneR~ t leaf( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR� s
c c s� | | j k r d i f Vn | | j k r� x� | j D]� } xw t | | � D]f \ } } xW | j | | | d � D]; \ } } i } | j | � | j | � | | | f Vqs WqL Wq6 Wn d S( s( Helper to recursively yield the matches.i i N( R} R~ Ri Rs R� Rm ( R Rq R� R R� R� R� R� Ro ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR� , s '
N(
RI RJ RK R* t HUGERT Rk Rp Rr Rs R� R� R� ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRv s # - t NegatedPatternc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | d k r n | | _ d S( s
Initializer.
The argument is either a pattern or None. If it is None, this
only matches an empty sequence (effectively '$' in regex
lingo). If it is not None, this matches whenever the argument
pattern doesn't have any matches.
N( R* Ri ( R Ri ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRT = s c C s t S( N( R' ( R R7 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRp J s c C s t | � d k S( Ni ( Rd ( R Rq ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRr N s c c se | j d k r2 t | � d k ra d i f Vqa n/ x! | j j | � D]
\ } } d SWd i f Vd S( Ni ( Ri R* Rd Rs ( R Rq Rz Ro ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRs R s N( RI RJ R* RT Rp Rr Rs ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR� ; s
c c s� | s d i f Vn� | d | d } } x� | j | � D]s \ } } | sY | | f Vq9 xP t | | | � D]; \ } } i } | j | � | j | � | | | f Vqm Wq9 Wd S( sR
Generator yielding matches for a sequence of patterns and nodes.
Args:
patterns: a sequence of patterns
nodes: a sequence of nodes
Yields:
(count, results) tuples where:
count: the entire sequence of patterns matches nodes[:count];
results: dict containing named submatches.
i i N( Rs Rm ( t patternsRq t pt restR� R� R� R� Ro ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRs ^ s
( RK t
__author__RO R R R� R R R R
RQ R5 Rg Rh Rt Ru Rv R� Rs ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt <module> s"
�pN V,=�# fixes/fix_exitfunc.pyo 0000644 00000005305 15053244255 0011116 0 ustar 00 �
{ fc @ sg d Z d d l m Z m Z d d l m Z m Z m Z m Z m Z m
Z
d e j f d � � YZ d S( s7
Convert use of sys.exitfunc to use the atexit module.
i����( t pytreet
fixer_base( t Namet Attrt Callt Commat Newlinet symst FixExitfuncc B s5 e Z e Z e Z d Z d � Z d � Z d � Z RS( s�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c G s t t | � j | � d S( N( t superR t __init__( t selft args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR
s c C s& t t | � j | | � d | _ d S( N( R R t
start_treet Nonet
sys_import( R t treet filename( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR
! s c C s� d | k r/ | j d k r+ | d | _ n d S| d j � } d | _ t j t j t t d � t d � � � } t
| | g | j � } | j | � | j d k r� | j | d � d S| j j
d } | j t j k r| j t � � | j t d d � � n� | j j } | j
j | j � } | j } t j t j t d � t d d � g � }
t j t j |
g � } | j | d t � � | j | d
| � d S( NR t funcu u atexitu registersK Can't find sys import; Please add an atexit import at the top of your file.i u u importi ( R R t clonet prefixR t NodeR t powerR R R t replacet warningt childrent typet dotted_as_namest append_childR t parentt indext import_namet simple_stmtt insert_childR ( R t nodet resultsR t registert callt namest containing_stmtt positiont stmt_containert
new_importt new( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyt transform% s2
( t __name__t
__module__t Truet keep_line_ordert
BM_compatiblet PATTERNR
R
R, ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR s N(
t __doc__t lib2to3R R t lib2to3.fixer_utilR R R R R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyt <module> s . fixes/fix_standarderror.pyc 0000644 00000001543 15053244255 0012127 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s% Fixer for StandardError -> Exception.i ( t
fixer_base( t Namet FixStandarderrorc B s e Z e Z d Z d � Z RS( s-
'StandardError'
c C s t d d | j �S( Nu Exceptiont prefix( R R ( t selft nodet results( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyt <module> s fixes/fix_execfile.pyc 0000644 00000004074 15053244255 0011043 0 ustar 00 �
{ fc @ sy d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z m
Z
m Z m Z m
Z
d e j f d � � YZ d S( so Fixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
i ( t
fixer_base(
t Commat Namet Callt LParent RParent Dott Nodet ArgListt Stringt symst FixExecfilec B s e Z e Z d Z d � Z RS( s�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s� | s t � | d } | j d � } | j d � } | j d j d j � } t | j � t � t d d � g d | �} t t j t
d � | g � } t t j t � t
d � g � t t j t
� t � g � g } | g | }
| j � } d
| _ t d d
� } |
t � | t � | g }
t t
d � |
d
� } | g } | d k rq| j t � | j � g � n | d k r�| j t � | j � g � n t t
d � | d | j �S( Nt filenamet globalst localsi����s "rb"t t rparenu openu readu u 'exec'u compileu u exect prefix( t AssertionErrort gett childrent cloneR R R R R
t powerR t trailerR R R R R t Nonet extend( t selft nodet resultsR R
R t execfile_parent open_argst open_callt readt open_exprt filename_argt exec_strt compile_argst compile_callt args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyt transform s,
$ !
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR' ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyR s N( t __doc__t R t
fixer_utilR R R R R R R R R R
t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyt <module> s F fixes/fix_exitfunc.pyc 0000644 00000005305 15053244255 0011102 0 ustar 00 �
{ fc @ sg d Z d d l m Z m Z d d l m Z m Z m Z m Z m Z m
Z
d e j f d � � YZ d S( s7
Convert use of sys.exitfunc to use the atexit module.
i����( t pytreet
fixer_base( t Namet Attrt Callt Commat Newlinet symst FixExitfuncc B s5 e Z e Z e Z d Z d � Z d � Z d � Z RS( s�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c G s t t | � j | � d S( N( t superR t __init__( t selft args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR
s c C s& t t | � j | | � d | _ d S( N( R R t
start_treet Nonet
sys_import( R t treet filename( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR
! s c C s� d | k r/ | j d k r+ | d | _ n d S| d j � } d | _ t j t j t t d � t d � � � } t
| | g | j � } | j | � | j d k r� | j | d � d S| j j
d } | j t j k r| j t � � | j t d d � � n� | j j } | j
j | j � } | j } t j t j t d � t d d � g � }
t j t j |
g � } | j | d t � � | j | d
| � d S( NR t funcu u atexitu registersK Can't find sys import; Please add an atexit import at the top of your file.i u u importi ( R R t clonet prefixR t NodeR t powerR R R t replacet warningt childrent typet dotted_as_namest append_childR t parentt indext import_namet simple_stmtt insert_childR ( R t nodet resultsR t registert callt namest containing_stmtt positiont stmt_containert
new_importt new( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyt transform% s2
( t __name__t
__module__t Truet keep_line_ordert
BM_compatiblet PATTERNR
R
R, ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR s N(
t __doc__t lib2to3R R t lib2to3.fixer_utilR R R R R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyt <module> s . fixes/fix_future.pyo 0000644 00000001645 15053244255 0010606 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sV Remove __future__ imports
from __future__ import foo is replaced with an empty line.
i ( t
fixer_base( t BlankLinet FixFuturec B s# e Z e Z d Z d Z d � Z RS( s; import_from< 'from' module_name="__future__" 'import' any >i
c C s t � } | j | _ | S( N( R t prefix( t selft nodet resultst new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNt run_orderR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyt <module> s fixes/fix_ne.pyc 0000644 00000001751 15053244255 0007660 0 ustar 00 �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s Fixer that turns <> into !=.i ( t pytree( t token( t
fixer_baset FixNec B s# e Z e j Z d � Z d � Z RS( c C s
| j d k S( Nu <>( t value( t selft node( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt match s c C s" t j t j d d | j �} | S( Nu !=t prefix( R t LeafR t NOTEQUALR ( R R t resultst new( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt transform s ( t __name__t
__module__R R
t _accept_typeR R
( ( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyR s N( t __doc__t R t pgen2R R t BaseFixR ( ( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt <module> s fixes/fix_renames.pyo 0000644 00000004647 15053244255 0010733 0 ustar 00 �
{ fc @ su d Z d d l m Z d d l m Z m Z i i d d 6d 6Z i Z d � Z d � Z d e j
f d
� � YZ d S( s? Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
i ( t
fixer_base( t Namet
attr_chaint maxsizet maxintt sysc C s d d j t t | � � d S( Nt (t |t )( t joint mapt repr( t members( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt
alternates s c c so xh t j � D]Z \ } } xK | j � D]= \ } } | t | | f <d | | | f Vd | | f Vq& Wq
Wd S( Ns�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
s^
power< module_name=%r trailer< '.' attr_name=%r > any* >
( t MAPPINGt itemst LOOKUP( t modulet replacet old_attrt new_attr( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt
build_pattern s
t
FixRenamesc B s8 e Z e Z d j e � � Z d Z d � Z d � Z RS( R t prec sU t t | � j � � | � } | rQ t � f d � t | d � D� � rM t S| St S( Nc 3 s | ] } � | � Vq d S( N( ( t .0t obj( t match( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pys <genexpr>5 s t parent( t superR R t anyR t False( t selft nodet results( ( R s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyR 1 s %c C si | j d � } | j d � } | re | re t t | j | j f � } | j t | d | j �� n d S( Nt module_namet attr_namet prefix( t gett unicodeR t valueR R R$ ( R R R! t mod_nameR# R ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt transform> s
(
t __name__t
__module__t Truet
BM_compatibleR R t PATTERNt orderR R) ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyR * s
N( t __doc__t R t
fixer_utilR R R R R
R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt <module> s fixes/fix_filter.pyo 0000644 00000004336 15053244255 0010561 0 ustar 00 �
{ fc @ se d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d e j
f d � � YZ d S( s� Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
i ( t token( t
fixer_base( t Namet Callt ListCompt in_special_contextt FixFilterc B s# e Z e Z d Z d Z d � Z RS( s�
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
>
s future_builtins.filterc C s | j | � r d Sd | k rs t | j d � j � | j d � j � | j d � j � | j d � j � � } n} d | k r� t t d � t d � | d j � t d � � } n= t | � r� d S| j � } d | _ t t d � | g � } | j | _ | S(
Nt
filter_lambdat fpt itt xpt noneu _ft sequ u list( t should_skipR t gett cloneR R t Nonet prefixR ( t selft nodet resultst new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyt transform5 s&
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyR s N( t __doc__t pgen2R t R t
fixer_utilR R R R t ConditionalFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyt <module> s " fixes/fix_import.pyc 0000644 00000006265 15053244255 0010575 0 ustar 00 �
{ fc @ sz d Z d d l m Z d d l m Z m Z m Z m Z d d l m Z m
Z
m Z d � Z d e j
f d � � YZ d S(
s� Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
i ( t
fixer_basei����( t dirnamet joint existst sep( t
FromImportt symst tokenc c s� | g } x� | r� | j � } | j t j k r; | j Vq | j t j k rw d j g | j D] } | j ^ q] � Vq | j t j k r� | j
| j d � q | j t j k r� | j | j d d d � � q t
d � � q Wd S( sF
Walks over all the names imported in a dotted_as_names node.
t i Ni����s unknown node type( t popt typeR t NAMEt valueR t dotted_nameR t childrent dotted_as_namet appendt dotted_as_namest extendt AssertionError( t namest pendingt nodet ch( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt traverse_imports s * t FixImportc B s/ e Z e Z d Z d � Z d � Z d � Z RS( sj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c C s/ t t | � j | | � d | j k | _ d S( Nt absolute_import( t superR t
start_treet future_featurest skip( t selft treet name( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR / s c C s | j r
d S| d } | j t j k r~ x t | d � sK | j d } q, W| j | j � rd | j | _ | j � qn� t } t } x2 t
| � D]$ } | j | � r� t } q� t } q� W| r� | r� | j | d � n d St
d | g � } | j | _ | Sd S( Nt impR i u .s# absolute and local imports together( R R
R t import_fromt hasattrR t probably_a_local_importR t changedt FalseR t Truet warningR t prefix( R R t resultsR" t
have_localt
have_absolutet mod_namet new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt transform3 s,
c C s� | j d � r t S| j d d � d } t | j � } t | | � } t t t | � d � � sf t Sx4 d t d d d d g D] } t | | � r t Sq Wt S(
Nu .i i s __init__.pys .pys .pycs .sos .sls .pyd( t
startswithR' t splitR t filenameR R R R( ( R t imp_namet base_patht ext( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR% U s ( t __name__t
__module__R( t
BM_compatiblet PATTERNR R0 R% ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR & s
"N( t __doc__R R t os.pathR R R R t
fixer_utilR R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt <module> s
" fixes/fix_reduce.pyo 0000644 00000002374 15053244255 0010543 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sq Fixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
i����( t
fixer_base( t touch_importt FixReducec B s# e Z e Z d Z d Z d � Z RS( t presi
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t d d | � d S( Nu functoolsu reduce( R ( t selft nodet results( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyt transform" s ( t __name__t
__module__t Truet
BM_compatiblet ordert PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyt <module> s fixes/fix_throw.pyo 0000644 00000003732 15053244255 0010436 0 ustar 00 �
{ fc @ s{ d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z d e j f d � � YZ
d S( s� Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions.i ( t pytree( t token( t
fixer_base( t Namet Callt ArgListt Attrt is_tuplet FixThrowc B s e Z e Z d Z d � Z RS( s�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C sP | j } | d j � } | j t j k r? | j | d � d S| j d � } | d k r^ d S| j � } t | � r� g | j d d !D] } | j � ^ q� } n d | _
| g } | d } d | k r6| d j � } d | _
t | | � }
t |
t
d � � t | g � g } | j t j | j | � � n | j t | | � � d S(
Nt excs+ Python 3 does not support string exceptionsu vali i����u t argst tbu with_traceback( t symst clonet typeR t STRINGt cannot_convertt gett NoneR t childrent prefixR R R R t replaceR t Nodet power( t selft nodet resultsR R t valt cR
t
throw_argsR t et with_tb( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyt transform s* ,
% ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyR s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyt <module> s
( fixes/fix_operator.pyc 0000644 00000012036 15053244255 0011107 0 ustar 00 �
{ fc @ s^ d Z d d l m Z d d l m Z m Z m Z m Z d � Z d e j f d � � YZ
d S( s� Fixer for operator functions.
operator.isCallable(obj) -> hasattr(obj, '__call__')
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
i����( t
fixer_base( t Callt Namet Stringt touch_importc s � f d � } | S( Nc s
� | _ | S( N( t
invocation( t f( t s( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt dec s ( ( R R ( ( R s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR s t FixOperatorc B s� e Z e Z d Z d Z d Z d e d e d e � Z d � Z e
d � d � � Z e
d � d
� � Z e
d � d � � Z
e
d
� d � � Z e
d � d � � Z e
d � d � � Z e
d � d � � Z d � Z d � Z d � Z RS( t pres�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
s '(' obj=any ')'s�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
t methodst objc C s/ | j | | � } | d k r+ | | | � Sd S( N( t
_check_methodt None( t selft nodet resultst method( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt transform) s s operator.contains(%s)c C s | j | | d � S( Nu contains( t _handle_rename( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _sequenceIncludes. s s hasattr(%s, '__call__')c C sG | d } | j � t d � t d � g } t t d � | d | j �S( NR u , u
'__call__'u hasattrt prefix( t cloneR R R R ( R R R R t args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isCallable2 s
!s operator.mul(%s)c C s | j | | d � S( Nu mul( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _repeat8 s s operator.imul(%s)c C s | j | | d � S( Nu imul( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _irepeat< s s$ isinstance(%s, collections.Sequence)c C s | j | | d d � S( Nu collectionsu Sequence( t _handle_type2abc( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isSequenceType@ s s# isinstance(%s, collections.Mapping)c C s | j | | d d � S( Nu collectionsu Mapping( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isMappingTypeD s s isinstance(%s, numbers.Number)c C s | j | | d d � S( Nu numbersu Number( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt
_isNumberTypeH s c C s% | d d } | | _ | j � d S( NR i ( t valuet changed( R R R t nameR ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR L s c C sa t d | | � | d } | j � t d d j | | g � � g } t t d � | d | j �S( NR u , u .u
isinstanceR ( R R R R t joinR R R ( R R R t modulet abcR R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR Q s
+c C s� t | d | d d j j d � � } t | � r� d | k rC | St | d � f } t | j � | } | j | d | � n d S( Nt _R i t asciiR$ R u You should use '%s' here.( t getattrR t encodet callablet unicodeR t warningR ( R R R R t subt invocation_str( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR
W s ' ( t __name__t
__module__t Truet
BM_compatiblet orderR R t dictt PATTERNR R R R R R R R R R R R
( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR R R R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt <module>
s " fixes/fix_idioms.pyo 0000644 00000010521 15053244255 0010551 0 ustar 00 �
{ fc @ sm d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z d Z
d Z d e j f d � � YZ
d S( s� Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
i ( t
fixer_base( t Callt Commat Namet Nodet BlankLinet symss0 (n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)s( power< 'type' trailer< '(' x=any ')' > >t FixIdiomsc B sQ e Z e Z d e e e e f Z d � Z d � Z d � Z d � Z
d � Z RS( s�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c C sJ t t | � j | � } | rF d | k rF | d | d k rB | Sd S| S( Nt sortedt id1t id2( t superR t matcht None( t selft nodet r( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR O s c C sd d | k r | j | | � Sd | k r8 | j | | � Sd | k rT | j | | � St d � � d S( Nt
isinstancet whileR s
Invalid match( t transform_isinstancet transform_whilet transform_sortt RuntimeError( R R t results( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyt transformZ s c C s� | d j � } | d j � } d | _ d | _ t t d � | t � | g � } d | k r� d | _ t t j t d � | g � } n | j | _ | S( Nt xt Tu u u
isinstancet nu not( t clonet prefixR R R R R t not_test( R R R R R t test( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR d s ! ! c C s* | d } | j t d d | j �� d S( NR u TrueR ( t replaceR R ( R R R t one( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR p s
c C s= | d } | d } | j d � } | j d � } | rW | j t d d | j �� nR | r� | j � } d | _ | j t t d � | g d | j �� n t d � � | j � | j } d | k r9| r| j d � d
| d
j f } d j | � | d
_ q9t
� }
| j j |
� | j d � d
|
_ n d S( Nt sortt nextt listt expru sortedR u s should not have reached hereu
i (
t getR R R R R R t removet
rpartitiont joinR t parentt append_child( R R R t sort_stmtt next_stmtt list_callt simple_exprt newt btwnt prefix_linest end_line( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR t s*
( t __name__t
__module__t Truet explicitt TYPEt CMPt PATTERNR R R R R ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR % s '
N( t __doc__t R t
fixer_utilR R R R R R R9 R8 t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyt <module> s
. fixes/fix_imports.pyo 0000644 00000012404 15053244255 0010764 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z m Z i0 d d 6d d 6d d 6d d
6d d 6d
d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d! d" 6d# d$ 6d% d& 6d' d( 6d) d* 6d+ d, 6d- d. 6d/ d0 6d1 d2 6d3 d4 6d5 d6 6d7 d8 6d9 d: 6d; d< 6d= d> 6d? d@ 6dA dB 6dC dD 6dC dE 6dF dG 6dH dI 6dJ dK 6dL dM 6dN dO 6dP dQ 6dP dR 6dP dS 6dT dU 6dV dW 6dV dX 6dY dZ 6d[ d\ 6Z d] � Z e d^ � Z d_ e j f d` � � YZ
da S(b s/ Fix incompatible imports and module references.i ( t
fixer_base( t Namet
attr_chaint iot StringIOt cStringIOt picklet cPicklet builtinst __builtin__t copyregt copy_regt queuet Queuet socketservert SocketServert configparsert ConfigParsert reprlibt reprs tkinter.filedialogt
FileDialogt tkFileDialogs tkinter.simpledialogt SimpleDialogt tkSimpleDialogs tkinter.colorchoosert tkColorChoosers tkinter.commondialogt tkCommonDialogs tkinter.dialogt Dialogs tkinter.dndt Tkdnds tkinter.fontt tkFonts tkinter.messageboxt tkMessageBoxs tkinter.scrolledtextt ScrolledTexts tkinter.constantst Tkconstantss tkinter.tixt Tixs tkinter.ttkt ttkt tkintert Tkintert _markupbaset
markupbaset winregt _winregt _threadt threadt
_dummy_threadt dummy_threads dbm.bsdt dbhashs dbm.dumbt dumbdbms dbm.ndbmt dbms dbm.gnut gdbms
xmlrpc.clientt xmlrpclibs
xmlrpc.servert DocXMLRPCServert SimpleXMLRPCServers http.clientt httplibs
html.entitiest htmlentitydefss html.parsert
HTMLParsers http.cookiest Cookies http.cookiejart cookielibs http.servert BaseHTTPServert SimpleHTTPServert
CGIHTTPServert
subprocesst commandst collectionst
UserStringt UserLists urllib.parset urlparses urllib.robotparsert robotparserc C s d d j t t | � � d S( Nt (t |t )( t joint mapR ( t members( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt
alternates= s c c sl d j g | D] } d | ^ q
� } t | j � � } d | | f Vd | Vd | | f Vd | Vd S( Ns | s module_name='%s'sy name_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
s� import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
s� import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
s3 power< bare_with_attr=(%s) trailer<'.' any > any* >( RE RH t keys( t mappingt keyt mod_listt
bare_names( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt
build_patternA s & t
FixImportsc B sM e Z e Z e Z e Z d Z d � Z d � Z d � Z
d � Z d � Z RS( i c C s d j t | j � � S( NRC ( RE RN RJ ( t self( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRN ` s c C s& | j � | _ t t | � j � d S( N( RN t PATTERNt superRO t compile_pattern( RP ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRS c s c sa t t | � j � � | � } | r] d | k rY t � f d � t | d � D� � rY t S| St S( Nt bare_with_attrc 3 s | ] } � | � Vq d S( N( ( t .0t obj( t match( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pys <genexpr>q s t parent( RR RO RW t anyR t False( RP t nodet results( ( RW s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRW j s %c C s& t t | � j | | � i | _ d S( N( RR RO t
start_treet replace( RP t treet filename( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyR] v s c C s� | j d � } | r� | j } t | j | � } | j t | d | j �� d | k ri | | j | <n d | k r� | j | � } | r� | j | | � q� q� nH | d d } | j j | j � } | r� | j t | d | j �� n d S( Nt module_namet prefixt name_importt multiple_importsRT i ( t gett valuet unicodeRJ R^ R Rb RW t transform( RP R[ R\ t
import_modt mod_namet new_namet bare_name( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRh z s (
t __name__t
__module__t Truet
BM_compatiblet keep_line_ordert MAPPINGRJ t run_orderRN RS RW R] Rh ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRO U s N( t __doc__t R t
fixer_utilR R Rr RH RN t BaseFixRO ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt <module> sj
fixes/fix_imports2.pyc 0000644 00000001172 15053244255 0011032 0 ustar 00 �
{ fc @ sG d Z d d l m Z i d d 6d d 6Z d e j f d � � YZ d S( sT Fix incompatible imports and module references that must be fixed after
fix_imports.i ( t fix_importst dbmt whichdbt anydbmt FixImports2c B s e Z d Z e Z RS( i ( t __name__t
__module__t run_ordert MAPPINGt mapping( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_imports2.pyR s N( t __doc__t R R t
FixImportsR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_imports2.pyt <module> s
fixes/fix_buffer.pyo 0000644 00000001704 15053244255 0010541 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s4 Fixer that changes buffer(...) into memoryview(...).i ( t
fixer_base( t Namet FixBufferc B s# e Z e Z e Z d Z d � Z RS( sR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu
memoryviewt prefix( t replaceR R ( t selft nodet resultsR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet explicitt PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyt <module> s fixes/fix_getcwdu.pyc 0000644 00000001654 15053244255 0010722 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s1
Fixer that changes os.getcwdu() to os.getcwd().
i ( t
fixer_base( t Namet
FixGetcwduc B s e Z e Z d Z d � Z RS( sR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu getcwdt prefix( t replaceR R ( t selft nodet resultsR ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyR
s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyt <module> s fixes/fix_filter.pyc 0000644 00000004336 15053244255 0010545 0 ustar 00 �
{ fc @ se d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d e j
f d � � YZ d S( s� Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
i ( t token( t
fixer_base( t Namet Callt ListCompt in_special_contextt FixFilterc B s# e Z e Z d Z d Z d � Z RS( s�
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
>
s future_builtins.filterc C s | j | � r d Sd | k rs t | j d � j � | j d � j � | j d � j � | j d � j � � } n} d | k r� t t d � t d � | d j � t d � � } n= t | � r� d S| j � } d | _ t t d � | g � } | j | _ | S(
Nt
filter_lambdat fpt itt xpt noneu _ft sequ u list( t should_skipR t gett cloneR R t Nonet prefixR ( t selft nodet resultst new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyt transform5 s&
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyR s N( t __doc__t pgen2R t R t
fixer_utilR R R R t ConditionalFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyt <module> s " fixes/fix_map.pyo 0000644 00000005756 15053244255 0010060 0 ustar 00 �
{ fc @ su d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d d l
m Z d e j
f d � � YZ d S( s Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
i ( t token( t
fixer_base( t Namet Callt ListCompt in_special_context( t python_symbolst FixMapc B s# e Z e Z d Z d Z d � Z RS( s�
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'map' trailer< '(' [arglist=any] ')' >
>
s future_builtins.mapc C s� | j | � r d S| j j t j k rh | j | d � | j � } d | _ t t d � | g � } n d | k r� t
| d j � | d j � | d j � � } n� d | k r� | d j � } n� d
| k r4| d
} | j t j k r4| j d j t
j k r4| j d j d k r4| j | d
� d Sn t | � rDd S| j � } d | _ t t d � | g � } | j | _ | S( Ns You should use a for loop hereu u listt
map_lambdat xpt fpt itt map_nonet argt arglisti t Nonesj cannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence( t should_skipt parentt typet symst simple_stmtt warningt clonet prefixR R R R t childrenR t NAMEt valueR R ( t selft nodet resultst newt args( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyt transform; s6
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyR s N( t __doc__t pgen2R t R t
fixer_utilR R R R t pygramR R t ConditionalFixR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyt <module> s
" fixes/fix_imports.pyc 0000644 00000012404 15053244255 0010750 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z m Z i0 d d 6d d 6d d 6d d
6d d 6d
d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d! d" 6d# d$ 6d% d& 6d' d( 6d) d* 6d+ d, 6d- d. 6d/ d0 6d1 d2 6d3 d4 6d5 d6 6d7 d8 6d9 d: 6d; d< 6d= d> 6d? d@ 6dA dB 6dC dD 6dC dE 6dF dG 6dH dI 6dJ dK 6dL dM 6dN dO 6dP dQ 6dP dR 6dP dS 6dT dU 6dV dW 6dV dX 6dY dZ 6d[ d\ 6Z d] � Z e d^ � Z d_ e j f d` � � YZ
da S(b s/ Fix incompatible imports and module references.i ( t
fixer_base( t Namet
attr_chaint iot StringIOt cStringIOt picklet cPicklet builtinst __builtin__t copyregt copy_regt queuet Queuet socketservert SocketServert configparsert ConfigParsert reprlibt reprs tkinter.filedialogt
FileDialogt tkFileDialogs tkinter.simpledialogt SimpleDialogt tkSimpleDialogs tkinter.colorchoosert tkColorChoosers tkinter.commondialogt tkCommonDialogs tkinter.dialogt Dialogs tkinter.dndt Tkdnds tkinter.fontt tkFonts tkinter.messageboxt tkMessageBoxs tkinter.scrolledtextt ScrolledTexts tkinter.constantst Tkconstantss tkinter.tixt Tixs tkinter.ttkt ttkt tkintert Tkintert _markupbaset
markupbaset winregt _winregt _threadt threadt
_dummy_threadt dummy_threads dbm.bsdt dbhashs dbm.dumbt dumbdbms dbm.ndbmt dbms dbm.gnut gdbms
xmlrpc.clientt xmlrpclibs
xmlrpc.servert DocXMLRPCServert SimpleXMLRPCServers http.clientt httplibs
html.entitiest htmlentitydefss html.parsert
HTMLParsers http.cookiest Cookies http.cookiejart cookielibs http.servert BaseHTTPServert SimpleHTTPServert
CGIHTTPServert
subprocesst commandst collectionst
UserStringt UserLists urllib.parset urlparses urllib.robotparsert robotparserc C s d d j t t | � � d S( Nt (t |t )( t joint mapR ( t members( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt
alternates= s c c sl d j g | D] } d | ^ q
� } t | j � � } d | | f Vd | Vd | | f Vd | Vd S( Ns | s module_name='%s'sy name_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
s� import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
s� import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
s3 power< bare_with_attr=(%s) trailer<'.' any > any* >( RE RH t keys( t mappingt keyt mod_listt
bare_names( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt
build_patternA s & t
FixImportsc B sM e Z e Z e Z e Z d Z d � Z d � Z d � Z
d � Z d � Z RS( i c C s d j t | j � � S( NRC ( RE RN RJ ( t self( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRN ` s c C s& | j � | _ t t | � j � d S( N( RN t PATTERNt superRO t compile_pattern( RP ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRS c s c sa t t | � j � � | � } | r] d | k rY t � f d � t | d � D� � rY t S| St S( Nt bare_with_attrc 3 s | ] } � | � Vq d S( N( ( t .0t obj( t match( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pys <genexpr>q s t parent( RR RO RW t anyR t False( RP t nodet results( ( RW s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRW j s %c C s& t t | � j | | � i | _ d S( N( RR RO t
start_treet replace( RP t treet filename( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyR] v s c C s� | j d � } | r� | j } t | j | � } | j t | d | j �� d | k ri | | j | <n d | k r� | j | � } | r� | j | | � q� q� nH | d d } | j j | j � } | r� | j t | d | j �� n d S( Nt module_namet prefixt name_importt multiple_importsRT i ( t gett valuet unicodeRJ R^ R Rb RW t transform( RP R[ R\ t
import_modt mod_namet new_namet bare_name( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRh z s (
t __name__t
__module__t Truet
BM_compatiblet keep_line_ordert MAPPINGRJ t run_orderRN RS RW R] Rh ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRO U s N( t __doc__t R t
fixer_utilR R Rr RH RN t BaseFixRO ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt <module> sj
fixes/fix_apply.pyc 0000644 00000004044 15053244255 0010401 0 ustar 00 �
{ fc @ so d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z d e j
f d � � YZ d S( sI Fixer for apply().
This converts apply(func, v, k) into (func)(*v, **k).i ( t pytree( t token( t
fixer_base( t Callt Commat parenthesizet FixApplyc B s e Z e Z d Z d � Z RS( s.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C s� | j } | s t � | d } | d } | j d � } | r� | j | j j k rW d S| j | j j k r� | j d j d k r� d Sn | r� | j | j j k r� | j d j d k r� d S| j } | j � } | j t
j | j f k r(| j | j
k s| j d j t
j k r(t | � } n d | _ | j � } d | _ | d k rj| j � } d | _ n t j t
j d � | g } | d k r�| j t � t j t
j d � | g � d
| d _ n t | | d | �S( Nt funct argst kwdsi s **i����t u *u **u t prefix( t symst AssertionErrort gett typet star_exprt argumentt childrent valueR t cloneR t NAMEt atomt powert
DOUBLESTARR t NoneR t Leaft STARt extendR R ( t selft nodet resultsR R R R R t l_newargs( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyt transform sB
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR! ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyR s N( t __doc__R
R t pgen2R R t
fixer_utilR R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyt <module> s
fixes/fix_paren.pyc 0000644 00000003025 15053244255 0010357 0 ustar 00 �
{ fc @ sI d Z d d l m Z d d l m Z m Z d e j f d � � YZ d S( su Fixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``.i ( t
fixer_base( t LParent RParent FixParenc B s e Z e Z d Z d � Z RS( s
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C sL | d } t � } | j | _ d | _ | j d | � | j t � � d S( Nt targetu i ( R t prefixt insert_childt append_childR ( t selft nodet resultsR t lparen( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyt transform% s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyt <module> s fixes/fix_apply.pyo 0000644 00000004003 15053244255 0010410 0 ustar 00 �
{ fc @ so d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z d e j
f d � � YZ d S( sI Fixer for apply().
This converts apply(func, v, k) into (func)(*v, **k).i ( t pytree( t token( t
fixer_base( t Callt Commat parenthesizet FixApplyc B s e Z e Z d Z d � Z RS( s.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C s� | j } | d } | d } | j d � } | r} | j | j j k rK d S| j | j j k r} | j d j d k r} d Sn | r� | j | j j k r� | j d j d k r� d S| j } | j � } | j t j
| j f k r | j | j k s
| j d j t j
k r t | � } n d | _ | j � } d | _ | d k r^| j � } d | _ n t j t j d � | g } | d k r�| j t � t j t j
d � | g � d
| d _ n t | | d | �S( Nt funct argst kwdsi s **i����t u *u **u t prefix( t symst gett typet star_exprt argumentt childrent valueR t cloneR t NAMEt atomt powert
DOUBLESTARR t NoneR t Leaft STARt extendR R ( t selft nodet resultsR R R R R t l_newargs( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyt transform s@
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyR s N( t __doc__R
R t pgen2R R t
fixer_utilR R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyt <module> s
fixes/fix_sys_exc.pyo 0000644 00000003271 15053244255 0010746 0 ustar 00 �
{ fc @ sg d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z m
Z
d e j f d � � YZ d S( s� Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
i ( t
fixer_base( t Attrt Callt Namet Numbert Subscriptt Nodet symst FixSysExcc B sC e Z d d d g Z e Z d d j d � e D� � Z d � Z RS( u exc_typeu exc_valueu
exc_tracebacksN
power< 'sys' trailer< dot='.' attribute=(%s) > >
t |c c s | ] } d | Vq d S( s '%s'N( ( t .0t e( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pys <genexpr> s c C s� | d d } t | j j | j � � } t t d � d | j �} t t d � | � } | d j | d j d _ | j t
| � � t t j
| d | j �S( Nt attributei u exc_infot prefixu syst doti ( R t exc_infot indext valueR R R
R t childrent appendR R R t power( t selft nodet resultst sys_attrR t callt attr( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyt transform s ( t __name__t
__module__R t Truet
BM_compatiblet joint PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyR s N(
t __doc__t R t
fixer_utilR R R R R R R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyt <module> s 4 fixes/fix_long.pyc 0000644 00000001527 15053244255 0010216 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s/ Fixer that turns 'long' into 'int' everywhere.
i����( t
fixer_base( t is_probably_builtint FixLongc B s e Z e Z d Z d � Z RS( s 'long'c C s& t | � r" d | _ | j � n d S( Nu int( R t valuet changed( t selft nodet results( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyt <module> s fixes/fix_asserts.pyo 0000644 00000003031 15053244255 0010747 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z e d d d d d d d
d d d
d d d d d d d d d d d d
d d d d d d � Z d e f d � � YZ d S( s5 Fixer that replaces deprecated unittest method names.i ( t BaseFix( t Namet assert_t
assertTruet assertEqualst assertEqualt assertNotEqualst assertNotEqualt assertAlmostEqualst assertAlmostEqualt assertNotAlmostEqualst assertNotAlmostEqualt assertRegexpMatchest assertRegext assertRaisesRegexpt assertRaisesRegext failUnlessEqualt failIfEqualt failUnlessAlmostEqualt failIfAlmostEqualt
failUnlesst failUnlessRaisest assertRaisest failIft assertFalset
FixAssertsc B s- e Z d d j e e e � � Z d � Z RS( sH
power< any+ trailer< '.' meth=(%s)> any* >
t |c C s8 | d d } | j t t t | � d | j �� d S( Nt methi t prefix( t replaceR t NAMESt strR ( t selft nodet resultst name( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyt transform s ( t __name__t
__module__t joint mapt reprR t PATTERNR$ ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyR s N( t __doc__t
fixer_baseR t
fixer_utilR t dictR R ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyt <module> s$ fixes/fix_input.pyo 0000644 00000002174 15053244255 0010431 0 ustar 00 �
{ fc @ sh d Z d d l m Z d d l m Z m Z d d l m Z e j d � Z d e j f d � � YZ
d S( s4 Fixer that changes input(...) into eval(input(...)).i ( t
fixer_base( t Callt Name( t patcomps& power< 'eval' trailer< '(' any ')' > >t FixInputc B s e Z e Z d Z d � Z RS( sL
power< 'input' args=trailer< '(' [any] ')' > >
c C sM t j | j j � r d S| j � } d | _ t t d � | g d | j �S( Nu u evalt prefix( t contextt matcht parentt cloneR R R ( t selft nodet resultst new( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyR
s N( t __doc__t R t
fixer_utilR R R t compile_patternR t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyt <module> s
fixes/fix_methodattrs.pyo 0000644 00000002200 15053244255 0011616 0 ustar 00 �
{ fc @ s^ d Z d d l m Z d d l m Z i d d 6d d 6d d 6Z d
e j f d � � YZ d S(
s; Fix bound method attributes (method.im_? -> method.__?__).
i ( t
fixer_base( t Namet __func__t im_funct __self__t im_selfs __self__.__class__t im_classt FixMethodattrsc B s e Z e Z d Z d � Z RS( sU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C sA | d d } t t | j � } | j t | d | j �� d S( Nt attri t prefix( t unicodet MAPt valuet replaceR R ( t selft nodet resultsR t new( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyt <module> s
fixes/fix_ne.pyo 0000644 00000001751 15053244255 0007674 0 ustar 00 �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s Fixer that turns <> into !=.i ( t pytree( t token( t
fixer_baset FixNec B s# e Z e j Z d � Z d � Z RS( c C s
| j d k S( Nu <>( t value( t selft node( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt match s c C s" t j t j d d | j �} | S( Nu !=t prefix( R t LeafR t NOTEQUALR ( R R t resultst new( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt transform s ( t __name__t
__module__R R
t _accept_typeR R
( ( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyR s N( t __doc__t R t pgen2R R t BaseFixR ( ( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt <module> s fixes/fix_itertools_imports.pyc 0000644 00000003756 15053244255 0013066 0 ustar 00 �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( sA Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) i����( t
fixer_base( t BlankLinet symst tokent FixItertoolsImportsc B s$ e Z e Z d e � Z d � Z RS( sT
import_from< 'from' 'itertools' 'import' imports=any >
c C s� | d } | j t j k s& | j r2 | g } n | j } x� | d d d � D]� } | j t j k ry | j } | } n; | j t j k r� d S| j t j k s� t � | j d } | j } | d k r� d | _ | j
� qO | d k rO | j � | d d
k r d n d | _ qO qO W| j p+| g } t } x= | D]5 } | rf| j t j
k rf| j
� q;| t N} q;Wx0 | r�| d
j t j
k r�| j � j
� qwW| j p�t | d d � s�| j d k r�| j }
t � } |
| _ | Sd S( Nt importsi i u imapu izipu ifilteru ifilterfalseu izip_longesti u fu filterfalseu zip_longesti����t value( u imapu izipu ifilter( u ifilterfalseu izip_longest( t typeR t import_as_namet childrenR t NAMER t STARt AssertionErrort Nonet removet changedt Truet COMMAt popt getattrt parentt prefixR ( t selft nodet resultsR R t childt membert name_nodet member_namet remove_commat p( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyt transform sD
( t __name__t
__module__R t
BM_compatiblet localst PATTERNR ( ( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyR s
N( t __doc__t lib2to3R t lib2to3.fixer_utilR R R t BaseFixR ( ( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyt <module> s fixes/fix_intern.pyc 0000644 00000003405 15053244255 0010553 0 ustar 00 �
{ fc @ s_ d Z d d l m Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s/ Fixer for intern().
intern(s) -> sys.intern(s)i ( t pytree( t
fixer_base( t Namet Attrt touch_importt FixInternc B s# e Z e Z d Z d Z d � Z RS( t pres�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C so | rd | d } | rd | j | j j k r/ d S| j | j j k ra | j d j d k ra d Sqd n | j } | d j � } | j | j k r� | j � } n t j | j | j � g � } | d } | r� g | D] } | j � ^ q� } n t j | j
t t d � t d � � t j | j
| d j � | | d j � g � g | � } | j | _ t d d | � | S( Nt obji s **t afteru sysu internt lpart rpar( t typet symst star_exprt argumentt childrent valuet clonet arglistR t Nodet powerR R t trailert prefixR t None( t selft nodet resultsR R t
newarglistR t nt new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyt transform s*
" U ( t __name__t
__module__t Truet
BM_compatiblet ordert PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyR s
N(
t __doc__t R R t
fixer_utilR R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyt <module> s fixes/fix_except.pyo 0000644 00000005701 15053244255 0010561 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z d � Z
d e j f d � � YZ d S(
s� Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
i ( t pytree( t token( t
fixer_base( t Assignt Attrt Namet is_tuplet is_listt symsc c sb x[ t | � D]M \ } } | j t j k r
| j d j d k rZ | | | d f VqZ q
q
Wd S( Ni u excepti ( t enumeratet typeR t
except_clauset childrent value( t nodest it n( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt find_excepts s t FixExceptc B s e Z e Z d Z d � Z RS( s1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C s, | j } g | d D] } | j � ^ q } g | d D] } | j � ^ q7 } x�t | � D]�\ } } t | j � d k r\ | j d d !\ }
} } | j t d d d �� | j t j k r�t | j
� d d �}
| j � } d | _ | j |
� |
j � }
| j } x0 t | � D]" \ } } t
| t j � r Pq q Wt | � s[t | � r|t | t |
t d � � � } n t | |
� } x( t | | � D] } | j d
| � q�W| j | | � q�| j d k r�d | _ q�q\ q\ Wg | j d D] } | j � ^ q�| | } t j | j | � S( Nt tailt cleanupi i u ast prefixu u u argsi i ( R t cloneR t lenR t replaceR R
R t NAMEt new_nameR R t
isinstanceR t NodeR R R R t reversedt insert_child( t selft nodet resultsR R R t cht try_cleanupR t e_suitet Et commat Nt new_Nt targett suite_stmtsR t stmtt assignt childt cR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt transform/ s6 ##
!.( t __name__t
__module__t Truet
BM_compatiblet PATTERNR/ ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyR $ s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt <module> s . fixes/fix_raise.pyo 0000644 00000004720 15053244255 0010374 0 ustar 00 �
{ fc @ s{ d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z d e j f d � � YZ
d S( s[ Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
i ( t pytree( t token( t
fixer_base( t Namet Callt Attrt ArgListt is_tuplet FixRaisec B s e Z e Z d Z d � Z RS( sB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c
C s | j } | d j � } | j t j k rE d } | j | | � d St | � r� x* t | � r} | j d j d j � } qT Wd | _ n d | k r� t j
| j t d � | g � } | j | _ | S| d j � } t | � rg | j d d !D] } | j � ^ q� } n d | _ | g } d
| k r�| d
j � }
d |
_ | } | j t j
k sm| j d k rt | | � } n t | t d � � t |
g � g } t j
| j t d � g | � } | j | _ | St j
| j t d � t | | � g d
| j �Sd S( Nt excs+ Python 3 does not support string exceptionsi i u t valu raisei����u t tbu Noneu with_tracebackt prefix( t symst clonet typeR t STRINGt cannot_convertR t childrenR R t Nodet
raise_stmtR t NAMEt valueR R R t simple_stmt(
t selft nodet resultsR
R t msgt newR
t ct argsR t et with_tb( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyt transform& s@ ! , !%" ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR! ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyR s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyt <module> s
( fixes/fix_xreadlines.pyo 0000644 00000002216 15053244255 0011425 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sp Fix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__).i ( t
fixer_base( t Namet
FixXreadlinesc B s e Z e Z d Z d � Z RS( s�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C sb | j d � } | r4 | j t d d | j �� n* | j g | d D] } | j � ^ qE � d S( Nt no_callu __iter__t prefixt call( t gett replaceR R t clone( t selft nodet resultsR t x( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR
( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyt <module> s fixes/fix_dict.pyc 0000644 00000007271 15053244255 0010204 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m
Z
m Z m Z m
Z
d d l m Z e j e d g � BZ d e j f d
� � YZ d S( sj Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
i ( t pytree( t patcomp( t token( t
fixer_base( t Namet Callt LParent RParent ArgListt Dot( t
fixer_utilt itert FixDictc B sP e Z e Z d Z d � Z d Z e j e � Z d Z
e j e
� Z d � Z RS( s
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c C s� | d } | d d } | d } | j } | j } | j d � } | j d � } | s^ | rk | d } n | d k s� t t | � � � g | D] }
|
j � ^ q� } g | D] }
|
j � ^ q� } | o� | j | | � } | t j | j t
� t | d | j �g � | d j � g } t j | j
| � }
| p?| srd
|
_ t t | r]d n d � |
g � }
n | r�t j | j
|
g | � }
n | j |
_ |
S( Nt headt methodi t tailu iteru viewi u keysu itemsu valuest prefixt parensu u list( u keysu itemsu values( t symst valuet
startswitht AssertionErrort reprt clonet in_special_contextR t Nodet trailerR R R t powerR ( t selft nodet resultsR
R R R t method_namet isitert isviewt nt specialt argst new( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyt transform7 s4
' s3 power< func=NAME trailer< '(' node=any ')' > any* >sm for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� | j d k r t Si } | j j d k r� | j j | j j | � r� | d | k r� | rm | d j t k S| d j t j k Sn | s� t S| j j | j | � o� | d | k S( NR t func(
t parentt Nonet Falset p1t matchR t iter_exemptR
t consuming_callst p2( R R R R ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyR [ s (
t __name__t
__module__t Truet
BM_compatiblet PATTERNR& t P1R t compile_patternR+ t P2R/ R ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyR * s
N( t __doc__t R R t pgen2R R R
R R R R R R R. t setR- t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyt <module> s . fixes/fix_raise.pyc 0000644 00000004720 15053244255 0010360 0 ustar 00 �
{ fc @ s{ d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z d e j f d � � YZ
d S( s[ Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
i ( t pytree( t token( t
fixer_base( t Namet Callt Attrt ArgListt is_tuplet FixRaisec B s e Z e Z d Z d � Z RS( sB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c
C s | j } | d j � } | j t j k rE d } | j | | � d St | � r� x* t | � r} | j d j d j � } qT Wd | _ n d | k r� t j
| j t d � | g � } | j | _ | S| d j � } t | � rg | j d d !D] } | j � ^ q� } n d | _ | g } d
| k r�| d
j � }
d |
_ | } | j t j
k sm| j d k rt | | � } n t | t d � � t |
g � g } t j
| j t d � g | � } | j | _ | St j
| j t d � t | | � g d
| j �Sd S( Nt excs+ Python 3 does not support string exceptionsi i u t valu raisei����u t tbu Noneu with_tracebackt prefix( t symst clonet typeR t STRINGt cannot_convertR t childrenR R t Nodet
raise_stmtR t NAMEt valueR R R t simple_stmt(
t selft nodet resultsR
R t msgt newR
t ct argsR t et with_tb( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyt transform& s@ ! , !%" ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR! ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyR s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyt <module> s
( fixes/fix_numliterals.pyo 0000644 00000002361 15053244255 0011627 0 ustar 00 �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s- Fixer that turns 1L into 1, 0755 into 0o755.
i ( t token( t
fixer_base( t Numbert FixNumliteralsc B s# e Z e j Z d � Z d � Z RS( c C s# | j j d � p" | j d d k S( Nu 0i����u Ll( t valuet
startswith( t selft node( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt match s c C s} | j } | d d k r& | d } nD | j d � rj | j � rj t t | � � d k rj d | d } n t | d | j �S( Ni����u Llu 0i u 0ot prefix( R R t isdigitt lent setR R ( R R t resultst val( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt transform s
3( t __name__t
__module__R t NUMBERt _accept_typeR R ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyR s N( t __doc__t pgen2R t R t
fixer_utilR t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt <module> s fixes/fix_repr.pyc 0000644 00000002006 15053244255 0010220 0 ustar 00 �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s/ Fixer that transforms `xyzzy` into repr(xyzzy).i ( t
fixer_base( t Callt Namet parenthesizet FixReprc B s e Z e Z d Z d � Z RS( s7
atom < '`' expr=any '`' >
c C sS | d j � } | j | j j k r4 t | � } n t t d � | g d | j �S( Nt expru reprt prefix( t clonet typet symst testlist1R R R R ( t selft nodet resultsR ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyR s N( t __doc__t R t
fixer_utilR R R t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyt <module> s fixes/fix_future.pyc 0000644 00000001645 15053244255 0010572 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sV Remove __future__ imports
from __future__ import foo is replaced with an empty line.
i ( t
fixer_base( t BlankLinet FixFuturec B s# e Z e Z d Z d Z d � Z RS( s; import_from< 'from' module_name="__future__" 'import' any >i
c C s t � } | j | _ | S( N( R t prefix( t selft nodet resultst new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNt run_orderR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyt <module> s fixes/fix_zip.pyc 0000644 00000002520 15053244255 0010053 0 ustar 00 �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s7
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
i ( t
fixer_base( t Namet Callt in_special_contextt FixZipc B s# e Z e Z d Z d Z d � Z RS( s:
power< 'zip' args=trailer< '(' [any] ')' >
>
s future_builtins.zipc C s` | j | � r d St | � r# d S| j � } d | _ t t d � | g � } | j | _ | S( Nu u list( t should_skipR t Nonet clonet prefixR R ( t selft nodet resultst new( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR
( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyR s N( t __doc__t R t
fixer_utilR R R t ConditionalFixR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyt <module> s fixes/fix_nonzero.pyc 0000644 00000002114 15053244255 0010742 0 ustar 00 �
{ fc @ sI d Z d d l m Z d d l m Z m Z d e j f d � � YZ d S( s* Fixer for __nonzero__ -> __bool__ methods.i ( t
fixer_base( t Namet symst
FixNonzeroc B s e Z e Z d Z d � Z RS( s�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s0 | d } t d d | j �} | j | � d S( Nt nameu __bool__t prefix( R R t replace( t selft nodet resultsR t new( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyt <module> s fixes/fix_metaclass.pyc 0000644 00000014715 15053244255 0011236 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d � Z
d � Z d � Z d � Z
d � Z d
� Z d e j f d � � YZ d
S( s� Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherints
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
i ( t
fixer_base( t token( t Namet symst Nodet Leafc C s� x� | j D]� } | j t j k r, t | � S| j t j k r
| j r
| j d } | j t j k r� | j r� | j d } t | t � r� | j d k r� t
Sq� q
q
Wt S( s� we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
i t
__metaclass__( t childrent typeR t suitet
has_metaclasst simple_stmtt expr_stmtt
isinstanceR t valuet Truet False( t parentt nodet expr_nodet left_side( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyR
s
c C s� x' | j D] } | j t j k r
d Sq
Wx? t | j � D]" \ } } | j t j k r: Pq: q: Wt d � � t t j g � } xC | j | d r� | j | d } | j | j
� � | j � q� W| j | � | } d S( sf one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
Ns No class suite and no ':'!i ( R R R R t enumerateR t COLONt
ValueErrorR t append_childt clonet remove( t cls_nodeR t iR t move_node( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_parse_tree- s
c
C s� x7 t | j � D]" \ } } | j t j k r Pq q Wd S| j � t t j g � } t t j | g � } x; | j | r� | j | } | j
| j � � | j � qn W| j | | � | j d j d } | j d j d } | j
| _
d S( s� if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
Ni ( R R R R t SEMIR R R R R R R t insert_childt prefix(
R R t stmt_nodet semi_indR t new_exprt new_stmtR t new_leaf1t old_leaf1( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_simple_stmtG s
c C s: | j r6 | j d j t j k r6 | j d j � n d S( Ni����( R R R t NEWLINER ( R ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt remove_trailing_newline_ s "c c s� x3 | j D] } | j t j k r
Pq
q
Wt d � � x� t t | j � � D]� \ } } | j t j k rL | j rL | j d } | j t j k r� | j r� | j d } t | t
� r� | j d k r� t | | | � t
| � | | | f Vq� q� qL qL Wd S( Ns No class suite!i u
__metaclass__( R R R R R t listR R R R
R R R( R* ( R R R t simple_nodeR t left_node( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt
find_metasd s "
c C s� | j d d d � } x, | rD | j � } | j t j k r Pq q Wxm | r� | j � } t | t � r� | j t j k r� | j r� d | _ n d S| j | j d d d � � qH Wd S( s� If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
Ni����u (
R t popR R t INDENTR
R t DEDENTR! t extend( R t kidsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_indent{ s ! t FixMetaclassc B s e Z e Z d Z d � Z RS( s
classdef<any*>
c C s' t | � s d St | � d } x- t | � D] \ } } } | } | j � q- W| j d j } t | j � d k r� | j d j t j k r� | j d } q�| j d j
� } t t j | g � } | j d | � n� t | j � d k rt t j g � } | j
d | � n~ t | j � d k r�t t j g � } | j
d t t j d � � | j
d | � | j
d t t j d � � n t d � � | j d j d }
d
|
_ |
j } | j r�| j t t j d � � d |
_ n d
|
_ | j d } | j t j k st � d
| j d _ d
| j d _ | j | � t | � | j s�| j � t | d � }
| |
_ | j |
� | j t t j d � � n� t | j � d k r#| j d j t j k r#| j d j t j k r#t | d � }
| j
d |
� | j
d t t j d � � n d S( Ni i i i i i u )u (s Unexpected class definitiont metaclassu ,u u i u passu
i����i����( R
R t NoneR. R R R t lenR t arglistR R t set_childR R R t RPARt LPARR R R! R t COMMAR t AssertionErrorR4 R) R0 R1 ( t selfR t resultst last_metaclassR R t stmtt text_typeR9 R t meta_txtt orig_meta_prefixR t pass_leaf( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt transform� s`
( t __name__t
__module__R t
BM_compatiblet PATTERNRG ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyR5 � s N( t __doc__t R t pygramR t
fixer_utilR R R R R
R R( R* R. R4 t BaseFixR5 ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt <module> s " fixes/fix_isinstance.pyc 0000644 00000003474 15053244255 0011422 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s, Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
i ( t
fixer_base( t tokent
FixIsinstancec B s# e Z e Z d Z d Z d � Z RS( s�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
i c C sU t � } | d } | j } g } t | � } x� | D]� \ } } | j t j k r� | j | k r� | t | � d k r� | | d j t j k r� | j � q5 q� q5 | j
| � | j t j k r5 | j | j � q5 q5 W| r| d j t j k r| d =n t | � d k r@| j }
|
j
| d _
|
j | d � n | | (| j � d S( Nt argsi i����i ( t sett childrent enumeratet typeR t NAMEt valuet lent COMMAt nextt appendt addt parentt prefixt replacet changed( t selft nodet resultst names_insertedt testlistR t new_argst iteratort idxt argt atom( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyt transform s*
!0
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt run_orderR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyt <module>
s fixes/fix_imports2.pyo 0000644 00000001172 15053244255 0011046 0 ustar 00 �
{ fc @ sG d Z d d l m Z i d d 6d d 6Z d e j f d � � YZ d S( sT Fix incompatible imports and module references that must be fixed after
fix_imports.i ( t fix_importst dbmt whichdbt anydbmt FixImports2c B s e Z d Z e Z RS( i ( t __name__t
__module__t run_ordert MAPPINGt mapping( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_imports2.pyR s N( t __doc__t R R t
FixImportsR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_imports2.pyt <module> s
fixes/fix_exec.pyo 0000644 00000002567 15053244255 0010224 0 ustar 00 �
{ fc @ s_ d Z d d l m Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s� Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
i ( t pytree( t
fixer_base( t Commat Namet Callt FixExecc B s e Z e Z d Z d � Z RS( sx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� | j } | d } | j d � } | j d � } | j � g } d | d _ | d k rx | j t � | j � g � n | d k r� | j t � | j � g � n t t d � | d | j �S( Nt at bt ct i u exect prefix( t symst gett cloneR
t Nonet extendR R R ( t selft nodet resultsR R R R t args( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyR s N(
t __doc__R R R t
fixer_utilR R R t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyt <module>
s fixes/fix_next.pyo 0000644 00000006702 15053244255 0010251 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m
Z
m Z d Z d e j
f d � � YZ d � Z d
� Z d � Z d S(
s. Fixer for it.next() -> next(it), per PEP 3114.i ( t token( t python_symbols( t
fixer_base( t Namet Callt find_bindings; Calls to builtin next() possibly shadowed by global bindingt FixNextc B s, e Z e Z d Z d Z d � Z d � Z RS( s�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
t prec C sW t t | � j | | � t d | � } | rJ | j | t � t | _ n t | _ d S( Nu next( t superR t
start_treeR t warningt bind_warningt Truet
shadowed_nextt False( t selft treet filenamet n( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR $ s c C s� | j d � } | j d � } | j d � } | r� | j r[ | j t d d | j �� qg | D] } | j � ^ qb } d | d _ | j t t d d | j �| � � n� | r� t d d | j �} | j | � n� | rWt | � rA| d } d
j g | D] } t | � ^ q� j
� d k r=| j | t � n d S| j t d � � n( d | k r| j | t � t
| _ n d S(
Nt baset attrt nameu __next__t prefixu i u nextt headt u __builtin__t global( t getR
t replaceR R t cloneR t is_assign_targett joint strt stripR
R R ( R t nodet resultsR R R R R ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyt transform. s,
(
4 ( t __name__t
__module__R t
BM_compatiblet PATTERNt orderR R# ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR s
c C s] t | � } | d k r t Sx: | j D]/ } | j t j k rB t St | | � r& t Sq& Wt S( N( t find_assignt NoneR t childrent typeR t EQUALt
is_subtreeR ( R! t assignt child( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR Q s c C sH | j t j k r | S| j t j k s7 | j d k r; d St | j � S( N( R, t symst expr_stmtt simple_stmtt parentR* R) ( R! ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR) ] s
!c s- | � k r t St � f d � | j D� � S( Nc 3 s | ] } t | � � Vq d S( N( R. ( t .0t c( R! ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pys <genexpr>g s ( R t anyR+ ( t rootR! ( ( R! s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR. d s N( t __doc__t pgen2R t pygramR R1 R R t
fixer_utilR R R R t BaseFixR R R) R. ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyt <module> s @ fixes/fix_itertools.pyc 0000644 00000003415 15053244255 0011301 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sT Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
i ( t
fixer_base( t Namet FixItertoolsc B s0 e Z e Z d Z d e � Z d Z d � Z RS( s7 ('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')s�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
i c C s� d } | d d } d | k rt | j d k rt | d | d } } | j } | j � | j � | j j | � n | p� | j } | j t | j d d | �� d S(
Nt funci t itu ifilterfalseu izip_longestt doti t prefix( u ifilterfalseu izip_longest( t Nonet valueR t removet parentt replaceR ( t selft nodet resultsR R R R ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet it_funcst localst PATTERNt run_orderR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyR s
N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyt <module> s fixes/fix_nonzero.pyo 0000644 00000002114 15053244255 0010756 0 ustar 00 �
{ fc @ sI d Z d d l m Z d d l m Z m Z d e j f d � � YZ d S( s* Fixer for __nonzero__ -> __bool__ methods.i ( t
fixer_base( t Namet symst
FixNonzeroc B s e Z e Z d Z d � Z RS( s�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s0 | d } t d d | j �} | j | � d S( Nt nameu __bool__t prefix( R R t replace( t selft nodet resultsR t new( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyt <module> s fixes/fix_ws_comma.pyc 0000644 00000002564 15053244255 0011066 0 ustar 00 �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s� Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
i ( t pytree( t token( t
fixer_baset
FixWsCommac B sS e Z e Z d Z e j e j d � Z e j e j d � Z e e f Z
d � Z RS( sH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
u ,u :c C s� | j � } t } x� | j D]u } | | j k rg | j } | j � r^ d | k r^ d | _ n t } q | r� | j } | s� d | _ q� n t } q W| S( Nu
u u ( t clonet Falset childrent SEPSt prefixt isspacet True( t selft nodet resultst newt commat childR ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyt transform s
( t __name__t
__module__R
t explicitt PATTERNR t LeafR t COMMAt COLONR R ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyR s N( t __doc__t R t pgen2R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyt <module> s fixes/fix_raw_input.pyo 0000644 00000001666 15053244255 0011307 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s2 Fixer that changes raw_input(...) into input(...).i ( t
fixer_base( t Namet FixRawInputc B s e Z e Z d Z d � Z RS( sU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu inputt prefix( t replaceR R ( t selft nodet resultsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyt <module> s fixes/fix_funcattrs.pyo 0000644 00000002150 15053244255 0011275 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s3 Fix function attribute names (f.func_x -> f.__x__).i ( t
fixer_base( t Namet FixFuncattrsc B s e Z e Z d Z d � Z RS( s�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s9 | d d } | j t d | j d d | j �� d S( Nt attri u __%s__i t prefix( t replaceR t valueR ( t selft nodet resultsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR
( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyt <module> s fixes/fix_unicode.pyo 0000644 00000003304 15053244255 0010714 0 ustar 00 �
{ fc @ sW d Z d d l m Z d d l m Z i d d 6d d 6Z d e j f d � � YZ d
S( s� Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
i ( t token( t
fixer_baseu chru unichru stru unicodet
FixUnicodec B s& e Z e Z d Z d � Z d � Z RS( s STRING | 'unicode' | 'unichr'c C s/ t t | � j | | � d | j k | _ d S( Nt unicode_literals( t superR t
start_treet future_featuresR ( t selft treet filename( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyR s c C s | j t j k r2 | j � } t | j | _ | S| j t j k r| j } | j r� | d d k r� d | k r� d j g | j d � D]$ } | j
d d � j
d d � ^ q� � } n | d d k r� | d
} n | | j k r� | S| j � } | | _ | Sd S( Ni u '"u \u \\u \uu \\uu \Uu \\Uu uUi ( t typeR t NAMEt clonet _mappingt valuet STRINGR t joint splitt replace( R t nodet resultst newt valt v( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyt transform s" &=
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR R ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyR s N( t __doc__t pgen2R t R R
t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyt <module> s fixes/fix_types.pyc 0000644 00000004242 15053244255 0010420 0 ustar 00 �
{ fc @ s d Z d d l m Z d d l m Z d d l m Z i d d 6d d 6d d
6d d 6d
d 6d
d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d! d" 6d# d$ 6d% d& 6d d' 6d( d) 6d* d+ 6Z g e D] Z d, e ^ q� Z d- e j
f d. � � YZ d/ S(0 s� Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
i ( t token( t
fixer_base( t Namet boolt BooleanTypet
memoryviewt
BufferTypet typet ClassTypet complext ComplexTypet dictt DictTypet DictionaryTypes type(Ellipsis)t EllipsisTypet floatt FloatTypet intt IntTypet listt ListTypet LongTypet objectt
ObjectTypes
type(None)t NoneTypes type(NotImplemented)t NotImplementedTypet slicet SliceTypet bytest
StringTypes (str,)t StringTypest tuplet TupleTypet TypeTypet strt UnicodeTypet ranget
XRangeTypes) power< 'types' trailer< '.' name='%s' > >t FixTypesc B s& e Z e Z d j e � Z d � Z RS( t |c C s9 t t j | d j � � } | r5 t | d | j �Sd S( Nt namet prefix( t unicodet
_TYPE_MAPPINGt gett valueR R) t None( t selft nodet resultst new_value( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyt transform: s ( t __name__t
__module__t Truet
BM_compatiblet joint _patst PATTERNR3 ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyR& 6 s N( t __doc__t pgen2R t R t
fixer_utilR R+ t tR9 t BaseFixR& ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyt <module> s6
fixes/fix_metaclass.pyo 0000644 00000014633 15053244255 0011251 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d � Z
d � Z d � Z d � Z
d � Z d
� Z d e j f d � � YZ d
S( s� Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherints
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
i ( t
fixer_base( t token( t Namet symst Nodet Leafc C s� x� | j D]� } | j t j k r, t | � S| j t j k r
| j r
| j d } | j t j k r� | j r� | j d } t | t � r� | j d k r� t
Sq� q
q
Wt S( s� we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
i t
__metaclass__( t childrent typeR t suitet
has_metaclasst simple_stmtt expr_stmtt
isinstanceR t valuet Truet False( t parentt nodet expr_nodet left_side( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyR
s
c C s� x' | j D] } | j t j k r
d Sq
Wx? t | j � D]" \ } } | j t j k r: Pq: q: Wt d � � t t j g � } xC | j | d r� | j | d } | j | j
� � | j � q� W| j | � | } d S( sf one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
Ns No class suite and no ':'!i ( R R R R t enumerateR t COLONt
ValueErrorR t append_childt clonet remove( t cls_nodeR t iR t move_node( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_parse_tree- s
c
C s� x7 t | j � D]" \ } } | j t j k r Pq q Wd S| j � t t j g � } t t j | g � } x; | j | r� | j | } | j
| j � � | j � qn W| j | | � | j d j d } | j d j d } | j
| _
d S( s� if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
Ni ( R R R R t SEMIR R R R R R R t insert_childt prefix(
R R t stmt_nodet semi_indR t new_exprt new_stmtR t new_leaf1t old_leaf1( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_simple_stmtG s
c C s: | j r6 | j d j t j k r6 | j d j � n d S( Ni����( R R R t NEWLINER ( R ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt remove_trailing_newline_ s "c c s� x3 | j D] } | j t j k r
Pq
q
Wt d � � x� t t | j � � D]� \ } } | j t j k rL | j rL | j d } | j t j k r� | j r� | j d } t | t
� r� | j d k r� t | | | � t
| � | | | f Vq� q� qL qL Wd S( Ns No class suite!i u
__metaclass__( R R R R R t listR R R R
R R R( R* ( R R R t simple_nodeR t left_node( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt
find_metasd s "
c C s� | j d d d � } x, | rD | j � } | j t j k r Pq q Wxm | r� | j � } t | t � r� | j t j k r� | j r� d | _ n d S| j | j d d d � � qH Wd S( s� If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
Ni����u (
R t popR R t INDENTR
R t DEDENTR! t extend( R t kidsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_indent{ s ! t FixMetaclassc B s e Z e Z d Z d � Z RS( s
classdef<any*>
c C s t | � s d St | � d } x- t | � D] \ } } } | } | j � q- W| j d j } t | j � d k r� | j d j t j k r� | j d } q�| j d j
� } t t j | g � } | j d | � n� t | j � d k rt t j g � } | j
d | � n~ t | j � d k r�t t j g � } | j
d t t j d � � | j
d | � | j
d t t j d � � n t d � � | j d j d }
d
|
_ |
j } | j r�| j t t j d � � d |
_ n d
|
_ | j d } d
| j d _ d
| j d _ | j | � t | � | j s�| j � t | d � }
| |
_ | j |
� | j t t j d � � n� t | j � d k r | j d j t j k r | j d j t j k r t | d � }
| j
d |
� | j
d t t j d � � n d S( Ni i i i i i u )u (s Unexpected class definitiont metaclassu ,u u i u passu
i����i����( R
R t NoneR. R R R t lenR t arglistR R t set_childR R R t RPARt LPARR R R! R t COMMAR4 R) R0 R1 ( t selfR t resultst last_metaclassR R t stmtt text_typeR9 R t meta_txtt orig_meta_prefixR t pass_leaf( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt transform� s^
( t __name__t
__module__R t
BM_compatiblet PATTERNRF ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyR5 � s N( t __doc__t R t pygramR t
fixer_utilR R R R R
R R( R* R. R4 t BaseFixR5 ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt <module> s " fixes/fix_zip.pyo 0000644 00000002520 15053244255 0010067 0 ustar 00 �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s7
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
i ( t
fixer_base( t Namet Callt in_special_contextt FixZipc B s# e Z e Z d Z d Z d � Z RS( s:
power< 'zip' args=trailer< '(' [any] ')' >
>
s future_builtins.zipc C s` | j | � r d St | � r# d S| j � } d | _ t t d � | g � } | j | _ | S( Nu u list( t should_skipR t Nonet clonet prefixR R ( t selft nodet resultst new( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR
( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyR s N( t __doc__t R t
fixer_utilR R R t ConditionalFixR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyt <module> s fixes/fix_basestring.pyo 0000644 00000001447 15053244255 0011435 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s Fixer for basestring -> str.i ( t
fixer_base( t Namet
FixBasestringc B s e Z e Z d Z d � Z RS( s 'basestring'c C s t d d | j �S( Nu strt prefix( R R ( t selft nodet results( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyt transform
s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyt <module> s fixes/fix_itertools_imports.pyo 0000644 00000003701 15053244255 0013070 0 ustar 00 �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( sA Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) i����( t
fixer_base( t BlankLinet symst tokent FixItertoolsImportsc B s$ e Z e Z d e � Z d � Z RS( sT
import_from< 'from' 'itertools' 'import' imports=any >
c C s� | d } | j t j k s& | j r2 | g } n | j } x� | d d d � D]� } | j t j k ry | j } | } n# | j t j k r� d S| j d } | j } | d k r� d | _ | j � qO | d k rO | j
� | d d
k r� d n d | _ qO qO W| j p| g } t } x= | D]5 } | rN| j t j k rN| j � q#| t N} q#Wx0 | r�| d
j t j k r�| j
� j � q_W| j p�t | d d � s�| j d k r�| j }
t � } |
| _ | Sd S( Nt importsi i u imapu izipu ifilteru ifilterfalseu izip_longesti u fu filterfalseu zip_longesti����t value( u imapu izipu ifilter( u ifilterfalseu izip_longest( t typeR t import_as_namet childrenR t NAMER t STARt Nonet removet changedt Truet COMMAt popt getattrt parentt prefixR ( t selft nodet resultsR R t childt membert name_nodet member_namet remove_commat p( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyt transform sB
( t __name__t
__module__R t
BM_compatiblet localst PATTERNR ( ( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyR s
N( t __doc__t lib2to3R t lib2to3.fixer_utilR R R t BaseFixR ( ( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyt <module> s fixes/fix_intern.pyo 0000644 00000003405 15053244255 0010567 0 ustar 00 �
{ fc @ s_ d Z d d l m Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s/ Fixer for intern().
intern(s) -> sys.intern(s)i ( t pytree( t
fixer_base( t Namet Attrt touch_importt FixInternc B s# e Z e Z d Z d Z d � Z RS( t pres�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C so | rd | d } | rd | j | j j k r/ d S| j | j j k ra | j d j d k ra d Sqd n | j } | d j � } | j | j k r� | j � } n t j | j | j � g � } | d } | r� g | D] } | j � ^ q� } n t j | j
t t d � t d � � t j | j
| d j � | | d j � g � g | � } | j | _ t d d | � | S( Nt obji s **t afteru sysu internt lpart rpar( t typet symst star_exprt argumentt childrent valuet clonet arglistR t Nodet powerR R t trailert prefixR t None( t selft nodet resultsR R t
newarglistR t nt new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyt transform s*
" U ( t __name__t
__module__t Truet
BM_compatiblet ordert PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyR s
N(
t __doc__t R R t
fixer_utilR R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyt <module> s fixes/fix_ws_comma.pyo 0000644 00000002564 15053244255 0011102 0 ustar 00 �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s� Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
i ( t pytree( t token( t
fixer_baset
FixWsCommac B sS e Z e Z d Z e j e j d � Z e j e j d � Z e e f Z
d � Z RS( sH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
u ,u :c C s� | j � } t } x� | j D]u } | | j k rg | j } | j � r^ d | k r^ d | _ n t } q | r� | j } | s� d | _ q� n t } q W| S( Nu
u u ( t clonet Falset childrent SEPSt prefixt isspacet True( t selft nodet resultst newt commat childR ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyt transform s
( t __name__t
__module__R
t explicitt PATTERNR t LeafR t COMMAt COLONR R ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyR s N( t __doc__t R t pgen2R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyt <module> s fixes/__init__.pyo 0000644 00000000205 15053244255 0010154 0 ustar 00 �
{ fc @ s d S( N( ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/__init__.pyt <module> t fixes/fix_import.pyo 0000644 00000006265 15053244255 0010611 0 ustar 00 �
{ fc @ sz d Z d d l m Z d d l m Z m Z m Z m Z d d l m Z m
Z
m Z d � Z d e j
f d � � YZ d S(
s� Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
i ( t
fixer_basei����( t dirnamet joint existst sep( t
FromImportt symst tokenc c s� | g } x� | r� | j � } | j t j k r; | j Vq | j t j k rw d j g | j D] } | j ^ q] � Vq | j t j k r� | j
| j d � q | j t j k r� | j | j d d d � � q t
d � � q Wd S( sF
Walks over all the names imported in a dotted_as_names node.
t i Ni����s unknown node type( t popt typeR t NAMEt valueR t dotted_nameR t childrent dotted_as_namet appendt dotted_as_namest extendt AssertionError( t namest pendingt nodet ch( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt traverse_imports s * t FixImportc B s/ e Z e Z d Z d � Z d � Z d � Z RS( sj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c C s/ t t | � j | | � d | j k | _ d S( Nt absolute_import( t superR t
start_treet future_featurest skip( t selft treet name( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR / s c C s | j r
d S| d } | j t j k r~ x t | d � sK | j d } q, W| j | j � rd | j | _ | j � qn� t } t } x2 t
| � D]$ } | j | � r� t } q� t } q� W| r� | r� | j | d � n d St
d | g � } | j | _ | Sd S( Nt impR i u .s# absolute and local imports together( R R
R t import_fromt hasattrR t probably_a_local_importR t changedt FalseR t Truet warningR t prefix( R R t resultsR" t
have_localt
have_absolutet mod_namet new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt transform3 s,
c C s� | j d � r t S| j d d � d } t | j � } t | | � } t t t | � d � � sf t Sx4 d t d d d d g D] } t | | � r t Sq Wt S(
Nu .i i s __init__.pys .pys .pycs .sos .sls .pyd( t
startswithR' t splitR t filenameR R R R( ( R t imp_namet base_patht ext( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR% U s ( t __name__t
__module__R( t
BM_compatiblet PATTERNR R0 R% ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR & s
"N( t __doc__R R t os.pathR R R R t
fixer_utilR R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt <module> s
" fixes/fix_next.pyc 0000644 00000006743 15053244255 0010242 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m
Z
m Z d Z d e j
f d � � YZ d � Z d
� Z d � Z d S(
s. Fixer for it.next() -> next(it), per PEP 3114.i ( t token( t python_symbols( t
fixer_base( t Namet Callt find_bindings; Calls to builtin next() possibly shadowed by global bindingt FixNextc B s, e Z e Z d Z d Z d � Z d � Z RS( s�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
t prec C sW t t | � j | | � t d | � } | rJ | j | t � t | _ n t | _ d S( Nu next( t superR t
start_treeR t warningt bind_warningt Truet
shadowed_nextt False( t selft treet filenamet n( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR $ s c C s� | s t � | j d � } | j d � } | j d � } | r� | j rg | j t d d | j �� q�g | D] } | j � ^ qn } d | d _ | j t t d d | j �| � � n� | r� t d d | j �} | j | � n� | rct | � rM| d } d
j g | D] } t
| � ^ q� j � d k rI| j | t
� n d S| j t d � � n( d | k r�| j | t
� t | _ n d S(
Nt baset attrt nameu __next__t prefixu i u nextt headt u __builtin__t global( t AssertionErrort getR
t replaceR R t cloneR t is_assign_targett joint strt stripR
R R ( R t nodet resultsR R R R R ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyt transform. s.
(
4 ( t __name__t
__module__R t
BM_compatiblet PATTERNt orderR R$ ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR s
c C s] t | � } | d k r t Sx: | j D]/ } | j t j k rB t St | | � r& t Sq& Wt S( N( t find_assignt NoneR t childrent typeR t EQUALt
is_subtreeR ( R" t assignt child( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR Q s c C sH | j t j k r | S| j t j k s7 | j d k r; d St | j � S( N( R- t symst expr_stmtt simple_stmtt parentR+ R* ( R" ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR* ] s
!c s- | � k r t St � f d � | j D� � S( Nc 3 s | ] } t | � � Vq d S( N( R/ ( t .0t c( R" ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pys <genexpr>g s ( R t anyR, ( t rootR" ( ( R" s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR/ d s N( t __doc__t pgen2R t pygramR R2 R R t
fixer_utilR R R R t BaseFixR R R* R/ ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyt <module> s @ fixes/fix_numliterals.pyc 0000644 00000002361 15053244255 0011613 0 ustar 00 �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s- Fixer that turns 1L into 1, 0755 into 0o755.
i ( t token( t
fixer_base( t Numbert FixNumliteralsc B s# e Z e j Z d � Z d � Z RS( c C s# | j j d � p" | j d d k S( Nu 0i����u Ll( t valuet
startswith( t selft node( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt match s c C s} | j } | d d k r& | d } nD | j d � rj | j � rj t t | � � d k rj d | d } n t | d | j �S( Ni����u Llu 0i u 0ot prefix( R R t isdigitt lent setR R ( R R t resultst val( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt transform s
3( t __name__t
__module__R t NUMBERt _accept_typeR R ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyR s N( t __doc__t pgen2R t R t
fixer_utilR t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt <module> s fixes/fix_has_key.pyo 0000644 00000006135 15053244255 0010716 0 ustar 00 �
{ fc @ si d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z d e j f d � � YZ
d S( s& Fixer for has_key().
Calls to .has_key() methods are expressed in terms of the 'in'
operator:
d.has_key(k) -> k in d
CAVEATS:
1) While the primary target of this fixer is dict.has_key(), the
fixer will change any has_key() method call, regardless of its
class.
2) Cases like this will not be converted:
m = d.has_key
if m(k):
...
Only *calls* to has_key() are converted. While it is possible to
convert the above to something like
m = d.__contains__
if m(k):
...
this is currently not done.
i ( t pytree( t token( t
fixer_base( t Namet parenthesizet FixHasKeyc B s e Z e Z d Z d � Z RS( s�
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
c
C sI | j } | j j | j k r7 | j j | j � r7 d S| j d � } | d } | j } g | d D] } | j � ^ qd } | d j � } | j d � }
|
r� g |
D] } | j � ^ q� }
n | j | j
| j | j | j | j
| j | j f k r t | � } n t | � d k r*| d } n t j | j | � } d | _ t d d
d �} | r�t d d
d �} t j | j | | f � } n t j | j
| | | f � }
|
r�t |
� }
t j | j |
f t |
� � }
n | j j | j
| j | j | j | j | j | j | j | j f k r<t |
� }
n | |
_ |
S( Nt negationt anchort beforet argt afteri i u u int prefixu not( t symst parentt typet not_testt patternt matcht Nonet getR t clonet
comparisont and_testt or_testt testt lambdeft argumentR t lenR t Nodet powerR t comp_opt tuplet exprt xor_exprt and_exprt
shift_exprt
arith_exprt termt factor( t selft nodet resultsR R R R t nR R R
t n_opt n_nott new( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyt transformH sD
#"!
% ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR. ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyR ' s N( t __doc__t R t pgen2R R t
fixer_utilR R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyt <module> s
fixes/fix_buffer.pyc 0000644 00000001704 15053244255 0010525 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s4 Fixer that changes buffer(...) into memoryview(...).i ( t
fixer_base( t Namet FixBufferc B s# e Z e Z e Z d Z d � Z RS( sR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu
memoryviewt prefix( t replaceR R ( t selft nodet resultsR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet explicitt PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyt <module> s fixes/fix_reduce.pyc 0000644 00000002374 15053244255 0010527 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sq Fixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
i����( t
fixer_base( t touch_importt FixReducec B s# e Z e Z d Z d Z d � Z RS( t presi
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t d d | � d S( Nu functoolsu reduce( R ( t selft nodet results( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyt transform" s ( t __name__t
__module__t Truet
BM_compatiblet ordert PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyt <module> s fixes/fix_asserts.pyc 0000644 00000003031 15053244255 0010733 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z e d d d d d d d
d d d
d d d d d d d d d d d d
d d d d d d � Z d e f d � � YZ d S( s5 Fixer that replaces deprecated unittest method names.i ( t BaseFix( t Namet assert_t
assertTruet assertEqualst assertEqualt assertNotEqualst assertNotEqualt assertAlmostEqualst assertAlmostEqualt assertNotAlmostEqualst assertNotAlmostEqualt assertRegexpMatchest assertRegext assertRaisesRegexpt assertRaisesRegext failUnlessEqualt failIfEqualt failUnlessAlmostEqualt failIfAlmostEqualt
failUnlesst failUnlessRaisest assertRaisest failIft assertFalset
FixAssertsc B s- e Z d d j e e e � � Z d � Z RS( sH
power< any+ trailer< '.' meth=(%s)> any* >
t |c C s8 | d d } | j t t t | � d | j �� d S( Nt methi t prefix( t replaceR t NAMESt strR ( t selft nodet resultst name( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyt transform s ( t __name__t
__module__t joint mapt reprR t PATTERNR$ ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyR s N( t __doc__t
fixer_baseR t
fixer_utilR t dictR R ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyt <module> s$ fixes/fix_tuple_params.pyo 0000644 00000012522 15053244255 0011764 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z d � Z
d e j f d � � YZ d � Z d
� Z g d
d � Z d � Z d
S( s: Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
i ( t pytree( t token( t
fixer_base( t Assignt Namet Newlinet Numbert Subscriptt symsc C s) t | t j � o( | j d j t j k S( Ni ( t
isinstanceR t Nodet childrent typeR t STRING( t stmt( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt is_docstring s t FixTupleParamsc B s, e Z d Z e Z d Z d � Z d � Z RS( i s
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s0 d | k r � j | | � Sg � | d } | d } | d j d j t j k ry d } | d j d j } t � � n! d } d } t j t j d � � t � � � f d � } | j t
j k r� | | � n` | j t
j k r1xK t
| j � D]7 \ } } | j t
j k r� | | d
| d k �q� q� Wn � s;d Sx � D] }
| d |
_ qBW| } | d k r{d � d _ n1 t | d j | � r�| � d _ | d } n x � D] }
| d |
_ q�W� | d j | | +x= t | d | t � � d � D] } | | d j | _ q W| d j � d S( Nt lambdat suitet argsi i i u ; u c s� t � j � � } | j � } d | _ t | | j � � } | rN d | _ n | j | � � j t j t j
| � j � g � � d S( Nu u ( R t new_namet clonet prefixR t replacet appendR R
R t simple_stmt( t tuple_argt
add_prefixt nt argR ( t endt new_linest self( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt handle_tupleC s
R u ( t transform_lambdaR R R t INDENTt valueR R t Leaft FalseR t tfpdeft
typedargslistt enumeratet parentR R t ranget lent changed( R t nodet resultsR R t startt indentR! t iR t linet after( ( R R R s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt transform. sF
(c C sN | d } | d } t | d � } | j t j k r\ | j � } d | _ | j | � d St | � } t | � } | j t
| � � } t | d d �} | j | j � � x� | j � D]� }
|
j t j k r� |
j
| k r� g | |
j
D] } | j � ^ q� } t j t j | j � g | � }
|
j |
_ |
j |
� q� q� Wd S( NR t bodyt inneru R ( t
simplify_argsR R t NAMER R R t find_paramst map_to_indexR t
tuple_nameR t
post_orderR$ R R
R t power( R R. R/ R R6 R7 t paramst to_indext tup_namet new_paramR t ct
subscriptst new( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR" n s(
!& ( t __name__t
__module__t run_ordert Truet
BM_compatiblet PATTERNR5 R" ( ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR s
@c C so | j t j t j f k r | S| j t j k r[ x# | j t j k rV | j d } q4 W| St d | � � d S( Ni s Received unexpected node %s( R R t vfplistR R9 t vfpdefR t RuntimeError( R. ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR8 � s c C sn | j t j k r# t | j d � S| j t j k r< | j Sg | j D]$ } | j t j k rF t | � ^ qF S( Ni ( R R RM R: R R R9 R$ t COMMA( R. RC ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR: � s
c C s� | d k r i } n xh t | � D]Z \ } } t t t | � � � g } t | t � rn t | | d | �q" | | | | <q" W| S( Nt d( t NoneR) R R t unicodeR t listR; ( t
param_listR RP R2 t objt trailer( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR; � s c C sV g } x@ | D]8 } t | t � r8 | j t | � � q
| j | � q
Wd j | � S( Nu _( R RS R R< t join( RT t lRU ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR< � s
N( t __doc__t R t pgen2R R t
fixer_utilR R R R R R R t BaseFixR R8 R: RQ R; R< ( ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt <module> s . l fixes/fix_input.pyc 0000644 00000002174 15053244255 0010415 0 ustar 00 �
{ fc @ sh d Z d d l m Z d d l m Z m Z d d l m Z e j d � Z d e j f d � � YZ
d S( s4 Fixer that changes input(...) into eval(input(...)).i ( t
fixer_base( t Callt Name( t patcomps& power< 'eval' trailer< '(' any ')' > >t FixInputc B s e Z e Z d Z d � Z RS( sL
power< 'input' args=trailer< '(' [any] ')' > >
c C sM t j | j j � r d S| j � } d | _ t t d � | g d | j �S( Nu u evalt prefix( t contextt matcht parentt cloneR R R ( t selft nodet resultst new( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyR
s N( t __doc__t R t
fixer_utilR R R t compile_patternR t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyt <module> s
fixes/fix_operator.pyo 0000644 00000012036 15053244255 0011123 0 ustar 00 �
{ fc @ s^ d Z d d l m Z d d l m Z m Z m Z m Z d � Z d e j f d � � YZ
d S( s� Fixer for operator functions.
operator.isCallable(obj) -> hasattr(obj, '__call__')
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
i����( t
fixer_base( t Callt Namet Stringt touch_importc s � f d � } | S( Nc s
� | _ | S( N( t
invocation( t f( t s( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt dec s ( ( R R ( ( R s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR s t FixOperatorc B s� e Z e Z d Z d Z d Z d e d e d e � Z d � Z e
d � d � � Z e
d � d
� � Z e
d � d � � Z
e
d
� d � � Z e
d � d � � Z e
d � d � � Z e
d � d � � Z d � Z d � Z d � Z RS( t pres�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
s '(' obj=any ')'s�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
t methodst objc C s/ | j | | � } | d k r+ | | | � Sd S( N( t
_check_methodt None( t selft nodet resultst method( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt transform) s s operator.contains(%s)c C s | j | | d � S( Nu contains( t _handle_rename( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _sequenceIncludes. s s hasattr(%s, '__call__')c C sG | d } | j � t d � t d � g } t t d � | d | j �S( NR u , u
'__call__'u hasattrt prefix( t cloneR R R R ( R R R R t args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isCallable2 s
!s operator.mul(%s)c C s | j | | d � S( Nu mul( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _repeat8 s s operator.imul(%s)c C s | j | | d � S( Nu imul( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _irepeat< s s$ isinstance(%s, collections.Sequence)c C s | j | | d d � S( Nu collectionsu Sequence( t _handle_type2abc( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isSequenceType@ s s# isinstance(%s, collections.Mapping)c C s | j | | d d � S( Nu collectionsu Mapping( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isMappingTypeD s s isinstance(%s, numbers.Number)c C s | j | | d d � S( Nu numbersu Number( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt
_isNumberTypeH s c C s% | d d } | | _ | j � d S( NR i ( t valuet changed( R R R t nameR ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR L s c C sa t d | | � | d } | j � t d d j | | g � � g } t t d � | d | j �S( NR u , u .u
isinstanceR ( R R R R t joinR R R ( R R R t modulet abcR R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR Q s
+c C s� t | d | d d j j d � � } t | � r� d | k rC | St | d � f } t | j � | } | j | d | � n d S( Nt _R i t asciiR$ R u You should use '%s' here.( t getattrR t encodet callablet unicodeR t warningR ( R R R R t subt invocation_str( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR
W s ' ( t __name__t
__module__t Truet
BM_compatiblet orderR R t dictt PATTERNR R R R R R R R R R R R
( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR R R R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt <module>
s " fixes/fix_methodattrs.pyc 0000644 00000002200 15053244255 0011602 0 ustar 00 �
{ fc @ s^ d Z d d l m Z d d l m Z i d d 6d d 6d d 6Z d
e j f d � � YZ d S(
s; Fix bound method attributes (method.im_? -> method.__?__).
i ( t
fixer_base( t Namet __func__t im_funct __self__t im_selfs __self__.__class__t im_classt FixMethodattrsc B s e Z e Z d Z d � Z RS( sU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C sA | d d } t t | j � } | j t | d | j �� d S( Nt attri t prefix( t unicodet MAPt valuet replaceR R ( t selft nodet resultsR t new( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyt <module> s
fixes/fix_basestring.pyc 0000644 00000001447 15053244255 0011421 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s Fixer for basestring -> str.i ( t
fixer_base( t Namet
FixBasestringc B s e Z e Z d Z d � Z RS( s 'basestring'c C s t d d | j �S( Nu strt prefix( R R ( t selft nodet results( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyt transform
s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyt <module> s fixes/fix_urllib.pyo 0000644 00000015770 15053244255 0010571 0 ustar 00 �
{ fc @ ss d Z d d l m Z m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z m
Z
i d d d d d d
d d d
g f d d d d d d d d d d d d d d d d g f d d g f g d 6d d
d! d" d# d$ d% d& d' d( d) d* d+ d, d- d. d/ d0 d1 d2 d3 d4 d5 d6 d7 g f d d8 d9 g f g d: 6Z e d: j e d d; � d< � Z d= e f d> � � YZ d? S(@ s� Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
i����( t
alternatest
FixImports( t
fixer_base( t Namet Commat
FromImportt Newlinet find_indentationt Nodet symss urllib.requestt URLopenert FancyURLopenert urlretrievet
_urlopenert urlopent
urlcleanupt pathname2urlt url2pathnames urllib.parset quotet
quote_plust unquotet unquote_plust urlencodet splitattrt splithostt
splitnportt splitpasswdt splitportt
splitqueryt splittagt splittypet splitusert
splitvalues urllib.errort ContentTooShortErrort urllibt install_openert build_openert Requestt OpenerDirectort BaseHandlert HTTPDefaultErrorHandlert HTTPRedirectHandlert HTTPCookieProcessort ProxyHandlert HTTPPasswordMgrt HTTPPasswordMgrWithDefaultRealmt AbstractBasicAuthHandlert HTTPBasicAuthHandlert ProxyBasicAuthHandlert AbstractDigestAuthHandlert HTTPDigestAuthHandlert ProxyDigestAuthHandlert HTTPHandlert HTTPSHandlert FileHandlert
FTPHandlert CacheFTPHandlert UnknownHandlert URLErrort HTTPErrort urllib2i c c s� t � } x� t j � D]w \ } } xh | D]` } | \ } } t | � } d | | f Vd | | | f Vd | Vd | Vd | | f Vq) Wq Wd S( Ns� import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
s� import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
sI import_from< 'from' module_star=%r 'import' star='*' >
st import_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
sK power< bare_with_attr=%r trailer< '.' member=%s > any* >
( t sett MAPPINGt itemsR ( t baret
old_modulet changest changet
new_modulet members( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt
build_pattern1 s
t FixUrllibc B s5 e Z d � Z d � Z d � Z d � Z d � Z RS( c C s d j t � � S( Nt |( t joinRF ( t self( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyRF J s c C s� | j d � } | j } g } x? t | j d D], } | j t | d d | �t � g � q0 W| j t t | j d d d | �� | j | � d S( s� Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
t modulei����i t prefixN( t getRL R> t valuet extendR R t appendt replace( RJ t nodet resultst
import_modt preft namest name( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform_importM s *(c C s� | j d � } | j } | j d � } | r� t | t � rI | d } n d
} x6 t | j D]' } | j | d k r] | d } Pq] q] W| r� | j t | d | �� q�| j | d � n/g } i } | d }
x� |
D]� } | j
t j k r| j
d j } | j
d j } n | j } d
} | d k r� xl t | j D]Z } | | d k r>| d | k rx| j | d � n | j | d g � j | � q>q>Wq� q� Wg }
t | � } t } d
� } x� | D]� } | | } g } x8 | d D], } | j | | | � � | j t � � q�W| j | | d | � � t | | � } | sa| j j j | � rm| | _ n |
j | � t } q�W|
r�g } x( |
d D] } | j | t � g � q�W| j |
d � | j | � n | j | d � d
S( s� Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
t
mod_membert memberi i RL s! This is an invalid module elementRE i u ,c S sz | j t j k rd t | j d j d | �| j d j � | j d j � g } t t j | � g St | j d | �g S( Ni RL i i ( t typeR t import_as_nameR t childrenRN t cloneR ( RW RL t kids( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt handle_name� s i����s All module elements are invalidN( RM RL t
isinstancet listt NoneR> RN RQ R t cannot_convertR[ R R\ R] RP t
setdefaultR t TrueRO R R t parentt endswitht FalseR ( RJ RR RS RY RU RZ t new_nameRC t modulest mod_dictRE t as_namet member_namet new_nodest indentationt firstR` RK t eltsRV t eltt newt nodest new_node( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform_member] sh
+
c C s� | j d � } | j d � } d } t | t � r@ | d } n x6 t | j D]' } | j | d k rN | d } PqN qN W| r� | j t | d | j �� n | j | d � d S( s. Transform for calls to module members in code.t bare_with_attrRZ i i RL s! This is an invalid module elementN(
RM Rc Ra Rb R> RN RQ R RL Rd ( RJ RR RS t
module_dotRZ Rj RC ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt
transform_dot� s
c C s� | j d � r" | j | | � n� | j d � rD | j | | � nf | j d � rf | j | | � nD | j d � r� | j | d � n" | j d � r� | j | d � n d S( NRK RY Rx t module_stars Cannot handle star imports.t module_ass# This module is now multiple modules( RM RX Rw Rz Rd ( RJ RR RS ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform� s ( t __name__t
__module__RF RX Rw Rz R} ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyRG H s
L N( t __doc__t lib2to3.fixes.fix_importsR R t lib2to3R t lib2to3.fixer_utilR R R R R R R R> RP RF RG ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt <module> sD 4 fixes/fix_idioms.pyc 0000644 00000010671 15053244255 0010543 0 ustar 00 �
{ fc @ sm d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z d Z
d Z d e j f d � � YZ
d S( s� Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
i ( t
fixer_base( t Callt Commat Namet Nodet BlankLinet symss0 (n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)s( power< 'type' trailer< '(' x=any ')' > >t FixIdiomsc B sQ e Z e Z d e e e e f Z d � Z d � Z d � Z d � Z
d � Z RS( s�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c C sJ t t | � j | � } | rF d | k rF | d | d k rB | Sd S| S( Nt sortedt id1t id2( t superR t matcht None( t selft nodet r( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR O s c C sd d | k r | j | | � Sd | k r8 | j | | � Sd | k rT | j | | � St d � � d S( Nt
isinstancet whileR s
Invalid match( t transform_isinstancet transform_whilet transform_sortt RuntimeError( R R t results( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyt transformZ s c C s� | d j � } | d j � } d | _ d | _ t t d � | t � | g � } d | k r� d | _ t t j t d � | g � } n | j | _ | S( Nt xt Tu u u
isinstancet nu not( t clonet prefixR R R R R t not_test( R R R R R t test( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR d s ! ! c C s* | d } | j t d d | j �� d S( NR u TrueR ( t replaceR R ( R R R t one( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR p s
c C sv | d } | d } | j d � } | j d � } | rW | j t d d | j �� nR | r� | j � } d | _ | j t t d � | g d | j �� n t d � � | j � | j } d | k rr| r| j d � d
| d
j f } d j | � | d
_ qr| j
st � | j d k s+t � t � }
| j
j |
� | j |
k sYt � | j d � d
|
_ n d S( Nt sortt nextt listt expru sortedR u s should not have reached hereu
i ( t getR R R R R R t removet
rpartitiont joint parentt AssertionErrort next_siblingR
R t append_child( R R R t sort_stmtt next_stmtt list_callt simple_exprt newt btwnt prefix_linest end_line( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR t s0
( t __name__t
__module__t Truet explicitt TYPEt CMPt PATTERNR R R R R ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR % s '
N( t __doc__t R t
fixer_utilR R R R R R R; R: t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyt <module> s
. fixes/fix_repr.pyo 0000644 00000002006 15053244255 0010234 0 ustar 00 �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s/ Fixer that transforms `xyzzy` into repr(xyzzy).i ( t
fixer_base( t Callt Namet parenthesizet FixReprc B s e Z e Z d Z d � Z RS( s7
atom < '`' expr=any '`' >
c C sS | d j � } | j | j j k r4 t | � } n t t d � | g d | j �S( Nt expru reprt prefix( t clonet typet symst testlist1R R R R ( t selft nodet resultsR ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyR s N( t __doc__t R t
fixer_utilR R R t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyt <module> s fixes/fix_execfile.pyo 0000644 00000004033 15053244255 0011052 0 ustar 00 �
{ fc @ sy d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z m
Z
m Z m Z m
Z
d e j f d � � YZ d S( so Fixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
i ( t
fixer_base(
t Commat Namet Callt LParent RParent Dott Nodet ArgListt Stringt symst FixExecfilec B s e Z e Z d Z d � Z RS( s�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s� | d } | j d � } | j d � } | j d j d j � } t | j � t � t d d � g d | �} t t j t d � | g � } t t j
t � t d � g � t t j
t � t
� g � g } | g | }
| j � } d
| _ t d d
� } |
t � | t � | g }
t t d � |
d
� } | g } | d k re| j t � | j � g � n | d k r�| j t � | j � g � n t t d � | d | j �S( Nt filenamet globalst localsi����s "rb"t t rparenu openu readu u 'exec'u compileu u exect prefix( t gett childrent cloneR R R R R
t powerR t trailerR R R R R t Nonet extend( t selft nodet resultsR R
R t execfile_parent open_argst open_callt readt open_exprt filename_argt exec_strt compile_argst compile_callt args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyt transform s*
$ !
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR& ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyR s N( t __doc__t R t
fixer_utilR R R R R R R R R R
t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyt <module> s F fixes/fix_print.pyo 0000644 00000005126 15053244255 0010426 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m
Z
m Z m Z e j
d � Z d e j f d � � YZ d
S( s Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
i ( t patcomp( t pytree( t token( t
fixer_base( t Namet Callt Commat Stringt is_tuples" atom< '(' [atom|STRING|NAME] ')' >t FixPrintc B s& e Z e Z d Z d � Z d � Z RS( sP
simple_stmt< any* bare='print' any* > | print_stmt
c C s� | j d � } | r> | j t t d � g d | j �� d S| j d } t | � d k rt t j | d � rt d Sd } } } | r� | d t
� k r� | d } d } n | r� | d t j t
j d � k r� | d j � } | d } n g | D] } | j � ^ q� } | r%d
| d _ n | d k sI| d k sI| d k r�| d k rw| j | d t t | � � � n | d k r�| j | d t t | � � � n | d k r�| j | d
| � q�n t t d � | � }
| j |
_ |
S( Nt bareu printt prefixi i i����t u >>i u u sepu endu file( t gett replaceR R R t childrent lent parend_exprt matcht NoneR R t LeafR t
RIGHTSHIFTt clonet add_kwargR t repr( t selft nodet resultst
bare_printt argst sept endt filet argt l_argst n_stmt( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyt transform% s8
%
%
$ " " c C sr d | _ t j | j j t | � t j t j d � | f � } | ra | j t
� � d | _ n | j | � d S( Nu u =u ( R R t Nodet symst argumentR R R t EQUALt appendR ( R t l_nodest s_kwdt n_exprt
n_argument( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyR M s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR$ R ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyR s (N( t __doc__t R R t pgen2R R t
fixer_utilR R R R R t compile_patternR t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyt <module> s ( fixes/fix_unicode.pyc 0000644 00000003304 15053244255 0010700 0 ustar 00 �
{ fc @ sW d Z d d l m Z d d l m Z i d d 6d d 6Z d e j f d � � YZ d
S( s� Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
i ( t token( t
fixer_baseu chru unichru stru unicodet
FixUnicodec B s& e Z e Z d Z d � Z d � Z RS( s STRING | 'unicode' | 'unichr'c C s/ t t | � j | | � d | j k | _ d S( Nt unicode_literals( t superR t
start_treet future_featuresR ( t selft treet filename( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyR s c C s | j t j k r2 | j � } t | j | _ | S| j t j k r| j } | j r� | d d k r� d | k r� d j g | j d � D]$ } | j
d d � j
d d � ^ q� � } n | d d k r� | d
} n | | j k r� | S| j � } | | _ | Sd S( Ni u '"u \u \\u \uu \\uu \Uu \\Uu uUi ( t typeR t NAMEt clonet _mappingt valuet STRINGR t joint splitt replace( R t nodet resultst newt valt v( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyt transform s" &=
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR R ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyR s N( t __doc__t pgen2R t R R
t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyt <module> s fixes/fix_set_literal.pyc 0000644 00000003724 15053244255 0011567 0 ustar 00 �
{ fc @ sO d Z d d l m Z m Z d d l m Z m Z d e j f d � � YZ d S( s:
Optional fixer to transform set() calls to set literals.
i����( t
fixer_baset pytree( t tokent symst
FixSetLiteralc B s# e Z e Z e Z d Z d � Z RS( sj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s | j d � } | rI t j t j | j � g � } | j | � | } n
| d } t j t j d � g } | j
d � | j D� � | j t j t j
d � � | j j | d _ t j t j | � } | j | _ t | j � d k r| j d } | j � | j | j d _ n | S( Nt singlet itemsu {c s s | ] } | j � Vq d S( N( t clone( t .0t n( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pys <genexpr>' s u }i����i i ( t getR t NodeR t listmakerR t replacet LeafR t LBRACEt extendt childrent appendt RBRACEt next_siblingt prefixt dictsetmakert lent remove( t selft nodet resultsR t fakeR t literalt makerR ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyt transform s"
( t __name__t
__module__t Truet
BM_compatiblet explicitt PATTERNR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyR s
N( t __doc__t lib2to3R R t lib2to3.fixer_utilR R t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyt <module> s fixes/fix_getcwdu.pyo 0000644 00000001654 15053244255 0010736 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s1
Fixer that changes os.getcwdu() to os.getcwd().
i ( t
fixer_base( t Namet
FixGetcwduc B s e Z e Z d Z d � Z RS( sR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu getcwdt prefix( t replaceR R ( t selft nodet resultsR ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyR
s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyt <module> s fixes/fix_print.pyc 0000644 00000005267 15053244255 0010420 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m
Z
m Z m Z e j
d � Z d e j f d � � YZ d
S( s Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
i ( t patcomp( t pytree( t token( t
fixer_base( t Namet Callt Commat Stringt is_tuples" atom< '(' [atom|STRING|NAME] ')' >t FixPrintc B s& e Z e Z d Z d � Z d � Z RS( sP
simple_stmt< any* bare='print' any* > | print_stmt
c C s2 | s t � | j d � } | rJ | j t t d � g d | j �� d S| j d t d � k si t � | j d } t | � d k r� t j | d � r� d Sd } } } | r� | d t � k r� | d } d } n | r3| d t j
t j d � k r3t | � d k st � | d j � } | d
} n g | D] } | j � ^ q:} | rhd | d _ n | d k s�| d k s�| d k r
| d k r�| j | d t t | � � � n | d k r�| j | d
t t | � � � n | d k r
| j | d | � q
n t t d � | � }
| j |
_ |
S( Nt bareu printt prefixi i i����t u >>i i u u sepu endu file( t AssertionErrort gett replaceR R R t childrent lent parend_exprt matcht NoneR R t LeafR t
RIGHTSHIFTt clonet add_kwargR t repr( t selft nodet resultst
bare_printt argst sept endt filet argt l_argst n_stmt( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyt transform% s>
%
%
$ " " c C sr d | _ t j | j j t | � t j t j d � | f � } | ra | j t
� � d | _ n | j | � d S( Nu u =u ( R R t Nodet symst argumentR R R t EQUALt appendR ( R t l_nodest s_kwdt n_exprt
n_argument( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyR M s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR% R ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyR s (N( t __doc__t R R t pgen2R R t
fixer_utilR R R R R t compile_patternR t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyt <module> s ( fixes/fix_long.pyo 0000644 00000001527 15053244255 0010232 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s/ Fixer that turns 'long' into 'int' everywhere.
i����( t
fixer_base( t is_probably_builtint FixLongc B s e Z e Z d Z d � Z RS( s 'long'c C s& t | � r" d | _ | j � n d S( Nu int( R t valuet changed( t selft nodet results( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyt <module> s fixes/fix_urllib.pyc 0000644 00000015770 15053244255 0010555 0 ustar 00 �
{ fc @ ss d Z d d l m Z m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z m
Z
i d d d d d d
d d d
g f d d d d d d d d d d d d d d d d g f d d g f g d 6d d
d! d" d# d$ d% d& d' d( d) d* d+ d, d- d. d/ d0 d1 d2 d3 d4 d5 d6 d7 g f d d8 d9 g f g d: 6Z e d: j e d d; � d< � Z d= e f d> � � YZ d? S(@ s� Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
i����( t
alternatest
FixImports( t
fixer_base( t Namet Commat
FromImportt Newlinet find_indentationt Nodet symss urllib.requestt URLopenert FancyURLopenert urlretrievet
_urlopenert urlopent
urlcleanupt pathname2urlt url2pathnames urllib.parset quotet
quote_plust unquotet unquote_plust urlencodet splitattrt splithostt
splitnportt splitpasswdt splitportt
splitqueryt splittagt splittypet splitusert
splitvalues urllib.errort ContentTooShortErrort urllibt install_openert build_openert Requestt OpenerDirectort BaseHandlert HTTPDefaultErrorHandlert HTTPRedirectHandlert HTTPCookieProcessort ProxyHandlert HTTPPasswordMgrt HTTPPasswordMgrWithDefaultRealmt AbstractBasicAuthHandlert HTTPBasicAuthHandlert ProxyBasicAuthHandlert AbstractDigestAuthHandlert HTTPDigestAuthHandlert ProxyDigestAuthHandlert HTTPHandlert HTTPSHandlert FileHandlert
FTPHandlert CacheFTPHandlert UnknownHandlert URLErrort HTTPErrort urllib2i c c s� t � } x� t j � D]w \ } } xh | D]` } | \ } } t | � } d | | f Vd | | | f Vd | Vd | Vd | | f Vq) Wq Wd S( Ns� import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
s� import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
sI import_from< 'from' module_star=%r 'import' star='*' >
st import_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
sK power< bare_with_attr=%r trailer< '.' member=%s > any* >
( t sett MAPPINGt itemsR ( t baret
old_modulet changest changet
new_modulet members( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt
build_pattern1 s
t FixUrllibc B s5 e Z d � Z d � Z d � Z d � Z d � Z RS( c C s d j t � � S( Nt |( t joinRF ( t self( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyRF J s c C s� | j d � } | j } g } x? t | j d D], } | j t | d d | �t � g � q0 W| j t t | j d d d | �� | j | � d S( s� Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
t modulei����i t prefixN( t getRL R> t valuet extendR R t appendt replace( RJ t nodet resultst
import_modt preft namest name( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform_importM s *(c C s� | j d � } | j } | j d � } | r� t | t � rI | d } n d
} x6 t | j D]' } | j | d k r] | d } Pq] q] W| r� | j t | d | �� q�| j | d � n/g } i } | d }
x� |
D]� } | j
t j k r| j
d j } | j
d j } n | j } d
} | d k r� xl t | j D]Z } | | d k r>| d | k rx| j | d � n | j | d g � j | � q>q>Wq� q� Wg }
t | � } t } d
� } x� | D]� } | | } g } x8 | d D], } | j | | | � � | j t � � q�W| j | | d | � � t | | � } | sa| j j j | � rm| | _ n |
j | � t } q�W|
r�g } x( |
d D] } | j | t � g � q�W| j |
d � | j | � n | j | d � d
S( s� Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
t
mod_membert memberi i RL s! This is an invalid module elementRE i u ,c S sz | j t j k rd t | j d j d | �| j d j � | j d j � g } t t j | � g St | j d | �g S( Ni RL i i ( t typeR t import_as_nameR t childrenRN t cloneR ( RW RL t kids( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt handle_name� s i����s All module elements are invalidN( RM RL t
isinstancet listt NoneR> RN RQ R t cannot_convertR[ R R\ R] RP t
setdefaultR t TrueRO R R t parentt endswitht FalseR ( RJ RR RS RY RU RZ t new_nameRC t modulest mod_dictRE t as_namet member_namet new_nodest indentationt firstR` RK t eltsRV t eltt newt nodest new_node( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform_member] sh
+
c C s� | j d � } | j d � } d } t | t � r@ | d } n x6 t | j D]' } | j | d k rN | d } PqN qN W| r� | j t | d | j �� n | j | d � d S( s. Transform for calls to module members in code.t bare_with_attrRZ i i RL s! This is an invalid module elementN(
RM Rc Ra Rb R> RN RQ R RL Rd ( RJ RR RS t
module_dotRZ Rj RC ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt
transform_dot� s
c C s� | j d � r" | j | | � n� | j d � rD | j | | � nf | j d � rf | j | | � nD | j d � r� | j | d � n" | j d � r� | j | d � n d S( NRK RY Rx t module_stars Cannot handle star imports.t module_ass# This module is now multiple modules( RM RX Rw Rz Rd ( RJ RR RS ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform� s ( t __name__t
__module__RF RX Rw Rz R} ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyRG H s
L N( t __doc__t lib2to3.fixes.fix_importsR R t lib2to3R t lib2to3.fixer_utilR R R R R R R R> RP RF RG ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt <module> sD 4 fixes/fix_funcattrs.pyc 0000644 00000002150 15053244255 0011261 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s3 Fix function attribute names (f.func_x -> f.__x__).i ( t
fixer_base( t Namet FixFuncattrsc B s e Z e Z d Z d � Z RS( s�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s9 | d d } | j t d | j d d | j �� d S( Nt attri u __%s__i t prefix( t replaceR t valueR ( t selft nodet resultsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR
( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyt <module> s fixes/fix_sys_exc.pyc 0000644 00000003271 15053244255 0010732 0 ustar 00 �
{ fc @ sg d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z m
Z
d e j f d � � YZ d S( s� Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
i ( t
fixer_base( t Attrt Callt Namet Numbert Subscriptt Nodet symst FixSysExcc B sC e Z d d d g Z e Z d d j d � e D� � Z d � Z RS( u exc_typeu exc_valueu
exc_tracebacksN
power< 'sys' trailer< dot='.' attribute=(%s) > >
t |c c s | ] } d | Vq d S( s '%s'N( ( t .0t e( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pys <genexpr> s c C s� | d d } t | j j | j � � } t t d � d | j �} t t d � | � } | d j | d j d _ | j t
| � � t t j
| d | j �S( Nt attributei u exc_infot prefixu syst doti ( R t exc_infot indext valueR R R
R t childrent appendR R R t power( t selft nodet resultst sys_attrR t callt attr( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyt transform s ( t __name__t
__module__R t Truet
BM_compatiblet joint PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyR s N(
t __doc__t R t
fixer_utilR R R R R R R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyt <module> s 4 fixes/__init__.pyc 0000644 00000000205 15053244255 0010140 0 ustar 00 �
{ fc @ s d S( N( ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/__init__.pyt <module> t fixes/fix_xrange.pyc 0000644 00000006017 15053244255 0010542 0 ustar 00 �
{ fc @ s_ d Z d d l m Z d d l m Z m Z m Z d d l m Z d e j f d � � YZ d S( s/ Fixer that changes xrange(...) into range(...).i ( t
fixer_base( t Namet Callt consuming_calls( t patcompt FixXrangec B st e Z e Z d Z d � Z d � Z d � Z d � Z d � Z d Z
e j e
� Z
d Z e j e � Z d � Z RS( s�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c C s) t t | � j | | � t � | _ d S( N( t superR t
start_treet sett transformed_xranges( t selft treet filename( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR s c C s
d | _ d S( N( t NoneR ( R
R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt finish_tree s c C s^ | d } | j d k r) | j | | � S| j d k rH | j | | � St t | � � � d S( Nt nameu xrangeu range( t valuet transform_xranget transform_ranget
ValueErrort repr( R
t nodet resultsR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt transform s
c C s@ | d } | j t d d | j �� | j j t | � � d S( NR u ranget prefix( t replaceR R R t addt id( R
R R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR $ s
c C s� t | � | j k r� | j | � r� t t d � | d j � g � } t t d � | g d | j �} x | d D] } | j | � qs W| Sd S( Nu ranget argsu listR t rest( R R t in_special_contextR R t cloneR t append_child( R
R R t
range_callt list_callt n( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR * s " s3 power< func=NAME trailer< '(' node=any ')' > any* >s� for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C s� | j d k r t Si } | j j d k rg | j j | j j | � rg | d | k rg | d j t k S| j j | j | � o� | d | k S( NR t func( t parentR
t Falset p1t matchR R t p2( R
R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR ? s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR R R R R t P1R t compile_patternR' t P2R) R ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR s N(
t __doc__t R t
fixer_utilR R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt <module> s fixes/fix_xreadlines.pyc 0000644 00000002216 15053244255 0011411 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sp Fix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__).i ( t
fixer_base( t Namet
FixXreadlinesc B s e Z e Z d Z d � Z RS( s�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C sb | j d � } | r4 | j t d d | j �� n* | j g | d D] } | j � ^ qE � d S( Nt no_callu __iter__t prefixt call( t gett replaceR R t clone( t selft nodet resultsR t x( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR
( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyt <module> s fixes/fix_throw.pyc 0000644 00000003732 15053244255 0010422 0 ustar 00 �
{ fc @ s{ d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z d e j f d � � YZ
d S( s� Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions.i ( t pytree( t token( t
fixer_base( t Namet Callt ArgListt Attrt is_tuplet FixThrowc B s e Z e Z d Z d � Z RS( s�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C sP | j } | d j � } | j t j k r? | j | d � d S| j d � } | d k r^ d S| j � } t | � r� g | j d d !D] } | j � ^ q� } n d | _
| g } | d } d | k r6| d j � } d | _
t | | � }
t |
t
d � � t | g � g } | j t j | j | � � n | j t | | � � d S(
Nt excs+ Python 3 does not support string exceptionsu vali i����u t argst tbu with_traceback( t symst clonet typeR t STRINGt cannot_convertt gett NoneR t childrent prefixR R R R t replaceR t Nodet power( t selft nodet resultsR R t valt cR
t
throw_argsR t et with_tb( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyt transform s* ,
% ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyR s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyt <module> s
( fixes/fix_standarderror.pyo 0000644 00000001543 15053244255 0012143 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s% Fixer for StandardError -> Exception.i ( t
fixer_base( t Namet FixStandarderrorc B s e Z e Z d Z d � Z RS( s-
'StandardError'
c C s t d d | j �S( Nu Exceptiont prefix( R R ( t selft nodet results( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyt <module> s fixes/fix_isinstance.pyo 0000644 00000003474 15053244255 0011436 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s, Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
i ( t
fixer_base( t tokent
FixIsinstancec B s# e Z e Z d Z d Z d � Z RS( s�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
i c C sU t � } | d } | j } g } t | � } x� | D]� \ } } | j t j k r� | j | k r� | t | � d k r� | | d j t j k r� | j � q5 q� q5 | j
| � | j t j k r5 | j | j � q5 q5 W| r| d j t j k r| d =n t | � d k r@| j }
|
j
| d _
|
j | d � n | | (| j � d S( Nt argsi i����i ( t sett childrent enumeratet typeR t NAMEt valuet lent COMMAt nextt appendt addt parentt prefixt replacet changed( t selft nodet resultst names_insertedt testlistR t new_argst iteratort idxt argt atom( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyt transform s*
!0
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt run_orderR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyt <module>
s fixes/fix_tuple_params.pyc 0000644 00000012522 15053244255 0011750 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z d � Z
d e j f d � � YZ d � Z d
� Z g d
d � Z d � Z d
S( s: Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
i ( t pytree( t token( t
fixer_base( t Assignt Namet Newlinet Numbert Subscriptt symsc C s) t | t j � o( | j d j t j k S( Ni ( t
isinstanceR t Nodet childrent typeR t STRING( t stmt( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt is_docstring s t FixTupleParamsc B s, e Z d Z e Z d Z d � Z d � Z RS( i s
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s0 d | k r � j | | � Sg � | d } | d } | d j d j t j k ry d } | d j d j } t � � n! d } d } t j t j d � � t � � � f d � } | j t
j k r� | | � n` | j t
j k r1xK t
| j � D]7 \ } } | j t
j k r� | | d
| d k �q� q� Wn � s;d Sx � D] }
| d |
_ qBW| } | d k r{d � d _ n1 t | d j | � r�| � d _ | d } n x � D] }
| d |
_ q�W� | d j | | +x= t | d | t � � d � D] } | | d j | _ q W| d j � d S( Nt lambdat suitet argsi i i u ; u c s� t � j � � } | j � } d | _ t | | j � � } | rN d | _ n | j | � � j t j t j
| � j � g � � d S( Nu u ( R t new_namet clonet prefixR t replacet appendR R
R t simple_stmt( t tuple_argt
add_prefixt nt argR ( t endt new_linest self( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt handle_tupleC s
R u ( t transform_lambdaR R R t INDENTt valueR R t Leaft FalseR t tfpdeft
typedargslistt enumeratet parentR R t ranget lent changed( R t nodet resultsR R t startt indentR! t iR t linet after( ( R R R s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt transform. sF
(c C sN | d } | d } t | d � } | j t j k r\ | j � } d | _ | j | � d St | � } t | � } | j t
| � � } t | d d �} | j | j � � x� | j � D]� }
|
j t j k r� |
j
| k r� g | |
j
D] } | j � ^ q� } t j t j | j � g | � }
|
j |
_ |
j |
� q� q� Wd S( NR t bodyt inneru R ( t
simplify_argsR R t NAMER R R t find_paramst map_to_indexR t
tuple_nameR t
post_orderR$ R R
R t power( R R. R/ R R6 R7 t paramst to_indext tup_namet new_paramR t ct
subscriptst new( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR" n s(
!& ( t __name__t
__module__t run_ordert Truet
BM_compatiblet PATTERNR5 R" ( ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR s
@c C so | j t j t j f k r | S| j t j k r[ x# | j t j k rV | j d } q4 W| St d | � � d S( Ni s Received unexpected node %s( R R t vfplistR R9 t vfpdefR t RuntimeError( R. ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR8 � s c C sn | j t j k r# t | j d � S| j t j k r< | j Sg | j D]$ } | j t j k rF t | � ^ qF S( Ni ( R R RM R: R R R9 R$ t COMMA( R. RC ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR: � s
c C s� | d k r i } n xh t | � D]Z \ } } t t t | � � � g } t | t � rn t | | d | �q" | | | | <q" W| S( Nt d( t NoneR) R R t unicodeR t listR; ( t
param_listR RP R2 t objt trailer( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR; � s c C sV g } x@ | D]8 } t | t � r8 | j t | � � q
| j | � q
Wd j | � S( Nu _( R RS R R< t join( RT t lRU ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR< � s
N( t __doc__t R t pgen2R R t
fixer_utilR R R R R R R t BaseFixR R8 R: RQ R; R< ( ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt <module> s . l fixes/fix_xrange.pyo 0000644 00000006017 15053244255 0010556 0 ustar 00 �
{ fc @ s_ d Z d d l m Z d d l m Z m Z m Z d d l m Z d e j f d � � YZ d S( s/ Fixer that changes xrange(...) into range(...).i ( t
fixer_base( t Namet Callt consuming_calls( t patcompt FixXrangec B st e Z e Z d Z d � Z d � Z d � Z d � Z d � Z d Z
e j e
� Z
d Z e j e � Z d � Z RS( s�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c C s) t t | � j | | � t � | _ d S( N( t superR t
start_treet sett transformed_xranges( t selft treet filename( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR s c C s
d | _ d S( N( t NoneR ( R
R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt finish_tree s c C s^ | d } | j d k r) | j | | � S| j d k rH | j | | � St t | � � � d S( Nt nameu xrangeu range( t valuet transform_xranget transform_ranget
ValueErrort repr( R
t nodet resultsR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt transform s
c C s@ | d } | j t d d | j �� | j j t | � � d S( NR u ranget prefix( t replaceR R R t addt id( R
R R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR $ s
c C s� t | � | j k r� | j | � r� t t d � | d j � g � } t t d � | g d | j �} x | d D] } | j | � qs W| Sd S( Nu ranget argsu listR t rest( R R t in_special_contextR R t cloneR t append_child( R
R R t
range_callt list_callt n( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR * s " s3 power< func=NAME trailer< '(' node=any ')' > any* >s� for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C s� | j d k r t Si } | j j d k rg | j j | j j | � rg | d | k rg | d j t k S| j j | j | � o� | d | k S( NR t func( t parentR
t Falset p1t matchR R t p2( R
R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR ? s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR R R R R t P1R t compile_patternR' t P2R) R ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR s N(
t __doc__t R t
fixer_utilR R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt <module> s fixes/fix_except.pyc 0000644 00000005701 15053244255 0010545 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z d � Z
d e j f d � � YZ d S(
s� Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
i ( t pytree( t token( t
fixer_base( t Assignt Attrt Namet is_tuplet is_listt symsc c sb x[ t | � D]M \ } } | j t j k r
| j d j d k rZ | | | d f VqZ q
q
Wd S( Ni u excepti ( t enumeratet typeR t
except_clauset childrent value( t nodest it n( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt find_excepts s t FixExceptc B s e Z e Z d Z d � Z RS( s1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C s, | j } g | d D] } | j � ^ q } g | d D] } | j � ^ q7 } x�t | � D]�\ } } t | j � d k r\ | j d d !\ }
} } | j t d d d �� | j t j k r�t | j
� d d �}
| j � } d | _ | j |
� |
j � }
| j } x0 t | � D]" \ } } t
| t j � r Pq q Wt | � s[t | � r|t | t |
t d � � � } n t | |
� } x( t | | � D] } | j d
| � q�W| j | | � q�| j d k r�d | _ q�q\ q\ Wg | j d D] } | j � ^ q�| | } t j | j | � S( Nt tailt cleanupi i u ast prefixu u u argsi i ( R t cloneR t lenR t replaceR R
R t NAMEt new_nameR R t
isinstanceR t NodeR R R R t reversedt insert_child( t selft nodet resultsR R R t cht try_cleanupR t e_suitet Et commat Nt new_Nt targett suite_stmtsR t stmtt assignt childt cR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt transform/ s6 ##
!.( t __name__t
__module__t Truet
BM_compatiblet PATTERNR/ ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyR $ s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt <module> s . fixes/fix_itertools.pyo 0000644 00000003415 15053244255 0011315 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sT Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
i ( t
fixer_base( t Namet FixItertoolsc B s0 e Z e Z d Z d e � Z d Z d � Z RS( s7 ('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')s�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
i c C s� d } | d d } d | k rt | j d k rt | d | d } } | j } | j � | j � | j j | � n | p� | j } | j t | j d d | �� d S(
Nt funci t itu ifilterfalseu izip_longestt doti t prefix( u ifilterfalseu izip_longest( t Nonet valueR t removet parentt replaceR ( t selft nodet resultsR R R R ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet it_funcst localst PATTERNt run_orderR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyR s
N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyt <module> s fixes/fix_exec.pyc 0000644 00000002630 15053244255 0010177 0 ustar 00 �
{ fc @ s_ d Z d d l m Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s� Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
i ( t pytree( t
fixer_base( t Commat Namet Callt FixExecc B s e Z e Z d Z d � Z RS( sx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� | s t � | j } | d } | j d � } | j d � } | j � g } d | d _ | d k r� | j t � | j � g � n | d k r� | j t � | j � g � n t t d � | d | j �S( Nt at bt ct i u exect prefix(
t AssertionErrort symst gett cloneR
t Nonet extendR R R ( t selft nodet resultsR R R R t args( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyR s N(
t __doc__R R R t
fixer_utilR R R t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyt <module>
s fixes/fix_dict.pyo 0000644 00000007074 15053244255 0010221 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m
Z
m Z m Z m
Z
d d l m Z e j e d g � BZ d e j f d
� � YZ d S( sj Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
i ( t pytree( t patcomp( t token( t
fixer_base( t Namet Callt LParent RParent ArgListt Dot( t
fixer_utilt itert FixDictc B sP e Z e Z d Z d � Z d Z e j e � Z d Z
e j e
� Z d � Z RS( s
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c C s� | d } | d d } | d } | j } | j } | j d � } | j d � } | s^ | rk | d } n g | D] }
|
j � ^ qr } g | D] }
|
j � ^ q� } | o� | j | | � } | t j | j t � t | d | j
�g � | d j � g } t j | j | � }
| p!| sTd
|
_
t t | r?d n d � |
g � }
n | ryt j | j |
g | � }
n | j
|
_
|
S( Nt headt methodi t tailu iteru viewi t prefixt parensu u list(
t symst valuet
startswitht clonet in_special_contextR t Nodet trailerR R R t powerR ( t selft nodet resultsR
R R R t method_namet isitert isviewt nt specialt argst new( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyt transform7 s2
' s3 power< func=NAME trailer< '(' node=any ')' > any* >sm for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� | j d k r t Si } | j j d k r� | j j | j j | � r� | d | k r� | rm | d j t k S| d j t j k Sn | s� t S| j j | j | � o� | d | k S( NR t func(
t parentt Nonet Falset p1t matchR t iter_exemptR
t consuming_callst p2( R R R R ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyR [ s (
t __name__t
__module__t Truet
BM_compatiblet PATTERNR$ t P1R t compile_patternR) t P2R- R ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyR * s
N( t __doc__t R R t pgen2R R R
R R R R R R R, t setR+ t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyt <module> s . fixes/fix_has_key.pyc 0000644 00000006176 15053244255 0010707 0 ustar 00 �
{ fc @ si d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z d e j f d � � YZ
d S( s& Fixer for has_key().
Calls to .has_key() methods are expressed in terms of the 'in'
operator:
d.has_key(k) -> k in d
CAVEATS:
1) While the primary target of this fixer is dict.has_key(), the
fixer will change any has_key() method call, regardless of its
class.
2) Cases like this will not be converted:
m = d.has_key
if m(k):
...
Only *calls* to has_key() are converted. While it is possible to
convert the above to something like
m = d.__contains__
if m(k):
...
this is currently not done.
i ( t pytree( t token( t
fixer_base( t Namet parenthesizet FixHasKeyc B s e Z e Z d Z d � Z RS( s�
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
c
C sU | s t � | j } | j j | j k rC | j j | j � rC d S| j d � } | d } | j } g | d D] } | j
� ^ qp } | d j
� } | j d � }
|
r� g |
D] } | j
� ^ q� }
n | j | j | j | j | j
| j | j | j f k rt | � } n t | � d k r6| d } n t j | j | � } d | _ t d d
d �} | r�t d d
d �} t j | j | | f � } n t j | j | | | f � }
|
r�t |
� }
t j | j |
f t |
� � }
n | j j | j | j | j | j | j | j | j | j | j f k rHt |
� }
n | |
_ |
S( Nt negationt anchort beforet argt afteri i u u int prefixu not( t AssertionErrort symst parentt typet not_testt patternt matcht Nonet getR t clonet
comparisont and_testt or_testt testt lambdeft argumentR t lenR t Nodet powerR t comp_opt tuplet exprt xor_exprt and_exprt
shift_exprt
arith_exprt termt factor( t selft nodet resultsR
R R R t nR R R
t n_opt n_nott new( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyt transformH sF
#"!
% ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR/ ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyR ' s N( t __doc__t R t pgen2R R t
fixer_utilR R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyt <module> s
fixes/fix_map.pyc 0000644 00000005756 15053244255 0010044 0 ustar 00 �
{ fc @ su d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d d l
m Z d e j
f d � � YZ d S( s Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
i ( t token( t
fixer_base( t Namet Callt ListCompt in_special_context( t python_symbolst FixMapc B s# e Z e Z d Z d Z d � Z RS( s�
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'map' trailer< '(' [arglist=any] ')' >
>
s future_builtins.mapc C s� | j | � r d S| j j t j k rh | j | d � | j � } d | _ t t d � | g � } n d | k r� t
| d j � | d j � | d j � � } n� d | k r� | d j � } n� d
| k r4| d
} | j t j k r4| j d j t
j k r4| j d j d k r4| j | d
� d Sn t | � rDd S| j � } d | _ t t d � | g � } | j | _ | S( Ns You should use a for loop hereu u listt
map_lambdat xpt fpt itt map_nonet argt arglisti t Nonesj cannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence( t should_skipt parentt typet symst simple_stmtt warningt clonet prefixR R R R t childrenR t NAMEt valueR R ( t selft nodet resultst newt args( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyt transform; s6
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyR s N( t __doc__t pgen2R t R t
fixer_utilR R R R t pygramR R t ConditionalFixR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyt <module> s
" fixes/fix_types.pyo 0000644 00000004242 15053244255 0010434 0 ustar 00 �
{ fc @ s d Z d d l m Z d d l m Z d d l m Z i d d 6d d 6d d
6d d 6d
d 6d
d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d! d" 6d# d$ 6d% d& 6d d' 6d( d) 6d* d+ 6Z g e D] Z d, e ^ q� Z d- e j
f d. � � YZ d/ S(0 s� Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
i ( t token( t
fixer_base( t Namet boolt BooleanTypet
memoryviewt
BufferTypet typet ClassTypet complext ComplexTypet dictt DictTypet DictionaryTypes type(Ellipsis)t EllipsisTypet floatt FloatTypet intt IntTypet listt ListTypet LongTypet objectt
ObjectTypes
type(None)t NoneTypes type(NotImplemented)t NotImplementedTypet slicet SliceTypet bytest
StringTypes (str,)t StringTypest tuplet TupleTypet TypeTypet strt UnicodeTypet ranget
XRangeTypes) power< 'types' trailer< '.' name='%s' > >t FixTypesc B s& e Z e Z d j e � Z d � Z RS( t |c C s9 t t j | d j � � } | r5 t | d | j �Sd S( Nt namet prefix( t unicodet
_TYPE_MAPPINGt gett valueR R) t None( t selft nodet resultst new_value( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyt transform: s ( t __name__t
__module__t Truet
BM_compatiblet joint _patst PATTERNR3 ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyR& 6 s N( t __doc__t pgen2R t R t
fixer_utilR R+ t tR9 t BaseFixR& ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyt <module> s6
fixes/fix_paren.pyo 0000644 00000003025 15053244255 0010373 0 ustar 00 �
{ fc @ sI d Z d d l m Z d d l m Z m Z d e j f d � � YZ d S( su Fixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``.i ( t
fixer_base( t LParent RParent FixParenc B s e Z e Z d Z d � Z RS( s
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C sL | d } t � } | j | _ d | _ | j d | � | j t � � d S( Nt targetu i ( R t prefixt insert_childt append_childR ( t selft nodet resultsR t lparen( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyt transform% s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyt <module> s fixes/fix_renames.pyc 0000644 00000004647 15053244255 0010717 0 ustar 00 �
{ fc @ su d Z d d l m Z d d l m Z m Z i i d d 6d 6Z i Z d � Z d � Z d e j
f d
� � YZ d S( s? Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
i ( t
fixer_base( t Namet
attr_chaint maxsizet maxintt sysc C s d d j t t | � � d S( Nt (t |t )( t joint mapt repr( t members( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt
alternates s c c so xh t j � D]Z \ } } xK | j � D]= \ } } | t | | f <d | | | f Vd | | f Vq& Wq
Wd S( Ns�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
s^
power< module_name=%r trailer< '.' attr_name=%r > any* >
( t MAPPINGt itemst LOOKUP( t modulet replacet old_attrt new_attr( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt
build_pattern s
t
FixRenamesc B s8 e Z e Z d j e � � Z d Z d � Z d � Z RS( R t prec sU t t | � j � � | � } | rQ t � f d � t | d � D� � rM t S| St S( Nc 3 s | ] } � | � Vq d S( N( ( t .0t obj( t match( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pys <genexpr>5 s t parent( t superR R t anyR t False( t selft nodet results( ( R s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyR 1 s %c C si | j d � } | j d � } | re | re t t | j | j f � } | j t | d | j �� n d S( Nt module_namet attr_namet prefix( t gett unicodeR t valueR R R$ ( R R R! t mod_nameR# R ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt transform> s
(
t __name__t
__module__t Truet
BM_compatibleR R t PATTERNt orderR R) ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyR * s
N( t __doc__t R t
fixer_utilR R R R R
R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt <module> s fixes/fix_set_literal.pyo 0000644 00000003724 15053244255 0011603 0 ustar 00 �
{ fc @ sO d Z d d l m Z m Z d d l m Z m Z d e j f d � � YZ d S( s:
Optional fixer to transform set() calls to set literals.
i����( t
fixer_baset pytree( t tokent symst
FixSetLiteralc B s# e Z e Z e Z d Z d � Z RS( sj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s | j d � } | rI t j t j | j � g � } | j | � | } n
| d } t j t j d � g } | j
d � | j D� � | j t j t j
d � � | j j | d _ t j t j | � } | j | _ t | j � d k r| j d } | j � | j | j d _ n | S( Nt singlet itemsu {c s s | ] } | j � Vq d S( N( t clone( t .0t n( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pys <genexpr>' s u }i����i i ( t getR t NodeR t listmakerR t replacet LeafR t LBRACEt extendt childrent appendt RBRACEt next_siblingt prefixt dictsetmakert lent remove( t selft nodet resultsR t fakeR t literalt makerR ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyt transform s"
( t __name__t
__module__t Truet
BM_compatiblet explicitt PATTERNR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyR s
N( t __doc__t lib2to3R R t lib2to3.fixer_utilR R t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyt <module> s fixes/fix_raw_input.pyc 0000644 00000001666 15053244255 0011273 0 ustar 00 �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s2 Fixer that changes raw_input(...) into input(...).i ( t
fixer_base( t Namet FixRawInputc B s e Z e Z d Z d � Z RS( sU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu inputt prefix( t replaceR R ( t selft nodet resultsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyt <module> s btm_utils.pyo 0000644 00000016613 15053244255 0007313 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z m Z d d l m Z m Z e Z e Z
e j Z e Z
d Z d Z d Z d e f d � � YZ d
d
� Z d � Z d � Z d
S( s0 Utility functions used by the btm_matcher modulei ( t pytree( t grammart token( t pattern_symbolst python_symbolsi����i����i����t MinNodec B sA e Z d Z d d d � Z d � Z d � Z d � Z d � Z RS( s� This class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatternsc C sC | | _ | | _ g | _ t | _ d | _ g | _ g | _ d S( N( t typet namet childrent Falset leaft Nonet parentt alternativest group( t selfR R ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt __init__ s c C s t | j � d t | j � S( Nt ( t strR R ( R ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt __repr__ s c C sU | } g } xB| rP| j t k r� | j j | � t | j � t | j � k r| t | j � g } g | _ | j } q q� | j } d } Pn | j t k r| j
j | � t | j
� t | j � k r� t | j
� } g | _
| j } q q| j } d } Pn | j t j
k r4| j r4| j | j � n | j | j � | j } q W| S( s� Internal method. Returns a characteristic path of the
pattern tree. This method must be run for all leaves until the
linear subpatterns are merged into a singleN( R t TYPE_ALTERNATIVESR
t appendt lenR t tupleR R t
TYPE_GROUPR t get_characteristic_subpatternt token_labelst NAMER ( R t nodet subp( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt leaf_to_root! s8
c C s1 x* | j � D] } | j � } | r
| Sq
Wd S( s� Drives the leaf_to_root method. The reason that
leaf_to_root must be run multiple times is because we need to
reject 'group' matches; for example the alternative form
(a | b c) creates a group [b c] that needs to be matched. Since
matching multiple linear patterns overcomes the automaton's
capabilities, leaf_to_root merges each group into a single
choice based on 'characteristic'ity,
i.e. (a|b c) -> (a|b) if b more characteristic than c
Returns: The most 'characteristic'(as defined by
get_characteristic_subpattern) path for the compiled pattern
tree.
N( t leavesR ( R t lR ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt get_linear_subpatternK s c c sE x- | j D]" } x | j � D] } | Vq Wq
W| j sA | Vn d S( s- Generator that returns the leaves of the treeN( R R ( R t childt x( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyR ` s
N( t __name__t
__module__t __doc__R R R R R! R ( ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyR s * c
C s d } | j t j k r( | j d } n | j t j k r� t | j � d k rh t | j d | � } q�t d t � } x�| j D]P } | j j
| � d r� q� n t | | � } | d k r� | j j | � q� q� Wn$| j t j k rxt | j � d k r_t d t
� } x9 | j D]. } t | | � } | r| j j | � qqW| j sud } quq�t | j d | � } n�| j t j k r�t | j d t j � r�| j d j d k r�t | j d | � St | j d t j � r�| j d j d k s=t | j � d k rAt | j d d � rA| j d j d k rAd St } d } d } t } d } t }
x� | j D]� } | j t j k r�t } | } n< | j t j k r�t } | } n | j t j k r�| } n t | d � ro| j d k rot }
qoqoW|
rA| j d } t | d � rN| j d k rN| j d } qNn
| j d } | j t j k r�| j d
k r�t d t � } qTt t | j � r�t d t t | j � � } qTt d t t | j � � } n� | j t j k r0| j j d � } | t k rt d t | � } qTt d t j d | � } n$ | j t j k rTt | | � } n | r�| j d j d
k ryd } q�| j d j d k r�q�t � n | r�| d k r�xI | j d d !D]4 } t | | � } | d k r�| j j | � q�q�Wq�n | r| | _! n | S( s�
Internal function. Reduces a compiled pattern tree to an
intermediate representation suitable for feeding the
automaton. This also trims off any optional pattern elements(like
[a], a*).
i i R i t (t [t valuet =i t anyt 'R t *t +i����N(" R R t symst MatcherR t AlternativesR t reduce_treeR R t indexR t AlternativeR t Unitt
isinstanceR t LeafR) t hasattrt TrueR t Detailst RepeaterR R t TYPE_ANYt getattrt pysymst STRINGt stript tokenst NotImplementedErrorR (
R R t new_nodeR" t reducedR
t details_nodet alternatives_nodet has_repeatert
repeater_nodet has_variable_namet name_leafR ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyR2 h s�
c s, t | t � s | St | � d k r- | d Sg } g } d d d d d g � g } d � x� | D]� } t t | d � � � ra t t | � f d
� � � r� | j | � q� t t | � f d � � � r� | j | � q� | j | � qa qa W| r� | } n | r
| } n | r | } n t | d t �S(
s� Picks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
i i t int fort ift notR s []().,:c S s t | � t k S( N( R R ( R# ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt <lambda>� t c s t | t � o | � k S( N( R6 R ( R# ( t common_chars( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyRO RP c s t | t � o | � k S( N( R6 R ( R# ( t common_names( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyRO RP t key( R6 t listR R+ t rec_testR t max( t subpatternst subpatterns_with_namest subpatterns_with_common_namest subpatterns_with_common_charst
subpattern( ( RQ RR s) /usr/lib64/python2.7/lib2to3/btm_utils.pyR � s2
c c sW xP | D]H } t | t t f � rD x* t | | � D] } | Vq2 Wq | | � Vq Wd S( sP Tests test_func on all items of sequence and items of included
sub-iterablesN( R6 RT R RU ( t sequencet test_funcR# t y( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyRU s
N( R& RP R t pgen2R R t pygramR R R/ R> t opmapRA R R< R R t objectR R R2 R RU ( ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt <module> s X � % pygram.pyc 0000644 00000002641 15053244255 0006570 0 ustar 00 �
{ fc @ s� d Z d d l Z d d l m Z d d l m Z d d l m Z e j j e j j e
� d � Z e j j e j j e
� d � Z d e
f d
� � YZ e j d e � Z e e � Z e j � Z e j d =e j d e � Z e e � Z d S(
s& Export the Python grammar and symbols.i����Ni ( t token( t driver( t pytrees Grammar.txts PatternGrammar.txtt Symbolsc B s e Z d � Z RS( c C s4 x- | j j � D] \ } } t | | | � q Wd S( s� Initializer.
Creates an attribute for each grammar symbol (nonterminal),
whose value is the symbol's type (an int >= 256).
N( t
symbol2numbert iteritemst setattr( t selft grammart namet symbol( ( s& /usr/lib64/python2.7/lib2to3/pygram.pyt __init__ s ( t __name__t
__module__R ( ( ( s& /usr/lib64/python2.7/lib2to3/pygram.pyR s t lib2to3t print( t __doc__t ost pgen2R R t R t patht joint dirnamet __file__t
_GRAMMAR_FILEt _PATTERN_GRAMMAR_FILEt objectR t load_packaged_grammart python_grammart python_symbolst copyt! python_grammar_no_print_statementt keywordst pattern_grammart pattern_symbols( ( ( s& /usr/lib64/python2.7/lib2to3/pygram.pyt <module> s !
refactor.pyo 0000644 00000056476 15053244255 0007131 0 ustar 00 �
{ fc @� s� d Z d d l m Z d Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l
Z
d d l m Z d d l
m Z m Z m Z d d l m Z d d l m Z m Z d d
l m Z d d l m Z e d � Z d
e f d � � YZ d � Z d � Z d � Z d � Z! e j" d d f k rgd d l# Z# e# j$ Z% d � Z& d � Z' n e$ Z% e! Z& e! Z' d � Z( d e f d � � YZ) d e* f d � � YZ+ d e f d � � YZ, d e+ f d � � YZ- d S( s� Refactoring framework.
Used as a main program, this can refactor any number of files and/or
recursively descend down directories. Imported as a module, this
provides infrastructure to write your own refactoring tool.
i����( t with_statements# Guido van Rossum <guido@python.org>N( t chaini ( t drivert tokenizet token( t find_root( t pytreet pygram( t btm_utils( t btm_matcherc C� sz t | g g d g � } g } xU t j | j � D]A \ } } } | j d � r1 | rb | d } n | j | � q1 q1 W| S( sE Return a sorted list of all available fix names in the given package.t *t fix_i ( t
__import__t pkgutilt iter_modulest __path__t
startswitht append( t fixer_pkgt
remove_prefixt pkgt fix_namest findert namet ispkg( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt get_all_fix_names" s "
t
_EveryNodec B� s e Z RS( ( t __name__t
__module__( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR . s c C� s� t | t j t j f � rC | j d k r3 t � n t | j g � St | t j � rt | j rk t
| j � St � n t | t j � r� t � } x5 | j D]* } x! | D] } | j t
| � � q� Wq� W| St
d | � � d S( sf Accepts a pytree Pattern Node and returns a set
of the pattern types which will match first. s$ Oh no! I don't understand pattern %sN( t
isinstanceR t NodePatternt LeafPatternt typet NoneR t sett NegatedPatternt contentt _get_head_typest WildcardPatternt updatet Exception( t patt rt pt x( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR% 2 s
c C� s t j t � } g } x� | D]� } | j r� y t | j � } Wn t k
r^ | j | � q� XxU | D] } | | j | � qf Wq | j d k r� | | j j | � q | j | � q Wx: t t
j j j
� t
j j � D] } | | j | � q� Wt | � S( s^ Accepts a list of fixers and returns a dictionary
of head node type --> fixer list. N( t collectionst defaultdictt listt patternR% R R t _accept_typeR! R R t python_grammart
symbol2numbert
itervaluest tokenst extendt dict( t
fixer_listt
head_nodest everyt fixert headst node_type( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _get_headnode_dictN s"
c C� s( g t | t � D] } | d | ^ q S( sN
Return the fully qualified names for fixers in the package pkg_name.
t .( R t False( t pkg_namet fix_name( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt get_fixers_from_packageg s c C� s | S( N( ( t obj( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _identityn s i i c C� s | j d d � S( Nu
u
( t replace( t input( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _from_system_newlinesu s c C� s* t j d k r" | j d t j � S| Sd S( Ns
u
( t ost linesepRF ( RG ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _to_system_newlinesw s c � s� t } t j t j | � j � � � f d � } t t j t j t j f � } t
� } ykxdt r�| � \ } } | | k r� q] q] | t j k r� | r� Pn t } q] | t j
k r�| d k r�| � \ } } | t j
k s� | d k r� Pn | � \ } } | t j
k s| d k r Pn | � \ } } | t j k rY| d k rY| � \ } } n xa | t j
k r�| j | � | � \ } } | t j k s�| d k r�Pn | � \ } } q\Wq] Pq] WWn t k
r�n Xt | � S( Nc � s � j � } | d | d f S( Ni i ( t next( t tok( t gen( s( /usr/lib64/python2.7/lib2to3/refactor.pyt advance� s u fromu
__future__u importu (u ,( R@ R t generate_tokenst StringIOt readlinet frozensetR t NEWLINEt NLt COMMENTR" t Truet STRINGt NAMEt OPt addt
StopIteration( t sourcet have_docstringRO t ignoret featurest tpt value( ( RN s( /usr/lib64/python2.7/lib2to3/refactor.pyt _detect_future_features� sD
t
FixerErrorc B� s e Z d Z RS( s A fixer could not be loaded.( R R t __doc__( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyRd � s t RefactoringToolc B� s! e Z i e d 6e d 6Z d Z d Z d d d � Z d � Z d � Z d � Z
d � Z d � Z e e d
� Z
e e d � Z d � Z e e d
� Z d � Z e d � Z d � Z d � Z d e d d � Z d d � Z d Z d Z d � Z d � Z d � Z d � Z d � Z d � Z RS( t print_functiont write_unchanged_filest FixR c C� s� | | _ | p g | _ | j j � | _ | d k rI | j j | � n | j d re t j | _ n t j
| _ | j j d � | _ g | _
t j d � | _ g | _ t | _ t j | j d t j d | j �| _ | j � \ | _ | _ g | _ t j � | _ g | _ g | _ x} t! | j | j � D]f } | j" rT| j j# | � q2| | j k rv| j j$ | � q2| | j k r2| j j$ | � q2q2Wt% | j � | _& t% | j � | _' d S( s� Initializer.
Args:
fixer_names: a list of fixers to import
options: a dict with configuration.
explicit: a list of fixers to run even if they are explicit.
Rg Rh Rf t convertt loggerN(( t fixerst explicitt _default_optionst copyt optionsR! R' R t! python_grammar_no_print_statementt grammarR2 t getRh t errorst loggingt getLoggerRk t fixer_logR@ t wroteR t DriverR Rj t
get_fixerst pre_ordert
post_ordert filest bmt
BottomMatchert BMt
bmi_pre_ordert bmi_post_orderR t
BM_compatiblet add_fixerR R> t bmi_pre_order_headst bmi_post_order_heads( t selft fixer_namesRp Rm R; ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt __init__� s<
c C� s� g } g } x�| j D]�} t | i i d g � } | j d d � d } | j | j � rr | t | j � } n | j d � } | j d j g | D] } | j � ^ q� � } y t
| | � } Wn' t k
r� t d | | f � � n X| | j
| j � }
|
j r?| j t k r?| | j k r?| j d | � q n | j d | � |
j d
k rn| j |
� q |
j d k r�| j |
� q t d |
j � � q Wt j d
� } | j d | � | j d | � | | f S( s Inspects the options to load the requested patterns and handlers.
Returns:
(pre_order, post_order), where pre_order is the list of fixers that
want a pre-order AST traversal, and post_order is the list that want
post-order traversal.
R
R? i i����t _t s Can't find %s.%ss Skipping optional fixer: %ss Adding transformation: %st pret posts Illegal fixer order: %rt run_ordert key( Rl R t rsplitR t FILE_PREFIXt lent splitt CLASS_PREFIXt joint titlet getattrt AttributeErrorRd Rp Rw Rm RW t log_messaget log_debugt orderR t operatort
attrgettert sort( R� t pre_order_fixerst post_order_fixerst fix_mod_patht modRB t partsR+ t
class_namet fix_classR; t key_func( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyRz � s8 /
c O� s � d S( s Called when an error occurs.N( ( R� t msgt argst kwds( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt log_error s c G� s' | r | | } n | j j | � d S( s Hook to log a message.N( Rk t info( R� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� s
c G� s' | r | | } n | j j | � d S( N( Rk t debug( R� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� s
c C� s d S( sT Called with the old version, new version, and filename of a
refactored file.N( ( R� t old_textt new_textt filenamet equal( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt print_output! s c C� sP xI | D]A } t j j | � r5 | j | | | � q | j | | | � q Wd S( s) Refactor a list of files and directories.N( RI t patht isdirt refactor_dirt
refactor_file( R� t itemst writet
doctests_onlyt dir_or_file( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt refactor& s
c C� s� t j d } x� t j | � D]� \ } } } | j d | � | j � | j � xe | D]] } | j d � rW t j j | � d | k rW t j j | | � } | j | | | � qW qW Wg | D] }
|
j d � s� |
^ q� | (q Wd S( s� Descends down a directory and refactor every Python file found.
Python files are assumed to have a .py extension.
Files and subdirectories starting with '.' are skipped.
t pys Descending into %sR? i N(
RI t extsept walkR� R� R R� t splitextR� R� ( R� t dir_nameR� R� t py_extt dirpatht dirnamest filenamesR t fullnamet dn( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� / s
c C� s� y t | d � } Wn' t k
r< } | j d | | � d SXz t j | j � d } Wd | j � Xt | d d | �� } t | j
� � | f SWd QXd S( sG
Do our best to decode a Python source file correctly.
t rbs Can't open %s: %si NR* t encoding( NN( t opent IOErrorR� R! R t detect_encodingRR t closet _open_with_encodingRH t read( R� R� t ft errR� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _read_python_sourceC s c C� s | j | � \ } } | d k r% d S| d 7} | r� | j d | � | j | | � } | j sl | | k r� | j | | | | | � q� | j d | � nc | j | | � } | j s� | r� | j r� | j t | � d | d | d | �n | j d | � d S( s Refactors a file.Nu
s Refactoring doctests in %ss No doctest changes in %si����R� R� s No changes in %s( R� R! R� t refactor_docstringRh t processed_filet refactor_stringt was_changedt unicode( R� R� R� R� RG R� t outputt tree( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� S s
c C� s� t | � } d | k r* t j | j _ n zM y | j j | � } Wn0 t k
ru } | j d | | j j | � d SXWd | j | j _ X| | _
| j d | � | j | | � | S( sF Refactor a given input string.
Args:
data: a string holding the code to be refactored.
name: a human-readable name for use in error/log messages.
Returns:
An AST corresponding to the refactored input stream; None if
there were errors during the parse.
Rg s Can't parse %s: %s: %sNs Refactoring %s(
Rc R Rq R Rr t parse_stringR( R� t __class__R t future_featuresR� t
refactor_tree( R� t dataR R` R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� j s c C� s� t j j � } | ro | j d � | j | d � } | j sI | | k r_ | j | d | � q� | j d � nS | j | d � } | j s� | r� | j r� | j t | � d | � n
| j d � d S( Ns Refactoring doctests in stdins <stdin>s No doctest changes in stdins No changes in stdin(
t syst stdinR� R� R� Rh R� R� R� R� ( R� R� RG R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt refactor_stdin� s
c
C� s� x- t | j | j � D] } | j | | � q W| j | j | j � � | j | j | j � � | j j | j � � } x�t
| j � � rcx�| j j D]�} | | k r� | | r� | | j
d t j j d t � | j r� | | j
d t j j � n x[t | | � D]F} | | | k r9| | j | � n y t | � Wn t k
r]qn X| j r|| | j k r|qn | j | � } | r| j | | � } | d k rU| j | � x9 | j � D]+ } | j s�g | _ n | j j | � q�W| j j | j � � } x? | D]4 } | | k r6g | | <n | | j | | � qWqUqqWq� q� Wq} Wx- t | j | j � D] } | j | | � qzW| j S( s� Refactors a parse tree (modifying the tree in place).
For compatible patterns the bottom matcher module is
used. Otherwise the tree is traversed node-to-node for
matches.
Args:
tree: a pytree.Node instance representing the root of the tree
to be refactored.
name: a human-readable name for this tree.
Returns:
True if the tree was modified, False otherwise.
R� t reverseN(! R R{ R| t
start_treet traverse_byR� R� R� t runt leavest anyt valuesRl R� R t Baset depthRW t keep_line_ordert
get_linenoR/ t removeR t
ValueErrort fixers_appliedt matcht transformR! RF R R6 t finish_treeR� (
R� R� R R; t match_sett nodet resultst newt new_matchest fxr( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � sJ
. c C� s� | s
d Sxr | D]j } xa | | j D]R } | j | � } | r% | j | | � } | d k rw | j | � | } qw q% q% Wq Wd S( s Traverse an AST, applying a set of fixers to each node.
This is a helper method for refactor_tree().
Args:
fixers: a list of fixer instances.
traversal: a generator that yields AST nodes.
Returns:
None
N( R R� R� R! RF ( R� Rl t traversalR� R; R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s
c C� s� | j j | � | d k rB | j | � d } | d k rB d Sn | | k } | j | | | | � | r� | j d | � | j s� d Sn | r� | j | | | | � n | j d | � d S( sR
Called when a file has been refactored and there may be changes.
i Ns No changes to %ss Not writing changes to %s( R} R R! R� R� R� Rh t
write_file( R� R� R� R� R� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s c C� s� y t | d d | �} Wn* t j k
rE } | j d | | � d SXzG y | j t | � � Wn) t j k
r� } | j d | | � n XWd | j � X| j d | � t | _ d S( s� Writes a string to a file.
It first shows a unified diff between the old text and the new text, and
then rewrites the file; the latter is only done if the write option is
set.
t wR� s Can't create %s: %sNs Can't write %s: %ss Wrote changes to %s(
R� RI t errorR� R� RK R� R� RW Rx ( R� R� R� R� R� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� s s >>> s ... c
C� s� g } d } d } d } d } x+| j t � D]} | d 7} | j � j | j � r� | d k r� | j | j | | | | � � n | } | g } | j | j � } | | } q. | d k r| j | | j � s� | | | j j
� d k r| j | � q. | d k r/| j | j | | | | � � n d } d } | j | � q. W| d k rz| j | j | | | | � � n d j | � S( s� Refactors a docstring, looking for doctests.
This returns a modified version of the input string. It looks
for doctests, which start with a ">>>" prompt, and may be
continued with "..." prompts, as long as the "..." is indented
the same as the ">>>".
(Unfortunately we can't use the doctest module's parser,
since, like most parsers, it is not geared towards preserving
the original source.)
i i u
u N(
R! t
splitlinesRW t lstripR t PS1R6 t refactor_doctestt findt PS2t rstripR R� (
R� RG R� t resultt blockt block_linenot indentt linenot linet i( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� ( s:
c
C� sP y | j | | | � } Wnu t k
r� } | j j t j � rm x* | D] } | j d | j d � � qG Wn | j d | | | j j
| � | SX| j | | � rLt | � j
t � } | | d | | d } } | d j d � s� | d c d 7<n | | j | j d � g } | rL| g | D] } | | j | ^ q(7} qLn | S( s� Refactors one doctest.
A doctest is given as a block of lines, the first of which starts
with ">>>" (possibly indented), while the remaining lines start
with "..." (identically indented).
s
Source: %su
s+ Can't parse docstring in %s line %s: %s: %si i����i ( t parse_blockR( Rk t isEnabledForRu t DEBUGR� R R� R� R R� R� R� RW t endswithR� t popR (
R� R R R R� R� R� R R� t clipped( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� S s$
.c C� s | j r d } n d } | j s4 | j d | � n1 | j d | � x | j D] } | j | � qN W| j r� | j d � x! | j D] } | j | � q� Wn | j rt | j � d k r� | j d � n | j d t | j � � x0 | j D]" \ } } } | j | | | � q� Wn d S( Nt weres
need to bes No files %s modified.s Files that %s modified:s$ Warnings/messages while refactoring:i s There was 1 error:s There were %d errors:( Rx R} R� Rw Rt R� ( R� R t filet messageR� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt summarizep s$
c C� s1 | j j | j | | | � � } t � | _ | S( s� Parses a block into a tree.
This is necessary to get correct line number / offset information
in the parser diagnostics and embedded into the parse tree.
( R t parse_tokenst wrap_toksRS R� ( R� R R R R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s ! c c� s� t j | j | | � j � } xe | D]] \ } } \ } } \ } }
} | | d 7} | | d 7} | | | | f | |
f | f Vq% Wd S( s; Wraps a tokenize stream to systematically modify start/end.i N( R RP t gen_linesRL ( R� R R R R5 R Rb t line0t col0t line1t col1t line_text( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s
(c c� s� | | j } | | j } | } xi | D]a } | j | � rN | t | � Vn4 | | j � d k rl d Vn t d | | f � � | } q' Wx t r� d Vq� Wd S( s� Generates lines as expected by tokenize from a list of lines.
This strips the first len(indent + self.PS1) characters off each line.
u
s line=%r, prefix=%rR� N( R� R R R� R t AssertionErrorRW ( R� R R t prefix1t prefix2t prefixR ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s
N( R R R@ Rn R� R� R! R� Rz R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R R� R� R R R R ( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyRf � s:
4 ( O +
t MultiprocessingUnsupportedc B� s e Z RS( ( R R ( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s t MultiprocessRefactoringToolc B� s5 e Z d � Z e e d d � Z d � Z d � Z RS( c O� s/ t t | � j | | � d | _ d | _ d S( N( t superR R� R! t queuet output_lock( R� R� t kwargs( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s i c C� sf | d k r( t t | � j | | | � Sy d d l } Wn t k
rQ t � n X| j d k rp t d � � n | j � | _ | j
� | _ g t | � D] } | j
d | j � ^ q� } z; x | D] } | j � q� Wt t | � j | | | � Wd | j j � x$ t | � D] } | j j d � qWx' | D] } | j � r5| j � q5q5Wd | _ Xd S( Ni i����s already doing multiple processest target( R! R R� t multiprocessingt ImportErrorR R" R! t RuntimeErrort
JoinableQueuet LockR# t xranget Processt _childt startR� t putt is_alive( R� R� R� R� t
num_processesR& R t processesR+ ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s2
+
c C� so | j j � } xY | d k rj | \ } } z t t | � j | | � Wd | j j � X| j j � } q Wd S( N( R" Rs R! R! R R� t task_done( R� t taskR� R$ ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR- � s c O� sE | j d k r( | j j | | f � n t t | � j | | � Sd S( N( R" R! R/ R! R R� ( R� R� R$ ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s ( R R R� R@ R� R- R� ( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s
(. Re t
__future__R t
__author__RI R
R� Ru R� R- RQ t itertoolsR t pgen2R R R t
fixer_utilR R� R R R t buR R~ RW R R( R R% R> RC RE t version_infot codecsR� R� RH RK Rc Rd t objectRf R R ( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt <module> sH (� � btm_utils.pyc 0000644 00000016613 15053244255 0007277 0 ustar 00 �
{ fc @ s� d Z d d l m Z d d l m Z m Z d d l m Z m Z e Z e Z
e j Z e Z
d Z d Z d Z d e f d � � YZ d
d
� Z d � Z d � Z d
S( s0 Utility functions used by the btm_matcher modulei ( t pytree( t grammart token( t pattern_symbolst python_symbolsi����i����i����t MinNodec B sA e Z d Z d d d � Z d � Z d � Z d � Z d � Z RS( s� This class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatternsc C sC | | _ | | _ g | _ t | _ d | _ g | _ g | _ d S( N( t typet namet childrent Falset leaft Nonet parentt alternativest group( t selfR R ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt __init__ s c C s t | j � d t | j � S( Nt ( t strR R ( R ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt __repr__ s c C sU | } g } xB| rP| j t k r� | j j | � t | j � t | j � k r| t | j � g } g | _ | j } q q� | j } d } Pn | j t k r| j
j | � t | j
� t | j � k r� t | j
� } g | _
| j } q q| j } d } Pn | j t j
k r4| j r4| j | j � n | j | j � | j } q W| S( s� Internal method. Returns a characteristic path of the
pattern tree. This method must be run for all leaves until the
linear subpatterns are merged into a singleN( R t TYPE_ALTERNATIVESR
t appendt lenR t tupleR R t
TYPE_GROUPR t get_characteristic_subpatternt token_labelst NAMER ( R t nodet subp( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt leaf_to_root! s8
c C s1 x* | j � D] } | j � } | r
| Sq
Wd S( s� Drives the leaf_to_root method. The reason that
leaf_to_root must be run multiple times is because we need to
reject 'group' matches; for example the alternative form
(a | b c) creates a group [b c] that needs to be matched. Since
matching multiple linear patterns overcomes the automaton's
capabilities, leaf_to_root merges each group into a single
choice based on 'characteristic'ity,
i.e. (a|b c) -> (a|b) if b more characteristic than c
Returns: The most 'characteristic'(as defined by
get_characteristic_subpattern) path for the compiled pattern
tree.
N( t leavesR ( R t lR ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt get_linear_subpatternK s c c sE x- | j D]" } x | j � D] } | Vq Wq
W| j sA | Vn d S( s- Generator that returns the leaves of the treeN( R R ( R t childt x( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyR ` s
N( t __name__t
__module__t __doc__R R R R R! R ( ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyR s * c
C s d } | j t j k r( | j d } n | j t j k r� t | j � d k rh t | j d | � } q�t d t � } x�| j D]P } | j j
| � d r� q� n t | | � } | d k r� | j j | � q� q� Wn$| j t j k rxt | j � d k r_t d t
� } x9 | j D]. } t | | � } | r| j j | � qqW| j sud } quq�t | j d | � } n�| j t j k r�t | j d t j � r�| j d j d k r�t | j d | � St | j d t j � r�| j d j d k s=t | j � d k rAt | j d d � rA| j d j d k rAd St } d } d } t } d } t }
x� | j D]� } | j t j k r�t } | } n< | j t j k r�t } | } n | j t j k r�| } n t | d � ro| j d k rot }
qoqoW|
rA| j d } t | d � rN| j d k rN| j d } qNn
| j d } | j t j k r�| j d
k r�t d t � } qTt t | j � r�t d t t | j � � } qTt d t t | j � � } n� | j t j k r0| j j d � } | t k rt d t | � } qTt d t j d | � } n$ | j t j k rTt | | � } n | r�| j d j d
k ryd } q�| j d j d k r�q�t � n | r�| d k r�xI | j d d !D]4 } t | | � } | d k r�| j j | � q�q�Wq�n | r| | _! n | S( s�
Internal function. Reduces a compiled pattern tree to an
intermediate representation suitable for feeding the
automaton. This also trims off any optional pattern elements(like
[a], a*).
i i R i t (t [t valuet =i t anyt 'R t *t +i����N(" R R t symst MatcherR t AlternativesR t reduce_treeR R t indexR t AlternativeR t Unitt
isinstanceR t LeafR) t hasattrt TrueR t Detailst RepeaterR R t TYPE_ANYt getattrt pysymst STRINGt stript tokenst NotImplementedErrorR (
R R t new_nodeR" t reducedR
t details_nodet alternatives_nodet has_repeatert
repeater_nodet has_variable_namet name_leafR ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyR2 h s�
c s, t | t � s | St | � d k r- | d Sg } g } d d d d d g � g } d � x� | D]� } t t | d � � � ra t t | � f d
� � � r� | j | � q� t t | � f d � � � r� | j | � q� | j | � qa qa W| r� | } n | r
| } n | r | } n t | d t �S(
s� Picks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
i i t int fort ift notR s []().,:c S s t | � t k S( N( R R ( R# ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt <lambda>� t c s t | t � o | � k S( N( R6 R ( R# ( t common_chars( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyRO RP c s t | t � o | � k S( N( R6 R ( R# ( t common_names( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyRO RP t key( R6 t listR R+ t rec_testR t max( t subpatternst subpatterns_with_namest subpatterns_with_common_namest subpatterns_with_common_charst
subpattern( ( RQ RR s) /usr/lib64/python2.7/lib2to3/btm_utils.pyR � s2
c c sW xP | D]H } t | t t f � rD x* t | | � D] } | Vq2 Wq | | � Vq Wd S( sP Tests test_func on all items of sequence and items of included
sub-iterablesN( R6 RT R RU ( t sequencet test_funcR# t y( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyRU s
N( R& RP R t pgen2R R t pygramR R R/ R> t opmapRA R R< R R t objectR R R2 R RU ( ( ( s) /usr/lib64/python2.7/lib2to3/btm_utils.pyt <module> s X � % pygram.pyo 0000644 00000002641 15053244255 0006604 0 ustar 00 �
{ fc @ s� d Z d d l Z d d l m Z d d l m Z d d l m Z e j j e j j e
� d � Z e j j e j j e
� d � Z d e
f d
� � YZ e j d e � Z e e � Z e j � Z e j d =e j d e � Z e e � Z d S(
s& Export the Python grammar and symbols.i����Ni ( t token( t driver( t pytrees Grammar.txts PatternGrammar.txtt Symbolsc B s e Z d � Z RS( c C s4 x- | j j � D] \ } } t | | | � q Wd S( s� Initializer.
Creates an attribute for each grammar symbol (nonterminal),
whose value is the symbol's type (an int >= 256).
N( t
symbol2numbert iteritemst setattr( t selft grammart namet symbol( ( s& /usr/lib64/python2.7/lib2to3/pygram.pyt __init__ s ( t __name__t
__module__R ( ( ( s& /usr/lib64/python2.7/lib2to3/pygram.pyR s t lib2to3t print( t __doc__t ost pgen2R R t R t patht joint dirnamet __file__t
_GRAMMAR_FILEt _PATTERN_GRAMMAR_FILEt objectR t load_packaged_grammart python_grammart python_symbolst copyt! python_grammar_no_print_statementt keywordst pattern_grammart pattern_symbols( ( ( s& /usr/lib64/python2.7/lib2to3/pygram.pyt <module> s !
main.pyo 0000644 00000023075 15053244255 0006235 0 ustar 00 �
{ fc @� s� d Z d d l m Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l m
Z
d � Z d e
j f d � � YZ
d � Z d d
� Z d S( s
Main program for 2to3.
i����( t with_statementNi ( t refactorc C� s: | j � } | j � } t j | | | | d d d d �S( s% Return a unified diff of two strings.s
(original)s (refactored)t linetermt ( t
splitlinest difflibt unified_diff( t at bt filename( ( s$ /usr/lib64/python2.7/lib2to3/main.pyt
diff_texts s
t StdoutRefactoringToolc B� s; e Z d Z d d d d � Z d � Z d � Z d � Z RS( s2
A refactoring tool that can avoid overwriting its input files.
Prints output to stdout.
Output files can optionally be written to a different directory and or
have an extra file suffix appended to their name for use in situations
where you do not want to replace the input files.
R c C� sv | | _ | | _ | r; | j t j � r; | t j 7} n | | _ | | _ | | _ t t | � j
| | | � d S( sF
Args:
fixers: A list of fixers to import.
options: A dict with RefactoringTool configuration.
explicit: A list of fixers to run even if they are explicit.
nobackups: If true no backup '.bak' files will be created for those
files that are being refactored.
show_diffs: Should diffs of the refactoring be printed to stdout?
input_base_dir: The base directory for all input files. This class
will strip this path prefix off of filenames before substituting
it with output_dir. Only meaningful if output_dir is supplied.
All files processed by refactor() must start with this path.
output_dir: If supplied, all converted files will be written into
this directory tree instead of input_base_dir.
append_suffix: If supplied, all files output by this tool will have
this appended to their filename. Useful for changing .py to
.py3 for example by passing append_suffix='3'.
N( t nobackupst
show_diffst endswitht ost sept _input_base_dirt _output_dirt _append_suffixt superR t __init__( t selft fixerst optionst explicitR R
t input_base_dirt
output_dirt
append_suffix( ( s$ /usr/lib64/python2.7/lib2to3/main.pyR $ s c O� s3 | j j | | | f � | j j | | | � d S( N( t errorst appendt loggert error( R t msgt argst kwargs( ( s$ /usr/lib64/python2.7/lib2to3/main.pyt log_errorA s c
C� s� | } | j re | j | j � rI t j j | j | t | j � � } qe t d | | j f � � n | j r~ | | j 7} n | | k r� t j j | � } t j j
| � s� t j | � n | j d | | � n | j
sy| d } t j j | � r6y t j | � Wq6t j k
r2} | j d | � q6Xn y t j | | � Wqyt j k
ru} | j d | | � qyXn t t | � j } | | | | | � | j
s�t j | | � n | | k r�t j | | � n d S( Ns5 filename %s does not start with the input_base_dir %ss Writing converted %s to %s.s .baks Can't remove backup %ss Can't rename %s to %s( R t
startswithR R t patht joint lent
ValueErrorR t dirnamet isdirt makedirst log_messageR t lexistst removeR t renameR R t
write_filet shutilt copymode(
R t new_textR t old_textt encodingt
orig_filenameR t backupt errt write( ( s$ /usr/lib64/python2.7/lib2to3/main.pyR1 E s@
c C� s� | r | j d | � n� | j d | � | j r� t | | | � } y_ | j d k r� | j �( x | D] } | GHqg Wt j j � Wd QXn x | D] } | GHq� WWq� t k
r� t d | f � d SXn d S( Ns No changes to %ss
Refactored %ss+ couldn't encode %s's diff for your terminal(
R- R
R
t output_lockt Nonet syst stdoutt flusht UnicodeEncodeErrort warn( R t oldt newR t equalt
diff_linest line( ( s$ /usr/lib64/python2.7/lib2to3/main.pyt print_outputl s"
( t __name__t
__module__t __doc__R R$ R1 RG ( ( ( s$ /usr/lib64/python2.7/lib2to3/main.pyR s
'c C� s t j d | f IJd S( Ns WARNING: %s( R= t stderr( R! ( ( s$ /usr/lib64/python2.7/lib2to3/main.pyRA � s c � s� t j d d � } | j d d d d d d �| j d d
d d d g d d
�| j d d d d d d d d d d �| j d d d d d g d d �| j d d d d d d �| j d d d d d d �| j d d d d d d �| j d! d d d d" �| j d# d$ d d d d% �| j d& d' d d d t d d( �| j d) d* d d d d+ d d, d d- �| j d. d/ d d d d0 �| j d1 d d d d+ d d, d d2 �t } i } | j | � \ } } | j rt | d3 <| j s�t d4 � n t | _ n | j r'| j
r'| j d5 � n | j rJ| j
rJ| j d6 � n | j rj| j
rjt d7 � n | j r�| j
r�| j d8 � n | j r�d9 GHx t j � � D] } | GHq�W| s�d: Sn | s�t j d; IJt j d< IJd= Sd> | k rt } | j rt j d? IJd= Sn | j r0t | d@ <n | j rBt j n t j } t j dA dB dC | � t j dD � } t t j � � � } t � f dE � | j D� � }
t � } | j rt } x; | j D]0 }
|
dF k r�t } q�| j � dG |
� q�W| r| j | � n | } n | j | � } | j |
� } t! j" j# | � } | r�| j$ t! j% � r�t! j" j& | � r�t! j" j' | � } n | j r�| j( t! j% � } | j) dH | j | � n t* t+ | � | t+ | � | j
| j
dI | dJ | j dK | j �} | j, sq| r | j- � nH y# | j | | j | j. | j/ � Wn" t j0 k
rct j dL IJd SX| j1 � n t2 t3 | j, � � S(M s� Main program.
Args:
fixer_pkg: the name of a package where the fixers are located.
args: optional; a list of command line arguments. If omitted,
sys.argv[1:] is used.
Returns a suggested exit status (0, 1, 2).
t usages 2to3 [options] file|dir ...s -ds --doctests_onlyt actiont
store_truet helps Fix up doctests onlys -fs --fixR t defaults1 Each FIX specifies a transformation; default: alls -js --processest storei t typet ints Run 2to3 concurrentlys -xs --nofixs' Prevent a transformation from being runs -ls --list-fixess List available transformationss -ps --print-functions0 Modify the grammar so that print() is a functions -vs --verboses More verbose loggings
--no-diffss# Don't show diffs of the refactorings -ws --writes Write back modified filess -ns --nobackupss& Don't write backups for modified filess -os --output-dirt strR sX Put output files in this directory instead of overwriting the input files. Requires -n.s -Ws --write-unchanged-filessY Also write files even if no changes were required (useful with --output-dir); implies -w.s --add-suffixsu Append this string to all output filenames. Requires -n if non-empty. ex: --add-suffix='3' will generate .py3 files.t write_unchanged_filess& --write-unchanged-files/-W implies -w.s% Can't use --output-dir/-o without -n.s" Can't use --add-suffix without -n.s@ not writing files and not printing diffs; that's not very usefuls Can't use -n without -ws2 Available transformations for the -f/--fix option:i s1 At least one file or directory argument required.s Use --help to show usage.i t -s Can't write to stdin.t print_functiont formats %(name)s: %(message)st levels lib2to3.mainc 3� s | ] } � d | Vq d S( s .fix_N( ( t .0t fix( t fixer_pkg( s$ /usr/lib64/python2.7/lib2to3/main.pys <genexpr>� s t alls .fix_s7 Output in %r will mirror the input directory %r layout.R R R s+ Sorry, -j isn't supported on this platform.(4 t optparset OptionParsert
add_optiont Falset
parse_argsRU t TrueR: RA R R R t
add_suffixt no_diffst
list_fixesR t get_all_fix_namesR= RK RW t verboset loggingt DEBUGt INFOt basicConfigt getLoggert sett get_fixers_from_packaget nofixR[ t addt uniont
differenceR R& t commonprefixR R R+ R* t rstript infoR t sortedR t refactor_stdint
doctests_onlyt processest MultiprocessingUnsupportedt summarizeRS t bool( R\ R" t parserRx t flagsR t fixnameRY R t avail_fixest unwanted_fixesR t all_presentR[ t requestedt fixer_namesR t rt( ( R\ s$ /usr/lib64/python2.7/lib2to3/main.pyt main� s�
( RJ t
__future__R R= R R Ri R2 R^ R R R
t MultiprocessRefactoringToolR RA R< R� ( ( ( s$ /usr/lib64/python2.7/lib2to3/main.pyt <module> s h __main__.pyo 0000644 00000000362 15053244255 0007023 0 ustar 00 �
{ fc @ s3 d d l Z d d l m Z e j e d � � d S( i����Ni ( t mains
lib2to3.fixes( t sysR t exit( ( ( s( /usr/lib64/python2.7/lib2to3/__main__.pyt <module> s __init__.pyo 0000644 00000000177 15053244255 0007046 0 ustar 00 �
{ fc @ s d S( N( ( ( ( s( /usr/lib64/python2.7/lib2to3/__init__.pyt <module> t refactor.pyc 0000644 00000056550 15053244255 0007106 0 ustar 00 �
{ fc @� s� d Z d d l m Z d Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l
Z
d d l m Z d d l
m Z m Z m Z d d l m Z d d l m Z m Z d d
l m Z d d l m Z e d � Z d
e f d � � YZ d � Z d � Z d � Z d � Z! e j" d d f k rgd d l# Z# e# j$ Z% d � Z& d � Z' n e$ Z% e! Z& e! Z' d � Z( d e f d � � YZ) d e* f d � � YZ+ d e f d � � YZ, d e+ f d � � YZ- d S( s� Refactoring framework.
Used as a main program, this can refactor any number of files and/or
recursively descend down directories. Imported as a module, this
provides infrastructure to write your own refactoring tool.
i����( t with_statements# Guido van Rossum <guido@python.org>N( t chaini ( t drivert tokenizet token( t find_root( t pytreet pygram( t btm_utils( t btm_matcherc C� sz t | g g d g � } g } xU t j | j � D]A \ } } } | j d � r1 | rb | d } n | j | � q1 q1 W| S( sE Return a sorted list of all available fix names in the given package.t *t fix_i ( t
__import__t pkgutilt iter_modulest __path__t
startswitht append( t fixer_pkgt
remove_prefixt pkgt fix_namest findert namet ispkg( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt get_all_fix_names" s "
t
_EveryNodec B� s e Z RS( ( t __name__t
__module__( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR . s c C� s� t | t j t j f � rC | j d k r3 t � n t | j g � St | t j � rt | j rk t
| j � St � n t | t j � r� t � } x5 | j D]* } x! | D] } | j t
| � � q� Wq� W| St
d | � � d S( sf Accepts a pytree Pattern Node and returns a set
of the pattern types which will match first. s$ Oh no! I don't understand pattern %sN( t
isinstanceR t NodePatternt LeafPatternt typet NoneR t sett NegatedPatternt contentt _get_head_typest WildcardPatternt updatet Exception( t patt rt pt x( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR% 2 s
c C� s t j t � } g } x� | D]� } | j r� y t | j � } Wn t k
r^ | j | � q� XxU | D] } | | j | � qf Wq | j d k r� | | j j | � q | j | � q Wx: t t
j j j
� t
j j � D] } | | j | � q� Wt | � S( s^ Accepts a list of fixers and returns a dictionary
of head node type --> fixer list. N( t collectionst defaultdictt listt patternR% R R t _accept_typeR! R R t python_grammart
symbol2numbert
itervaluest tokenst extendt dict( t
fixer_listt
head_nodest everyt fixert headst node_type( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _get_headnode_dictN s"
c C� s( g t | t � D] } | d | ^ q S( sN
Return the fully qualified names for fixers in the package pkg_name.
t .( R t False( t pkg_namet fix_name( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt get_fixers_from_packageg s c C� s | S( N( ( t obj( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _identityn s i i c C� s | j d d � S( Nu
u
( t replace( t input( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _from_system_newlinesu s c C� s* t j d k r" | j d t j � S| Sd S( Ns
u
( t ost linesepRF ( RG ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _to_system_newlinesw s c � s� t } t j t j | � j � � � f d � } t t j t j t j f � } t
� } ykxdt r�| � \ } } | | k r� q] q] | t j k r� | r� Pn t } q] | t j
k r�| d k r�| � \ } } | t j
k s� | d k r� Pn | � \ } } | t j
k s| d k r Pn | � \ } } | t j k rY| d k rY| � \ } } n xa | t j
k r�| j | � | � \ } } | t j k s�| d k r�Pn | � \ } } q\Wq] Pq] WWn t k
r�n Xt | � S( Nc � s � j � } | d | d f S( Ni i ( t next( t tok( t gen( s( /usr/lib64/python2.7/lib2to3/refactor.pyt advance� s u fromu
__future__u importu (u ,( R@ R t generate_tokenst StringIOt readlinet frozensetR t NEWLINEt NLt COMMENTR" t Truet STRINGt NAMEt OPt addt
StopIteration( t sourcet have_docstringRO t ignoret featurest tpt value( ( RN s( /usr/lib64/python2.7/lib2to3/refactor.pyt _detect_future_features� sD
t
FixerErrorc B� s e Z d Z RS( s A fixer could not be loaded.( R R t __doc__( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyRd � s t RefactoringToolc B� s! e Z i e d 6e d 6Z d Z d Z d d d � Z d � Z d � Z d � Z
d � Z d � Z e e d
� Z
e e d � Z d � Z e e d
� Z d � Z e d � Z d � Z d � Z d e d d � Z d d � Z d Z d Z d � Z d � Z d � Z d � Z d � Z d � Z RS( t print_functiont write_unchanged_filest FixR c C� s� | | _ | p g | _ | j j � | _ | d k rI | j j | � n | j d re t j | _ n t j
| _ | j j d � | _ g | _
t j d � | _ g | _ t | _ t j | j d t j d | j �| _ | j � \ | _ | _ g | _ t j � | _ g | _ g | _ x} t! | j | j � D]f } | j" rT| j j# | � q2| | j k rv| j j$ | � q2| | j k r2| j j$ | � q2q2Wt% | j � | _& t% | j � | _' d S( s� Initializer.
Args:
fixer_names: a list of fixers to import
options: a dict with configuration.
explicit: a list of fixers to run even if they are explicit.
Rg Rh Rf t convertt loggerN(( t fixerst explicitt _default_optionst copyt optionsR! R' R t! python_grammar_no_print_statementt grammarR2 t getRh t errorst loggingt getLoggerRk t fixer_logR@ t wroteR t DriverR Rj t
get_fixerst pre_ordert
post_ordert filest bmt
BottomMatchert BMt
bmi_pre_ordert bmi_post_orderR t
BM_compatiblet add_fixerR R> t bmi_pre_order_headst bmi_post_order_heads( t selft fixer_namesRp Rm R; ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt __init__� s<
c C� s� g } g } x�| j D]�} t | i i d g � } | j d d � d } | j | j � rr | t | j � } n | j d � } | j d j g | D] } | j � ^ q� � } y t
| | � } Wn' t k
r� t d | | f � � n X| | j
| j � }
|
j r?| j t k r?| | j k r?| j d | � q n | j d | � |
j d
k rn| j |
� q |
j d k r�| j |
� q t d |
j � � q Wt j d
� } | j d | � | j d | � | | f S( s Inspects the options to load the requested patterns and handlers.
Returns:
(pre_order, post_order), where pre_order is the list of fixers that
want a pre-order AST traversal, and post_order is the list that want
post-order traversal.
R
R? i i����t _t s Can't find %s.%ss Skipping optional fixer: %ss Adding transformation: %st pret posts Illegal fixer order: %rt run_ordert key( Rl R t rsplitR t FILE_PREFIXt lent splitt CLASS_PREFIXt joint titlet getattrt AttributeErrorRd Rp Rw Rm RW t log_messaget log_debugt orderR t operatort
attrgettert sort( R� t pre_order_fixerst post_order_fixerst fix_mod_patht modRB t partsR+ t
class_namet fix_classR; t key_func( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyRz � s8 /
c O� s � d S( s Called when an error occurs.N( ( R� t msgt argst kwds( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt log_error s c G� s' | r | | } n | j j | � d S( s Hook to log a message.N( Rk t info( R� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� s
c G� s' | r | | } n | j j | � d S( N( Rk t debug( R� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� s
c C� s d S( sT Called with the old version, new version, and filename of a
refactored file.N( ( R� t old_textt new_textt filenamet equal( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt print_output! s c C� sP xI | D]A } t j j | � r5 | j | | | � q | j | | | � q Wd S( s) Refactor a list of files and directories.N( RI t patht isdirt refactor_dirt
refactor_file( R� t itemst writet
doctests_onlyt dir_or_file( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt refactor& s
c C� s� t j d } x� t j | � D]� \ } } } | j d | � | j � | j � xe | D]] } | j d � rW t j j | � d | k rW t j j | | � } | j | | | � qW qW Wg | D] }
|
j d � s� |
^ q� | (q Wd S( s� Descends down a directory and refactor every Python file found.
Python files are assumed to have a .py extension.
Files and subdirectories starting with '.' are skipped.
t pys Descending into %sR? i N(
RI t extsept walkR� R� R R� t splitextR� R� ( R� t dir_nameR� R� t py_extt dirpatht dirnamest filenamesR t fullnamet dn( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� / s
c C� s� y t | d � } Wn' t k
r< } | j d | | � d SXz t j | j � d } Wd | j � Xt | d d | �� } t | j
� � | f SWd QXd S( sG
Do our best to decode a Python source file correctly.
t rbs Can't open %s: %si NR* t encoding( NN( t opent IOErrorR� R! R t detect_encodingRR t closet _open_with_encodingRH t read( R� R� t ft errR� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt _read_python_sourceC s c C� s | j | � \ } } | d k r% d S| d 7} | r� | j d | � | j | | � } | j sl | | k r� | j | | | | | � q� | j d | � nc | j | | � } | j s� | r� | j r� | j t | � d | d | d | �n | j d | � d S( s Refactors a file.Nu
s Refactoring doctests in %ss No doctest changes in %si����R� R� s No changes in %s( R� R! R� t refactor_docstringRh t processed_filet refactor_stringt was_changedt unicode( R� R� R� R� RG R� t outputt tree( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� S s
c C� s� t | � } d | k r* t j | j _ n zM y | j j | � } Wn0 t k
ru } | j d | | j j | � d SXWd | j | j _ X| | _
| j d | � | j | | � | S( sF Refactor a given input string.
Args:
data: a string holding the code to be refactored.
name: a human-readable name for use in error/log messages.
Returns:
An AST corresponding to the refactored input stream; None if
there were errors during the parse.
Rg s Can't parse %s: %s: %sNs Refactoring %s(
Rc R Rq R Rr t parse_stringR( R� t __class__R t future_featuresR� t
refactor_tree( R� t dataR R` R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� j s c C� s� t j j � } | ro | j d � | j | d � } | j sI | | k r_ | j | d | � q� | j d � nS | j | d � } | j s� | r� | j r� | j t | � d | � n
| j d � d S( Ns Refactoring doctests in stdins <stdin>s No doctest changes in stdins No changes in stdin(
t syst stdinR� R� R� Rh R� R� R� R� ( R� R� RG R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt refactor_stdin� s
c
C� s� x- t | j | j � D] } | j | | � q W| j | j | j � � | j | j | j � � | j j | j � � } x�t
| j � � rcx�| j j D]�} | | k r� | | r� | | j
d t j j d t � | j r� | | j
d t j j � n x[t | | � D]F} | | | k r9| | j | � n y t | � Wn t k
r]qn X| j r|| | j k r|qn | j | � } | r| j | | � } | d k rU| j | � x9 | j � D]+ } | j s�g | _ n | j j | � q�W| j j | j � � } x? | D]4 } | | k r6g | | <n | | j | | � qWqUqqWq� q� Wq} Wx- t | j | j � D] } | j | | � qzW| j S( s� Refactors a parse tree (modifying the tree in place).
For compatible patterns the bottom matcher module is
used. Otherwise the tree is traversed node-to-node for
matches.
Args:
tree: a pytree.Node instance representing the root of the tree
to be refactored.
name: a human-readable name for this tree.
Returns:
True if the tree was modified, False otherwise.
R� t reverseN(! R R{ R| t
start_treet traverse_byR� R� R� t runt leavest anyt valuesRl R� R t Baset depthRW t keep_line_ordert
get_linenoR/ t removeR t
ValueErrort fixers_appliedt matcht transformR! RF R R6 t finish_treeR� (
R� R� R R; t match_sett nodet resultst newt new_matchest fxr( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � sJ
. c C� s� | s
d Sxr | D]j } xa | | j D]R } | j | � } | r% | j | | � } | d k rw | j | � | } qw q% q% Wq Wd S( s Traverse an AST, applying a set of fixers to each node.
This is a helper method for refactor_tree().
Args:
fixers: a list of fixer instances.
traversal: a generator that yields AST nodes.
Returns:
None
N( R R� R� R! RF ( R� Rl t traversalR� R; R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s
c C� s� | j j | � | d k rB | j | � d } | d k rB d Sn | | k } | j | | | | � | r� | j d | � | j s� d Sn | r� | j | | | | � n | j d | � d S( sR
Called when a file has been refactored and there may be changes.
i Ns No changes to %ss Not writing changes to %s( R} R R! R� R� R� Rh t
write_file( R� R� R� R� R� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s c C� s� y t | d d | �} Wn* t j k
rE } | j d | | � d SXzG y | j t | � � Wn) t j k
r� } | j d | | � n XWd | j � X| j d | � t | _ d S( s� Writes a string to a file.
It first shows a unified diff between the old text and the new text, and
then rewrites the file; the latter is only done if the write option is
set.
t wR� s Can't create %s: %sNs Can't write %s: %ss Wrote changes to %s(
R� RI t errorR� R� RK R� R� RW Rx ( R� R� R� R� R� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� s s >>> s ... c
C� s� g } d } d } d } d } x+| j t � D]} | d 7} | j � j | j � r� | d k r� | j | j | | | | � � n | } | g } | j | j � } | | } q. | d k r| j | | j � s� | | | j j
� d k r| j | � q. | d k r/| j | j | | | | � � n d } d } | j | � q. W| d k rz| j | j | | | | � � n d j | � S( s� Refactors a docstring, looking for doctests.
This returns a modified version of the input string. It looks
for doctests, which start with a ">>>" prompt, and may be
continued with "..." prompts, as long as the "..." is indented
the same as the ">>>".
(Unfortunately we can't use the doctest module's parser,
since, like most parsers, it is not geared towards preserving
the original source.)
i i u
u N(
R! t
splitlinesRW t lstripR t PS1R6 t refactor_doctestt findt PS2t rstripR R� (
R� RG R� t resultt blockt block_linenot indentt linenot linet i( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� ( s:
c
C� ss y | j | | | � } Wnu t k
r� } | j j t j � rm x* | D] } | j d | j d � � qG Wn | j d | | | j j
| � | SX| j | | � rot | � j
t � } | | d | | d } } | d g | d k s� t | � � | d j d � s | d c d 7<n | | j | j d � g } | ro| g | D] } | | j | ^ qK7} qon | S( s� Refactors one doctest.
A doctest is given as a block of lines, the first of which starts
with ">>>" (possibly indented), while the remaining lines start
with "..." (identically indented).
s
Source: %su
s+ Can't parse docstring in %s line %s: %s: %si i����i ( t parse_blockR( Rk t isEnabledForRu t DEBUGR� R R� R� R R� R� R� RW t AssertionErrort endswithR� t popR (
R� R R R R� R� R� R R� t clipped( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� S s&
# .c C� s | j r d } n d } | j s4 | j d | � n1 | j d | � x | j D] } | j | � qN W| j r� | j d � x! | j D] } | j | � q� Wn | j rt | j � d k r� | j d � n | j d t | j � � x0 | j D]" \ } } } | j | | | � q� Wn d S( Nt weres
need to bes No files %s modified.s Files that %s modified:s$ Warnings/messages while refactoring:i s There was 1 error:s There were %d errors:( Rx R} R� Rw Rt R� ( R� R t filet messageR� R� R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt summarizep s$
c C� s1 | j j | j | | | � � } t � | _ | S( s� Parses a block into a tree.
This is necessary to get correct line number / offset information
in the parser diagnostics and embedded into the parse tree.
( R t parse_tokenst wrap_toksRS R� ( R� R R R R� ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s ! c c� s� t j | j | | � j � } xe | D]] \ } } \ } } \ } }
} | | d 7} | | d 7} | | | | f | |
f | f Vq% Wd S( s; Wraps a tokenize stream to systematically modify start/end.i N( R RP t gen_linesRL ( R� R R R R5 R Rb t line0t col0t line1t col1t line_text( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s
(c c� s� | | j } | | j } | } xi | D]a } | j | � rN | t | � Vn4 | | j � d k rl d Vn t d | | f � � | } q' Wx t r� d Vq� Wd S( s� Generates lines as expected by tokenize from a list of lines.
This strips the first len(indent + self.PS1) characters off each line.
u
s line=%r, prefix=%rR� N( R� R R R� R R RW ( R� R R t prefix1t prefix2t prefixR ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s
N( R R R@ Rn R� R� R! R� Rz R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R R� R� R R R R ( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyRf � s:
4 ( O +
t MultiprocessingUnsupportedc B� s e Z RS( ( R R ( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s t MultiprocessRefactoringToolc B� s5 e Z d � Z e e d d � Z d � Z d � Z RS( c O� s/ t t | � j | | � d | _ d | _ d S( N( t superR R� R! t queuet output_lock( R� R� t kwargs( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s i c C� sf | d k r( t t | � j | | | � Sy d d l } Wn t k
rQ t � n X| j d k rp t d � � n | j � | _ | j
� | _ g t | � D] } | j
d | j � ^ q� } z; x | D] } | j � q� Wt t | � j | | | � Wd | j j � x$ t | � D] } | j j d � qWx' | D] } | j � r5| j � q5q5Wd | _ Xd S( Ni i����s already doing multiple processest target( R! R R� t multiprocessingt ImportErrorR R" R! t RuntimeErrort
JoinableQueuet LockR# t xranget Processt _childt startR� t putt is_alive( R� R� R� R� t
num_processesR& R t processesR+ ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s2
+
c C� so | j j � } xY | d k rj | \ } } z t t | � j | | � Wd | j j � X| j j � } q Wd S( N( R" Rs R! R! R R� t task_done( R� t taskR� R$ ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR- � s c O� sE | j d k r( | j j | | f � n t t | � j | | � Sd S( N( R" R! R/ R! R R� ( R� R� R$ ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR� � s ( R R R� R@ R� R- R� ( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyR � s
(. Re t
__future__R t
__author__RI R
R� Ru R� R- RQ t itertoolsR t pgen2R R R t
fixer_utilR R� R R R t buR R~ RW R R( R R% R> RC RE t version_infot codecsR� R� RH RK Rc Rd t objectRf R R ( ( ( s( /usr/lib64/python2.7/lib2to3/refactor.pyt <module> sH (� � patcomp.pyo 0000644 00000014221 15053244255 0006745 0 ustar 00 �
{ fc @ s� d Z d Z d d l Z d d l m Z m Z m Z m Z m Z m Z d d l
m Z d d l
m Z d e
f d � � YZ d
� Z d e f d � � YZ i e j d
6e j d 6e j d 6d d 6Z d � Z d � Z d � Z d S( s� Pattern compiler.
The grammar is taken from PatternGrammar.txt.
The compiler compiles a pattern to a pytree.*Pattern instance.
s# Guido van Rossum <guido@python.org>i����Ni ( t drivert literalst tokent tokenizet parset grammar( t pytree( t pygramt PatternSyntaxErrorc B s e Z RS( ( t __name__t
__module__( ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR s c c sw t t j t j t j f � } t j t j | � j � } x7 | D]/ } | \ } } } } } | | k r@ | Vq@ q@ Wd S( s6 Tokenizes a string suppressing significant whitespace.N( t setR t NEWLINEt INDENTt DEDENTR t generate_tokenst StringIOt readline( t inputt skipt tokenst quintuplet typet valuet startt endt line_text( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyt tokenize_wrapper s
t PatternCompilerc B sA e Z d d � Z e e d � Z d � Z d d � Z d � Z RS( c C s� | d k r' t j | _ t j | _ n' t j | � | _ t j | j � | _ t j | _
t j | _ t j
| j d t �| _ d S( s^ Initializer.
Takes an optional alternative filename for the pattern grammar.
t convertN( t NoneR t pattern_grammarR t pattern_symbolst symsR t load_grammart Symbolst python_grammart pygrammart python_symbolst pysymst Drivert pattern_convert( t selft grammar_file( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyt __init__( s c C s} t | � } y | j j | d | �} Wn( t j k
rR } t t | � � � n X| rl | j | � | f S| j | � Sd S( s= Compiles a pattern string to a nested pytree.*Pattern object.t debugN( R R t parse_tokensR t
ParseErrorR t strt compile_node( R* R R- t with_treeR t roott e( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyt compile_pattern7 s c C sT | j | j j k r% | j d } n | j | j j k r� g | j d d d � D] } | j | � ^ qQ } t | � d k r� | d St j g | D] } | g ^ q� d d d d �} | j � S| j | j j
k r=g | j D] } | j | � ^ q� } t | � d k r| d St j | g d d d d �} | j � S| j | j j k r�| j | j d � } t j
| � } | j � Sd } | j } t | � d k r�| d j t j k r�| d j } | d } n d }
t | � d k r| d j | j j k r| d }
| d } n | j | |
� } |
d k r2|
j } | d } | j t j k rod }
t j } nx | j t j k r�d }
t j } nT | j t j k r�| j | d � }
} t | � d k r�| j | d � } q�n |
d k s�| d k r2| j � } t j | g g d |
d | �} q2n | d k rJ| | _ n | j � S(
sX Compiles a node, recursively.
This is one big switch on the node type.
i Ni i t mint maxi i����i ( R R! t Matchert childrent AlternativesR1 t lenR t WildcardPatternt optimizet Alternativet NegatedUnitt
compile_basict NegatedPatternR R t EQUALR t Repeatert STARt HUGEt PLUSt LBRACEt get_intt name( R* t nodet cht altst at pt unitst patternRI t nodest repeatR9 t childR6 R7 ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR1 C s^ 21
%
(
+
' c C s� | d } | j t j k rJ t t j | j � � } t j t | � | � S| j t j
k rX| j } | j � r� | t k r� t
d | � � n | d r� t
d � � n t j t | � S| d k r� d } nF | j d � st | j | d � } | d k rt
d | � � qn | d r?| j | d j d � g } n d } t j | | � Sna | j d k rx| j | d � S| j d k r�| j | d � } t j | g g d
d d d �Sd S( Ni s Invalid token: %ri s Can't have details for tokent anyt _s Invalid symbol: %rt (t [R6 R7 ( R R t STRINGt unicodeR t
evalStringR R t LeafPatternt _type_of_literalt NAMEt isuppert TOKEN_MAPR R t
startswitht getattrR' R1 R9 t NodePatternR< ( R* RQ RR RJ R R t contentt
subpattern( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR@ � s8
c C s
t | j � S( N( t intR ( R* RJ ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyRH � s N( R R
R R, t FalseR5 R1 R@ RH ( ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR & s
G #R] RX t NUMBERt TOKENc C s9 | d j � r t j S| t j k r1 t j | Sd Sd S( Ni ( t isalphaR R] R t opmapR ( R ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR\ � s
c C sW | \ } } } } | s' | | j k r= t j | | d | �St j | | d | �Sd S( s9 Converts raw node information to a Node or Leaf instance.t contextN( t
number2symbolR t Nodet Leaf( R t
raw_node_infoR R Rk R9 ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR) � s c C s t � j | � S( N( R R5 ( RP ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyR5 � s ( t __doc__t
__author__R t pgen2R R R R R R t R R t ExceptionR R t objectR R] RX Rg R R_ R\ R) R5 ( ( ( s' /usr/lib64/python2.7/lib2to3/patcomp.pyt <module> s .
�
pgen2/parse.pyo 0000644 00000016035 15053244255 0007434 0 ustar 00 �
{ fc @ sF d Z d d l m Z d e f d � � YZ d e f d � � YZ d S( s� Parser engine for the grammar tables generated by pgen.
The grammar table must be loaded first.
See Parser/parser.c in the Python distribution for additional info on
how this parsing engine works.
i ( t tokent
ParseErrorc B s e Z d Z d � Z RS( s( Exception to signal the parser is stuck.c C sH t j | d | | | | f � | | _ | | _ | | _ | | _ d S( Ns! %s: type=%r, value=%r, context=%r( t Exceptiont __init__t msgt typet valuet context( t selfR R R R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR s ( t __name__t
__module__t __doc__R ( ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR s t Parserc B sS e Z d Z d d � Z d d � Z d � Z d � Z d � Z d � Z d � Z
RS( s5 Parser engine.
The proper usage sequence is:
p = Parser(grammar, [converter]) # create instance
p.setup([start]) # prepare for parsing
<for each input token>:
if p.addtoken(...): # parse a token; may raise ParseError
break
root = p.rootnode # root of abstract syntax tree
A Parser instance may be reused by calling setup() repeatedly.
A Parser instance contains state pertaining to the current token
sequence, and should not be used concurrently by different threads
to parse separate token sequences.
See driver.py for how to get input tokens by tokenizing a file or
string.
Parsing is complete when addtoken() returns True; the root of the
abstract syntax tree can then be retrieved from the rootnode
instance variable. When a syntax error occurs, addtoken() raises
the ParseError exception. There is no error recovery; the parser
cannot be used after a syntax error was reported (but it can be
reinitialized by calling setup()).
c C s | | _ | p d � | _ d S( s� Constructor.
The grammar argument is a grammar.Grammar instance; see the
grammar module for more information.
The parser is not ready yet for parsing; you must call the
setup() method to get it started.
The optional convert argument is a function mapping concrete
syntax tree nodes to abstract syntax tree nodes. If not
given, no conversion is done and the syntax tree produced is
the concrete syntax tree. If given, it must be a function of
two arguments, the first being the grammar (a grammar.Grammar
instance), and the second being the concrete syntax tree node
to be converted. The syntax tree is converted from the bottom
up.
A concrete syntax tree node is a (type, value, context, nodes)
tuple, where type is the node type (a token or symbol number),
value is None for symbols and a string for tokens, context is
None or an opaque value used for error reporting (typically a
(lineno, offset) pair), and nodes is a list of children for
symbols, and None for tokens.
An abstract syntax tree node may be anything; this is entirely
up to the converter function.
c S s | S( N( ( t grammart node( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyt <lambda>W t N( R
t convert( R R
R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR 9 s c C sk | d k r | j j } n | d d g f } | j j | d | f } | g | _ d | _ t � | _ d S( s� Prepare for parsing.
This *must* be called before starting to parse.
The optional argument is an alternative start symbol; it
defaults to the grammar's start symbol.
You can use a Parser instance to parse any number of programs;
each time you call setup() the parser is reset to an initial
state determined by the (implicit or explicit) start symbol.
i N( t NoneR
t startt dfast stackt rootnodet sett
used_names( R R t newnodet
stackentry( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyt setupY s
c C s� | j | | | � } x�t r�| j d \ } } } | \ } } | | }
x_|
D]\ } } | j j | \ }
} | | k r� | j | | | | � | } xV | | d | f g k r� | j � | j s� t S| j d \ } } } | \ } } q� Wt S|
d k rQ | j j |
} | \ } } | | k rS| j |
| j j |
| | � PqSqQ qQ Wd | f |
k r�| j � | j s�t
d | | | � � q�q t
d | | | � � q Wd S( s< Add a token; return True iff this is the end of the program.i����i i s too much inputs bad inputN( t classifyt TrueR R
t labelst shiftt popt FalseR t pushR ( R R R R t ilabelt dfat stateR t statest firstt arcst it newstatet tt vt itsdfat itsstatest itsfirst( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyt addtokenq s:
c C s� | t j k rG | j j | � | j j j | � } | d k rG | Sn | j j j | � } | d k r� t d | | | � � n | S( s& Turn a token into a label. (Internal)s bad tokenN(
R t NAMER t addR
t keywordst getR t tokensR ( R R R R R# ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR � s c C sw | j d \ } } } | | | d f } | j | j | � } | d k r] | d j | � n | | | f | j d <d S( s Shift a token. (Internal)i����N( R R R R
t append( R R R R* R R$ R% R R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR � s c C s[ | j d \ } } } | d | g f } | | | f | j d <| j j | d | f � d S( s Push a nonterminal. (Internal)i����i N( R R R6 ( R R t newdfaR* R R$ R% R R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR" � s c C s� | j j � \ } } } | j | j | � } | d k r� | j rl | j d \ } } } | d j | � q� | | _ | j | j _ n d S( s Pop a nonterminal. (Internal)i����N( R R R R
R R6 R R ( R t popdfat popstatet popnodeR R$ R% R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR � s N( R R
R R R R R0 R R R" R ( ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR s 0 N( R R R R R t objectR ( ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyt <module> s pgen2/literals.pyo 0000644 00000003372 15053244255 0010141 0 ustar 00 �
{ fc @ s� d Z d d l Z i
d d 6d d 6d d 6d d
6d d 6d
d 6d d 6d d 6d d 6d d 6Z d � Z d � Z d � Z e d k r� e � n d S( s< Safely evaluate Python string literals without using eval().i����Ns t as t bs t fs
t ns
t rs t ts t vt 't "s \c C s� | j d d � \ } } t j | � } | d k r7 | S| j d � r� | d } t | � d k ru t d | � � n y t | d � } Wq� t k
r� t d | � � q� Xn7 y t | d � } Wn! t k
r� t d | � � n Xt | � S( Ni i t xi s! invalid hex string escape ('\%s')i i s# invalid octal string escape ('\%s')( t groupt simple_escapest gett Nonet
startswitht lent
ValueErrort intt chr( t mt allt tailt esct hexest i( ( s. /usr/lib64/python2.7/lib2to3/pgen2/literals.pyt escape s"
c C sX | d } | d | d k r+ | d } n | t | � t | � !} t j d t | � S( Ni i s) \\(\'|\"|\\|[abfnrtv]|x.{0,2}|[0-7]{1,3})( R t ret subR ( t st q( ( s. /usr/lib64/python2.7/lib2to3/pgen2/literals.pyt
evalString( s
c C s_ xX t d � D]J } t | � } t | � } t | � } | | k r
| G| G| G| GHq
q
Wd S( Ni ( t rangeR t reprR ( R t cR t e( ( s. /usr/lib64/python2.7/lib2to3/pgen2/literals.pyt test2 s t __main__( t __doc__R R R R R# t __name__( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/literals.pyt <module> s
pgen2/grammar.pyo 0000644 00000017004 15053244255 0007745 0 ustar 00 �
{ fc @ s� d Z d d l Z d d l Z d d l m Z m Z d e f d � � YZ d � Z d Z i Z
xB e j � D]4 Z e rl e j
� \ Z Z e e e � e
e <ql ql Wd S( s� This module defines the data structures used to represent a grammar.
These are a bit arcane because they are derived from the data
structures used by Python's 'pgen' parser generator.
There's also a table here mapping operators to their names in the
token module; the Python tokenize module reports all operators as the
fallback token code OP, but the parser needs the actual token code.
i����Ni ( t tokent tokenizet Grammarc B sD e Z d Z d � Z d � Z d � Z d � Z d � Z d � Z RS( s� Pgen parsing tables conversion class.
Once initialized, this class supplies the grammar tables for the
parsing engine implemented by parse.py. The parsing engine
accesses the instance variables directly. The class here does not
provide initialization of the tables; several subclasses exist to
do this (see the conv and pgen modules).
The load() method reads the tables from a pickle file, which is
much faster than the other ways offered by subclasses. The pickle
file is written by calling dump() (after loading the grammar
tables using a subclass). The report() method prints a readable
representation of the tables to stdout, for debugging.
The instance variables are as follows:
symbol2number -- a dict mapping symbol names to numbers. Symbol
numbers are always 256 or higher, to distinguish
them from token numbers, which are between 0 and
255 (inclusive).
number2symbol -- a dict mapping numbers to symbol names;
these two are each other's inverse.
states -- a list of DFAs, where each DFA is a list of
states, each state is a list of arcs, and each
arc is a (i, j) pair where i is a label and j is
a state number. The DFA number is the index into
this list. (This name is slightly confusing.)
Final states are represented by a special arc of
the form (0, j) where j is its own state number.
dfas -- a dict mapping symbol numbers to (DFA, first)
pairs, where DFA is an item from the states list
above, and first is a set of tokens that can
begin this grammar rule (represented by a dict
whose values are always 1).
labels -- a list of (x, y) pairs where x is either a token
number or a symbol number, and y is either None
or a string; the strings are keywords. The label
number is the index in this list; label numbers
are used to mark state transitions (arcs) in the
DFAs.
start -- the number of the grammar's start symbol.
keywords -- a dict mapping keyword strings to arc labels.
tokens -- a dict mapping token numbers to arc labels.
c C sX i | _ i | _ g | _ i | _ d g | _ i | _ i | _ i | _ d | _ d S( Ni t EMPTYi ( i R ( t
symbol2numbert
number2symbolt statest dfast labelst keywordst tokenst symbol2labelt start( t self( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyt __init__M s c C s> t | d � �) } t | j � } t j | | d � Wd QXd S( s� Dump the grammar tables to a pickle file.
dump() recursively changes all dict to OrderedDict, so the pickled file
is not exactly the same as what was passed in to dump(). load() uses the
pickled file to create the tables, but only changes OrderedDict to dict
at the top level; it does not recursively change OrderedDict to dict.
So, the loaded tables are different from the original tables that were
passed to load() in that some of the OrderedDict (from the pickled file)
are not changed back to dict. For parsing, this has no effect on
performance because OrderedDict uses dict's __getitem__ with nothing in
between.
t wbi N( t opent _make_deterministict __dict__t picklet dump( R
t filenamet ft d( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR X s
c C s< t | d � } t j | � } | j � | j j | � d S( s+ Load the grammar tables from a pickle file.t rbN( R R t loadt closeR t update( R
R R R ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR i s
c C s | j j t j | � � d S( s3 Load the grammar tables from a pickle bytes object.N( R R R t loads( R
t pkl( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR p s c C sf | j � } x- d D]% } t | | t | | � j � � q W| j | _ | j | _ | j | _ | S( s#
Copy the grammar.
R R R R R
R ( R R R R R
R ( t __class__t setattrt getattrt copyR R R ( R
t newt dict_attr( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR! t s
#
c C sz d d l m } d GH| | j � d GH| | j � d GH| | j � d GH| | j � d GH| | j � d G| j GHd S(
s: Dump the grammar tables to standard output, for debugging.i����( t pprintt s2nt n2sR R R R N( R$ R R R R R R ( R
R$ ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyt report� s
( t __name__t
__module__t __doc__R R R R R! R' ( ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR s 4
c C s� t | t � r2 t j t d � | j � D� � � St | t � r^ g | D] } t | � ^ qH St | t � r� t d � | D� � S| S( Nc s s' | ] \ } } | t | � f Vq d S( N( R ( t .0t kt v( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pys <genexpr>� s c s s | ] } t | � Vq d S( N( R ( R+ t e( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pys <genexpr>� s ( t
isinstancet dictt collectionst OrderedDictt sortedt iteritemst listR t tuple( t topR. ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR � s s
( LPAR
) RPAR
[ LSQB
] RSQB
: COLON
, COMMA
; SEMI
+ PLUS
- MINUS
* STAR
/ SLASH
| VBAR
& AMPER
< LESS
> GREATER
= EQUAL
. DOT
% PERCENT
` BACKQUOTE
{ LBRACE
} RBRACE
@ AT
@= ATEQUAL
== EQEQUAL
!= NOTEQUAL
<> NOTEQUAL
<= LESSEQUAL
>= GREATEREQUAL
~ TILDE
^ CIRCUMFLEX
<< LEFTSHIFT
>> RIGHTSHIFT
** DOUBLESTAR
+= PLUSEQUAL
-= MINEQUAL
*= STAREQUAL
/= SLASHEQUAL
%= PERCENTEQUAL
&= AMPEREQUAL
|= VBAREQUAL
^= CIRCUMFLEXEQUAL
<<= LEFTSHIFTEQUAL
>>= RIGHTSHIFTEQUAL
**= DOUBLESTAREQUAL
// DOUBLESLASH
//= DOUBLESLASHEQUAL
-> RARROW
( R* R1 R t R R t objectR R t opmap_rawt opmapt
splitlinest linet splitt opt nameR ( ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyt <module>
s z = pgen2/pgen.pyo 0000644 00000026551 15053244255 0007257 0 ustar 00 �
{ fc @ s� d d l m Z m Z m Z d e j f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d
d � Z
d S(
i ( t grammart tokent tokenizet PgenGrammarc B s e Z RS( ( t __name__t
__module__( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR s t ParserGeneratorc B s� e Z d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z
d � Z d � Z d
� Z
d � Z d � Z d
� Z d � Z d d � Z d � Z d � Z RS( c C s� d } | d k r* t | � } | j } n | | _ | | _ t j | j � | _ | j � | j
� \ | _ | _ | d k r� | � n i | _
| j � d S( N( t Nonet opent closet filenamet streamR t generate_tokenst readlinet generatort gettokent parset dfast startsymbolt firstt addfirstsets( t selfR
R t close_stream( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt __init__ s
c C s� t � } | j j � } | j � | j | j � | j d | j � x; | D]3 } d t | j � } | | j | <| | j | <qL Wx� | D]� } | j | } g } x� | D]� } g } xK t
| j j � � D]4 \ } }
| j
| j | | � | j |
� f � q� W| j r,| j
d | j | � f � n | j
| � q� W| j j
| � | | j | | � f | j | j | <q� W| j | j | _ | S( Ni i ( R R t keyst sortt removeR t insertt lent
symbol2numbert
number2symbolt sortedt arcst iteritemst appendt
make_labelt indext isfinalt statest
make_firstt start( R t ct namest namet it dfaR& t stateR t labelt next( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt make_grammar s.
", *c C sJ | j | } i } x0 t | � D]" } | j | | � } d | | <q W| S( Ni ( R R R# ( R R) R+ t rawfirstR R/ t ilabel( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR' 4 s
c C s� t | j � } | d j � r� | | j k ry | | j k rH | j | S| j j | j | d f � | | j | <| Sq�t t | d � } | | j k r� | j | S| j j | d f � | | j | <| Sn� t
| � } | d j � r2| | j k r| j | S| j j t j | f � | | j | <| SnN t
j | } | | j k rY| j | S| j j | d f � | | j | <| Sd S( Ni ( R t labelst isalphaR t symbol2labelR" R t getattrR t tokenst evalt keywordst NAMER t opmap( R R) R/ R3 t itokent value( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR# = s6
c C sM | j j � } | j � x- | D]% } | | j k r | j | � q q Wd S( N( R R R R t calcfirst( R R* R+ ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR k s
c C sj | j | } d | j | <| d } i } i } x� | j j � D]� \ } } | | j k r� | | j k r� | j | } | d k r� t d | � � q� n | j | � | j | } | j | � | | | <q@ d | | <i d | 6| | <q@ Wi } xd | j � D]V \ } }
xG |
D]? } | | k rGt d | | | | | f � � n | | | <qWq� W| | j | <d S( Ni s recursion for rule %ri sA rule %s is ambiguous; %s is in the first sets of %s as well as %s( R R R R R! t
ValueErrorR? t update( R R+ R- R. t totalsett overlapcheckR/ R0 t fsett inverset itsfirstt symbol( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR? s s2
c C s� i } d } x� | j t j k r� x | j t j k rC | j � q$ W| j t j � } | j t j d � | j � \ } } | j t j � | j
| | � } t | � } | j | � t | � } | | | <| d k r | } q q W| | f S( Nt :(
R t typeR t ENDMARKERt NEWLINER t expectR; t OPt parse_rhst make_dfaR t simplify_dfa( R R R R+ t at zR- t oldlent newlen( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR � s"
c s � f d � } � f d � � t | | � | � g } x� | D]� } i } xS | j D]H } x? | j D]4 \ } } | d k rc � | | j | i � � qc qc WqS Wxp t | j � � D]\ \ } }
x= | D] } | j |
k r� Pq� q� Wt |
| � } | j | � | j | | � q� Wq= W| S( Nc s i } � | | � | S( N( ( R. t base( t
addclosure( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt closure� s
c sT | | k r d Sd | | <x3 | j D]( \ } } | d k r$ � | | � q$ q$ Wd S( Ni ( R R ( R. RU R/ R0 ( RV ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRV � s
( t DFAStatet nfasetR R t
setdefaultR R! R" t addarc( R R( t finishRW R& R. R t nfastateR/ R0 RY t st( ( RV s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRO � s"
$
c
C s� d G| GH| g } x� t | � D]� \ } } d G| G| | k rE d pH d GHxu | j D]j \ } } | | k r~ | j | � } n t | � } | j | � | d k r� d | GHqT d | | f GHqT Wq Wd S( Ns Dump of NFA fors States (final)t s -> %ds %s -> %d( t enumerateR R$ R R" R (
R R+ R( R\ t todoR, R. R/ R0 t j( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt dump_nfa� s
c C s� d G| GHxt t | � D]f \ } } d G| G| j r9 d p< d GHx; t | j j � � D]$ \ } } d | | j | � f GHqT Wq Wd S( Ns Dump of DFA fors States (final)R_ s %s -> %d( R` R% R R R! R$ ( R R+ R- R, R. R/ R0 ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt dump_dfa� s
"c C s� t } x� | r� t } x� t | � D]x \ } } xi t | d t | � � D]N } | | } | | k rH | | =x | D] } | j | | � qr Wt } PqH qH Wq" Wq Wd S( Ni ( t Truet FalseR` t rangeR t
unifystate( R R- t changesR, t state_iRb t state_jR. ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRP � s
c C s� | j � \ } } | j d k r+ | | f St � } t � } | j | � | j | � xI | j d k r� | j � | j � \ } } | j | � | j | � qZ W| | f Sd S( Nt |( t parse_altR> t NFAStateR[ R ( R RQ RR t aat zz( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRN � s
c C sr | j � \ } } xS | j d k s? | j t j t j f k rg | j � \ } } | j | � | } q W| | f S( Nt (t [( Rq Rr ( t
parse_itemR> RI R R; t STRINGR[ ( R RQ t bR) t d( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRm
s
c C s� | j d k rU | j � | j � \ } } | j t j d � | j | � | | f S| j � \ } } | j } | d k r� | | f S| j � | j | � | d k r� | | f S| | f Sd S( NRr t ]t +t *( Rx Ry ( R> R RN RL R RM R[ t
parse_atom( R RQ RR R> ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRs s
c C s� | j d k rH | j � | j � \ } } | j t j d � | | f S| j t j t j f k r� t � } t � } | j
| | j � | j � | | f S| j d | j | j � d S( NRq t )s+ expected (...) or NAME or STRING, got %s/%s( R> R RN RL R RM RI R; Rt Rn R[ t raise_error( R RQ RR ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRz ( s
c C sc | j | k s* | d k rL | j | k rL | j d | | | j | j � n | j } | j � | S( Ns expected %s/%s, got %s/%s( RI R R> R| R ( R RI R> ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRL 9 s *
c C si | j j � } x/ | d t j t j f k r@ | j j � } q W| \ | _ | _ | _ | _ | _ d S( Ni (
R R0 R t COMMENTt NLRI R> t begint endt line( R t tup( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR A s c G ss | r@ y | | } Wq@ d j | g t t | � � } q@ Xn t | | j | j d | j d | j f � � d S( Nt i i ( t joint mapt strt SyntaxErrorR
R� R� ( R t msgt args( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR| H s &N( R R R R R1 R' R# R R? R RO Rc Rd RP RN Rm Rs Rz RL R R| ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR
s$ . $
Rn c B s e Z d � Z d d � Z RS( c C s
g | _ d S( N( R ( R ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR S s c C s | j j | | f � d S( N( R R" ( R R0 R/ ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR[ V s N( R R R R R[ ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRn Q s RX c B s2 e Z d � Z d � Z d � Z d � Z d Z RS( c C s% | | _ | | k | _ i | _ d S( N( RY R% R ( R RY t final( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR ] s c C s | | j | <d S( N( R ( R R0 R/ ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR[ e s c C s@ x9 | j j � D]( \ } } | | k r | | j | <q q Wd S( N( R R! ( R t oldt newR/ R0 ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRh k s c C sx | j | j k r t St | j � t | j � k r8 t Sx9 | j j � D]( \ } } | | j j | � k rH t SqH Wt S( N( R% Rf R R R! t getRe ( R t otherR/ R0 ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt __eq__p s N( R R R R[ Rh R� R t __hash__( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRX [ s
s Grammar.txtc C s t | � } | j � S( N( R R1 ( R
t p( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt generate_grammar� s N( R_ R R R t GrammarR t objectR Rn RX R� ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt <module> s � H
% pgen2/driver.pyo 0000644 00000014400 15053244255 0007607 0 ustar 00 �
{ fc @ s d Z d Z d d g Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l m
Z
m Z m Z m
Z
m Z d e f d � � YZ d � Z d
d e e d d � Z d � Z d
� Z d � Z e d k r e j e e � � � n d S( sZ Parser driver.
This provides a high-level interface to parse a file into a syntax tree.
s# Guido van Rossum <guido@python.org>t Drivert load_grammari����Ni ( t grammart parset tokent tokenizet pgenc B sV e Z d d d � Z e d � Z e d � Z e d � Z d e d � Z e d � Z RS( c C s: | | _ | d k r$ t j � } n | | _ | | _ d S( N( R t Nonet loggingt getLoggert loggert convert( t selfR R R
( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt __init__ s
c C s t j | j | j � } | j � d } d } d } } } } }
d } x�| D]�} | \ } } } } }
| | | f k r� | \ }
} | |
k r� | d |
| 7} |
} d } n | | k r� | |
| | !7} | } q� n | t j t j f k r6| | 7} | \ } } | j d � rQ | d 7} d } qQ qQ n | t
j k rUt j | } n | r~| j
j d t
j | | | � n | j | | | | f � r�| r�| j
j d � n Pn d } | \ } } | j d � rQ | d 7} d } qQ qQ Wt j d | | | | f � � | j S(
s4 Parse a series of tokens and return the syntax tree.i i u s
s %s %r (prefix=%r)s Stop.t s incomplete inputN( R t ParserR R t setupR R t COMMENTt NLt endswithR t OPt opmapR
t debugt tok_namet addtokent
ParseErrort rootnode( R t tokensR t pt linenot columnt typet valuet startt endt line_textt prefixt quintuplet s_linenot s_column( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt parse_tokens' sR
c C s" t j | j � } | j | | � S( s* Parse a stream and return the syntax tree.( R t generate_tokenst readlineR( ( R t streamR R ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt parse_stream_rawW s c C s | j | | � S( s* Parse a stream and return the syntax tree.( R, ( R R+ R ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt parse_stream\ s c C s; t j | d | � } z | j | | � SWd | j � Xd S( s( Parse a file and return the syntax tree.t rN( t codecst openR- t close( R t filenamet encodingR R+ ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt
parse_file` s c C s+ t j t j | � j � } | j | | � S( s* Parse a string and return the syntax tree.( R R) t StringIOR* R( ( R t textR R ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt parse_stringh s N(
t __name__t
__module__R R
t FalseR( R, R- R4 R7 ( ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyR s 0 c C sR t j j | � \ } } | d k r- d } n | | d j t t t j � � d S( Ns .txtR t .s .pickle( t ost patht splitextt joint mapt strt syst version_info( t gtt headt tail( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt _generate_pickle_namen s s Grammar.txtc C s� | d k r t j � } n | d k r3 t | � n | } | sO t | | � r� | j d | � t j | � } | r� | j d | � y | j | � Wq� t k
r� } | j d | � q� Xq� n t
j � } | j | � | S( s' Load the grammar (maybe from a pickle).s! Generating grammar tables from %ss Writing grammar tables to %ss Writing failed: %sN(
R R R RG t _newert infoR t generate_grammart dumpt IOErrorR t Grammart load( RD t gpt savet forceR
t gt e( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyR u s
c C sN t j j | � s t St j j | � s, t St j j | � t j j | � k S( s0 Inquire whether file a was written since file b.( R< R= t existsR: t Truet getmtime( t at b( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyRH � s
c C sc t j j | � r t | � St t j j | � � } t j | | � } t j � } | j
| � | S( s� Normally, loads a pickled grammar by doing
pkgutil.get_data(package, pickled_grammar)
where *pickled_grammar* is computed from *grammar_source* by adding the
Python version and using a ``.pickle`` extension.
However, if *grammar_source* is an extant file, load_grammar(grammar_source)
is called instead. This facilitates using a packaged grammar file when needed
but preserves load_grammar's automatic regeneration behavior when possible.
( R< R= t isfileR RG t basenamet pkgutilt get_dataR RM t loads( t packaget grammar_sourcet pickled_namet dataRR ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt load_packaged_grammar� s
c G sc | s t j d } n t j d t j d t j d d � x$ | D] } t | d t d t �q? Wt S( s� Main program, when run as a script: produce grammar pickle files.
Calls load_grammar for each argument, a path to a grammar text file.
i t levelR+ t formats %(message)sRP RQ ( RB t argvR t basicConfigt INFOt stdoutR RU ( t argsRD ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt main� s
t __main__( t __doc__t
__author__t __all__R/ R< R R[ R5 RB R R R R R R t objectR RG R RU R: R RH Rb Rj R8 t exitt int( ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt <module> s$ (P
pgen2/token.pyo 0000644 00000004377 15053244255 0007450 0 ustar 00 �
{ fc @ s� d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d
Z
d Z d Z d
Z
d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d! Z! d" Z" d# Z# d$ Z$ d% Z% d& Z& d' Z' d( Z( d) Z) d* Z* d+ Z+ d, Z, d- Z- d. Z. d/ Z/ d0 Z0 d1 Z1 d2 Z2 d3 Z3 d4 Z4 d5 Z5 d6 Z6 d7 Z7 d8 Z8 d9 Z9 d: Z: d; Z; i Z< xB e= � j> � D]1 \ Z? Z@ eA e@ � eA d � k r~e? e< e@ <q~q~Wd< � ZB d= � ZC d> � ZD d? S(@ s! Token constants (from "token.h").i i i i i i i i i i i
i i i
i i i i i i i i i i i i i i i i i i i i! i" i# i$ i% i& i' i( i) i* i+ i, i- i. i/ i0 i1 i2 i3 i4 i5 i6 i7 i8 i9 i c C s
| t k S( N( t NT_OFFSET( t x( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/token.pyt
ISTERMINALL s c C s
| t k S( N( R ( R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/token.pyt
ISNONTERMINALO s c C s
| t k S( N( t ENDMARKER( R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/token.pyt ISEOFR s N(E t __doc__R t NAMEt NUMBERt STRINGt NEWLINEt INDENTt DEDENTt LPARt RPARt LSQBt RSQBt COLONt COMMAt SEMIt PLUSt MINUSt STARt SLASHt VBARt AMPERt LESSt GREATERt EQUALt DOTt PERCENTt BACKQUOTEt LBRACEt RBRACEt EQEQUALt NOTEQUALt LESSEQUALt GREATEREQUALt TILDEt
CIRCUMFLEXt LEFTSHIFTt
RIGHTSHIFTt
DOUBLESTARt PLUSEQUALt MINEQUALt STAREQUALt
SLASHEQUALt PERCENTEQUALt
AMPEREQUALt VBAREQUALt CIRCUMFLEXEQUALt LEFTSHIFTEQUALt RIGHTSHIFTEQUALt DOUBLESTAREQUALt DOUBLESLASHt DOUBLESLASHEQUALt ATt ATEQUALt OPt COMMENTt NLt RARROWt
ERRORTOKENt N_TOKENSR t tok_namet globalst itemst _namet _valuet typeR R R ( ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/token.pyt <module> s� pgen2/tokenize.pyo 0000644 00000040762 15053244255 0010156 0 ustar 00 �
{ fc @ s d Z d Z d Z d d l Z d d l Z d d l m Z m Z d d l Td d l m
Z
g e e
� D] Z e d d
k rg e ^ qg d d d
g Z
[
y e Wn e k
r� e Z n Xd � Z d � Z d � Z d Z d Z e e d e � e e � Z d Z d Z d Z d Z d Z e e e e e � Z d Z e d d � e e � Z d e Z e e e � Z e d e d � Z! e e! e e � Z" d Z# d Z$ d! Z% d" Z& e d# d$ � Z' e d% d& � Z( e d' d( d) d* d+ d, d- d. d/ � Z) d0 Z* e d1 d2 � Z+ e e) e* e+ � Z, e e" e, e( e � Z- e e- Z. e d3 e d4 d � d5 e d6 d � � Z/ e d e e' � Z0 e e e0 e" e, e/ e � Z1 e2 e j3 e. e1 e% e& f � \ Z4 Z5 Z6 Z7 i& e j3 e# � d4 6e j3 e$ � d6 6e6 d7 6e7 d8 6e6 d9 6e7 d: 6e6 d; 6e7 d< 6e6 d= 6e7 d> 6e6 d? 6e7 d@ 6e6 dA 6e7 dB 6e6 dC 6e7 dD 6e6 dE 6e7 dF 6e6 dG 6e7 dH 6e6 dI 6e7 dJ 6e6 dK 6e7 dL 6e6 dM 6e7 dN 6e6 dO 6e7 dP 6e6 dQ 6e7 dR 6e6 dS 6e7 dT 6d dU 6d dV 6d dW 6d dX 6d dY 6d dZ 6Z9 i Z: x d� D] Z; e; e: e; <q�Wi Z< x d� D] Z; e; e< e; <qWdw Z= dx e> f dy � � YZ? dz e> f d{ � � YZ@ d| � ZA eA d} � ZB d~ � ZC d d� d� � � YZD e j3 d� � ZE e j3 d� � ZF d� � ZG d� � ZH d� � ZI d� � ZJ eK d� k rd d lL ZL eM eL jN � d k reB eO eL jN d � jP � qeB eL jQ jP � n d S(� s� Tokenization help for Python programs.
generate_tokens(readline) is a generator that breaks a stream of
text into Python tokens. It accepts a readline-like method which is called
repeatedly to get the next line of input (or "" for EOF). It generates
5-tuples with these members:
the token type (see token.py)
the token (a string)
the starting (row, column) indices of the token (a 2-tuple of ints)
the ending (row, column) indices of the token (a 2-tuple of ints)
the original line (string)
It is designed to match the working of the Python tokenizer exactly, except
that it produces COMMENT tokens for comments and gives type OP for all
operators
Older entry points
tokenize_loop(readline, tokeneater)
tokenize(readline, tokeneater=printtoken)
are the same, except instead of generating tokens, tokeneater is a callback
function to which the 5 fields described above are passed as 5 arguments,
each time a new token is found.s Ka-Ping Yee <ping@lfw.org>s@ GvR, ESR, Tim Peters, Thomas Wouters, Fred Drake, Skip Montanaroi����N( t BOM_UTF8t lookup( t *i ( t tokeni t _t tokenizet generate_tokenst
untokenizec G s d d j | � d S( Nt (t |t )( t join( t choices( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt group0 t c G s t | � d S( NR ( R
( R ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt any1 R c G s t | � d S( Nt ?( R
( R ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt maybe2 R s [ \f\t]*s #[^\r\n]*s \\\r?\ns [a-zA-Z_]\w*s
0[bB][01]*s 0[xX][\da-fA-F]*[lL]?s 0[oO]?[0-7]*[lL]?s
[1-9]\d*[lL]?s [eE][-+]?\d+s \d+\.\d*s \.\d+s \d+s \d+[jJ]s [jJ]s [^'\\]*(?:\\.[^'\\]*)*'s [^"\\]*(?:\\.[^"\\]*)*"s% [^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''s% [^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""s [ubUB]?[rR]?'''s [ubUB]?[rR]?"""s& [uU]?[rR]?'[^\n'\\]*(?:\\.[^\n'\\]*)*'s& [uU]?[rR]?"[^\n"\\]*(?:\\.[^\n"\\]*)*"s \*\*=?s >>=?s <<=?s <>s !=s //=?s ->s [+\-*/%&@|^=<>]=?t ~s [][(){}]s \r?\ns [:;.,`@]s' [uUbB]?[rR]?'[^\n'\\]*(?:\\.[^\n'\\]*)*t 's' [uUbB]?[rR]?"[^\n"\\]*(?:\\.[^\n"\\]*)*t "s '''s """s r'''s r"""s u'''s u"""s b'''s b"""s ur'''s ur"""s br'''s br"""s R'''s R"""s U'''s U"""s B'''s B"""s uR'''s uR"""s Ur'''s Ur"""s UR'''s UR"""s bR'''s bR"""s Br'''s Br"""s BR'''s BR"""t rt Rt ut Ut bt Bs r's r"s R's R"s u's u"s U's U"s b's b"s B's B"s ur's ur"s Ur's Ur"s uR's uR"s UR's UR"s br's br"s Br's Br"s bR's bR"s BR's BR"i t
TokenErrorc B s e Z RS( ( t __name__t
__module__( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR � s t StopTokenizingc B s e Z RS( ( R R ( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR � s c C sA | \ } } | \ } } d | | | | t | t | � f GHd S( Ns %d,%d-%d,%d: %s %s( t tok_namet repr( t typeR t startt endt linet srowt scolt erowt ecol( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt
printtoken� s c C s) y t | | � Wn t k
r$ n Xd S( s:
The tokenize() function accepts two parameters: one representing the
input stream, and one providing an output mechanism for tokenize().
The first parameter, readline, must be a callable object which provides
the same interface as the readline() method of built-in file objects.
Each call to the function should return one line of input as a string.
The second parameter, tokeneater, must also be a callable object. It is
called once for each token, with five arguments, corresponding to the
tuples generated by generate_tokens().
N( t
tokenize_loopR ( t readlinet
tokeneater( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR � s
c C s% x t | � D] } | | � q
Wd S( N( R ( R+ R, t
token_info( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR* � s t Untokenizerc B s, e Z d � Z d � Z d � Z d � Z RS( c C s g | _ d | _ d | _ d S( Ni i ( t tokenst prev_rowt prev_col( t self( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt __init__� s c C s: | \ } } | | j } | r6 | j j d | � n d S( Nt ( R1 R/ t append( R2 R" t rowt colt
col_offset( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt add_whitespace� s
c C s� x� | D]� } t | � d k r3 | j | | � Pn | \ } } } } } | j | � | j j | � | \ | _ | _ | t t f k r | j d 7_ d | _ q q Wd j | j � S( Ni i i R (
t lent compatR9 R/ R5 R0 R1 t NEWLINEt NLR ( R2 t iterablet tt tok_typeR R" R# R$ ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR � s
c C s% t } g } | j j } | \ } } | t t f k rC | d 7} n | t t f k r^ t } n x� | D]� } | d \ } } | t t f k r� | d 7} n | t k r� | j | � qe nZ | t k r� | j
� qe n> | t t f k r� t } n# | r| r| | d � t } n | | � qe Wd S( NR4 i i����( t FalseR/ R5 t NAMEt NUMBERR< R= t Truet INDENTt DEDENTt pop( R2 R R> t startlinet indentst toks_appendt toknumt tokvalt tok( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR; � s0
( R R R3 R9 R R; ( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR. � s s& ^[ \t\f]*#.*?coding[:=][ \t]*([-\w.]+)s ^[ \t\f]*(?:[#\r\n]|$)c C s^ | d j � j d d � } | d k s7 | j d � r; d S| d k sV | j d
� rZ d S| S( s( Imitates get_normal_name in tokenizer.c.i R t -s utf-8s utf-8-s latin-1s
iso-8859-1s iso-latin-1s latin-1-s iso-8859-1-s iso-latin-1-( s latin-1s
iso-8859-1s iso-latin-1( s latin-1-s iso-8859-1-s iso-latin-1-( t lowert replacet
startswith( t orig_enct enc( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt _get_normal_name� s c s� t � d } d } � f d � } � f d � } | � } | j t � ra t � | d } d } n | sq | g f S| | � } | r� | | g f St j | � s� | | g f S| � } | s� | | g f S| | � } | r� | | | g f S| | | g f S( s
The detect_encoding() function is used to detect the encoding that should
be used to decode a Python source file. It requires one argument, readline,
in the same way as the tokenize() generator.
It will call readline a maximum of twice, and return the encoding used
(as a string) and a list of any lines (left as bytes) it has read
in.
It detects the encoding from the presence of a utf-8 bom or an encoding
cookie as specified in pep-0263. If both a bom and a cookie are present, but
disagree, a SyntaxError will be raised. If the encoding cookie is an invalid
charset, raise a SyntaxError. Note that if a utf-8 bom is found,
'utf-8-sig' is returned.
If no encoding is specified, then the default of 'utf-8' will be returned.
s utf-8c s' y � � SWn t k
r" t � SXd S( N( t
StopIterationt bytes( ( R+ ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt read_or_stop s
c s� y | j d � } Wn t k
r' d SXt j | � } | sA d St | j d � � } y t | � } Wn! t k
r� t d | � � n X� r� | j
d k r� t d � � n | d 7} n | S( Nt asciii s unknown encoding: s utf-8s encoding problem: utf-8s -sig( t decodet UnicodeDecodeErrort Nonet cookie_ret matchRT R
R t LookupErrort SyntaxErrort name( R$ t line_stringR] t encodingt codec( t bom_found( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt find_cookie s"
i s utf-8-sigN( RA R[ RQ R RD t blank_reR] ( R+ Rb t defaultRW Re t firstt second( ( Rd R+ s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt detect_encoding� s0
c C s t � } | j | � S( s� Transform tokens back into Python source code.
Each element returned by the iterable must be a token sequence
with at least two elements, a token number and token value. If
only two tokens are passed, the resulting output is poor.
Round-trip invariant for full input:
Untokenized source will match input source exactly
Round-trip invariant for limited intput:
# Output text will tokenize the back to the input
t1 = [tok[:2] for tok in generate_tokens(f.readline)]
newcode = untokenize(t1)
readline = iter(newcode.splitlines(1)).next
t2 = [tok[:2] for tokin generate_tokens(readline)]
assert t1 == t2
( R. R ( R> t ut( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR F s c c s@ d } } } t j d d } } d \ } } d } d g } x�y
| � }
Wn t k
rf d }
n X| d } d t |
� } } | r{|
s� t d |
f � n | j |
� } | r| j d � } } t | |
| |
| | f | |
f Vd \ } } d } q�| ra|
d d k ra|
d d
k rat | |
|
| t |
� f | f Vd } d } q@ q�| |
} | |
} q@ n`| d k r�| r�|
s�Pn d } xv | | k r|
| d k r�| d } n? |
| d k r�| t
d t
} n |
| d
k rd } n P| d } q�W| | k r'Pn |
| d k r|
| d k r�|
| j d � } | t | � } t | | | f | | t | � f |
f Vt
|
| | | f | t |
� f |
f Vq@ t
t f |
| d k |
| | | f | t |
� f |
f Vq@ n | | d k rI| j | � t |
| | d f | | f |
f Vn x� | | d k r�| | k r�t d d | | |
f � � n | d } t d | | f | | f |
f VqLWn$ |
s�t d | d f f � n d } x| | k r�t j |
| � } | r�| j d � \ } } | | f | | f | } } } |
| | !|
| } } | | k ss| d k r�| d k r�t | | | |
f Vq�| d k r�t } | d k r�t
} n | | | | |
f Vq�| d k r�t | | | |
f Vq�| t k rrt | } | j |
| � } | rR| j d � } |
| | !} t | | | | f |
f Vq�| | f }
|
| } |
} Pq�| t k s�| d t k s�| d t k r| d d k r�| | f }
t | p�t | d p�t | d } |
| d } } |
} Pq�t | | | |
f Vq�| | k r5t | | | |
f Vq�| d k rdt
| | | | f |
f Vd } q�| d k r}| d } n | d k r�| d } n t | | | |
f Vq�t |
| | | f | | d f |
f V| d } q�Wq@ Wx2 | d D]& } t d | d f | d f d f Vq�Wt d | d f | d f d f Vd S( sT
The generate_tokens() generator requires one argument, readline, which
must be a callable object which provides the same interface as the
readline() method of built-in file objects. Each call to the function
should return one line of input as a string. Alternately, readline
can be a callable function terminating with StopIteration:
readline = open(myfile).next # Example of alternate readline
The generator produces 5-tuples with these members: the token type; the
token string; a 2-tuple (srow, scol) of ints specifying the row and
column where the token begins in the source; a 2-tuple (erow, ecol) of
ints specifying the row and column where the token ends in the source;
and the line on which the token was found. The line passed is the
logical line; continuation lines are included.
i R t
0123456789R i s EOF in multi-line stringi����s \
i����s \
R4 s s s #
t #s
i����s3 unindent does not match any outer indentation levels
<tokenize>s EOF in multi-line statementt .i i s
s \s ([{s )]}N( R i ( R i ( t stringt
ascii_lettersR[ RU R: R R] R# t STRINGt
ERRORTOKENt tabsizet rstript COMMENTR= R5 RE t IndentationErrorRF t
pseudoprogt spanRC R< t
triple_quotedt endprogst
single_quotedRB t OPt ENDMARKER( R+ t lnumt parenlevt continuedt namecharst numcharst contstrt needcontt contlineRI R$ t post maxt strstartt endprogt endmatchR# t columnt
comment_tokent nl_post pseudomatchR" t spost eposR t initialt newlinet indent( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR [ s�
&
$
#
'
'
$t __main__( s '''s """s r'''s r"""s R'''s R"""s u'''s u"""s U'''s U"""s b'''s b"""s B'''s B"""s ur'''s ur"""s Ur'''s Ur"""s uR'''s uR"""s UR'''s UR"""s br'''s br"""s Br'''s Br"""s bR'''s bR"""s BR'''s BR"""( R R s r's r"s R's R"s u's u"s U's U"s b's b"s B's B"s ur's ur"s Ur's Ur"s uR's uR"s UR's UR"s br's br"s Br's Br"s bR's bR"s BR's BR"( (R t __doc__t
__author__t __credits__Ro t ret codecsR R t lib2to3.pgen2.tokenR R t dirt xt __all__RV t NameErrort strR
R R t
Whitespacet Commentt Ignoret Namet Binnumbert Hexnumbert Octnumbert Decnumbert Intnumbert Exponentt
Pointfloatt Expfloatt Floatnumbert
Imagnumbert Numbert Singlet Doublet Single3t Double3t Triplet Stringt Operatort Brackett Specialt Funnyt
PlainTokent Tokent ContStrt PseudoExtrast PseudoTokent mapt compilet tokenprogRw t single3progt double3progR[ Rz Ry R? R{ Rs t ExceptionR R R) R R* R. R\ Rf RT Rj R R R t sysR: t argvt openR+ t stdin( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt <module> s�
/
'#
8 I � pgen2/tokenize.pyc 0000644 00000041113 15053244255 0010131 0 ustar 00 �
{ fc @ s d Z d Z d Z d d l Z d d l Z d d l m Z m Z d d l Td d l m
Z
g e e
� D] Z e d d
k rg e ^ qg d d d
g Z
[
y e Wn e k
r� e Z n Xd � Z d � Z d � Z d Z d Z e e d e � e e � Z d Z d Z d Z d Z d Z e e e e e � Z d Z e d d � e e � Z d e Z e e e � Z e d e d � Z! e e! e e � Z" d Z# d Z$ d! Z% d" Z& e d# d$ � Z' e d% d& � Z( e d' d( d) d* d+ d, d- d. d/ � Z) d0 Z* e d1 d2 � Z+ e e) e* e+ � Z, e e" e, e( e � Z- e e- Z. e d3 e d4 d � d5 e d6 d � � Z/ e d e e' � Z0 e e e0 e" e, e/ e � Z1 e2 e j3 e. e1 e% e& f � \ Z4 Z5 Z6 Z7 i& e j3 e# � d4 6e j3 e$ � d6 6e6 d7 6e7 d8 6e6 d9 6e7 d: 6e6 d; 6e7 d< 6e6 d= 6e7 d> 6e6 d? 6e7 d@ 6e6 dA 6e7 dB 6e6 dC 6e7 dD 6e6 dE 6e7 dF 6e6 dG 6e7 dH 6e6 dI 6e7 dJ 6e6 dK 6e7 dL 6e6 dM 6e7 dN 6e6 dO 6e7 dP 6e6 dQ 6e7 dR 6e6 dS 6e7 dT 6d dU 6d dV 6d dW 6d dX 6d dY 6d dZ 6Z9 i Z: x d� D] Z; e; e: e; <q�Wi Z< x d� D] Z; e; e< e; <qWdw Z= dx e> f dy � � YZ? dz e> f d{ � � YZ@ d| � ZA eA d} � ZB d~ � ZC d d� d� � � YZD e j3 d� � ZE e j3 d� � ZF d� � ZG d� � ZH d� � ZI d� � ZJ eK d� k rd d lL ZL eM eL jN � d k reB eO eL jN d � jP � qeB eL jQ jP � n d S(� s� Tokenization help for Python programs.
generate_tokens(readline) is a generator that breaks a stream of
text into Python tokens. It accepts a readline-like method which is called
repeatedly to get the next line of input (or "" for EOF). It generates
5-tuples with these members:
the token type (see token.py)
the token (a string)
the starting (row, column) indices of the token (a 2-tuple of ints)
the ending (row, column) indices of the token (a 2-tuple of ints)
the original line (string)
It is designed to match the working of the Python tokenizer exactly, except
that it produces COMMENT tokens for comments and gives type OP for all
operators
Older entry points
tokenize_loop(readline, tokeneater)
tokenize(readline, tokeneater=printtoken)
are the same, except instead of generating tokens, tokeneater is a callback
function to which the 5 fields described above are passed as 5 arguments,
each time a new token is found.s Ka-Ping Yee <ping@lfw.org>s@ GvR, ESR, Tim Peters, Thomas Wouters, Fred Drake, Skip Montanaroi����N( t BOM_UTF8t lookup( t *i ( t tokeni t _t tokenizet generate_tokenst
untokenizec G s d d j | � d S( Nt (t |t )( t join( t choices( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt group0 t c G s t | � d S( NR ( R
( R ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt any1 R c G s t | � d S( Nt ?( R
( R ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt maybe2 R s [ \f\t]*s #[^\r\n]*s \\\r?\ns [a-zA-Z_]\w*s
0[bB][01]*s 0[xX][\da-fA-F]*[lL]?s 0[oO]?[0-7]*[lL]?s
[1-9]\d*[lL]?s [eE][-+]?\d+s \d+\.\d*s \.\d+s \d+s \d+[jJ]s [jJ]s [^'\\]*(?:\\.[^'\\]*)*'s [^"\\]*(?:\\.[^"\\]*)*"s% [^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''s% [^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""s [ubUB]?[rR]?'''s [ubUB]?[rR]?"""s& [uU]?[rR]?'[^\n'\\]*(?:\\.[^\n'\\]*)*'s& [uU]?[rR]?"[^\n"\\]*(?:\\.[^\n"\\]*)*"s \*\*=?s >>=?s <<=?s <>s !=s //=?s ->s [+\-*/%&@|^=<>]=?t ~s [][(){}]s \r?\ns [:;.,`@]s' [uUbB]?[rR]?'[^\n'\\]*(?:\\.[^\n'\\]*)*t 's' [uUbB]?[rR]?"[^\n"\\]*(?:\\.[^\n"\\]*)*t "s '''s """s r'''s r"""s u'''s u"""s b'''s b"""s ur'''s ur"""s br'''s br"""s R'''s R"""s U'''s U"""s B'''s B"""s uR'''s uR"""s Ur'''s Ur"""s UR'''s UR"""s bR'''s bR"""s Br'''s Br"""s BR'''s BR"""t rt Rt ut Ut bt Bs r's r"s R's R"s u's u"s U's U"s b's b"s B's B"s ur's ur"s Ur's Ur"s uR's uR"s UR's UR"s br's br"s Br's Br"s bR's bR"s BR's BR"i t
TokenErrorc B s e Z RS( ( t __name__t
__module__( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR � s t StopTokenizingc B s e Z RS( ( R R ( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR � s c C sA | \ } } | \ } } d | | | | t | t | � f GHd S( Ns %d,%d-%d,%d: %s %s( t tok_namet repr( t typeR t startt endt linet srowt scolt erowt ecol( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt
printtoken� s c C s) y t | | � Wn t k
r$ n Xd S( s:
The tokenize() function accepts two parameters: one representing the
input stream, and one providing an output mechanism for tokenize().
The first parameter, readline, must be a callable object which provides
the same interface as the readline() method of built-in file objects.
Each call to the function should return one line of input as a string.
The second parameter, tokeneater, must also be a callable object. It is
called once for each token, with five arguments, corresponding to the
tuples generated by generate_tokens().
N( t
tokenize_loopR ( t readlinet
tokeneater( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR � s
c C s% x t | � D] } | | � q
Wd S( N( R ( R+ R, t
token_info( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR* � s t Untokenizerc B s, e Z d � Z d � Z d � Z d � Z RS( c C s g | _ d | _ d | _ d S( Ni i ( t tokenst prev_rowt prev_col( t self( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt __init__� s c C sO | \ } } | | j k s! t � | | j } | rK | j j d | � n d S( Nt ( R0 t AssertionErrorR1 R/ t append( R2 R" t rowt colt
col_offset( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt add_whitespace� s
c C s� x� | D]� } t | � d k r3 | j | | � Pn | \ } } } } } | j | � | j j | � | \ | _ | _ | t t f k r | j d 7_ d | _ q q Wd j | j � S( Ni i i R (
t lent compatR: R/ R6 R0 R1 t NEWLINEt NLR ( R2 t iterablet tt tok_typeR R" R# R$ ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR � s
c C s% t } g } | j j } | \ } } | t t f k rC | d 7} n | t t f k r^ t } n x� | D]� } | d \ } } | t t f k r� | d 7} n | t k r� | j | � qe nZ | t k r� | j
� qe n> | t t f k r� t } n# | r| r| | d � t } n | | � qe Wd S( NR4 i i����( t FalseR/ R6 t NAMEt NUMBERR= R> t Truet INDENTt DEDENTt pop( R2 R R? t startlinet indentst toks_appendt toknumt tokvalt tok( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR< � s0
( R R R3 R: R R< ( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR. � s s& ^[ \t\f]*#.*?coding[:=][ \t]*([-\w.]+)s ^[ \t\f]*(?:[#\r\n]|$)c C s^ | d j � j d d � } | d k s7 | j d � r; d S| d k sV | j d
� rZ d S| S( s( Imitates get_normal_name in tokenizer.c.i R t -s utf-8s utf-8-s latin-1s
iso-8859-1s iso-latin-1s latin-1-s iso-8859-1-s iso-latin-1-( s latin-1s
iso-8859-1s iso-latin-1( s latin-1-s iso-8859-1-s iso-latin-1-( t lowert replacet
startswith( t orig_enct enc( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt _get_normal_name� s c s� t � d } d } � f d � } � f d � } | � } | j t � ra t � | d } d } n | sq | g f S| | � } | r� | | g f St j | � s� | | g f S| � } | s� | | g f S| | � } | r� | | | g f S| | | g f S( s
The detect_encoding() function is used to detect the encoding that should
be used to decode a Python source file. It requires one argument, readline,
in the same way as the tokenize() generator.
It will call readline a maximum of twice, and return the encoding used
(as a string) and a list of any lines (left as bytes) it has read
in.
It detects the encoding from the presence of a utf-8 bom or an encoding
cookie as specified in pep-0263. If both a bom and a cookie are present, but
disagree, a SyntaxError will be raised. If the encoding cookie is an invalid
charset, raise a SyntaxError. Note that if a utf-8 bom is found,
'utf-8-sig' is returned.
If no encoding is specified, then the default of 'utf-8' will be returned.
s utf-8c s' y � � SWn t k
r" t � SXd S( N( t
StopIterationt bytes( ( R+ ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt read_or_stop s
c s� y | j d � } Wn t k
r' d SXt j | � } | sA d St | j d � � } y t | � } Wn! t k
r� t d | � � n X� r� | j
d k r� t d � � n | d 7} n | S( Nt asciii s unknown encoding: s utf-8s encoding problem: utf-8s -sig( t decodet UnicodeDecodeErrort Nonet cookie_ret matchRU R
R t LookupErrort SyntaxErrort name( R$ t line_stringR^ t encodingt codec( t bom_found( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt find_cookie s"
i s utf-8-sigN( RB R\ RR R RE t blank_reR^ ( R+ Rc t defaultRX Rf t firstt second( ( Re R+ s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt detect_encoding� s0
c C s t � } | j | � S( s� Transform tokens back into Python source code.
Each element returned by the iterable must be a token sequence
with at least two elements, a token number and token value. If
only two tokens are passed, the resulting output is poor.
Round-trip invariant for full input:
Untokenized source will match input source exactly
Round-trip invariant for limited intput:
# Output text will tokenize the back to the input
t1 = [tok[:2] for tok in generate_tokens(f.readline)]
newcode = untokenize(t1)
readline = iter(newcode.splitlines(1)).next
t2 = [tok[:2] for tokin generate_tokens(readline)]
assert t1 == t2
( R. R ( R? t ut( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR F s c c sV d } } } t j d d } } d \ } } d } d g } x�y
| � }
Wn t k
rf d }
n X| d } d t |
� } } | r{|
s� t d |
f � n | j |
� } | r| j d � } } t | |
| |
| | f | |
f Vd \ } } d } q�| ra|
d d k ra|
d d
k rat | |
|
| t |
� f | f Vd } d } q@ q�| |
} | |
} q@ n`| d k r�| r�|
s�Pn d } xv | | k r|
| d k r�| d } n? |
| d k r�| t
d t
} n |
| d
k rd } n P| d } q�W| | k r'Pn |
| d k r|
| d k r�|
| j d � } | t | � } t | | | f | | t | � f |
f Vt
|
| | | f | t |
� f |
f Vq@ t
t f |
| d k |
| | | f | t |
� f |
f Vq@ n | | d k rI| j | � t |
| | d f | | f |
f Vn x� | | d k r�| | k r�t d d | | |
f � � n | d } t d | | f | | f |
f VqLWn$ |
s�t d | d f f � n d } x| | k r�t j |
| � } | r�| j d � \ } } | | f | | f | } } } |
| | !|
| } } | | k ss| d k r�| d k r�t | | | |
f Vq�| d k r�t } | d k r�t
} n | | | | |
f Vq�| d k r| j d � s�t � t | | | |
f Vq�| t k r�t | } | j |
| � } | rh| j d � } |
| | !} t | | | | f |
f Vq�| | f }
|
| } |
} Pq�| t k s�| d t k s�| d t k r(| d d k r| | f }
t | p�t | d p�t | d } |
| d } } |
} Pq�t | | | |
f Vq�| | k rKt | | | |
f Vq�| d k rzt
| | | | f |
f Vd } q�| d k r�| d } n | d k r�| d } n t | | | |
f Vq�t |
| | | f | | d f |
f V| d } q�Wq@ Wx2 | d D]& } t d | d f | d f d f VqWt d | d f | d f d f Vd S( sT
The generate_tokens() generator requires one argument, readline, which
must be a callable object which provides the same interface as the
readline() method of built-in file objects. Each call to the function
should return one line of input as a string. Alternately, readline
can be a callable function terminating with StopIteration:
readline = open(myfile).next # Example of alternate readline
The generator produces 5-tuples with these members: the token type; the
token string; a 2-tuple (srow, scol) of ints specifying the row and
column where the token begins in the source; a 2-tuple (erow, ecol) of
ints specifying the row and column where the token ends in the source;
and the line on which the token was found. The line passed is the
logical line; continuation lines are included.
i R t
0123456789R i s EOF in multi-line stringi����s \
i����s \
R4 s s s #
t #s
i����s3 unindent does not match any outer indentation levels
<tokenize>s EOF in multi-line statementt .s
i i s \s ([{s )]}N( R i ( R i ( t stringt
ascii_lettersR\ RV R; R R^ R# t STRINGt
ERRORTOKENt tabsizet rstript COMMENTR> R6 RF t IndentationErrorRG t
pseudoprogt spanRD R= t endswithR5 t
triple_quotedt endprogst
single_quotedRC t OPt ENDMARKER( R+ t lnumt parenlevt continuedt namecharst numcharst contstrt needcontt contlineRJ R$ t post maxt strstartt endprogt endmatchR# t columnt
comment_tokent nl_post pseudomatchR" t spost eposR t initialt newlinet indent( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyR [ s�
&
$
#
'
'
$t __main__( s '''s """s r'''s r"""s R'''s R"""s u'''s u"""s U'''s U"""s b'''s b"""s B'''s B"""s ur'''s ur"""s Ur'''s Ur"""s uR'''s uR"""s UR'''s UR"""s br'''s br"""s Br'''s Br"""s bR'''s bR"""s BR'''s BR"""( R R s r's r"s R's R"s u's u"s U's U"s b's b"s B's B"s ur's ur"s Ur's Ur"s uR's uR"s UR's UR"s br's br"s Br's Br"s bR's bR"s BR's BR"( (R t __doc__t
__author__t __credits__Rp t ret codecsR R t lib2to3.pgen2.tokenR R t dirt xt __all__RW t NameErrort strR
R R t
Whitespacet Commentt Ignoret Namet Binnumbert Hexnumbert Octnumbert Decnumbert Intnumbert Exponentt
Pointfloatt Expfloatt Floatnumbert
Imagnumbert Numbert Singlet Doublet Single3t Double3t Triplet Stringt Operatort Brackett Specialt Funnyt
PlainTokent Tokent ContStrt PseudoExtrast PseudoTokent mapt compilet tokenprogRx t single3progt double3progR\ R| R{ R@ R} Rt t ExceptionR R R) R R* R. R] Rg RU Rk R R R t sysR; t argvt openR+ t stdin( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/tokenize.pyt <module> s�
/
'#
8 I � pgen2/__init__.pyo 0000644 00000000256 15053244255 0010057 0 ustar 00 �
{ fc @ s
d Z d S( s The pgen2 package.N( t __doc__( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/__init__.pyt <module> t pgen2/parse.pyc 0000644 00000016104 15053244255 0007415 0 ustar 00 �
{ fc @ sF d Z d d l m Z d e f d � � YZ d e f d � � YZ d S( s� Parser engine for the grammar tables generated by pgen.
The grammar table must be loaded first.
See Parser/parser.c in the Python distribution for additional info on
how this parsing engine works.
i ( t tokent
ParseErrorc B s e Z d Z d � Z RS( s( Exception to signal the parser is stuck.c C sH t j | d | | | | f � | | _ | | _ | | _ | | _ d S( Ns! %s: type=%r, value=%r, context=%r( t Exceptiont __init__t msgt typet valuet context( t selfR R R R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR s ( t __name__t
__module__t __doc__R ( ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR s t Parserc B sS e Z d Z d d � Z d d � Z d � Z d � Z d � Z d � Z d � Z
RS( s5 Parser engine.
The proper usage sequence is:
p = Parser(grammar, [converter]) # create instance
p.setup([start]) # prepare for parsing
<for each input token>:
if p.addtoken(...): # parse a token; may raise ParseError
break
root = p.rootnode # root of abstract syntax tree
A Parser instance may be reused by calling setup() repeatedly.
A Parser instance contains state pertaining to the current token
sequence, and should not be used concurrently by different threads
to parse separate token sequences.
See driver.py for how to get input tokens by tokenizing a file or
string.
Parsing is complete when addtoken() returns True; the root of the
abstract syntax tree can then be retrieved from the rootnode
instance variable. When a syntax error occurs, addtoken() raises
the ParseError exception. There is no error recovery; the parser
cannot be used after a syntax error was reported (but it can be
reinitialized by calling setup()).
c C s | | _ | p d � | _ d S( s� Constructor.
The grammar argument is a grammar.Grammar instance; see the
grammar module for more information.
The parser is not ready yet for parsing; you must call the
setup() method to get it started.
The optional convert argument is a function mapping concrete
syntax tree nodes to abstract syntax tree nodes. If not
given, no conversion is done and the syntax tree produced is
the concrete syntax tree. If given, it must be a function of
two arguments, the first being the grammar (a grammar.Grammar
instance), and the second being the concrete syntax tree node
to be converted. The syntax tree is converted from the bottom
up.
A concrete syntax tree node is a (type, value, context, nodes)
tuple, where type is the node type (a token or symbol number),
value is None for symbols and a string for tokens, context is
None or an opaque value used for error reporting (typically a
(lineno, offset) pair), and nodes is a list of children for
symbols, and None for tokens.
An abstract syntax tree node may be anything; this is entirely
up to the converter function.
c S s | S( N( ( t grammart node( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyt <lambda>W t N( R
t convert( R R
R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR 9 s c C sk | d k r | j j } n | d d g f } | j j | d | f } | g | _ d | _ t � | _ d S( s� Prepare for parsing.
This *must* be called before starting to parse.
The optional argument is an alternative start symbol; it
defaults to the grammar's start symbol.
You can use a Parser instance to parse any number of programs;
each time you call setup() the parser is reset to an initial
state determined by the (implicit or explicit) start symbol.
i N( t NoneR
t startt dfast stackt rootnodet sett
used_names( R R t newnodet
stackentry( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyt setupY s
c C s� | j | | | � } x�t r�| j d \ } } } | \ } } | | }
xq|
D]\ } } | j j | \ }
} | | k r
|
d k s� t � | j | | | | � | } xV | | d | f g k r| j � | j s� t S| j d \ } } } | \ } } q� Wt S|
d k rQ | j j |
} | \ } } | | k re| j
|
| j j |
| | � PqeqQ qQ Wd | f |
k r�| j � | j s�t d | | | � � q�q t d | | | � � q Wd S( s< Add a token; return True iff this is the end of the program.i����i i s too much inputs bad inputN( t classifyt TrueR R
t labelst AssertionErrort shiftt popt FalseR t pushR ( R R R R t ilabelt dfat stateR t statest firstt arcst it newstatet tt vt itsdfat itsstatest itsfirst( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyt addtokenq s<
c C s� | t j k rG | j j | � | j j j | � } | d k rG | Sn | j j j | � } | d k r� t d | | | � � n | S( s& Turn a token into a label. (Internal)s bad tokenN(
R t NAMER t addR
t keywordst getR t tokensR ( R R R R R$ ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR � s c C sw | j d \ } } } | | | d f } | j | j | � } | d k r] | d j | � n | | | f | j d <d S( s Shift a token. (Internal)i����N( R R R R
t append( R R R R+ R R% R& R R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR � s c C s[ | j d \ } } } | d | g f } | | | f | j d <| j j | d | f � d S( s Push a nonterminal. (Internal)i����i N( R R R7 ( R R t newdfaR+ R R% R& R R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR# � s c C s� | j j � \ } } } | j | j | � } | d k r� | j rl | j d \ } } } | d j | � q� | | _ | j | j _ n d S( s Pop a nonterminal. (Internal)i����N( R R! R R
R R7 R R ( R t popdfat popstatet popnodeR R% R& R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR! � s N( R R
R R R R R1 R R R# R! ( ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyR s 0 N( R R R R R t objectR ( ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/parse.pyt <module> s pgen2/pgen.pyc 0000644 00000027716 15053244255 0007247 0 ustar 00 �
{ fc @ s� d d l m Z m Z m Z d e j f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d
d � Z
d S(
i ( t grammart tokent tokenizet PgenGrammarc B s e Z RS( ( t __name__t
__module__( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR s t ParserGeneratorc B s� e Z d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z
d � Z d � Z d
� Z
d � Z d � Z d
� Z d � Z d d � Z d � Z d � Z RS( c C s� d } | d k r* t | � } | j } n | | _ | | _ t j | j � | _ | j � | j
� \ | _ | _ | d k r� | � n i | _
| j � d S( N( t Nonet opent closet filenamet streamR t generate_tokenst readlinet generatort gettokent parset dfast startsymbolt firstt addfirstsets( t selfR
R t close_stream( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt __init__ s
c C s� t � } | j j � } | j � | j | j � | j d | j � x; | D]3 } d t | j � } | | j | <| | j | <qL Wx� | D]� } | j | } g } x� | D]� } g } xK t
| j j � � D]4 \ } }
| j
| j | | � | j |
� f � q� W| j r,| j
d | j | � f � n | j
| � q� W| j j
| � | | j | | � f | j | j | <q� W| j | j | _ | S( Ni i ( R R t keyst sortt removeR t insertt lent
symbol2numbert
number2symbolt sortedt arcst iteritemst appendt
make_labelt indext isfinalt statest
make_firstt start( R t ct namest namet it dfaR& t stateR t labelt next( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt make_grammar s.
", *c C sJ | j | } i } x0 t | � D]" } | j | | � } d | | <q W| S( Ni ( R R R# ( R R) R+ t rawfirstR R/ t ilabel( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR' 4 s
c C s� t | j � } | d j � r | | j k ry | | j k rH | j | S| j j | j | d f � | | j | <| Sq�t t | d � } t | t
t f � s� t | � � | t j
k s� t | � � | | j k r� | j | S| j j | d f � | | j | <| Sn� | d d k s't | � � t | � } | d j � r�| | j k r]| j | S| j j t j | f � | | j | <| SnN t j | } | | j k r�| j | S| j j | d f � | | j | <| Sd S( Ni t "t '( R4 R5 ( R t labelst isalphaR t symbol2labelR" R t getattrR t
isinstancet intt longt AssertionErrort tok_namet tokenst evalt keywordst NAMER t opmap( R R) R/ R3 t itokent value( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR# = s<
!
c C sM | j j � } | j � x- | D]% } | | j k r | j | � q q Wd S( N( R R R R t calcfirst( R R* R+ ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR k s
c C sj | j | } d | j | <| d } i } i } x� | j j � D]� \ } } | | j k r� | | j k r� | j | } | d k r� t d | � � q� n | j | � | j | } | j | � | | | <q@ d | | <i d | 6| | <q@ Wi } xd | j � D]V \ } }
xG |
D]? } | | k rGt d | | | | | f � � n | | | <qWq� W| | j | <d S( Ni s recursion for rule %ri sA rule %s is ambiguous; %s is in the first sets of %s as well as %s( R R R R R! t
ValueErrorRF t update( R R+ R- R. t totalsett overlapcheckR/ R0 t fsett inverset itsfirstt symbol( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRF s s2
c C s� i } d } x� | j t j k r� x | j t j k rC | j � q$ W| j t j � } | j t j d � | j � \ } } | j t j � | j
| | � } t | � } | j | � t | � } | | | <| d k r | } q q W| | f S( Nt :(
R t typeR t ENDMARKERt NEWLINER t expectRB t OPt parse_rhst make_dfaR t simplify_dfa( R R R R+ t at zR- t oldlent newlen( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR � s"
c sD t | t � s t � t | t � s* t � � f d � } � f d � � t | | � | � g } x� | D]� } i } xS | j D]H } x? | j D]4 \ } } | d k r� � | | j | i � � q� q� Wq} Wxp t | j � � D]\ \ } }
x= | D] } | j |
k r� Pq� q� Wt |
| � } | j
| � | j | | � q� Wqg W| S( Nc s i } � | | � | S( N( ( R. t base( t
addclosure( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt closure� s
c si t | t � s t � | | k r% d Sd | | <x3 | j D]( \ } } | d k r9 � | | � q9 q9 Wd S( Ni ( R: t NFAStateR= R R ( R. R\ R/ R0 ( R] ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR] � s
( R: R_ R= t DFAStatet nfasetR R t
setdefaultR R! R" t addarc( R R( t finishR^ R& R. R t nfastateR/ R0 Ra t st( ( R] s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRV � s&
$
c
C s� d G| GH| g } x� t | � D]� \ } } d G| G| | k rE d pH d GHxu | j D]j \ } } | | k r~ | j | � } n t | � } | j | � | d k r� d | GHqT d | | f GHqT Wq Wd S( Ns Dump of NFA fors States (final)t s -> %ds %s -> %d( t enumerateR R$ R R" R (
R R+ R( Rd t todoR, R. R/ R0 t j( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt dump_nfa� s
c C s� d G| GHxt t | � D]f \ } } d G| G| j r9 d p< d GHx; t | j j � � D]$ \ } } d | | j | � f GHqT Wq Wd S( Ns Dump of DFA fors States (final)Rg s %s -> %d( Rh R% R R R! R$ ( R R+ R- R, R. R/ R0 ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt dump_dfa� s
"c C s� t } x� | r� t } x� t | � D]x \ } } xi t | d t | � � D]N } | | } | | k rH | | =x | D] } | j | | � qr Wt } PqH qH Wq" Wq Wd S( Ni ( t Truet FalseRh t rangeR t
unifystate( R R- t changesR, t state_iRj t state_jR. ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRW � s
c C s� | j � \ } } | j d k r+ | | f St � } t � } | j | � | j | � xI | j d k r� | j � | j � \ } } | j | � | j | � qZ W| | f Sd S( Nt |( t parse_altRE R_ Rc R ( R RX RY t aat zz( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRU � s
c C sr | j � \ } } xS | j d k s? | j t j t j f k rg | j � \ } } | j | � | } q W| | f S( Nt (t [( Rx Ry ( t
parse_itemRE RP R RB t STRINGRc ( R RX t bR) t d( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRu
s
c C s� | j d k rU | j � | j � \ } } | j t j d � | j | � | | f S| j � \ } } | j } | d k r� | | f S| j � | j | � | d k r� | | f S| | f Sd S( NRy t ]t +t *( R R� ( RE R RU RS R RT Rc t
parse_atom( R RX RY RE ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRz s
c C s� | j d k rH | j � | j � \ } } | j t j d � | | f S| j t j t j f k r� t � } t � } | j
| | j � | j � | | f S| j d | j | j � d S( NRx t )s+ expected (...) or NAME or STRING, got %s/%s( RE R RU RS R RT RP RB R{ R_ Rc t raise_error( R RX RY ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR� ( s
c C sc | j | k s* | d k rL | j | k rL | j d | | | j | j � n | j } | j � | S( Ns expected %s/%s, got %s/%s( RP R RE R� R ( R RP RE ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRS 9 s *
c C si | j j � } x/ | d t j t j f k r@ | j j � } q W| \ | _ | _ | _ | _ | _ d S( Ni (
R R0 R t COMMENTt NLRP RE t begint endt line( R t tup( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR A s c G ss | r@ y | | } Wq@ d j | g t t | � � } q@ Xn t | | j | j d | j d | j f � � d S( Nt i i ( t joint mapt strt SyntaxErrorR
R� R� ( R t msgt args( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR� H s &N( R R R R R1 R' R# R RF R RV Rk Rl RW RU Ru Rz R� RS R R� ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR
s$ . $
R_ c B s e Z d � Z d d � Z RS( c C s
g | _ d S( N( R ( R ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR S s c C sP | d k s! t | t � s! t � t | t � s6 t � | j j | | f � d S( N( R R: R� R= R_ R R" ( R R0 R/ ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRc V s !N( R R R R Rc ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR_ Q s R` c B s2 e Z d � Z d � Z d � Z d � Z d Z RS( c C sp t | t � s t � t t | � j � t � s6 t � t | t � sK t � | | _ | | k | _ i | _ d S( N( R: t dictR= t iterR0 R_ Ra R% R ( R Ra t final( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR ] s ! c C sP t | t � s t � | | j k s* t � t | t � s? t � | | j | <d S( N( R: R� R= R R` ( R R0 R/ ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRc e s c C s@ x9 | j j � D]( \ } } | | k r | | j | <q q Wd S( N( R R! ( R t oldt newR/ R0 ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyRp k s c C s� t | t � s t � | j | j k r+ t St | j � t | j � k rM t Sx9 | j j � D]( \ } } | | j j | � k r] t Sq] Wt S( N(
R: R` R= R% Rn R R R! t getRm ( R t otherR/ R0 ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt __eq__p s N( R R R Rc Rp R� R t __hash__( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyR` [ s
s Grammar.txtc C s t | � } | j � S( N( R R1 ( R
t p( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt generate_grammar� s N( Rg R R R t GrammarR t objectR R_ R` R� ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/pgen.pyt <module> s � H
% pgen2/conv.pyo 0000644 00000015575 15053244255 0007277 0 ustar 00 �
{ fc @ sE d Z d d l Z d d l m Z m Z d e j f d � � YZ d S( s� Convert graminit.[ch] spit out by pgen to Python code.
Pgen is the Python parser generator. It is useful to quickly create a
parser from a grammar file in Python's grammar notation. But I don't
want my parsers to be written in C (yet), so I'm translating the
parsing tables to Python data structures and writing a Python parse
engine.
Note that the token numbers are constants determined by the standard
Python tokenizer. The standard token module defines these numbers and
their names (the names are not used much). The token numbers are
hardcoded into the Python tokenizer and into pgen. A Python
implementation of the Python tokenizer is also available, in the
standard tokenize module.
On the other hand, symbol numbers (representing the grammar's
non-terminals) are assigned by pgen based on the actual grammar
input.
Note: this module is pretty much obsolete; the pgen module generates
equivalent grammar tables directly from the Grammar.txt input file
without having to invoke the Python pgen C program.
i����N( t grammart tokent Converterc B s2 e Z d Z d � Z d � Z d � Z d � Z RS( s2 Grammar subclass that reads classic pgen output files.
The run() method reads the tables as produced by the pgen parser
generator, typically contained in two C files, graminit.h and
graminit.c. The other methods are for internal use only.
See the base class for more documentation.
c C s( | j | � | j | � | j � d S( s< Load the grammar tables from the text files written by pgen.N( t parse_graminit_ht parse_graminit_ct
finish_off( t selft
graminit_ht
graminit_c( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyt run/ s
c C s� y t | � } Wn# t k
r5 } d | | f GHt SXi | _ i | _ d } x� | D]� } | d 7} t j d | � } | r� | j � r� d | | | j � f GHqU | j � \ } } t | � } | | j | <| | j | <qU Wt
S( s� Parse the .h file written by pgen. (Internal)
This file is a sequence of #define statements defining the
nonterminals of the grammar as numbers. We build two tables
mapping the numbers to names and back.
s Can't open %s: %si i s ^#define\s+(\w+)\s+(\d+)$s %s(%s): can't parse %s( t opent IOErrort Falset
symbol2numbert
number2symbolt ret matcht stript groupst intt True( R t filenamet ft errt linenot linet mot symbolt number( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyR 5 s&
c ! C sH y t | � } Wn# t k
r5 } d | | f GHt SXd } | d | j � } } | d | j � } } | d | j � } } i } g } x�| j d � r�x� | j d � r�t j d | � } t t | j � � \ } }
} g } xk t
| � D]] }
| d | j � } } t j d | � } t t | j � � \ } } | j | | f � q� W| d | j � } } | | | |
f <| d | j � } } q� Wt j d | � } t t | j � � \ } } g } xx t
| � D]j }
| d | j � } } t j d | � } t t | j � � \ } } }
| | |
f } | j | � q�W| j | � | d | j � } } | d | j � } } q� W| | _ i } t j d | � } t | j
d � � } x:t
| � D],} | d | j � } } t j d
| � } | j
d � } t t | j
d d d
d � � \ } } } } | | } | d | j � } } t j d | � } i } t | j
d � � } x` t | � D]R \ } } t | � } x7 t
d � D]) } | d | >@r�d | | d | <q�q�Wq�W| | f | | <q�W| d | j � } } | | _ g } | d | j � } } t j d | � } t | j
d � � } x� t
| � D]� } | d | j � } } t j d | � } | j � \ } } t | � } | d k r�d } n t | � } | j | | f � qhW| d | j � } } | | _ | d | j � } } | d | j � } } t j d | � } t | j
d � � } | d | j � } } | d | j � } } t j d | � } t | j
d � � } | d | j � } } t j d | � } t | j
d � � } | | _ | d | j � } } y | d | j � } } Wn t k
rCn Xd S( s� Parse the .c file written by pgen. (Internal)
The file looks as follows. The first two lines are always this:
#include "pgenheaders.h"
#include "grammar.h"
After that come four blocks:
1) one or more state definitions
2) a table defining dfas
3) a table defining labels
4) a struct defining the grammar
A state definition has the following form:
- one or more arc arrays, each of the form:
static arc arcs_<n>_<m>[<k>] = {
{<i>, <j>},
...
};
- followed by a state array, of the form:
static state states_<s>[<t>] = {
{<k>, arcs_<n>_<m>},
...
};
s Can't open %s: %si i s static arc s) static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$s \s+{(\d+), (\d+)},$s' static state states_(\d+)\[(\d+)\] = {$s \s+{(\d+), arcs_(\d+)_(\d+)},$s static dfa dfas\[(\d+)\] = {$s0 \s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$i i i i s \s+("(?:\\\d\d\d)*")},$i s! static label labels\[(\d+)\] = {$s \s+{(\d+), (0|"\w+")},$t 0s
\s+(\d+),$s \s+{(\d+), labels},$s \s+(\d+)$N( R
R R t nextt
startswithR R t mapR R t ranget appendt statest groupt evalt enumeratet ordt dfast Nonet labelst startt
StopIteration(! R R R R R R t allarcsR# R t nt mt kt arcst _t it jt st tt stateR( t ndfasR R t xt yt zt firstt rawbitsett ct byteR* t nlabelsR+ ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyR T s�
-
c C s� i | _ i | _ xj t | j � D]Y \ } \ } } | t j k r_ | d k r_ | | j | <q" | d k r" | | j | <q" q" Wd S( s1 Create additional useful structures. (Internal).N( t keywordst tokensR& R* R t NAMER) ( R t ilabelt typet value( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyR � s " ( t __name__t
__module__t __doc__R R R R ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyR $ s
�( RI R t pgen2R R t GrammarR ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyt <module> s pgen2/grammar.pyc 0000644 00000017004 15053244255 0007731 0 ustar 00 �
{ fc @ s� d Z d d l Z d d l Z d d l m Z m Z d e f d � � YZ d � Z d Z i Z
xB e j � D]4 Z e rl e j
� \ Z Z e e e � e
e <ql ql Wd S( s� This module defines the data structures used to represent a grammar.
These are a bit arcane because they are derived from the data
structures used by Python's 'pgen' parser generator.
There's also a table here mapping operators to their names in the
token module; the Python tokenize module reports all operators as the
fallback token code OP, but the parser needs the actual token code.
i����Ni ( t tokent tokenizet Grammarc B sD e Z d Z d � Z d � Z d � Z d � Z d � Z d � Z RS( s� Pgen parsing tables conversion class.
Once initialized, this class supplies the grammar tables for the
parsing engine implemented by parse.py. The parsing engine
accesses the instance variables directly. The class here does not
provide initialization of the tables; several subclasses exist to
do this (see the conv and pgen modules).
The load() method reads the tables from a pickle file, which is
much faster than the other ways offered by subclasses. The pickle
file is written by calling dump() (after loading the grammar
tables using a subclass). The report() method prints a readable
representation of the tables to stdout, for debugging.
The instance variables are as follows:
symbol2number -- a dict mapping symbol names to numbers. Symbol
numbers are always 256 or higher, to distinguish
them from token numbers, which are between 0 and
255 (inclusive).
number2symbol -- a dict mapping numbers to symbol names;
these two are each other's inverse.
states -- a list of DFAs, where each DFA is a list of
states, each state is a list of arcs, and each
arc is a (i, j) pair where i is a label and j is
a state number. The DFA number is the index into
this list. (This name is slightly confusing.)
Final states are represented by a special arc of
the form (0, j) where j is its own state number.
dfas -- a dict mapping symbol numbers to (DFA, first)
pairs, where DFA is an item from the states list
above, and first is a set of tokens that can
begin this grammar rule (represented by a dict
whose values are always 1).
labels -- a list of (x, y) pairs where x is either a token
number or a symbol number, and y is either None
or a string; the strings are keywords. The label
number is the index in this list; label numbers
are used to mark state transitions (arcs) in the
DFAs.
start -- the number of the grammar's start symbol.
keywords -- a dict mapping keyword strings to arc labels.
tokens -- a dict mapping token numbers to arc labels.
c C sX i | _ i | _ g | _ i | _ d g | _ i | _ i | _ i | _ d | _ d S( Ni t EMPTYi ( i R ( t
symbol2numbert
number2symbolt statest dfast labelst keywordst tokenst symbol2labelt start( t self( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyt __init__M s c C s> t | d � �) } t | j � } t j | | d � Wd QXd S( s� Dump the grammar tables to a pickle file.
dump() recursively changes all dict to OrderedDict, so the pickled file
is not exactly the same as what was passed in to dump(). load() uses the
pickled file to create the tables, but only changes OrderedDict to dict
at the top level; it does not recursively change OrderedDict to dict.
So, the loaded tables are different from the original tables that were
passed to load() in that some of the OrderedDict (from the pickled file)
are not changed back to dict. For parsing, this has no effect on
performance because OrderedDict uses dict's __getitem__ with nothing in
between.
t wbi N( t opent _make_deterministict __dict__t picklet dump( R
t filenamet ft d( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR X s
c C s< t | d � } t j | � } | j � | j j | � d S( s+ Load the grammar tables from a pickle file.t rbN( R R t loadt closeR t update( R
R R R ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR i s
c C s | j j t j | � � d S( s3 Load the grammar tables from a pickle bytes object.N( R R R t loads( R
t pkl( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR p s c C sf | j � } x- d D]% } t | | t | | � j � � q W| j | _ | j | _ | j | _ | S( s#
Copy the grammar.
R R R R R
R ( R R R R R
R ( t __class__t setattrt getattrt copyR R R ( R
t newt dict_attr( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR! t s
#
c C sz d d l m } d GH| | j � d GH| | j � d GH| | j � d GH| | j � d GH| | j � d G| j GHd S(
s: Dump the grammar tables to standard output, for debugging.i����( t pprintt s2nt n2sR R R R N( R$ R R R R R R ( R
R$ ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyt report� s
( t __name__t
__module__t __doc__R R R R R! R' ( ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR s 4
c C s� t | t � r2 t j t d � | j � D� � � St | t � r^ g | D] } t | � ^ qH St | t � r� t d � | D� � S| S( Nc s s' | ] \ } } | t | � f Vq d S( N( R ( t .0t kt v( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pys <genexpr>� s c s s | ] } t | � Vq d S( N( R ( R+ t e( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pys <genexpr>� s ( t
isinstancet dictt collectionst OrderedDictt sortedt iteritemst listR t tuple( t topR. ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyR � s s
( LPAR
) RPAR
[ LSQB
] RSQB
: COLON
, COMMA
; SEMI
+ PLUS
- MINUS
* STAR
/ SLASH
| VBAR
& AMPER
< LESS
> GREATER
= EQUAL
. DOT
% PERCENT
` BACKQUOTE
{ LBRACE
} RBRACE
@ AT
@= ATEQUAL
== EQEQUAL
!= NOTEQUAL
<> NOTEQUAL
<= LESSEQUAL
>= GREATEREQUAL
~ TILDE
^ CIRCUMFLEX
<< LEFTSHIFT
>> RIGHTSHIFT
** DOUBLESTAR
+= PLUSEQUAL
-= MINEQUAL
*= STAREQUAL
/= SLASHEQUAL
%= PERCENTEQUAL
&= AMPEREQUAL
|= VBAREQUAL
^= CIRCUMFLEXEQUAL
<<= LEFTSHIFTEQUAL
>>= RIGHTSHIFTEQUAL
**= DOUBLESTAREQUAL
// DOUBLESLASH
//= DOUBLESLASHEQUAL
-> RARROW
( R* R1 R t R R t objectR R t opmap_rawt opmapt
splitlinest linet splitt opt nameR ( ( ( s- /usr/lib64/python2.7/lib2to3/pgen2/grammar.pyt <module>
s z = pgen2/driver.pyc 0000644 00000014477 15053244255 0007611 0 ustar 00 �
{ fc @ s d Z d Z d d g Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l m
Z
m Z m Z m
Z
m Z d e f d � � YZ d � Z d
d e e d d � Z d � Z d
� Z d � Z e d k r e j e e � � � n d S( sZ Parser driver.
This provides a high-level interface to parse a file into a syntax tree.
s# Guido van Rossum <guido@python.org>t Drivert load_grammari����Ni ( t grammart parset tokent tokenizet pgenc B sV e Z d d d � Z e d � Z e d � Z e d � Z d e d � Z e d � Z RS( c C s: | | _ | d k r$ t j � } n | | _ | | _ d S( N( R t Nonet loggingt getLoggert loggert convert( t selfR R R
( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt __init__ s
c C s= t j | j | j � } | j � d } d } d } } } } }
d } x�| D]�} | \ } } } } }
| | | f k r
| | f | k s� t | | f | f � � | \ }
} | |
k r� | d |
| 7} |
} d } n | | k r
| |
| | !7} | } q
n | t j t j f k r`| | 7} | \ } } | j
d � rQ | d 7} d } qQ qQ n | t j k rt j
| } n | r�| j j d t j | | | � n | j | | | | f � r�| r�| j j d � n Pn d } | \ } } | j
d � rQ | d 7} d } qQ qQ Wt j d | | | | f � � | j S(
s4 Parse a series of tokens and return the syntax tree.i i u s
s %s %r (prefix=%r)s Stop.t s incomplete inputN( R t ParserR R t setupR t AssertionErrorR t COMMENTt NLt endswithR t OPt opmapR
t debugt tok_namet addtokent
ParseErrort rootnode( R t tokensR t pt linenot columnt typet valuet startt endt line_textt prefixt quintuplet s_linenot s_column( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt parse_tokens' sT
*
c C s" t j | j � } | j | | � S( s* Parse a stream and return the syntax tree.( R t generate_tokenst readlineR) ( R t streamR R ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt parse_stream_rawW s c C s | j | | � S( s* Parse a stream and return the syntax tree.( R- ( R R, R ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt parse_stream\ s c C s; t j | d | � } z | j | | � SWd | j � Xd S( s( Parse a file and return the syntax tree.t rN( t codecst openR. t close( R t filenamet encodingR R, ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt
parse_file` s c C s+ t j t j | � j � } | j | | � S( s* Parse a string and return the syntax tree.( R R* t StringIOR+ R) ( R t textR R ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt parse_stringh s N(
t __name__t
__module__R R
t FalseR) R- R. R5 R8 ( ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyR s 0 c C sR t j j | � \ } } | d k r- d } n | | d j t t t j � � d S( Ns .txtR t .s .pickle( t ost patht splitextt joint mapt strt syst version_info( t gtt headt tail( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt _generate_pickle_namen s s Grammar.txtc C s� | d k r t j � } n | d k r3 t | � n | } | sO t | | � r� | j d | � t j | � } | r� | j d | � y | j | � Wq� t k
r� } | j d | � q� Xq� n t
j � } | j | � | S( s' Load the grammar (maybe from a pickle).s! Generating grammar tables from %ss Writing grammar tables to %ss Writing failed: %sN(
R R R RH t _newert infoR t generate_grammart dumpt IOErrorR t Grammart load( RE t gpt savet forceR
t gt e( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyR u s
c C sN t j j | � s t St j j | � s, t St j j | � t j j | � k S( s0 Inquire whether file a was written since file b.( R= R> t existsR; t Truet getmtime( t at b( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyRI � s
c C sc t j j | � r t | � St t j j | � � } t j | | � } t j � } | j
| � | S( s� Normally, loads a pickled grammar by doing
pkgutil.get_data(package, pickled_grammar)
where *pickled_grammar* is computed from *grammar_source* by adding the
Python version and using a ``.pickle`` extension.
However, if *grammar_source* is an extant file, load_grammar(grammar_source)
is called instead. This facilitates using a packaged grammar file when needed
but preserves load_grammar's automatic regeneration behavior when possible.
( R= R> t isfileR RH t basenamet pkgutilt get_dataR RN t loads( t packaget grammar_sourcet pickled_namet dataRS ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt load_packaged_grammar� s
c G sc | s t j d } n t j d t j d t j d d � x$ | D] } t | d t d t �q? Wt S( s� Main program, when run as a script: produce grammar pickle files.
Calls load_grammar for each argument, a path to a grammar text file.
i t levelR, t formats %(message)sRQ RR ( RC t argvR t basicConfigt INFOt stdoutR RV ( t argsRE ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt main� s
t __main__( t __doc__t
__author__t __all__R0 R= R R\ R6 RC R R R R R R t objectR RH R RV R; R RI Rc Rk R9 t exitt int( ( ( s, /usr/lib64/python2.7/lib2to3/pgen2/driver.pyt <module> s$ (P
pgen2/__init__.pyc 0000644 00000000256 15053244255 0010043 0 ustar 00 �
{ fc @ s
d Z d S( s The pgen2 package.N( t __doc__( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/__init__.pyt <module> t pgen2/literals.pyc 0000644 00000003742 15053244255 0010126 0 ustar 00 �
{ fc @ s� d Z d d l Z i
d d 6d d 6d d 6d d
6d d 6d
d 6d d 6d d 6d d 6d d 6Z d � Z d � Z d � Z e d k r� e � n d S( s< Safely evaluate Python string literals without using eval().i����Ns t as t bs t fs
t ns
t rs t ts t vt 't "s \c C s | j d d � \ } } | j d � s- t � t j | � } | d k rL | S| j d � r� | d } t | � d k r� t d | � � n y t | d � } Wq� t k
r� t d | � � q� Xn7 y t | d � } Wn! t k
r� t d | � � n Xt | � S(
Ni i s \t xi s! invalid hex string escape ('\%s')i i s# invalid octal string escape ('\%s')(
t groupt
startswitht AssertionErrort simple_escapest gett Nonet lent
ValueErrort intt chr( t mt allt tailt esct hexest i( ( s. /usr/lib64/python2.7/lib2to3/pgen2/literals.pyt escape s$
c C s� | j d � s4 | j d � s4 t t | d � � � | d } | d | d k r_ | d } n | j | � s� t t | t | � � � � t | � d t | � k s� t � | t | � t | � !} t j d t | � S( NR R i i i i s) \\(\'|\"|\\|[abfnrtv]|x.{0,2}|[0-7]{1,3})( R R t reprt endswithR t ret subR ( t st q( ( s. /usr/lib64/python2.7/lib2to3/pgen2/literals.pyt
evalString( s 4
,"c C s_ xX t d � D]J } t | � } t | � } t | � } | | k r
| G| G| G| GHq
q
Wd S( Ni ( t rangeR R R! ( R t cR t e( ( s. /usr/lib64/python2.7/lib2to3/pgen2/literals.pyt test2 s t __main__( t __doc__R R
R R! R% t __name__( ( ( s. /usr/lib64/python2.7/lib2to3/pgen2/literals.pyt <module> s
pgen2/token.pyc 0000644 00000004377 15053244255 0007434 0 ustar 00 �
{ fc @ s� d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d
Z
d Z d Z d
Z
d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d! Z! d" Z" d# Z# d$ Z$ d% Z% d& Z& d' Z' d( Z( d) Z) d* Z* d+ Z+ d, Z, d- Z- d. Z. d/ Z/ d0 Z0 d1 Z1 d2 Z2 d3 Z3 d4 Z4 d5 Z5 d6 Z6 d7 Z7 d8 Z8 d9 Z9 d: Z: d; Z; i Z< xB e= � j> � D]1 \ Z? Z@ eA e@ � eA d � k r~e? e< e@ <q~q~Wd< � ZB d= � ZC d> � ZD d? S(@ s! Token constants (from "token.h").i i i i i i i i i i i
i i i
i i i i i i i i i i i i i i i i i i i i! i" i# i$ i% i& i' i( i) i* i+ i, i- i. i/ i0 i1 i2 i3 i4 i5 i6 i7 i8 i9 i c C s
| t k S( N( t NT_OFFSET( t x( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/token.pyt
ISTERMINALL s c C s
| t k S( N( R ( R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/token.pyt
ISNONTERMINALO s c C s
| t k S( N( t ENDMARKER( R ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/token.pyt ISEOFR s N(E t __doc__R t NAMEt NUMBERt STRINGt NEWLINEt INDENTt DEDENTt LPARt RPARt LSQBt RSQBt COLONt COMMAt SEMIt PLUSt MINUSt STARt SLASHt VBARt AMPERt LESSt GREATERt EQUALt DOTt PERCENTt BACKQUOTEt LBRACEt RBRACEt EQEQUALt NOTEQUALt LESSEQUALt GREATEREQUALt TILDEt
CIRCUMFLEXt LEFTSHIFTt
RIGHTSHIFTt
DOUBLESTARt PLUSEQUALt MINEQUALt STAREQUALt
SLASHEQUALt PERCENTEQUALt
AMPEREQUALt VBAREQUALt CIRCUMFLEXEQUALt LEFTSHIFTEQUALt RIGHTSHIFTEQUALt DOUBLESTAREQUALt DOUBLESLASHt DOUBLESLASHEQUALt ATt ATEQUALt OPt COMMENTt NLt RARROWt
ERRORTOKENt N_TOKENSR t tok_namet globalst itemst _namet _valuet typeR R R ( ( ( s+ /usr/lib64/python2.7/lib2to3/pgen2/token.pyt <module> s� pgen2/conv.pyc 0000644 00000017775 15053244255 0007267 0 ustar 00 �
{ fc @ sE d Z d d l Z d d l m Z m Z d e j f d � � YZ d S( s� Convert graminit.[ch] spit out by pgen to Python code.
Pgen is the Python parser generator. It is useful to quickly create a
parser from a grammar file in Python's grammar notation. But I don't
want my parsers to be written in C (yet), so I'm translating the
parsing tables to Python data structures and writing a Python parse
engine.
Note that the token numbers are constants determined by the standard
Python tokenizer. The standard token module defines these numbers and
their names (the names are not used much). The token numbers are
hardcoded into the Python tokenizer and into pgen. A Python
implementation of the Python tokenizer is also available, in the
standard tokenize module.
On the other hand, symbol numbers (representing the grammar's
non-terminals) are assigned by pgen based on the actual grammar
input.
Note: this module is pretty much obsolete; the pgen module generates
equivalent grammar tables directly from the Grammar.txt input file
without having to invoke the Python pgen C program.
i����N( t grammart tokent Converterc B s2 e Z d Z d � Z d � Z d � Z d � Z RS( s2 Grammar subclass that reads classic pgen output files.
The run() method reads the tables as produced by the pgen parser
generator, typically contained in two C files, graminit.h and
graminit.c. The other methods are for internal use only.
See the base class for more documentation.
c C s( | j | � | j | � | j � d S( s< Load the grammar tables from the text files written by pgen.N( t parse_graminit_ht parse_graminit_ct
finish_off( t selft
graminit_ht
graminit_c( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyt run/ s
c C s y t | � } Wn# t k
r5 } d | | f GHt SXi | _ i | _ d } x� | D]� } | d 7} t j d | � } | r� | j � r� d | | | j � f GHqU | j � \ } } t | � } | | j k s� t
� | | j k s� t
� | | j | <| | j | <qU Wt S( s� Parse the .h file written by pgen. (Internal)
This file is a sequence of #define statements defining the
nonterminals of the grammar as numbers. We build two tables
mapping the numbers to names and back.
s Can't open %s: %si i s ^#define\s+(\w+)\s+(\d+)$s %s(%s): can't parse %s( t opent IOErrort Falset
symbol2numbert
number2symbolt ret matcht stript groupst intt AssertionErrort True( R t filenamet ft errt linenot linet mot symbolt number( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyR 5 s*
c ! C s� y t | � } Wn# t k
r5 } d | | f GHt SXd } | d | j � } } | d k sq t | | f � � | d | j � } } | d k s� t | | f � � | d | j � } } i } g } x�| j d � r�xC| j d � r t j d | � } | st | | f � � t t | j
� � \ } }
} g } x� t | � D]u }
| d | j � } } t j d | � } | s�t | | f � � t t | j
� � \ } } | j | | f � qHW| d | j � } } | d k s�t | | f � � | | | |
f <| d | j � } } q� Wt j d
| � } | sKt | | f � � t t | j
� � \ } } | t
| � k s�t | | f � � g } x� t | � D]� }
| d | j � } } t j d | � } | s�t | | f � � t t | j
� � \ } } }
| | |
f } | t
| � k s6t | | f � � | j | � q�W| j | � | d | j � } } | d k s�t | | f � � | d | j � } } q� W| | _ i } t j d | � } | s�t | | f � � t | j d � � } x�t | � D]�} | d | j � } } t j d
| � } | sFt | | f � � | j d � } t t | j d d d d � � \ } } } } | j | | k s�t | | f � � | j | | k s�t | | f � � | d k s�t | | f � � | | } | t
| � k st | | f � � | d | j � } } t j d | � } | sYt | | f � � i } t | j d � � } x` t | � D]R \ } } t | � } x7 t d � D]) } | d | >@r�d | | d | <q�q�Wq�W| | f | | <q�W| d | j � } } | d k s t | | f � � | | _ g } | d | j � } } t j d | � } | spt | | f � � t | j d � � } x� t | � D]� } | d | j � } } t j d | � } | s�t | | f � � | j
� \ } } t | � } | d k r d } n t | � } | j | | f � q�W| d | j � } } | d k sdt | | f � � | | _ | d | j � } } | d k s�t | | f � � | d | j � } } t j d | � } | s�t | | f � � t | j d � � } | t
| j � k st � | d | j � } } | d k sHt | | f � � | d | j � } } t j d | � } | s�t | | f � � t | j d � � } | t
| j � k s�t | | f � � | d | j � } } t j d | � } | s t | | f � � t | j d � � } | | j k s< t | | f � � | | _ | d | j � } } | d k sz t | | f � � y | d | j � } } Wn t k
r� n Xd s� t | | f � � d S( s� Parse the .c file written by pgen. (Internal)
The file looks as follows. The first two lines are always this:
#include "pgenheaders.h"
#include "grammar.h"
After that come four blocks:
1) one or more state definitions
2) a table defining dfas
3) a table defining labels
4) a struct defining the grammar
A state definition has the following form:
- one or more arc arrays, each of the form:
static arc arcs_<n>_<m>[<k>] = {
{<i>, <j>},
...
};
- followed by a state array, of the form:
static state states_<s>[<t>] = {
{<k>, arcs_<n>_<m>},
...
};
s Can't open %s: %si i s #include "pgenheaders.h"
s #include "grammar.h"
s static arc s) static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$s \s+{(\d+), (\d+)},$s };
s' static state states_(\d+)\[(\d+)\] = {$s \s+{(\d+), arcs_(\d+)_(\d+)},$s static dfa dfas\[(\d+)\] = {$s0 \s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$i i i i s \s+("(?:\\\d\d\d)*")},$i s! static label labels\[(\d+)\] = {$s \s+{(\d+), (0|"\w+")},$t 0s grammar _PyParser_Grammar = {
s
\s+(\d+),$s dfas,
s \s+{(\d+), labels},$s \s+(\d+)$N( R
R R t nextR t
startswithR R t mapR R t ranget appendt lent statest groupR
R t evalt enumeratet ordt dfast Nonet labelst startt
StopIteration(! R R R R R R t allarcsR% R t nt mt kt arcst _t it jt st tt stateR* t ndfasR R t xt yt zt firstt rawbitsett ct byteR, t nlabelsR- ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyR T s� $ $
-%%
$ '!
c C s� i | _ i | _ xj t | j � D]Y \ } \ } } | t j k r_ | d k r_ | | j | <q" | d k r" | | j | <q" q" Wd S( s1 Create additional useful structures. (Internal).N( t keywordst tokensR( R, R t NAMER+ ( R t ilabelt typet value( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyR � s " ( t __name__t
__module__t __doc__R R R R ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyR $ s
�( RK R t pgen2R R t GrammarR ( ( ( s* /usr/lib64/python2.7/lib2to3/pgen2/conv.pyt <module> s fixer_util.pyo 0000644 00000034533 15053244255 0007464 0 ustar 00 �
{ fc @ s d Z d d l m Z d d l m Z d d l m Z m Z d d l m Z
d d l m Z d � Z
d � Z d
� Z d � Z d5 d � Z d
� Z d � Z d � Z e � e � d � Z d5 d5 d � Z d � Z d � Z d5 d � Z d � Z d5 d � Z d5 d � Z d � Z d � Z d � Z d � Z! e" d d d d d d! d" d# d$ d% g
� Z# d& � Z$ d' a% d( a& d) a' e( a) d* � Z* d+ � Z+ d, � Z, d- � Z- d. � Z. d/ � Z/ d0 � Z0 d1 � Z1 e" e
j2 e
j3 g � Z4 d5 d2 � Z5 e" e
j3 e
j2 e
j6 g � Z7 d3 � Z8 d5 d4 � Z9 d5 S(6 s1 Utility functions, node construction macros, etc.i����( t islicei ( t token( t Leaft Node( t python_symbols( t patcompc C s% t t j | t t j d � | g � S( Nu =( R t symst argumentR R t EQUAL( t keywordt value( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt
KeywordArg s c C s t t j d � S( Nu (( R R t LPAR( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt LParen s c C s t t j d � S( Nu )( R R t RPAR( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt RParen s c C sl t | t � s | g } n t | t � s? d | _ | g } n t t j | t t j d d d �g | � S( s Build an assignment statementu u =t prefix( t
isinstancet listR R R t atomR R R ( t targett source( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Assign s c C s t t j | d | �S( s Return a NAME leafR ( R R t NAME( t nameR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Name& s c C s | t t j t � | g � g S( s A node tuple for obj.attr( R R t trailert Dot( t objt attr( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Attr* s c C s t t j d � S( s A comma leafu ,( R R t COMMA( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Comma. s c C s t t j d � S( s A period (.) leafu .( R R t DOT( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyR 2 s c C sM t t j | j � | j � g � } | rI | j d t t j | � � n | S( s- A parenthesised argument list, used by Call()i ( R R R t clonet insert_childt arglist( t argst lparent rparent node( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt ArgList6 s $ c C s: t t j | t | � g � } | d k r6 | | _ n | S( s A function callN( R R t powerR) t NoneR ( t func_nameR% R R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt Call= s c C s t t j d � S( s A newline literalu
( R R t NEWLINE( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt NewlineD s c C s t t j d � S( s A blank lineu ( R R R. ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt BlankLineH s c C s t t j | d | �S( NR ( R R t NUMBER( t nR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt NumberL s c C s1 t t j t t j d � | t t j d � g � S( s A numeric or string subscriptu [u ]( R R R R R t LBRACEt RBRACE( t
index_node( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt SubscriptO s c C s t t j | d | �S( s
A string leafR ( R R t STRING( t stringR ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt StringU s c C s d | _ d | _ d | _ t t j d � } d | _ t t j d � } d | _ | | | | g } | r� d | _ t t j d � } d | _ | j t t j | | g � � n t t j | t t j | � g � } t t j
t t j d � | t t j d � g � S( su A list comprehension of the form [xp for fp in it if test].
If test is None, the "if test" part is omitted.
u u u foru inu ifu [u ](
R R R R t appendR R t comp_ift listmakert comp_forR R4 R5 ( t xpt fpt itt testt for_leaft in_leaft
inner_argst if_leaft inner( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt ListCompY s$ "$ c C s x | D] } | j � q Wt t j d � t t j | d d �t t j d d d �t t j | � g } t t j | � } | S( sO Return an import statement in the form:
from package import name_leafsu fromR u u import( t removeR R R R R t import_as_namest import_from( t package_namet
name_leafst leaft childrent imp( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt
FromImportq s
c C s� t | t � r. | j t � t � g k r. t St | t � o� t | j � d k o� t | j d t � o� t | j d t � o� t | j d t � o� | j d j d k o� | j d j d k S( s( Does the node represent a tuple literal?i i i i u (u )( R R RO R
R t Truet lenR R
( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_tuple� s *c C sz t | t � oy t | j � d k oy t | j d t � oy t | j d t � oy | j d j d k oy | j d j d k S( s' Does the node represent a list literal?i i i����u [u ]( R R RS RO R R
( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_list� s c C s t t j t � | t � g � S( N( R R R R
R ( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt parenthesize� s t sortedR t sett anyt allt tuplet sumt mint maxt enumeratec c s4 t | | � } x | r/ | Vt | | � } q Wd S( sl Follow an attribute chain.
If you have a chain of objects where a.foo -> b, b.foo-> c, etc,
use this to iterate over all objects in the chain. Iteration is
terminated by getattr(x, attr) is None.
Args:
obj: the starting object
attr: the name of the chaining attribute
Yields:
Each successive object in the chain.
N( t getattr( R R t next( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt
attr_chain� s se for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
s�
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
s`
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
c C s� t s< t j t � a t j t � a t j t � a t a n t t t g } xR t | t | d � � D]8 \ } } i } | j | | � rd | d | k rd t Sqd Wt
S( s Returns true if node is in an environment where all that is required
of it is being iterable (ie, it doesn't matter if it returns a list
or an iterator).
See test_map_nochange in test_fixers.py for some examples and tests.
t parentR( ( t
pats_builtR t compile_patternt p0t p1t p2RR t zipRb t matcht False( R( t patternst patternRc t results( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt in_special_context� s %"c C s� | j } | d k r+ | j t j k r+ t S| j } | j t j t j f k rS t S| j t j
k r| | j d | k r| t S| j t j k s� | j t j
k r� | d k r� | j t j k s� | j d | k r� t St S( sG
Check that something isn't an attribute or function name etc.
i N( t prev_siblingR+ t typeR R! Rk Rc R t funcdeft classdeft expr_stmtRO t
parameterst
typedargslistR RR ( R( t prevRc ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_probably_builtin� s % c C sp xi | d k rk | j t j k r_ t | j � d k r_ | j d } | j t j k r_ | j Sn | j } q Wd S( s Find the indentation of *node*.i i u N(
R+ Rq R t suiteRS RO R t INDENTR
Rc ( R( t indent( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt find_indentation� s '
c C sW | j t j k r | S| j � } | j d } | _ t t j | g � } | | _ | S( N( Rq R Ry R" Rc R+ R ( R( Rc Ry ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt
make_suite s c C s; x4 | j t j k r6 | j } | s t d � � q q W| S( s Find the top level namespace.s, root found before file_input node was found.( Rq R t
file_inputRc t
ValueError( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt find_root s
c C s" t | t | � | � } t | � S( s� Returns true if name is imported from package at the
top level of the tree which node belongs to.
To cover the case of an import like 'import foo', use
None for the package and 'foo' for the name. ( t find_bindingR� t bool( t packageR R( t binding( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt does_tree_import s c C s | j t j t j f k S( s0 Returns true if the node is an import statement.( Rq R t import_nameRK ( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_import" s c C s� d � } t | � } t | | | � r+ d Sd } } xn t | j � D]] \ } } | | � sc qE n x1 t | j | � D] \ } } | | � sw Pqw qw W| | } PqE W| d k rxb t | j � D]N \ } } | j t j k r� | j r� | j d j t j k r� | d } Pq� q� Wn | d k r\t
t j t t j
d � t t j
| d d �g � } n$ t | t t j
| d d �g � } | t � g }
| j | t
t j |
� � d S( s\ Works like `does_tree_import` but adds an import statement
if it was not imported. c S s, | j t j k o+ | j o+ t | j d � S( Ni ( Rq R t simple_stmtRO R� ( R( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt is_import_stmt) s Ni i u importR u ( R� R� R_ RO Rq R R� R R8 R+ R R� R R RQ R/ R# ( R� R R( R� t roott
insert_post offsett idxt node2t import_RO ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt touch_import& s4
!$c C sK xD| j D]9} d } | j t j k rs t | | j d � rB | St | t | j d � | � } | r | } q n�| j t j t j f k r� t | t | j d � | � } | r | } q na| j t j
k r|t | t | j d � | � } | r� | } q x t | j d � D]b \ } } | j t j
k r| j d k rt | t | j | d � | � } | ru| } quqqWn� | j t k r�| j d j | k r�| } nv t | | | � r�| } n[ | j t j k r�t | | | � } n4 | j t j k r t | | j d � r | } q n | r
| s0| St | � rC| Sq
q
Wd S( s� Returns the node which binds variable name, otherwise None.
If optional argument package is supplied, only imports will
be returned.
See test cases for examples.i i����i i t :i i N( RO R+ Rq R t for_stmtt _findR� R} t if_stmtt
while_stmtt try_stmtR_ R t COLONR
t _def_symst _is_import_bindingR� Rt R� ( R R( R� t childt retR2 t it kid( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyR� T sH !# % c C s| | g } xl | rw | j � } | j d k rO | j t k rO | j | j � q | j t j k r | j | k r | Sq Wd S( Ni ( t popRq t _block_symst extendRO R R R
R+ ( R R( t nodes( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyR� s !c C s' | j t j k r| r| j d } | j t j k r� x� | j D]Z } | j t j k rw | j d j | k r� | SqB | j t j k rB | j | k rB | SqB Wq#| j t j k r� | j d } | j t j k r| j | k r| Sq#| j t j k r#| j | k r#| Sn| j t j k r#| rMt
| j d � j � | k rMd S| j d } | rst
d | � rsd S| j t j k r�t
| | � r�| S| j t j k r�| j d } | j t j k r | j | k r | Sq#| j t j k r| j | k r| S| r#| j t j k r#| Sn d S( s� Will reuturn node if node will import name, or node
will import * from package. None is returned otherwise.
See test cases for examples. i i i����i u asN( Rq R R� RO t dotted_as_namest dotted_as_nameR
R R RK t unicodet stripR+ R� RJ t import_as_namet STAR( R( R R� RP R� t lastR2 ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyR� � s@
!
!!%
!
!!N(: t __doc__t itertoolsR t pgen2R t pytreeR R t pygramR R t R R R
R R R+ R R R R R) R- R/ R0 R3 R7 R: RH RQ RT RU RV RX t consuming_callsRb Rf Rg Rh Rk Rd Ro Rx R| R} R� R� R� R� Rs Rr R� R� R R� R� R� ( ( ( s* /usr/lib64/python2.7/lib2to3/fixer_util.pyt <module> sZ - *
__init__.pyc 0000644 00000000177 15053244255 0007032 0 ustar 00 �
{ fc @ s d S( N( ( ( ( s( /usr/lib64/python2.7/lib2to3/__init__.pyt <module> t pytree.pyc 0000644 00000073137 15053244255 0006611 0 ustar 00 �
{ fc @ s d Z d Z d d l Z d d l Z d d l m Z d Z i a d � Z d e f d � � YZ d e f d
� � YZ
d e f d � � YZ d
� Z d e f d � � YZ
d e
f d � � YZ d e
f d � � YZ d e
f d � � YZ d e
f d � � YZ d � Z d S( s�
Python parse tree definitions.
This is a very concrete parse tree; we need to keep every token and
even the comments and whitespace between tokens.
There's also a pattern matching implementation here.
s# Guido van Rossum <guido@python.org>i����N( t StringIOi���c C sh t sX d d l m } x? | j j � D]+ \ } } t | � t k r& | t | <q& q& Wn t j | | � S( Ni ( t python_symbols( t _type_reprst pygramR t __dict__t itemst typet intt
setdefault( t type_numR t namet val( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt type_repr s t Basec B s� e Z d Z d Z d Z d Z e Z e Z d � Z
d � Z d Z d � Z
d � Z d � Z d � Z d � Z d � Z d � Z d
� Z d � Z d � Z d
� Z e d � � Z e d � � Z d � Z d � Z d � Z e j d k r� d � Z n RS( s�
Abstract base class for Node and Leaf.
This provides some default functionality and boilerplate using the
template pattern.
A node may be a subnode of at most one parent.
c O s% | t k s t d � � t j | � S( s7 Constructor that prevents Base from being instantiated.s Cannot instantiate Base( R
t AssertionErrort objectt __new__( t clst argst kwds( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR 2 s c C s# | j | j k r t S| j | � S( sW
Compare two nodes for equality.
This calls the method _eq().
( t __class__t NotImplementedt _eq( t selft other( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __eq__7 s c C s$ | j | j k r t S| j | � S( sY
Compare two nodes for inequality.
This calls the method _eq().
( R R R ( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __ne__C s c C s
t � d S( s_
Compare two nodes for equality.
This is called by __eq__ and __ne__. It is only called if the two nodes
have the same type. This must be implemented by the concrete subclass.
Nodes should be considered equal if they have the same structure,
ignoring the prefix string and other context information.
N( t NotImplementedError( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR M s c C s
t � d S( sr
Return a cloned (deep) copy of self.
This must be implemented by the concrete subclass.
N( R ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt cloneX s c C s
t � d S( sx
Return a post-order iterator for the tree.
This must be implemented by the concrete subclass.
N( R ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
post_order` s c C s
t � d S( sw
Return a pre-order iterator for the tree.
This must be implemented by the concrete subclass.
N( R ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt pre_orderh s c C s# t j d t d d �| | _ d S( sv
Set the prefix for the node (see Leaf class).
DEPRECATED; use the prefix property directly.
s3 set_prefix() is deprecated; use the prefix propertyt
stackleveli N( t warningst warnt DeprecationWarningt prefix( R R# ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
set_prefixp s
c C s t j d t d d �| j S( sy
Return the prefix for the node (see Leaf class).
DEPRECATED; use the prefix property directly.
s3 get_prefix() is deprecated; use the prefix propertyR i ( R R! R" R# ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
get_prefixz s
c C s2 | j d k s! t t | � � � | d k s3 t � t | t � sN | g } n g } t } xt | j j D]f } | | k r� | s� t | j j | | f � � | d k r� | j | � n t } qg | j
| � qg W| s� t | j | | f � � | j j � | | j _ x | D] } | j | _ qWd | _ d S( s/ Replace this node with a new one in the parent.N( t parentt NoneR t strt
isinstancet listt Falset childrent extendt Truet appendt changed( R t newt
l_childrent foundt cht x( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt replace� s& ! "
c C s= | } x- t | t � s5 | j s% d S| j d } q W| j S( s9 Return the line number which generated the invocant node.Ni ( R) t LeafR, t lineno( R t node( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
get_lineno� s c C s& | j r | j j � n t | _ d S( N( R& R0 R. t was_changed( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR0 � s c C sf | j rb xV t | j j � D]? \ } } | | k r | j j � | j j | =d | _ | Sq Wn d S( s�
Remove the node from the tree. Returns the position of the node in its
parent's children before it was removed.
N( R& t enumerateR, R0 R' ( R t iR9 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt remove� s
c C st | j d k r d SxZ t | j j � D]F \ } } | | k r& y | j j | d SWql t k
rh d SXq& q& Wd S( s�
The node immediately following the invocant in their parent's children
list. If the invocant does not have a next sibling, it is None
i N( R& R' R< R, t
IndexError( R R= t child( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt next_sibling� s
c C sh | j d k r d SxN t | j j � D]: \ } } | | k r& | d k rN d S| j j | d Sq& Wd S( s�
The node immediately preceding the invocant in their parent's children
list. If the invocant does not have a previous sibling, it is None.
i i N( R& R' R< R, ( R R= R@ ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt prev_sibling� s c c s4 x- | j D]" } x | j � D] } | Vq Wq
Wd S( N( R, t leaves( R R@ R5 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRC � s c C s$ | j d k r d Sd | j j � S( Ni i ( R& R' t depth( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRD � s c C s | j } | d k r d S| j S( s�
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
u N( RA R' R# ( R t next_sib( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt
get_suffix� s i i c C s t | � j d � S( Nt ascii( t unicodet encode( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __str__� s N( ( i i (! t __name__t
__module__t __doc__R' R R& R, R+ R; t was_checkedR R t __hash__R R R R R R$ R% R6 R: R0 R> t propertyRA RB RC RD RF t syst version_infoRJ ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR
s6
t Nodec B s� e Z d Z d d d d � Z d � Z d � Z e j d k rH e Z n d � Z
d � Z d � Z d � Z
d
� Z d � Z e e e � Z d � Z d
� Z d � Z RS( s+ Concrete implementation for interior nodes.c C s� | d k s t | � � | | _ t | � | _ x; | j D]0 } | j d k sa t t | � � � | | _ q: W| d k r� | | _ n | r� | | _ n d | _ d S( s�
Initializer.
Takes a type constant (a symbol number >= 256), a sequence of
child nodes, and an optional context keyword argument.
As a side effect, the parent pointers of the children are updated.
i N( R R R* R, R& R' t reprR# t fixers_applied( R R R, t contextR# RU R4 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __init__� s !
c C s# d | j j t | j � | j f S( s) Return a canonical string representation.s
%s(%s, %r)( R RK R R R, ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __repr__ s c C s d j t t | j � � S( sk
Return a pretty string representation.
This reproduces the input source exactly.
u ( t joint mapRH R, ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt __unicode__ s i i c C s" | j | j f | j | j f k S( s Compare two nodes for equality.( R R, ( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR s c C s5 t | j g | j D] } | j � ^ q d | j �S( s$ Return a cloned (deep) copy of self.RU ( RS R R, R RU ( R R4 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR ! s +c c s9 x- | j D]" } x | j � D] } | Vq Wq
W| Vd S( s* Return a post-order iterator for the tree.N( R, R ( R R@ R9 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR & s
c c s9 | Vx- | j D]" } x | j � D] } | Vq" Wq Wd S( s) Return a pre-order iterator for the tree.N( R, R ( R R@ R9 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR - s c C s | j s
d S| j d j S( sO
The whitespace and comments preceding this node in the input.
t i ( R, R# ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt _prefix_getter4 s c C s | j r | | j d _ n d S( Ni ( R, R# ( R R# ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt _prefix_setter< s c C s4 | | _ d | j | _ | | j | <| j � d S( s�
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N( R& R' R, R0 ( R R= R@ ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt set_childB s
c C s* | | _ | j j | | � | j � d S( s�
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N( R& R, t insertR0 ( R R= R@ ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt insert_childL s c C s' | | _ | j j | � | j � d S( s�
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N( R& R, R/ R0 ( R R@ ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt append_childU s N( i i ( RK RL RM R' RW RX R[ RQ RR RJ R R R R R] R^ RP R# R_ Ra Rb ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRS � s$
R7 c B s� e Z d Z d Z d Z d Z d d g d � Z d � Z d � Z e
j d k rZ e Z n d � Z
d � Z d � Z d
� Z d � Z d � Z d
� Z e e e � Z RS( s' Concrete implementation for leaf nodes.R\ i c C s� d | k o d k n s( t | � � | d k rR | \ | _ \ | _ | _ n | | _ | | _ | d k r| | | _ n | | _ d S( s�
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
i i N( R R' t _prefixR8 t columnR t valueRU ( R R Re RV R# RU ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRW h s
( c C s d | j j | j | j f S( s) Return a canonical string representation.s
%s(%r, %r)( R RK R Re ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRX { s c C s | j t | j � S( sk
Return a pretty string representation.
This reproduces the input source exactly.
( R# RH Re ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR[ � s i c C s" | j | j f | j | j f k S( s Compare two nodes for equality.( R Re ( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c C s4 t | j | j | j | j | j f f d | j �S( s$ Return a cloned (deep) copy of self.RU ( R7 R Re R# R8 Rd RU ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c c s | Vd S( N( ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRC � s c c s | Vd S( s* Return a post-order iterator for the tree.N( ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c c s | Vd S( s) Return a pre-order iterator for the tree.N( ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c C s | j S( sP
The whitespace and comments preceding this token in the input.
( Rc ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR] � s c C s | j � | | _ d S( N( R0 Rc ( R R# ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR^ � s
N( i i ( RK RL RM Rc R8 Rd R' RW RX R[ RQ RR RJ R R RC R R R] R^ RP R# ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR7 _ s& c C sk | \ } } } } | s' | | j k rT t | � d k rA | d St | | d | �St | | d | �Sd S( s�
Convert raw node information to a Node or Leaf instance.
This is passed to the parser driver which calls it whenever a reduction of a
grammar rule produces a new complete node, so that the tree is build
strictly bottom-up.
i i RV N( t
number2symbolt lenRS R7 ( t grt raw_nodeR Re RV R, ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt convert� s t BasePatternc B s\ e Z d Z d Z d Z d Z d � Z d � Z d � Z d d � Z
d d � Z d � Z RS( s�
A pattern is a tree matching pattern.
It looks for a specific node type (token or symbol), and
optionally for a specific content.
This is an abstract base class. There are three concrete
subclasses:
- LeafPattern matches a single leaf node;
- NodePattern matches a single node (usually non-leaf);
- WildcardPattern matches a sequence of nodes of variable length.
c O s% | t k s t d � � t j | � S( s> Constructor that prevents BasePattern from being instantiated.s Cannot instantiate BasePattern( Rk R R R ( R R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR � s c C sh t | j � | j | j g } x! | rA | d d k rA | d =q! Wd | j j d j t t | � � f S( Ni����s %s(%s)s , (
R R t contentR
R' R RK RY RZ RT ( R R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRX � s c C s | S( s�
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
( ( R ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt optimize� s c C s� | j d k r% | j | j k r% t S| j d k r~ d } | d k rO i } n | j | | � se t S| r~ | j | � q~ n | d k r� | j r� | | | j <n t S( s#
Does this pattern exactly match a node?
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
Default implementation for non-wildcard patterns.
N( R R' R+ Rl t _submatcht updateR
R. ( R R9 t resultst r( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt match� s ! c C s* t | � d k r t S| j | d | � S( s�
Does this pattern exactly match a sequence of nodes?
Default implementation for non-wildcard patterns.
i i ( Rg R+ Rr ( R t nodesRp ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt match_seq s c c s4 i } | r0 | j | d | � r0 d | f Vn d S( s}
Generator yielding all matches for this pattern.
Default implementation for non-wildcard patterns.
i i N( Rr ( R Rs Rq ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt generate_matches s N(
RK RL RM R' R Rl R
R RX Rm Rr Rt Ru ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRk � s
t LeafPatternc B s2 e Z d d d d � Z d d � Z d d � Z RS( c C s� | d k r7 d | k o# d k n s7 t | � � n | d k rg t | t � sg t t | � � � n | | _ | | _ | | _ d S( sp
Initializer. Takes optional type, content, and name.
The type, if given must be a token type (< 256). If not given,
this matches any *leaf* node; the content may still be required.
The content, if given, must be a string.
If a name is given, the matching node is stored in the results
dict under that key.
i i N( R' R R) t
basestringRT R Rl R
( R R Rl R
( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRW s + $ c C s& t | t � s t St j | | | � S( s* Override match() to insist on a leaf node.( R) R7 R+ Rk Rr ( R R9 Rp ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRr , s c C s | j | j k S( s�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
( Rl Re ( R R9 Rp ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRn 2 s
N( RK RL R' RW Rr Rn ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRv s t NodePatternc B s, e Z e Z d d d d � Z d d � Z RS( c C s� | d k r' | d k s' t | � � n | d k r� t | t � sU t t | � � � t | � } xY t | � D]H \ } } t | t � s� t | | f � � t | t � rn t | _
qn qn Wn | | _ | | _ | | _
d S( sd
Initializer. Takes optional type, content, and name.
The type, if given, must be a symbol type (>= 256). If the
type is None this matches *any* single node (leaf or not),
except if content is not None, in which it only matches
non-leaf nodes that also match the content pattern.
The content, if not None, must be a sequence of Patterns that
must match the node's children exactly. If the content is
given, the type must not be None.
If a name is given, the matching node is stored in the results
dict under that key.
i N( R' R R) Rw RT R* R< Rk t WildcardPatternR. t wildcardsR Rl R
( R R Rl R
R= t item( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRW F s " ! c C s� | j rh xX t | j | j � D]A \ } } | t | j � k r | d k r\ | j | � n t Sq Wt St | j � t | j � k r� t Sx9 t | j | j � D]" \ } } | j
| | � s� t Sq� Wt S( s�
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
N( Rz Ru Rl R, Rg R' Ro R. R+ t zipRr ( R R9 Rp t cRq t
subpatternR@ ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRn c s
" "N( RK RL R+ Rz R' RW Rn ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRx B s Ry c B sh e Z d Z d
d e d
d � Z d � Z d
d � Z d
d � Z d � Z d � Z
d � Z d � Z RS( s
A wildcard pattern can match zero or more nodes.
This has all the flexibility needed to implement patterns like:
.* .+ .? .{m,n}
(a b c | d e | f)
(...)* (...)+ (...)? (...){m,n}
except it always uses non-greedy matching.
i c C s� d | k o" | k o" t k n s9 t | | f � � | d k r� t t t | � � } t | � sx t t | � � � x/ | D]$ } t | � s t t | � � � q Wn | | _ | | _ | | _ | | _
d S( s�
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optional minimum number of times to match, default 0
max: optional maximum number of times to match, default HUGE
name: optional name assigned to this match
[*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is
equivalent to (a b c | d e | f g h); if content is None,
this is equivalent to '.' in regular expression terms.
The min and max parameters work as follows:
min=0, max=maxint: .*
min=1, max=maxint: .+
min=0, max=1: .?
min=1, max=1: .
If content is not None, replace the dot with the parenthesized
list of alternatives, e.g. (a b c | d e | f g h)*
i N( t HUGER R' t tupleRZ Rg RT Rl t mint maxR
( R Rl R� R� R
t alt( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRW � s 9
% c C s/ d } | j d k rW t | j � d k rW t | j d � d k rW | j d d } n | j d k r� | j d k r� | j d k r� t d | j � S| d k r� | j | j k r� | j � Sn | j d k r+t | t � r+| j d k r+| j | j k r+t | j | j | j | j | j | j � S| S( s+ Optimize certain stacked wildcard patterns.i i R
N(
R' Rl Rg R� R� Rx R
Rm R) Ry ( R R~ ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRm � s .
!
c C s | j | g | � S( s' Does this pattern exactly match a node?( Rt ( R R9 Rp ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRr � s c C su xn | j | � D]] \ } } | t | � k r | d k ri | j | � | j ri t | � | | j <qi n t Sq Wt S( s4 Does this pattern exactly match a sequence of nodes?N( Ru Rg R' Ro R
R* R. R+ ( R Rs Rp R} Rq ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRt � s
c c s� | j d k rs xvt | j d t t | � | j � � D]4 } i } | j ra | | | | j <n | | f Vq8 Wn| j d k r� | j | � Vn� t t d � r� t j
} t � t _
n z� yO xH | j | d � D]4 \ } } | j r� | | | | j <n | | f Vq� WWnY t
k
rgxI | j | � D]4 \ } } | j rU| | | | j <n | | f Vq,Wn XWd t t d � r�| t _
n Xd S( s"
Generator yielding matches for a sequence of nodes.
Args:
nodes: sequence of nodes
Yields:
(count, results) tuples where:
count: the match comprises nodes[:count];
results: dict containing named submatches.
i t bare_namet getrefcounti N( Rl R' t xrangeR� Rg R� R
t _bare_name_matchest hasattrRQ t stderrR t _recursive_matchest RuntimeErrort _iterative_matches( R Rs t countRq t save_stderr( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRu � s0 /
c c s` t | � } d | j k r) d i f Vn g } xO | j D]D } x; t | | � D]* \ } } | | f V| j | | f � qO Wq9 Wx� | r[g } x� | D]� \ } } | | k r� | | j k r� x� | j D] } xv t | | | � D]a \ }
} |
d k r� i } | j | � | j | � | |
| f V| j | |
| f � q� q� Wq� Wq� q� W| } q� Wd S( s( Helper to iteratively yield the matches.i N( Rg R� Rl Ru R/ R� Ro ( R Rs t nodelenRp R� R} Rq t new_resultst c0t r0t c1t r1( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR� � s*
)c C s� d } i } t } t | � } x_ | r | | k r t } x? | j D]4 } | d j | | | � rD | d 7} t } PqD qD Wq! W| | | | j <| | f S( s( Special optimized matcher for bare_name.i i ( R+ Rg R. Rl Rr R
( R Rs R� Rq t doneR� t leaf( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR� s
c c s� | j d k s t � | | j k r2 d i f Vn | | j k r� x� | j D]� } xw t | | � D]f \ } } xW | j | | | d � D]; \ } } i } | j | � | j | � | | | f Vq� Wqa WqK Wn d S( s( Helper to recursively yield the matches.i i N( Rl R' R R� R� Ru R� Ro ( R Rs R� R� R� R� R� R� Rq ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR� , s '
N(
RK RL RM R' R RW Rm Rr Rt Ru R� R� R� ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRy s # - t NegatedPatternc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s= | d k r0 t | t � s0 t t | � � � n | | _ d S( s
Initializer.
The argument is either a pattern or None. If it is None, this
only matches an empty sequence (effectively '$' in regex
lingo). If it is not None, this matches whenever the argument
pattern doesn't have any matches.
N( R' R) Rk R RT Rl ( R Rl ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRW = s $c C s t S( N( R+ ( R R9 ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRr J s c C s t | � d k S( Ni ( Rg ( R Rs ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRt N s c c se | j d k r2 t | � d k ra d i f Vqa n/ x! | j j | � D]
\ } } d SWd i f Vd S( Ni ( Rl R' Rg Ru ( R Rs R} Rq ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRu R s N( RK RL R' RW Rr Rt Ru ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyR� ; s
c c s� | s d i f Vn� | d | d } } x� | j | � D]s \ } } | sY | | f Vq9 xP t | | | � D]; \ } } i } | j | � | j | � | | | f Vqm Wq9 Wd S( sR
Generator yielding matches for a sequence of patterns and nodes.
Args:
patterns: a sequence of patterns
nodes: a sequence of nodes
Yields:
(count, results) tuples where:
count: the entire sequence of patterns matches nodes[:count];
results: dict containing named submatches.
i i N( Ru Ro ( t patternsRs t pt restR� R� R� R� Rq ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyRu ^ s
( RM t
__author__RQ R R R R R R R
RS R7 Rj Rk Rv Rx Ry R� Ru ( ( ( s& /usr/lib64/python2.7/lib2to3/pytree.pyt <module> s"
�pN V,=�# PatternGrammar2.7.18.final.0.pickle 0000644 00000005357 15053244255 0012604 0 ustar 00 �ccollections
OrderedDict
q ]q(]q(Udfasqh ]q(]q(M ]q(]qKK�qa]q KK�q
a]q K K�q aeh ]q
(]q(KKe]q(KKe]q(KKe]q(KKe]q(KKee�qRq�qe]q(M]q(]q(KK�qK K�qe]q(KK�q K K�q K K�q eeh ]q (]q (KKe]q!(KKe]q"(KKe]q#(KKe]q$(KKee�q%Rq&�q'e]q((M]q)(]q*K
K�q+a]q,(K K �q-K K�q.eeh ]q/(]q0(KKe]q1(KKe]q2(KKe]q3(KKe]q4(KKee�q5Rq6�q7e]q8(M]q9(]q:K K�q;a]q<KK�q=a]q>K
K�q?a]q@K K�qAaeh ]qB]qC(K Kea�qDRqE�qFe]qG(M]qH(]qIKK�qJa]qK(KK�qLKK�qMKK�qNe]qOKK�qPa]qQ(KK�qRK K�qSe]qTK K�qUa]qVKK�qWaeh ]qX]qY(KKea�qZRq[�q\e]q](M]q^(]q_(KK�q`KK�qaKK�qbe]qcK K�qda]qeKK�qfa]qg(KK�qhKK�qie]qjKK�qka]qlKK�qmaeh ]qn(]qo(KKe]qp(KKe]qq(KKee�qrRqs�qte]qu(M]qv(]qw(KK�qxKK�qyKK�qzKK�q{e]q|KK�q}a]q~KK�qa]q�(KK�q�KK�q�KK�q�K K�q�e]q�(KK�q�K K�q�e]q�KK�q�a]q�KK�q�a]q�(KK�q�KK�q�KK �q�KK�q�e]q�K K�q�a]q�(KK�q�KK�q�K K �q�eeh ]q�(]q�(KKe]q�(KKe]q�(KKe]q�(KKee�q�Rq��q�ee�q�Rq�e]q�(Ukeywordsq�h ]q�]q�(Unotq�Kea�q�Rq�e]q�(Ulabelsq�]q�(K UEMPTYq��q�MN�q�K N�q�KN�q�K N�q�Kh��q�KN�q�KN�q�MN�q�MN�q�MN�q�KN�q�KN�q�KN�q�MN�q�KN�q�KN�q�KN�q�KN�q�KN�q�K N�q�KN�q�KN�q�MN�q�K
N�q�ee]q�(U
number2symbolq�h ]q�(]q�(M UMatcherq�e]q�(MU Alternativeq�e]q�(MU Alternativesq�e]q�(MUDetailsq�e]q�(MU NegatedUnitq�e]q�(MURepeaterq�e]q�(MUUnitq�ee�q�Rq�e]q�(Ustartq�M e]q�(Ustatesq�]q�(]q�(]q�KK�q�a]q�KK�q�a]q�K K�q�ae]q�(]q�(KK�q�K K�q�e]q�(KK�q�K K�q�K K�q�ee]q�(]q�K
K�q�a]q�(K K �q�K K�q�ee]q�(]q�K K�q�a]q�KK�q�a]q�K
K�q�a]q�K K�q�ae]q�(]q�KK�q�a]q�(KK�q�KK�r KK�r e]r KK�r a]r (KK�r K K�r e]r K K�r a]r KK�r
ae]r (]r (KK�r
KK�r KK�r e]r K K�r a]r KK�r a]r (KK�r KK�r e]r KK�r a]r KK�r ae]r (]r (KK�r KK�r KK�r KK�r e]r! KK�r" a]r# KK�r$ a]r% (KK�r& KK�r' KK�r( K K�r) e]r* (KK�r+ K K�r, e]r- KK�r. a]r/ KK�r0 a]r1 (KK�r2 KK�r3 KK �r4 KK�r5 e]r6 K K�r7 a]r8 (KK�r9 KK�r: K K �r; eeee]r< (U symbol2labelr= h ]r> (]r? (U Alternativer@ K
e]rA (U AlternativesrB Ke]rC (UDetailsrD Ke]rE (U NegatedUnitrF Ke]rG (URepeaterrH Ke]rI (UUnitrJ K ee�rK RrL e]rM (U
symbol2numberrN h ]rO (]rP (h�Me]rQ (h�Me]rR (h�Me]rS (h�M e]rT (h�Me]rU (h�Me]rV (h�Mee�rW RrX e]rY (UtokensrZ h ]r[ (]r\ (K Ke]r] (KKe]r^ (KKe]r_ (KKe]r` (KKe]ra (KKe]rb (K Ke]rc (K
Ke]rd (K Ke]re (KKe]rf (KKe]rg (KK e]rh (KK e]ri (KK
e]rj (KKe]rk (KKe]rl (KKee�rm Rrn ee�ro Rrp . Grammar2.7.18.final.0.pickle 0000644 00000117046 15053244255 0011245 0 ustar 00 �ccollections
OrderedDict
q ]q(]q(Udfasqh ]q(]q(M ]q(]q(KK�qKK �q KK �q
e]q K K�q aeh ]q
(]q(KKe]q(KKe]q(KKe]q(KKe]q(KKe]q(KKe]q(KKe]q(K Ke]q(K
Ke]q(K Ke]q(K Ke]q(K
Ke]q(KKe]q(KKe]q (KKe]q (KKe]q (KKe]q (KKe]q (KKe]q!(KKe]q"(KKe]q#(KKe]q$(KKe]q%(KKe]q&(KKe]q'(KKe]q((K Ke]q)(K Ke]q*(K Ke]q+(K Ke]q,(K Ke]q-(K!Ke]q.(K"Ke]q/(K#Ke]q0(K$Ke]q1(K%Ke]q2(K&Ke]q3(K'Kee�q4Rq5�q6e]q7(M]q8(]q9K(K�q:a]q;(K)K �q<K K�q=eeh ]q>(]q?(KKe]q@(KKe]qA(KKe]qB(KKe]qC(K
Ke]qD(K Ke]qE(K#Ke]qF(K$Ke]qG(K%Ke]qH(K&Ke]qI(K'Kee�qJRqK�qLe]qM(M]qN(]qOK*K�qPa]qQ(K+K �qRK K�qSeeh ]qT(]qU(KKe]qV(KKe]qW(KKe]qX(KKe]qY(K
Ke]qZ(K Ke]q[(KKe]q\(K#Ke]q](K$Ke]q^(K%Ke]q_(K&Ke]q`(K'Kee�qaRqb�qce]qd(M]qe(]qfK,K�qga]qh(K-K�qiK K�qje]qk(K,K�qlK K�qmeeh ]qn(]qo(KKe]qp(KKe]qq(KKe]qr(KKe]qs(KKe]qt(K
Ke]qu(K Ke]qv(KKe]qw(KKe]qx(K#Ke]qy(K$Ke]qz(K%Ke]q{(K&Ke]q|(K'Ke]q}(K.Kee�q~Rq�q�e]q�(M]q�(]q�(K.K�q�K/K�q�K0K�q�e]q�K1K�q�a]q�K K�q�a]q�(K2K�q�K3K�q�K K�q�e]q�K0K�q�aeh ]q�(]q�(KKe]q�(KKe]q�(KKe]q�(KKe]q�(KKe]q�(K
Ke]q�(K Ke]q�(KKe]q�(KKe]q�(K#Ke]q�(K$Ke]q�(K%Ke]q�(K&Ke]q�(K'Ke]q�(K.Kee�q�Rq��q�e]q�(M]q�(]q�K4K�q�a]q�(KK �q�KK �q�K K�q�eeh ]q�(]q�(KKe]q�(KKe]q�(KKe]q�(KKe]q�(K
Ke]q�(K Ke]q�(K#Ke]q�(K$Ke]q�(K%Ke]q�(K&Ke]q�(K'Kee�q�Rq��q�e]q�(M]q�(]q�K K�q�a]q�K0K�q�a]q�(K-K�q�K K�q�e]q�K0K�q�a]q�K K�q�aeh ]q�]q�(K Kea�q�Rqˆq�e]q�(M]q�(]q�(KK�q�KK�q�K
K�q�K K�q�K#K�q�K%K�q�K&K�q�K'K�q�e]q�(K5K�q�K6K�q�K7K�q�e]q�KK �q�a]q�(K8K�q�K9K
�q�e]q�K:K �q�a]q�(K;K�q�K<K �q�e]q�K K�q�a]q�(K'K�q�K K�q�e]q�K5K�q�a]q�KK�q�a]q�K8K�q�a]q�K K�q�a]q�K;K�q�aeh ]q�(]q�(KKe]q�(KKe]q�(K
Ke]q�(K Ke]q�(K#Ke]q�(K%Ke]q�(K&Ke]q�(K'Kee�q�Rq��r e]r (M]r (]r (K=K�r K>K�r K?K�r K@K�r KAK�r KBK�r KCK�r
KDK�r KEK�r KFK�r
KGK�r KHK�r KIK�r e]r K K�r aeh ]r (]r (K=Ke]r (K>Ke]r (K?Ke]r (K@Ke]r (KAKe]r (KBKe]r (KCKe]r (KDKe]r (KEKe]r (KFKe]r (KGKe]r (KHKe]r (KIKee�r! Rr" �r# e]r$ (M ]r% (]r& K
K�r' a]r( K K�r) aeh ]r* ]r+ (K
Kea�r, Rr- �r. e]r/ (M
]r0 (]r1 KK�r2 a]r3 K%K�r4 a]r5 (KK�r6 KJK�r7 e]r8 (K5K�r9 KKK�r: e]r; KLK�r< a]r= KJK�r> a]r? K5K�r@ a]rA K K�rB aeh ]rC ]rD (KKea�rE RrF �rG e]rH (M ]rI (]rJ KK�rK a]rL KMK�rM a]rN KNK�rO a]rP KOK�rQ a]rR (KPK�rS K K�rT e]rU K K�rV aeh ]rW ]rX (KKea�rY RrZ �r[ e]r\ (M ]r] (]r^ KK�r_ a]r` KQK�ra a]rb (KPK�rc K K�rd e]re K K�rf aeh ]rg ]rh (KKea�ri Rrj �rk e]rl (M
]rm (]rn (K3K�ro KRK�rp e]rq K K�rr aeh ]rs (]rt (KKe]ru (KKee�rv Rrw �rx e]ry (M]rz (]r{ (KSK�r| KTK�r} KUK�r~ KSK�r KVK�r� KWK�r� KXK�r� KNK�r� KYK�r� KK�r� e]r� K K�r� a]r� (KK�r� K K�r� e]r� KNK�r� aeh ]r� (]r� (KKe]r� (KNKe]r� (KSKe]r� (KTKe]r� (KUKe]r� (KVKe]r� (KWKe]r� (KXKe]r� (KYKee�r� Rr� �r� e]r� (M]r� (]r� K1K�r� a]r� (KZK �r� K K�r� eeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (M]r� (]r� (K[K�r� K\K�r� K]K�r� K^K�r� K_K�r� K`K�r� KaK�r� KbK�r� e]r� K K�r� aeh ]r� (]r� (K Ke]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K Ke]r� (K Ke]r� (K!Kee�r� Rr� �r� e]r� (M]r� (]r� KK�r� a]r� K K�r� aeh ]r� ]r� (KKea�r� Rr� �r� e]r� (M]r� (]r� KcK�r� a]r� (K[K�r� K^K�r� e]r� K K�r� aeh ]r� ]r� (K Kea�r� Rr� �r� e]r� (M]r� (]r� K K�r� a]r� KdK�r� a]r� (KK�r� KK�r� e]r� (K5K�r� KKK�r� e]r� K K�r� a]r� KK�r� a]r� K5K�r� aeh ]r� ]r� (K Kea�r� Rr� �r� e]r� (M]r� (]r� KeK�r� a]r� (KeK�r� K K�r� eeh ]r ]r (K Kea�r Rr �r e]r (M]r (]r KK�r a]r KMK�r
a]r K K�r aeh ]r
]r (KKea�r Rr �r e]r (M]r (]r (K.K�r K/K�r K0K�r e]r K1K�r a]r (K-K�r K3K�r K K�r e]r (K-K�r KJK�r K3K�r! K K�r" e]r# (K-K�r$ K3K�r% K K�r& e]r' (K/K �r( K0K �r) K K�r* e]r+ K K�r, a]r- K0K�r. a]r/ (K.K
�r0 K0K �r1 K K�r2 e]r3 (K-K�r4 K K �r5 e]r6 K1K �r7 a]r8 KJK
�r9 a]r: (K-K�r; K K �r< e]r= K0K �r> aeh ]r? (]r@ (KKe]rA (KKe]rB (KKe]rC (KKe]rD (KKe]rE (K
Ke]rF (K Ke]rG (KKe]rH (KKe]rI (K#Ke]rJ (K$Ke]rK (K%Ke]rL (K&Ke]rM (K'Ke]rN (K.Kee�rO RrP �rQ e]rR (M]rS (]rT KdK�rU a]rV (KfK�rW K K�rX e]rY K%K�rZ a]r[ K K�r\ aeh ]r] ]r^ (K%Kea�r_ Rr` �ra e]rb (M]rc (]rd KgK�re a]rf (K-K �rg K K�rh eeh ]ri ]rj (K%Kea�rk Rrl �rm e]rn (M]ro (]rp K%K�rq a]rr (KK �rs K K�rt eeh ]ru ]rv (K%Kea�rw Rrx �ry e]rz (M]r{ (]r| K%K�r} a]r~ K K�r aeh ]r� ]r� (K%Kea�r� Rr� �r� e]r� (M]r� (]r� KhK�r� a]r� (KK�r� KK�r� e]r� K K�r� aeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (KKe]r� (KKe]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (M ]r� (]r� KiK�r� a]r� (K0K�r� K K�r� e]r� (K-K�r� KfK�r� K K�r� e]r� K0K�r� a]r� K K�r� aeh ]r� ]r� (KiKea�r� Rr� �r� e]r� (M ]r� (]r� KK�r� a]r� K1K�r� a]r� (KNK�r� K K�r� e]r� K0K�r� a]r� (K-K�r� K K�r� e]r� K0K�r� a]r� K K�r� aeh ]r� ]r� (KKea�r� Rr� �r� e]r� (M ]r� (]r� KjK�r� a]r� (KkK �r� K K�r� eeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (M ]r� (]r� KlK�r� a]r� (K2K�r� KmK�r� K K�r� e]r� (KlK�r� K7K�r� e]r� (KhK�r� K7K�r� e]r� (K2K�r� K K�r� e]r� K K�r� aeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (KKe]r� (KKe]r� (K#Ke]r� (K$Ke]r� (K%Ke]r (K&Ke]r (K'Kee�r Rr �r e]r (M ]r (]r (K1K�r K/K�r e]r
(K-K�r K K�r e]r
(K1K�r K/K�r K K�r eeh ]r (]r (KKe]r (KKe]r (KKe]r (KKe]r (KKe]r (K
Ke]r (K Ke]r (K#Ke]r (K$Ke]r (K%Ke]r (K&Ke]r (K'Kee�r Rr �r e]r! (M!]r" (]r# (KK�r$ KK�r% K$K�r& KnK�r' e]r( KoK�r) a]r* K K�r+ aeh ]r, (]r- (KKe]r. (KKe]r/ (KKe]r0 (KKe]r1 (K
Ke]r2 (K Ke]r3 (K#Ke]r4 (K$Ke]r5 (K%Ke]r6 (K&Ke]r7 (K'Kee�r8 Rr9 �r: e]r; (M"]r< (]r= (KpK�r> KqK�r? KrK�r@ KsK�rA KtK�rB e]rC K K�rD aeh ]rE (]rF (K
Ke]rG (KKe]rH (K Ke]rI (K Ke]rJ (K"Kee�rK RrL �rM e]rN (M#]rO (]rP KK�rQ a]rR KMK�rS a]rT KNK�rU a]rV KhK�rW a]rX KJK�rY a]rZ KLK�r[ a]r\ (KuK�r] K K�r^ e]r_ KJK�r` a]ra KLK �rb a]rc K K �rd aeh ]re ]rf (KKea�rg Rrh �ri e]rj (M$]rk (]rl KK�rm a]rn K%K�ro a]rp KvK�rq a]rr (KwK�rs KJK�rt e]ru K0K�rv a]rw KLK�rx a]ry KJK�rz a]r{ K K�r| aeh ]r} ]r~ (KKea�r Rr� �r� e]r� (M%]r� (]r� (KK�r� KK�r� e]r� K%K�r� a]r� (K-K�r� K K�r� eeh ]r� (]r� (KKe]r� (KKee�r� Rr� �r� e]r� (M&]r� (]r� KK�r� a]r� K0K�r� a]r� KJK�r� a]r� KLK�r� a]r� (KxK�r� KuK�r� K K�r� e]r� KJK�r� a]r� KLK�r� a]r� K K�r� aeh ]r� ]r� (KKea�r� Rr� �r� e]r� (M']r� (]r� K%K�r� a]r� (KfK�r� K K�r� e]r� K%K�r� a]r� K K�r� aeh ]r� ]r� (K%Kea�r� Rr� �r� e]r� (M(]r� (]r� KyK�r� a]r� (K-K�r� K K�r� e]r� (KyK�r� K K�r� eeh ]r� ]r� (K%Kea�r� Rr� �r� e]r� (M)]r� (]r� KK�r� a]r� (KK�r� KdK�r� e]r� (KK�r� KK�r� KdK�r� e]r� KK�r� a]r� (KK�r� KK�r� KzK�r� e]r� KzK�r� a]r� K K�r� a]r� K5K�r� aeh ]r� ]r� (KKea�r� Rr� �r� e]r� (M*]r� (]r� KK�r� a]r� K{K�r� a]r� K K�r� aeh ]r� ]r� (KKea�r� Rr� �r� e]r� (M+]r� (]r� (K|K�r� K}K�r� e]r� K K�r� aeh ]r� (]r� (KKe]r� (KKee�r� Rr� �r� e]r (M,]r (]r KK�r a]r (KJK�r K~K�r e]r K0K�r a]r KJK�r
a]r K K�r aeh ]r
]r (KKea�r Rr �r e]r (M-]r (]r (K/K�r K0K�r e]r (K-K�r K3K�r K K�r e]r (K/K�r K0K�r K K�r e]r K K�r a]r! (K-K�r" K K�r# eeh ]r$ (]r% (KKe]r& (KKe]r' (KKe]r( (KKe]r) (KKe]r* (K
Ke]r+ (K Ke]r, (KKe]r- (KKe]r. (K#Ke]r/ (K$Ke]r0 (K%Ke]r1 (K&Ke]r2 (K'Kee�r3 Rr4 �r5 e]r6 (M.]r7 (]r8 (KK�r9 KK�r: e]r; K*K�r< a]r= K K�r> aeh ]r? (]r@ (KKe]rA (KKe]rB (KKe]rC (KKe]rD (K
Ke]rE (K Ke]rF (KKe]rG (K#Ke]rH (K$Ke]rI (K%Ke]rJ (K&Ke]rK (K'Kee�rL RrM �rN e]rO (M/]rP (]rQ KK�rR a]rS (KJK�rT K~K�rU e]rV KQK�rW a]rX KJK�rY a]rZ K K�r[ aeh ]r\ ]r] (KKea�r^ Rr_ �r` e]ra (M0]rb (]rc (K�K�rd K�K�re e]rf K K�rg aeh ]rh (]ri (KKe]rj (KKe]rk (KKe]rl (KKe]rm (K
Ke]rn (K Ke]ro (KKe]rp (KKe]rq (K#Ke]rr (K$Ke]rs (K%Ke]rt (K&Ke]ru (K'Kee�rv Rrw �rx e]ry (M1]rz (]r{ K�K�r| a]r} (K�K �r~ K K�r eeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (KKe]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (M2]r� (]r� KK�r� a]r� (K5K�r� K�K�r� e]r� K K�r� a]r� K5K�r� aeh ]r� ]r� (KKea�r� Rr� �r� e]r� (M3]r� (]r� KK�r� a]r� K K�r� aeh ]r� ]r� (KKea�r� Rr� �r� e]r� (M4]r� (]r� K�K�r� a]r� (K.K�r� K�K�r� K K�r� e]r� KoK�r� a]r� K K�r� aeh ]r� (]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (K#Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (M5]r� (]r� K K�r� a]r� (K�K�r� K0K�r� K K�r� e]r� K0K�r� a]r� (K-K�r� K K�r� e]r� (K-K�r� K K�r� e]r� (K0K�r� K K�r� e]r� K0K�r� a]r� (K-K�r� K K�r� e]r� (K0K�r� K K�r� eeh ]r� ]r� (K Kea�r� Rr� �r� e]r� (M6]r� (]r� K K�r� a]r� (K0K�r� K K�r� e]r� (K-K�r� KK�r� K K�r� e]r� K0K�r� a]r� K0K�r� a]r� (K-K�r� K K�r� e]r� K K�r� aeh ]r� ]r� (K Kea�r� Rr� �r� e]r� (M7]r� (]r� K K�r� a]r (KhK�r K K�r e]r K K�r aeh ]r ]r (K Kea�r Rr �r e]r
(M8]r (]r K�K�r
a]r (K�K �r K�K �r K K�r eeh ]r (]r (KKe]r (KKe]r (KKe]r (KKe]r (K
Ke]r (K Ke]r (K#Ke]r (K$Ke]r (K%Ke]r (K&Ke]r (K'Kee�r Rr �r e]r! (M9]r" (]r# K�K�r$ a]r% (K�K�r& KK�r' e]r( (KK�r) K�K�r* e]r+ K K�r, aeh ]r- (]r. (KKe]r/ (KKe]r0 (KKe]r1 (KKe]r2 (KKe]r3 (K
Ke]r4 (K Ke]r5 (K Ke]r6 (K
Ke]r7 (KKe]r8 (KKe]r9 (KKe]r: (KKe]r; (KKe]r< (KKe]r= (KKe]r> (KKe]r? (KKe]r@ (KKe]rA (K Ke]rB (K Ke]rC (K Ke]rD (K"Ke]rE (K#Ke]rF (K$Ke]rG (K%Ke]rH (K&Ke]rI (K'Kee�rJ RrK �rL e]rM (M:]rN (]rO (KK�rP K�K�rQ K�K�rR e]rS K K�rT a]rU KK�rV aeh ]rW (]rX (KKe]rY (KKe]rZ (KKe]r[ (KKe]r\ (KKe]r] (KKe]r^ (K Ke]r_ (K
Ke]r` (K Ke]ra (K Ke]rb (K
Ke]rc (KKe]rd (KKe]re (KKe]rf (KKe]rg (KKe]rh (KKe]ri (KKe]rj (KKe]rk (KKe]rl (KKe]rm (KKe]rn (KKe]ro (KKe]rp (KKe]rq (K Ke]rr (K Ke]rs (K Ke]rt (K Ke]ru (K Ke]rv (K!Ke]rw (K"Ke]rx (K#Ke]ry (K$Ke]rz (K%Ke]r{ (K&Ke]r| (K'Kee�r} Rr~ �r e]r� (M;]r� (]r� KJK�r� a]r� (K0K�r� K K�r� e]r� K K�r� aeh ]r� ]r� (KJKea�r� Rr� �r� e]r� (M<]r� (]r� (K�K�r� K�K�r� K�K�r� K�K�r� K�K�r� K�K�r� K�K�r� K�K�r� K�K�r� e]r� K K�r� aeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (K Ke]r� (K
Ke]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K Ke]r� (K Ke]r� (K Ke]r� (K"Ke]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (M=]r� (]r� KK�r� a]r� K1K�r� a]r� K K�r� aeh ]r� ]r� (KKea�r� Rr� �r� e]r� (M>]r� (]r� (K�K�r� K�K�r� e]r� K K�r� aeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K Ke]r� (K
Ke]r� (K Ke]r� (K Ke]r� (K
Ke]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K Ke]r� (K Ke]r� (K Ke]r� (K Ke]r� (K Ke]r� (K!Ke]r� (K"Ke]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (M?]r� (]r� (KJK�r� K0K�r� e]r� (K�K�r� K0K�r� K K�r e]r (KJK�r K K�r e]r K K�r a]r (K�K�r K K�r eeh ]r (]r
(KKe]r (KKe]r (KKe]r
(KKe]r (K
Ke]r (K Ke]r (KKe]r (KKe]r (K#Ke]r (K$Ke]r (K%Ke]r (K&Ke]r (K'Ke]r (KJKee�r Rr �r e]r (M@]r (]r K�K�r a]r (K-K�r K K�r! e]r" (K�K�r# K K�r$ eeh ]r% (]r& (KKe]r' (KKe]r( (KKe]r) (KKe]r* (K
Ke]r+ (K Ke]r, (KKe]r- (KKe]r. (K#Ke]r/ (K$Ke]r0 (K%Ke]r1 (K&Ke]r2 (K'Ke]r3 (KJKee�r4 Rr5 �r6 e]r7 (MA]r8 (]r9 (KK�r: K�K�r; e]r< K�K�r= a]r> K K�r? a]r@ KK�rA a]rB (K�K�rC KK�rD eeh ]rE (]rF (KKe]rG (KKe]rH (KKe]rI (KKe]rJ (KKe]rK (KKe]rL (K
Ke]rM (K Ke]rN (K Ke]rO (K
Ke]rP (KKe]rQ (KKe]rR (KKe]rS (KKe]rT (KKe]rU (KKe]rV (KKe]rW (KKe]rX (KKe]rY (KKe]rZ (K Ke]r[ (K Ke]r\ (K Ke]r] (K"Ke]r^ (K#Ke]r_ (K$Ke]r` (K%Ke]ra (K&Ke]rb (K'Kee�rc Rrd �re e]rf (MB]rg (]rh KoK�ri a]rj (K�K �rk KK �rl K�K �rm K�K �rn K K �ro K K�rp eeh ]rq (]rr (KKe]rs (KKe]rt (KKe]ru (KKe]rv (K
Ke]rw (K Ke]rx (K#Ke]ry (K$Ke]rz (K%Ke]r{ (K&Ke]r| (K'Kee�r} Rr~ �r e]r� (MC]r� (]r� (K�K�r� K�K�r� e]r� K K�r� a]r� (KK�r� K K�r� e]r� K�K�r� a]r� KuK�r� a]r� K0K�r� aeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (KKe]r� (KKe]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (MD]r� (]r� K0K�r� a]r� (K-K�r� K K�r� e]r� (K0K�r� K K�r� eeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (KKe]r� (KKe]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (ME]r� (]r� K0K�r� a]r� (K-K �r� K K�r� eeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (KKe]r� (KKe]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (MF]r� (]r� (K/K�r� K0K�r� e]r� (K-K�r� K3K�r� K K�r� e]r� (K/K�r� K0K�r� K K�r� e]r� K K�r� a]r� (K-K�r� K K�r� eeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (KKe]r� (KKe]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (MG]r� (]r� KQK�r� a]r� (K-K�r� K K�r� e]r� KQK�r a]r (K-K�r K K�r e]r (KQK�r K K�r eeh ]r (]r (KKe]r (KKe]r
(KKe]r (KKe]r (K
Ke]r
(K Ke]r (KKe]r (KKe]r (K#Ke]r (K$Ke]r (K%Ke]r (K&Ke]r (K'Kee�r Rr �r e]r (MH]r (]r (K/K�r K0K�r e]r (K-K�r K K�r e]r (K/K�r! K0K�r" K K�r# eeh ]r$ (]r% (KKe]r& (KKe]r' (KKe]r( (KKe]r) (KKe]r* (K
Ke]r+ (K Ke]r, (KKe]r- (KKe]r. (K#Ke]r/ (K$Ke]r0 (K%Ke]r1 (K&Ke]r2 (K'Kee�r3 Rr4 �r5 e]r6 (MI]r7 (]r8 (KK�r9 K�K�r: e]r; K�K�r< a]r= K K�r> a]r? K5K�r@ aeh ]rA (]rB (KKe]rC (K%Kee�rD RrE �rF e]rG (MJ]rH (]rI K�K�rJ a]rK (K-K�rL K K�rM e]rN (K�K�rO K K�rP eeh ]rQ (]rR (KKe]rS (K%Kee�rT RrU �rV e]rW (MK]rX (]rY K%K�rZ a]r[ (KJK�r\ K K�r] e]r^ K0K�r_ a]r` K K�ra aeh ]rb ]rc (K%Kea�rd Rre �rf e]rg (ML]rh (]ri (KK�rj KK�rk K
K�rl e]rm (K5K�rn KKK�ro e]rp K%K�rq a]rr K�K�rs a]rt K K�ru a]rv K5K�rw a]rx K8K�ry aeh ]rz (]r{ (KKe]r| (KKe]r} (K
Kee�r~ Rr �r� e]r� (MM]r� (]r� K K�r� a]r� KJK�r� a]r� KLK�r� a]r� (K�K�r� K�K�r� e]r� KJK�r� a]r� KJK�r� a]r� KLK�r� a]r� KLK �r� a]r� K K�r� a]r� (KuK
�r� K�K�r� K�K�r� K K �r� e]r� KJK �r� a]r� KLK �r� a]r� (K�K�r� K K �r� eeh ]r� ]r� (K Kea�r� Rr� �r� e]r� (MN]r� (]r� (KK�r� K.K�r� K�K�r� e]r� (K-K�r� K�K�r� K K�r� e]r� K�K�r� a]r� (K-K�r� K2K�r� K K�r� e]r� (K.K�r� K�K �r� e]r� (K-K�r� K K�r� e]r� K K�r� a]r� (KK�r� K.K�r� K�K�r� K K�r� e]r� K0K
�r� a]r� (K-K�r� K2K �r� K K �r� e]r� (K-K�r� K K
�r� e]r� K0K�r� aeh ]r� (]r� (KKe]r� (KKe]r� (K%Ke]r� (K.Kee�r� Rr� �r� e]r� (MO]r� (]r� (KK�r� K.K�r� K�K�r� e]r� (K-K�r� K�K�r� K K�r� e]r� K�K�r� a]r� (K-K�r� K2K�r� K K�r� e]r� (K.K�r� K�K �r� e]r� (K-K�r� K K�r� e]r� K K�r� a]r� (KK�r� K.K�r� K�K�r� K K�r� e]r� K0K
�r� a]r� (K-K�r� K2K �r� K K �r� e]r� (K-K�r� K K
�r� e]r� K0K�r� aeh ]r� (]r (KKe]r (KKe]r (K%Ke]r (K.Kee�r Rr �r e]r (MP]r (]r (KK�r
K�K�r e]r K�K�r
a]r K K�r a]r K5K�r aeh ]r (]r (KKe]r (K%Kee�r Rr �r e]r (MQ]r (]r K�K�r a]r (K-K�r K K�r e]r (K�K�r K K�r! eeh ]r" (]r# (KKe]r$ (K%Kee�r% Rr& �r' e]r( (MR]r) (]r* K%K�r+ a]r, K K�r- aeh ]r. ]r/ (K%Kea�r0 Rr1 �r2 e]r3 (MS]r4 (]r5 K K�r6 a]r7 K0K�r8 a]r9 KJK�r: a]r; KLK�r< a]r= (KuK�r> K K�r? e]r@ KJK�rA a]rB KLK�rC a]rD K K�rE aeh ]rF ]rG (K Kea�rH RrI �rJ e]rK (MT]rL (]rM K0K�rN a]rO (KfK�rP K K�rQ e]rR K1K�rS a]rT K K�rU aeh ]rV (]rW (KKe]rX (KKe]rY (KKe]rZ (KKe]r[ (K
Ke]r\ (K Ke]r] (KKe]r^ (KKe]r_ (K#Ke]r` (K$Ke]ra (K%Ke]rb (K&Ke]rc (K'Kee�rd Rre �rf e]rg (MU]rh (]ri K!K�rj a]rk K�K�rl a]rm (K-K�rn KJK�ro e]rp KLK�rq a]rr K K�rs aeh ]rt ]ru (K!Kea�rv Rrw �rx e]ry (MV]rz (]r{ KfK�r| a]r} K1K�r~ a]r K K�r� aeh ]r� ]r� (KfKea�r� Rr� �r� e]r� (MW]r� (]r� K�K�r� a]r� (K�K �r� K K�r� eeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (MX]r� (]r� (KK�r� KhK�r� e]r� K0K�r� a]r� K K�r� aeh ]r� (]r� (KKe]r� (KKe]r� (KKe]r� (KKe]r� (K
Ke]r� (K Ke]r� (KKe]r� (KKe]r� (KKe]r� (K#Ke]r� (K$Ke]r� (K%Ke]r� (K&Ke]r� (K'Kee�r� Rr� �r� e]r� (MY]r� (]r� K"K�r� a]r� (K�K�r� K K�r� e]r� K K�r� aeh ]r� ]r� (K"Kea�r� Rr� �r� e]r� (MZ]r� (]r� K7K�r� a]r� K K�r� aeh ]r� ]r� (K"Kea�r� Rr� �r� ee�r� Rr� e]r� (Ukeywordsr� h ]r� (]r� (Uandr� K+e]r� (Uasr� Kfe]r� (Uassertr� K e]r� (Ubreakr� K
e]r� (Uclassr� Ke]r� (Ucontinuer� Ke]r� (Udefr� Ke]r� (Udelr� Ke]r� (Uelifr� Kxe]r� (Uelser� Kue]r� (Uexceptr� Kie]r� (Uexecr� Ke]r� (Ufinallyr� K�e]r� (Uforr� Ke]r� (Ufromr� Ke]r� (Uglobalr� Ke]r� (Uifr� Ke]r� (Uimportr� Ke]r� (Uinr� KNe]r� (Uisr� KYe]r� (Ulambdar� Ke]r� (Unonlocalr Ke]r (Unotr Ke]r (Uorr K�e]r (Upassr Ke]r (Uprintr K e]r (Uraiser
K e]r (Ureturnr K e]r
(Utryr K e]r (Uwhiler K e]r (Uwithr K!e]r (Uyieldr K"ee�r Rr e]r (Ulabelsr ]r (K UEMPTYr �r K N�r KN�r M>N�r KN�r KN�r KN�r! KN�r" KN�r# K2N�r$ K N�r% KN�r& Kj� �r' Kj� �r( Kj� �r) Kj� �r* Kj� �r+ Kj� �r, Kj� �r- Kj� �r. Kj� �r/ Kj� �r0 Kj� �r1 Kj� �r2 Kj� �r3 Kj �r4 Kj �r5 Kj �r6 Kj �r7 Kj
�r8 Kj �r9 Kj �r: Kj �r; Kj �r< Kj �r= KN�r> K N�r? KN�r@ KN�rA KN�rB M8N�rC KN�rD M.N�rE Kj� �rF MN�rG K N�rH K$N�rI M=N�rJ MCN�rK M N�rL KN�rM M N�rN MBN�rO KN�rP MFN�rQ MYN�rR K
N�rS M-N�rT MEN�rU KN�rV MN�rW K)N�rX K*N�rY K/N�rZ K'N�r[ K%N�r\ K&N�r] K1N�r^ K(N�r_ K-N�r` K.N�ra K3N�rb K,N�rc K+N�rd K N�re MN�rf MAN�rg M N�rh Kj� �ri MGN�rj M
N�rk M0N�rl M N�rm K N�rn KN�ro K N�rp K N�rq KN�rr K N�rs Kj� �rt MN�ru M
N�rv MN�rw M#N�rx M$N�ry M&N�rz MMN�r{ MSN�r| MUN�r} MN�r~ MN�r MN�r� Kj� �r� MN�r� MDN�r� Kj� �r� MWN�r� KN�r� MHN�r� MN�r� M4N�r� M!N�r� M N�r� MN�r� M6N�r� M7N�r� MZN�r� Kj� �r� M2N�r� K7N�r� Kj� �r� M'N�r� M(N�r� MN�r� M)N�r� M*N�r� MON�r� MN�r� M/N�r� M1N�r� MN�r� Kj �r� MNN�r� MN�r� MLN�r� K#N�r� MN�r� K"N�r� M<N�r� K
N�r� MN�r� M9N�r� MN�r� MN�r� M N�r� M N�r� M"N�r� M%N�r� M+N�r� M3N�r� M5N�r� M;N�r� M?N�r� KN�r� KN�r� KN�r� KN�r� K0N�r� M,N�r� MKN�r� MJN�r� MIN�r� M@N�r� Kj� �r� M N�r� MPN�r� MRN�r� MQN�r� MTN�r� MN�r� K!N�r� MXN�r� ee]r� (U
number2symbolr� h ]r� (]r� (M U
file_inputr� e]r� (MUand_exprr� e]r� (MUand_testr� e]r� (MUarglistr� e]r� (MUargumentr� e]r� (MU
arith_exprr� e]r� (MU assert_stmtr� e]r� (MUatomr� e]r� (MU augassignr� e]r� (M U
break_stmtr� e]r� (M
Uclassdefr� e]r� (M Ucomp_forr� e]r� (M Ucomp_ifr� e]r� (M
U comp_iterr� e]r� (MUcomp_opr� e]r� (MU
comparisonr� e]r� (MU
compound_stmtr� e]r� (MU
continue_stmtr� e]r� (MU decoratedr� e]r� (MU decoratorr� e]r� (MU
decoratorsr� e]r� (MUdel_stmtr� e]r� (MU dictsetmakerr� e]r� (MUdotted_as_namer� e]r� (MUdotted_as_namesr� e]r� (MU dotted_namer� e]r� (MU
encoding_declr� e]r
(MU
eval_inputr
e]r
(M U
except_clauser
e]r
(M U exec_stmtr
e]r
(M Uexprr
e]r
(M U expr_stmtr
e]r
(M Uexprlistr
e]r
(M!Ufactorr
e]r
(M"U flow_stmtr
e]r
(M#Ufor_stmtr
e]r
(M$Ufuncdefr
e]r
(M%U global_stmtr
e]r
(M&Uif_stmtr
e]r
(M'Uimport_as_namer
e]r
(M(Uimport_as_namesr
e]r
(M)U import_fromr
e]r
(M*U import_namer
e]r
(M+U import_stmtr!
e]r"
(M,Ulambdefr#
e]r$
(M-U listmakerr%
e]r&
(M.Unot_testr'
e]r(
(M/U old_lambdefr)
e]r*
(M0Uold_testr+
e]r,
(M1Uor_testr-
e]r.
(M2U
parametersr/
e]r0
(M3U pass_stmtr1
e]r2
(M4Upowerr3
e]r4
(M5U
print_stmtr5
e]r6
(M6U
raise_stmtr7
e]r8
(M7U return_stmtr9
e]r:
(M8U
shift_exprr;
e]r<
(M9U simple_stmtr=
e]r>
(M:U single_inputr?
e]r@
(M;UsliceoprA
e]rB
(M<U
small_stmtrC
e]rD
(M=U star_exprrE
e]rF
(M>UstmtrG
e]rH
(M?U subscriptrI
e]rJ
(M@U
subscriptlistrK
e]rL
(MAUsuiterM
e]rN
(MBUtermrO
e]rP
(MCUtestrQ
e]rR
(MDUtestlistrS
e]rT
(MEU testlist1rU
e]rV
(MFU
testlist_gexprW
e]rX
(MGU
testlist_saferY
e]rZ
(MHUtestlist_star_exprr[
e]r\
(MIUtfpdefr]
e]r^
(MJUtfplistr_
e]r`
(MKUtnamera
e]rb
(MLUtrailerrc
e]rd
(MMUtry_stmtre
e]rf
(MNU
typedargslistrg
e]rh
(MOU varargslistri
e]rj
(MPUvfpdefrk
e]rl
(MQUvfplistrm
e]rn
(MRUvnamero
e]rp
(MSU
while_stmtrq
e]rr
(MTU with_itemrs
e]rt
(MUU with_stmtru
e]rv
(MVUwith_varrw
e]rx
(MWUxor_exprry
e]rz
(MXU yield_argr{
e]r|
(MYU
yield_exprr}
e]r~
(MZU
yield_stmtr
ee�r�
Rr�
e]r�
(Ustartr�
M e]r�
(Ustatesr�
]r�
(]r�
(]r�
(KK�r�
KK �r�
KK �r�
e]r�
K K�r�
ae]r�
(]r�
K(K�r�
a]r�
(K)K �r�
K K�r�
ee]r�
(]r�
K*K�r�
a]r�
(K+K �r�
K K�r�
ee]r�
(]r�
K,K�r�
a]r�
(K-K�r�
K K�r�
e]r�
(K,K�r�
K K�r�
ee]r�
(]r�
(K.K�r�
K/K�r�
K0K�r�
e]r�
K1K�r�
a]r�
K K�r�
a]r�
(K2K�r�
K3K�r�
K K�r�
e]r�
K0K�r�
ae]r�
(]r�
K4K�r�
a]r�
(KK �r�
KK �r�
K K�r�
ee]r�
(]r�
K K�r�
a]r�
K0K�r�
a]r�
(K-K�r�
K K�r�
e]r�
K0K�r�
a]r�
K K�r�
ae]r�
(]r�
(KK�r�
KK�r�
K
K�r�
K K�r�
K#K�r�
K%K�r�
K&K�r�
K'K�r�
e]r�
(K5K�r�
K6K�r�
K7K�r�
e]r�
KK �r�
a]r�
(K8K�r�
K9K
�r�
e]r�
K:K �r�
a]r�
(K;K�r�
K<K �r�
e]r�
K K�r�
a]r�
(K'K�r�
K K�r�
e]r�
K5K�r�
a]r�
KK�r�
a]r�
K8K�r�
a]r�
K K�r�
a]r�
K;K�r�
ae]r�
(]r�
(K=K�r�
K>K�r�
K?K�r�
K@K�r�
KAK�r�
KBK�r�
KCK�r�
KDK�r�
KEK�r�
KFK�r�
KGK�r�
KHK�r�
KIK�r�
e]r�
K K�r�
ae]r�
(]r�
K
K�r�
a]r K K�r ae]r (]r KK�r a]r K%K�r a]r (KK�r KJK�r e]r
(K5K�r KKK�r e]r
KLK�r a]r KJK�r a]r K5K�r a]r K K�r ae]r (]r KK�r a]r KMK�r a]r KNK�r a]r KOK�r a]r (KPK�r K K�r e]r! K K�r" ae]r# (]r$ KK�r% a]r& KQK�r' a]r( (KPK�r) K K�r* e]r+ K K�r, ae]r- (]r. (K3K�r/ KRK�r0 e]r1 K K�r2 ae]r3 (]r4 (KSK�r5 KTK�r6 KUK�r7 KSK�r8 KVK�r9 KWK�r: KXK�r; KNK�r< KYK�r= KK�r> e]r? K K�r@ a]rA (KK�rB K K�rC e]rD KNK�rE ae]rF (]rG K1K�rH a]rI (KZK �rJ K K�rK ee]rL (]rM (K[K�rN K\K�rO K]K�rP K^K�rQ K_K�rR K`K�rS KaK�rT KbK�rU e]rV K K�rW ae]rX (]rY KK�rZ a]r[ K K�r\ ae]r] (]r^ KcK�r_ a]r` (K[K�ra K^K�rb e]rc K K�rd ae]re (]rf K K�rg a]rh KdK�ri a]rj (KK�rk KK�rl e]rm (K5K�rn KKK�ro e]rp K K�rq a]rr KK�rs a]rt K5K�ru ae]rv (]rw KeK�rx a]ry (KeK�rz K K�r{ ee]r| (]r} KK�r~ a]r KMK�r� a]r� K K�r� ae]r� (]r� (K.K�r� K/K�r� K0K�r� e]r� K1K�r� a]r� (K-K�r� K3K�r� K K�r� e]r� (K-K�r� KJK�r� K3K�r� K K�r� e]r� (K-K�r� K3K�r� K K�r� e]r� (K/K �r� K0K �r� K K�r� e]r� K K�r� a]r� K0K�r� a]r� (K.K
�r� K0K �r� K K�r� e]r� (K-K�r� K K �r� e]r� K1K �r� a]r� KJK
�r� a]r� (K-K�r� K K �r� e]r� K0K �r� ae]r� (]r� KdK�r� a]r� (KfK�r� K K�r� e]r� K%K�r� a]r� K K�r� ae]r� (]r� KgK�r� a]r� (K-K �r� K K�r� ee]r� (]r� K%K�r� a]r� (KK �r� K K�r� ee]r� (]r� K%K�r� a]r� K K�r� ae]r� (]r� KhK�r� a]r� (KK�r� KK�r� e]r� K K�r� ae]r� (]r� KiK�r� a]r� (K0K�r� K K�r� e]r� (K-K�r� KfK�r� K K�r� e]r� K0K�r� a]r� K K�r� ae]r� (]r� KK�r� a]r� K1K�r� a]r� (KNK�r� K K�r� e]r� K0K�r� a]r� (K-K�r� K K�r� e]r� K0K�r� a]r� K K�r� ae]r� (]r� KjK�r� a]r� (KkK �r� K K�r� ee]r� (]r� KlK�r� a]r� (K2K�r� KmK�r� K K�r� e]r� (KlK�r� K7K�r e]r (KhK�r K7K�r e]r (K2K�r K K�r e]r K K�r ae]r (]r
(K1K�r K/K�r e]r
(K-K�r K K�r e]r (K1K�r K/K�r K K�r ee]r (]r (KK�r KK�r K$K�r KnK�r e]r KoK�r a]r K K�r ae]r (]r (KpK�r KqK�r! KrK�r" KsK�r# KtK�r$ e]r% K K�r& ae]r' (]r( KK�r) a]r* KMK�r+ a]r, KNK�r- a]r. KhK�r/ a]r0 KJK�r1 a]r2 KLK�r3 a]r4 (KuK�r5 K K�r6 e]r7 KJK�r8 a]r9 KLK �r: a]r; K K �r< ae]r= (]r> KK�r? a]r@ K%K�rA a]rB KvK�rC a]rD (KwK�rE KJK�rF e]rG K0K�rH a]rI KLK�rJ a]rK KJK�rL a]rM K K�rN ae]rO (]rP (KK�rQ KK�rR e]rS K%K�rT a]rU (K-K�rV K K�rW ee]rX (]rY KK�rZ a]r[ K0K�r\ a]r] KJK�r^ a]r_ KLK�r` a]ra (KxK�rb KuK�rc K K�rd e]re KJK�rf a]rg KLK�rh a]ri K K�rj ae]rk (]rl K%K�rm a]rn (KfK�ro K K�rp e]rq K%K�rr a]rs K K�rt ae]ru (]rv KyK�rw a]rx (K-K�ry K K�rz e]r{ (KyK�r| K K�r} ee]r~ (]r KK�r� a]r� (KK�r� KdK�r� e]r� (KK�r� KK�r� KdK�r� e]r� KK�r� a]r� (KK�r� KK�r� KzK�r� e]r� KzK�r� a]r� K K�r� a]r� K5K�r� ae]r� (]r� KK�r� a]r� K{K�r� a]r� K K�r� ae]r� (]r� (K|K�r� K}K�r� e]r� K K�r� ae]r� (]r� KK�r� a]r� (KJK�r� K~K�r� e]r� K0K�r� a]r� KJK�r� a]r� K K�r� ae]r� (]r� (K/K�r� K0K�r� e]r� (K-K�r� K3K�r� K K�r� e]r� (K/K�r� K0K�r� K K�r� e]r� K K�r� a]r� (K-K�r� K K�r� ee]r� (]r� (KK�r� KK�r� e]r� K*K�r� a]r� K K�r� ae]r� (]r� KK�r� a]r� (KJK�r� K~K�r� e]r� KQK�r� a]r� KJK�r� a]r� K K�r� ae]r� (]r� (K�K�r� K�K�r� e]r� K K�r� ae]r� (]r� K�K�r� a]r� (K�K �r� K K�r� ee]r� (]r� KK�r� a]r� (K5K�r� K�K�r� e]r� K K�r� a]r� K5K�r� ae]r� (]r� KK�r� a]r� K K�r� ae]r� (]r� K�K�r� a]r� (K.K�r� K�K�r� K K�r� e]r� KoK�r� a]r� K K�r� ae]r� (]r� K K�r� a]r� (K�K�r� K0K�r� K K�r� e]r� K0K�r
a]r
(K-K�r
K K�r
e]r
(K-K�r
K K�r
e]r
(K0K�r
K K�r
e]r
K0K�r
a]r
(K-K�r
K K�r
e]r
(K0K�r
K K�r
ee]r
(]r
K K�r
a]r
(K0K�r
K K�r
e]r
(K-K�r
KK�r
K K�r
e]r
K0K�r
a]r
K0K�r
a]r
(K-K�r!
K K�r"
e]r#
K K�r$
ae]r%
(]r&
K K�r'
a]r(
(KhK�r)
K K�r*
e]r+
K K�r,
ae]r-
(]r.
K�K�r/
a]r0
(K�K �r1
K�K �r2
K K�r3
ee]r4
(]r5
K�K�r6
a]r7
(K�K�r8
KK�r9
e]r:
(KK�r;
K�K�r<
e]r=
K K�r>
ae]r?
(]r@
(KK�rA
K�K�rB
K�K�rC
e]rD
K K�rE
a]rF
KK�rG
ae]rH
(]rI
KJK�rJ
a]rK
(K0K�rL
K K�rM
e]rN
K K�rO
ae]rP
(]rQ
(K�K�rR
K�K�rS
K�K�rT
K�K�rU
K�K�rV
K�K�rW
K�K�rX
K�K�rY
K�K�rZ
e]r[
K K�r\
ae]r]
(]r^
KK�r_
a]r`
K1K�ra
a]rb
K K�rc
ae]rd
(]re
(K�K�rf
K�K�rg
e]rh
K K�ri
ae]rj
(]rk
(KJK�rl
K0K�rm
e]rn
(K�K�ro
K0K�rp
K K�rq
e]rr
(KJK�rs
K K�rt
e]ru
K K�rv
a]rw
(K�K�rx
K K�ry
ee]rz
(]r{
K�K�r|
a]r}
(K-K�r~
K K�r
e]r�
(K�K�r�
K K�r�
ee]r�
(]r�
(KK�r�
K�K�r�
e]r�
K�K�r�
a]r�
K K�r�
a]r�
KK�r�
a]r�
(K�K�r�
KK�r�
ee]r�
(]r�
KoK�r�
a]r�
(K�K �r�
KK �r�
K�K �r�
K�K �r�
K K �r�
K K�r�
ee]r�
(]r�
(K�K�r�
K�K�r�
e]r�
K K�r�
a]r�
(KK�r�
K K�r�
e]r�
K�K�r�
a]r�
KuK�r�
a]r�
K0K�r�
ae]r�
(]r�
K0K�r�
a]r�
(K-K�r�
K K�r�
e]r�
(K0K�r�
K K�r�
ee]r�
(]r�
K0K�r�
a]r�
(K-K �r�
K K�r�
ee]r�
(]r�
(K/K�r�
K0K�r�
e]r�
(K-K�r�
K3K�r�
K K�r�
e]r�
(K/K�r�
K0K�r�
K K�r�
e]r�
K K�r�
a]r�
(K-K�r�
K K�r�
ee]r�
(]r�
KQK�r�
a]r�
(K-K�r�
K K�r�
e]r�
KQK�r�
a]r�
(K-K�r�
K K�r�
e]r�
(KQK�r�
K K�r�
ee]r�
(]r�
(K/K�r�
K0K�r�
e]r�
(K-K�r�
K K�r�
e]r�
(K/K�r�
K0K�r�
K K�r�
ee]r�
(]r�
(KK�r�
K�K�r�
e]r�
K�K�r�
a]r�
K K�r�
a]r�
K5K�r�
ae]r�
(]r�
K�K�r�
a]r�
(K-K�r�
K K�r�
e]r�
(K�K�r�
K K�r�
ee]r�
(]r�
K%K�r�
a]r�
(KJK�r�
K K�r�
e]r�
K0K�r�
a]r�
K K�r�
ae]r�
(]r (KK�r KK�r K
K�r e]r (K5K�r KKK�r e]r K%K�r a]r K�K�r
a]r K K�r a]r
K5K�r a]r K8K�r ae]r (]r K K�r a]r KJK�r a]r KLK�r a]r (K�K�r K�K�r e]r KJK�r a]r KJK�r a]r KLK�r a]r! KLK �r" a]r# K K�r$ a]r% (KuK
�r& K�K�r' K�K�r( K K �r) e]r* KJK �r+ a]r, KLK �r- a]r. (K�K�r/ K K �r0 ee]r1 (]r2 (KK�r3 K.K�r4 K�K�r5 e]r6 (K-K�r7 K�K�r8 K K�r9 e]r: K�K�r; a]r< (K-K�r= K2K�r> K K�r? e]r@ (K.K�rA K�K �rB e]rC (K-K�rD K K�rE e]rF K K�rG a]rH (KK�rI K.K�rJ K�K�rK K K�rL e]rM K0K
�rN a]rO (K-K�rP K2K �rQ K K �rR e]rS (K-K�rT K K
�rU e]rV K0K�rW ae]rX (]rY (KK�rZ K.K�r[ K�K�r\ e]r] (K-K�r^ K�K�r_ K K�r` e]ra K�K�rb a]rc (K-K�rd K2K�re K K�rf e]rg (K.K�rh K�K �ri e]rj (K-K�rk K K�rl e]rm K K�rn a]ro (KK�rp K.K�rq K�K�rr K K�rs e]rt K0K
�ru a]rv (K-K�rw K2K �rx K K �ry e]rz (K-K�r{ K K
�r| e]r} K0K�r~ ae]r (]r� (KK�r� K�K�r� e]r� K�K�r� a]r� K K�r� a]r� K5K�r� ae]r� (]r� K�K�r� a]r� (K-K�r� K K�r� e]r� (K�K�r� K K�r� ee]r� (]r� K%K�r� a]r� K K�r� ae]r� (]r� K K�r� a]r� K0K�r� a]r� KJK�r� a]r� KLK�r� a]r� (KuK�r� K K�r� e]r� KJK�r� a]r� KLK�r� a]r� K K�r� ae]r� (]r� K0K�r� a]r� (KfK�r� K K�r� e]r� K1K�r� a]r� K K�r� ae]r� (]r� K!K�r� a]r� K�K�r� a]r� (K-K�r� KJK�r� e]r� KLK�r� a]r� K K�r� ae]r� (]r� KfK�r� a]r� K1K�r� a]r� K K�r� ae]r� (]r� K�K�r� a]r� (K�K �r� K K�r� ee]r� (]r� (KK�r� KhK�r� e]r� K0K�r� a]r� K K�r� ae]r� (]r� K"K�r� a]r� (K�K�r� K K�r� e]r� K K�r� ae]r� (]r� K7K�r� a]r� K K�r� aeee]r� (U symbol2labelr� h ]r� (]r� (Uand_exprr� K�e]r� (Uand_testr� K�e]r� (Uarglistr� KKe]r� (Uargumentr� K,e]r� (U
arith_exprr� K�e]r� (U assert_stmtr� K�e]r� (Uatomr� K�e]r� (U augassignr� Kme]r� (U
break_stmtr� Kpe]r� (Uclassdefr� K[e]r� (Ucomp_forr� K3e]r� (Ucomp_ifr� KRe]r� (U comp_iterr� KPe]r� (Ucomp_opr� KZe]r (U
comparisonr Ke]r (U
compound_stmtr K�e]r (U
continue_stmtr Kqe]r (U decoratedr K\e]r (U decoratorr Kee]r
(U
decoratorsr Kce]r (Udel_stmtr
K�e]r (U dictsetmakerr K<e]r (Udotted_as_namer Kge]r (Udotted_as_namesr K{e]r (U dotted_namer Kde]r (U
except_clauser K�e]r (U exec_stmtr K�e]r (Uexprr K1e]r (U expr_stmtr K�e]r (Uexprlistr KMe]r (Ufactorr! Koe]r" (U flow_stmtr# K�e]r$ (Ufor_stmtr% K]e]r& (Ufuncdefr' K^e]r( (U global_stmtr) K�e]r* (Uif_stmtr+ K_e]r, (Uimport_as_namer- Kye]r. (Uimport_as_namesr/ Kze]r0 (U import_fromr1 K|e]r2 (U import_namer3 K}e]r4 (U import_stmtr5 K�e]r6 (Ulambdefr7 K�e]r8 (U listmakerr9 K9e]r: (Unot_testr; K*e]r< (U old_lambdefr= K�e]r> (Uold_testr? KQe]r@ (Uor_testrA K�e]rB (U
parametersrC Kve]rD (U pass_stmtrE K�e]rF (UpowerrG Kne]rH (U
print_stmtrI K�e]rJ (U
raise_stmtrK Kre]rL (U return_stmtrM Kse]rN (U
shift_exprrO K(e]rP (U simple_stmtrQ K�e]rR (UsliceoprS K�e]rT (U
small_stmtrU K�e]rV (U star_exprrW K/e]rX (UstmtrY Ke]rZ (U subscriptr[ K�e]r\ (U
subscriptlistr] K�e]r^ (Usuiter_ KLe]r` (Utermra K4e]rb (Utestrc K0e]rd (Utestlistre Khe]rf (U testlist1rg K:e]rh (U
testlist_gexpri K6e]rj (U
testlist_saferk KOe]rl (Utestlist_star_exprrm Kle]rn (Utfpdefro K�e]rp (Utfplistrq K�e]rr (Utnamers K�e]rt (Utrailerru K�e]rv (Utry_stmtrw K`e]rx (U
typedargslistry K�e]rz (U varargslistr{ K~e]r| (Uvfpdefr} K�e]r~ (Uvfplistr K�e]r� (Uvnamer� K�e]r� (U
while_stmtr� Kae]r� (U with_itemr� K�e]r� (U with_stmtr� Kbe]r� (Uxor_exprr� Kje]r� (U yield_argr� K�e]r� (U
yield_exprr� K7e]r� (U
yield_stmtr� Ktee�r� Rr� e]r� (U
symbol2numberr� h ]r� (]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� M e]r� (j� M
e]r� (j� M e]r� (j� M e]r� (j� M
e]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j� Me]r� (j
Me]r� (j
M e]r� (j
M e]r� (j
M e]r� (j
M e]r� (j
M e]r� (j
M!e]r� (j� M e]r� (j
M"e]r� (j
M#e]r� (j
M$e]r� (j
M%e]r� (j
M&e]r� (j
M'e]r� (j
M(e]r� (j
M)e]r� (j
M*e]r� (j!
M+e]r� (j#
M,e]r� (j%
M-e]r� (j'
M.e]r� (j)
M/e]r� (j+
M0e]r� (j-
M1e]r� (j/
M2e]r� (j1
M3e]r� (j3
M4e]r� (j5
M5e]r� (j7
M6e]r� (j9
M7e]r� (j;
M8e]r� (j=
M9e]r� (j?
M:e]r� (jA
M;e]r� (jC
M<e]r� (jE
M=e]r� (jG
M>e]r� (jI
M?e]r� (jK
M@e]r� (jM
MAe]r� (jO
MBe]r� (jQ
MCe]r� (jS
MDe]r� (jU
MEe]r� (jW
MFe]r� (jY
MGe]r� (j[
MHe]r� (j]
MIe]r� (j_
MJe]r� (ja
MKe]r� (jc
MLe]r� (je
MMe]r� (jg
MNe]r� (ji
MOe]r� (jk
MPe]r� (jm
MQe]r� (jo
MRe]r� (jq
MSe]r� (js
MTe]r� (ju
MUe]r� (jw
MVe]r� (jy
MWe]r� (j{
MXe]r� (j}
MYe]r� (j
MZee�r� Rr� e]r� (Utokensr� h ]r� (]r� (K Ke]r� (KK%e]r� (KK&e]r� (KK'e]r� (KKe]r� (KK�e]r� (KK�e]r� (KKe]r� (KK5e]r� (K K
e]r� (K
K8e]r (K KJe]r (K K-e]r (K
K�e]r (KKe]r (KKe]r (KKe]r (KK�e]r (KKke]r (KK)e]r (KKTe]r
(KKWe]r (KK2e]r (KKe]r
(KK�e]r (KK e]r (KK#e]r (KK;e]r (K KVe]r (K KSe]r (K KUe]r (K KXe]r (K K$e]r (K!K�e]r (K"K�e]r (K#K�e]r (K$K.e]r (K%KAe]r (K&KBe]r (K'K@e]r (K(KDe]r (K)K=e]r (K*K>e]r (K+KIe]r! (K,KHe]r" (K-KEe]r# (K.KFe]r$ (K/K?e]r% (K0K�e]r& (K1KCe]r' (K2K e]r( (K3KGe]r) (K7Kwee�r* Rr+ ee�r, Rr- .
