Method: pylint.extensions.mccabe.PathGraphingAstVisitor._subgraph
Calls: 44, Exceptions: 0, Paths: 2Back
Path 1: 43 calls (0.98)
If (35) For (5) TryExcept (2) While (1)
'If 23' (1) 'If 25' (1) 'Loop 33' (1) 'Loop 39' (1) 'If 47' (1) 'TryExcept 70' (1) 'If 83' (1) 'If 86' (1) 'If 90' (1) 'If 91' (1)
() (41) list (2)
1def _subgraph(
2 self,
3 node: _SubGraphNodes,
4 name: str,
5 extra_blocks: Sequence[nodes.ExceptHandler] = (),
6 ) -> None:
7 """Create the subgraphs representing any `if` and `for` statements."""
8 if self.graph is None:
9 # global loop
10 self.graph = PathGraph(node)
11 self._subgraph_parse(node, node, extra_blocks)
12 self.graphs[f"{self.classname}{name}"] = self.graph
13 self.reset()
14 else:
15 self._append_node(node)
16 self._subgraph_parse(node, node, extra_blocks)
Path 2: 1 calls (0.02)
For (1)
'Loop 198' (1)
() (1)
1def _subgraph(
2 self,
3 node: _SubGraphNodes,
4 name: str,
5 extra_blocks: Sequence[nodes.ExceptHandler] = (),
6 ) -> None:
7 """Create the subgraphs representing any `if` and `for` statements."""
8 if self.graph is None:
9 # global loop
10 self.graph = PathGraph(node)
11 self._subgraph_parse(node, node, extra_blocks)
12 self.graphs[f"{self.classname}{name}"] = self.graph
13 self.reset()
14 else:
15 self._append_node(node)
16 self._subgraph_parse(node, node, extra_blocks)