To get this branch, use:
bzr branch
http://gegoxaren.bato24.eu/bzr/b-gtk/fix-viz
« back to all changes in this revision
Viewing changes to branchview/linegraph.py
- browse files at revision 511.5.1
- compare with another revision
- download diff
- download tarball
- view history from revision 511.5.1
- Committer: Jelmer Vernooij
- Date: 2008-06-29 15:47:30 UTC
- mto: This revision was merged to the branch mainline in revision 519.
- Revision ID: jelmer@samba.org-20080629154730-xfsotoxwkiytf0ph
Pass graph object rather than full repository to linegraph.
- files added:
- branchview
- preferences
- files removed:
- tests/test_viz.py
- files renamed:
- viz/graphcell.py => branchview/graphcell.py
- viz/linegraph.py => branchview/linegraph.py
- viz/treemodel.py => branchview/treemodel.py
- bzr-icon-64.png => icons/bzr-icon-64.png
- preferences.py => preferences/__init__.py
- logview.py => revisionview.py
- files modified:
- AUTHORS
added
removed
branchview/linegraph.py
9
9
__copyright__ = "Copyright © 2005 Canonical Ltd."
10
10
__author__ = "Scott James Remnant <scott@ubuntu.com>"
11
11
12
from bzrlib.revision import NULL_REVISION
12
13
from bzrlib.tsort import merge_sort
13
14
14
def linegraph(branch, start, maxnum):
15
"""Produce a directed graph of a bzr branch.
15
def linegraph(graph, start_revs, maxnum, broken_line_length = None,
16
graph_data = True, mainline_only = False):
17
"""Produce a directed graph of a bzr repository.
16
18
17
Returns a list of tuples of (revid,
18
node,
19
lines,
20
parents,
21
children,
22
revno_sequence).
19
Returns a tuple of (line_graph, revid_index, columns_len) where
20
* line_graph is a list of tuples of (revid,
21
node,
22
lines,
23
parents,
24
children,
25
revno_sequence),
26
* revid_index is a dict of each revision with the key being the revid, and
27
the value the row index, and
28
* columns_len is the number of columns need to draw the line graph.
29
23
30
24
31
Node is a tuple of (column, colour) with column being a zero-indexed
25
32
column number of the graph that this revision represents and colour
35
42
It's up to you how to actually draw the nodes and lines (straight,
36
43
curved, kinked, etc.) and to pick the actual colours for each index.
37
44
"""
38
39
mainline = branch.revision_history()
40
graph_parents = branch.repository.get_revision_graph(start)
45
46
graph_parents = {}
47
ghosts = set()
41
48
graph_children = {}
42
for revid in graph_parents.keys():
43
graph_children[revid] = []
44
45
merge_sorted_revisions = merge_sort(
46
graph_parents,
47
start,
48
mainline,
49
generate_revno=True)
49
for (revid, parent_revids) in graph.iter_ancestry(start_revs):
50
if parent_revids is None:
51
ghosts.add(revid)
52
continue
53
if parent_revids == (NULL_REVISION,):
54
graph_parents[revid] = ()
55
else:
56
graph_parents[revid] = parent_revids
57
for parent in parent_revids:
58
graph_children.setdefault(parent, []).append(revid)
59
graph_children.setdefault(revid, [])
60
for ghost in ghosts:
61
for ghost_child in graph_children[ghost]:
62
graph_parents[ghost_child] = [p for p in graph_parents[ghost_child]
63
if p not in ghosts]
64
graph_parents["top:"] = start_revs
65
66
if len(graph_parents)>0:
67
merge_sorted_revisions = merge_sort(
68
graph_parents,
69
"top:",
70
generate_revno=True)
71
else:
72
merge_sorted_revisions = ()
73
74
if mainline_only:
75
merge_sorted_revisions = [elem for elem in merge_sorted_revisions \
76
if len(elem[3])==1 ]
77
78
assert merge_sorted_revisions[0][1] == "top:"
79
merge_sorted_revisions = merge_sorted_revisions[1:]
50
80
51
81
revid_index = {}
52
82
revno_index = {}
83
84
# This will hold an item for each "branch". For a revisions, the revsion
85
# number less the least significant digit is the branch_id, and used as the
86
# key for the dict. Hence revision with the same revsion number less the
87
# least significant digit are considered to be in the same branch line.
88
# e.g.: for revisions 290.12.1 and 290.12.2, the branch_id would be 290.12,
89
# and these two revisions will be in the same branch line. Each value is
90
# a list of rev_indexes in the branch.
53
91
branch_lines = {}
92
54
93
linegraph = []
55
94
56
95
for (rev_index, (sequence_number,
58
97
merge_depth,
59
98
revno_sequence,
60
99
end_of_merge)) in enumerate(merge_sorted_revisions):
61
100
if maxnum and rev_index >= maxnum:
101
break
62
102
revid_index[revid] = rev_index
63
revno_index[revno_sequence] = rev_index
64
65
branch_id = revno_sequence[0:-1]
66
67
branch_line = None
68
if branch_id not in branch_lines:
69
branch_line = {"line_type": "branch_line",
70
"branch_id": branch_id,
71
"rev_indexes": [],
72
"min_index": rev_index,
73
"max_index": 0}
74
branch_lines[branch_id] = branch_line
75
else:
76
branch_line = branch_lines[branch_id]
77
branch_line["rev_indexes"].append(rev_index)
78
if rev_index > branch_line["max_index"]:
79
branch_line["max_index"] = rev_index
80
103
81
104
parents = graph_parents[revid]
82
for parent_revid in parents:
83
graph_children[parent_revid].append(revid)
84
85
105
linegraph.append([revid,
86
106
None,
87
107
[],
88
108
parents,
89
109
None,
90
110
revno_sequence])
111
112
if graph_data:
113
revno_index[revno_sequence] = rev_index
114
115
branch_id = revno_sequence[0:-1]
116
117
branch_line = None
118
if branch_id not in branch_lines:
119
branch_line = []
120
branch_lines[branch_id] = branch_line
121
else:
122
branch_line = branch_lines[branch_id]
123
124
branch_line.append(rev_index)
91
125
92
branch_ids = branch_lines.keys()
93
def branch_id_cmp(x, y):
94
len_x = len(x)
95
len_y = len(y)
96
if len_x == len_y:
97
return -cmp(x, y)
98
return cmp(len_x, len_y)
99
100
branch_ids.sort(branch_id_cmp)
101
lines = []
102
columns = []
103
104
for branch_id in branch_ids:
105
branch_line = branch_lines[branch_id]
106
107
append_line(columns, branch_line)
108
branch_id = branch_line["branch_id"]
109
color = reduce(lambda x, y: x+y, branch_id, 0)
110
col_index = branch_line["col_index"]
111
node = (col_index, color)
112
113
for rev_index in branch_line["rev_indexes"]:
114
(sequence_number,
115
revid,
116
merge_depth,
117
revno_sequence,
118
end_of_merge) = merge_sorted_revisions[rev_index]
119
120
linegraph[rev_index][1] = node
121
linegraph[rev_index][4] = graph_children[revid]
122
123
for parent_revid in graph_parents[revid]:
124
if parent_revid in revid_index:
125
parent_index = revid_index[parent_revid]
126
parent_revno = merge_sorted_revisions[parent_index][3]
127
parent_branch_id = parent_revno[0:-1]
128
line = {"line_type": "inter_branch_line",
129
"min_index": rev_index,
130
"max_index": parent_index}
131
lines.append(line)
132
if branch_id != parent_branch_id and \
133
parent_index - rev_index > 1:
134
append_line(columns, line)
135
136
for line in lines:
137
parent_index = line["max_index"]
138
parent_node = linegraph[parent_index][1]
139
parent_col_index = parent_node[0]
140
color = parent_node[1]
141
142
child_index = line["min_index"]
143
child_col_index = linegraph[child_index][1][0]
144
145
if "col_index" in line:
146
line_col_index = line["col_index"]
147
linegraph[child_index][2].append(
148
(child_col_index,
149
line_col_index,
150
color))
151
for line_part_index in range(child_index+1, parent_index-1):
152
linegraph[line_part_index][2].append(
153
(line_col_index,
154
line_col_index,
155
color))
156
linegraph[parent_index-1][2].append(
157
(line_col_index,
158
parent_col_index,
159
color))
160
else:
161
linegraph[child_index][2].append(
162
(child_col_index,
163
parent_col_index,
164
color))
165
for line_part_index in range(child_index+1, parent_index):
166
linegraph[line_part_index][2].append(
167
(parent_col_index,
126
if graph_data:
127
branch_ids = branch_lines.keys()
128
129
def branch_id_cmp(x, y):
130
"""Compaire branch_id's first by the number of digits, then reversed
131
by their value"""
132
len_x = len(x)
133
len_y = len(y)
134
if len_x == len_y:
135
return -cmp(x, y)
136
return cmp(len_x, len_y)
137
138
branch_ids.sort(branch_id_cmp)
139
# This will hold a tuple of (child_index, parent_index, col_index) for each
140
# line that needs to be drawn. If col_index is not none, then the line is
141
# drawn along that column, else the the line can be drawn directly between
142
# the child and parent because either the child and parent are in the same
143
# branch line, or the child and parent are 1 row apart.
144
lines = []
145
empty_column = [False for i in range(len(graph_parents))]
146
# This will hold a bit map for each cell. If the cell is true, then the
147
# cell allready contains a node or line. This use when deciding what column
148
# to place a branch line or line in, without it overlaping something else.
149
columns = [list(empty_column)]
150
151
152
for branch_id in branch_ids:
153
branch_line = branch_lines[branch_id]
154
155
# Find the col_index for the direct parent branch. This will be the
156
# starting point when looking for a free column.
157
parent_col_index = 0
158
parent_index = None
159
if len(branch_id) > 1:
160
parent_revno = branch_id[0:-1]
161
if parent_revno in revno_index:
162
parent_index = revno_index[parent_revno]
163
parent_node = linegraph[parent_index][1]
164
if parent_node:
165
parent_col_index = parent_node[0]
166
167
168
col_search_order = _branch_line_col_search_order(columns,
169
parent_col_index)
170
color = reduce(lambda x, y: x+y, branch_id, 0)
171
cur_cont_line = []
172
173
line_range = []
174
last_rev_index = None
175
for rev_index in branch_line:
176
if last_rev_index:
177
if broken_line_length and \
178
rev_index - last_rev_index > broken_line_length:
179
line_range.append(last_rev_index+1)
180
line_range.append(rev_index-1)
181
else:
182
line_range.extend(range(last_rev_index+1, rev_index))
183
184
line_range.append(rev_index)
185
last_rev_index = rev_index
186
187
if parent_index:
188
if broken_line_length and \
189
parent_index - last_rev_index > broken_line_length:
190
line_range.append(last_rev_index+1)
191
else:
192
line_range.extend(range(last_rev_index+1, parent_index))
193
194
col_index = _find_free_column(columns,
195
empty_column,
196
col_search_order,
197
line_range)
198
node = (col_index, color)
199
for rev_index in branch_line:
200
linegraph[rev_index][1] = node
201
columns[col_index][rev_index] = True
202
203
for rev_index in branch_line:
204
(sequence_number,
205
revid,
206
merge_depth,
207
revno_sequence,
208
end_of_merge) = merge_sorted_revisions[rev_index]
209
210
linegraph[rev_index][4] = graph_children[revid]
211
col_index = linegraph[rev_index][1][0]
212
213
for parent_revid in graph_parents[revid]:
214
if parent_revid in revid_index:
215
216
parent_index = revid_index[parent_revid]
217
parent_node = linegraph[parent_index][1]
218
if parent_node:
219
parent_col_index = parent_node[0]
220
else:
221
parent_col_index = None
222
col_search_order = \
223
_line_col_search_order(columns,
224
parent_col_index,
225
col_index)
226
227
# If this line is really long, break it.
228
if len(branch_id) > 0 and \
229
broken_line_length and \
230
parent_index - rev_index > broken_line_length:
231
child_line_col_index = \
232
_find_free_column(columns,
233
empty_column,
234
col_search_order,
235
(rev_index + 1,))
236
_mark_column_as_used(columns,
237
child_line_col_index,
238
(rev_index + 1,))
239
240
# Recall _line_col_search_order to reset it back to
241
# the beging.
242
col_search_order = \
243
_line_col_search_order(columns,
244
parent_col_index,
245
col_index)
246
parent_col_line_index = \
247
_find_free_column(columns,
248
empty_column,
249
col_search_order,
250
(parent_index - 1,))
251
_mark_column_as_used(columns,
252
parent_col_line_index,
253
(parent_index - 1,))
254
lines.append((rev_index,
255
parent_index,
256
(child_line_col_index,
257
parent_col_line_index)))
258
else :
259
line_col_index = col_index
260
if parent_index - rev_index >1:
261
line_range = range(rev_index + 1, parent_index)
262
line_col_index = \
263
_find_free_column(columns,
264
empty_column,
265
col_search_order,
266
line_range)
267
_mark_column_as_used(columns,
268
line_col_index,
269
line_range)
270
lines.append((rev_index,
271
parent_index,
272
(line_col_index,)))
273
274
for (child_index, parent_index, line_col_indexes) in lines:
275
(child_col_index, child_color) = linegraph[child_index][1]
276
(parent_col_index, parent_color) = linegraph[parent_index][1]
277
278
if len(line_col_indexes) == 1:
279
if parent_index - child_index == 1:
280
linegraph[child_index][2].append(
281
(child_col_index,
282
parent_col_index,
283
parent_color))
284
else:
285
# line from the child's column to the lines column
286
linegraph[child_index][2].append(
287
(child_col_index,
288
line_col_indexes[0],
289
parent_color))
290
# lines down the line's column
291
for line_part_index in range(child_index+1, parent_index-1):
292
linegraph[line_part_index][2].append(
293
(line_col_indexes[0],
294
line_col_indexes[0],
295
parent_color))
296
# line from the line's column to the parent's column
297
linegraph[parent_index-1][2].append(
298
(line_col_indexes[0],
299
parent_col_index,
300
parent_color))
301
else:
302
# Broken line
303
# line from the child's column to the lines column
304
linegraph[child_index][2].append(
305
(child_col_index,
306
line_col_indexes[0],
307
parent_color))
308
# Broken line end
309
linegraph[child_index+1][2].append(
310
(line_col_indexes[0],
311
None,
312
parent_color))
313
314
# Broken line end
315
linegraph[parent_index-2][2].append(
316
(None,
317
line_col_indexes[1],
318
parent_color))
319
# line from the line's column to the parent's column
320
linegraph[parent_index-1][2].append(
321
(line_col_indexes[1],
168
322
parent_col_index,
169
color))
170
323
parent_color))
324
return (linegraph, revid_index, len(columns))
325
else:
326
return (linegraph, revid_index, 0)
171
327
172
return (linegraph, revid_index)
173
174
def append_line(columns, line):
175
for col_index, column in enumerate(columns):
328
329
def _branch_line_col_search_order(columns, parent_col_index):
330
for col_index in range(parent_col_index, len(columns)):
331
yield col_index
332
for col_index in range(parent_col_index-1, -1, -1):
333
yield col_index
334
335
def _line_col_search_order(columns, parent_col_index, child_col_index):
336
if parent_col_index is not None:
337
max_index = max(parent_col_index, child_col_index)
338
min_index = min(parent_col_index, child_col_index)
339
for col_index in range(max_index, min_index -1, -1):
340
yield col_index
341
else:
342
max_index = child_col_index
343
min_index = child_col_index
344
yield child_col_index
345
i = 1
346
while max_index + i < len(columns) or \
347
min_index - i > -1:
348
if max_index + i < len(columns):
349
yield max_index + i
350
if min_index - i > -1:
351
yield min_index - i
352
i += 1
353
354
def _find_free_column(columns, empty_column, col_search_order, line_range):
355
for col_index in col_search_order:
356
column = columns[col_index]
176
357
has_overlaping_line = False
177
for col_line in column:
178
if not (col_line["min_index"] >= line["max_index"] or \
179
col_line["max_index"] <= line["min_index"]):
358
for row_index in line_range:
359
if column[row_index]:
180
360
has_overlaping_line = True
181
361
break
182
362
if not has_overlaping_line:
183
363
break
184
364
else:
185
365
col_index = len(columns)
186
columns.append([])
187
line["col_index"] = col_index
188
columns[col_index].append(line)
189
366
column = list(empty_column)
367
columns.append(column)
368
return col_index
190
369
370
def _mark_column_as_used(columns, col_index, line_range):
371
column = columns[col_index]
372
for row_index in line_range:
373
column[row_index] = True
191
374
192
375
def same_branch(a, b):
193
376
"""Return whether we think revisions a and b are on the same branch."""
Loggerhead is a web-based interface for Breezy
Version: 2.0.2.dev0