Grows the graph by adding a reentry node. This node causes control flow to go back to the loop section's entry. Args: ast_node: ast.AST section_id: Hashable, the node for which ast_node should be considered to be an exit node guards: Tuple[ast.AST, ...], the fin
(self, ast_node, section_id, guards)
| 426 | self.exits[section_id].add(node) |
| 427 | |
| 428 | def add_continue_node(self, ast_node, section_id, guards): |
| 429 | """Grows the graph by adding a reentry node. |
| 430 | |
| 431 | This node causes control flow to go back to the loop section's entry. |
| 432 | |
| 433 | Args: |
| 434 | ast_node: ast.AST |
| 435 | section_id: Hashable, the node for which ast_node should be considered |
| 436 | to be an exit node |
| 437 | guards: Tuple[ast.AST, ...], the finally sections that guard ast_node |
| 438 | """ |
| 439 | node = self._add_jump_node(ast_node, guards) |
| 440 | self.continues[section_id].add(node) |
| 441 | |
| 442 | def add_error_node(self, ast_node, guards): |
| 443 | """Grows the graph by adding an error node. |
no test coverage detected