A cautionary tale: not all TreeSets are equal, but some are more equal than others.pic.twitter.com/mMC4bVJFwe
-
I'm wondering, does this imply that Ordering should always define a total order? The spec does say that compare(x, y) should return 0 when x == y, and there is a PartialOrdering trait in the library. Should the docs maybe be clearer on this to warn against these subtle bugs?
Yes, I think Ordering should always be total. As for the docs, though, clarity wasn't the problem. I just didn't think I needed to read them when I decided to use a TreeSet...