# HG changeset patch
# User Martin Geisler <mg@lazybytes.net>
# Date 1240691149 -7200
# Node ID 62d7287fe6b0978802989205e2e807fced13e2b1
# Parent  6f14253416bdc9e35dc8a9c10590637322d84689
rebase, revlog: use set(x) instead of set(x.keys())

The latter is both unnecessary and slower.

diff -r 6f14253416bd -r 62d7287fe6b0 hgext/rebase.py
--- a/hgext/rebase.py	Wed Apr 15 10:33:58 2009 -0500
+++ b/hgext/rebase.py	Sat Apr 25 22:25:49 2009 +0200
@@ -128,8 +128,7 @@
 
         if not keepf:
             # Remove no more useful revisions
-            if (set(repo.changelog.descendants(min(state)))
-                                                    - set(state.keys())):
+            if set(repo.changelog.descendants(min(state))) - set(state):
                 ui.warn(_("warning: new changesets detected on source branch, "
                                                         "not stripping\n"))
             else:
diff -r 6f14253416bd -r 62d7287fe6b0 mercurial/revlog.py
--- a/mercurial/revlog.py	Wed Apr 15 10:33:58 2009 -0500
+++ b/mercurial/revlog.py	Sat Apr 25 22:25:49 2009 +0200
@@ -678,7 +678,7 @@
             # find from roots.
             heads = dict.fromkeys(heads, 0)
             # Start at the top and keep marking parents until we're done.
-            nodestotag = set(heads.keys())
+            nodestotag = set(heads)
             # Remember where the top was so we can use it as a limit later.
             highestrev = max([self.rev(n) for n in nodestotag])
             while nodestotag: