← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/missing.py

  • Committer: Olaf Conradi
  • Date: 2006-03-28 23:30:02 UTC
  • mto: (1661.1.1 bzr.mbp.remember)
  • mto: This revision was merged to the branch mainline in revision 1663.
  • Revision ID: olaf@conradi.org-20060328233002-f6262df0e19c1963
Added testcases for using pull with --remember. Moved remember code to
beginning of cmd_pull. This remembers the location in case of a failure
during pull.

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/missing.py
1
 
"""\
2
 
A plugin for displaying what revisions are in 'other' but not in local.
3
 
"""
4
 
 
5
 
def show_missing(br_local, br_remote, verbose=False, quiet=False):
6
 
    """Show the revisions which exist in br_remote, that 
7
 
    do not exist in br_local.
8
 
    """
9
 
    from bzrlib.log import show_one_log
10
 
    import sys
11
 
    local_history = br_local.revision_history()
12
 
    remote_history = br_remote.revision_history()
13
 
    if local_history == remote_history:
14
 
        if not quiet:
15
 
            print 'Trees are identical.'
16
 
        return 0
17
 
    if local_history[:len(remote_history)] == remote_history:
18
 
        # Local is not missing anything from remote, so consider it
19
 
        # up-to-date
20
 
        if not quiet:
21
 
            print 'Local tree has all of remote revisions (remote is missing local)'
22
 
        return 0
23
 
    if quiet:
24
 
        return 1
25
 
 
26
 
    # Check for divergence
27
 
    common_idx = min(len(local_history), len(remote_history)) - 1
28
 
    if common_idx >= 0 and local_history[common_idx] != remote_history[common_idx]:
29
 
        print 'Trees have diverged'
30
 
 
31
 
    local_rev_set = set(local_history)
32
 
 
33
 
    # Find the last common revision between the two trees
34
 
    revno = 0
35
 
    for revno, (local_rev, remote_rev) in enumerate(zip(local_history, remote_history)):
36
 
        if local_rev != remote_rev:
37
 
            break
38
 
 
39
 
    missing_remote = []
40
 
    for rno, rev_id in enumerate(remote_history[revno:]):
41
 
        # This assumes that you can have a revision in the
42
 
        # local history, which does not have the same ancestry
43
 
        # as the remote ancestry.
44
 
        # This may or may not be possible.
45
 
        # In the future this should also checked for merged revisions.
46
 
        if rev_id not in local_rev_set:
47
 
            missing_remote.append((rno+revno+1, rev_id))
48
 
 
49
 
    print 'Missing %d revisions' %  len(missing_remote)
50
 
    print
51
 
 
52
 
    if verbose:
53
 
        from bzrlib.diff import compare_trees
54
 
        from bzrlib.tree import EmptyTree
55
 
        show_ids = True
56
 
        last_tree = EmptyTree
57
 
        last_rev_id = None
58
 
    else:
59
 
        show_ids = False
60
 
    for revno, rev_id in missing_remote:
61
 
        rev = br_remote.get_revision(rev_id)
 
1
"""Display what revisions are missing in 'other' from 'this' and vice verca."""
 
2
 
 
3
import bzrlib.ui as ui
 
4
 
 
5
 
 
6
def iter_log_data(revisions, revision_source, verbose):
 
7
    from bzrlib.diff import compare_trees
 
8
    from bzrlib.tree import EmptyTree
 
9
    last_tree = EmptyTree
 
10
    last_rev_id = None
 
11
    for revno, rev_id in revisions:
 
12
        rev = revision_source.get_revision(rev_id)
62
13
        if verbose:
63
 
            parent_rev_id = rev.parents[0].revision_id
 
14
            remote_tree = revision_source.revision_tree(rev_id)
 
15
            parent_rev_id = rev.parent_ids[0]
64
16
            if last_rev_id == parent_rev_id:
65
17
                parent_tree = last_tree
66
18
            else:
67
 
                parent_tree = br_remote.revision_tree(parent_rev_id)
68
 
            revision_tree = br_remote.revision_tree(rev_id)
 
19
                parent_tree = revision_source.revision_tree(parent_rev_id)
 
