Mercurial > public > mercurial-scm > hg-stable
comparison mercurial/revset.py @ 26091:60bbd4f9abd1
reachableroots: sort the smartset in the pure version too
Changeset be8a4e0800d8 uses smartset lazy sorting for the C version. We need to
apply the same to the pure version for consistency. This is fixing the tests
with --pure.
author | Pierre-Yves David <pierre-yves.david@fb.com> |
---|---|
date | Mon, 24 Aug 2015 15:40:42 -0700 |
parents | 4ee2af2194d4 |
children | 204131131766 |
comparison
equal
deleted
inserted
replaced
26090:e5f2a2a095cb | 26091:60bbd4f9abd1 |
---|---|
121 return reachable | 121 return reachable |
122 for rev in sorted(seen): | 122 for rev in sorted(seen): |
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>)) |
130 | 132 |
131 If includepath is True, return (<roots>::<heads>).""" | 133 If includepath is True, return (<roots>::<heads>).""" |