On Tuesday 27 March 2007, Matt Good wrote: > > I just removed a few uses of the heapq module and wanted to post a few > comments about it. See: > http://trac.edgewall.org/changeset/5148 > > In the timeline heapq was used to sort the events. Based on these > benchmarks using heapq is much slower than the Python sort(), > especially in Python 2.3: > http://mail.python.org/pipermail/python-list/2005-January/304291.html > > So "maxrows" would have to be very small compared to the full list > size for heapq to be faster than sort().
Cool. Question: Does this correctly handle the ordering of changesets that are committed within the same second? Eli --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Trac Development" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/trac-dev?hl=en -~----------~----~----~----~------~----~------~--~---
