-
Notifications
You must be signed in to change notification settings - Fork 3
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Update bundled typeshed, prepare release (#82)
- Loading branch information
1 parent
4f707aa
commit 5c623c8
Showing
333 changed files
with
8,669 additions
and
7,087 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,74 +1,84 @@ | ||
import sys | ||
from _typeshed import SupportsRichComparisonT | ||
from collections.abc import Callable, MutableSequence, Sequence | ||
from _typeshed import SupportsLenAndGetItem, SupportsRichComparisonT | ||
from collections.abc import Callable, MutableSequence | ||
from typing import TypeVar, overload | ||
|
||
_T = TypeVar("_T") | ||
|
||
if sys.version_info >= (3, 10): | ||
@overload | ||
def bisect_left( | ||
a: Sequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = ..., hi: int | None = ..., *, key: None = ... | ||
a: SupportsLenAndGetItem[SupportsRichComparisonT], | ||
x: SupportsRichComparisonT, | ||
lo: int = 0, | ||
hi: int | None = None, | ||
*, | ||
key: None = None, | ||
) -> int: ... | ||
@overload | ||
def bisect_left( | ||
a: Sequence[_T], | ||
a: SupportsLenAndGetItem[_T], | ||
x: SupportsRichComparisonT, | ||
lo: int = ..., | ||
hi: int | None = ..., | ||
lo: int = 0, | ||
hi: int | None = None, | ||
*, | ||
key: Callable[[_T], SupportsRichComparisonT] = ..., | ||
key: Callable[[_T], SupportsRichComparisonT], | ||
) -> int: ... | ||
@overload | ||
def bisect_right( | ||
a: Sequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = ..., hi: int | None = ..., *, key: None = ... | ||
a: SupportsLenAndGetItem[SupportsRichComparisonT], | ||
x: SupportsRichComparisonT, | ||
lo: int = 0, | ||
hi: int | None = None, | ||
*, | ||
key: None = None, | ||
) -> int: ... | ||
@overload | ||
def bisect_right( | ||
a: Sequence[_T], | ||
a: SupportsLenAndGetItem[_T], | ||
x: SupportsRichComparisonT, | ||
lo: int = ..., | ||
hi: int | None = ..., | ||
lo: int = 0, | ||
hi: int | None = None, | ||
*, | ||
key: Callable[[_T], SupportsRichComparisonT] = ..., | ||
key: Callable[[_T], SupportsRichComparisonT], | ||
) -> int: ... | ||
@overload | ||
def insort_left( | ||
a: MutableSequence[SupportsRichComparisonT], | ||
x: SupportsRichComparisonT, | ||
lo: int = ..., | ||
hi: int | None = ..., | ||
lo: int = 0, | ||
hi: int | None = None, | ||
*, | ||
key: None = ..., | ||
key: None = None, | ||
) -> None: ... | ||
@overload | ||
def insort_left( | ||
a: MutableSequence[_T], x: _T, lo: int = ..., hi: int | None = ..., *, key: Callable[[_T], SupportsRichComparisonT] = ... | ||
a: MutableSequence[_T], x: _T, lo: int = 0, hi: int | None = None, *, key: Callable[[_T], SupportsRichComparisonT] | ||
) -> None: ... | ||
@overload | ||
def insort_right( | ||
a: MutableSequence[SupportsRichComparisonT], | ||
x: SupportsRichComparisonT, | ||
lo: int = ..., | ||
hi: int | None = ..., | ||
lo: int = 0, | ||
hi: int | None = None, | ||
*, | ||
key: None = ..., | ||
key: None = None, | ||
) -> None: ... | ||
@overload | ||
def insort_right( | ||
a: MutableSequence[_T], x: _T, lo: int = ..., hi: int | None = ..., *, key: Callable[[_T], SupportsRichComparisonT] = ... | ||
a: MutableSequence[_T], x: _T, lo: int = 0, hi: int | None = None, *, key: Callable[[_T], SupportsRichComparisonT] | ||
) -> None: ... | ||
|
||
else: | ||
def bisect_left( | ||
a: Sequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = ..., hi: int | None = ... | ||
a: SupportsLenAndGetItem[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None | ||
) -> int: ... | ||
def bisect_right( | ||
a: Sequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = ..., hi: int | None = ... | ||
a: SupportsLenAndGetItem[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None | ||
) -> int: ... | ||
def insort_left( | ||
a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = ..., hi: int | None = ... | ||
a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None | ||
) -> None: ... | ||
def insort_right( | ||
a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = ..., hi: int | None = ... | ||
a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None | ||
) -> None: ... |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
def getpreferredencoding(do_setlocale: bool = ...) -> str: ... | ||
def getpreferredencoding(do_setlocale: bool = True) -> str: ... |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.