|
| 1 | +from _heapq import * |
1 | 2 | from _typeshed import SupportsRichComparison
|
2 | 3 | from typing import Any, Callable, Iterable, TypeVar
|
3 | 4 |
|
4 |
| -_T = TypeVar("_T") |
| 5 | +_S = TypeVar("_S") |
5 | 6 |
|
6 |
| -def heappush(__heap: list[_T], __item: _T) -> None: ... |
7 |
| -def heappop(__heap: list[_T]) -> _T: ... |
8 |
| -def heappushpop(__heap: list[_T], __item: _T) -> _T: ... |
9 |
| -def heapify(__heap: list[Any]) -> None: ... |
10 |
| -def heapreplace(__heap: list[_T], __item: _T) -> _T: ... |
11 |
| -def merge(*iterables: Iterable[_T], key: Callable[[_T], Any] | None = ..., reverse: bool = ...) -> Iterable[_T]: ... |
12 |
| -def nlargest(n: int, iterable: Iterable[_T], key: Callable[[_T], SupportsRichComparison] | None = ...) -> list[_T]: ... |
13 |
| -def nsmallest(n: int, iterable: Iterable[_T], key: Callable[[_T], SupportsRichComparison] | None = ...) -> list[_T]: ... |
| 7 | +__about__: str |
| 8 | + |
| 9 | +def merge(*iterables: Iterable[_S], key: Callable[[_S], Any] | None = ..., reverse: bool = ...) -> Iterable[_S]: ... |
| 10 | +def nlargest(n: int, iterable: Iterable[_S], key: Callable[[_S], SupportsRichComparison] | None = ...) -> list[_S]: ... |
| 11 | +def nsmallest(n: int, iterable: Iterable[_S], key: Callable[[_S], SupportsRichComparison] | None = ...) -> list[_S]: ... |
14 | 12 | def _heapify_max(__x: list[Any]) -> None: ... # undocumented
|
0 commit comments