On Mon, Nov 01, 2010 at 02:37:33PM -0400, Terry Reedy wrote: > On 10/31/2010 10:55 PM, Michael Foord wrote: > >> fact that sets / frozensets can't be sorted in the standard Python way >> (their less than comparison adheres to the set definition). This is >> something that will probably surprise many Python developers: > > Any programmer who sorts (or uses functions that depend on proper > sorting) should know and respect the difference between partial orders, > such as set inclusion, and total orders, such as lex order of sequences. > So I am surprised by the above claim ;-). Huh. Count me out. I guess I don't live up to your standards. --titus p.s. Seriously? I can accept that there's a rational minimalist argument for this "feature", but arguing that it's somehow the responsibility of a programmer to *expect* this seems kind of whack. -- C. Titus Brown, ctb at msu.edu
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4