20
            revision_tree = revision_source.revision_tree(rev_id)
69
21
            last_rev_id = rev_id
70
22
            last_tree = revision_tree
71
23
            delta = compare_trees(revision_tree, parent_tree)
72
24
        else:
73
25
            delta = None
74
 
 
75
 
        show_one_log(revno, rev, delta, verbose, sys.stdout, 'original')
76
 
    return 1
77
 
 
 
26
        yield revno, rev, delta
 
27
 
 
28
 
 
29
def find_unmerged(local_branch, remote_branch):
 
30
    progress = ui.ui_factory.nested_progress_bar()
 
31
    local_branch.lock_read()
 
32
    try:
 
33
        remote_branch.lock_read()
 
34
        try:
 
35
            local_rev_history, local_rev_history_map = \
 
36
                _get_history(local_branch, progress, "local", 0)
 
37
            remote_rev_history, remote_rev_history_map = \
 
38
                _get_history(remote_branch, progress, "remote", 1)
 
39
            result = _shortcut(local_rev_history, remote_rev_history)
 
40
            if result is not None:
 
41
                local_extra, remote_extra = result
 
42
                local_extra = sorted_revisions(local_extra, 
 
43
                                               local_rev_history_map)
 
44
                remote_extra = sorted_revisions(remote_extra, 
 
45
                                                remote_rev_history_map)
 
46
                return local_extra, remote_extra
 
47
 
 
48
            local_ancestry = _get_ancestry(local_branch.repository, progress, 
 
49
                                           "local", 2, local_rev_history)
 
50
            remote_ancestry = _get_ancestry(remote_branch.repository, progress,
 
51
                                            "remote", 3, remote_rev_history)
 
52
            progress.update('pondering', 4, 5)
 
53
            extras = local_ancestry.symmetric_difference(remote_ancestry) 
 
54
            local_extra = extras.intersection(set(local_rev_history))
 
55
            remote_extra = extras.intersection(set(remote_rev_history))
 
56
            local_extra = sorted_revisions(local_extra, local_rev_history_map)
 
57
            remote_extra = sorted_revisions(remote_extra, 
 
58
                                            remote_rev_history_map)
 
59
                    
 
60
        finally:
 
61
            remote_branch.unlock()
 
62
    finally:
 
63
        local_branch.unlock()
 
64
        progress.finished()
 
65
    return (local_extra, remote_extra)
 
66
 
 
67
def _shortcut(local_rev_history, remote_rev_history):
 
68
    local_history = set(local_rev_history)
 
69
    remote_history = set(remote_rev_history)
 
70
    if len(local_rev_history) == 0:
 
71
        return set(), remote_history
 
72
    elif len(remote_rev_history) == 0:
 
73
        return local_history, set()
 
74
    elif local_rev_history[-1] in remote_history:
 
75
        return set(), _after(remote_rev_history, local_rev_history)
 
76
    elif remote_rev_history[-1] in local_history:
 
77
        return _after(local_rev_history, remote_rev_history), set()
 
78
    else:
 
79
        return None
 
80
 
 
81
def _after(larger_history, smaller_history):
 
82
    return set(larger_history[larger_history.index(smaller_history[-1])+1:])
 
83
 
 
84
def _get_history(branch, progress, label, step):
 
85
    progress.update('%s history' % label, step, 5)
 
86
    rev_history = branch.revision_history()
 
87
    rev_history_map = dict(
 
88
        [(rev, rev_history.index(rev) + 1)
 
89
         for rev in rev_history])
 
90
    return rev_history, rev_history_map
 
91
 
 
92
def _get_ancestry(repository, progress, label, step, rev_history):
 
93
    progress.update('%s ancestry' % label, step, 5)
 
94
    if len(rev_history) > 0:
 
95
        ancestry = set(repository.get_ancestry(rev_history[-1]))
 
96
    else:
 
97
        ancestry = set()
 
98
    return ancestry
 
99
    
 
100
 
 
101
def sorted_revisions(revisions, history_map):
 
102
    revisions = [(history_map[r],r) for r in revisions]
 
103
    revisions.sort()
 
104
    return revisions