[PATCH 3 of 3] branchpoint: do not compute min. subset is already sorted

[pierre-yves.david at logilab.fr]

# HG changeset patch
# User Pierre-Yves David <pierre-yves.david at logilab.fr>
# Date 1350315459 -7200
# Node ID d2eb3682a1d7556115ed94d4960ac9d3e8f0c2df
# Parent  69277501dded5fc462e7db857c8df09fd7edcd2d
branchpoint: do not compute min. subset is already sorted

diff --git a/mercurial/revset.py b/mercurial/revset.py
--- a/mercurial/revset.py
+++ b/mercurial/revset.py
@@ -925,11 +925,11 @@ def branchpoint(repo, subset, x):
     # i18n: "branchpoint" is a keyword
     getargs(x, 0, 0, _("branchpoint takes no arguments"))
     cl = repo.changelog
     if not subset:
         return []
-    baserev = min(subset)
+    baserev = subset[0]
     parentscount = [0]*(len(repo) - baserev)
     for r in cl.revs(start=baserev + 1):
         for p in cl.parentrevs(r):
             if p >= baserev:
                 parentscount[p - baserev] += 1