Path 1: 69 calls (0.31)

→ nodes_lst list (69)

↩ return ['Optional[int]'] (35) ['str'] (20) ['Union[int, str]'] (3) ['str | int'] (3) ['Optional[Dummy]'] (3) ['list[Dummy]'] (3) ['dict[str, MessageDefinitio...

12 run 1 not run

1def class_names(self, nodes_lst: Iterable[nodes.NodeNG]) -> list[str]:
2        """Return class names if needed in diagram."""
3        names = []
4        for node in nodes_lst:
5            if isinstance(node, astroid.Instance):
6                node = node._proxied
7            if (
8                isinstance(
9                    node, (nodes.ClassDef, nodes.Name, nodes.Subscript, nodes.BinOp)
10                )
11                and hasattr(node, "name")
12                and not self.has_node(node)
13            ):
14                if node.name not in names:
15                    node_name = node.name
16                    names.append(node_name)
17        return names
            

Path 2: 61 calls (0.27)

→ nodes_lst list (61)

↩ return ['str'] (55) ['dict'] (2) ['int'] (2) ['tuple'] (1) ['Monkey'] (1)

13 run 0 not run

1def class_names(self, nodes_lst: Iterable[nodes.NodeNG]) -> list[str]:
2        """Return class names if needed in diagram."""
3        names = []
4        for node in nodes_lst:
5            if isinstance(node, astroid.Instance):
6                node = node._proxied
7            if (
8                isinstance(
9                    node, (nodes.ClassDef, nodes.Name, nodes.Subscript, nodes.BinOp)
10                )
11                and hasattr(node, "name")
12                and not self.has_node(node)
13            ):
14                if node.name not in names:
15                    node_name = node.name
16                    names.append(node_name)
17        return names
            

Path 3: 40 calls (0.18)

→ nodes_lst list (21) FunctionDef (19)

↩ return [] (40)

7 run 6 not run

1def class_names(self, nodes_lst: Iterable[nodes.NodeNG]) -> list[str]:
2        """Return class names if needed in diagram."""
3        names = []
4        for node in nodes_lst:
5            if isinstance(node, astroid.Instance):
6                node = node._proxied
7            if (
8                isinstance(
9                    node, (nodes.ClassDef, nodes.Name, nodes.Subscript, nodes.BinOp)
10                )
11                and hasattr(node, "name")
12                and not self.has_node(node)
13            ):
14                if node.name not in names:
15                    node_name = node.name
16                    names.append(node_name)
17        return names
            

Path 4: 38 calls (0.17)

→ nodes_lst list (38)

↩ return [] (38)

10 run 3 not run

1def class_names(self, nodes_lst: Iterable[nodes.NodeNG]) -> list[str]:
2        """Return class names if needed in diagram."""
3        names = []
4        for node in nodes_lst:
5            if isinstance(node, astroid.Instance):
6                node = node._proxied
7            if (
8                isinstance(
9                    node, (nodes.ClassDef, nodes.Name, nodes.Subscript, nodes.BinOp)
10                )
11                and hasattr(node, "name")
12                and not self.has_node(node)
13            ):
14                if node.name not in names:
15                    node_name = node.name
16                    names.append(node_name)
17        return names
            

Path 5: 17 calls (0.08)

→ nodes_lst list (17)

↩ return [] (17)

9 run 4 not run

1def class_names(self, nodes_lst: Iterable[nodes.NodeNG]) -> list[str]:
2        """Return class names if needed in diagram."""
3        names = []
4        for node in nodes_lst:
5            if isinstance(node, astroid.Instance):
6                node = node._proxied
7            if (
8                isinstance(
9                    node, (nodes.ClassDef, nodes.Name, nodes.Subscript, nodes.BinOp)
10                )
11                and hasattr(node, "name")
12                and not self.has_node(node)
13            ):
14                if node.name not in names:
15                    node_name = node.name
16                    names.append(node_name)
17        return names