Viewing all changes in revision 4641.5.7.
- Committer: John Arbash Meinel
- Date: 2009-08-25 20:21:10 UTC
- mto: (4634.6.15 2.0)
- mto: This revision was merged to the branch mainline in revision 4667.
- Revision ID: john@arbash-meinel.com-20090825202110-m4bz5n0tjozgjuvo
A few tweaks to the internals, and we are down to:
13ms for bzr.dev's ancestry and 53ms for bzr.dev's text keys.
One of the big wins is to not mutate the list/tuple if it is already sorted.
(270ms to sort everything, 107ms to sort only len >=2, 53ms to sort only >2)
It mostly avoids allocating a new list for 99% of the nodes, since almost
everything is only 2 parents, etc.
13ms for bzr.dev's ancestry and 53ms for bzr.dev's text keys.
One of the big wins is to not mutate the list/tuple if it is already sorted.
(270ms to sort everything, 107ms to sort only len >=2, 53ms to sort only >2)
It mostly avoids allocating a new list for 99% of the nodes, since almost
everything is only 2 parents, etc.
- files modified:
- bzrlib/_known_graph_pyx.pyx
expand all
collapse all
added
removed
