[PATCH] revlog: teach revlog to construct a revision from parentdeltas

[in3xes at gmail.com]

# HG changeset patch
# User Pradeepkumar Gayam <in3xes at gmail.com>
# Date 1281138500 -19800
# Node ID 12a41d114b113af32329386b32d88709c0f28816
# Parent  db0f8a9594be4ecde3c1cc0ba71087997650ca9a
revlog: teach revlog to construct a revision from parentdeltas

diff -r db0f8a9594be -r 12a41d114b11 mercurial/revlog.py
--- a/mercurial/revlog.py	Sat Aug 07 05:05:16 2010 +0530
+++ b/mercurial/revlog.py	Sat Aug 07 05:18:20 2010 +0530
@@ -1035,7 +1035,7 @@
 
     def revdiff(self, rev1, rev2):
         """return or calculate a delta between two revisions"""
-        if rev1 + 1 == rev2 and self.base(rev1) == self.base(rev2):
+        if rev1 != nullrev and self.deltaparent(rev2) == rev1:
             return self._chunk(rev2)
 
         return mdiff.textdiff(self.revision(self.node(rev1)),
@@ -1051,7 +1051,7 @@
         # look up what we need to read
         text = None
         rev = self.rev(node)
-        base = self.base(rev)
+        base, chain = self.deltachain(rev)
 
         # check rev flags
         if self.flags(rev) & ~REVIDX_KNOWN_FLAGS:
@@ -1059,9 +1059,14 @@
                               (self.flags(rev) & ~REVIDX_KNOWN_FLAGS))
 
         # do we have useful data cached?
-        if self._cache and self._cache[1] >= base and self._cache[1] < rev:
-            base = self._cache[1]
-            text = self._cache[2]
+        if self._cache:
+            try:
+                intersect = chain.index(self._cache[1])
+            except ValueError:
+                pass
+            else:
+                base, chain = chain[intersect], chain[intersect + 1:]
+                text = self._cache[2]
 
         # drop cache to save memory
         self._cache = None
@@ -1071,7 +1076,7 @@
         if text is None:
             text = self._chunk(base)
 
-        bins = [self._chunk(r) for r in xrange(base + 1, rev + 1)]
+        bins = [self._chunk(r) for r in chain]
         text = mdiff.patches(text, bins)
         p1, p2 = self.parents(node)
         if (node != hash(text, p1, p2) and