Only prune duplicate consecutive nodes if they both have depth == 0.

svn path=/main/trunk/; revision=6158

diff --git a/pym/emerge/__init__.py b/pym/emerge/__init__.py
index e6b5428356e65e172ec819b1c9ebf5ee0195279c..4078d9e2910149f038446ad3a1cf04dc467021a3 100644 (file)
--- a/pym/emerge/__init__.py
+++ b/pym/emerge/__init__.py
@@ -2385,7 +2385,8 @@ class depgraph:
                for i in xrange(len(mylist)-1,-1,-1):
                        graph_key, depth, ordered = mylist[i]
                        if not ordered and depth == 0 and i > 1 \
-                               and graph_key == mylist[i-1][0]:
+                               and graph_key == mylist[i-1][0] and \
+                               mylist[i-1][1] == 0:
                                # An ordered node got a consecutive duplicate when the tree was
                                # being filled in.
                                del mylist[i]