py3: don't use dict.iterkeys()

dict.iterkeys() is not present on Python 3.

Differential Revision: https://phab.mercurial-scm.org/D5262

hgext/remotefilelog/basepack.py

@@ -468,7 +468,7 b' class mutablebasepack(versionmixin):'
         # Precompute the location of each entry
         locations = {}
         count = 0
-        for node in sorted(self.entries.iterkeys()):
+        for node in sorted(self.entries):
             location = count * self.INDEXENTRYLENGTH
             locations[node] = location
             count += 1

hgext/remotefilelog/fileserverclient.py

@@ -340,7 +340,7 b' class fileserverclient(object):'
             missingid = cache.receiveline()
             if not missingid:
                 missedset = set(missed)
-                for missingid in idmap.iterkeys():
+                for missingid in idmap:
                     if not missingid in missedset:
                         missed.append(missingid)
                 self.ui.warn(_("warning: cache connection closed early - " +

hgext/remotefilelog/remotefilelog.py

@@ -419,7 +419,7 b' class remotefilelog(object):'
         # Breadth first traversal to build linkrev graph
         parentrevs = collections.defaultdict(list)
         revmap = {}
-        queue = collections.deque(((None, n) for n in parentsmap.iterkeys()
+        queue = collections.deque(((None, n) for n in parentsmap
                  if n not in allparents))
         while queue:
             prevrev, current = queue.pop()

hgext/remotefilelog/repack.py

@@ -507,7 +507,7 b' class repacker(object):'
                         total=len(byfile))
 
             ancestors = {}
-            nodes = list(node for node in entries.iterkeys())
+            nodes = list(node for node in entries)
             nohistory = []
             for i, node in enumerate(nodes):
                 if node in ancestors:
@@ -643,7 +643,7 b' class repacker(object):'
         count = 0
         for filename, entries in sorted(byfile.iteritems()):
             ancestors = {}
-            nodes = list(node for node in entries.iterkeys())
+            nodes = list(node for node in entries)
 
             for node in nodes:
                 if node in ancestors: