Lubuntu/britney2-ubuntu
8
0
Fork 0
mirror of https://git.launchpad.net/~ubuntu-release/britney/+git/britney2-ubuntu synced 2025-05-28 19:01:35 +00:00
Code Issues Packages Projects Releases Wiki Activity

do_all(): Only sort_actions after recurse runs

Browse Source 
sort_actions() can be quite expensive and it is wasteful to resort
actions after each successful "easy"-hint.

Signed-off-by: Niels Thykier <niels@thykier.net>
This commit is contained in:
Niels Thykier 2014-08-05 22:44:14 +02:00
parent 822d847c11
commit bae9338a74
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
britney.py
View File

@ -2316,7 +2316,7 @@ class Britney(object):
lundo = None lundo = None
nuninst_end = None nuninst_end = None
better = True better = True
extra = () # empty tuple extra = []
if hinttype == "easy" or hinttype == "force-hint": if hinttype == "easy" or hinttype == "force-hint":
force = hinttype == "force-hint" force = hinttype == "force-hint"
@ -2395,10 +2395,10 @@ class Britney(object):
self.all_selected += selected self.all_selected += selected
if not actions: if not actions:
if recurse: if recurse:
self.upgrade_me = sorted(extra) self.upgrade_me = extra
self.sort_actions()
else: else:
self.upgrade_me = [x for x in self.upgrade_me if x not in set(selected)] self.upgrade_me = [x for x in self.upgrade_me if x not in set(selected)]
self.sort_actions()
else: else:
self.output_write("FAILED\n") self.output_write("FAILED\n")
if not lundo: return if not lundo: return