1
# Copyright (C) 2005 Canonical Ltd
1
# (C) 2005 Canonical Ltd
3
3
# This program is free software; you can redistribute it and/or modify
4
4
# it under the terms of the GNU General Public License as published by
5
5
# the Free Software Foundation; either version 2 of the License, or
6
6
# (at your option) any later version.
8
8
# This program is distributed in the hope that it will be useful,
9
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
11
# GNU General Public License for more details.
13
13
# You should have received a copy of the GNU General Public License
14
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20
from bzrlib.selftest import TestCaseInTempDir
26
21
from bzrlib.branch import Branch
27
from bzrlib.errors import (
29
InvalidLineInBugsProperty,
32
from bzrlib.deprecated_graph import Graph
33
from bzrlib.revision import (find_present_ancestors,
35
from bzrlib.tests import TestCase, TestCaseWithTransport
22
from bzrlib.commit import commit
23
from bzrlib.fetch import fetch
24
from bzrlib.revision import (find_present_ancestors, combined_graph,
25
is_ancestor, MultipleRevisionSources)
36
26
from bzrlib.trace import mutter
37
from bzrlib.workingtree import WorkingTree
39
# We're allowed to test deprecated interfaces
40
warnings.filterwarnings('ignore',
41
'.*get_intervening_revisions was deprecated',
43
r'bzrlib\.tests\.test_revision')
45
# XXX: Make this a method of a merge base case
46
def make_branches(self, format=None):
27
from bzrlib.errors import NoSuchRevision
47
30
"""Create two branches
49
32
branch 1 has 6 commits, branch 2 has 3 commits
50
commit 10 is a ghosted merge merge from branch 1
33
commit 10 was a psuedo merge from branch 1
34
but has been disabled until ghost support is
52
37
the object graph is
57
42
b..3 a..3 merges b..4
59
44
b..5 a..5 merges b..5
62
47
so A is missing b6 at the start
63
48
and B is missing a3, a4, a5
65
tree1 = self.make_branch_and_tree("branch1", format=format)
68
tree1.commit("Commit one", rev_id="a@u-0-0")
69
tree1.commit("Commit two", rev_id="a@u-0-1")
70
tree1.commit("Commit three", rev_id="a@u-0-2")
72
tree2 = tree1.bzrdir.sprout("branch2").open_workingtree()
74
tree2.commit("Commit four", rev_id="b@u-0-3")
75
tree2.commit("Commit five", rev_id="b@u-0-4")
51
br1 = Branch.initialize("branch1")
53
commit(br1, "Commit one", rev_id="a@u-0-0")
54
commit(br1, "Commit two", rev_id="a@u-0-1")
55
commit(br1, "Commit three", rev_id="a@u-0-2")
58
br2 = Branch.initialize("branch2")
59
br2.update_revisions(br1)
60
commit(br2, "Commit four", rev_id="b@u-0-3")
61
commit(br2, "Commit five", rev_id="b@u-0-4")
76
62
revisions_2 = br2.revision_history()
77
self.assertEquals(revisions_2[-1], 'b@u-0-4')
79
tree1.merge_from_branch(br2)
80
tree1.commit("Commit six", rev_id="a@u-0-3")
81
tree1.commit("Commit seven", rev_id="a@u-0-4")
82
tree2.commit("Commit eight", rev_id="b@u-0-5")
83
self.assertEquals(br2.revision_history()[-1], 'b@u-0-5')
85
tree1.merge_from_branch(br2)
86
tree1.commit("Commit nine", rev_id="a@u-0-5")
87
# DO NOT MERGE HERE - we WANT a GHOST.
88
tree2.add_parent_tree_id(br1.revision_history()[4])
89
tree2.commit("Commit ten - ghost merge", rev_id="b@u-0-6")
64
fetch(from_branch=br2, to_branch=br1)
65
br1.add_pending_merge(revisions_2[4])
66
assert revisions_2[4] == 'b@u-0-4'
67
commit(br1, "Commit six", rev_id="a@u-0-3")
68
commit(br1, "Commit seven", rev_id="a@u-0-4")
69
commit(br2, "Commit eight", rev_id="b@u-0-5")
71
fetch(from_branch=br2, to_branch=br1)
72
br1.add_pending_merge(br2.revision_history()[5])
73
commit(br1, "Commit nine", rev_id="a@u-0-5")
74
# disabled - it makes testing fetch too hard,
75
# but can be easily reenabled (without the fetch
76
# when GHOSTS are supported. RBC 20050928
77
#fetch(from_branch=br1, to_branch=br2)
78
#br2.add_pending_merge(br1.revision_history()[4])
79
commit(br2, "Commit ten - no merge", rev_id="b@u-0-6")
81
#fetch(from_branch=br2, to_branch=br1)
94
class TestIsAncestor(TestCaseWithTransport):
86
class TestIsAncestor(TestCaseInTempDir):
96
87
def test_recorded_ancestry(self):
97
88
"""Test that commit records all ancestors"""
98
br1, br2 = make_branches(self)
89
br1, br2 = make_branches()
99
90
d = [('a@u-0-0', ['a@u-0-0']),
100
91
('a@u-0-1', ['a@u-0-0', 'a@u-0-1']),
101
92
('a@u-0-2', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2']),
124
115
if rev_id in br2_only and not branch is br2:
126
117
mutter('ancestry of {%s}: %r',
127
rev_id, branch.repository.get_ancestry(rev_id))
128
result = sorted(branch.repository.get_ancestry(rev_id))
129
self.assertEquals(result, [None] + sorted(anc))
132
class TestIntermediateRevisions(TestCaseWithTransport):
118
rev_id, branch.get_ancestry(rev_id))
119
self.assertEquals(sorted(branch.get_ancestry(rev_id)),
120
[None] + sorted(anc))
123
def test_is_ancestor(self):
124
"""Test checking whether a revision is an ancestor of another revision"""
125
br1, br2 = make_branches()
126
revisions = br1.revision_history()
127
revisions_2 = br2.revision_history()
130
assert is_ancestor(revisions[0], revisions[0], br1)
131
assert is_ancestor(revisions[1], revisions[0], sources)
132
assert not is_ancestor(revisions[0], revisions[1], sources)
133
assert is_ancestor(revisions_2[3], revisions[0], sources)
134
# disabled mbp 20050914, doesn't seem to happen anymore
135
## self.assertRaises(NoSuchRevision, is_ancestor, revisions_2[3],
136
## revisions[0], br1)
137
assert is_ancestor(revisions[3], revisions_2[4], sources)
138
assert is_ancestor(revisions[3], revisions_2[4], br1)
139
assert is_ancestor(revisions[3], revisions_2[3], sources)
140
## assert not is_ancestor(revisions[3], revisions_2[3], br1)
144
class TestIntermediateRevisions(TestCaseInTempDir):
135
TestCaseWithTransport.setUp(self)
136
self.br1, self.br2 = make_branches(self)
137
wt1 = self.br1.bzrdir.open_workingtree()
138
wt2 = self.br2.bzrdir.open_workingtree()
139
wt2.commit("Commit eleven", rev_id="b@u-0-7")
140
wt2.commit("Commit twelve", rev_id="b@u-0-8")
141
wt2.commit("Commit thirtteen", rev_id="b@u-0-9")
143
wt1.merge_from_branch(self.br2)
144
wt1.commit("Commit fourtten", rev_id="a@u-0-6")
146
wt2.merge_from_branch(self.br1)
147
wt2.commit("Commit fifteen", rev_id="b@u-0-10")
150
class MockRevisionSource(object):
151
"""A RevisionSource that takes a pregenerated graph.
153
This is useful for testing revision graph algorithms where
154
the actual branch existing is irrelevant.
157
def __init__(self, full_graph):
158
self._full_graph = full_graph
160
def get_revision_graph_with_ghosts(self, revision_ids):
161
# This is mocked out to just return a constant graph.
162
return self._full_graph
165
class TestCommonAncestor(TestCaseWithTransport):
147
from bzrlib.commit import commit
148
TestCaseInTempDir.setUp(self)
149
self.br1, self.br2 = make_branches()
151
self.br2.commit("Commit eleven", rev_id="b@u-0-7")
152
self.br2.commit("Commit twelve", rev_id="b@u-0-8")
153
self.br2.commit("Commit thirtteen", rev_id="b@u-0-9")
155
fetch(from_branch=self.br2, to_branch=self.br1)
156
self.br1.add_pending_merge(self.br2.revision_history()[6])
157
self.br1.commit("Commit fourtten", rev_id="a@u-0-6")
159
fetch(from_branch=self.br1, to_branch=self.br2)
160
self.br2.add_pending_merge(self.br1.revision_history()[6])
161
self.br2.commit("Commit fifteen", rev_id="b@u-0-10")
163
from bzrlib.revision import MultipleRevisionSources
164
self.sources = MultipleRevisionSources(self.br1, self.br2)
166
def intervene(self, ancestor, revision, revision_history=None):
167
from bzrlib.revision import get_intervening_revisions
168
return get_intervening_revisions(ancestor,revision, self.sources,
171
def test_intervene(self):
172
"""Find intermediate revisions, without requiring history"""
173
from bzrlib.errors import NotAncestor, NoSuchRevision
174
assert len(self.intervene('a@u-0-0', 'a@u-0-0')) == 0
175
self.assertEqual(self.intervene('a@u-0-0', 'a@u-0-1'), ['a@u-0-1'])
176
self.assertEqual(self.intervene('a@u-0-0', 'a@u-0-2'),
177
['a@u-0-1', 'a@u-0-2'])
178
self.assertEqual(self.intervene('a@u-0-0', 'b@u-0-3'),
179
['a@u-0-1', 'a@u-0-2', 'b@u-0-3'])
180
self.assertEqual(self.intervene('b@u-0-3', 'a@u-0-3'),
181
['b@u-0-4', 'a@u-0-3'])
182
self.assertEqual(self.intervene('a@u-0-2', 'a@u-0-3',
183
self.br1.revision_history()),
185
self.assertEqual(self.intervene('a@u-0-0', 'a@u-0-5',
186
self.br1.revision_history()),
187
['a@u-0-1', 'a@u-0-2', 'a@u-0-3', 'a@u-0-4',
189
print ("testrevision.py 191 - intervene appears to return b..6 even"
190
"though it is not reachable!")
191
# self.assertEqual(self.intervene('a@u-0-0', 'b@u-0-6',
192
# self.br1.revision_history()),
193
# ['a@u-0-1', 'a@u-0-2', 'a@u-0-3', 'a@u-0-4',
195
# self.assertEqual(self.intervene('a@u-0-0', 'b@u-0-5'),
196
# ['a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
198
self.assertEqual(self.intervene('b@u-0-3', 'b@u-0-6',
199
self.br2.revision_history()),
200
['b@u-0-4', 'b@u-0-5', 'b@u-0-6'])
201
self.assertEqual(self.intervene('b@u-0-6', 'b@u-0-10'),
202
['b@u-0-7', 'b@u-0-8', 'b@u-0-9', 'b@u-0-10'])
203
self.assertEqual(self.intervene('b@u-0-6', 'b@u-0-10',
204
self.br2.revision_history()),
205
['b@u-0-7', 'b@u-0-8', 'b@u-0-9', 'b@u-0-10'])
206
self.assertRaises(NotAncestor, self.intervene, 'b@u-0-10', 'b@u-0-6',
207
self.br2.revision_history())
208
self.assertRaises(NoSuchRevision, self.intervene, 'c@u-0-10',
209
'b@u-0-6', self.br2.revision_history())
210
self.assertRaises(NoSuchRevision, self.intervene, 'b@u-0-10',
211
'c@u-0-6', self.br2.revision_history())
214
class TestCommonAncestor(TestCaseInTempDir):
166
215
"""Test checking whether a revision is an ancestor of another revision"""
168
def test_get_history(self):
169
# TODO: test ghosts on the left hand branch's impact
170
# TODO: test ghosts on all parents, we should get some
171
# indicator. i.e. NULL_REVISION
173
tree = self.make_branch_and_tree('.')
174
tree.commit('1', rev_id = '1', allow_pointless=True)
175
tree.commit('2', rev_id = '2', allow_pointless=True)
176
tree.commit('3', rev_id = '3', allow_pointless=True)
177
rev = tree.branch.repository.get_revision('1')
178
history = rev.get_history(tree.branch.repository)
179
self.assertEqual([None, '1'], history)
180
rev = tree.branch.repository.get_revision('2')
181
history = rev.get_history(tree.branch.repository)
182
self.assertEqual([None, '1', '2'], history)
183
rev = tree.branch.repository.get_revision('3')
184
history = rev.get_history(tree.branch.repository)
185
self.assertEqual([None, '1', '2' ,'3'], history)
188
class TestReservedId(TestCase):
190
def test_is_reserved_id(self):
191
self.assertEqual(True, revision.is_reserved_id(NULL_REVISION))
192
self.assertEqual(True, revision.is_reserved_id(
193
revision.CURRENT_REVISION))
194
self.assertEqual(True, revision.is_reserved_id('arch:'))
195
self.assertEqual(False, revision.is_reserved_id('null'))
196
self.assertEqual(False, revision.is_reserved_id(
197
'arch:a@example.com/c--b--v--r'))
198
self.assertEqual(False, revision.is_reserved_id(None))
201
class TestRevisionMethods(TestCase):
203
def test_get_summary(self):
204
r = revision.Revision('1')
206
self.assertEqual('a', r.get_summary())
208
self.assertEqual('a', r.get_summary())
210
self.assertEqual('a', r.get_summary())
212
self.assertEqual('', r.get_summary())
214
def test_get_apparent_authors(self):
215
r = revision.Revision('1')
217
self.assertEqual(['A'], r.get_apparent_authors())
218
r.properties['author'] = 'B'
219
self.assertEqual(['B'], r.get_apparent_authors())
220
r.properties['authors'] = 'C\nD'
221
self.assertEqual(['C', 'D'], r.get_apparent_authors())
223
def test_get_apparent_authors_no_committer(self):
224
r = revision.Revision('1')
225
self.assertEqual([], r.get_apparent_authors())
228
class TestRevisionBugs(TestCase):
229
"""Tests for getting the bugs that a revision is linked to."""
231
def test_no_bugs(self):
232
r = revision.Revision('1')
233
self.assertEqual([], list(r.iter_bugs()))
235
def test_some_bugs(self):
236
r = revision.Revision(
238
'bugs': bugtracker.encode_fixes_bug_urls(
239
['http://example.com/bugs/1',
240
'http://launchpad.net/bugs/1234'])})
242
[('http://example.com/bugs/1', bugtracker.FIXED),
243
('http://launchpad.net/bugs/1234', bugtracker.FIXED)],
246
def test_no_status(self):
247
r = revision.Revision(
248
'1', properties={'bugs': 'http://example.com/bugs/1'})
249
self.assertRaises(InvalidLineInBugsProperty, list, r.iter_bugs())
251
def test_too_much_information(self):
252
r = revision.Revision(
253
'1', properties={'bugs': 'http://example.com/bugs/1 fixed bar'})
254
self.assertRaises(InvalidLineInBugsProperty, list, r.iter_bugs())
256
def test_invalid_status(self):
257
r = revision.Revision(
258
'1', properties={'bugs': 'http://example.com/bugs/1 faxed'})
259
self.assertRaises(InvalidBugStatus, list, r.iter_bugs())
217
def test_old_common_ancestor(self):
218
"""Pick a resonable merge base using the old functionality"""
219
from bzrlib.revision import old_common_ancestor as common_ancestor
220
br1, br2 = make_branches()
221
revisions = br1.revision_history()
222
revisions_2 = br2.revision_history()
225
expected_ancestors_list = {revisions[3]:(0, 0),
227
revisions_2[4]:(2, 1),
229
revisions_2[3]:(4, 2),
230
revisions[0]:(5, 3) }
231
ancestors_list = find_present_ancestors(revisions[3], sources)
232
assert len(expected_ancestors_list) == len(ancestors_list)
233
for key, value in expected_ancestors_list.iteritems():
234
self.assertEqual(ancestors_list[key], value,
235
"key %r, %r != %r" % (key, ancestors_list[key],
238
self.assertEqual(common_ancestor(revisions[0], revisions[0], sources),
240
self.assertEqual(common_ancestor(revisions[1], revisions[2], sources),
242
self.assertEqual(common_ancestor(revisions[1], revisions[1], sources),
244
self.assertEqual(common_ancestor(revisions[2], revisions_2[4], sources),
246
self.assertEqual(common_ancestor(revisions[3], revisions_2[4], sources),
248
self.assertEqual(common_ancestor(revisions[4], revisions_2[5], sources),
250
fetch(from_branch=br2, to_branch=br1)
251
self.assertEqual(common_ancestor(revisions[5], revisions_2[6], sources),
253
self.assertEqual(common_ancestor(revisions_2[6], revisions[5], sources),
256
def test_common_ancestor(self):
257
"""Pick a reasonable merge base"""
258
from bzrlib.revision import common_ancestor
259
br1, br2 = make_branches()
260
revisions = br1.revision_history()
261
revisions_2 = br2.revision_history()
262
sources = MultipleRevisionSources(br1, br2)
264
expected_ancestors_list = {revisions[3]:(0, 0),
266
revisions_2[4]:(2, 1),
268
revisions_2[3]:(4, 2),
269
revisions[0]:(5, 3) }
270
ancestors_list = find_present_ancestors(revisions[3], sources)
271
assert len(expected_ancestors_list) == len(ancestors_list)
272
for key, value in expected_ancestors_list.iteritems():
273
self.assertEqual(ancestors_list[key], value,
274
"key %r, %r != %r" % (key, ancestors_list[key],
277
self.assertEqual(common_ancestor(revisions[0], revisions[0], sources),
279
self.assertEqual(common_ancestor(revisions[1], revisions[2], sources),
281
self.assertEqual(common_ancestor(revisions[1], revisions[1], sources),
283
self.assertEqual(common_ancestor(revisions[2], revisions_2[4], sources),
285
self.assertEqual(common_ancestor(revisions[3], revisions_2[4], sources),
287
self.assertEqual(common_ancestor(revisions[4], revisions_2[5], sources),
289
self.assertEqual(common_ancestor(revisions[5], revisions_2[6], sources),
291
self.assertEqual(common_ancestor(revisions_2[6], revisions[5], sources),
294
def test_combined(self):
296
Ensure it's not order-sensitive
298
br1, br2 = make_branches()
299
source = MultipleRevisionSources(br1, br2)
300
combined_1 = combined_graph(br1.last_revision(),
301
br2.last_revision(), source)
302
combined_2 = combined_graph(br2.last_revision(),
303
br1.last_revision(), source)
304
assert combined_1[1] == combined_2[1]
305
assert combined_1[2] == combined_2[2]
306
assert combined_1[3] == combined_2[3]
307
assert combined_1 == combined_2
added
removed
bzrlib/selftest/testrevision.py
