summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorZac Medico <zmedico@gentoo.org>2017-08-20 14:30:22 -0700
committerZac Medico <zmedico@gentoo.org>2017-08-21 08:58:42 -0700
commit6098513ec399bd6949d6ae852be9ee83dcb24a2f (patch)
tree6d27f59dc34e03fa4342caaa6089e11dd660a800
parentUpdates for portage-2.3.8 release (diff)
downloadportage-6098513ec399bd6949d6ae852be9ee83dcb24a2f.tar.gz
portage-6098513ec399bd6949d6ae852be9ee83dcb24a2f.tar.bz2
portage-6098513ec399bd6949d6ae852be9ee83dcb24a2f.zip
digraph.add: sort priorities with bisect.insort
Reported-by: Sergei Trofimovich <slyfox@gentoo.org> Reviewed-by: Manuel Rüger <mrueg@gentoo.org>
-rw-r--r--pym/portage/util/digraph.py4
1 files changed, 2 insertions, 2 deletions
diff --git a/pym/portage/util/digraph.py b/pym/portage/util/digraph.py
index ba0e81c07..bf20d5d4e 100644
--- a/pym/portage/util/digraph.py
+++ b/pym/portage/util/digraph.py
@@ -5,6 +5,7 @@ from __future__ import unicode_literals
__all__ = ['digraph']
+import bisect
from collections import deque
import sys
@@ -46,8 +47,7 @@ class digraph(object):
self.nodes[parent][0][node] = priorities
if not priorities or priorities[-1] is not priority:
- priorities.append(priority)
- priorities.sort()
+ bisect.insort(priorities, priority)
def discard(self, node):
"""