context.py
263 lines
| 8.4 KiB
| text/x-python
|
PythonLexer
/ mercurial / context.py
|
r2563 | # context.py - changeset and file context objects for mercurial | ||
# | ||||
|
r2859 | # Copyright 2006 Matt Mackall <mpm@selenic.com> | ||
|
r2563 | # | ||
# This software may be used and distributed according to the terms | ||||
# of the GNU General Public License, incorporated herein by reference. | ||||
|
r3122 | from node import * | ||
|
r3126 | from demandload import demandload | ||
demandload(globals(), "heapq") | ||||
|
r3122 | |||
|
r2563 | class changectx(object): | ||
"""A changecontext object makes access to data related to a particular | ||||
changeset convenient.""" | ||||
|
r3132 | def __init__(self, repo, changeid=None): | ||
|
r2563 | """changeid is a revision number, node, or tag""" | ||
self._repo = repo | ||||
|
r3132 | if not changeid: | ||
p1, p2 = self._repo.dirstate.parents() | ||||
self._rev = self._repo.changelog.rev(p1) | ||||
if self._rev == -1: | ||||
changeid = 'tip' | ||||
else: | ||||
self._node = p1 | ||||
return | ||||
|
r2643 | self._node = self._repo.lookup(changeid) | ||
|
r2563 | self._rev = self._repo.changelog.rev(self._node) | ||
def changeset(self): | ||||
try: | ||||
return self._changeset | ||||
except AttributeError: | ||||
self._changeset = self._repo.changelog.read(self.node()) | ||||
return self._changeset | ||||
def manifest(self): | ||||
try: | ||||
return self._manifest | ||||
except AttributeError: | ||||
self._manifest = self._repo.manifest.read(self.changeset()[0]) | ||||
return self._manifest | ||||
def rev(self): return self._rev | ||||
def node(self): return self._node | ||||
def user(self): return self.changeset()[1] | ||||
def date(self): return self.changeset()[2] | ||||
|
r3122 | def files(self): return self.changeset()[3] | ||
|
r2563 | def description(self): return self.changeset()[4] | ||
def parents(self): | ||||
"""return contexts for each parent changeset""" | ||||
|
r2627 | p = self._repo.changelog.parents(self._node) | ||
|
r2563 | return [ changectx(self._repo, x) for x in p ] | ||
def children(self): | ||||
"""return contexts for each child changeset""" | ||||
|
r2627 | c = self._repo.changelog.children(self._node) | ||
|
r2563 | return [ changectx(self._repo, x) for x in c ] | ||
def filenode(self, path): | ||||
node, flag = self._repo.manifest.find(self.changeset()[0], path) | ||||
return node | ||||
|
r2628 | def filectx(self, path, fileid=None): | ||
|
r2563 | """get a file context from this changeset""" | ||
|
r2628 | if fileid is None: | ||
fileid = self.filenode(path) | ||||
return filectx(self._repo, path, fileid=fileid) | ||||
|
r2563 | |||
def filectxs(self): | ||||
"""generate a file context for each file in this changeset's | ||||
manifest""" | ||||
mf = self.manifest() | ||||
m = mf.keys() | ||||
m.sort() | ||||
for f in m: | ||||
yield self.filectx(f, fileid=mf[f]) | ||||
|
r3125 | def ancestor(self, c2): | ||
""" | ||||
return the ancestor context of self and c2 | ||||
""" | ||||
n = self._repo.changelog.ancestor(self._node, c2._node) | ||||
return changectx(self._repo, n) | ||||
|
r2563 | class filectx(object): | ||
"""A filecontext object makes access to data related to a particular | ||||
filerevision convenient.""" | ||||
|
r3124 | def __init__(self, repo, path, changeid=None, fileid=None, filelog=None): | ||
|
r2563 | """changeid can be a changeset revision, node, or tag. | ||
fileid can be a file revision or node.""" | ||||
self._repo = repo | ||||
self._path = path | ||||
|
r2643 | assert changeid or fileid | ||
|
r3124 | if filelog: | ||
self._filelog = filelog | ||||
else: | ||||
self._filelog = self._repo.file(self._path) | ||||
|
r2643 | if not fileid: | ||
|
r2563 | # if given a changeset id, go ahead and look up the file | ||
|
r2643 | self._changeid = changeid | ||
self._changectx = self.changectx() | ||||
self._filenode = self._changectx.filenode(self._path) | ||||
else: | ||||
|
r3124 | # else delay changectx creation | ||
|
r2643 | self._filenode = self._filelog.lookup(fileid) | ||
self._changeid = self._filelog.linkrev(self._filenode) | ||||
|
r2563 | self._filerev = self._filelog.rev(self._filenode) | ||
|
r2643 | def changectx(self): | ||
|
r2563 | try: | ||
|
r2643 | return self._changectx | ||
|
r2563 | except AttributeError: | ||
|
r2643 | self._changectx = changectx(self._repo, self._changeid) | ||
return self._changectx | ||||
|
r2563 | |||
def filerev(self): return self._filerev | ||||
def filenode(self): return self._filenode | ||||
def filelog(self): return self._filelog | ||||
|
r2643 | def rev(self): return self.changectx().rev() | ||
def node(self): return self.changectx().node() | ||||
def user(self): return self.changectx().user() | ||||
def date(self): return self.changectx().date() | ||||
def files(self): return self.changectx().files() | ||||
def description(self): return self.changectx().description() | ||||
def manifest(self): return self.changectx().manifest() | ||||
|
r2563 | |||
def data(self): return self._filelog.read(self._filenode) | ||||
def renamed(self): return self._filelog.renamed(self._filenode) | ||||
|
r3122 | def path(self): return self._path | ||
|
r2563 | |||
def parents(self): | ||||
|
r3124 | p = self._path | ||
fl = self._filelog | ||||
pl = [ (p, n, fl) for n in self._filelog.parents(self._filenode) ] | ||||
|
r3123 | |||
|
r3124 | r = self.renamed() | ||
|
r3122 | if r: | ||
|
r3124 | pl[0] = (r[0], r[1], None) | ||
return [ filectx(self._repo, p, fileid=n, filelog=l) | ||||
for p,n,l in pl if n != nullid ] | ||||
|
r2563 | |||
def children(self): | ||||
# hard for renames | ||||
c = self._filelog.children(self._filenode) | ||||
|
r3124 | return [ filectx(self._repo, self._path, fileid=x, | ||
filelog=self._filelog) for x in c ] | ||||
|
r2566 | |||
def annotate(self): | ||||
return self._filelog.annotate(self._filenode) | ||||
|
r3124 | |||
|
r3126 | def ancestor(self, fc2): | ||
""" | ||||
find the common ancestor file context, if any, of self, and fc2 | ||||
""" | ||||
a, b = (self._path, self._filenode), (fc2._path, fc2._filenode) | ||||
if a == b: | ||||
return self | ||||
if a[0] == b[0]: | ||||
n = self._filelog.ancestor(a[1], b[1]) | ||||
if n != nullid: | ||||
return filectx(self._repo, self._path, | ||||
fileid=n, filelog=self._filelog) | ||||
# build a graph of all ancestors, crossing renames | ||||
ag = {} | ||||
fv = [a, b] | ||||
flcache = {self._path:self._filelog, fc2._path:fc2._filelog} | ||||
while fv: | ||||
f,n = fv.pop() | ||||
try: | ||||
fl = flcache[f] | ||||
except KeyError: | ||||
flcache[f] = self._repo.file(f) | ||||
fl = flcache[f] | ||||
v = [n] | ||||
while v: | ||||
n = v.pop() | ||||
c = (f, n) | ||||
if c in ag: | ||||
continue | ||||
pl = [ n for n in fl.parents(n) if n != nullid ] | ||||
v += pl | ||||
pl = [ (f, n) for n in pl ] | ||||
re = fl.renamed(n) | ||||
if re: | ||||
pl.append(re) | ||||
if re not in ag: | ||||
fv.append(re) | ||||
ag[c] = pl | ||||
dist = {} | ||||
def depth(node): | ||||
try: | ||||
return dist[node] | ||||
except KeyError: | ||||
pl = ag[node] | ||||
if not pl: | ||||
dist[node] = 0 | ||||
else: | ||||
dist[node] = max([depth(p) for p in pl]) + 1 | ||||
return dist[node] | ||||
# traverse ancestors in order of decreasing distance from root | ||||
def ancestors(vertex): | ||||
h = [(-depth(vertex), vertex)] | ||||
seen = {} | ||||
while h: | ||||
d, v = heapq.heappop(h) | ||||
if v not in seen: | ||||
seen[v] = 1 | ||||
yield (-d, v) | ||||
for p in ag[v]: | ||||
heapq.heappush(h, (-depth(p), p)) | ||||
def generations(vertex): | ||||
sg, s = None, {} | ||||
for g,v in ancestors(vertex): | ||||
if g != sg: | ||||
if sg: | ||||
yield sg, s | ||||
sg, s = g, {v:1} | ||||
else: | ||||
s[v] = 1 | ||||
yield sg, s | ||||
x = generations(a) | ||||
y = generations(b) | ||||
gx = x.next() | ||||
gy = y.next() | ||||
# increment each ancestor list until it is closer to root than | ||||
# the other, or they match | ||||
try: | ||||
while 1: | ||||
if gx[0] == gy[0]: | ||||
# find the intersection | ||||
i = [ n for n in gx[1] if n in gy[1] ] | ||||
if i: | ||||
fp,fn = i[0] | ||||
fl = flcache[fp] | ||||
return filectx(self._repo, fp, fileid=fn, filelog=fl) | ||||
else: | ||||
gy = y.next() | ||||
gx = x.next() | ||||
elif gx[0] < gy[0]: | ||||
gy = y.next() | ||||
else: | ||||
gx = x.next() | ||||
except StopIteration: | ||||
return None | ||||