1
# Copyright (C) 2005 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24
from bzrlib.branch import Branch
25
from bzrlib.errors import NoSuchRevision
26
from bzrlib.deprecated_graph import Graph
27
from bzrlib.revision import (find_present_ancestors, combined_graph,
29
is_ancestor, MultipleRevisionSources,
31
from bzrlib.tests import TestCase, TestCaseWithTransport
32
from bzrlib.trace import mutter
33
from bzrlib.workingtree import WorkingTree
35
# We're allowed to test deprecated interfaces
36
warnings.filterwarnings('ignore',
37
'.*get_intervening_revisions was deprecated',
39
r'bzrlib\.tests\.test_revision')
41
# XXX: Make this a method of a merge base case
42
def make_branches(self):
43
"""Create two branches
45
branch 1 has 6 commits, branch 2 has 3 commits
46
commit 10 is a ghosted merge merge from branch 1
58
so A is missing b6 at the start
59
and B is missing a3, a4, a5
61
tree1 = self.make_branch_and_tree("branch1")
64
tree1.commit("Commit one", rev_id="a@u-0-0")
65
tree1.commit("Commit two", rev_id="a@u-0-1")
66
tree1.commit("Commit three", rev_id="a@u-0-2")
68
tree2 = tree1.bzrdir.clone("branch2").open_workingtree()
70
tree2.commit("Commit four", rev_id="b@u-0-3")
71
tree2.commit("Commit five", rev_id="b@u-0-4")
72
revisions_2 = br2.revision_history()
73
self.assertEquals(revisions_2[-1], 'b@u-0-4')
75
tree1.merge_from_branch(br2)
76
tree1.commit("Commit six", rev_id="a@u-0-3")
77
tree1.commit("Commit seven", rev_id="a@u-0-4")
78
tree2.commit("Commit eight", rev_id="b@u-0-5")
79
self.assertEquals(br2.revision_history()[-1], 'b@u-0-5')
81
tree1.merge_from_branch(br2)
82
tree1.commit("Commit nine", rev_id="a@u-0-5")
83
# DO NOT MERGE HERE - we WANT a GHOST.
84
tree2.add_parent_tree_id(br1.revision_history()[4])
85
tree2.commit("Commit ten - ghost merge", rev_id="b@u-0-6")
90
class TestIsAncestor(TestCaseWithTransport):
92
def test_recorded_ancestry(self):
93
"""Test that commit records all ancestors"""
94
br1, br2 = make_branches(self)
95
d = [('a@u-0-0', ['a@u-0-0']),
96
('a@u-0-1', ['a@u-0-0', 'a@u-0-1']),
97
('a@u-0-2', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2']),
98
('b@u-0-3', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3']),
99
('b@u-0-4', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3',
101
('a@u-0-3', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
103
('a@u-0-4', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
104
'a@u-0-3', 'a@u-0-4']),
105
('b@u-0-5', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
107
('a@u-0-5', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'a@u-0-3', 'a@u-0-4',
108
'b@u-0-3', 'b@u-0-4',
109
'b@u-0-5', 'a@u-0-5']),
110
('b@u-0-6', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2',
111
'b@u-0-3', 'b@u-0-4',
112
'b@u-0-5', 'b@u-0-6']),
114
br1_only = ('a@u-0-3', 'a@u-0-4', 'a@u-0-5')
115
br2_only = ('b@u-0-6',)
116
for branch in br1, br2:
117
for rev_id, anc in d:
118
if rev_id in br1_only and not branch is br1:
120
if rev_id in br2_only and not branch is br2:
122
mutter('ancestry of {%s}: %r',
123
rev_id, branch.repository.get_ancestry(rev_id))
124
result = sorted(branch.repository.get_ancestry(rev_id))
125
self.assertEquals(result, [None] + sorted(anc))
128
def test_is_ancestor(self):
129
"""Test checking whether a revision is an ancestor of another revision"""
130
br1, br2 = make_branches(self)
131
revisions = br1.revision_history()
132
revisions_2 = br2.revision_history()
135
self.assert_(is_ancestor(revisions[0], revisions[0], br1))
136
self.assert_(is_ancestor(revisions[1], revisions[0], sources))
137
self.assert_(not is_ancestor(revisions[0], revisions[1], sources))
138
self.assert_(is_ancestor(revisions_2[3], revisions[0], sources))
139
# disabled mbp 20050914, doesn't seem to happen anymore
140
## self.assertRaises(NoSuchRevision, is_ancestor, revisions_2[3],
141
## revisions[0], br1)
142
self.assert_(is_ancestor(revisions[3], revisions_2[4], sources))
143
self.assert_(is_ancestor(revisions[3], revisions_2[4], br1))
144
self.assert_(is_ancestor(revisions[3], revisions_2[3], sources))
145
## self.assert_(not is_ancestor(revisions[3], revisions_2[3], br1))
148
class TestIntermediateRevisions(TestCaseWithTransport):
151
TestCaseWithTransport.setUp(self)
152
self.br1, self.br2 = make_branches(self)
153
wt1 = self.br1.bzrdir.open_workingtree()
154
wt2 = self.br2.bzrdir.open_workingtree()
155
wt2.commit("Commit eleven", rev_id="b@u-0-7")
156
wt2.commit("Commit twelve", rev_id="b@u-0-8")
157
wt2.commit("Commit thirtteen", rev_id="b@u-0-9")
159
wt1.merge_from_branch(self.br2)
160
wt1.commit("Commit fourtten", rev_id="a@u-0-6")
162
wt2.merge_from_branch(self.br1)
163
wt2.commit("Commit fifteen", rev_id="b@u-0-10")
165
from bzrlib.revision import MultipleRevisionSources
166
self.sources = MultipleRevisionSources(self.br1.repository,
171
class MockRevisionSource(object):
172
"""A RevisionSource that takes a pregenerated graph.
174
This is useful for testing revision graph algorithms where
175
the actual branch existing is irrelevant.
178
def __init__(self, full_graph):
179
self._full_graph = full_graph
181
def get_revision_graph_with_ghosts(self, revision_ids):
182
# This is mocked out to just return a constant graph.
183
return self._full_graph
186
class TestCommonAncestor(TestCaseWithTransport):
187
"""Test checking whether a revision is an ancestor of another revision"""
189
def test_common_ancestor(self):
190
"""Pick a reasonable merge base"""
191
br1, br2 = make_branches(self)
192
revisions = br1.revision_history()
193
revisions_2 = br2.revision_history()
194
sources = MultipleRevisionSources(br1.repository, br2.repository)
195
expected_ancestors_list = {revisions[3]:(0, 0),
197
revisions_2[4]:(2, 1),
199
revisions_2[3]:(4, 2),
200
revisions[0]:(5, 3) }
201
ancestors_list = find_present_ancestors(revisions[3], sources)
202
self.assertEquals(len(expected_ancestors_list), len(ancestors_list))
203
for key, value in expected_ancestors_list.iteritems():
204
self.assertEqual(ancestors_list[key], value,
205
"key %r, %r != %r" % (key, ancestors_list[key],
207
self.assertEqual(common_ancestor(revisions[0], revisions[0], sources),
209
self.assertEqual(common_ancestor(revisions[1], revisions[2], sources),
211
self.assertEqual(common_ancestor(revisions[1], revisions[1], sources),
213
self.assertEqual(common_ancestor(revisions[2], revisions_2[4], sources),
215
self.assertEqual(common_ancestor(revisions[3], revisions_2[4], sources),
217
self.assertEqual(common_ancestor(revisions[4], revisions_2[5], sources),
219
self.assertTrue(common_ancestor(revisions[5], revisions_2[6], sources) in
220
(revisions[4], revisions_2[5]))
221
self.assertTrue(common_ancestor(revisions_2[6], revisions[5], sources),
222
(revisions[4], revisions_2[5]))
223
self.assertEqual(None, common_ancestor(None, revisions[5], sources))
224
self.assertEqual(NULL_REVISION,
225
common_ancestor(NULL_REVISION, NULL_REVISION, sources))
226
self.assertEqual(NULL_REVISION,
227
common_ancestor(revisions[0], NULL_REVISION, sources))
228
self.assertEqual(NULL_REVISION,
229
common_ancestor(NULL_REVISION, revisions[0], sources))
231
def test_combined(self):
233
Ensure it's not order-sensitive
235
br1, br2 = make_branches(self)
236
source = MultipleRevisionSources(br1.repository, br2.repository)
237
combined_1 = combined_graph(br1.last_revision(),
238
br2.last_revision(), source)
239
combined_2 = combined_graph(br2.last_revision(),
240
br1.last_revision(), source)
241
self.assertEquals(combined_1[1], combined_2[1])
242
self.assertEquals(combined_1[2], combined_2[2])
243
self.assertEquals(combined_1[3], combined_2[3])
244
self.assertEquals(combined_1, combined_2)
246
def test_get_history(self):
247
# TODO: test ghosts on the left hand branch's impact
248
# TODO: test ghosts on all parents, we should get some
249
# indicator. i.e. NULL_REVISION
251
tree = self.make_branch_and_tree('.')
252
tree.commit('1', rev_id = '1', allow_pointless=True)
253
tree.commit('2', rev_id = '2', allow_pointless=True)
254
tree.commit('3', rev_id = '3', allow_pointless=True)
255
rev = tree.branch.repository.get_revision('1')
256
history = rev.get_history(tree.branch.repository)
257
self.assertEqual([None, '1'], history)
258
rev = tree.branch.repository.get_revision('2')
259
history = rev.get_history(tree.branch.repository)
260
self.assertEqual([None, '1', '2'], history)
261
rev = tree.branch.repository.get_revision('3')
262
history = rev.get_history(tree.branch.repository)
263
self.assertEqual([None, '1', '2' ,'3'], history)
265
def test_common_ancestor_rootless_graph(self):
266
# common_ancestor on a graph with no reachable roots - only
267
# ghosts - should still return a useful value.
269
# add a ghost node which would be a root if it wasn't a ghost.
270
graph.add_ghost('a_ghost')
271
# add a normal commit on top of that
272
graph.add_node('rev1', ['a_ghost'])
273
# add a left-branch revision
274
graph.add_node('left', ['rev1'])
275
# add a right-branch revision
276
graph.add_node('right', ['rev1'])
277
source = MockRevisionSource(graph)
278
self.assertEqual('rev1', common_ancestor('left', 'right', source))
281
class TestMultipleRevisionSources(TestCaseWithTransport):
282
"""Tests for the MultipleRevisionSources adapter."""
284
def test_get_revision_graph_merges_ghosts(self):
285
# when we ask for the revision graph for B, which
286
# is in repo 1 with a ghost of A, and which is not
287
# in repo 2, which has A, the revision_graph()
288
# should return A and B both.
289
tree_1 = self.make_branch_and_tree('1')
290
tree_1.set_parent_ids(['A'], allow_leftmost_as_ghost=True)
291
tree_1.commit('foo', rev_id='B', allow_pointless=True)
292
tree_2 = self.make_branch_and_tree('2')
293
tree_2.commit('bar', rev_id='A', allow_pointless=True)
294
source = MultipleRevisionSources(tree_1.branch.repository,
295
tree_2.branch.repository)
296
self.assertEqual({'B':['A'],
298
source.get_revision_graph('B'))
301
class TestReservedId(TestCase):
303
def test_is_reserved_id(self):
304
self.assertEqual(True, revision.is_reserved_id(NULL_REVISION))
305
self.assertEqual(True, revision.is_reserved_id(
306
revision.CURRENT_REVISION))
307
self.assertEqual(True, revision.is_reserved_id('arch:'))
308
self.assertEqual(False, revision.is_reserved_id('null'))
309
self.assertEqual(False, revision.is_reserved_id(
310
'arch:a@example.com/c--b--v--r'))
311
self.assertEqual(False, revision.is_reserved_id(None))
added
removed
bzrlib/tests/test_revision.py
