basedpyright 1.24.0 → 1.25.0

package/dist/typeshed-fallback/stdlib/lib2to3/pgen2/tokenize.pyi

@@ -1,96 +1,96 @@
-from collections.abc import Callable, Iterable, Iterator
-from typing_extensions import TypeAlias
-
-from .token import *
-
-__all__ = [
-    "AMPER",
-    "AMPEREQUAL",
-    "ASYNC",
-    "AT",
-    "ATEQUAL",
-    "AWAIT",
-    "BACKQUOTE",
-    "CIRCUMFLEX",
-    "CIRCUMFLEXEQUAL",
-    "COLON",
-    "COMMA",
-    "COMMENT",
-    "DEDENT",
-    "DOT",
-    "DOUBLESLASH",
-    "DOUBLESLASHEQUAL",
-    "DOUBLESTAR",
-    "DOUBLESTAREQUAL",
-    "ENDMARKER",
-    "EQEQUAL",
-    "EQUAL",
-    "ERRORTOKEN",
-    "GREATER",
-    "GREATEREQUAL",
-    "INDENT",
-    "ISEOF",
-    "ISNONTERMINAL",
-    "ISTERMINAL",
-    "LBRACE",
-    "LEFTSHIFT",
-    "LEFTSHIFTEQUAL",
-    "LESS",
-    "LESSEQUAL",
-    "LPAR",
-    "LSQB",
-    "MINEQUAL",
-    "MINUS",
-    "NAME",
-    "NEWLINE",
-    "NL",
-    "NOTEQUAL",
-    "NT_OFFSET",
-    "NUMBER",
-    "N_TOKENS",
-    "OP",
-    "PERCENT",
-    "PERCENTEQUAL",
-    "PLUS",
-    "PLUSEQUAL",
-    "RARROW",
-    "RBRACE",
-    "RIGHTSHIFT",
-    "RIGHTSHIFTEQUAL",
-    "RPAR",
-    "RSQB",
-    "SEMI",
-    "SLASH",
-    "SLASHEQUAL",
-    "STAR",
-    "STAREQUAL",
-    "STRING",
-    "TILDE",
-    "VBAR",
-    "VBAREQUAL",
-    "tok_name",
-    "tokenize",
-    "generate_tokens",
-    "untokenize",
-    "COLONEQUAL",
-]
-
-_Coord: TypeAlias = tuple[int, int]
-_TokenEater: TypeAlias = Callable[[int, str, _Coord, _Coord, str], object]
-_TokenInfo: TypeAlias = tuple[int, str, _Coord, _Coord, str]
-
-class TokenError(Exception): ...
-class StopTokenizing(Exception): ...
-
-def tokenize(readline: Callable[[], str], tokeneater: _TokenEater = ...) -> None: ...
-
-class Untokenizer:
-    tokens: list[str]
-    prev_row: int
-    prev_col: int
-    def add_whitespace(self, start: _Coord) -> None: ...
-    def untokenize(self, iterable: Iterable[_TokenInfo]) -> str: ...
-    def compat(self, token: tuple[int, str], iterable: Iterable[_TokenInfo]) -> None: ...
-
-def untokenize(iterable: Iterable[_TokenInfo]) -> str: ...
-def generate_tokens(readline: Callable[[], str]) -> Iterator[_TokenInfo]: ...
+from collections.abc import Callable, Iterable, Iterator
+from typing_extensions import TypeAlias
+
+from .token import *
+
+__all__ = [
+    "AMPER",
+    "AMPEREQUAL",
+    "ASYNC",
+    "AT",
+    "ATEQUAL",
+    "AWAIT",
+    "BACKQUOTE",
+    "CIRCUMFLEX",
+    "CIRCUMFLEXEQUAL",
+    "COLON",
+    "COMMA",
+    "COMMENT",
+    "DEDENT",
+    "DOT",
+    "DOUBLESLASH",
+    "DOUBLESLASHEQUAL",
+    "DOUBLESTAR",
+    "DOUBLESTAREQUAL",
+    "ENDMARKER",
+    "EQEQUAL",
+    "EQUAL",
+    "ERRORTOKEN",
+    "GREATER",
+    "GREATEREQUAL",
+    "INDENT",
+    "ISEOF",
+    "ISNONTERMINAL",
+    "ISTERMINAL",
+    "LBRACE",
+    "LEFTSHIFT",
+    "LEFTSHIFTEQUAL",
+    "LESS",
+    "LESSEQUAL",
+    "LPAR",
+    "LSQB",
+    "MINEQUAL",
+    "MINUS",
+    "NAME",
+    "NEWLINE",
+    "NL",
+    "NOTEQUAL",
+    "NT_OFFSET",
+    "NUMBER",
+    "N_TOKENS",
+    "OP",
+    "PERCENT",
+    "PERCENTEQUAL",
+    "PLUS",
+    "PLUSEQUAL",
+    "RARROW",
+    "RBRACE",
+    "RIGHTSHIFT",
+    "RIGHTSHIFTEQUAL",
+    "RPAR",
+    "RSQB",
+    "SEMI",
+    "SLASH",
+    "SLASHEQUAL",
+    "STAR",
+    "STAREQUAL",
+    "STRING",
+    "TILDE",
+    "VBAR",
+    "VBAREQUAL",
+    "tok_name",
+    "tokenize",
+    "generate_tokens",
+    "untokenize",
+    "COLONEQUAL",
+]
+
+_Coord: TypeAlias = tuple[int, int]
+_TokenEater: TypeAlias = Callable[[int, str, _Coord, _Coord, str], object]
+_TokenInfo: TypeAlias = tuple[int, str, _Coord, _Coord, str]
+
+class TokenError(Exception): ...
+class StopTokenizing(Exception): ...
+
+def tokenize(readline: Callable[[], str], tokeneater: _TokenEater = ...) -> None: ...
+
+class Untokenizer:
+    tokens: list[str]
+    prev_row: int
+    prev_col: int
+    def add_whitespace(self, start: _Coord) -> None: ...
+    def untokenize(self, iterable: Iterable[_TokenInfo]) -> str: ...
+    def compat(self, token: tuple[int, str], iterable: Iterable[_TokenInfo]) -> None: ...
+
+def untokenize(iterable: Iterable[_TokenInfo]) -> str: ...
+def generate_tokens(readline: Callable[[], str]) -> Iterator[_TokenInfo]: ...

