Show More
@@ -261,7 +261,7 b' def findoptimizations(repo):' | |||||
261 |
|
261 | |||
262 | return optimizations |
|
262 | return optimizations | |
263 |
|
263 | |||
264 |
def determineactions(repo, |
|
264 | def determineactions(repo, deficiencies, sourcereqs, destreqs): | |
265 | """Determine upgrade actions that will be performed. |
|
265 | """Determine upgrade actions that will be performed. | |
266 |
|
266 | |||
267 | Given a list of improvements as returned by ``finddeficiencies`` and |
|
267 | Given a list of improvements as returned by ``finddeficiencies`` and | |
@@ -278,16 +278,15 b' def determineactions(repo, improvements,' | |||||
278 |
|
278 | |||
279 | knownreqs = supporteddestrequirements(repo) |
|
279 | knownreqs = supporteddestrequirements(repo) | |
280 |
|
280 | |||
281 |
for |
|
281 | for d in deficiencies: | |
282 |
name = |
|
282 | name = d.name | |
283 |
|
283 | |||
284 | # If the action is a requirement that doesn't show up in the |
|
284 | # If the action is a requirement that doesn't show up in the | |
285 | # destination requirements, prune the action. |
|
285 | # destination requirements, prune the action. | |
286 | if name in knownreqs and name not in destreqs: |
|
286 | if name in knownreqs and name not in destreqs: | |
287 | continue |
|
287 | continue | |
288 |
|
288 | |||
289 | if i.type == deficiency: |
|
289 | newactions.append(name) | |
290 | newactions.append(name) |
|
|||
291 |
|
290 | |||
292 | # FUTURE consider adding some optimizations here for certain transitions. |
|
291 | # FUTURE consider adding some optimizations here for certain transitions. | |
293 | # e.g. adding generaldelta could schedule parent redeltas. |
|
292 | # e.g. adding generaldelta could schedule parent redeltas. |
General Comments 0
You need to be logged in to leave comments.
Login now