Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Improve stubs for the bisect module #13350

Closed
wants to merge 1 commit into from
Closed

Improve stubs for the bisect module #13350

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
75 changes: 56 additions & 19 deletions stdlib/_bisect.pyi
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,84 +1,121 @@
import sys
from _typeshed import SupportsLenAndGetItem, SupportsRichComparisonT
from _typeshed import SupportsDunderLT, SupportsLenAndGetItem
from collections.abc import Callable, MutableSequence
from typing import TypeVar, overload

_T = TypeVar("_T")
_U = TypeVar("_U")

if sys.version_info >= (3, 10):
@overload
def bisect_left(
a: SupportsLenAndGetItem[SupportsRichComparisonT],
x: SupportsRichComparisonT,
# Valid comparison: a[i] < x
a: SupportsLenAndGetItem[SupportsDunderLT[_T]],
x: _T,
lo: int = 0,
hi: int | None = None,
*,
key: None = None,
) -> int: ...
@overload
def bisect_left(
# Valid comparison: key(a[i]) < x
a: SupportsLenAndGetItem[_T],
x: SupportsRichComparisonT,
x: _U,
lo: int = 0,
hi: int | None = None,
*,
key: Callable[[_T], SupportsRichComparisonT],
key: Callable[[_T], SupportsDunderLT[_U]],
) -> int: ...
@overload
def bisect_right(
a: SupportsLenAndGetItem[SupportsRichComparisonT],
x: SupportsRichComparisonT,
# Valid comparison: x < a[i]
a: SupportsLenAndGetItem[_T],
x: SupportsDunderLT[_T],
lo: int = 0,
hi: int | None = None,
*,
key: None = None,
) -> int: ...
@overload
def bisect_right(
# Valid comparison: x < key(a[i])
a: SupportsLenAndGetItem[_T],
x: SupportsRichComparisonT,
x: SupportsDunderLT[_U],
lo: int = 0,
hi: int | None = None,
*,
key: Callable[[_T], SupportsRichComparisonT],
key: Callable[[_T], _U],
) -> int: ...
@overload
def insort_left(
a: MutableSequence[SupportsRichComparisonT],
x: SupportsRichComparisonT,
# Valid comparison: a[i] < x
a: MutableSequence[SupportsDunderLT[_T]],
x: _T,
lo: int = 0,
hi: int | None = None,
*,
key: None = None,
) -> None: ...
@overload
def insort_left(
a: MutableSequence[_T], x: _T, lo: int = 0, hi: int | None = None, *, key: Callable[[_T], SupportsRichComparisonT]
# Valid comparison: key(a[i]) < x
a: MutableSequence[_T],
x: _U,
lo: int = 0,
hi: int | None = None,
*,
key: Callable[[_U], SupportsDunderLT[_T]],
) -> None: ...
@overload
def insort_right(
a: MutableSequence[SupportsRichComparisonT],
x: SupportsRichComparisonT,
# Valid comparison: x < a[i]
a: MutableSequence[_T],
x: SupportsDunderLT[_T],
lo: int = 0,
hi: int | None = None,
*,
key: None = None,
) -> None: ...
@overload
def insort_right(
a: MutableSequence[_T], x: _T, lo: int = 0, hi: int | None = None, *, key: Callable[[_T], SupportsRichComparisonT]
# Valid comparison: x < key(a[i])
a: MutableSequence[_T],
x: SupportsDunderLT[_U],
lo: int = 0,
hi: int | None = None,
*,
key: Callable[[_T], _U],
) -> None: ...

else:
def bisect_left(
a: SupportsLenAndGetItem[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None
# Valid comparison: a[i] < x
a: SupportsLenAndGetItem[SupportsDunderLT[_T]],
x: _T,
lo: int = 0,
hi: int | None = None,
) -> int: ...
def bisect_right(
a: SupportsLenAndGetItem[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None
# Valid comparison: x < a[i]
a: SupportsLenAndGetItem[_T],
x: SupportsDunderLT[_T],
lo: int = 0,
hi: int | None = None,
) -> int: ...
def insort_left(
a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None
# Valid comparison: a[i] < x
a: MutableSequence[SupportsDunderLT[_T]],
x: _T,
lo: int = 0,
hi: int | None = None,
) -> None: ...
def insort_right(
a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None
# Valid comparison: x < a[i]
a: MutableSequence[_T],
x: SupportsDunderLT[_T],
lo: int = 0,
hi: int | None = None,
*,
key: None = None,
) -> None: ...
Loading