File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -305,7 +305,7 @@ async def _min_max(
305305 raise ValueError (f"{ name } () arg is an empty sequence" )
306306 elif key is None :
307307 async for item in item_iter :
308- if invert ^ (item < best ):
308+ if invert ^ bool (item < best ):
309309 best = item
310310 else :
311311 key = _awaitify (key )
Original file line number Diff line number Diff line change @@ -92,7 +92,7 @@ async def pull_head(self) -> bool:
9292 return True
9393
9494 def __lt__ (self , other : _KeyIter [LT ]) -> bool :
95- return self .reverse ^ (self .head_key < other .head_key )
95+ return self .reverse ^ bool (self .head_key < other .head_key )
9696
9797 def __eq__ (self , other : _KeyIter [LT ]) -> bool : # type: ignore[override]
9898 return not (self .head_key < other .head_key or other .head_key < self .head_key )
@@ -161,7 +161,7 @@ def __init__(self, key: LT):
161161 self .key = key
162162
163163 def __lt__ (self , other : ReverseLT [LT ]) -> bool :
164- return other .key < self .key
164+ return bool ( other .key < self .key )
165165
166166
167167# Python's heapq provides a *min*-heap
You can’t perform that action at this time.
0 commit comments