In Python 3 you can still sort. But the elements that you are sorting have to be of the same type. So no mixing of lists with strings, integers and tuples anymore. But sorting a list of strings is no problem.
For the given ticket I would not replace the internal representation and just stick to fixing the hash function. Looking for what the best internal representation is, is not something that has nice precut answers and requires a lot of performance testing. If you care about speed I would make the improved internal representation for performance reasons a separate ticket. Things to test would be: 1. Initialisation time of matchings 2. A subset to your liking of the most important high level functions of matchings 3. Some low level access function of matchings 4. All of the above for both small and big matchings. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
