https://gcc.gnu.org/bugzilla/show_bug.cgi?id=122767
--- Comment #6 from Alexandre Oliva <aoliva at gcc dot gnu.org> --- Created attachment 62869 --> https://gcc.gnu.org/bugzilla/attachment.cgi?id=62869&action=edit alternate approach that sacrifices memory for stability Here's another alternative to solve the problem, that arises only because of sorting using a compare function that uses hashes as tie breakers. It sacrifices some memory for faster compares.
