Grows the graph by adding an ordinary CFG node. Ordinary nodes are followed by the next node, in lexical order, that is, they become the new leaf set. Args: ast_node: ast.AST Returns: Node
(self, ast_node)
| 365 | self.active_stmts.remove(stmt) |
| 366 | |
| 367 | def add_ordinary_node(self, ast_node): |
| 368 | """Grows the graph by adding an ordinary CFG node. |
| 369 | |
| 370 | Ordinary nodes are followed by the next node, in lexical order, that is, |
| 371 | they become the new leaf set. |
| 372 | |
| 373 | Args: |
| 374 | ast_node: ast.AST |
| 375 | Returns: |
| 376 | Node |
| 377 | """ |
| 378 | node = self._add_new_node(ast_node) |
| 379 | self.leaves = set((node,)) |
| 380 | return node |
| 381 | |
| 382 | def _add_jump_node(self, ast_node, guards): |
| 383 | """Grows the graph by adding a jump node. |
no test coverage detected