Mercurial > hg
view mercurial/graphmod.py @ 8840:d9acbe7b0049
graphmod/graphlog: make dag walks carry data as type, payload
author | Peter Arrenbrecht <peter.arrenbrecht@gmail.com> |
---|---|
date | Fri, 19 Jun 2009 13:22:32 +0200 |
parents | d8e3a98018cb |
children | 94ac080e7af9 |
line wrap: on
line source
# Revision graph generator for Mercurial # # Copyright 2008 Dirkjan Ochtman <dirkjan@ochtman.nl> # Copyright 2007 Joel Rosdahl <joel@rosdahl.net> # # This software may be used and distributed according to the terms of the # GNU General Public License version 2, incorporated herein by reference. """supports walking the history as DAGs suitable for graphical output The most basic format we use is that of:: (id, type, data, [parentids]) The node and parent ids are arbitrary integers which identify a node in the context of the graph returned. Type is a constant specifying the node type. Data depends on type. """ from mercurial.node import nullrev CHANGESET = 'C' def revisions(repo, start, stop): """cset DAG generator yielding (id, CHANGESET, ctx, [parentids]) tuples This generator function walks through the revision history from revision start to revision stop (which must be less than or equal to start). It returns a tuple for each node. The node and parent ids are arbitrary integers which identify a node in the context of the graph returned. """ assert start >= stop cur = start while cur >= stop: ctx = repo[cur] parents = [p.rev() for p in ctx.parents() if p.rev() != nullrev] yield (cur, CHANGESET, ctx, sorted(parents)) cur -= 1 def filerevs(repo, path, start, stop): """file cset DAG generator yielding (id, CHANGESET, ctx, [parentids]) tuples This generator function walks through the revision history of a single file from revision start to revision stop (which must be less than or equal to start). """ assert start >= stop filerev = len(repo.file(path)) - 1 while filerev >= 0: fctx = repo.filectx(path, fileid=filerev) parents = [f.linkrev() for f in fctx.parents() if f.path() == path] rev = fctx.rev() if rev <= start: yield (rev, CHANGESET, fctx, sorted(parents)) if rev <= stop: break filerev -= 1 def nodes(repo, nodes): """cset DAG generator yielding (id, CHANGESET, ctx, [parentids]) tuples This generator function walks the given nodes. It only returns parents that are in nodes, too. """ include = set(nodes) for node in nodes: ctx = repo[node] parents = [p.rev() for p in ctx.parents() if p.node() in include] yield (ctx.rev(), CHANGESET, ctx, sorted(parents)) def graph(repo, start_rev, stop_rev): """incremental revision grapher This generator function walks through the revision history from revision start_rev to revision stop_rev (which must be less than or equal to start_rev) and for each revision emits tuples with the following elements: - Context of the current node - Tuple (col, color) with column and color index for the current node - Edges; a list of (col, next_col, color) indicating the edges between the current node and its parents. """ if start_rev == nullrev and not stop_rev: return assert start_rev >= stop_rev assert stop_rev >= 0 curr_rev = start_rev revs = [] cl = repo.changelog colors = {} new_color = 1 while curr_rev >= stop_rev: # Compute revs and next_revs if curr_rev not in revs: revs.append(curr_rev) # new head colors[curr_rev] = new_color new_color += 1 idx = revs.index(curr_rev) color = colors.pop(curr_rev) next = revs[:] # Add parents to next_revs parents = [x for x in cl.parentrevs(curr_rev) if x != nullrev] addparents = [p for p in parents if p not in next] next[idx:idx + 1] = addparents # Set colors for the parents for i, p in enumerate(addparents): if not i: colors[p] = color else: colors[p] = new_color new_color += 1 # Add edges to the graph edges = [] for col, r in enumerate(revs): if r in next: edges.append((col, next.index(r), colors[r])) elif r == curr_rev: for p in parents: edges.append((col, next.index(p), colors[p])) # Yield and move on yield (repo[curr_rev], (idx, color), edges) revs = next curr_rev -= 1