Fix priority logic in digraph.add().
authorZac Medico <zmedico@gentoo.org>
Tue, 3 Oct 2006 00:27:45 +0000 (00:27 -0000)
committerZac Medico <zmedico@gentoo.org>
Tue, 3 Oct 2006 00:27:45 +0000 (00:27 -0000)
svn path=/main/trunk/; revision=4575

pym/portage.py

index 620ef06bd298346003ff2d6970f7b2a2b55eb3d7..73b88a838a50856d69790e46c483e178279eb2f3 100644 (file)
@@ -340,13 +340,13 @@ class digraph:
                        self.order.append(parent)
                
                if parent in self.nodes[node][1]:
-                       if priority > self.SOFT:
+                       if priority > self.nodes[node][1][parent]:
                                self.nodes[node][1][parent] = priority
                else:
                        self.nodes[node][1][parent] = priority
                
                if node in self.nodes[parent][0]:
-                       if priority > self.SOFT:
+                       if priority > self.nodes[parent][0][node]:
                                self.nodes[parent][0][node] = priority
                else:
                        self.nodes[parent][0][node] = priority