diff options
| author | Zac Medico <zmedico@gentoo.org> | 2007-03-03 23:05:27 +0000 |
|---|---|---|
| committer | Zac Medico <zmedico@gentoo.org> | 2007-03-03 23:05:27 +0000 |
| commit | adaa3f2f593de12b3221ccdbc0c8066dce21d76c (patch) | |
| tree | b73c825ff47b682cb162fb8d73b8f8bbd5e319af | |
| parent | d042ce847d7fef4fa45030cf16f1a09c736578ef (diff) | |
| download | portage-adaa3f2f593de12b3221ccdbc0c8066dce21d76c.tar.gz portage-adaa3f2f593de12b3221ccdbc0c8066dce21d76c.tar.bz2 portage-adaa3f2f593de12b3221ccdbc0c8066dce21d76c.zip | |
Only prune duplicate consecutive nodes if they both have depth == 0.
svn path=/main/trunk/; revision=6158
| -rw-r--r-- | pym/emerge/__init__.py | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/pym/emerge/__init__.py b/pym/emerge/__init__.py index e6b542835..4078d9e29 100644 --- 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] |