diff options
| author | shadchin <[email protected]> | 2022-02-10 16:44:39 +0300 |
|---|---|---|
| committer | Daniil Cherednik <[email protected]> | 2022-02-10 16:44:39 +0300 |
| commit | e9656aae26e0358d5378e5b63dcac5c8dbe0e4d0 (patch) | |
| tree | 64175d5cadab313b3e7039ebaa06c5bc3295e274 /contrib/tools/python3/src/Lib/heapq.py | |
| parent | 2598ef1d0aee359b4b6d5fdd1758916d5907d04f (diff) | |
Restoring authorship annotation for <[email protected]>. Commit 2 of 2.
Diffstat (limited to 'contrib/tools/python3/src/Lib/heapq.py')
| -rw-r--r-- | contrib/tools/python3/src/Lib/heapq.py | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/contrib/tools/python3/src/Lib/heapq.py b/contrib/tools/python3/src/Lib/heapq.py index 535cabfa1f0..fabefd87f8b 100644 --- a/contrib/tools/python3/src/Lib/heapq.py +++ b/contrib/tools/python3/src/Lib/heapq.py @@ -468,7 +468,7 @@ def nsmallest(n, iterable, key=None): if n == 1: it = iter(iterable) sentinel = object() - result = min(it, default=sentinel, key=key) + result = min(it, default=sentinel, key=key) return [] if result is sentinel else [result] # When n>=size, it's faster to use sorted() @@ -528,7 +528,7 @@ def nlargest(n, iterable, key=None): if n == 1: it = iter(iterable) sentinel = object() - result = max(it, default=sentinel, key=key) + result = max(it, default=sentinel, key=key) return [] if result is sentinel else [result] # When n>=size, it's faster to use sorted() @@ -597,5 +597,5 @@ except ImportError: if __name__ == "__main__": - import doctest # pragma: no cover - print(doctest.testmod()) # pragma: no cover + import doctest # pragma: no cover + print(doctest.testmod()) # pragma: no cover |