2
A plugin for displaying what revisions are in 'other' but not in local.
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.
9
from bzrlib.log import show_one_log
11
local_history = br_local.revision_history()
12
remote_history = br_remote.revision_history()
13
if local_history == remote_history:
15
print 'Trees are identical.'
17
if local_history[:len(remote_history)] == remote_history:
18
# Local is not missing anything from remote, so consider it
21
print 'Local tree has all of remote revisions (remote is missing local)'
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'
31
local_rev_set = set(local_history)
33
# Find the last common revision between the two trees
35
for revno, (local_rev, remote_rev) in enumerate(zip(local_history, remote_history)):
36
if local_rev != remote_rev:
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))
49
print 'Missing %d revisions' % len(missing_remote)
53
from bzrlib.diff import compare_trees
54
from bzrlib.tree import EmptyTree
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 versa."""
6
def iter_log_data(revisions, revision_source, verbose):
7
last_tree = revision_source.revision_tree(None)
9
for revno, rev_id in revisions:
10
rev = revision_source.get_revision(rev_id)
12
remote_tree = revision_source.revision_tree(rev_id)
63
13
parent_rev_id = rev.parent_ids[0]
64
14
if last_rev_id == parent_rev_id:
65
15
parent_tree = last_tree
67
parent_tree = br_remote.revision_tree(parent_rev_id)
68
revision_tree = br_remote.revision_tree(rev_id)
17
parent_tree = revision_source.revision_tree(parent_rev_id)
18
revision_tree = revision_source.revision_tree(rev_id)
69
19
last_rev_id = rev_id
70
20
last_tree = revision_tree
71
delta = compare_trees(revision_tree, parent_tree)
21
delta = parent_tree.changes_from(revision_tree)
75
show_one_log(revno, rev, delta, verbose, sys.stdout, 'original')
24
yield revno, rev, delta
27
def find_unmerged(local_branch, remote_branch):
28
progress = ui.ui_factory.nested_progress_bar()
29
local_branch.lock_read()
31
remote_branch.lock_read()
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
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)
59
remote_branch.unlock()
63
return (local_extra, remote_extra)
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()
79
def _after(larger_history, smaller_history):
80
return set(larger_history[larger_history.index(smaller_history[-1])+1:])
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
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]))
99
def sorted_revisions(revisions, history_map):
100
revisions = [(history_map[r],r) for r in revisions]
added
removed
bzrlib/missing.py
