Skip to content

Commit 2824056

Browse files
plokmijnuhbyJelleZijlstra
authored andcommitted
Make inplace sorting require mutable sequences in bisect module (#3199)
1 parent 03b38d4 commit 2824056

2 files changed

Lines changed: 11 additions & 11 deletions

File tree

stdlib/2and3/_bisect.pyi

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,11 @@
11
"""Stub file for the '_bisect' module."""
22

3-
from typing import Sequence, TypeVar
3+
from typing import Sequence, MutableSequence, TypeVar
44

55
_T = TypeVar('_T')
66
def bisect(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
77
def bisect_left(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
88
def bisect_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
9-
def insort(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
10-
def insort_left(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
11-
def insort_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
9+
def insort(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
10+
def insort_left(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
11+
def insort_right(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...

stdlib/2and3/bisect.pyi

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Stubs for bisect
22

3-
from typing import Any, Sequence, TypeVar
3+
from typing import Any, Sequence, MutableSequence, TypeVar
44

55
_T = TypeVar('_T')
66

@@ -9,14 +9,14 @@ _T = TypeVar('_T')
99
# def bisect_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
1010
# def bisect(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
1111
#
12-
# def insort_left(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
13-
# def insort_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
14-
# def insort(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
12+
# def insort_left(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
13+
# def insort_right(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
14+
# def insort(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
1515

1616
def bisect_left(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
1717
def bisect_right(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
1818
def bisect(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
1919

20-
def insort_left(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
21-
def insort_right(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
22-
def insort(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
20+
def insort_left(a: MutableSequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
21+
def insort_right(a: MutableSequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
22+
def insort(a: MutableSequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...

0 commit comments

Comments
 (0)