package/dist/typeshed-fallback/stdlib/lib2to3/pygram.pyi

@@ -1,114 +1,114 @@
-from .pgen2.grammar import Grammar
-
-class Symbols:
-    def __init__(self, grammar: Grammar) -> None: ...
-
-class python_symbols(Symbols):
-    and_expr: int
-    and_test: int
-    annassign: int
-    arglist: int
-    argument: int
-    arith_expr: int
-    assert_stmt: int
-    async_funcdef: int
-    async_stmt: int
-    atom: int
-    augassign: int
-    break_stmt: int
-    classdef: int
-    comp_for: int
-    comp_if: int
-    comp_iter: int
-    comp_op: int
-    comparison: int
-    compound_stmt: int
-    continue_stmt: int
-    decorated: int
-    decorator: int
-    decorators: int
-    del_stmt: int
-    dictsetmaker: int
-    dotted_as_name: int
-    dotted_as_names: int
-    dotted_name: int
-    encoding_decl: int
-    eval_input: int
-    except_clause: int
-    exec_stmt: int
-    expr: int
-    expr_stmt: int
-    exprlist: int
-    factor: int
-    file_input: int
-    flow_stmt: int
-    for_stmt: int
-    funcdef: int
-    global_stmt: int
-    if_stmt: int
-    import_as_name: int
-    import_as_names: int
-    import_from: int
-    import_name: int
-    import_stmt: int
-    lambdef: int
-    listmaker: int
-    not_test: int
-    old_lambdef: int
-    old_test: int
-    or_test: int
-    parameters: int
-    pass_stmt: int
-    power: int
-    print_stmt: int
-    raise_stmt: int
-    return_stmt: int
-    shift_expr: int
-    simple_stmt: int
-    single_input: int
-    sliceop: int
-    small_stmt: int
-    star_expr: int
-    stmt: int
-    subscript: int
-    subscriptlist: int
-    suite: int
-    term: int
-    test: int
-    testlist: int
-    testlist1: int
-    testlist_gexp: int
-    testlist_safe: int
-    testlist_star_expr: int
-    tfpdef: int
-    tfplist: int
-    tname: int
-    trailer: int
-    try_stmt: int
-    typedargslist: int
-    varargslist: int
-    vfpdef: int
-    vfplist: int
-    vname: int
-    while_stmt: int
-    with_item: int
-    with_stmt: int
-    with_var: int
-    xor_expr: int
-    yield_arg: int
-    yield_expr: int
-    yield_stmt: int
-
-class pattern_symbols(Symbols):
-    Alternative: int
-    Alternatives: int
-    Details: int
-    Matcher: int
-    NegatedUnit: int
-    Repeater: int
-    Unit: int
-
-python_grammar: Grammar
-python_grammar_no_print_statement: Grammar
-python_grammar_no_print_and_exec_statement: Grammar
-pattern_grammar: Grammar
+from .pgen2.grammar import Grammar
+
+class Symbols:
+    def __init__(self, grammar: Grammar) -> None: ...
+
+class python_symbols(Symbols):
+    and_expr: int
+    and_test: int
+    annassign: int
+    arglist: int
+    argument: int
+    arith_expr: int
+    assert_stmt: int
+    async_funcdef: int
+    async_stmt: int
+    atom: int
+    augassign: int
+    break_stmt: int
+    classdef: int
+    comp_for: int
+    comp_if: int
+    comp_iter: int
+    comp_op: int
+    comparison: int
+    compound_stmt: int
+    continue_stmt: int
+    decorated: int
+    decorator: int
+    decorators: int
+    del_stmt: int
+    dictsetmaker: int
+    dotted_as_name: int
+    dotted_as_names: int
+    dotted_name: int
+    encoding_decl: int
+    eval_input: int
+    except_clause: int
+    exec_stmt: int
+    expr: int
+    expr_stmt: int
+    exprlist: int
+    factor: int
+    file_input: int
+    flow_stmt: int
+    for_stmt: int
+    funcdef: int
+    global_stmt: int
+    if_stmt: int
+    import_as_name: int
+    import_as_names: int
+    import_from: int
+    import_name: int
+    import_stmt: int
+    lambdef: int
+    listmaker: int
+    not_test: int
+    old_lambdef: int
+    old_test: int
+    or_test: int
+    parameters: int
+    pass_stmt: int
+    power: int
+    print_stmt: int
+    raise_stmt: int
+    return_stmt: int
+    shift_expr: int
+    simple_stmt: int
+    single_input: int
+    sliceop: int
+    small_stmt: int
+    star_expr: int
+    stmt: int
+    subscript: int
+    subscriptlist: int
+    suite: int
+    term: int
+    test: int
+    testlist: int
+    testlist1: int
+    testlist_gexp: int
+    testlist_safe: int
+    testlist_star_expr: int
+    tfpdef: int
+    tfplist: int
+    tname: int
+    trailer: int
+    try_stmt: int
+    typedargslist: int
+    varargslist: int
+    vfpdef: int
+    vfplist: int
+    vname: int
+    while_stmt: int
+    with_item: int
+    with_stmt: int
+    with_var: int
+    xor_expr: int
+    yield_arg: int
+    yield_expr: int
+    yield_stmt: int
+
+class pattern_symbols(Symbols):
+    Alternative: int
+    Alternatives: int
+    Details: int
+    Matcher: int
+    NegatedUnit: int
+    Repeater: int
+    Unit: int
+
+python_grammar: Grammar
+python_grammar_no_print_statement: Grammar
+python_grammar_no_print_and_exec_statement: Grammar
+pattern_grammar: Grammar

