Sort implicits with a proper comparison function #12562
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Before this commit, we sorted implicits using
prefer
which relied oncompareOwner
, but compareOwner does not induce a total ordering: justbecause
compareOwner(x, y) == 0
does not mean thatcompareOwner(x, z)
andcompareOwner(y, z)
have the same sign, this violates thecontract of
java.util.Comparator#compare
and lead to anIllegalArgumentException sometimes being thrown (although I wasn't able
to reproduce that, see #12479)
This commit fixes by this by replacing the usage of
compareOwner
by anew
compareBaseClassesLength
which does induce a total ordering whilestill hopefully approximating
compareOwner
well enough for ourpurposes.
We also replace
prefer
which returned a Boolean bycompareEligibles
which is directly usable as an Ordering we can pass to
sorted
, this ismore efficient than using
sortWith(prefer)
because the latter might endup calling
prefer
twice for a single comparison.Fixes #12479 (I hope).