41
39
def compute_whole_history_data(branch):
42
"""Compute _rev_info and _rev_indices for a branch.
44
See History.__doc__ for what these data structures mean.
48
42
last_revid = branch.last_revision()
50
log = logging.getLogger('loggerhead.%s' %
51
branch.get_config().get_nickname())
44
log = logging.getLogger('loggerhead.%s' % (branch.nick,))
53
46
graph = branch.repository.get_graph()
54
47
parent_map = dict(((key, value) for key, value in
55
48
graph.iter_ancestry([last_revid]) if value is not None))
57
50
_revision_graph = _strip_NULL_ghosts(parent_map)
62
54
if is_null(last_revid):
65
57
_merge_sort = merge_sort(
66
58
_revision_graph, last_revid, generate_revno=True)
68
for info in _merge_sort:
69
seq, revid, merge_depth, revno, end_of_merge = info
60
for (seq, revid, merge_depth, revno, end_of_merge) in _merge_sort:
61
_full_history.append(revid)
70
62
revno_str = '.'.join(str(n) for n in revno)
71
parents = _revision_graph[revid]
72
_rev_indices[revid] = len(_rev_info)
73
_rev_info.append([(seq, revid, merge_depth, revno_str, end_of_merge), (), parents])
63
_revno_revid[revno_str] = revid
64
_revision_info[revid] = (
65
seq, revid, merge_depth, revno_str, end_of_merge)
75
69
for revid in _revision_graph.keys():
76
if _rev_info[_rev_indices[revid]][0][2] == 0:
70
if _revision_info[revid][2] == 0:
78
72
for parent in _revision_graph[revid]:
79
c = _rev_info[_rev_indices[parent]]
81
c[1] = c[1] + (revid,)
83
log.info('built revision graph cache: %r secs' % (time.time() - z))
85
return (_rev_info, _rev_indices)
73
_where_merged.setdefault(parent, set()).add(revid)
75
log.info('built revision graph cache: %r secs' % (time.time() - z,))
77
return (_revision_graph, _full_history, _revision_info,
78
_revno_revid, _merge_sort, _where_merged)