Show More
@@ -429,6 +429,25 b' class sqlitefilestore:' | |||||
429 | entry = self._revisions[self._revtonode[rev]] |
|
429 | entry = self._revisions[self._revtonode[rev]] | |
430 | return entry.p1rev, entry.p2rev |
|
430 | return entry.p1rev, entry.p2rev | |
431 |
|
431 | |||
|
432 | def ancestors(self, revs, stoprev=0, inclusive=False): | |||
|
433 | """Generate the ancestors of 'revs' in reverse revision order. | |||
|
434 | Does not generate revs lower than stoprev. | |||
|
435 | ||||
|
436 | See the documentation for ancestor.lazyancestors for more details.""" | |||
|
437 | ||||
|
438 | # first, make sure start revisions aren't filtered | |||
|
439 | revs = list(revs) | |||
|
440 | checkrev = self.node | |||
|
441 | for r in revs: | |||
|
442 | checkrev(r) | |||
|
443 | ||||
|
444 | return ancestor.lazyancestors( | |||
|
445 | self.parentrevs, | |||
|
446 | revs, | |||
|
447 | stoprev=stoprev, | |||
|
448 | inclusive=inclusive, | |||
|
449 | ) | |||
|
450 | ||||
432 | def rev(self, node): |
|
451 | def rev(self, node): | |
433 | if node == sha1nodeconstants.nullid: |
|
452 | if node == sha1nodeconstants.nullid: | |
434 | return nullrev |
|
453 | return nullrev |
General Comments 0
You need to be logged in to leave comments.
Login now