MCPcopy Create free account
hub / github.com/eshirazi/python-with-braces / walk

Function walk

Lib/ast.py:203–214  ·  view source on GitHub ↗

Recursively yield all descendant nodes in the tree starting at *node* (including *node* itself), in no specified order. This is useful if you only want to modify nodes in place and don't care about the context.

(node)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

increment_linenoFunction · 0.70

Calls 4

dequeClass · 0.85
iter_child_nodesFunction · 0.85
popleftMethod · 0.80
extendMethod · 0.45

Tested by

no test coverage detected