# HG changeset patch
# User Siddharth Agarwal <sid0@fb.com>
# Date 1416012760 28800
# Node ID d8f5b2f50f41eb7f785f17a5ae792f215423a2b5
# Parent  3a8a763f41970651b0c6c5212eb91c1a07d4d397
revlog: switch findmissing* methods to incrementalmissingrevs

This will allow us to remove ancestor.missingancestors in an upcoming patch.

diff -r 3a8a763f4197 -r d8f5b2f50f41 mercurial/revlog.py
--- a/mercurial/revlog.py	Sun Nov 16 00:39:48 2014 -0800
+++ b/mercurial/revlog.py	Fri Nov 14 16:52:40 2014 -0800
@@ -530,7 +530,8 @@
         if heads is None:
             heads = self.headrevs()
 
-        return ancestor.missingancestors(heads, common, self.parentrevs)
+        inc = self.incrementalmissingrevs(common=common)
+        return inc.missingancestors(heads)
 
     def findmissing(self, common=None, heads=None):
         """Return the ancestors of heads that are not ancestors of common.
@@ -555,8 +556,8 @@
         common = [self.rev(n) for n in common]
         heads = [self.rev(n) for n in heads]
 
-        return [self.node(r) for r in
-                ancestor.missingancestors(heads, common, self.parentrevs)]
+        inc = self.incrementalmissingrevs(common=common)
+        return [self.node(r) for r in inc.missingancestors(heads)]
 
     def nodesbetween(self, roots=None, heads=None):
         """Return a topological path from 'roots' to 'heads'.