Chrome <expo....@gmail.com> 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 visited by posterior fixers. ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <https://bugs.python.org/issue41655> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
