equal
deleted
inserted
replaced
1576 # Known heads are the list of heads that it is assumed the recipient |
1576 # Known heads are the list of heads that it is assumed the recipient |
1577 # of this changegroup will know about. |
1577 # of this changegroup will know about. |
1578 knownheads = set() |
1578 knownheads = set() |
1579 # We assume that all parents of bases are known heads. |
1579 # We assume that all parents of bases are known heads. |
1580 for n in bases: |
1580 for n in bases: |
1581 for p in cl.parents(n): |
1581 knownheads.update(cl.parents(n)) |
1582 if p != nullid: |
1582 knownheads.discard(nullid) |
1583 knownheads.add(p) |
|
1584 knownheads = list(knownheads) |
1583 knownheads = list(knownheads) |
1585 if knownheads: |
1584 if knownheads: |
1586 # Now that we know what heads are known, we can compute which |
1585 # Now that we know what heads are known, we can compute which |
1587 # changesets are known. The recipient must know about all |
1586 # changesets are known. The recipient must know about all |
1588 # changesets required to reach the known heads from the null |
1587 # changesets required to reach the known heads from the null |
1864 yield log.node(r) |
1863 yield log.node(r) |
1865 |
1864 |
1866 def changed_file_collector(changedfileset): |
1865 def changed_file_collector(changedfileset): |
1867 def collect_changed_files(clnode): |
1866 def collect_changed_files(clnode): |
1868 c = cl.read(clnode) |
1867 c = cl.read(clnode) |
1869 for fname in c[3]: |
1868 changedfileset.update(c[3]) |
1870 changedfileset.add(fname) |
|
1871 return collect_changed_files |
1869 return collect_changed_files |
1872 |
1870 |
1873 def lookuprevlink_func(revlog): |
1871 def lookuprevlink_func(revlog): |
1874 def lookuprevlink(n): |
1872 def lookuprevlink(n): |
1875 return cl.node(revlog.linkrev(revlog.rev(n))) |
1873 return cl.node(revlog.linkrev(revlog.rev(n))) |