heapq: re-export, add __about__ (#7308)

Author: hauntsaninja

pyproject.toml

@@ -18,6 +18,7 @@ extra_standard_library = [
     "_compression",
     "_csv",
     "_curses",
+    "_heapq",
     "_markupbase",
     "_random",
     "_tkinter",

stdlib/_heapq.pyi

@@ -2,6 +2,8 @@ from typing import Any, TypeVar
 
 _T = TypeVar("_T")
 
+__about__: str
+
 def heapify(__heap: list[Any]) -> None: ...
 def heappop(__heap: list[_T]) -> _T: ...
 def heappush(__heap: list[_T], __item: _T) -> None: ...

stdlib/heapq.pyi

@@ -1,14 +1,12 @@
+from _heapq import *
 from _typeshed import SupportsRichComparison
 from typing import Any, Callable, Iterable, TypeVar
 
-_T = TypeVar("_T")
+_S = TypeVar("_S")
 
-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[Any]) -> None: ...
-def heapreplace(__heap: list[_T], __item: _T) -> _T: ...
-def merge(*iterables: Iterable[_T], key: Callable[[_T], Any] | None = ..., reverse: bool = ...) -> Iterable[_T]: ...
-def nlargest(n: int, iterable: Iterable[_T], key: Callable[[_T], SupportsRichComparison] | None = ...) -> list[_T]: ...
-def nsmallest(n: int, iterable: Iterable[_T], key: Callable[[_T], SupportsRichComparison] | None = ...) -> list[_T]: ...
+__about__: str
+
+def merge(*iterables: Iterable[_S], key: Callable[[_S], Any] | None = ..., reverse: bool = ...) -> Iterable[_S]: ...
+def nlargest(n: int, iterable: Iterable[_S], key: Callable[[_S], SupportsRichComparison] | None = ...) -> list[_S]: ...
+def nsmallest(n: int, iterable: Iterable[_S], key: Callable[[_S], SupportsRichComparison] | None = ...) -> list[_S]: ...
 def _heapify_max(__x: list[Any]) -> None: ...  # undocumented