mirror of
https://github.com/davidhalter/typeshed.git
synced 2025-12-08 21:14:48 +08:00
52 lines
1.7 KiB
Python
52 lines
1.7 KiB
Python
import sys
|
|
from _typeshed import SupportsRichComparison, SupportsRichComparisonT
|
|
from typing import Callable, MutableSequence, Sequence, TypeVar, overload
|
|
|
|
_T = TypeVar("_T")
|
|
|
|
if sys.version_info >= (3, 10):
|
|
@overload
|
|
def bisect_left(a: Sequence[_T], x: _T, lo: int = ..., hi: int | None = ..., *, key: None = ...) -> int: ...
|
|
@overload
|
|
def bisect_left(
|
|
a: Sequence[_T],
|
|
x: SupportsRichComparisonT,
|
|
lo: int = ...,
|
|
hi: int | None = ...,
|
|
*,
|
|
key: Callable[[_T], SupportsRichComparisonT] = ...,
|
|
) -> int: ...
|
|
@overload
|
|
def bisect_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int | None = ..., *, key: None = ...) -> int: ...
|
|
@overload
|
|
def bisect_right(
|
|
a: Sequence[_T],
|
|
x: SupportsRichComparisonT,
|
|
lo: int = ...,
|
|
hi: int | None = ...,
|
|
*,
|
|
key: Callable[[_T], SupportsRichComparisonT] = ...,
|
|
) -> int: ...
|
|
def insort_left(
|
|
a: MutableSequence[_T],
|
|
x: _T,
|
|
lo: int = ...,
|
|
hi: int | None = ...,
|
|
*,
|
|
key: Callable[[_T], SupportsRichComparison] | None = ...,
|
|
) -> None: ...
|
|
def insort_right(
|
|
a: MutableSequence[_T],
|
|
x: _T,
|
|
lo: int = ...,
|
|
hi: int | None = ...,
|
|
*,
|
|
key: Callable[[_T], SupportsRichComparison] | None = ...,
|
|
) -> None: ...
|
|
|
|
else:
|
|
def bisect_left(a: Sequence[_T], x: _T, lo: int = ..., hi: int | None = ...) -> int: ...
|
|
def bisect_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int | None = ...) -> int: ...
|
|
def insort_left(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int | None = ...) -> None: ...
|
|
def insort_right(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int | None = ...) -> None: ...
|