# HG changeset patch
# User Pierre-Yves David <pierre-yves.david@fb.com>
# Date 2015-08-24 22:40:42
# Node ID 60bbd4f9abd1ea842339d7a77f803d58897916c0
# Parent  e5f2a2a095cb1f623f4439c3e2183a901f7e6571

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.

diff --git a/mercurial/revset.py b/mercurial/revset.py
--- a/mercurial/revset.py
+++ b/mercurial/revset.py
@@ -123,7 +123,9 @@ def reachablerootspure(repo, minroot, ro
         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>))