##// END OF EJS Templates
reachableroots: sort the smartset in the pure version too...
Pierre-Yves David -
r26091:60bbd4f9 default
parent child Browse files
Show More
@@ -123,7 +123,9 def reachablerootspure(repo, minroot, ro
123 for parent in seen[rev]:
123 for parent in seen[rev]:
124 if parent in reachable:
124 if parent in reachable:
125 reached(rev)
125 reached(rev)
126 return baseset(sorted(reachable))
126 reachable = baseset(reachable)
127 reachable.sort()
128 return reachable
127
129
128 def reachableroots(repo, roots, heads, includepath=False):
130 def reachableroots(repo, roots, heads, includepath=False):
129 """return (heads(::<roots> and ::<heads>))
131 """return (heads(::<roots> and ::<heads>))
General Comments 0
You need to be logged in to leave comments. Login now