VimPlug/typeshed
1
0
Fork 0
mirror of https://github.com/davidhalter/typeshed.git synced 2025-12-07 20:54:28 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Make inplace sorting require mutable sequences in bisect module (#3199)

Browse Source
This commit is contained in:
plokmijnuhby
2019-08-24 17:06:38 +01:00
committed by Jelle Zijlstra
parent 03b38d4d2e
commit 282405696e
2 changed files with 11 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
stdlib/2and3/_bisect.pyi
View File

@@ -1,11 +1,11 @@
"""Stub file for the '_bisect' module."""
from typing import Sequence, TypeVar
from typing import Sequence, MutableSequence, TypeVar
_T = TypeVar('_T')
def bisect(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
def bisect_left(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
def bisect_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
def insort(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
def insort_left(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
def insort_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
def insort(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
def insort_left(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...
def insort_right(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> None: ...

14
stdlib/2and3/bisect.pyi
View File

@@ -1,6 +1,6 @@
# Stubs for bisect
from typing import Any, Sequence, TypeVar
from typing import Any, Sequence, MutableSequence, TypeVar
_T = TypeVar('_T')
@@ -9,14 +9,14 @@ _T = TypeVar('_T')
# def bisect_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
# def bisect(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
#
# def insort_left(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
# def insort_right(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
# def insort(a: Sequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
# def insort_left(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
# def insort_right(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
# def insort(a: MutableSequence[_T], x: _T, lo: int = ..., hi: int = ...) -> int: ...
def bisect_left(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
def bisect_right(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
def bisect(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
def insort_left(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
def insort_right(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
def insort(a: Sequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
def insort_left(a: MutableSequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
def insort_right(a: MutableSequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...
def insort(a: MutableSequence, x: Any, lo: int = ..., hi: int = ...) -> int: ...