~loggerhead-team/loggerhead/trunk-rich

« back to all changes in this revision

Viewing changes to loggerhead/wholehistory.py

  • Committer: Martin Albisetti
  • Date: 2008-07-29 22:00:33 UTC
  • mto: This revision was merged to the branch mainline in revision 188.
  • Revision ID: argentina@gmail.com-20080729220033-19d1u1rdn38hvo6w
Make sure you have all required dependencies before installing

Show diffs side-by-side

added added

removed removed

Lines of Context:
1
 
#
2
 
# Copyright (C) 2008, 2009 Canonical Ltd.
 
1
# Cache the whole history data needed by loggerhead about a branch.
3
2
#
4
3
# This program is free software; you can redistribute it and/or modify
5
4
# it under the terms of the GNU General Public License as published by
15
14
# along with this program; if not, write to the Free Software
16
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
17
16
#
18
 
"""Cache the whole history data needed by loggerhead about a branch."""
19
17
 
20
18
import logging
21
19
import time
39
37
 
40
38
 
41
39
def compute_whole_history_data(branch):
42
 
    """Compute _rev_info and _rev_indices for a branch.
43
 
 
44
 
    See History.__doc__ for what these data structures mean.
45
 
    """
46
40
    z = time.time()
47
41
 
48
42
    last_revid = branch.last_revision()
49
43
 
50
 
    log = logging.getLogger('loggerhead.%s' %
51
 
                            branch.get_config().get_nickname())
 
44
    log = logging.getLogger('loggerhead.%s' % (branch.nick,))
52
45
 
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))
56
49
 
57
50
    _revision_graph = _strip_NULL_ghosts(parent_map)
58
 
 
59
 
    _rev_info = []
60
 
    _rev_indices = {}
61
 
 
 
51
    _full_history = []
 
52
    _revision_info = {}
 
53
    _revno_revid = {}
62
54
    if is_null(last_revid):
63
55
        _merge_sort = []
64
56
    else:
65
57
        _merge_sort = merge_sort(
66
58
            _revision_graph, last_revid, generate_revno=True)
67
59
 
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)
 
66
 
 
67
    _where_merged = {}
74
68
 
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:
77
71
            continue
78
72
        for parent in _revision_graph[revid]:
79
 
            c = _rev_info[_rev_indices[parent]]
80
 
            if revid not in c[1]:
81
 
                c[1] = c[1] + (revid,)
82
 
 
83
 
    log.info('built revision graph cache: %r secs' % (time.time() - z))
84
 
 
85
 
    return (_rev_info, _rev_indices)
 
73
            _where_merged.setdefault(parent, set()).add(revid)
 
74
 
 
75
    log.info('built revision graph cache: %r secs' % (time.time() - z,))
 
76
 
 
77
    return (_revision_graph, _full_history, _revision_info,
 
78
            _revno_revid, _merge_sort, _where_merged)