Method find_node

PyInstaller/lib/modulegraph/modulegraph.py:1099–1168

Graph node uniquely identified by the passed fully-qualified module name if this module has been added to the graph _or_ `None` otherwise. If (in order): . A namespace package with this identifier exists _and_ the passed `create_nspkg` parameter is `True`

(self, name, create_nspkg=True)

    createReference = add_edge

    def find_node(self, name, create_nspkg=True):
        """
        Graph node uniquely identified by the passed fully-qualified module
        name if this module has been added to the graph _or_ `None` otherwise.

        If (in order):

        . A namespace package with this identifier exists _and_ the passed
          `create_nspkg` parameter is `True`, this package will be
          instantiated and returned.
        . A lazy node with this identifier and:
          * No dependencies exists, this node will be instantiated and
            returned.
          * Dependencies exists, this node and all transitive dependencies of
            this node be instantiated and this node returned.
        . A non-lazy node with this identifier exists, this node will be
          returned as is.

        Parameters
        ----------
        name : str
            Fully-qualified name of the module whose graph node is to be found.
        create_nspkg : bool
            Ignored.

        Returns
        ----------
        Node
            Graph node of this module if added to the graph _or_ `None`
            otherwise.
        """

        data = super(ModuleGraph, self).findNode(name)

        if data is not None:
            return data

        if name in self.lazynodes:
            deps = self.lazynodes.pop(name)

            if deps is None:
                # excluded module
                m = self.createNode(ExcludedModule, name)
            elif isinstance(deps, Alias):
                # NOTE: the AliasNode must be created and added to graph
                # before trying to create the referred node; that might
                # (due to recursive import analysis) lead to another
                # attempt to resolve the aliased node (and if there is
                # a real node that we are trying to shadow with the alias,
                # that will end up added to the graph and prevent the
                # alias node from being added).
                m = self.createNode(AliasNode, name)

                # Create the referred node.
                other = self._safe_import_hook(deps, None, None).pop()

                # Copy attributes; this used to be done by AliasNode
                # constructor, back when referred node was created before