VimPlug/typeshed
1
0
Fork 0
mirror of https://github.com/davidhalter/typeshed.git synced 2025-12-09 05:24:52 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Use PEP 585 syntax in Python 2, protobuf & _ast stubs, where possible (#6949)

Browse Source
This commit is contained in:
Alex Waygood
2022-01-18 15:14:03 +00:00
committed by GitHub
parent aa885ecd65
commit 8af5e0d340
264 changed files with 2217 additions and 2411 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
stdlib/@python2/heapq.pyi
View File

@@ -1,15 +1,15 @@
from _typeshed import SupportsLessThan
from typing import Callable, Iterable, List, TypeVar
from typing import Callable, Iterable, TypeVar
_T = TypeVar("_T")
def cmp_lt(x, y) -> bool: ...
def heappush(heap: List[_T], item: _T) -> None: ...
def heappop(heap: List[_T]) -> _T: ...
def heappushpop(heap: List[_T], item: _T) -> _T: ...
def heapify(x: List[_T]) -> None: ...
def heapreplace(heap: List[_T], item: _T) -> _T: ...
def heappush(heap: list[_T], item: _T) -> None: ...
def heappop(heap: list[_T]) -> _T: ...
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: Callable[[_T], SupportsLessThan] | None = ...) -> List[_T]: ...
def nsmallest(n: int, iterable: Iterable[_T], key: Callable[[_T], SupportsLessThan] | None = ...) -> List[_T]: ...
def _heapify_max(__x: List[_T]) -> None: ... # undocumented
def nlargest(n: int, iterable: Iterable[_T], key: Callable[[_T], SupportsLessThan] | None = ...) -> list[_T]: ...
def nsmallest(n: int, iterable: Iterable[_T], key: Callable[[_T], SupportsLessThan] | None = ...) -> list[_T]: ...
def _heapify_max(__x: list[_T]) -> None: ... # undocumented