reachableroots: sort the smartset in the pure version too
authorPierre-Yves David <pierre-yves.david@fb.com>
Mon, 24 Aug 2015 15:40:42 -0700
changeset 26091 60bbd4f9abd1
parent 26090 e5f2a2a095cb
child 26092 014044dbd4e8
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.
mercurial/revset.py
--- a/mercurial/revset.py	Mon Aug 24 23:58:32 2015 -0400
+++ b/mercurial/revset.py	Mon Aug 24 15:40:42 2015 -0700
@@ -123,7 +123,9 @@
         for parent in seen[rev]:
             if parent in reachable:
                 reached(rev)
-    return baseset(sorted(reachable))
+    reachable = baseset(reachable)
+    reachable.sort()
+    return reachable
 
 def reachableroots(repo, roots, heads, includepath=False):
     """return (heads(::<roots> and ::<heads>))