|
1 | | -import sys |
2 | 1 | from _typeshed import SupportsLenAndGetItem, SupportsRichComparisonT |
3 | 2 | from collections.abc import Callable, MutableSequence |
4 | 3 | from typing import TypeVar, overload |
5 | 4 |
|
6 | 5 | _T = TypeVar("_T") |
7 | 6 |
|
8 | | -if sys.version_info >= (3, 10): |
9 | | - @overload |
10 | | - def bisect_left( |
11 | | - a: SupportsLenAndGetItem[SupportsRichComparisonT], |
12 | | - x: SupportsRichComparisonT, |
13 | | - lo: int = 0, |
14 | | - hi: int | None = None, |
15 | | - *, |
16 | | - key: None = None, |
17 | | - ) -> int: ... |
18 | | - @overload |
19 | | - def bisect_left( |
20 | | - a: SupportsLenAndGetItem[_T], |
21 | | - x: SupportsRichComparisonT, |
22 | | - lo: int = 0, |
23 | | - hi: int | None = None, |
24 | | - *, |
25 | | - key: Callable[[_T], SupportsRichComparisonT], |
26 | | - ) -> int: ... |
27 | | - @overload |
28 | | - def bisect_right( |
29 | | - a: SupportsLenAndGetItem[SupportsRichComparisonT], |
30 | | - x: SupportsRichComparisonT, |
31 | | - lo: int = 0, |
32 | | - hi: int | None = None, |
33 | | - *, |
34 | | - key: None = None, |
35 | | - ) -> int: ... |
36 | | - @overload |
37 | | - def bisect_right( |
38 | | - a: SupportsLenAndGetItem[_T], |
39 | | - x: SupportsRichComparisonT, |
40 | | - lo: int = 0, |
41 | | - hi: int | None = None, |
42 | | - *, |
43 | | - key: Callable[[_T], SupportsRichComparisonT], |
44 | | - ) -> int: ... |
45 | | - @overload |
46 | | - def insort_left( |
47 | | - a: MutableSequence[SupportsRichComparisonT], |
48 | | - x: SupportsRichComparisonT, |
49 | | - lo: int = 0, |
50 | | - hi: int | None = None, |
51 | | - *, |
52 | | - key: None = None, |
53 | | - ) -> None: ... |
54 | | - @overload |
55 | | - def insort_left( |
56 | | - a: MutableSequence[_T], x: _T, lo: int = 0, hi: int | None = None, *, key: Callable[[_T], SupportsRichComparisonT] |
57 | | - ) -> None: ... |
58 | | - @overload |
59 | | - def insort_right( |
60 | | - a: MutableSequence[SupportsRichComparisonT], |
61 | | - x: SupportsRichComparisonT, |
62 | | - lo: int = 0, |
63 | | - hi: int | None = None, |
64 | | - *, |
65 | | - key: None = None, |
66 | | - ) -> None: ... |
67 | | - @overload |
68 | | - def insort_right( |
69 | | - a: MutableSequence[_T], x: _T, lo: int = 0, hi: int | None = None, *, key: Callable[[_T], SupportsRichComparisonT] |
70 | | - ) -> None: ... |
71 | | - |
72 | | -else: |
73 | | - def bisect_left( |
74 | | - a: SupportsLenAndGetItem[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None |
75 | | - ) -> int: ... |
76 | | - def bisect_right( |
77 | | - a: SupportsLenAndGetItem[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None |
78 | | - ) -> int: ... |
79 | | - def insort_left( |
80 | | - a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None |
81 | | - ) -> None: ... |
82 | | - def insort_right( |
83 | | - a: MutableSequence[SupportsRichComparisonT], x: SupportsRichComparisonT, lo: int = 0, hi: int | None = None |
84 | | - ) -> None: ... |
| 7 | +@overload |
| 8 | +def bisect_left( |
| 9 | + a: SupportsLenAndGetItem[SupportsRichComparisonT], |
| 10 | + x: SupportsRichComparisonT, |
| 11 | + lo: int = 0, |
| 12 | + hi: int | None = None, |
| 13 | + *, |
| 14 | + key: None = None, |
| 15 | +) -> int: ... |
| 16 | +@overload |
| 17 | +def bisect_left( |
| 18 | + a: SupportsLenAndGetItem[_T], |
| 19 | + x: SupportsRichComparisonT, |
| 20 | + lo: int = 0, |
| 21 | + hi: int | None = None, |
| 22 | + *, |
| 23 | + key: Callable[[_T], SupportsRichComparisonT], |
| 24 | +) -> int: ... |
| 25 | +@overload |
| 26 | +def bisect_right( |
| 27 | + a: SupportsLenAndGetItem[SupportsRichComparisonT], |
| 28 | + x: SupportsRichComparisonT, |
| 29 | + lo: int = 0, |
| 30 | + hi: int | None = None, |
| 31 | + *, |
| 32 | + key: None = None, |
| 33 | +) -> int: ... |
| 34 | +@overload |
| 35 | +def bisect_right( |
| 36 | + a: SupportsLenAndGetItem[_T], |
| 37 | + x: SupportsRichComparisonT, |
| 38 | + lo: int = 0, |
| 39 | + hi: int | None = None, |
| 40 | + *, |
| 41 | + key: Callable[[_T], SupportsRichComparisonT], |
| 42 | +) -> int: ... |
| 43 | +@overload |
| 44 | +def insort_left( |
| 45 | + a: MutableSequence[SupportsRichComparisonT], |
| 46 | + x: SupportsRichComparisonT, |
| 47 | + lo: int = 0, |
| 48 | + hi: int | None = None, |
| 49 | + *, |
| 50 | + key: None = None, |
| 51 | +) -> None: ... |
| 52 | +@overload |
| 53 | +def insort_left( |
| 54 | + a: MutableSequence[_T], x: _T, lo: int = 0, hi: int | None = None, *, key: Callable[[_T], SupportsRichComparisonT] |
| 55 | +) -> None: ... |
| 56 | +@overload |
| 57 | +def insort_right( |
| 58 | + a: MutableSequence[SupportsRichComparisonT], |
| 59 | + x: SupportsRichComparisonT, |
| 60 | + lo: int = 0, |
| 61 | + hi: int | None = None, |
| 62 | + *, |
| 63 | + key: None = None, |
| 64 | +) -> None: ... |
| 65 | +@overload |
| 66 | +def insort_right( |
| 67 | + a: MutableSequence[_T], x: _T, lo: int = 0, hi: int | None = None, *, key: Callable[[_T], SupportsRichComparisonT] |
| 68 | +) -> None: ... |
0 commit comments