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
25
from bzrlib.branch import Branch
26
from bzrlib.errors import NoSuchRevision
27
from bzrlib.deprecated_graph import Graph
28
from bzrlib.revision import (find_present_ancestors, combined_graph,
30
MultipleRevisionSources,
32
from bzrlib.symbol_versioning import one_three
33
from bzrlib.tests import TestCase, TestCaseWithTransport
34
from bzrlib.trace import mutter
35
from bzrlib.workingtree import WorkingTree
37
# We're allowed to test deprecated interfaces
38
warnings.filterwarnings('ignore',
39
'.*get_intervening_revisions was deprecated',
41
r'bzrlib\.tests\.test_revision')
43
# XXX: Make this a method of a merge base case
44
def make_branches(self, format=None):
45
"""Create two branches
47
branch 1 has 6 commits, branch 2 has 3 commits
48
commit 10 is a ghosted merge merge from branch 1
60
so A is missing b6 at the start
61
and B is missing a3, a4, a5
63
tree1 = self.make_branch_and_tree("branch1", format=format)
66
tree1.commit("Commit one", rev_id="a@u-0-0")
67
tree1.commit("Commit two", rev_id="a@u-0-1")
68
tree1.commit("Commit three", rev_id="a@u-0-2")
70
tree2 = tree1.bzrdir.clone("branch2").open_workingtree()
72
tree2.commit("Commit four", rev_id="b@u-0-3")
73
tree2.commit("Commit five", rev_id="b@u-0-4")
74
revisions_2 = br2.revision_history()
75
self.assertEquals(revisions_2[-1], 'b@u-0-4')
77
tree1.merge_from_branch(br2)
78
tree1.commit("Commit six", rev_id="a@u-0-3")
79
tree1.commit("Commit seven", rev_id="a@u-0-4")
80
tree2.commit("Commit eight", rev_id="b@u-0-5")
81
self.assertEquals(br2.revision_history()[-1], 'b@u-0-5')
83
tree1.merge_from_branch(br2)
84
tree1.commit("Commit nine", rev_id="a@u-0-5")
85
# DO NOT MERGE HERE - we WANT a GHOST.
86
tree2.add_parent_tree_id(br1.revision_history()[4])
87
tree2.commit("Commit ten - ghost merge", rev_id="b@u-0-6")
92
class TestIsAncestor(TestCaseWithTransport):
94
def test_recorded_ancestry(self):
95
"""Test that commit records all ancestors"""
96
br1, br2 = make_branches(self)
97
d = [('a@u-0-0', ['a@u-0-0']),
98
('a@u-0-1', ['a@u-0-0', 'a@u-0-1']),
99
('a@u-0-2', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2']),
100
('b@u-0-3', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3']),
101
('b@u-0-4', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3',
103
('a@u-0-3', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
105
('a@u-0-4', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
106
'a@u-0-3', 'a@u-0-4']),
107
('b@u-0-5', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
109
('a@u-0-5', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'a@u-0-3', 'a@u-0-4',
110
'b@u-0-3', 'b@u-0-4',
111
'b@u-0-5', 'a@u-0-5']),
112
('b@u-0-6', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2',
113
'b@u-0-3', 'b@u-0-4',
114
'b@u-0-5', 'b@u-0-6']),
116
br1_only = ('a@u-0-3', 'a@u-0-4', 'a@u-0-5')
117
br2_only = ('b@u-0-6',)
118
for branch in br1, br2:
119
for rev_id, anc in d:
120
if rev_id in br1_only and not branch is br1:
122
if rev_id in br2_only and not branch is br2:
124
mutter('ancestry of {%s}: %r',
125
rev_id, branch.repository.get_ancestry(rev_id))
126
result = sorted(branch.repository.get_ancestry(rev_id))
127
self.assertEquals(result, [None] + sorted(anc))
130
class TestIntermediateRevisions(TestCaseWithTransport):
133
TestCaseWithTransport.setUp(self)
134
self.br1, self.br2 = make_branches(self)
135
wt1 = self.br1.bzrdir.open_workingtree()
136
wt2 = self.br2.bzrdir.open_workingtree()
137
wt2.commit("Commit eleven", rev_id="b@u-0-7")
138
wt2.commit("Commit twelve", rev_id="b@u-0-8")
139
wt2.commit("Commit thirtteen", rev_id="b@u-0-9")
141
wt1.merge_from_branch(self.br2)
142
wt1.commit("Commit fourtten", rev_id="a@u-0-6")
144
wt2.merge_from_branch(self.br1)
145
wt2.commit("Commit fifteen", rev_id="b@u-0-10")
147
from bzrlib.revision import MultipleRevisionSources
148
self.sources = self.applyDeprecated(one_three,
149
MultipleRevisionSources, self.br1.repository,
154
class MockRevisionSource(object):
155
"""A RevisionSource that takes a pregenerated graph.
157
This is useful for testing revision graph algorithms where
158
the actual branch existing is irrelevant.
161
def __init__(self, full_graph):
162
self._full_graph = full_graph
164
def get_revision_graph_with_ghosts(self, revision_ids):
165
# This is mocked out to just return a constant graph.
166
return self._full_graph
169
class TestCommonAncestor(TestCaseWithTransport):
170
"""Test checking whether a revision is an ancestor of another revision"""
172
def assertCommonAncestorEqual(self, expected, sources, rev_a, rev_b):
173
self.assertEqual(expected,
174
self.applyDeprecated(one_three,
175
common_ancestor, rev_a, rev_b, sources))
177
def assertCommonAncestorIn(self, possible, sources, rev_a, rev_b):
178
"""assert that we pick one among multiple possible common ancestors"""
179
self.assertTrue(self.applyDeprecated(one_three,
180
common_ancestor, rev_a, rev_b, sources)
183
def test_common_ancestor(self):
184
"""Pick a reasonable merge base"""
185
br1, br2 = make_branches(self)
186
revisions = br1.revision_history()
187
revisions_2 = br2.revision_history()
188
sources = self.applyDeprecated(one_three,
189
MultipleRevisionSources, br1.repository, br2.repository)
190
expected_ancestors_list = {revisions[3]:(0, 0),
192
revisions_2[4]:(2, 1),
194
revisions_2[3]:(4, 2),
195
revisions[0]:(5, 3) }
196
ancestors_list = find_present_ancestors(revisions[3], sources)
197
self.assertEquals(len(expected_ancestors_list), len(ancestors_list))
198
for key, value in expected_ancestors_list.iteritems():
199
self.assertEqual(ancestors_list[key], value,
200
"key %r, %r != %r" % (key, ancestors_list[key],
202
self.assertCommonAncestorEqual(revisions[0], sources,
203
revisions[0], revisions[0])
204
self.assertCommonAncestorEqual(revisions[1], sources,
205
revisions[1], revisions[2])
206
self.assertCommonAncestorEqual(revisions[1], sources,
207
revisions[1], revisions[1])
208
self.assertCommonAncestorEqual(revisions[2], sources,
209
revisions[2], revisions_2[4])
210
self.assertCommonAncestorEqual(revisions_2[4], sources,
211
revisions[3], revisions_2[4])
212
self.assertCommonAncestorEqual(revisions_2[4], sources,
213
revisions[4], revisions_2[5])
214
self.assertCommonAncestorIn((revisions[4], revisions_2[5]), sources,
215
revisions[5], revisions_2[6])
216
self.assertCommonAncestorIn((revisions[4], revisions_2[5]), sources,
217
revisions_2[6], revisions[5])
218
self.assertCommonAncestorEqual(None, sources,
220
self.assertCommonAncestorEqual(NULL_REVISION, sources,
221
NULL_REVISION, NULL_REVISION)
222
self.assertCommonAncestorEqual(NULL_REVISION, sources,
223
revisions[0], NULL_REVISION)
224
self.assertCommonAncestorEqual(NULL_REVISION, sources,
225
NULL_REVISION, revisions[0])
227
def test_combined(self):
229
Ensure it's not order-sensitive
231
br1, br2 = make_branches(self)
232
source = self.applyDeprecated(one_three,
233
MultipleRevisionSources, br1.repository, br2.repository)
234
combined_1 = self.applyDeprecated(one_three,
235
combined_graph, br1.last_revision(),
236
br2.last_revision(), source)
237
combined_2 = self.applyDeprecated(one_three,
238
combined_graph, br2.last_revision(),
239
br1.last_revision(), source)
240
self.assertEquals(combined_1[1], combined_2[1])
241
self.assertEquals(combined_1[2], combined_2[2])
242
self.assertEquals(combined_1[3], combined_2[3])
243
self.assertEquals(combined_1, combined_2)
245
def test_get_history(self):
246
# TODO: test ghosts on the left hand branch's impact
247
# TODO: test ghosts on all parents, we should get some
248
# indicator. i.e. NULL_REVISION
250
tree = self.make_branch_and_tree('.')
251
tree.commit('1', rev_id = '1', allow_pointless=True)
252
tree.commit('2', rev_id = '2', allow_pointless=True)
253
tree.commit('3', rev_id = '3', allow_pointless=True)
254
rev = tree.branch.repository.get_revision('1')
255
history = rev.get_history(tree.branch.repository)
256
self.assertEqual([None, '1'], history)
257
rev = tree.branch.repository.get_revision('2')
258
history = rev.get_history(tree.branch.repository)
259
self.assertEqual([None, '1', '2'], history)
260
rev = tree.branch.repository.get_revision('3')
261
history = rev.get_history(tree.branch.repository)
262
self.assertEqual([None, '1', '2' ,'3'], history)
264
def test_common_ancestor_rootless_graph(self):
265
# common_ancestor on a graph with no reachable roots - only
266
# ghosts - should still return a useful value.
268
# add a ghost node which would be a root if it wasn't a ghost.
269
graph.add_ghost('a_ghost')
270
# add a normal commit on top of that
271
graph.add_node('rev1', ['a_ghost'])
272
# add a left-branch revision
273
graph.add_node('left', ['rev1'])
274
# add a right-branch revision
275
graph.add_node('right', ['rev1'])
276
source = MockRevisionSource(graph)
277
self.assertCommonAncestorEqual('rev1', source, 'left', 'right')
280
class TestMultipleRevisionSources(TestCaseWithTransport):
281
"""Tests for the MultipleRevisionSources adapter."""
283
def test_get_revision_graph_merges_ghosts(self):
284
# when we ask for the revision graph for B, which
285
# is in repo 1 with a ghost of A, and which is not
286
# in repo 2, which has A, the revision_graph()
287
# should return A and B both.
288
tree_1 = self.make_branch_and_tree('1')
289
tree_1.set_parent_ids(['A'], allow_leftmost_as_ghost=True)
290
tree_1.commit('foo', rev_id='B', allow_pointless=True)
291
tree_2 = self.make_branch_and_tree('2')
292
tree_2.commit('bar', rev_id='A', allow_pointless=True)
293
source = self.applyDeprecated(one_three,
294
MultipleRevisionSources, tree_1.branch.repository,
295
tree_2.branch.repository)
296
# get_revision_graph calls the deprecated
297
# get_revision_graph_with_ghosts once for each repository.
298
expected_warning = symbol_versioning.deprecation_string(
299
tree_1.branch.repository.get_revision_graph_with_ghosts,
301
rev_graph = self.callDeprecated([expected_warning, expected_warning],
302
source.get_revision_graph, 'B')
303
self.assertEqual({'B':['A'],
307
class TestReservedId(TestCase):
309
def test_is_reserved_id(self):
310
self.assertEqual(True, revision.is_reserved_id(NULL_REVISION))
311
self.assertEqual(True, revision.is_reserved_id(
312
revision.CURRENT_REVISION))
313
self.assertEqual(True, revision.is_reserved_id('arch:'))
314
self.assertEqual(False, revision.is_reserved_id('null'))
315
self.assertEqual(False, revision.is_reserved_id(
316
'arch:a@example.com/c--b--v--r'))
317
self.assertEqual(False, revision.is_reserved_id(None))
320
class TestRevisionMethods(TestCase):
322
def test_get_summary(self):
323
r = revision.Revision('1')
325
self.assertEqual('a', r.get_summary())
327
self.assertEqual('a', r.get_summary())
329
self.assertEqual('a', r.get_summary())
331
def test_get_apparent_author(self):
332
r = revision.Revision('1')
334
self.assertEqual('A', r.get_apparent_author())
335
r.properties['author'] = 'B'
336
self.assertEqual('B', r.get_apparent_author())
added
removed
bzrlib/tests/test_revision.py
