summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorZac Medico <zmedico@gentoo.org>2007-06-28 01:48:17 +0000
committerZac Medico <zmedico@gentoo.org>2007-06-28 01:48:17 +0000
commitce33c96ed47701fcce759e16b2e95f81f6b70517 (patch)
tree7de4ea765cc72a93a8bf1df679a085d2fdee7c7c
parent4b3390fd0b42eda22d798488c175db1c94be634e (diff)
downloadportage-ce33c96ed47701fcce759e16b2e95f81f6b70517.tar.gz
portage-ce33c96ed47701fcce759e16b2e95f81f6b70517.tar.bz2
portage-ce33c96ed47701fcce759e16b2e95f81f6b70517.zip
Discard "nomerge" nodes to speed up depgraph.altlist() since those nodes aren't used and the --tree algorithm does a good job of regenerating them when appropriate.
svn path=/main/trunk/; revision=7067
-rw-r--r--pym/emerge/__init__.py3
1 files changed, 3 insertions, 0 deletions
diff --git a/pym/emerge/__init__.py b/pym/emerge/__init__.py
index fd6643dea..838d1fbb6 100644
--- a/pym/emerge/__init__.py
+++ b/pym/emerge/__init__.py
@@ -2054,6 +2054,9 @@ class depgraph(object):
self._altlist_cache[reversed] = retlist[:]
return retlist
mygraph=self.digraph.copy()
+ for node in mygraph.order[:]:
+ if node[-1] == "nomerge":
+ mygraph.remove(node)
self._merge_order_bias(mygraph)
myblockers = self.blocker_digraph.copy()
retlist=[]