{"push_id":1101076697,"size":1,"distinct_size":1,"ref":"refs/heads/flatten","head":"e3b323c17a0714963174d0321aaf779b892dd4bb","before":"936db2a9687a5b27ef0af93efb669b13160e9a5a","commits":[{"sha":"e3b323c17a0714963174d0321aaf779b892dd4bb","author":{"email":"833eba0fe33212ed5ce3f4192fb7b5e7bb4023e1@gmail.com","name":"John Vandenberg"},"message":"Flatten handlers\n\npyflakes has traditionally recursed with a handler for every\nlevel of the ast.  The ast depth can become very large, especially\nfor an expression containing many binary operators.\n\nPython has a maximum recursion limit, defaulting to a low number\nlike 1000, which resulted in a RuntimeError for the ast of:\n\n    x = 1 + 2 + 3 + ... + 1001\n\nThis change avoids recursing for nodes that do not have a specific\nhandler.\n\nChecker.nodeDepth and node.depth change from always being the\nast depth, which varied based on Python version due to ast differences,\nto being the number of nested handlers within pyflakes.","distinct":true,"url":"https://api.github.com/repos/jayvdb/pyflakes/commits/e3b323c17a0714963174d0321aaf779b892dd4bb"}]}