mercurial-scm/hg-stable: mercurial/revlog.py comparison

revlog: make triple-quoted string a real comment

author	Martin Geisler <mg@lazybytes.net>
date	Sun, 31 May 2009 00:58:20 +0200
parents	ef393d6ec030
children	0001e49f1c11

comparison

equal deleted inserted replaced

-:3fa92c618624
+:782a85ee686f
 return l
 t = self.revision(self.node(rev))
 return len(t)
-# alternate implementation, The advantage to this code is it
+# Alternate implementation. The advantage to this code is it
-# will be faster for a single revision.  But, the results are not
+# will be faster for a single revision. However, the results
-# cached, so finding the size of every revision will be slower.
+# are not cached, so finding the size of every revision will
-"""
+# be slower.
-if self.cache and self.cache[1] == rev:
+#
-return len(self.cache[2])
+# if self.cache and self.cache[1] == rev:
+#     return len(self.cache[2])
-base = self.base(rev)
+#
-if self.cache and self.cache[1] >= base and self.cache[1] < rev:
+# base = self.base(rev)
-base = self.cache[1]
+# if self.cache and self.cache[1] >= base and self.cache[1] < rev:
-text = self.cache[2]
+#     base = self.cache[1]
-else:
+#     text = self.cache[2]
-text = self.revision(self.node(base))
+# else:
+#     text = self.revision(self.node(base))
-l = len(text)
+#
-for x in xrange(base + 1, rev + 1):
+# l = len(text)
-l = mdiff.patchedsize(l, self._chunk(x))
+# for x in xrange(base + 1, rev + 1):
-return l
+#     l = mdiff.patchedsize(l, self._chunk(x))
-"""
+# return l
 def reachable(self, node, stop=None):
 """return the set of all nodes ancestral to a given node, including
 the node itself, stopping when stop is matched"""
 reachable = set((node,))

Mercurial > public > mercurial-scm > hg-stable