mirror of
https://github.com/davidhalter/typeshed.git
synced 2025-12-08 21:14:48 +08:00
96c9abb058
* Always use `_typeshed.Self`, where applicable * Revert changes to `google-cloud-ndb` (ambiguous) * Remove empty line added by script * Revert changes to `stubs/python-dateutil/dateutil/relativedelta.pyi` * Manually add a few more that the script missed * Improve `filelock` annotation Source code here:79ec7b2826/src/filelock/_api.py (L207)* Improve `opentracing/scope` annotation Source code here:3e1d357a34/opentracing/scope.py (L71)* Improve `redis/client` stub Source code here:15f315a496/redis/client.py (L1217)* Improve `redis/lock` annotation Source code here:15f315a496/redis/lock.py (L155)* Improve `requests/models` annotation Source code here:d718e75383/requests/models.py (L653)
89 lines
3.0 KiB
Python
89 lines
3.0 KiB
Python
from _typeshed import Self
|
|
from lib2to3.pgen2.grammar import Grammar
|
|
from typing import Any, Callable, Iterator, Optional, Union
|
|
|
|
_NL = Union[Node, Leaf]
|
|
_Context = tuple[str, int, int]
|
|
_Results = dict[str, _NL]
|
|
_RawNode = tuple[int, str, _Context, Optional[list[_NL]]]
|
|
_Convert = Callable[[Grammar, _RawNode], Any]
|
|
|
|
HUGE: int
|
|
|
|
def type_repr(type_num: int) -> str: ...
|
|
|
|
class Base:
|
|
type: int
|
|
parent: Node | None
|
|
prefix: str
|
|
children: list[_NL]
|
|
was_changed: bool
|
|
was_checked: bool
|
|
def __eq__(self, other: Any) -> bool: ...
|
|
def _eq(self: Self, other: Self) -> bool: ...
|
|
def clone(self: Self) -> Self: ...
|
|
def post_order(self) -> Iterator[_NL]: ...
|
|
def pre_order(self) -> Iterator[_NL]: ...
|
|
def replace(self, new: _NL | list[_NL]) -> None: ...
|
|
def get_lineno(self) -> int: ...
|
|
def changed(self) -> None: ...
|
|
def remove(self) -> int | None: ...
|
|
@property
|
|
def next_sibling(self) -> _NL | None: ...
|
|
@property
|
|
def prev_sibling(self) -> _NL | None: ...
|
|
def leaves(self) -> Iterator[Leaf]: ...
|
|
def depth(self) -> int: ...
|
|
def get_suffix(self) -> str: ...
|
|
|
|
class Node(Base):
|
|
fixers_applied: list[Any]
|
|
def __init__(
|
|
self,
|
|
type: int,
|
|
children: list[_NL],
|
|
context: Any | None = ...,
|
|
prefix: str | None = ...,
|
|
fixers_applied: list[Any] | None = ...,
|
|
) -> None: ...
|
|
def set_child(self, i: int, child: _NL) -> None: ...
|
|
def insert_child(self, i: int, child: _NL) -> None: ...
|
|
def append_child(self, child: _NL) -> None: ...
|
|
|
|
class Leaf(Base):
|
|
lineno: int
|
|
column: int
|
|
value: str
|
|
fixers_applied: list[Any]
|
|
def __init__(
|
|
self, type: int, value: str, context: _Context | None = ..., prefix: str | None = ..., fixers_applied: list[Any] = ...
|
|
) -> None: ...
|
|
|
|
def convert(gr: Grammar, raw_node: _RawNode) -> _NL: ...
|
|
|
|
class BasePattern:
|
|
type: int
|
|
content: str | None
|
|
name: str | None
|
|
def optimize(self) -> BasePattern: ... # sic, subclasses are free to optimize themselves into different patterns
|
|
def match(self, node: _NL, results: _Results | None = ...) -> bool: ...
|
|
def match_seq(self, nodes: list[_NL], results: _Results | None = ...) -> bool: ...
|
|
def generate_matches(self, nodes: list[_NL]) -> Iterator[tuple[int, _Results]]: ...
|
|
|
|
class LeafPattern(BasePattern):
|
|
def __init__(self, type: int | None = ..., content: str | None = ..., name: str | None = ...) -> None: ...
|
|
|
|
class NodePattern(BasePattern):
|
|
wildcards: bool
|
|
def __init__(self, type: int | None = ..., content: str | None = ..., name: str | None = ...) -> None: ...
|
|
|
|
class WildcardPattern(BasePattern):
|
|
min: int
|
|
max: int
|
|
def __init__(self, content: str | None = ..., min: int = ..., max: int = ..., name: str | None = ...) -> None: ...
|
|
|
|
class NegatedPattern(BasePattern):
|
|
def __init__(self, content: str | None = ...) -> None: ...
|
|
|
|
def generate_matches(patterns: list[BasePattern], nodes: list[_NL]) -> Iterator[tuple[int, _Results]]: ...
|