New submission from Chrome :
`lib2to3.refactor.RefactoringTool.traverse_by` do a pre-order or post-order,
and apply every candidate fixer to each node when traverse the tree. when a
prior fixer add a new node that contains children, these children won't be
visited by posterior f
Chrome added the comment:
`lib2to3.refactor.RefactoringTool.traverse_by` do a pre-order or post-order
traverse algorithm, and apply every candidate fixer to each node when traverse
the tree. when a prior fixer add a new node that contains children, these
children won't be visit
Change by Chrome :
--
keywords: +patch
pull_requests: +21097
stage: -> patch review
pull_request: https://github.com/python/cpython/pull/21988
___
Python tracker
<https://bugs.python.org/issu
Change by Chrome :
--
title: new Node may not visited in lib2to3.refactor.RefactoringTool.traverse_by
-> New Node may not be visited in lib2to3.refactor.RefactoringTool.traverse_by
___
Python tracker
<https://bugs.python.org/issu
Change by Chrome :
--
versions: +Python 3.5, Python 3.6, Python 3.7, Python 3.8
___
Python tracker
<https://bugs.python.org/issue41659>
___
___
Python-bugs-list m
Change by Chrome :
--
versions: -Python 3.5, Python 3.6, Python 3.7, Python 3.8
___
Python tracker
<https://bugs.python.org/issue41659>
___
___
Python-bug
Change by Chrome :
--
versions: +Python 3.5, Python 3.6, Python 3.7, Python 3.8, Python 3.9
___
Python tracker
<https://bugs.python.org/issue41655>
___
___
Pytho
Chrome added the comment:
you can run example.py to reproduce this bug.
--
Added file: https://bugs.python.org/file49434/example.py
___
Python tracker
<https://bugs.python.org/issue41
