mercurial-scm/hg-stable: mercurial/localrepo.py comparison

comparison mercurial/localrepo.py @ 8469:cb897f10e54a

localrepo: use set instead of dict

author	Benoit Boissinot <benoit.boissinot@ens-lyon.org>
date	Sun, 17 May 2009 04:33:39 +0200
parents	9dfee83c93c8
children	a9dab5a0f85b

comparison

equal deleted inserted replaced

-:b35d11d10646
+:cb897f10e54a
 remove.append(p)
 # find every node whose parents have been pruned
 subset = []
 # find every remote head that will get new children
-updated_heads = {}
+updated_heads = set()
 for n in remain:
 p1, p2 = self.changelog.parents(n)
 if p1 not in remain and p2 not in remain:
 subset.append(n)
 if heads:
 if p1 in heads:
-updated_heads[p1] = True
+updated_heads.add(p1)
 if p2 in heads:
-updated_heads[p2] = True
+updated_heads.add(p2)
 # this is the set of all roots we have to push
 if heads:
-return subset, updated_heads.keys()
+return subset, list(updated_heads)
 else:
 return subset
 def pull(self, remote, heads=None, force=False):
 lock = self.lock()
 # too.  nodesbetween will return the minimal set of bases and heads
 # necessary to re-create the changegroup.
 # Known heads are the list of heads that it is assumed the recipient
 # of this changegroup will know about.
-knownheads = {}
+knownheads = set()
 # We assume that all parents of bases are known heads.
 for n in bases:
 for p in cl.parents(n):
 if p != nullid:
-knownheads[p] = 1
+knownheads.add(p)
-knownheads = knownheads.keys()
+knownheads = list(knownheads)
 if knownheads:
 # Now that we know what heads are known, we can compute which
 # changesets are known.  The recipient must know about all
 # changesets required to reach the known heads from the null
 # changeset.
 # If we determine that a particular file or manifest node must be a
 # node that the recipient of the changegroup will already have, we can
 # also assume the recipient will have all the parents.  This function
 # prunes them from the set of missing nodes.
 def prune_parents(revlog, hasset, msngset):
-haslst = hasset.keys()
+haslst = list(hasset)
 haslst.sort(cmp_by_rev_func(revlog))
 for node in haslst:
 parentlst = [p for p in revlog.parents(node) if p != nullid]
 while parentlst:
 n = parentlst.pop()
 if n not in hasset:
-hasset[n] = 1
+hasset.add(n)
 p = [p for p in revlog.parents(n) if p != nullid]
 parentlst.extend(p)
 for n in hasset:
 msngset.pop(n, None)
 # Figure out which manifest nodes (of the ones we think might be part
 # of the changegroup) the recipient must know about and remove them
 # from the changegroup.
 def prune_manifests():
-has_mnfst_set = {}
+has_mnfst_set = set()
 for n in msng_mnfst_set:
 # If a 'missing' manifest thinks it belongs to a changenode
 # the recipient is assumed to have, obviously the recipient
 # must have that manifest.
 linknode = cl.node(mnfst.linkrev(mnfst.rev(n)))
 if linknode in has_cl_set:
-has_mnfst_set[n] = 1
+has_mnfst_set.add(n)
 prune_parents(mnfst, has_mnfst_set, msng_mnfst_set)
 # Use the information collected in collect_manifests_and_files to say
 # which changenode any manifestnode belongs to.
 def lookup_manifest_link(mnfstnode):
 # We have a list of filenodes we think we need for a file, lets remove
 # all those we know the recipient must have.
 def prune_filenodes(f, filerevlog):
 msngset = msng_filenode_set[f]
-hasset = {}
+hasset = set()
 # If a 'missing' filenode thinks it belongs to a changenode we
 # assume the recipient must have, then the recipient must have
 # that filenode.
 for n in msngset:
 clnode = cl.node(filerevlog.linkrev(filerevlog.rev(n)))
 if clnode in has_cl_set:
-hasset[n] = 1
+hasset.add(n)
 prune_parents(filerevlog, hasset, msngset)
 # A function generator function that sets up the a context for the
 # inner function.
 def lookup_filenode_link_func(fname):
 def changed_file_collector(changedfileset):
 def collect_changed_files(clnode):
 c = cl.read(clnode)
 for fname in c[3]:
-changedfileset[fname] = 1
+changedfileset.add(fname)
 return collect_changed_files
 def lookuprevlink_func(revlog):
 def lookuprevlink(n):
 return cl.node(revlog.linkrev(revlog.rev(n)))
 return lookuprevlink
 def gengroup():
 # construct a list of all changed files
-changedfiles = {}
+changedfiles = set()
 for chnk in cl.group(nodes, identity,
 changed_file_collector(changedfiles)):
 yield chnk

Mercurial > public > mercurial-scm > hg-stable

comparison mercurial/localrepo.py @ 8469:cb897f10e54a