##// END OF EJS Templates
revlog.size: remove alternate implementation (revlogv0 specific)...
Benoit Boissinot -
r10404:3e7cbe85 default
parent child Browse files
Show More
@@ -537,26 +537,6 b' class revlog(object):'
537 t = self.revision(self.node(rev))
537 t = self.revision(self.node(rev))
538 return len(t)
538 return len(t)
539
539
540 # Alternate implementation. The advantage to this code is it
541 # will be faster for a single revision. However, the results
542 # are not cached, so finding the size of every revision will
543 # be slower.
544 #
545 # if self.cache and self.cache[1] == rev:
546 # return len(self.cache[2])
547 #
548 # base = self.base(rev)
549 # if self.cache and self.cache[1] >= base and self.cache[1] < rev:
550 # base = self.cache[1]
551 # text = self.cache[2]
552 # else:
553 # text = self.revision(self.node(base))
554 #
555 # l = len(text)
556 # for x in xrange(base + 1, rev + 1):
557 # l = mdiff.patchedsize(l, self._chunk(x))
558 # return l
559
560 def reachable(self, node, stop=None):
540 def reachable(self, node, stop=None):
561 """return the set of all nodes ancestral to a given node, including
541 """return the set of all nodes ancestral to a given node, including
562 the node itself, stopping when stop is matched"""
542 the node itself, stopping when stop is matched"""
General Comments 0
You need to be logged in to leave comments. Login now