Viewing all changes in revision 4371.3.35.
- Committer: John Arbash Meinel
- Date: 2009-06-12 04:10:01 UTC
- mto: (4371.4.5 vila-better-heads)
- mto: This revision was merged to the branch mainline in revision 4449.
- Revision ID: john@arbash-meinel.com-20090612041001-qqauzvhsb5z333gz
Changing the heapq algorithm actually ends up with better overall performance.
First, use the same 'replace instead of pop+push' trick.
Second, fix a small issue when gdfo ordering lets us number further than I thought we could.
Clarify some code paths, which even makes it a little bit faster.
(currently at 68.3ms for bzr.dev, 771ms for OOo)
First, use the same 'replace instead of pop+push' trick.
Second, fix a small issue when gdfo ordering lets us number further than I thought we could.
Clarify some code paths, which even makes it a little bit faster.
(currently at 68.3ms for bzr.dev, 771ms for OOo)
- files modified:
- bzrlib/_known_graph_pyx.pyx
expand all
collapse all
added
removed
