Closed luciansmith closed 3 years ago
When given a long enough list, sortOrderedObjects notices that the comparator can claim that a<b and b<a, and fails. What it should do is claim !(a<b) and !(b<a) instead, when b and a are equivalent (i.e. return false instead of true when equal).
When given a long enough list, sortOrderedObjects notices that the comparator can claim that a<b and b<a, and fails. What it should do is claim !(a<b) and !(b<a) instead, when b and a are equivalent (i.e. return false instead of true when equal).