Mercurial > public > mercurial-scm > hg

comparison mercurial/revlog.py @ 2:ecf3fd948051

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Handle nullid better for ancestor
author mpm@selenic.com
date Tue, 03 May 2005 18:35:03 -0800
parents 9117c6561b0b
children e0e5c1b9febd
comparison
equal deleted inserted replaced
1:273ce12ad8f1 2:ecf3fd948051
6 # Copyright 2005 Matt Mackall <mpm@selenic.com> 6 # Copyright 2005 Matt Mackall <mpm@selenic.com>
7 # 7 #
8 # This software may be used and distributed according to the terms 8 # This software may be used and distributed according to the terms
9 # of the GNU General Public License, incorporated herein by reference. 9 # of the GNU General Public License, incorporated herein by reference.
10 10
11 import zlib, struct, sha, binascii, os, tempfile 11 import zlib, struct, sha, os, tempfile
12 from mercurial import mdiff 12 from mercurial import mdiff
13 13
14 def compress(text): 14 def compress(text):
15 return zlib.compress(text) 15 return zlib.compress(text)
16 16
49 def tip(self): return self.node(len(self.index) - 1) 49 def tip(self): return self.node(len(self.index) - 1)
50 def count(self): return len(self.index) 50 def count(self): return len(self.index)
51 def node(self, rev): return rev < 0 and nullid or self.index[rev][6] 51 def node(self, rev): return rev < 0 and nullid or self.index[rev][6]
52 def rev(self, node): return self.nodemap[node] 52 def rev(self, node): return self.nodemap[node]
53 def linkrev(self, node): return self.index[self.nodemap[node]][3] 53 def linkrev(self, node): return self.index[self.nodemap[node]][3]
54 def parents(self, node): return self.index[self.nodemap[node]][4:6] 54 def parents(self, node):
55 if node == nullid: return (nullid, nullid)
56 return self.index[self.nodemap[node]][4:6]
55 57
56 def start(self, rev): return self.index[rev][0] 58 def start(self, rev): return self.index[rev][0]
57 def length(self, rev): return self.index[rev][1] 59 def length(self, rev): return self.index[rev][1]
58 def end(self, rev): return self.start(rev) + self.length(rev) 60 def end(self, rev): return self.start(rev) + self.length(rev)
59 def base(self, rev): return self.index[rev][2] 61 def base(self, rev): return self.index[rev][2]