diff options
| author | Zac Medico <zmedico@gentoo.org> | 2009-07-21 20:33:11 +0000 |
|---|---|---|
| committer | Zac Medico <zmedico@gentoo.org> | 2009-07-21 20:33:11 +0000 |
| commit | fe6e94590a81975460289b67113bb85c931bd4cf (patch) | |
| tree | 9b22d5ca694d58234da1ef1520ba87cad5a49c53 | |
| parent | 581381acffbedfdc553b9643d47924bf44e32238 (diff) | |
| download | portage-fe6e94590a81975460289b67113bb85c931bd4cf.tar.gz portage-fe6e94590a81975460289b67113bb85c931bd4cf.tar.bz2 portage-fe6e94590a81975460289b67113bb85c931bd4cf.zip | |
Add comment in calc_depclean() about topological sort optimization that
minimizes issues with implicit deps.
svn path=/main/trunk/; revision=13846
| -rw-r--r-- | pym/_emerge/actions.py | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/pym/_emerge/actions.py b/pym/_emerge/actions.py index 2d664ca80..f28f0dcaa 100644 --- a/pym/_emerge/actions.py +++ b/pym/_emerge/actions.py @@ -1142,7 +1142,8 @@ def calc_depclean(settings, trees, ldpath_mtimes, cleanlist = [pkg.cpv for pkg in graph.order] else: # Order nodes from lowest to highest overall reference count for - # optimal root node selection. + # optimal root node selection (this can help minimize issues + # with unaccounted implicit dependencies). node_refcounts = {} for node in graph.order: node_refcounts[node] = len(graph.parent_nodes(node)) |