Show More
@@ -429,6 +429,29 b' class revlog(object):' | |||||
429 | missing.sort() |
|
429 | missing.sort() | |
430 | return has, [self.node(r) for r in missing] |
|
430 | return has, [self.node(r) for r in missing] | |
431 |
|
431 | |||
|
432 | def findmissingrevs(self, common=None, heads=None): | |||
|
433 | """Return the revision numbers of the ancestors of heads that | |||
|
434 | are not ancestors of common. | |||
|
435 | ||||
|
436 | More specifically, return a list of revision numbers corresponding to | |||
|
437 | nodes N such that every N satisfies the following constraints: | |||
|
438 | ||||
|
439 | 1. N is an ancestor of some node in 'heads' | |||
|
440 | 2. N is not an ancestor of any node in 'common' | |||
|
441 | ||||
|
442 | The list is sorted by revision number, meaning it is | |||
|
443 | topologically sorted. | |||
|
444 | ||||
|
445 | 'heads' and 'common' are both lists of revision numbers. If heads is | |||
|
446 | not supplied, uses all of the revlog's heads. If common is not | |||
|
447 | supplied, uses nullid.""" | |||
|
448 | if common is None: | |||
|
449 | common = [nullrev] | |||
|
450 | if heads is None: | |||
|
451 | heads = self.headrevs() | |||
|
452 | ||||
|
453 | return ancestor.missingancestors(heads, common, self.parentrevs) | |||
|
454 | ||||
432 | def findmissing(self, common=None, heads=None): |
|
455 | def findmissing(self, common=None, heads=None): | |
433 | """Return the ancestors of heads that are not ancestors of common. |
|
456 | """Return the ancestors of heads that are not ancestors of common. | |
434 |
|
457 |
General Comments 0
You need to be logged in to leave comments.
Login now