package/dist/typeshed-fallback/stdlib/lib2to3/pytree.pyi

@@ -1,127 +1,117 @@
-from _typeshed import Incomplete, SupportsGetItem, SupportsLenAndGetItem, Unused
-from abc import abstractmethod
-from collections.abc import Iterable, Iterator, MutableSequence
-from typing import Final
-from typing_extensions import Self, TypeAlias
-
-from .fixer_base import BaseFix
-from .pgen2.grammar import Grammar
-
-_NL: TypeAlias = Node | Leaf
-_Context: TypeAlias = tuple[str, int, int]
-_Results: TypeAlias = dict[str, _NL]
-_RawNode: TypeAlias = tuple[int, str, _Context, list[_NL] | None]
-
-HUGE: Final = 0x7FFFFFFF
-
-def type_repr(type_num: int) -> str | int: ...
-
-class Base:
-    type: int
-    parent: Node | None
-    prefix: str
-    children: list[_NL]
-    was_changed: bool
-    was_checked: bool
-    def __eq__(self, other: object) -> bool: ...
-    @abstractmethod
-    def _eq(self, other: Base) -> bool: ...
-    @abstractmethod
-    def clone(self) -> Self: ...
-    @abstractmethod
-    def post_order(self) -> Iterator[Self]: ...
-    @abstractmethod
-    def pre_order(self) -> Iterator[Self]: ...
-    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:
-        """
-        The node immediately following the invocant in their parent's children
-        list. If the invocant does not have a next sibling, it is None
-        """
-        ...
-    @property
-    def prev_sibling(self) -> _NL | None:
-        """
-        The node immediately preceding the invocant in their parent's children
-        list. If the invocant does not have a previous sibling, it is None.
-        """
-        ...
-    def leaves(self) -> Iterator[Leaf]: ...
-    def depth(self) -> int: ...
-    def get_suffix(self) -> str: ...
-
-class Node(Base):
-    fixers_applied: MutableSequence[BaseFix] | None
-    # Is Unbound until set in refactor.RefactoringTool
-    future_features: frozenset[Incomplete]
-    # Is Unbound until set in pgen2.parse.Parser.pop
-    used_names: set[str]
-    def __init__(
-        self,
-        type: int,
-        children: Iterable[_NL],
-        context: Unused = None,
-        prefix: str | None = None,
-        fixers_applied: MutableSequence[BaseFix] | None = None,
-    ) -> None: ...
-    def _eq(self, other: Base) -> bool: ...
-    def clone(self) -> Node: ...
-    def post_order(self) -> Iterator[Self]: ...
-    def pre_order(self) -> Iterator[Self]: ...
-    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: ...
-    def __unicode__(self) -> str: ...
-
-class Leaf(Base):
-    lineno: int
-    column: int
-    value: str
-    fixers_applied: MutableSequence[BaseFix]
-    def __init__(
-        self,
-        type: int,
-        value: str,
-        context: _Context | None = None,
-        prefix: str | None = None,
-        fixers_applied: MutableSequence[BaseFix] = [],
-    ) -> None: ...
-    def _eq(self, other: Base) -> bool: ...
-    def clone(self) -> Leaf: ...
-    def post_order(self) -> Iterator[Self]: ...
-    def pre_order(self) -> Iterator[Self]: ...
-    def __unicode__(self) -> str: ...
-
-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 = None) -> bool: ...
-    def match_seq(self, nodes: SupportsLenAndGetItem[_NL], results: _Results | None = None) -> bool: ...
-    def generate_matches(self, nodes: SupportsGetItem[int, _NL]) -> Iterator[tuple[int, _Results]]: ...
-
-class LeafPattern(BasePattern):
-    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 = None, content: str | None = None, name: str | None = None) -> None: ...
-
-class WildcardPattern(BasePattern):
-    min: int
-    max: int
-    def __init__(self, content: str | None = None, min: int = 0, max: int = 0x7FFFFFFF, name: str | None = None) -> None: ...
-
-class NegatedPattern(BasePattern):
-    def __init__(self, content: str | None = None) -> None: ...
-
-def generate_matches(
-    patterns: SupportsGetItem[int | slice, BasePattern] | None, nodes: SupportsGetItem[int | slice, _NL]
-) -> Iterator[tuple[int, _Results]]: ...
+from _typeshed import Incomplete, SupportsGetItem, SupportsLenAndGetItem, Unused
+from abc import abstractmethod
+from collections.abc import Iterable, Iterator, MutableSequence
+from typing import Final
+from typing_extensions import Self, TypeAlias
+
+from .fixer_base import BaseFix
+from .pgen2.grammar import Grammar
+
+_NL: TypeAlias = Node | Leaf
+_Context: TypeAlias = tuple[str, int, int]
+_Results: TypeAlias = dict[str, _NL]
+_RawNode: TypeAlias = tuple[int, str, _Context, list[_NL] | None]
+
+HUGE: Final = 0x7FFFFFFF
+
+def type_repr(type_num: int) -> str | int: ...
+
+class Base:
+    type: int
+    parent: Node | None
+    prefix: str
+    children: list[_NL]
+    was_changed: bool
+    was_checked: bool
+    def __eq__(self, other: object) -> bool: ...
+    @abstractmethod
+    def _eq(self, other: Base) -> bool: ...
+    @abstractmethod
+    def clone(self) -> Self: ...
+    @abstractmethod
+    def post_order(self) -> Iterator[Self]: ...
+    @abstractmethod
+    def pre_order(self) -> Iterator[Self]: ...
+    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: MutableSequence[BaseFix] | None
+    # Is Unbound until set in refactor.RefactoringTool
+    future_features: frozenset[Incomplete]
+    # Is Unbound until set in pgen2.parse.Parser.pop
+    used_names: set[str]
+    def __init__(
+        self,
+        type: int,
+        children: Iterable[_NL],
+        context: Unused = None,
+        prefix: str | None = None,
+        fixers_applied: MutableSequence[BaseFix] | None = None,
+    ) -> None: ...
+    def _eq(self, other: Base) -> bool: ...
+    def clone(self) -> Node: ...
+    def post_order(self) -> Iterator[Self]: ...
+    def pre_order(self) -> Iterator[Self]: ...
+    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: ...
+    def __unicode__(self) -> str: ...
+
+class Leaf(Base):
+    lineno: int
+    column: int
+    value: str
+    fixers_applied: MutableSequence[BaseFix]
+    def __init__(
+        self,
+        type: int,
+        value: str,
+        context: _Context | None = None,
+        prefix: str | None = None,
+        fixers_applied: MutableSequence[BaseFix] = [],
+    ) -> None: ...
+    def _eq(self, other: Base) -> bool: ...
+    def clone(self) -> Leaf: ...
+    def post_order(self) -> Iterator[Self]: ...
+    def pre_order(self) -> Iterator[Self]: ...
+    def __unicode__(self) -> str: ...
+
+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 = None) -> bool: ...
+    def match_seq(self, nodes: SupportsLenAndGetItem[_NL], results: _Results | None = None) -> bool: ...
+    def generate_matches(self, nodes: SupportsGetItem[int, _NL]) -> Iterator[tuple[int, _Results]]: ...
+
+class LeafPattern(BasePattern):
+    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 = None, content: str | None = None, name: str | None = None) -> None: ...
+
+class WildcardPattern(BasePattern):
+    min: int
+    max: int
+    def __init__(self, content: str | None = None, min: int = 0, max: int = 0x7FFFFFFF, name: str | None = None) -> None: ...
+
+class NegatedPattern(BasePattern):
+    def __init__(self, content: str | None = None) -> None: ...
+
+def generate_matches(
+    patterns: SupportsGetItem[int | slice, BasePattern] | None, nodes: SupportsGetItem[int | slice, _NL]
+) -> Iterator[tuple[int, _Results]]: ...