diff options
author | Zac Medico <zmedico@gentoo.org> | 2007-07-30 06:31:54 +0000 |
---|---|---|
committer | Zac Medico <zmedico@gentoo.org> | 2007-07-30 06:31:54 +0000 |
commit | c3df1ddc0925b43e62a2bec6ed848788897a977f (patch) | |
tree | bbb3246647d78c12864daa9c4accfcb489a9534c /bin/emerge | |
parent | c35dff88e8919d3c6c7d1e3f041da16afaf5e218 (diff) | |
download | portage-c3df1ddc0925b43e62a2bec6ed848788897a977f.tar.gz portage-c3df1ddc0925b43e62a2bec6ed848788897a977f.tar.bz2 portage-c3df1ddc0925b43e62a2bec6ed848788897a977f.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. This also fixes the display algorithm so it doesn't falsely detect duplicate edges as much. (branches/2.1.2 r7068)
svn path=/main/branches/2.1.2.9/; revision=7497
Diffstat (limited to 'bin/emerge')
-rwxr-xr-x | bin/emerge | 3 |
1 files changed, 3 insertions, 0 deletions
diff --git a/bin/emerge b/bin/emerge index 02ee3ea25..201c44db6 100755 --- a/bin/emerge +++ b/bin/emerge @@ -2008,6 +2008,9 @@ class depgraph: 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=[] |