|
Lines 1962-1967
Link Here
|
| 1962 |
def altlist(self, reversed=False): |
1962 |
def altlist(self, reversed=False): |
| 1963 |
if reversed in self._altlist_cache: |
1963 |
if reversed in self._altlist_cache: |
| 1964 |
return self._altlist_cache[reversed][:] |
1964 |
return self._altlist_cache[reversed][:] |
|
|
1965 |
if reversed: |
| 1966 |
retlist = self.altlist() |
| 1967 |
retlist.reverse() |
| 1968 |
self._altlist_cache[reversed] = retlist[:] |
| 1969 |
return retlist |
| 1965 |
mygraph=self.digraph.copy() |
1970 |
mygraph=self.digraph.copy() |
| 1966 |
myblockers = self.blocker_digraph.copy() |
1971 |
myblockers = self.blocker_digraph.copy() |
| 1967 |
retlist=[] |
1972 |
retlist=[] |
|
Lines 1979-1984
Link Here
|
| 1979 |
ignore_priority_range = [None] |
1984 |
ignore_priority_range = [None] |
| 1980 |
ignore_priority_range.extend( |
1985 |
ignore_priority_range.extend( |
| 1981 |
xrange(DepPriority.MIN, DepPriority.MEDIUM + 1)) |
1986 |
xrange(DepPriority.MIN, DepPriority.MEDIUM + 1)) |
|
|
1987 |
tree_mode = "--tree" in self.myopts |
| 1982 |
while not mygraph.empty(): |
1988 |
while not mygraph.empty(): |
| 1983 |
ignore_priority = None |
1989 |
ignore_priority = None |
| 1984 |
nodes = None |
1990 |
nodes = None |
|
Lines 2001-2007
Link Here
|
| 2001 |
selected_nodes = None |
2007 |
selected_nodes = None |
| 2002 |
if nodes: |
2008 |
if nodes: |
| 2003 |
if ignore_priority <= DepPriority.SOFT: |
2009 |
if ignore_priority <= DepPriority.SOFT: |
| 2004 |
if ignore_priority is None and not reversed: |
2010 |
if ignore_priority is None and not tree_mode: |
| 2005 |
# Greedily pop all of these nodes since no relationship |
2011 |
# Greedily pop all of these nodes since no relationship |
| 2006 |
# has been ignored. This optimization destroys --tree |
2012 |
# has been ignored. This optimization destroys --tree |
| 2007 |
# output, so it's disabled in reversed mode. |
2013 |
# output, so it's disabled in reversed mode. |
