← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/missing.py

  • Committer: Martin Pool
  • Date: 2005-09-16 06:52:59 UTC
  • Revision ID: mbp@sourcefrog.net-20050916065259-714aeb37c2510699
- remove another test that tries to merge an imaginary parent

Show diffs side-by-side

added added

removed removed

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