addset: use the base implementation for ascending and descending
authorPierre-Yves David <pierre-yves.david@fb.com>
Fri, 03 Oct 2014 01:37:13 -0500
changeset 22749 672f15ee2a1d
parent 22748 852191f71df1
child 22750 66e2b648deef
addset: use the base implementation for ascending and descending
mercurial/revset.py
--- a/mercurial/revset.py	Fri Oct 03 01:34:25 2014 -0500
+++ b/mercurial/revset.py	Fri Oct 03 01:37:13 2014 -0500
@@ -2586,22 +2586,6 @@
             self._genlist = baseset(self._iterator())
         return self._genlist
 
-    def ascending(self):
-        if self._ascending is None:
-            self.sort()
-            self._ascending = True
-        else:
-            if not self._ascending:
-                self.reverse()
-
-    def descending(self):
-        if self._ascending is None:
-            self.sort(reverse=True)
-            self._ascending = False
-        else:
-            if self._ascending:
-                self.reverse()
-
     def _iterator(self):
         """Iterate over both collections without repeating elements