mirror of
https://git.launchpad.net/~ubuntu-release/britney/+git/britney2-ubuntu
synced 2025-02-13 23:38:20 +00:00
do_all(): Only sort_actions after recurse runs
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:
parent
822d847c11
commit
bae9338a74
@ -2316,7 +2316,7 @@ class Britney(object):
|
||||
lundo = None
|
||||
nuninst_end = None
|
||||
better = True
|
||||
extra = () # empty tuple
|
||||
extra = []
|
||||
|
||||
if hinttype == "easy" or hinttype == "force-hint":
|
||||
force = hinttype == "force-hint"
|
||||
@ -2395,10 +2395,10 @@ class Britney(object):
|
||||
self.all_selected += selected
|
||||
if not actions:
|
||||
if recurse:
|
||||
self.upgrade_me = sorted(extra)
|
||||
self.upgrade_me = extra
|
||||
self.sort_actions()
|
||||
else:
|
||||
self.upgrade_me = [x for x in self.upgrade_me if x not in set(selected)]
|
||||
self.sort_actions()
|
||||
else:
|
||||
self.output_write("FAILED\n")
|
||||
if not lundo: return
|
||||
|
Loading…
x
Reference in New Issue
Block a user