Home
last modified time | relevance | path

Searched refs:CSTNode (Results 1 – 25 of 103) sorted by relevance

12345

/dports/devel/py-libcst/libcst-0.3.23/libcst/matchers/
H A D_visitors.py362 node: cst.CSTNode, argument
380 matchers: Dict[BaseMatcherNode, Optional[cst.CSTNode]], node: cst.CSTNode argument
427 node: cst.CSTNode, argument
466 [cst.CSTNode, cst.CSTNode], Union[cst.CSTNode, cst.RemovalSentinel]
591 ) -> Optional[Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]]]:
610 ) -> Sequence[Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]]]:
632 cst.CSTNode,
634 [cst.CSTNode, Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]]], argument
786 ) -> Optional[Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]]]:
805 ) -> Sequence[Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]]]:
[all …]
H A D_matcher_base.py1041 Dict[str, Union[libcst.CSTNode, Sequence[libcst.CSTNode]]]
1044 Union[libcst.CSTNode, MaybeSentinel, Sequence[libcst.CSTNode]]
1197 ) -> Optional[Dict[str, Union[libcst.CSTNode, Sequence[libcst.CSTNode]]]]:
1313 ) -> Optional[Dict[str, Union[libcst.CSTNode, Sequence[libcst.CSTNode]]]]:
1381 ) -> Optional[Dict[str, Union[libcst.CSTNode, Sequence[libcst.CSTNode]]]]:
1613 Dict[str, Union[libcst.CSTNode, Sequence[libcst.CSTNode]]]
1650 Sequence[Dict[str, Union[libcst.CSTNode, Sequence[libcst.CSTNode]]]],
1808 self.node_lut: Dict[libcst.CSTNode, libcst.CSTNode] = {}
1812 ) -> Union[libcst.CSTNode, Sequence[libcst.CSTNode]]:
1820 ) -> Dict[str, Union[libcst.CSTNode, Sequence[libcst.CSTNode]]]:
[all …]
/dports/devel/py-libcst/libcst-0.3.23/libcst/matchers/tests/
H A Dtest_replace.py18 extraction: Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]], argument
19 ) -> cst.CSTNode:
37 extraction: Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]], argument
38 ) -> cst.CSTNode:
80 extraction: Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]], argument
81 ) -> cst.CSTNode:
101 extraction: Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]], argument
115 extraction: Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]], argument
149 extraction: Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]], argument
180 extraction: Dict[str, Union[cst.CSTNode, Sequence[cst.CSTNode]]], argument
[all …]
H A Dtest_findall.py20 seq1: Sequence[cst.CSTNode], argument
21 seq2: Sequence[cst.CSTNode], argument
124 self.results: Sequence[cst.CSTNode] = ()
165 self.results: Sequence[cst.CSTNode] = ()
/dports/devel/py-libcst/libcst-0.3.23/libcst/_nodes/tests/
H A Dbase.py23 type: Type[cst.CSTNode]
33 a: cst.CSTNode, b: cst.CSTNode, msg: Optional[str] = None argument
106 node: cst.CSTNode, argument
145 self, node: cst.CSTNode argument
146 ) -> Sequence[cst.CSTNode]:
163 and issubclass(v, cst.CSTNode)
167 children: List[cst.CSTNode] = []
168 codegen_stack: List[cst.CSTNode] = []
213 if isinstance(value, cst.CSTNode):
251 class DummyIndentedBlock(cst.CSTNode):
[all …]
H A Dtest_cst_node.py27 def on_visit(self, node: cst.CSTNode) -> bool: argument
103 def test_deep_equals_success(self, a: cst.CSTNode, b: cst.CSTNode) -> None: argument
119 def test_deep_equals_fails(self, a: cst.CSTNode, b: cst.CSTNode) -> None: argument
H A Dtest_simple_whitespace.py23 def test_valid(self, node: cst.CSTNode, code: str) -> None: argument
34 self, get_node: Callable[[], cst.CSTNode], expected_re: str argument
102 def test_valid(self, node: cst.CSTNode, code: str) -> None: argument
H A Dtest_indented_block.py130 node: cst.CSTNode, argument
132 parser: Optional[Callable[[str], cst.CSTNode]], argument
154 self, get_node: Callable[[], cst.CSTNode], expected_re: str argument
H A Dtest_number.py93 node: cst.CSTNode, argument
95 parser: Optional[Callable[[str], cst.CSTNode]], argument
129 self, get_node: Callable[[], cst.CSTNode], expected_re: str argument
H A Dtest_comment.py21 def test_valid(self, node: cst.CSTNode, code: str) -> None: argument
32 self, get_node: Callable[[], cst.CSTNode], expected_re: str argument
H A Dtest_newline.py21 def test_valid(self, node: cst.CSTNode, code: str) -> None: argument
32 self, get_node: Callable[[], cst.CSTNode], expected_re: str argument
/dports/devel/py-libcst/libcst-0.3.23/libcst/codegen/
H A Dgather.py15 def _get_bases() -> Generator[Type[cst.CSTNode], None, None]:
29 typeclasses: Sequence[Type[cst.CSTNode]] = sorted(
34 def _get_nodes() -> Generator[Type[cst.CSTNode], None, None]:
48 if issubclass(node, cst.CSTNode):
55 all_libcst_nodes: Sequence[Type[cst.CSTNode]] = sorted(
58 node_to_bases: Dict[Type[cst.CSTNode], List[Type[cst.CSTNode]]] = {}
62 reversed([b for b in inspect.getmro(node) if issubclass(b, cst.CSTNode)])
66 def _get_most_generic_base_for_node(node: Type[cst.CSTNode]) -> Type[cst.CSTNode]: argument
73 nodebases: Dict[Type[cst.CSTNode], Type[cst.CSTNode]] = {}
86 nodeuses: Dict[Type[cst.CSTNode], Usage] = {node: Usage() for node in all_libcst_nodes}
/dports/devel/py-libcst/libcst-0.3.23/libcst/metadata/
H A Dspan_provider.py11 from libcst import CSTNode, Module
51 def before_codegen(self, node: CSTNode) -> None: argument
54 def after_codegen(self, node: CSTNode) -> None: argument
64 node: CSTNode, argument
66 start_node: Optional[CSTNode] = None, argument
67 end_node: Optional[CSTNode] = None, argument
H A Dscope_provider.py205 node: cst.CSTNode
256 as_name: cst.CSTNode
262 node: cst.CSTNode, argument
264 as_name: cst.CSTNode, argument
336 def __contains__(self, node: Union[str, cst.CSTNode]) -> bool: argument
358 def __contains__(self, node: Union[str, cst.CSTNode]) -> bool: argument
425 self, name: str, node: cst.CSTNode, as_name: cst.CSTNode argument
512 self, node: Union[str, cst.CSTNode] argument
641 node: cst.CSTNode
774 def _is_assignment(node: cst.CSTNode, assignment_node: cst.CSTNode) -> bool: argument
[all …]
H A Dposition_provider.py13 from libcst._nodes.base import CSTNode
97 node: CSTNode, argument
99 start_node: Optional[CSTNode] = None, argument
100 end_node: Optional[CSTNode] = None, argument
H A Dparent_node_provider.py18 def on_leave(self, original_node: cst.CSTNode) -> None: argument
24 class ParentNodeProvider(BatchableMetadataProvider[cst.CSTNode]):
/dports/devel/py-libcst/libcst-0.3.23/libcst/_nodes/
H A Dbase.py32 self.children: List[CSTNode] = []
111 class CSTNode(ABC): class
130 cls.__repr__ = CSTNode.__repr__
132 cls.__eq__ = CSTNode.__eq__
134 cls.__hash__ = CSTNode.__hash__
237 if not isinstance(leave_result, (CSTNode, RemovalSentinel, FlattenSentinel)):
470 class BaseLeaf(CSTNode, ABC):
472 def children(self) -> Sequence[CSTNode]:
H A Ddeep_equals.py13 from libcst._nodes.base import CSTNode
17 if isinstance(a, CSTNode) and isinstance(b, CSTNode):
H A Dwhitespace.py13 from libcst._nodes.base import BaseLeaf, BaseValueToken, CSTNode, CSTValidationError
30 class BaseParenthesizableWhitespace(CSTNode, ABC):
168 class TrailingWhitespace(CSTNode):
200 class EmptyLine(CSTNode):
H A Dmodule.py10 from libcst._nodes.base import CSTNode
34 class Module(CSTNode):
127 def code_for_node(self, node: CSTNode) -> str: argument
/dports/devel/py-libcst/libcst-0.3.23/libcst/metadata/tests/
H A Dtest_metadata_provider.py33 def on_visit(self, node: cst.CSTNode) -> bool: argument
40 def on_visit(self, node: cst.CSTNode) -> bool: argument
112 def visit_Pass(self, node: cst.CSTNode) -> None: argument
133 def on_visit(self, node: cst.CSTNode) -> bool: argument
273 def on_visit(self, node: cst.CSTNode) -> bool: argument
277 def on_leave(self, original_node: cst.CSTNode) -> None: argument
298 def on_visit(self, node: cst.CSTNode) -> bool: argument
322 def on_visit(self, node: cst.CSTNode) -> bool: argument
/dports/devel/py-libcst/libcst-0.3.23/docs/source/
H A Dhelpers.rst6 We add helpers as method of ``CSTNode`` or ``libcst.helpers`` package based on those principles:
8 - ``CSTNode`` method: simple, read-only and only require data of the direct children of a CSTNode.
H A Dvisitors.rst18 ``visit_<Type[CSTNode]>``, ``leave_<Type[CSTNode]>``, ``visit_<Type[CSTNode]>_<attribute>`` and
19 ``leave_<Type[CSTNode]>_<attribute>`` method on the visitor subclass and call them directly.
25 Much like ``on_visit``, ``visit_<Type[CSTNode]>`` return a boolean specifying whether or not LibCST
27 from your ``visit_<Type[CSTNode]>`` functions. Returning a ``None`` value is treated as a request f…
/dports/devel/py-libcst/libcst-0.3.23/libcst/_parser/
H A Dentrypoints.py14 from libcst._nodes.base import CSTNode
33 ) -> CSTNode:
51 assert isinstance(result, CSTNode)
/dports/devel/py-libcst/libcst-0.3.23/libcst/helpers/
H A Dexpression.py11 def get_full_name_for_node(node: Union[str, cst.CSTNode]) -> Optional[str]: argument
34 def get_full_name_for_node_or_raise(node: Union[str, cst.CSTNode]) -> str: argument

12345