Message 395624 - Python tracker

➜

This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author	serhiy.storchaka
Recipients	Dennis Sweeney, joel.larose, mark.dickinson, rhettinger, serhiy.storchaka, steven.daprano
Date	2021-06-11.09:10:18
SpamBayes Score	-1.0
Marked as misclassified	Yes
Message-id	<1623402618.59.0.0579353124009.issue44370@roundup.psfhosted.org>
In-reply-to

Content
Maybe add two key functions for making NaN either the smallest or the largest number? min(1, NAN, key=nan_is_smallest) -> NAN max(1, NAN, key=nan_is_smallest) -> 1 sorted([1, NAN, 2], key=nan_is_smallest) -> [NAN, 1, 2] min(1, NAN, key=nan_is_largest) -> 1 max(1, NAN, key=nan_is_largest) -> NAN sorted([1, NAN, 2], key=nan_is_largest) -> [1, 2, NAN]

Maybe add two key functions for making NaN either the smallest or the largest number?

min(1, NAN, key=nan_is_smallest) -> NAN
max(1, NAN, key=nan_is_smallest) -> 1
sorted([1, NAN, 2], key=nan_is_smallest) -> [NAN, 1, 2]
min(1, NAN, key=nan_is_largest) -> 1
max(1, NAN, key=nan_is_largest) -> NAN
sorted([1, NAN, 2], key=nan_is_largest) -> [1, 2, NAN]

History
Date	User	Action	Args
2021-06-11 09:10:18	serhiy.storchaka	set	recipients: + serhiy.storchaka, rhettinger, mark.dickinson, steven.daprano, Dennis Sweeney, joel.larose
2021-06-11 09:10:18	serhiy.storchaka	set	messageid: <1623402618.59.0.0579353124009.issue44370@roundup.psfhosted.org>
2021-06-11 09:10:18	serhiy.storchaka	link	issue44370 messages
2021-06-11 09:10:18	serhiy.storchaka	create