VimPlug/typeshed
1
0
Fork 0
mirror of https://github.com/davidhalter/typeshed.git synced 2025-12-21 19:32:13 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

stdlib: add argument default values (#9501)

Browse Source
This commit is contained in:
Jelle Zijlstra
2023-01-18 00:37:34 -08:00
committed by GitHub
parent 6cb934291f
commit ddfaca3200
272 changed files with 2529 additions and 2467 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
stdlib/lib2to3/pytree.pyi
View File

@@ -43,9 +43,9 @@ class Node(Base):
self,
type: int,
children: list[_NL],
context: Any | None = ...,
prefix: str | None = ...,
fixers_applied: list[Any] | None = ...,
context: Any | None = None,
prefix: str | None = None,
fixers_applied: list[Any] | None = None,
) -> None: ...
def set_child(self, i: int, child: _NL) -> None: ...
def insert_child(self, i: int, child: _NL) -> None: ...
@@ -58,7 +58,7 @@ class Leaf(Base):
value: str
fixers_applied: list[Any]
def __init__(
self, type: int, value: str, context: _Context | None = ..., prefix: str | None = ..., fixers_applied: list[Any] = ...
self, type: int, value: str, context: _Context | None = None, prefix: str | None = None, fixers_applied: list[Any] = ...
) -> None: ...
def __unicode__(self) -> str: ...
@@ -69,23 +69,23 @@ class BasePattern:
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 match(self, node: _NL, results: _Results | None = None) -> bool: ...
def match_seq(self, nodes: list[_NL], results: _Results | None = 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: ...
def __init__(self, type: int | None = None, content: str | None = None, name: str | None = None) -> None: ...
class NodePattern(BasePattern):
wildcards: bool
def __init__(self, type: int | None = ..., content: str | None = ..., name: str | None = ...) -> None: ...
def __init__(self, type: int | None = None, content: str | None = None, name: str | None = None) -> None: ...
class WildcardPattern(BasePattern):
min: int
max: int
def __init__(self, content: str | None = ..., min: int = ..., max: int = ..., name: str | None = ...) -> None: ...
def __init__(self, content: str | None = None, min: int = 0, max: int = 2147483647, name: str | None = None) -> None: ...
class NegatedPattern(BasePattern):
def __init__(self, content: str | None = ...) -> None: ...
def __init__(self, content: str | None = None) -> None: ...
def generate_matches(patterns: list[BasePattern], nodes: list[_NL]) -> Iterator[tuple[int, _Results]]: ...