3 # Based on http://docs.python.org/3.2/library/heapq.html
\r
6 from typing import TypeVar, List, Iterable, Any, Callable, Optional
\r
10 def heappush(heap: List[_T], item: _T) -> None: ...
\r
11 def heappop(heap: List[_T]) -> _T: ...
\r
12 def heappushpop(heap: List[_T], item: _T) -> _T: ...
\r
13 def heapify(x: List[_T]) -> None: ...
\r
14 def heapreplace(heap: List[_T], item: _T) -> _T: ...
\r
15 if sys.version_info >= (3, 5):
\r
16 def merge(*iterables: Iterable[_T], key: Callable[[_T], Any] = ...,
\r
17 reverse: bool = ...) -> Iterable[_T]: ...
\r
19 def merge(*iterables: Iterable[_T]) -> Iterable[_T]: ...
\r
20 def nlargest(n: int, iterable: Iterable[_T],
\r
21 key: Optional[Callable[[_T], Any]] = ...) -> List[_T]: ...
\r
22 def nsmallest(n: int, iterable: Iterable[_T],
\r
23 key: Callable[[_T], Any] = ...) -> List[_T]: ...
\r