Mercurial > hg-stable

changeset 29002:ea794f2eb19d stable

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
revset: unindent "if True" block in sort() It was there to make the previous patch readable.
author Yuya Nishihara <yuya@tcha.org>
date Sat, 23 Apr 2016 16:11:05 +0900
parents 923fa9e06ea0
children c6b108555dfa
files mercurial/revset.py
diffstat 1 files changed, 23 insertions(+), 24 deletions(-) [+]
line wrap: on
line diff
--- a/mercurial/revset.py	Sat Apr 23 16:09:30 2016 +0900
+++ b/mercurial/revset.py	Sat Apr 23 16:11:05 2016 +0900
@@ -1868,30 +1868,29 @@
         return revs
     # sort() is guaranteed to be stable
     ctxs = [repo[r] for r in revs]
-    if True:
-        for k in reversed(keys):
-            if k == 'rev':
-                ctxs.sort(key=lambda c: c.rev())
-            elif k == '-rev':
-                ctxs.sort(key=lambda c: c.rev(), reverse=True)
-            elif k == 'branch':
-                ctxs.sort(key=lambda c: c.branch())
-            elif k == '-branch':
-                ctxs.sort(key=lambda c: c.branch(), reverse=True)
-            elif k == 'desc':
-                ctxs.sort(key=lambda c: c.description())
-            elif k == '-desc':
-                ctxs.sort(key=lambda c: c.description(), reverse=True)
-            elif k in 'user author':
-                ctxs.sort(key=lambda c: c.user())
-            elif k in '-user -author':
-                ctxs.sort(key=lambda c: c.user(), reverse=True)
-            elif k == 'date':
-                ctxs.sort(key=lambda c: c.date()[0])
-            elif k == '-date':
-                ctxs.sort(key=lambda c: c.date()[0], reverse=True)
-            else:
-                raise error.ParseError(_("unknown sort key %r") % k)
+    for k in reversed(keys):
+        if k == 'rev':
+            ctxs.sort(key=lambda c: c.rev())
+        elif k == '-rev':
+            ctxs.sort(key=lambda c: c.rev(), reverse=True)
+        elif k == 'branch':
+            ctxs.sort(key=lambda c: c.branch())
+        elif k == '-branch':
+            ctxs.sort(key=lambda c: c.branch(), reverse=True)
+        elif k == 'desc':
+            ctxs.sort(key=lambda c: c.description())
+        elif k == '-desc':
+            ctxs.sort(key=lambda c: c.description(), reverse=True)
+        elif k in 'user author':
+            ctxs.sort(key=lambda c: c.user())
+        elif k in '-user -author':
+            ctxs.sort(key=lambda c: c.user(), reverse=True)
+        elif k == 'date':
+            ctxs.sort(key=lambda c: c.date()[0])
+        elif k == '-date':
+            ctxs.sort(key=lambda c: c.date()[0], reverse=True)
+        else:
+            raise error.ParseError(_("unknown sort key %r") % k)
     return baseset([c.rev() for c in ctxs])
 
 @predicate('subrepo([pattern])')