56
56
for me, my_parents in ancestors.iteritems():
59
new_ancestors[me] = {}
59
new_ancestors[me] = {}
60
60
for parent in my_parents:
63
63
while can_skip(new_parent, descendants, ancestors):
64
64
if new_parent in exceptions:
69
69
new_parent = list(ancestors[new_parent])[0]
71
71
new_ancestors[me][new_parent] = distance
74
74
def get_rev_info(rev_id, source):
75
75
"""Return the committer, message, and date of a revision."""
79
79
if rev_id == 'null:':
80
return None, 'Null Revision', None, None
80
return None, 'Null Revision', None
82
82
rev = source.get_revision(rev_id)
83
83
except NoSuchRevision:
85
85
committer = '-'.join(rev_id.split('-')[:-2]).strip(' ')
86
86
if committer == '':
87
return None, None, None, None
87
return None, None, None
89
return None, None, None, None
89
return None, None, None
91
91
committer = short_committer(rev.committer)
92
92
if rev.message is not None:
93
93
message = rev.message.split('\n')[0]
94
94
gmtime = time.gmtime(rev.timestamp + (rev.timezone or 0))
95
95
date = time.strftime('%Y/%m/%d', gmtime)
96
nick = rev.properties.get('branch-nick')
97
96
if '@' in committer:
99
98
committer = mail_map[committer]
103
102
committer = committer_alias[committer]
106
return committer, message, nick, date
105
return committer, message, date
108
107
class Grapher(object):
109
108
def __init__(self, branch, other_branch=None):
128
127
self.n_history = branch.revision_history()
129
self.distances = node_distances(self.descendants, self.ancestors,
128
self.distances = node_distances(self.descendants, self.ancestors,
131
130
if other_branch is not None:
132
131
self.base = select_farthest(self.distances, self.common)
133
self.m_history = other_branch.revision_history()
134
new_graph = getattr(branch.repository, 'get_graph', lambda: None)()
135
if new_graph is None:
139
self.new_base = new_graph.find_unique_lca(revision_a,
141
self.lcas = new_graph.find_lca(revision_a, revision_b)
132
self.m_history = other_branch.revision_history()
146
135
self.m_history = []
148
137
def dot_node(self, node, num):
181
170
assert m_rev is not None
182
171
cluster = "other_history"
183
172
color = "#ff0000"
184
if node in self.lcas:
186
173
if node == self.base:
188
if node == self.new_base:
190
if node == self.new_base:
194
committer, message, nick, date = get_rev_info(node,
195
self.branch.repository)
177
committer, message, date = get_rev_info(node, self.branch.repository)
196
178
if committer is not None:
197
179
label.append(committer)
202
181
if date is not None:
203
182
label.append(date)
211
d_node = Node("n%d" % num, color=color, label="\\n".join(label),
190
d_node = Node("n%d" % num, color=color, label="\\n".join(label),
212
191
rev_id=node, cluster=cluster, message=message,
214
193
d_node.rank = rank
217
196
d_node.node_style.append('dotted')
221
def get_relations(self, collapse=False, max_distance=None):
200
def get_relations(self, collapse=False):
223
202
node_relations = []
226
exceptions = self.lcas.union([self.base, self.new_base])
227
visible_ancestors = compact_ancestors(self.descendants,
205
visible_ancestors = compact_ancestors(self.descendants,
206
self.ancestors, (self.base,))
231
visible_ancestors = {}
232
for revision, parents in self.ancestors.iteritems():
233
visible_ancestors[revision] = dict((p, 0) for p in parents)
234
if max_distance is not None:
235
min_distance = max(self.distances.values()) - max_distance
236
visible_ancestors = dict((n, p) for n, p in
237
visible_ancestors.iteritems() if
238
self.distances[n] >= min_distance)
208
visible_ancestors = self.ancestors
239
209
for node, parents in visible_ancestors.iteritems():
240
210
if node not in dot_nodes:
241
211
dot_nodes[node] = self.dot_node(node, num)
243
for parent, skipped in parents.iteritems():
213
if visible_ancestors is self.ancestors:
214
parent_iter = ((f, 0) for f in parents)
216
parent_iter = (f for f in parents.iteritems())
217
for parent, skipped in parent_iter:
244
218
if parent not in dot_nodes:
245
219
dot_nodes[parent] = self.dot_node(parent, num)
254
228
def write_ancestry_file(branch, filename, collapse=True, antialias=True,
255
merge_branch=None, ranking="forced", max_distance=None):
229
merge_branch=None, ranking="forced"):
256
230
b = Branch.open_containing(branch)[0]
257
231
if merge_branch is not None:
258
232
m = Branch.open_containing(merge_branch)[0]