From c3df1ddc0925b43e62a2bec6ed848788897a977f Mon Sep 17 00:00:00 2001 From: Zac Medico Date: Mon, 30 Jul 2007 06:31:54 +0000 Subject: 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 --- bin/emerge | 3 +++ 1 file changed, 3 insertions(+) (limited to 'bin/emerge') 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=[] -- cgit v1.2.3-1-g7c22