VimPlug/typeshed
1
0
Fork 0
mirror of https://github.com/davidhalter/typeshed.git synced 2026-08-08 00:48:28 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

add rich comparison bound to heapq and priorityqueues using heapq (#14419)

Browse Source
This commit is contained in:
Michael H
2025-07-15 19:36:28 -07:00
committed by GitHub
parent 84e41f2853
commit d73534badf
3 changed files with 9 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
stdlib/_heapq.pyi
+4 -5
View File
@@ -1,18 +1,17 @@
import sys
from typing import Any, Final, TypeVar
_T = TypeVar("_T") # list items must be comparable
from _typeshed import SupportsRichComparisonT as _T # All type variable use in this module requires comparability.
from typing import Final
__about__: Final[str]
def heapify(heap: list[Any], /) -> None: ... # list items must be comparable
def heapify(heap: list[_T], /) -> None: ...
def heappop(heap: list[_T], /) -> _T: ...
def heappush(heap: list[_T], item: _T, /) -> None: ...
def heappushpop(heap: list[_T], item: _T, /) -> _T: ...
def heapreplace(heap: list[_T], item: _T, /) -> _T: ...
if sys.version_info >= (3, 14):
def heapify_max(heap: list[Any], /) -> None: ... # list items must be comparable
def heapify_max(heap: list[_T], /) -> None: ...
def heappop_max(heap: list[_T], /) -> _T: ...
def heappush_max(heap: list[_T], item: _T, /) -> None: ...
def heappushpop_max(heap: list[_T], item: _T, /) -> _T: ...