예제 #1
0
 def test_single(self):
     """Get a single parent."""
     graph = parso.parse("something = 8")
     name_node = graph.get_first_leaf()
     self.assertEqual(
         [name_node.parent, name_node.parent.parent],
         list(node_seek.iter_parents(name_node)),
     )
예제 #2
0
 def test_nested(self):
     """Get a every parent above a node."""
     graph = parso.parse("something = 8")
     expression_node = graph.get_first_leaf().parent
     self.assertEqual(
         [expression_node.parent],
         list(node_seek.iter_parents(expression_node)),
     )
예제 #3
0
def get_imports(graph, partial=False, namespaces=frozenset(), aliases=False):
    """Find every import in `graph`.

    Args:
        graph (:class:`parso.python.tree.Module`):
            Some parso node that may have Python imports iside of it.
        partial (bool, optional):
            If True, allow namespace replacement even if the user
            doesn't provide 100% of the namespace. If False, they must
            describe the entire import namespace before it can be
            renamed. Default is False.
        namespaces (set[str], optional):
            If `partial` is False, these dot-separated Python import
            namespaces are used to figure out if it's okay to replace an
            import or if any part of an import statement is missing. If
            no namespaces are given then `partial` must be set to True.
            Default: set().
        aliases (bool, optional):
            If True and replacing a namespace would cause Python
            statements to fail, auto-add an import alias to ensure
            backwards compatibility If False, don't add aliases. Default
            is False.

    Returns:
        :class:`.BaseAdapter`:
            Every import in `graph`, returned as a class that can easily
            query its data or replace it.

    """
    imports = set()
    processed = set(
    )  # This variable makes sure nodes are only ever parsed once

    # We reverse the nested children because parso nests its nodes
    # in ways that makes it hard to choose the correct adapter class
    # without starting from the bottom-level nodes and working our way
    # up each node's list of parents.
    #
    for child in reversed(list(node_seek.iter_nested_children(graph))):
        parents = node_seek.iter_parents(child)

        if any(parent for parent in parents if parent in processed):
            # Make sure that if a parent of `child` was parsed to not try to parse `child`
            continue

        adapter = import_registry.get_import_data(child,
                                                  partial=partial,
                                                  namespaces=namespaces,
                                                  aliases=aliases)

        if adapter:
            imports.add(adapter)

        processed.add(child)

    return imports
    def is_valid(node):
        """Check if `node` can be processed by this class."""
        if not (
            _is_dotted_import(node)
            or (isinstance(node, tree.PythonNode) and node.type == "dotted_as_names")
        ):
            return False

        for parent in node_seek.iter_parents(node):
            if isinstance(parent, tree.ImportFrom):
                return False

        return True
예제 #5
0
 def test_empty(self):
     """Get no parents when a node has no parents."""
     graph = parso.parse("something = 8")
     self.assertEqual([], list(node_seek.iter_parents(graph)))