equal
deleted
inserted
replaced
1509 self.hook('preoutgoing', throw=True, source=source) |
1509 self.hook('preoutgoing', throw=True, source=source) |
1510 self.changegroupinfo(csets, source) |
1510 self.changegroupinfo(csets, source) |
1511 |
1511 |
1512 # filter any nodes that claim to be part of the known set |
1512 # filter any nodes that claim to be part of the known set |
1513 def prune(revlog, missing): |
1513 def prune(revlog, missing): |
1514 for n in missing: |
1514 return [n for n in missing |
1515 if revlog.linkrev(revlog.rev(n)) not in commonrevs: |
1515 if revlog.linkrev(revlog.rev(n)) not in commonrevs] |
1516 yield n |
|
1517 |
1516 |
1518 def lookup(revlog, x): |
1517 def lookup(revlog, x): |
1519 if revlog == cl: |
1518 if revlog == cl: |
1520 c = cl.read(x) |
1519 c = cl.read(x) |
1521 changedfiles.update(c[3]) |
1520 changedfiles.update(c[3]) |
1616 self.changegroupinfo(nodes, source) |
1615 self.changegroupinfo(nodes, source) |
1617 |
1616 |
1618 revset = set([cl.rev(n) for n in nodes]) |
1617 revset = set([cl.rev(n) for n in nodes]) |
1619 |
1618 |
1620 def gennodelst(log): |
1619 def gennodelst(log): |
1621 for r in log: |
1620 return [log.node(r) for r in log if log.linkrev(r) in revset] |
1622 if log.linkrev(r) in revset: |
|
1623 yield log.node(r) |
|
1624 |
1621 |
1625 def lookup(revlog, x): |
1622 def lookup(revlog, x): |
1626 if revlog == cl: |
1623 if revlog == cl: |
1627 c = cl.read(x) |
1624 c = cl.read(x) |
1628 changedfiles.update(c[3]) |
1625 changedfiles.update(c[3]) |