mirror of
https://github.com/davidhalter/typeshed.git
synced 2025-12-07 04:34:28 +08:00
1dd1b701c9
And use it everywhere. Note there seemed to be a discrepancy between heapq in Python 2 and 3, so I changed that. It should probably be more widely used within heapq, but leaving that out of scope for this PR. Co-authored-by: hauntsaninja <>
15 lines
798 B
Python
15 lines
798 B
Python
from _typeshed import SupportsLessThan
|
|
from typing import Any, Callable, Iterable, List, Optional, TypeVar
|
|
|
|
_T = TypeVar("_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(__heap: List[_T]) -> None: ...
|
|
def heapreplace(__heap: List[_T], __item: _T) -> _T: ...
|
|
def merge(*iterables: Iterable[_T], key: Optional[Callable[[_T], Any]] = ..., reverse: bool = ...) -> Iterable[_T]: ...
|
|
def nlargest(n: int, iterable: Iterable[_T], key: Optional[Callable[[_T], SupportsLessThan]] = ...) -> List[_T]: ...
|
|
def nsmallest(n: int, iterable: Iterable[_T], key: Optional[Callable[[_T], SupportsLessThan]] = ...) -> List[_T]: ...
|
|
def _heapify_max(__x: List[_T]) -> None: ... # undocumented
|