VimPlug/typeshed
1
0
Fork 0
mirror of https://github.com/davidhalter/typeshed.git synced 2026-02-20 16:48:27 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

apply black and isort (#4287)

Browse Source 
* apply black and isort

* move some type ignores
This commit is contained in:
Jelle Zijlstra
2020-06-28 13:31:00 -07:00
committed by GitHub
parent fe58699ca5
commit 5d553c9584
800 changed files with 13875 additions and 10332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
stdlib/2/heapq.pyi
View File

@@ -1,6 +1,6 @@
from typing import TypeVar, List, Iterable, Any, Callable, Optional, Protocol
from typing import Any, Callable, Iterable, List, Optional, Protocol, TypeVar
_T = TypeVar('_T')
_T = TypeVar("_T")
class _Sortable(Protocol):
def __lt__(self: _T, other: _T) -> bool: ...
@@ -12,7 +12,5 @@ def heappushpop(heap: List[_T], item: _T) -> _T: ...
def heapify(x: List[_T]) -> None: ...
def heapreplace(heap: List[_T], item: _T) -> _T: ...
def merge(*iterables: Iterable[_T]) -> Iterable[_T]: ...
def nlargest(n: int, iterable: Iterable[_T],
key: Optional[Callable[[_T], _Sortable]] = ...) -> List[_T]: ...
def nsmallest(n: int, iterable: Iterable[_T],
key: Optional[Callable[[_T], _Sortable]] = ...) -> List[_T]: ...
def nlargest(n: int, iterable: Iterable[_T], key: Optional[Callable[[_T], _Sortable]] = ...) -> List[_T]: ...
def nsmallest(n: int, iterable: Iterable[_T], key: Optional[Callable[[_T], _Sortable]] = ...) -> List[_T]: ...