Kaydet (Commit) 878359e8 authored tarafından Berker Peksag's avatar Berker Peksag

Silence flake8 warnings.

üst 5f9ce56e
...@@ -11,9 +11,9 @@ Copyright 2013 (c) Berker Peksag ...@@ -11,9 +11,9 @@ Copyright 2013 (c) Berker Peksag
__version__ = '0.4-dev' __version__ = '0.4-dev'
from .codegen import to_source from .codegen import to_source # NOQA
from .misc import iter_node, dump, all_symbols, get_anyop from .misc import iter_node, dump, all_symbols, get_anyop # NOQA
from .misc import get_boolop, get_binop, get_cmpop, get_unaryop from .misc import get_boolop, get_binop, get_cmpop, get_unaryop # NOQA
from .misc import ExplicitNodeVisitor from .misc import ExplicitNodeVisitor # NOQA
from .misc import parsefile, CodeToAst, codetoast from .misc import parsefile, CodeToAst, codetoast # NOQA
from .treewalk import TreeWalk from .treewalk import TreeWalk # NOQA
...@@ -143,7 +143,8 @@ class TreeWalk(MetaFlatten): ...@@ -143,7 +143,8 @@ class TreeWalk(MetaFlatten):
prev = nodestack[-1] prev = nodestack[-1]
index = prev[-1] - 1 index = prev[-1] - 1
oldnode, name = prev[-2][index] oldnode, name = prev[-2][index]
assert cur[0] is cur_node is oldnode, (cur[0], cur_node, prev[-2], index) assert cur[0] is cur_node is oldnode, (cur[0], cur_node, prev[-2],
index)
parent = prev[0] parent = prev[0]
if isinstance(parent, list): if isinstance(parent, list):
parent[index] = new_node parent[index] = new_node
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment