mirror of
https://github.com/davidhalter/typeshed.git
synced 2025-12-09 21:46:42 +08:00
33a62ae42d
Continuing work towards #8988. The first five commits were created using stubdefaulter on various Python versions; the following commits were all created manually by me to fix various problems. The main things this adds that weren't present in #9501 are: - Defaults in Windows-only modules and Windows-only branches (because I'm running a Windows machine) - Defaults in non-py311 branches - Defaults for float parameters - Defaults for overloads
75 lines
2.4 KiB
Python
75 lines
2.4 KiB
Python
import sys
|
|
from _typeshed import SupportsRichComparisonT
|
|
from collections.abc import Callable, MutableSequence, Sequence
|
|
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 = 0, hi: int | None = None, *, key: None = None
|
|
) -> int: ...
|
|
@overload
|
|
def bisect_left(
|
|
a: Sequence[_T],
|
|
x: SupportsRichComparisonT,
|
|
lo: int = 0,
|
|
hi: int | None = None,
|
|
*,
|
|
key: Callable[[_T], SupportsRichComparisonT] = ...,
|
|
) -> int: ...
|
|
@overload
|
|
def bisect_right(
|
|
a: Sequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None, *, key: None = None
|
|
) -> int: ...
|
|
@overload
|
|
def bisect_right(
|
|
a: Sequence[_T],
|
|
x: SupportsRichComparisonT,
|
|
lo: int = 0,
|
|
hi: int | None = None,
|
|
*,
|
|
key: Callable[[_T], SupportsRichComparisonT] = ...,
|
|
) -> int: ...
|
|
@overload
|
|
def insort_left(
|
|
a: MutableSequence[SupportsRichComparisonT],
|
|
x: SupportsRichComparisonT,
|
|
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] = ...
|
|
) -> None: ...
|
|
@overload
|
|
def insort_right(
|
|
a: MutableSequence[SupportsRichComparisonT],
|
|
x: SupportsRichComparisonT,
|
|
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] = ...
|
|
) -> None: ...
|
|
|
|
else:
|
|
def bisect_left(
|
|
a: Sequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None
|
|
) -> int: ...
|
|
def bisect_right(
|
|
a: Sequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None
|
|
) -> int: ...
|
|
def insort_left(
|
|
a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None
|
|
) -> None: ...
|
|
def insort_right(
|
|
a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None
|
|
) -> None: ...
|