Lubuntu/britney2-ubuntu
8
0
Fork 0
mirror of https://git.launchpad.net/~ubuntu-release/britney/+git/britney2-ubuntu synced 2025-03-12 11:51:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Make the recursive reverse depenedency list building more efficient

Browse Source 
Signed-off-by: Adam D. Barratt <adam@adam-barratt.org.uk>
This commit is contained in:
Adam D. Barratt 2011-03-08 16:01:54 +00:00
parent e2e4559a5b
commit 6d771152ec
1 changed files with 18 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
britney.py
View File

@ -2046,12 +2046,24 @@ class Britney:
# save the old binary for undo # save the old binary for undo
undo['binaries'][p] = binaries[parch][0][binary] undo['binaries'][p] = binaries[parch][0][binary]
# all the reverse dependencies are affected by the change # all the reverse dependencies are affected by the change
for j in binaries[parch][0][binary][RDEPENDS]: # recursively loop through the reverse dependencies
key = (j, parch) rev_deps = set(binaries[parch][0][binary][RDEPENDS])
if key not in affected: affected.append(key) seen = set()
for p in self.get_full_tree(j, parch, 'testing'): while len(rev_deps) > 0:
key = (p, parch) # mark all of the current iteration of packages as affected
if key not in affected: affected.append(key) affected.extend( [ (x, parch) for x in rev_deps ] )
# and as processed
seen |= rev_deps
# generate the next iteration, which is the reverse-dependencies of
# the current iteration
new_rev_deps = [ binaries[parch][0][x][RDEPENDS] for x in rev_deps \
if x in binaries[parch][0] ]
# flatten the list-of-lists, filtering out already handled packages
# in the process
rev_deps = set([ package for sublist in new_rev_deps \
for package in sublist if package not in seen ])
# remove duplicates from the list of affected packages
affected = list(set(affected))
# remove the provided virtual packages # remove the provided virtual packages
for j in binaries[parch][0][binary][PROVIDES]: for j in binaries[parch][0][binary][PROVIDES]:
key = j + "/" + parch key = j + "/" + parch