mirror of
https://github.com/davidhalter/typeshed.git
synced 2025-12-06 12:14:27 +08:00
Closes #3926 _heapify_max() existed in Python2 already and hasn't changed in python3 (checked in 3.9)
18 lines
780 B
Python
18 lines
780 B
Python
from typing import Any, Callable, Iterable, List, Optional, Protocol, TypeVar
|
|
|
|
_T = TypeVar("_T")
|
|
|
|
class _Sortable(Protocol):
|
|
def __lt__(self: _T, other: _T) -> bool: ...
|
|
|
|
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 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 _heapify_max(__x: List[_T]) -> None: ... # undocumented
|